Datasets:
id stringlengths 5 8 | lang stringclasses 6
values | kind stringclasses 14
values | question stringlengths 5 53 | why stringlengths 36 231 | expect unknown |
|---|---|---|---|---|---|
it-01 | it | evaluate | quanto fa 1/2 + 1/3 | evaluate verb phrase quanto fa; both readers know it, math answers 5/6 | {
"state": "AGREED",
"sentence": "evaluate 1/2 + 1/3",
"answer_contains": "5/6",
"min_assurance": 2,
"referee_clean": true
} |
it-02 | it | prove | dimostra che x^2 + 1 > 0 | prove verb dimostra with the complementiser che | {
"state": "AGREED",
"sentence": "prove x^2 + 1 > 0",
"min_assurance": 2,
"referee_clean": true
} |
it-04 | it | solve | risolvi x^2 - 5*x + 6 = 0 per x | solve verb risolvi with the for marker per; math answers the two roots | {
"state": "AGREED",
"sentence": "solve x^2 - 5*x + 6 = 0 for x",
"answer_contains": "{2, 3}",
"min_assurance": 2,
"referee_clean": true
} |
it-05 | it | det | il determinante di [[1, 2], [3, 4]] | noun-first construct pattern; math answers -2 | {
"state": "AGREED",
"sentence": "det [[1, 2], [3, 4]]",
"answer_contains": "-2",
"min_assurance": 2,
"referee_clean": true
} |
it-06 | it | inverse | la matrice inversa di [[2, 0], [0, 2]] | inverse verb inversa inside the la matrice ... di frame, whose filler word matrice is a word of the variety because the pattern writes it | {
"state": "AGREED",
"sentence": "inverse [[2, 0], [0, 2]]",
"min_assurance": 2,
"referee_clean": true
} |
it-07 | it | maximize | massimizza 3*x + 4*y sotto i vincoli x + y <= 10 | maximize verb with the subject to variant sotto i vincoli; the math stratum reads the problem and answers that the objective improves without limit | {
"state": "AGREED",
"sentence": "maximize 3*x + 4*y subject to x + y <= 10",
"min_assurance": 2,
"referee_clean": true
} |
it-08 | it | integral | l'integrale di 3*x^2 da 0 a 2 | integral with the from marker da and the to marker a; math answers 8 | {
"state": "AGREED",
"sentence": "integral 3*x^2 from 0 to 2",
"answer_contains": "8",
"min_assurance": 2,
"referee_clean": true
} |
it-09 | it | negative | glorifram zepivardo frumeta | latin gibberish: no announce verb and no known word, the layer must not guess | {
"state": "NOT COVERED",
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
it-10 | it | negative | dimostra che x e uguale a y | the connective e for and collides with the equality phrase e uguale a in one gap | {
"max_assurance": 2,
"referee_clean": true
} |
it-11 | it | negative | il determinante di [1, 2], [3, 4] | the det pattern is there but the matrix is not written in double brackets | {
"state": "NOT COVERED",
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
it-12 | it | passthrough | solve x^2 - 5*x + 6 = 0 for x | the question is already a sentence of the math language: nothing is translated | {
"state": "PASSTHROUGH",
"sentence": "solve x^2 - 5*x + 6 = 0 for x",
"answer_contains": "{2, 3}",
"min_assurance": 2,
"referee_clean": true
} |
en-01 | en | evaluate | what is the value of 7/3 - 7/3 * 3 | evaluate verb phrase what is the value of; math answers 0 | {
"state": "AGREED",
"sentence": "evaluate 7/3 - 7/3 * 3",
"min_assurance": 2,
"referee_clean": true
} |
en-02 | en | provez | show that x + x = 2*x over the integers | provez verb show that with the over Z phrase over the integers | {
"state": "AGREED",
"sentence": "prove x + x = 2*x over Z",
"answer_contains": "proved",
"min_assurance": 2,
"referee_clean": true
} |
en-03 | en | solve | for x solve 2*x + 3 = 11 | fronted for marker: the variable is named before the verb, and both readers must rotate the frame rather than fill the slots by position | {
"state": "AGREED",
"sentence": "solve 2*x + 3 = 11 for x",
"answer_contains": "{4}",
"min_assurance": 2,
"referee_clean": true
} |
en-04 | en | solvez | solve n mod 3 = 1 for n over the integers | solvez frame: the same solve verb plus the integer domain | {
"state": "AGREED",
"sentence": "solve n mod 3 = 1 for n over Z",
"min_assurance": 2,
"referee_clean": true
} |
en-05 | en | derivative | differentiate x^3 + 2*x with respect to x | derivative verb with the wrt phrase with respect to | {
"state": "AGREED",
"sentence": "derivative x^3 + 2*x wrt x",
"min_assurance": 2,
"referee_clean": true
} |
en-06 | en | rank | what is the rank of [[1, 2, 3], [4, 5, 6]] | rank noun inside what is the rank of; math answers 2 | {
"state": "AGREED",
"sentence": "rank [[1, 2, 3], [4, 5, 6]]",
"answer_contains": "2",
"min_assurance": 2,
"referee_clean": true
} |
en-07 | en | minimize | the minimum of 2*x + 3*y subject to x + y = 1 | the minimum of pattern with the subject to marker: a canonical sentence would pass through untranslated, so this one must be read | {
"state": "AGREED",
"sentence": "minimize 2*x + 3*y subject to x + y = 1",
"min_assurance": 2,
"referee_clean": true
} |
en-08 | en | integral | integrate x^2 from 0 to 3 with respect to x | integral frame with from, to and the wrt phrase; math answers 9 | {
"state": "AGREED",
"sentence": "integral x^2 from 0 to 3 wrt x",
"answer_contains": "9",
"min_assurance": 2,
"referee_clean": true
} |
en-09 | en | negative | risolvi x^2 - 5*x + 6 = 0 for x | an Italian solve verb inside an English frame: the English reader must not read it | {
"max_assurance": 2,
"referee_clean": true
} |
en-10 | en | passthrough | derivative x^3 wrt x | a canonical sentence using the wrt joint: pass through with nothing translated | {
"state": "PASSTHROUGH",
"sentence": "derivative x^3 wrt x",
"min_assurance": 2,
"referee_clean": true
} |
es-01 | es | evaluate | cuánto vale 12345679 * 9 | evaluate verb phrase cuanto vale; math answers 111111111 | {
"state": "AGREED",
"sentence": "evaluate 12345679 * 9",
"answer_contains": "111111111",
"min_assurance": 2,
"referee_clean": true
} |
es-02 | es | prove | demuestra que x^2 + 1 > 0 | prove verb demuestra with the complementiser que | {
"state": "AGREED",
"sentence": "prove x^2 + 1 > 0",
"min_assurance": 2,
"referee_clean": true
} |
es-03 | es | solve | para x resuelve 2*x + 3 = 11 | fronted for marker para: the variable comes before the verb | {
"state": "AGREED",
"sentence": "solve 2*x + 3 = 11 for x",
"min_assurance": 2,
"referee_clean": true
} |
es-04 | es | solvez | resuelve n mod 3 = 1 para n en los números enteros | solvez with the accented over Z variant | {
"state": "AGREED",
"sentence": "solve n mod 3 = 1 for n over Z",
"min_assurance": 2,
"referee_clean": true
} |
es-05 | es | derivative | la derivada de 3*x^2 con respecto a x | noun-first derivative pattern with the wrt phrase con respecto a | {
"state": "AGREED",
"sentence": "derivative 3*x^2 wrt x",
"min_assurance": 2,
"referee_clean": true
} |
es-06 | es | det | el determinante de [[3, 1], [2, 4]] | noun-first construct pattern; math answers 10 | {
"state": "AGREED",
"sentence": "det [[3, 1], [2, 4]]",
"answer_contains": "10",
"min_assurance": 2,
"referee_clean": true
} |
es-07 | es | inverse | invierte [[1, 2], [3, 4]] | imperative of the inverse verb in the bare invierte M pattern | {
"state": "AGREED",
"sentence": "inverse [[1, 2], [3, 4]]",
"min_assurance": 2,
"referee_clean": true
} |
es-08 | es | minimize | minimiza 2*x + 3*y sujeto a x + y = 1 | minimize verb with the subject to marker sujeto a | {
"state": "AGREED",
"sentence": "minimize 2*x + 3*y subject to x + y = 1",
"min_assurance": 2,
"referee_clean": true
} |
zh-01 | zh | evaluate | 计算 1/2 + 1/3 | evaluate verb in the verb then term pattern | {
"state": "AGREED",
"sentence": "evaluate 1/2 + 1/3",
"answer_contains": "5/6",
"min_assurance": 2,
"referee_clean": true
} |
zh-02 | zh | prove | 证明 x^2 + 1 > 0 | prove verb in the bare prove pattern | {
"state": "AGREED",
"sentence": "prove x^2 + 1 > 0",
"min_assurance": 2,
"referee_clean": true
} |
zh-03 | zh | provez | 证明 x + x = 2*x 在整数上 | provez with the over Z marker meaning over the integers | {
"state": "AGREED",
"sentence": "prove x + x = 2*x over Z",
"answer_contains": "proved",
"min_assurance": 2,
"referee_clean": true
} |
zh-04 | zh | solve | 对 x 求解 x^2 - 5*x + 6 = 0 | fronted for marker before the solve verb | {
"state": "AGREED",
"sentence": "solve x^2 - 5*x + 6 = 0 for x",
"answer_contains": "{2, 3}",
"min_assurance": 2,
"referee_clean": true
} |
zh-05 | zh | derivative | 求 x^3 + 2*x 关于 x 的 导数 | derivative noun with the wrt marker and the noise particle | {
"state": "AGREED",
"sentence": "derivative x^3 + 2*x wrt x",
"min_assurance": 2,
"referee_clean": true
} |
zh-06 | zh | integral | 求 3*x^2 从 0 到 2 的 积分 | integral noun with the from and to markers; math answers 8 | {
"state": "AGREED",
"sentence": "integral 3*x^2 from 0 to 2",
"answer_contains": "8",
"min_assurance": 2,
"referee_clean": true
} |
zh-07 | zh | rank | 求 [[1, 2, 3], [4, 5, 6]] 的 秩 | rank noun in the matrix then particle then rank pattern | {
"state": "AGREED",
"sentence": "rank [[1, 2, 3], [4, 5, 6]]",
"answer_contains": "2",
"min_assurance": 2,
"referee_clean": true
} |
zh-08 | zh | maximize | 最大化 3*x + 4*y 约束 x + y <= 10 | maximize verb with the short subject to marker; the math stratum answers unbounded | {
"state": "AGREED",
"sentence": "maximize 3*x + 4*y subject to x + y <= 10",
"min_assurance": 2,
"referee_clean": true
} |
zh-09 | zh | negative | 喵叽咕噗噜 | cjk gibberish: no verb and no noise character of the lexicon | {
"state": "NOT COVERED",
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
zh-10 | zh | negative | 求 从 0 到 2 的 积分 | the integral frame carries the from and to joints but the integrand slot is empty | {
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
hi-01 | hi | evaluate | गणना करें 1/2 + 1/3 | evaluate verb in the verb first pattern | {
"state": "AGREED",
"sentence": "evaluate 1/2 + 1/3",
"answer_contains": "5/6",
"min_assurance": 2,
"referee_clean": true
} |
hi-02 | hi | prove | सिद्ध करें x^2 + 1 > 0 | prove verb in the verb first prove pattern | {
"state": "AGREED",
"sentence": "prove x^2 + 1 > 0",
"min_assurance": 2,
"referee_clean": true
} |
hi-03 | hi | solve | x^2 - 5*x + 6 = 0 के लिए x हल करें | verb final solve order: formula, for marker, variable, verb | {
"state": "AGREED",
"sentence": "solve x^2 - 5*x + 6 = 0 for x",
"answer_contains": "{2, 3}",
"min_assurance": 2,
"referee_clean": true
} |
hi-04 | hi | solvez | हल करें n mod 3 = 1 के लिए n पूर्णांकों में | solvez with the for marker and the over Z variant | {
"state": "AGREED",
"sentence": "solve n mod 3 = 1 for n over Z",
"min_assurance": 2,
"referee_clean": true
} |
hi-05 | hi | derivative | 3*x^2 का x के सापेक्ष अवकलज | the genitive particle का separates the integrand from the variable without being a joint, so reader A reads the postpositional frame and reader B abstains: one reading only, so the assurance stops at 1 and the answer is still given | {
"state": "SINGLE",
"sentence": "derivative 3*x^2 wrt x",
"answer_contains": "6*x",
"max_assurance": 1,
"referee_clean": true
} |
hi-06 | hi | det | [[1, 2], [3, 4]] का सारणिक | det noun in the matrix then particle then rank pattern | {
"state": "AGREED",
"sentence": "det [[1, 2], [3, 4]]",
"answer_contains": "-2",
"min_assurance": 2,
"referee_clean": true
} |
hi-07 | hi | inverse | व्युत्क्रम बताइए [[2, 0], [0, 2]] | inverse noun with the tell me pattern | {
"state": "AGREED",
"sentence": "inverse [[2, 0], [0, 2]]",
"min_assurance": 2,
"referee_clean": true
} |
hi-08 | hi | minimize | न्यूनतम करें 2*x + 3*y के अधीन x + y = 1 | minimize verb with the subject to marker meaning subject to | {
"state": "AGREED",
"sentence": "minimize 2*x + 3*y subject to x + y = 1",
"min_assurance": 2,
"referee_clean": true
} |
hi-09 | hi | negative | झुगपट गैंवूलो डठकू | devanagari gibberish: no verb and no noise word of the lexicon | {
"state": "NOT COVERED",
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
hi-10 | hi | integral | समाकलन करें 3*x^2 का 0 से 2 तक | postpositional from and to markers with the genitive particle: reader A knows this order, reader B abstains, so only one reading stands and the assurance stops at 1 | {
"state": "SINGLE",
"sentence": "integral 3*x^2 from 0 to 2",
"answer_contains": "8",
"max_assurance": 1,
"referee_clean": true
} |
ar-01 | ar | evaluate | احسب قيمة 1/2 + 1/3 | evaluate verb in the compute the value of pattern | {
"state": "AGREED",
"sentence": "evaluate 1/2 + 1/3",
"answer_contains": "5/6",
"min_assurance": 2,
"referee_clean": true
} |
ar-02 | ar | prove | أثبت أن x^2 + 1 > 0 | prove verb with the that complementiser | {
"state": "AGREED",
"sentence": "prove x^2 + 1 > 0",
"min_assurance": 2,
"referee_clean": true
} |
ar-03 | ar | provez | أثبت x + x = 2*x على أعداد صحيحة | provez with the over Z variant meaning over the integers | {
"state": "AGREED",
"sentence": "prove x + x = 2*x over Z",
"answer_contains": "proved",
"min_assurance": 2,
"referee_clean": true
} |
ar-04 | ar | solve | حل x^2 - 5*x + 6 = 0 إيجاد x | solve verb with the for marker: the same word also names the find verb, which is why the readers must agree here | {
"state": "AGREED",
"sentence": "solve x^2 - 5*x + 6 = 0 for x",
"answer_contains": "{2, 3}",
"min_assurance": 2,
"referee_clean": true
} |
ar-05 | ar | integral | تكامل 3*x^2 من 0 إلى 2 | integral noun with the from and to markers; math answers 8 | {
"state": "AGREED",
"sentence": "integral 3*x^2 from 0 to 2",
"answer_contains": "8",
"min_assurance": 2,
"referee_clean": true
} |
ar-06 | ar | rank | رتبة [[1, 2, 3], [4, 5, 6]] | rank noun in the bare construct pattern | {
"state": "AGREED",
"sentence": "rank [[1, 2, 3], [4, 5, 6]]",
"answer_contains": "2",
"min_assurance": 2,
"referee_clean": true
} |
ar-07 | ar | inverse | معاكسة [[1, 2], [3, 4]] | inverse noun in the bare construct pattern | {
"state": "AGREED",
"sentence": "inverse [[1, 2], [3, 4]]",
"min_assurance": 2,
"referee_clean": true
} |
ar-08 | ar | maximize | عظم 3*x + 4*y شرط x + y <= 10 | maximize verb with the short subject to marker; the math stratum answers unbounded | {
"state": "AGREED",
"sentence": "maximize 3*x + 4*y subject to x + y <= 10",
"min_assurance": 2,
"referee_clean": true
} |
ar-09 | ar | negative | شقطبي ملموغ قلفوص | arabic gibberish: no announce verb and no known word | {
"state": "NOT COVERED",
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
ar-10 | ar | negative | احسب قيمة xrqt3 + 1/3 | valid evaluate pattern but a latin gibberish symbol inside the math slot: the math layer refuses, so no answer | {
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
ar-11 | ar | evaluate | احسب ١/٢ + ١/٣ | Arabic-Indic digits as the Arabic lexicon itself writes them: segment normalises them to ASCII, so this is the same problem as ar-01 | {
"state": "AGREED",
"sentence": "evaluate 1/2 + 1/3",
"answer_contains": "5/6",
"min_assurance": 2,
"referee_clean": true
} |
mixed-01 | en | negative | solve 25 + x = 30 for x | full width digits inside a math sentence: normalisation turns them into ASCII, so the sentence is accepted | {
"max_assurance": 2,
"referee_clean": true
} |
mixed-02 | hi | negative | solve x^2 - 5*x + 6 = 0 for x | an English math sentence asked in Hindi: it passes through without any Hindi word | {
"state": "PASSTHROUGH",
"sentence": "solve x^2 - 5*x + 6 = 0 for x",
"answer_contains": "{2, 3}",
"min_assurance": 2,
"referee_clean": true
} |
mixed-03 | ar | negative | حل x^2 - 5*x + 6 = 0 per x | an Italian for marker inside an Arabic solve frame: the joint is not Arabic, so the variable slot stays empty | {
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
mixed-04 | zh | negative | 计算 1/2 + 1/3 hello world | a cjk evaluate frame followed by latin noise: the trailing words are not part of any pattern | {
"max_assurance": 2,
"referee_clean": true
} |
mixed-05 | es | negative | demuestra que x^2 + 1 > 0حل | an Arabic verb glued to the end of a Spanish sentence with no space: no reader may invent a boundary | {
"max_assurance": 2,
"referee_clean": true
} |
it-03 | it | provez | dimostra che 2*x = x + x sugli interi | provez frame: the over Z marker sugli interi selects the integer domain | {
"state": "AGREED",
"sentence": "prove 2*x = x + x over Z",
"answer_contains": "proved",
"min_assurance": 2,
"referee_clean": true
} |
ar-12 | ar | provez | أثبت n^2 + n = n*(n + 1) على أعداد صحيحة | agreed reading, refused by the math stratum: powers over the integers are outside its formalizer | {
"state": "AGREED",
"sentence": "prove n^2 + n = n*(n + 1) over Z",
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
en-11 | en | provez | show that x^2 - 1 = (x + 1)*(x - 1) over the integers | agreed reading, refused by the math stratum: powers over the integers are outside its formalizer, so the stratum withholds the verdict | {
"state": "AGREED",
"sentence": "prove x^2 - 1 = (x + 1)*(x - 1) over Z",
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
en-12 | en | minimize | the minimum of x^2 + y^2 subject to x + y = 1 | agreed reading of a nonlinear objective: the math stratum says the problem is not linear, so the stratum lowers the assurance to match | {
"state": "AGREED",
"sentence": "minimize x^2 + y^2 subject to x + y = 1",
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
es-09 | es | minimize | minimiza x^2 + y^2 sujeto a x + y = 1 | agreed reading, nonlinear objective: the math stratum abstains and the stratum shows nothing | {
"state": "AGREED",
"sentence": "minimize x^2 + y^2 subject to x + y = 1",
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
hi-11 | hi | minimize | न्यूनतम करें x^2 + y^2 के अधीन x + y = 1 | agreed reading, nonlinear objective: the math stratum abstains and the stratum shows nothing | {
"state": "AGREED",
"sentence": "minimize x^2 + y^2 subject to x + y = 1",
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
it-13 | it | provez | dimostra che x^2 + 2*x + 1 = (x + 1)^2 sugli interi | the reading is agreed by both readers, but the math stratum refuses powers over the integers, so the stratum shows no assurance and no answer: the reading ceiling is never what lifts the verdict | {
"state": "AGREED",
"sentence": "prove x^2 + 2*x + 1 = (x + 1)^2 over Z",
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
zh-11 | zh | provez | 证明 n^2 + n = n*(n + 1) 在整数上 | agreed reading, refused by the math stratum: powers over the integers are outside its formalizer | {
"state": "AGREED",
"sentence": "prove n^2 + n = n*(n + 1) over Z",
"max_assurance": 0,
"no_answer": true,
"referee_clean": true
} |
- 1. What the stratum is, and what it refuses
- 2. The eight nodes
- 3. Two readers, one lexicon
- 4. Talking to the math stratum
- 5. The corpus
- 6. Commands
- 7. Limits that are written down, not hidden
- 8. Tests
- 9. Language policy
- 10. Putting this dataset back into a LingoLOGOS checkout
- 11. The corpus file
- 12. Loading it
- 13. Rights
- 14. Citation
LingoLOGOS math-stratum topology
A conversational layer over the math topology: a person asks in one of six written varieties, and
gets the answer of the math stratum back in that same language, at an assurance that includes the
fallibility of the reading. The layer never decides a problem and never raises a verdict; the only
direction it can move the assurance of the math stratum is down.
python tools/ask.py --lang it "risolvi x^2 - 5*x + 6 = 0 per x"
Reading state : AGREED
Assurance shown : 2 (reading ceiling 2, math assurance 3)
Math layer status : VERIFIED
Orchestrator Z3 check : 8 of 8 envelopes confirmed
Answer in the language of the question (italiano):
Stato: accordata: due lettori indipendenti piu il vincolo SMT
Problema capito (solve): solve x^2-5*x+6=0 for x
Risposta: {2, 3}
livello 2 di 3
strato matematico: VERIFIED
Controllo SMT dello strato : 8 di 8 buste confermate
This dataset is the math-stratum/ folder of the LingoLOGOS project published as it stands: 67 files,
code and data together, plus this card in place of their README. Only the standard library and
z3-solver are required, and pytest for the tests; both are named in requirements.txt. Every
command below is written from inside the folder. The mathematics is not part of this dataset: it lives
in the math bundle, published at https://huggingface.co/datasets/tailot/lingologos-math, and section
10 says how to point this folder at a copy of it.
1. What the stratum is, and what it refuses
The certainty of a translation cannot be verified the way the certainty of a proof can: there is no SMT check that says that a sentence of Hindi was read correctly. That is the definition this bundle works with, and it is why the topology is built the way it is: two readers that reach their sentence by different roads, an SMT claim about what each reading kept, a referee that rechecks every envelope, and a decision that is re-derived from the transcript instead of being trusted from the arbiter.
The rule the whole bundle exists to enforce:
assurance shown = min(assurance of the math stratum, ceiling of the reading)
| Reading state | ceiling | when |
|---|---|---|
AGREED |
2 | both readers produced the same sentence, and the math stratum is what decides it |
PASSTHROUGH |
2 | the question was already a sentence of the math language: nothing was translated |
SINGLE |
1 | one reader understood it and the other abstained: no witness, one level less |
DISPUTED |
0 | the two readers produced different sentences, or a reading lost a number: the math stratum is not even asked |
AMBIGUOUS |
0 | a reader reports that the question announces more than one problem, or leaves a slot with several readings: the person has to choose |
NOT COVERED |
0 | neither reader found anything: this variety does not say it in a covered way |
TAMPERED |
0 | the math stratum says it solved something other than the agreed sentence |
Three is never shown. Level three belongs to the math stratum, whose two formalizers and two checkers work on a sentence they wrote themselves; a sentence in a human language adds one fallible step before that, and this layer is that step.
The ceiling is not the only thing that holds on its own. The count of literals is checked on a lone
reading too: a reading that no longer holds the numbers the person wrote is a different problem, not a
weaker reading of the same one, and it ends DISPUTED even when it is the only reader that understood
the question. A single witness therefore answers at level one only when it kept every number.
2. The eight nodes
The session runs through the orchestrator (src/lingologos_orchestrator) with the same envelope
protocol as the math topology: a marker @@DOSSIER@@ inside payload.naturalLanguage, and
payload.smtConstraints carrying what each node claims about its own output, which the referee of
every node recomputes with Z3. The seed sits in the arbiter; maxTurns is the number of arcs.
| Node | What it does | The claim it carries |
|---|---|---|
reader_a |
reads the question against the frames written in the lexicon | the numerals of the question are still in my sentence |
reader_b |
reads it by following the joints of the math language | the same, independently |
equivalence |
proves the two sentences the same, slot by slot and then with SMT | not (A = B) is unsatisfiable |
coverage |
counts that every literal the person wrote survived into the sentence | conjunction of the element equalities |
invoker |
asks the math stratum, in a separate process, the agreed sentence | the sentence I sent equals the one that came back |
boundary |
checks the echo of the math stratum instead of trusting it | elementwise on the echo, or the empty claim |
adversary |
re-derives the bound and writes its negation | shown > ceiling is unsatisfiable |
arbiter |
runs the decision and renders the answer in the language of the question | the same inequality |
3. Two readers, one lexicon
read_a.py matches the shapes stored in lexicon/<lang>.json (patterns: one template per kind of
problem, with slots). read_b.py never looks at those shapes: it finds the verb that announces a
problem, then walks the joints of the math language (for, over Z, from ... to, subject to,
wrt) and cuts the slots out of the gaps between them. They share only the lexicon, the atomizer
(segment.py) and the templates of the math language (canonical.py).
That sharing is deliberate and it is also the known blind spot: a wrong description of a variety is
a wrong description for both readers, and the topology cannot see it. What shows it is the corpus of
section 5, whose questions were written and checked by a person. When the two readers disagree the
assurance goes down, never up: DISPUTED does not even consult the math stratum.
4. Talking to the math stratum
invoker.py is the only door. It launches python <root>/tools/solve.py --json <sentence> as a
separate process and reads its JSON verdict back; nothing in this folder imports the solver of the
math stratum to decide anything here. The referee then checks the echo: the sentence the math stratum
says it solved has to be the sentence the readers agreed on, otherwise the session is TAMPERED.
| Variable | Meaning |
|---|---|
LGSTRATUM_MATH_ROOT |
where the math bundle is (default: the sibling folder datasets/math) |
LGSTRATUM_MATH_BACKEND |
subprocess (default), or none to disable the math layer entirely |
LGSTRATUM_FAULTS |
comma separated node:fault pairs, experiments only |
A disabled math layer is not tampering: the reading stands, the assurance falls to zero because there is no math assurance to take the minimum with, and no answer is shown.
5. The corpus
problems/corpus.jsonl holds 73 questions: 12 kinds of problem in 6 varieties, plus items that mix
varieties, full width digits, unspelled matrices, gibberish, questions with an empty slot and
questions whose mathematics is out of reach of the math stratum. Each line carries what the answer
has to look like (state, sentence, answer_contains, min_assurance, max_assurance,
no_answer, referee_clean) and a why that says why, including the cases where the expected
outcome is an abstention.
Graded against the in-process pipeline: 73 of 73 rows agree with their gold (lgstratum/corpus.py
grades one row, tests/test_corpus.py runs all of them). With the math layer switched off the states
come out 57 AGREED, 2 SINGLE, 11 NOT COVERED, 3 PASSTHROUGH; tools/coverage_report.py writes
results/coverage.json and counts 57 questions read by both readers, 2 by reader_a alone and
14 by neither. Seven rows (it-13, en-11, en-12, es-09, zh-11, hi-11, ar-12) are agreed
readings on which the math stratum abstains: assurance 0 and no answer, which is the layer refusing to
add an availability it does not have. Two rows (hi-05, hi-10) stay at SINGLE, assurance 1, for the
reason in section 7.
6. Commands
python tools/ask.py --lang it "quanto fa 2+2?" # one session, eight processes
python tools/ask.py --lang en --json "solve x + 1 = 2 for x"
python tools/ask.py --lang ar --corpus problems/corpus.jsonl --limit 6
python tools/coverage_report.py --out results/coverage.json # which frames each variety carries
python tools/ablation.py --probe 12 --out results/ablation.json
tools/ask.py prints the verdict it re-derives from the transcript, not the one the arbiter wrote,
and exits with code 3 when that re-derivation disagrees with a node about its own envelope, with code
2 when the assurance is zero, and with code 1 in corpus mode when a gold expectation fails.
tools/ablation.py walks the configurations of the topology
one node at a time, injects every fault of the catalogue singly and in pairs, and reports each cell as
raised | lowered | masked | caught | abstained | silent_error: a cell counted raised is a violation
of the rule of section 1, and the tool exits 1 if any happened. A caught cell is one where an answer
was shown that the gold does not accept, but the session said so itself -- a claim fell to the referee
of its node, or the assurance sits below the honest one because the configuration lost a node.
On this checkout --probe 6 (one question per variety) fills 147 cells and 882 sessions, the
fault takes hold in 510 of them, and the totals are raised 0, lowered 0, silent_error 0,
caught 18, abstained 366, masked 126 -- about fifteen minutes. Nothing was ever raised above the
honest assurance, and the 18 caught cells all sit in the configuration without reader_b, where a
rubber stamped verification node cannot buy back the level the missing witness costs.
7. Limits that are written down, not hidden
- Two varieties place their joints after the slot instead of before it.
reader_bcannot cut the slots there, so those questions are read by one reader only and stay atSINGLE, assurance 1 (hi-05,hi-10).tools/coverage_report.pyshows them as one of two readers. - A missing written accent can collide with a connective:
qual e il determinante di ...is not read, because the folded copula is the same atom as the conjunctione. - The fragment of the math stratum is unchanged here: powers inside integer terms and non linear
programs end in
UNKNOWN, so the assurance is zero even when the reading is agreed. The corpus keeps those questions as probes (it-13,en-11,en-12,es-09,zh-11,hi-11,ar-12). - The two readers share their data, so a systematic error in the description of a variety is invisible to the topology and can only be found in the corpus.
8. Tests
From the repository root:
python -m pytest -q datasets/math-stratum/tests
The suite is 290 tests: 121 on the two readers against every row of the corpus, 79 on the corpus
itself, 38 on the pinned invariant, 14 on the topology file, 13 on the faults, 13 on the decision
table, 10 on the lexicons and 2 end-to-end sessions. It checks the topology file against the node
order, the shape and the completeness of the lexicons, both readers against the corpus, the decision
table, the faults, and every gold answer of the corpus; tests/test_pinned_invariant.py runs the same questions through every node
configuration and every fault and asserts that the verdict of the math stratum does not move, and
that nothing is ever shown above it. tests/test_orchestrator_e2e.py runs two real sessions through
the orchestrator and is skipped when lingologos_orchestrator is not importable. The corpus and the
invariant tests call the solver of the math stratum as subprocesses, which here means a copy of the
math dataset named by LGSTRATUM_MATH_ROOT (section 10); the suite took 3 minutes 52 seconds inside a
LingoLOGOS checkout, and the two end to end tests skip on their own when lingologos_orchestrator is
not importable.
Real sessions, measured: risolvi x^2 - 5*x + 6 = 0 per x comes back AGREED at assurance 2 against a
math assurance of 3, with 8 of 8 envelope claims confirmed by the referee of the session, and
python tools/ask.py --corpus problems/corpus.jsonl --limit 8 grades 8 of 8 real sessions against
gold. One question per variety outside Italian (zh-01, ar-01, hi-03, es-02) comes back the same
way: AGREED, assurance 2, the math stratum VERIFIED, 8 of 8 claims confirmed, nothing detected --
and the block the person reads is written in the language of the question (48, 97 and 104 non-ASCII
characters in the Chinese, Arabic and Hindi replies).
A gate in tests/test_topology.py keeps every Python source of this bundle ASCII only, and pins that
lgmath may be imported for its SMT plumbing by lgstratum/compare.py alone.
9. Language policy
The prose of this folder -- code, docstrings, comments, tool output, test messages -- is English, and
the Python sources are ASCII, as the repository requires. The exception is the language under study,
and it is confined to data: lexicon/*.json (the words, frames, joints and labels of the six
varieties), problems/corpus.jsonl (the questions and their gold answers), and the answer block that
tools/ask.py shows a person, which is written in the language of the question because that block is
the object this bundle measures.
10. Putting this dataset back into a LingoLOGOS checkout
This dataset is 67 files plus this card: 73 questions in one corpus file, the six lexicons, the eight
node definitions, the two readers, the decision rule of section 1, the corpus grading and fault results
under results/, and the fault catalogue of section 6. To run the mathematics it needs the math
bundle: download https://huggingface.co/datasets/tailot/lingologos-math somewhere, set
LGSTRATUM_MATH_ROOT to that copy, and the invoker node calls tools/solve.py there as a separate
process, which is the only door through which this bundle ever reaches a solver. Inside a LingoLOGOS
checkout the folder sits at datasets/math-stratum, finds datasets/math by itself, and needs
src/lingologos_orchestrator importable for the two end to end sessions of section 8. On the hub this
README is rewritten as a dataset card whose sections 1 to 10 keep the wording and numbers of this file,
and sections 11 to 14 are added there for readers who met the bundle on the hub rather than in a
checkout: the fields of the corpus file, how to load it, rights and citation. Every file but this README was compared by sha256 after the upload: the hub holds one object
per file of this folder plus .gitattributes, so the remote count is one above the number
tools/publish_dataset.py prints here. What the LingoLOGOS repository carries is the link to this
dataset in the table of published resources at the top of its README; the documentation of the asset
lives here, in this card, and not in the technical documentation of the project. tools/publish_dataset.py
in the folder of the project republishes a changed working copy with the token taken from an environment
variable. Republishing is a separate step, never a side effect of a
test run: tools/publish_dataset.py does it with the token taken from an environment variable and
verifies the tree by sha256.
11. The corpus file
problems/corpus.jsonl holds 73 questions, one JSON object per line, written and checked by a person.
It is a benchmark for the stratum: there is no prompt, no response pair and nothing to fine tune on.
Each row says what the session has to end like, including the rows whose expected outcome is a refusal
to answer, and a why that says why.
| Field | Type | Meaning |
|---|---|---|
id |
string | unique; the prefix names the variety (it, en, es, zh, hi, ar), or mixed on the 5 rows that mix varieties, write digits in full width form or are gibberish |
lang |
string | one of it, en, es, zh, hi, ar: the variety the question is written in |
kind |
string | one of the 12 problem kinds, or negative (14 rows that must not be read) or passthrough (2 rows already written in the math language) |
question |
string | the question, between 5 and 53 characters, in the script of its variety |
why |
string | the reason the row behaves as it does, written by the person who wrote the row |
expect |
object | the expectation, described below |
Variety (lang) |
Rows | Id prefix | Rows | Kind | Rows |
|---|---|---|---|---|---|
it |
13 | it |
13 | evaluate |
7 |
en |
13 | en |
12 | solve |
6 |
es |
10 | es |
9 | solvez |
3 |
zh |
12 | zh |
11 | prove |
5 |
hi |
12 | hi |
11 | provez |
8 |
ar |
13 | ar |
12 | derivative |
4 |
| mixed rows | 5 | mixed |
5 | integral |
5 |
det, rank |
3, 3 | ||||
inverse |
4 | ||||
maximize, minimize |
3, 6 | ||||
negative |
14 | ||||
passthrough |
2 |
The fields of expect are optional except referee_clean, which is present on every row.
| Field | Rows | Meaning |
|---|---|---|
state |
65 | the reading state the session must end in: AGREED 55, PASSTHROUGH 3, SINGLE 2, NOT COVERED 5 |
sentence |
60 | the sentence of the math language both readers have to produce, exactly |
answer_contains |
29 | a substring the answer has to contain, exact rationals written as strings |
min_assurance |
51 | the lowest assurance that is acceptable, on the scale of section 1 |
max_assurance |
22 | the highest assurance that is acceptable: this is what pins the probes that must not rise |
no_answer |
15 | true where the row is graded by the refusal: no answer may be shown at all |
referee_clean |
73 | every envelope claim of the session must match what the referee of its node recomputed |
The eight rows with no state are graded on an assurance or on an answer instead: they check that the
reading holds while the math stratum abstains, so the assurance must be 0 and no answer may appear.
Seven of them are the agreed readings on which the mathematics is out of reach (it-13, en-11,
en-12, es-09, zh-11, hi-11, ar-12), which is the stratum refusing to add an availability it
does not have.
12. Loading it
Load the file with the datasets library, or with one json.loads per line, which needs no
dependency:
from datasets import load_dataset
rows = load_dataset("tailot/math-stratum", "corpus", split="train")
print(rows[0])
This is the same file tools/ask.py --corpus walks over, and lgstratum/corpus.py plus
tests/test_corpus.py read it to grade the stratum against the gold. Graded on this checkout: 73 of 73
rows agree with what they expect.
13. Rights
No license is declared for this dataset, its lexicons, its corpus or its code: reuse is not granted by
this page. The six lexicons, the 73 questions with their gold expectations, the grammar specifications,
the node data and the Python sources were written by hand as part of the LingoLOGOS project. Ask before
redistributing or building on them, and expect the answer to be yes for academic work with attribution.
Z3 is a separate product with its own license and is not redistributed here; z3-solver is only named
as a dependency in requirements.txt. The lexicons of Hindi, Arabic and Chinese describe written
varieties as this project needs them for arithmetic questions: they are not a general purpose
dictionary of those languages.
14. Citation
@misc{lingologos_math_stratum,
title = {LingoLOGOS math-stratum: a question in six written varieties, the answer of the math stratum, and an assurance that includes the reading},
author = {LingoLOGOS project},
year = {2026},
url = {https://huggingface.co/datasets/tailot/math-stratum},
note = {bundle of the math-stratum folder of the LingoLOGOS repository: 73 questions in six written
varieties, six lexicons, two independent readers, eight node definitions with SMT claims, the
assurance rule min(math, reading) with the reading capped at 2, fault catalogue and ablation
over the node configurations, 290 tests}
}
- Downloads last month
- 53