{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ITAJQ37CVEDBDGLGNL2AJOI5H3","short_pith_number":"pith:ITAJQ37C","schema_version":"1.0","canonical_sha256":"44c0986fe2a9061199666af404b91d3ef9edf3b155d23d36bae96bbbe6fe7aae","source":{"kind":"arxiv","id":"1707.07670","version":1},"attestation_state":"computed","paper":{"title":"Language Approximation With One-Counter Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alexander Sakharov","submitted_at":"2017-07-23T13:13:15Z","abstract_excerpt":"We present a method for approximating context-free languages with one-counter automata. This approximation allows the reconstruction of parse trees of the original grammar. We identify a decidable superset of regular languages whose elements, i.e. languages, are recognized by one-counter 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":"1707.07670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-07-23T13:13:15Z","cross_cats_sorted":[],"title_canon_sha256":"67e7dc77c05667cef15cffd19b4322175b6627e110ca77949d0fc3a240d19e83","abstract_canon_sha256":"efb02efe4d7878b5481e2f9ac5a6d8b356b21490e44f641392df16f1b624f77c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:30.728842Z","signature_b64":"F3EhzOiE494xCLmFgsjc3/Ezr8X1FogFEAhEL8ytITEIqrIao5mqUqvPjHOc+6FAaO2aF6UQUsVZSJ3g/TGyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44c0986fe2a9061199666af404b91d3ef9edf3b155d23d36bae96bbbe6fe7aae","last_reissued_at":"2026-05-18T00:39:30.728220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:30.728220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Language Approximation With One-Counter Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alexander Sakharov","submitted_at":"2017-07-23T13:13:15Z","abstract_excerpt":"We present a method for approximating context-free languages with one-counter automata. This approximation allows the reconstruction of parse trees of the original grammar. We identify a decidable superset of regular languages whose elements, i.e. languages, are recognized by one-counter automata."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07670","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":"1707.07670","created_at":"2026-05-18T00:39:30.728328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.07670v1","created_at":"2026-05-18T00:39:30.728328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07670","created_at":"2026-05-18T00:39:30.728328+00:00"},{"alias_kind":"pith_short_12","alias_value":"ITAJQ37CVEDB","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"ITAJQ37CVEDBDGLG","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"ITAJQ37C","created_at":"2026-05-18T12:31:21.493067+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/ITAJQ37CVEDBDGLGNL2AJOI5H3","json":"https://pith.science/pith/ITAJQ37CVEDBDGLGNL2AJOI5H3.json","graph_json":"https://pith.science/api/pith-number/ITAJQ37CVEDBDGLGNL2AJOI5H3/graph.json","events_json":"https://pith.science/api/pith-number/ITAJQ37CVEDBDGLGNL2AJOI5H3/events.json","paper":"https://pith.science/paper/ITAJQ37C"},"agent_actions":{"view_html":"https://pith.science/pith/ITAJQ37CVEDBDGLGNL2AJOI5H3","download_json":"https://pith.science/pith/ITAJQ37CVEDBDGLGNL2AJOI5H3.json","view_paper":"https://pith.science/paper/ITAJQ37C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.07670&json=true","fetch_graph":"https://pith.science/api/pith-number/ITAJQ37CVEDBDGLGNL2AJOI5H3/graph.json","fetch_events":"https://pith.science/api/pith-number/ITAJQ37CVEDBDGLGNL2AJOI5H3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ITAJQ37CVEDBDGLGNL2AJOI5H3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ITAJQ37CVEDBDGLGNL2AJOI5H3/action/storage_attestation","attest_author":"https://pith.science/pith/ITAJQ37CVEDBDGLGNL2AJOI5H3/action/author_attestation","sign_citation":"https://pith.science/pith/ITAJQ37CVEDBDGLGNL2AJOI5H3/action/citation_signature","submit_replication":"https://pith.science/pith/ITAJQ37CVEDBDGLGNL2AJOI5H3/action/replication_record"}},"created_at":"2026-05-18T00:39:30.728328+00:00","updated_at":"2026-05-18T00:39:30.728328+00:00"}