pith. sign in

arxiv: 2604.03265 · v1 · submitted 2026-03-14 · 💻 cs.GL · cs.CL· cs.CY· cs.DC

On the First Computer Science Research Paper in an Indian Language and the Future of Science in Indian Languages

Siddhartha Visveswara Jayanti This is my paper

Pith reviewed 2026-05-15 12:16 UTC · model grok-4.3

classification 💻 cs.GL cs.CLcs.CYcs.DC
keywords TeluguIndian languagescomputer sciencescientific terminologySanskrit grammardistributed computingtypesettingepistemic logic
0
0 comments X

The pith

The first original computer science research paper in Telugu introduces a technique for proving lower bounds on multiprocessor algorithms via epistemic logic.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper recounts the creation of the first modern computer science article written entirely in Telugu, an Indian language spoken by about 100 million people. It explains how technical terms for algorithms, distributed computing, and discrete mathematics were coined by adapting the productive grammar rules from Sanskrit, and how a custom typesetting system was built to handle mathematical notation in Telugu script. The author uses this experience to outline a path for expanding original scientific writing across Indic languages whose speakers total more than one billion. A reader would care because the work shows that advanced technical arguments need not be confined to English and can instead draw on long-established linguistic resources for precision.

Core claim

An original paper on proving epistemic-logic lower bounds for multiprocessor algorithms was produced entirely in Telugu by deriving precise native terminology through Pāṇinian Sanskrit grammar and by implementing a new XeLaTeX template called TeluguTeX for mathematical typesetting, thereby demonstrating that rigorous computer science research can be conducted and expressed in an Indian language.

What carries the argument

Derivation of scientific terminology from the Pāṇinian grammar of Sanskrit to create exact native equivalents for concepts in algorithms and logic, together with the TeluguTeX template that enables mathematical typesetting in Telugu script.

Load-bearing premise

That the newly coined terminology is rigorous enough to carry formal proofs and that the author's personal knowledge suffices to establish this paper as the first such work in any Indian language.

What would settle it

Discovery of any earlier original computer science research paper written entirely in Telugu or another Indian language, or a technical review showing that the Sanskrit-derived terms cannot support the required epistemic logic arguments.

read the original abstract

I describe my experience writing the first original, modern Computer Science research paper expressed entirely in an Indian language. The paper is in Telugu, a language with approximately 100 million speakers. The paper is in the field of distributed computing and it introduces a technique for proving epistemic logic based lower bounds for multiprocessor algorithms. A key hurdle to writing the paper was developing technical terminology for advanced computer science concepts, including those in algorithms, distributed computing, and discrete mathematics. I overcame this challenge by deriving and coining native language scientific terminology through the powerful, productive, P\=aninian grammar of Samskrtam. The typesetting of the paper was an additional challenge, since mathematical typesetting in Telugu is underdeveloped. I overcame this problem by developing a Telugu XeLaTeX template, which I call TeluguTeX. Leveraging this experience of writing an original computer science research paper in an Indian language, I lay out a vision for how to ameliorate the state of scientific writing at all levels in Indic languages -- languages whose native speakers exceed one billion people -- through the further development of the Sanskrit technical lexicon and through technological internationalization.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 2 minor

Summary. The manuscript is an experience report describing the author's creation of what is claimed to be the first original modern computer science research paper written entirely in Telugu. It focuses on distributed computing and introduces a technique for proving epistemic logic-based lower bounds for multiprocessor algorithms. The author details challenges in coining technical terminology via Pāṇinian grammar from Sanskrit and in mathematical typesetting, which were addressed by developing a Telugu XeLaTeX template called TeluguTeX. The paper concludes with a vision for advancing scientific writing in Indic languages through expanded Sanskrit technical lexicon and technological internationalization.

Significance. If the primacy claim and the novelty of the epistemic-logic technique could be externally verified, the work would offer a concrete example of conducting advanced CS research in a non-English language with over 100 million speakers, potentially informing efforts to broaden scientific participation among the billion-plus speakers of Indic languages. As presented, however, the manuscript functions primarily as an inspirational account rather than a technical contribution, with limited direct impact on distributed computing or formal language development.

major comments (3)
  1. Abstract: The central claim that the Telugu paper is 'the first original, modern Computer Science research paper expressed entirely in an Indian language' rests solely on the author's personal narrative without any cited systematic literature search of arXiv, Google Scholar, DBLP, or Indian-language academic repositories. This absence of external confirmation makes the primacy assertion unverifiable from the manuscript alone.
  2. Abstract: The introduced technique for proving epistemic logic-based lower bounds for multiprocessor algorithms is described only at a high level; no formal statement, proof sketch, or technical details appear in the English manuscript, rendering the technical contribution impossible to evaluate independently.
  3. Abstract: The assertion that terminology derived via Pāṇinian grammar qualifies as rigorous and original scientific language for advanced CS concepts (algorithms, distributed computing, discrete mathematics) is stated without providing even a single example of a coined term, its Sanskrit root, or its mapping to the corresponding English concept.
