{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IA7NLCMU6RPASNSXMWSYMGUVIZ","short_pith_number":"pith:IA7NLCMU","schema_version":"1.0","canonical_sha256":"403ed58994f45e09365765a5861a9546568bf0a0b400f19e6f2ff356707b64fd","source":{"kind":"arxiv","id":"1010.4760","version":4},"attestation_state":"computed","paper":{"title":"A Short Decidability Proof for DPDA Language Equivalence via First-Order Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Petr Jancar","submitted_at":"2010-10-22T17:20:28Z","abstract_excerpt":"The main aim of the paper is to give a short self-contained proof of the decidability of language equivalence for deterministic pushdown automata, which is the famous problem solved by G. Senizergues, for which C. Stirling has derived a primitive recursive complexity upper bound. The proof here is given in the framework of first-order grammars, which seems to be particularly apt for the aim. An appendix presents a modification of Stirling's approach, yielding a complexity bound of the form tetr(2,g(n)) where tetr is the (nonelementary) operator of iterated exponentiation (tetration) and g is a"},"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":"1010.4760","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-10-22T17:20:28Z","cross_cats_sorted":[],"title_canon_sha256":"40c71e9b68e9c0b3f949959fef30b1170d5a381db88a10dc256d572c7388a97e","abstract_canon_sha256":"7e546bd996e4c56ebedf066b56179e30143e20f7f108e7428cbeb1996d064b38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:06.496712Z","signature_b64":"wrXecVG8cVIfqM2Tn+MQrk6AKAGt+TjAodNzyOZtf8A/1hXtYMIEq3x3fubuJ0yCVIsHNK8QlaO143d1B00KDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"403ed58994f45e09365765a5861a9546568bf0a0b400f19e6f2ff356707b64fd","last_reissued_at":"2026-05-18T04:27:06.496085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:06.496085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Short Decidability Proof for DPDA Language Equivalence via First-Order Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Petr Jancar","submitted_at":"2010-10-22T17:20:28Z","abstract_excerpt":"The main aim of the paper is to give a short self-contained proof of the decidability of language equivalence for deterministic pushdown automata, which is the famous problem solved by G. Senizergues, for which C. Stirling has derived a primitive recursive complexity upper bound. The proof here is given in the framework of first-order grammars, which seems to be particularly apt for the aim. An appendix presents a modification of Stirling's approach, yielding a complexity bound of the form tetr(2,g(n)) where tetr is the (nonelementary) operator of iterated exponentiation (tetration) and g is a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.4760","kind":"arxiv","version":4},"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":"1010.4760","created_at":"2026-05-18T04:27:06.496189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.4760v4","created_at":"2026-05-18T04:27:06.496189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.4760","created_at":"2026-05-18T04:27:06.496189+00:00"},{"alias_kind":"pith_short_12","alias_value":"IA7NLCMU6RPA","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IA7NLCMU6RPASNSX","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IA7NLCMU","created_at":"2026-05-18T12:26:09.077623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2407.04063","citing_title":"Simple grammar bisimilarity, with an application to session type equivalence","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ","json":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ.json","graph_json":"https://pith.science/api/pith-number/IA7NLCMU6RPASNSXMWSYMGUVIZ/graph.json","events_json":"https://pith.science/api/pith-number/IA7NLCMU6RPASNSXMWSYMGUVIZ/events.json","paper":"https://pith.science/paper/IA7NLCMU"},"agent_actions":{"view_html":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ","download_json":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ.json","view_paper":"https://pith.science/paper/IA7NLCMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.4760&json=true","fetch_graph":"https://pith.science/api/pith-number/IA7NLCMU6RPASNSXMWSYMGUVIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/IA7NLCMU6RPASNSXMWSYMGUVIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ/action/storage_attestation","attest_author":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ/action/author_attestation","sign_citation":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ/action/citation_signature","submit_replication":"https://pith.science/pith/IA7NLCMU6RPASNSXMWSYMGUVIZ/action/replication_record"}},"created_at":"2026-05-18T04:27:06.496189+00:00","updated_at":"2026-05-18T04:27:06.496189+00:00"}