{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7MQ6G754I3YJQKHUZNCIMPFIR4","short_pith_number":"pith:7MQ6G754","schema_version":"1.0","canonical_sha256":"fb21e37fbc46f09828f4cb44863ca88f213597fda71b7c070e269c84046833fc","source":{"kind":"arxiv","id":"1706.08315","version":1},"attestation_state":"computed","paper":{"title":"Parikh Image of Pushdown Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Elena Guti\\'errez, Pierre Ganty","submitted_at":"2017-06-26T10:51:04Z","abstract_excerpt":"We compare pushdown automata (PDAs for short) against other representations. First, we show that there is a family of PDAs over a unary alphabet with $n$ states and $p \\geq 2n + 4$ stack symbols that accepts one single long word for which every equivalent context-free grammar needs $\\Omega(n^2(p-2n-4))$ variables. This family shows that the classical algorithm for converting a PDA to an equivalent context-free grammar is optimal even when the alphabet is unary. Moreover, we observe that language equivalence and Parikh equivalence, which ignores the ordering between symbols, coincide for this f"},"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":"1706.08315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-06-26T10:51:04Z","cross_cats_sorted":[],"title_canon_sha256":"edbd5ac1cf229011aa7f7ed38b6fb45bc844a45ae467d58df3d9b3fd8f0207da","abstract_canon_sha256":"a461dc1e008d3ebefff0ed5fd4881f646588b27607a924c895961f5c710c3e25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:42.897702Z","signature_b64":"ex68p9K0AwP7H18IqkcQvSZH0OAPN2Ve6jh8ATvVehYNMh7VTkTrSIqcMETQgpvHjkSgR1UVDoFvPCNH2vzPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb21e37fbc46f09828f4cb44863ca88f213597fda71b7c070e269c84046833fc","last_reissued_at":"2026-05-18T00:41:42.897062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:42.897062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parikh Image of Pushdown Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Elena Guti\\'errez, Pierre Ganty","submitted_at":"2017-06-26T10:51:04Z","abstract_excerpt":"We compare pushdown automata (PDAs for short) against other representations. First, we show that there is a family of PDAs over a unary alphabet with $n$ states and $p \\geq 2n + 4$ stack symbols that accepts one single long word for which every equivalent context-free grammar needs $\\Omega(n^2(p-2n-4))$ variables. This family shows that the classical algorithm for converting a PDA to an equivalent context-free grammar is optimal even when the alphabet is unary. Moreover, we observe that language equivalence and Parikh equivalence, which ignores the ordering between symbols, coincide for this f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08315","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":"1706.08315","created_at":"2026-05-18T00:41:42.897172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08315v1","created_at":"2026-05-18T00:41:42.897172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08315","created_at":"2026-05-18T00:41:42.897172+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MQ6G754I3YJ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MQ6G754I3YJQKHU","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MQ6G754","created_at":"2026-05-18T12:31:05.417338+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/7MQ6G754I3YJQKHUZNCIMPFIR4","json":"https://pith.science/pith/7MQ6G754I3YJQKHUZNCIMPFIR4.json","graph_json":"https://pith.science/api/pith-number/7MQ6G754I3YJQKHUZNCIMPFIR4/graph.json","events_json":"https://pith.science/api/pith-number/7MQ6G754I3YJQKHUZNCIMPFIR4/events.json","paper":"https://pith.science/paper/7MQ6G754"},"agent_actions":{"view_html":"https://pith.science/pith/7MQ6G754I3YJQKHUZNCIMPFIR4","download_json":"https://pith.science/pith/7MQ6G754I3YJQKHUZNCIMPFIR4.json","view_paper":"https://pith.science/paper/7MQ6G754","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08315&json=true","fetch_graph":"https://pith.science/api/pith-number/7MQ6G754I3YJQKHUZNCIMPFIR4/graph.json","fetch_events":"https://pith.science/api/pith-number/7MQ6G754I3YJQKHUZNCIMPFIR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MQ6G754I3YJQKHUZNCIMPFIR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MQ6G754I3YJQKHUZNCIMPFIR4/action/storage_attestation","attest_author":"https://pith.science/pith/7MQ6G754I3YJQKHUZNCIMPFIR4/action/author_attestation","sign_citation":"https://pith.science/pith/7MQ6G754I3YJQKHUZNCIMPFIR4/action/citation_signature","submit_replication":"https://pith.science/pith/7MQ6G754I3YJQKHUZNCIMPFIR4/action/replication_record"}},"created_at":"2026-05-18T00:41:42.897172+00:00","updated_at":"2026-05-18T00:41:42.897172+00:00"}