{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EHZFNW62NDWF3AWTENUHZQN65H","short_pith_number":"pith:EHZFNW62","schema_version":"1.0","canonical_sha256":"21f256dbda68ec5d82d323687cc1bee9e721e657001f019cbdf06eab2425aaec","source":{"kind":"arxiv","id":"1301.2181","version":1},"attestation_state":"computed","paper":{"title":"Equivalence of Deterministic One-Counter Automata is NL-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Petr Jan\\v{c}ar, Stanislav B\\\"ohm, Stefan G\\\"oller","submitted_at":"2013-01-10T16:47:36Z","abstract_excerpt":"We prove that language equivalence of deterministic one-counter automata is NL-complete. This improves the superpolynomial time complexity upper bound shown by Valiant and Paterson in 1975. Our main contribution is to prove that two deterministic one-counter automata are inequivalent if and only if they can be distinguished by a word of length polynomial in the size of the two input automata."},"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":"1301.2181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-01-10T16:47:36Z","cross_cats_sorted":[],"title_canon_sha256":"059c61b2e78e74593a0a3b0382f118369965089b77eefe8001d2529a8042fd70","abstract_canon_sha256":"df18337ed308d86f2c8ff6715cdd8dc0c2c757c66117a142541108f65d071400"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:47.294541Z","signature_b64":"nrMmsT/2rgFxNtpg/9FTIVGWPSLK8jMpWAOs4prdAhWfYvttRo/heLhKqL/j0URFUbNC+AKzehSkBQrYlc2BBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21f256dbda68ec5d82d323687cc1bee9e721e657001f019cbdf06eab2425aaec","last_reissued_at":"2026-05-18T03:36:47.293959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:47.293959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equivalence of Deterministic One-Counter Automata is NL-complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Petr Jan\\v{c}ar, Stanislav B\\\"ohm, Stefan G\\\"oller","submitted_at":"2013-01-10T16:47:36Z","abstract_excerpt":"We prove that language equivalence of deterministic one-counter automata is NL-complete. This improves the superpolynomial time complexity upper bound shown by Valiant and Paterson in 1975. Our main contribution is to prove that two deterministic one-counter automata are inequivalent if and only if they can be distinguished by a word of length polynomial in the size of the two input automata."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2181","kind":"arxiv","version":1},"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":"1301.2181","created_at":"2026-05-18T03:36:47.294052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2181v1","created_at":"2026-05-18T03:36:47.294052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2181","created_at":"2026-05-18T03:36:47.294052+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHZFNW62NDWF","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHZFNW62NDWF3AWT","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHZFNW62","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EHZFNW62NDWF3AWTENUHZQN65H","json":"https://pith.science/pith/EHZFNW62NDWF3AWTENUHZQN65H.json","graph_json":"https://pith.science/api/pith-number/EHZFNW62NDWF3AWTENUHZQN65H/graph.json","events_json":"https://pith.science/api/pith-number/EHZFNW62NDWF3AWTENUHZQN65H/events.json","paper":"https://pith.science/paper/EHZFNW62"},"agent_actions":{"view_html":"https://pith.science/pith/EHZFNW62NDWF3AWTENUHZQN65H","download_json":"https://pith.science/pith/EHZFNW62NDWF3AWTENUHZQN65H.json","view_paper":"https://pith.science/paper/EHZFNW62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2181&json=true","fetch_graph":"https://pith.science/api/pith-number/EHZFNW62NDWF3AWTENUHZQN65H/graph.json","fetch_events":"https://pith.science/api/pith-number/EHZFNW62NDWF3AWTENUHZQN65H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHZFNW62NDWF3AWTENUHZQN65H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHZFNW62NDWF3AWTENUHZQN65H/action/storage_attestation","attest_author":"https://pith.science/pith/EHZFNW62NDWF3AWTENUHZQN65H/action/author_attestation","sign_citation":"https://pith.science/pith/EHZFNW62NDWF3AWTENUHZQN65H/action/citation_signature","submit_replication":"https://pith.science/pith/EHZFNW62NDWF3AWTENUHZQN65H/action/replication_record"}},"created_at":"2026-05-18T03:36:47.294052+00:00","updated_at":"2026-05-18T03:36:47.294052+00:00"}