{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7MQ6G754I3YJQKHUZNCIMPFIR4","short_pith_number":"pith:7MQ6G754","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"},"canonical_sha256":"fb21e37fbc46f09828f4cb44863ca88f213597fda71b7c070e269c84046833fc","source":{"kind":"arxiv","id":"1706.08315","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08315","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08315v1","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08315","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"7MQ6G754I3YJ","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7MQ6G754I3YJQKHU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7MQ6G754","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7MQ6G754I3YJQKHUZNCIMPFIR4","target":"record","payload":{"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"},"canonical_sha256":"fb21e37fbc46f09828f4cb44863ca88f213597fda71b7c070e269c84046833fc","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"},"source_kind":"arxiv","source_id":"1706.08315","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hQhslg9MdVnJSW3mXAF1w861W7KtEHF3U9L6zHmhHXOM3xpheu5YfiZ0LNRx3P05zrMpe6CPZmULeFT6Bqy1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:27:55.768728Z"},"content_sha256":"64e0cc72a6c118ef4072e0aa484336dc5868aee7cf5e3af27307628461d9c842","schema_version":"1.0","event_id":"sha256:64e0cc72a6c118ef4072e0aa484336dc5868aee7cf5e3af27307628461d9c842"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7MQ6G754I3YJQKHUZNCIMPFIR4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7VdIP2AyFIhKYT+axB+hLvBGQrlEK/MSEwkbc9Mf4Csn7ceGNzx9RfDD4hNliDJ3Mu1Rk51RNgjDZ9o6gto2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:27:55.769072Z"},"content_sha256":"58a5a37c820288b51edf11436a77e235ef2d387800518443eca4fb804f181c38","schema_version":"1.0","event_id":"sha256:58a5a37c820288b51edf11436a77e235ef2d387800518443eca4fb804f181c38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MQ6G754I3YJQKHUZNCIMPFIR4/bundle.json","state_url":"https://pith.science/pith/7MQ6G754I3YJQKHUZNCIMPFIR4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MQ6G754I3YJQKHUZNCIMPFIR4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T20:27:55Z","links":{"resolver":"https://pith.science/pith/7MQ6G754I3YJQKHUZNCIMPFIR4","bundle":"https://pith.science/pith/7MQ6G754I3YJQKHUZNCIMPFIR4/bundle.json","state":"https://pith.science/pith/7MQ6G754I3YJQKHUZNCIMPFIR4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MQ6G754I3YJQKHUZNCIMPFIR4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7MQ6G754I3YJQKHUZNCIMPFIR4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a461dc1e008d3ebefff0ed5fd4881f646588b27607a924c895961f5c710c3e25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-06-26T10:51:04Z","title_canon_sha256":"edbd5ac1cf229011aa7f7ed38b6fb45bc844a45ae467d58df3d9b3fd8f0207da"},"schema_version":"1.0","source":{"id":"1706.08315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08315","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08315v1","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08315","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"7MQ6G754I3YJ","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7MQ6G754I3YJQKHU","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7MQ6G754","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:58a5a37c820288b51edf11436a77e235ef2d387800518443eca4fb804f181c38","target":"graph","created_at":"2026-05-18T00:41:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Elena Guti\\'errez, Pierre Ganty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-06-26T10:51:04Z","title":"Parikh Image of Pushdown Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08315","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:64e0cc72a6c118ef4072e0aa484336dc5868aee7cf5e3af27307628461d9c842","target":"record","created_at":"2026-05-18T00:41:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a461dc1e008d3ebefff0ed5fd4881f646588b27607a924c895961f5c710c3e25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-06-26T10:51:04Z","title_canon_sha256":"edbd5ac1cf229011aa7f7ed38b6fb45bc844a45ae467d58df3d9b3fd8f0207da"},"schema_version":"1.0","source":{"id":"1706.08315","kind":"arxiv","version":1}},"canonical_sha256":"fb21e37fbc46f09828f4cb44863ca88f213597fda71b7c070e269c84046833fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb21e37fbc46f09828f4cb44863ca88f213597fda71b7c070e269c84046833fc","first_computed_at":"2026-05-18T00:41:42.897062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:42.897062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ex68p9K0AwP7H18IqkcQvSZH0OAPN2Ve6jh8ATvVehYNMh7VTkTrSIqcMETQgpvHjkSgR1UVDoFvPCNH2vzPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:42.897702Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64e0cc72a6c118ef4072e0aa484336dc5868aee7cf5e3af27307628461d9c842","sha256:58a5a37c820288b51edf11436a77e235ef2d387800518443eca4fb804f181c38"],"state_sha256":"dc7fab2fb4422b4d8f8a88cd23e790b79a31db312a31c2dc728c9de033f2c762"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0CkYGlg3dnsosQz6mdJ5WfVhzmtMKsNfnI/E0iwTzj0r5sllTzkzNl4xr/7VmpcqIce3hTGYpOk3Nc55nCNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T20:27:55.771627Z","bundle_sha256":"312c785d1f129e89c5aa4fcb1170389dbd090f53304d06bbd2351018404612c1"}}