minor comments (2)
  1. The description of the TeluguTeX template and its role in overcoming typesetting limitations mentions no availability details, source code, or usage examples, which would be useful for readers interested in replicating the approach.
  2. Notation such as 'Pāṇinian' and 'Samskrtam' appears inconsistently rendered; standardizing transliteration throughout would improve readability.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for their detailed and constructive comments on our experience report. We address each major comment below and will revise the manuscript accordingly to improve verifiability and clarity while maintaining its focus as a narrative of the process rather than a full technical exposition.

read point-by-point responses

  1. Referee: Abstract: The central claim that the Telugu paper is 'the first original, modern Computer Science research paper expressed entirely in an Indian language' rests solely on the author's personal narrative without any cited systematic literature search of arXiv, Google Scholar, DBLP, or Indian-language academic repositories. This absence of external confirmation makes the primacy assertion unverifiable from the manuscript alone.

    Authors: We acknowledge that the manuscript does not detail the searches performed. Prior to writing, the author conducted searches across arXiv, Google Scholar, DBLP, and available Indian-language repositories, finding no prior original modern CS research papers in any Indian language. In revision, we will add a paragraph describing these searches (including keywords and repositories checked) and qualify the claim as 'to the best of our knowledge' to enhance verifiability. We note that exhaustive proof of primacy across all non-indexed regional publications is inherently difficult, but the added details will provide the strongest available support. revision: yes

  2. Referee: Abstract: The introduced technique for proving epistemic logic-based lower bounds for multiprocessor algorithms is described only at a high level; no formal statement, proof sketch, or technical details appear in the English manuscript, rendering the technical contribution impossible to evaluate independently.

    Authors: This English manuscript is an experience report on the challenges and process of producing the Telugu paper, not a venue for presenting its technical results. The full formal statements, proofs, and details reside in the original Telugu work. To address the concern, we will add a new section providing a high-level overview of the technique along with a concise proof sketch, while explicitly referencing the Telugu paper for complete technical content. revision: yes

  3. Referee: Abstract: The assertion that terminology derived via Pāṇinian grammar qualifies as rigorous and original scientific language for advanced CS concepts (algorithms, distributed computing, discrete mathematics) is stated without providing even a single example of a coined term, its Sanskrit root, or its mapping to the corresponding English concept.

    Authors: We agree that concrete examples would strengthen the discussion. In the revised manuscript, we will include a table with at least three specific examples of coined terms, their derivation via Pāṇinian grammar from Sanskrit roots, and direct mappings to the corresponding English CS concepts, with brief explanations of their technical appropriateness. revision: yes

Circularity Check

0 steps flagged

No circularity detected; narrative is self-contained personal account

full rationale

The paper is a first-person description of authoring an original CS research paper in Telugu on epistemic logic lower bounds for multiprocessor algorithms, including terminology development via Pāṇinian grammar and creation of TeluguTeX. The central claim of primacy is presented as a direct statement of the author's experience rather than any derived result, equation, or fitted parameter. No self-citations, uniqueness theorems, ansatzes, or renamings of known results appear that would reduce the content to its own inputs by construction. The forward-looking vision for Indic scientific writing is independent of the primacy assertion and does not rely on circular logic.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

This is an experience report and vision paper with no formal derivations, so the ledger contains no free parameters, axioms, or invented entities.

