Dating the Bṛhadāraṇyaka Upaniṣad by a linguistic clock: a pre-registered blind-gate failure

This paper reports a pre-registered attempt to date the Bṛhadāraṇyaka Upaniṣad with a linguistic clock, and it reports a failure. Before any dating was attempted, the pipeline was required to pass a blind benchmark: recover the dates of independently anchored control texts within its own stated 95% intervals, and correctly order the Vedic strata. It passed neither gate. The absolute gate returned 0 of 17 control texts against a registered bar of at least 15; the ordering gate returned Kendall's τ = 0.000 against a registered bar of τ ≥ 0.80, with 15 macro-stratum inversions; and an identity check separated two transmissions of the same passage by 147 years at the median. Under the pre-registration, no date for the Bṛhadāraṇyaka was therefore produced: no posterior for the text was computed, the sealed comparator values were never opened, and the fusion stage was cancelled. The paper reports the failure in full — the gate results, their decomposition, and a diagnosis that exonerates the sampler and identifies the model class, a single time branch that forces register to impersonate date, as the point of failure. A successor attempt would require a background/register branch, and that would be a new registration, not a repair of this one. Keywords: Bṛhadāraṇyaka Upaniṣad; Sanskrit; linguistic dating; Bayesian model; pre-registration; registered report; negative result; blind benchmark

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24409364
Primary Topic
Digital Humanities and Scholarship
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Dating the Bṛhadāraṇyaka Upaniṣad by a linguistic clock: a pre-registered blind-gate failure

Atharva Chourey
Zenodo (CERN European Organization for Nuclear Research)
Digital Humanities and Scholarship
preprint

Dating the Bṛhadāraṇyaka Upaniṣad by a linguistic clock: a pre-registered blind-gate failure

Atharva Chourey
preprint en

Abstract

This paper reports a pre-registered attempt to date the Bṛhadāraṇyaka Upaniṣad with a linguistic clock, and it reports a failure. Before any dating was attempted, the pipeline was required to pass a blind benchmark: recover the dates of independently anchored control texts within its own stated 95% intervals, and correctly order the Vedic strata. It passed neither gate. The absolute gate returned 0 of 17 control texts against a registered bar of at least 15; the ordering gate returned Kendall's τ = 0.000 against a registered bar of τ ≥ 0.80, with 15 macro-stratum inversions; and an identity check separated two transmissions of the same passage by 147 years at the median. Under the pre-registration, no date for the Bṛhadāraṇyaka was therefore produced: no posterior for the text was computed, the sealed comparator values were never opened, and the fusion stage was cancelled. The paper reports the failure in full — the gate results, their decomposition, and a diagnosis that exonerates the sampler and identifies the model class, a single time branch that forces register to impersonate date, as the point of failure. A successor attempt would require a background/register branch, and that would be a new registration, not a repair of this one. Keywords: Bṛhadāraṇyaka Upaniṣad; Sanskrit; linguistic dating; Bayesian model; pre-registration; registered report; negative result; blind benchmark

Zenodo (CERN European Organization for Nuclear Research)
Digital Humanities and Scholarship
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon