{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PAEYU6EVAC6RK7SDK6DLGQGKTK","short_pith_number":"pith:PAEYU6EV","schema_version":"1.0","canonical_sha256":"78098a789500bd157e435786b340ca9a877e5bbc8cc62cf4bc60bac45c9cca53","source":{"kind":"arxiv","id":"1811.03595","version":2},"attestation_state":"computed","paper":{"title":"The ordinal generated by an ordinal grammar is computable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Kitti Gelle, Szabolcs Ivan","submitted_at":"2018-11-08T18:30:44Z","abstract_excerpt":"A prefix grammar is a context-free grammar whose nonterminals generate prefix-free languages. A prefix grammar $G$ is an ordinal grammar if the language $L(G)$ is well-ordered with respect to the lexicographic ordering. It is known that from a finite system of parametric fixed point equations one can construct an ordinal grammar $G$ such that the lexicographic order of $G$ is isomorphic with the least solution of the system, if this solution is well-ordered. In this paper we show that given an ordinal grammar, one can compute (the Cantor normal form of) the order type of the lexicographic orde"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.03595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-11-08T18:30:44Z","cross_cats_sorted":[],"title_canon_sha256":"e619d25155fba3a3c87d5e8113ee5b16f7a38c5acdbc98f9d59d02af8d42254e","abstract_canon_sha256":"2bacd835678e92ada7c9f7695ef8f6dd713f6a99f4b1ea49b6de15aa4a9c31c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:50.828646Z","signature_b64":"eq0/YPv28Syaemc3qyxMqgZyP08A2QBHlxdQO18wMGViZodjfc8Li3LxYqNF+QV8IVeMh2R33LZGJm4pbYr7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78098a789500bd157e435786b340ca9a877e5bbc8cc62cf4bc60bac45c9cca53","last_reissued_at":"2026-05-17T23:47:50.828075Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:50.828075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The ordinal generated by an ordinal grammar is computable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Kitti Gelle, Szabolcs Ivan","submitted_at":"2018-11-08T18:30:44Z","abstract_excerpt":"A prefix grammar is a context-free grammar whose nonterminals generate prefix-free languages. A prefix grammar $G$ is an ordinal grammar if the language $L(G)$ is well-ordered with respect to the lexicographic ordering. It is known that from a finite system of parametric fixed point equations one can construct an ordinal grammar $G$ such that the lexicographic order of $G$ is isomorphic with the least solution of the system, if this solution is well-ordered. In this paper we show that given an ordinal grammar, one can compute (the Cantor normal form of) the order type of the lexicographic orde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03595","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.03595","created_at":"2026-05-17T23:47:50.828156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03595v2","created_at":"2026-05-17T23:47:50.828156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03595","created_at":"2026-05-17T23:47:50.828156+00:00"},{"alias_kind":"pith_short_12","alias_value":"PAEYU6EVAC6R","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PAEYU6EVAC6RK7SD","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PAEYU6EV","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.11573","citing_title":"The order type of scattered context-free orderings of rank one is computable","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK","json":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK.json","graph_json":"https://pith.science/api/pith-number/PAEYU6EVAC6RK7SDK6DLGQGKTK/graph.json","events_json":"https://pith.science/api/pith-number/PAEYU6EVAC6RK7SDK6DLGQGKTK/events.json","paper":"https://pith.science/paper/PAEYU6EV"},"agent_actions":{"view_html":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK","download_json":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK.json","view_paper":"https://pith.science/paper/PAEYU6EV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03595&json=true","fetch_graph":"https://pith.science/api/pith-number/PAEYU6EVAC6RK7SDK6DLGQGKTK/graph.json","fetch_events":"https://pith.science/api/pith-number/PAEYU6EVAC6RK7SDK6DLGQGKTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK/action/storage_attestation","attest_author":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK/action/author_attestation","sign_citation":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK/action/citation_signature","submit_replication":"https://pith.science/pith/PAEYU6EVAC6RK7SDK6DLGQGKTK/action/replication_record"}},"created_at":"2026-05-17T23:47:50.828156+00:00","updated_at":"2026-05-17T23:47:50.828156+00:00"}