{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:YXTIIFS2ZJ3JQS474ZTN6ELTXD","short_pith_number":"pith:YXTIIFS2","schema_version":"1.0","canonical_sha256":"c5e684165aca76984b9fe666df1173b8debc5eb1a16a476fb39d238fa5703b8d","source":{"kind":"arxiv","id":"1006.3825","version":3},"attestation_state":"computed","paper":{"title":"Parikh's Theorem: A simple and direct automaton construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Javier Esparza, Michael Luttenberger, Pierre Ganty, Stefan Kiefer","submitted_at":"2010-06-19T00:22:14Z","abstract_excerpt":"Parikh's theorem states that the Parikh image of a context-free language is semilinear or, equivalently, that every context-free language has the same Parikh image as some regular language. We present a very simple construction that, given a context-free grammar, produces a finite automaton recognizing such a regular language."},"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":"1006.3825","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-06-19T00:22:14Z","cross_cats_sorted":[],"title_canon_sha256":"a98403c82fe0377793854bdfa755754b39c4a81eab17bc6ee3a7df8aa5611536","abstract_canon_sha256":"e1c58c021e4fa234cf7349711ceac1993d8bba155bc57ba50e910ac55e12bda2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:12.612149Z","signature_b64":"vBkbIg+41TZfuFcY3z7lIuG6solmIgoMW9zVlkh/wz25T1JBfDdnNQWFR+dyYzICPlXIyXF7+YOQYIY6QcveDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5e684165aca76984b9fe666df1173b8debc5eb1a16a476fb39d238fa5703b8d","last_reissued_at":"2026-05-18T03:52:12.611356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:12.611356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parikh's Theorem: A simple and direct automaton construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Javier Esparza, Michael Luttenberger, Pierre Ganty, Stefan Kiefer","submitted_at":"2010-06-19T00:22:14Z","abstract_excerpt":"Parikh's theorem states that the Parikh image of a context-free language is semilinear or, equivalently, that every context-free language has the same Parikh image as some regular language. We present a very simple construction that, given a context-free grammar, produces a finite automaton recognizing such a regular language."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3825","kind":"arxiv","version":3},"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":"1006.3825","created_at":"2026-05-18T03:52:12.611483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.3825v3","created_at":"2026-05-18T03:52:12.611483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3825","created_at":"2026-05-18T03:52:12.611483+00:00"},{"alias_kind":"pith_short_12","alias_value":"YXTIIFS2ZJ3J","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"YXTIIFS2ZJ3JQS47","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"YXTIIFS2","created_at":"2026-05-18T12:26:17.028572+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/YXTIIFS2ZJ3JQS474ZTN6ELTXD","json":"https://pith.science/pith/YXTIIFS2ZJ3JQS474ZTN6ELTXD.json","graph_json":"https://pith.science/api/pith-number/YXTIIFS2ZJ3JQS474ZTN6ELTXD/graph.json","events_json":"https://pith.science/api/pith-number/YXTIIFS2ZJ3JQS474ZTN6ELTXD/events.json","paper":"https://pith.science/paper/YXTIIFS2"},"agent_actions":{"view_html":"https://pith.science/pith/YXTIIFS2ZJ3JQS474ZTN6ELTXD","download_json":"https://pith.science/pith/YXTIIFS2ZJ3JQS474ZTN6ELTXD.json","view_paper":"https://pith.science/paper/YXTIIFS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.3825&json=true","fetch_graph":"https://pith.science/api/pith-number/YXTIIFS2ZJ3JQS474ZTN6ELTXD/graph.json","fetch_events":"https://pith.science/api/pith-number/YXTIIFS2ZJ3JQS474ZTN6ELTXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YXTIIFS2ZJ3JQS474ZTN6ELTXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YXTIIFS2ZJ3JQS474ZTN6ELTXD/action/storage_attestation","attest_author":"https://pith.science/pith/YXTIIFS2ZJ3JQS474ZTN6ELTXD/action/author_attestation","sign_citation":"https://pith.science/pith/YXTIIFS2ZJ3JQS474ZTN6ELTXD/action/citation_signature","submit_replication":"https://pith.science/pith/YXTIIFS2ZJ3JQS474ZTN6ELTXD/action/replication_record"}},"created_at":"2026-05-18T03:52:12.611483+00:00","updated_at":"2026-05-18T03:52:12.611483+00:00"}