pith-pipeline@v0.9.0 · 5504 in / 1045 out tokens · 29391 ms · 2026-05-15T12:16:26.733801+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

  1. [1]

    Internationalized domain names for applications (idna), 2003

    work page 2003

  2. [2]

    Summary by language size. 2022

    work page 2022

  3. [3]

    LipikaIME

    Ranganath Atreya. LipikaIME. https://github.com/ratreya/lipika-ime, 2025. Accessed: 6 August 2025

    work page 2025

  4. [4]

    Unicode 88, 1988

    Joseph D Becker. Unicode 88, 1988

    work page 1988

  5. [5]

    సామాన్య జాగృతిపరిషా్కరం

    సిదా్ధర్థవిశే్వశ్వర జయంతి. సామాన్య జాగృతిపరిషా్కరం. ఆరైϓవ్, ౨౦౨౨

    work page

  6. [6]

    Cormen, Charles E

    Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms . MIT Press, 3 edition, 2009. Commonly known as CLRS

    work page 2009

  7. [7]

    Much ado about nothing: ancient indian text contains earliest zero symbol

    Hannah Devlin. Much ado about nothing: ancient indian text contains earliest zero symbol. The Guardian , september 2017

    work page 2017

  8. [8]

    Connectit: A framework for static and incremental parallel graph connectivity algorithms

    Laxman Dhulipala, Changwan Hong, and Julian Shun. Connectit: A framework for static and incremental parallel graph connectivity algorithms. Proc. VLDB Endow. , 2020

    work page 2020

  9. [9]

    Google graph-mining

    Google-Graph-Mining-Team. Google graph-mining. https://github.com/google/graph-mining, 2023

    work page 2023

  10. [10]

    C-17 population by bilingualism and trilin- gualism

    Ministry of Home Affairs Government of India. C-17 population by bilingualism and trilin- gualism. 2011 Census of India , 2019

    work page 2011

  11. [11]

    National education policy

    Ministry of Human Resource Development Government of India. National education policy

    work page

  12. [12]

    Exploring the design space of static and incremental graph connectivity algorithms on gpus

    Changwan Hong, Laxman Dhulipala, and Julian Shun. Exploring the design space of static and incremental graph connectivity algorithms on gpus. Proceedings of the ACM International Conference on Parallel Architectures and Compilation Techniques , 2020. 14

    work page 2020

  13. [13]

    Tarjan, and Enric Boix-Adserà

    Siddhartha Jayanti, Robert E. Tarjan, and Enric Boix-Adserà. Randomized concurrent set union and generalized wake-up. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) , 2019

    work page 2019

  14. [14]

    Jayanti and Robert E

    Siddhartha V. Jayanti and Robert E. Tarjan. Concurrent disjoint set union. Distributed Computing, 2021

    work page 2021

  15. [15]

    Generalized wake-up: Amortized shared memory lower bounds for linearizable data structures

    Siddhartha Visveswara Jayanti. Generalized wake-up: Amortized shared memory lower bounds for linearizable data structures

    work page

  16. [16]

    Simple, Fast, Scalable, and Reliable Multiprocessor Algo- rithms

    Siddhartha Visveswara Jayanti. Simple, Fast, Scalable, and Reliable Multiprocessor Algo- rithms. PhD thesis, Massachusetts Institute of Technology (MIT), 2022

    work page 2022

  17. [17]

    Gaṇita-Yukti-Bhāṣā (Rationales in Mathematical Astronomy) of Jyeṣṭhadeva

    Jyeṣṭhadeva. Gaṇita-Yukti-Bhāṣā (Rationales in Mathematical Astronomy) of Jyeṣṭhadeva . Sources and Studies in the History of Mathematics and Physical Sciences. Springer, 2008

    work page 2008

  18. [18]

    The Imperishable Seed: How Hindu Mathematics Changed the World and why this History was Erased

    Bhaskar Kamble. The Imperishable Seed: How Hindu Mathematics Changed the World and why this History was Erased . Garuda Prakashan, 2022

    work page 2022

  19. [19]

    Kattimani, Krishna Mohan Tripathy, Mazhar Asif, M.K

    K Kasturirangan, Vasudha Kamat, Manjul Bhargava, Ram Shankar Kureel, T.V. Kattimani, Krishna Mohan Tripathy, Mazhar Asif, M.K. Sridhar, and Shakila T. Shamsu. Draft national education policy 2019, 2019

    work page 2019

  20. [20]

    Xetex - unicode-based tex code, 2018

    Jonathan Kew. Xetex - unicode-based tex code, 2018

    work page 2018

  21. [21]

    Āndhra śabda cintāmaṇi

    Nannayya. Āndhra śabda cintāmaṇi . Around the 11th Century CE

    work page

  22. [22]

    Language

    India Office of the Registrar General. Language. 2011 Census of India , 2011

    work page 2011

  23. [23]

    Chandaḥśāstra

    Pingala. Chandaḥśāstra. Around the 3rd Century BCE

    work page

  24. [24]

    Ashtādhyāyī

    Pānini. Ashtādhyāyī. Around the 6th Century BCE

    work page

  25. [25]

    Tamer Özsu

    Siddhartha Sahu, Amine Mhedhbi, Semih Salihoglu, Jimmy Lin, and M. Tamer Özsu. The ubiquity of large graphs and surprising challenges of graph processing: extended survey. VLDB J., 29(2-3):595–618, 2020

    work page 2020

  26. [26]

    Do you speak telugu? welcome to america

    Reality Check Team and BBC Telugu. Do you speak telugu? welcome to america. 2018

    work page 2018

  27. [27]

    English-Sanskrit Computer Dictionary (Āṅglasaṃskṛtasaṅgaṇakaśab- dakośaḥ)

    Shrinivasa Varakhedi. English-Sanskrit Computer Dictionary (Āṅglasaṃskṛtasaṅgaṇakaśab- dakośaḥ). Osmania University, Hyderabad, India, 2020

    work page 2020

  28. [28]

    The Great English-Indian Dictionary

    Raghu Vira. The Great English-Indian Dictionary . Number v. 15 in Sarasbati vihara series. International Academy of Indian Culture, 1944

    work page 1944

  29. [29]

    वृत्तजाितसमुच्चया (Vrttajatisamuccaya), volume 61 of Rajasthan Puratana Granthamala

    Virahanka. वृत्तजाितसमुच्चया (Vrttajatisamuccaya), volume 61 of Rajasthan Puratana Granthamala. Government of Rajasthan, 1962. 15

    work page 1962