{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TIAAO4DNUA4WFXNFDWNLRCJTMQ","short_pith_number":"pith:TIAAO4DN","canonical_record":{"source":{"id":"1208.5002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-08-24T15:38:40Z","cross_cats_sorted":[],"title_canon_sha256":"958cfb19f40ada9becbab6732a2bddd1514b008132f8c268ca78ad20130f675b","abstract_canon_sha256":"190cd496082bb627d2af60ed8b5c5d4bcb924e2db305d21f243fc222e0d39017"},"schema_version":"1.0"},"canonical_sha256":"9a0007706da03962dda51d9ab889336432228bdb1a46d238a820f15fa7e69584","source":{"kind":"arxiv","id":"1208.5002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5002","created_at":"2026-05-18T03:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5002v1","created_at":"2026-05-18T03:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5002","created_at":"2026-05-18T03:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"TIAAO4DNUA4W","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TIAAO4DNUA4WFXNF","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TIAAO4DN","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TIAAO4DNUA4WFXNFDWNLRCJTMQ","target":"record","payload":{"canonical_record":{"source":{"id":"1208.5002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-08-24T15:38:40Z","cross_cats_sorted":[],"title_canon_sha256":"958cfb19f40ada9becbab6732a2bddd1514b008132f8c268ca78ad20130f675b","abstract_canon_sha256":"190cd496082bb627d2af60ed8b5c5d4bcb924e2db305d21f243fc222e0d39017"},"schema_version":"1.0"},"canonical_sha256":"9a0007706da03962dda51d9ab889336432228bdb1a46d238a820f15fa7e69584","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:47:52.082176Z","signature_b64":"DNK7waaWjy7MsyWb5hE0U2/fiB5sMRApCeyXGSjcAudR+mYjJGklykbeCSm2zyOu/d0OtzwmBXXcC+dohX4RDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a0007706da03962dda51d9ab889336432228bdb1a46d238a820f15fa7e69584","last_reissued_at":"2026-05-18T03:47:52.081665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:47:52.081665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.5002","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-18T03:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gLXHkaWDrHWQSG2dybBmewTMwkxOH1sJidUB8x+MmDwuseJVSZzAGA4O9GY+0+wWX7A2RkH9Dsv0x0A49YcVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:37:53.614565Z"},"content_sha256":"d19e67ad9222e6dce96624b5931d07cfedef8e21e39d359b8d61111332860ace","schema_version":"1.0","event_id":"sha256:d19e67ad9222e6dce96624b5931d07cfedef8e21e39d359b8d61111332860ace"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TIAAO4DNUA4WFXNFDWNLRCJTMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Tom\\'a\\v{s} Masopust","submitted_at":"2012-08-24T15:38:40Z","abstract_excerpt":"Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the n-th level of the hierarchy is over an input alphabet with 2(n-1) elements. In this paper, we improve this result by showing that a binary alphabet is sufficient to establish this hierarchy. As a consequence of our construction, we solve the open problem formulated by Meduna et al. Then we extend these results to m-state realtime deterministic pushdown automata, for all m at least 1. The existence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5002","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-18T03:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V1mDYiWcekoEBjjI8r0axnjM9N2TM12HtdkPIuHSsxUyGPOOpuOFgx4j00+4oGmimccbhS9J8XHK4DyP3gyNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:37:53.615228Z"},"content_sha256":"5a61eb86df873eef67a5aab0b0c859456ff0fb1d76743ba31d4910a8dfb91469","schema_version":"1.0","event_id":"sha256:5a61eb86df873eef67a5aab0b0c859456ff0fb1d76743ba31d4910a8dfb91469"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ/bundle.json","state_url":"https://pith.science/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ/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-05-26T21:37:53Z","links":{"resolver":"https://pith.science/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ","bundle":"https://pith.science/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ/bundle.json","state":"https://pith.science/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIAAO4DNUA4WFXNFDWNLRCJTMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TIAAO4DNUA4WFXNFDWNLRCJTMQ","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":"190cd496082bb627d2af60ed8b5c5d4bcb924e2db305d21f243fc222e0d39017","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-08-24T15:38:40Z","title_canon_sha256":"958cfb19f40ada9becbab6732a2bddd1514b008132f8c268ca78ad20130f675b"},"schema_version":"1.0","source":{"id":"1208.5002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5002","created_at":"2026-05-18T03:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5002v1","created_at":"2026-05-18T03:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5002","created_at":"2026-05-18T03:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"TIAAO4DNUA4W","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TIAAO4DNUA4WFXNF","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TIAAO4DN","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:5a61eb86df873eef67a5aab0b0c859456ff0fb1d76743ba31d4910a8dfb91469","target":"graph","created_at":"2026-05-18T03:47:52Z","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":"Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the n-th level of the hierarchy is over an input alphabet with 2(n-1) elements. In this paper, we improve this result by showing that a binary alphabet is sufficient to establish this hierarchy. As a consequence of our construction, we solve the open problem formulated by Meduna et al. Then we extend these results to m-state realtime deterministic pushdown automata, for all m at least 1. The existence ","authors_text":"Tom\\'a\\v{s} Masopust","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-08-24T15:38:40Z","title":"A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5002","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:d19e67ad9222e6dce96624b5931d07cfedef8e21e39d359b8d61111332860ace","target":"record","created_at":"2026-05-18T03:47:52Z","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":"190cd496082bb627d2af60ed8b5c5d4bcb924e2db305d21f243fc222e0d39017","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-08-24T15:38:40Z","title_canon_sha256":"958cfb19f40ada9becbab6732a2bddd1514b008132f8c268ca78ad20130f675b"},"schema_version":"1.0","source":{"id":"1208.5002","kind":"arxiv","version":1}},"canonical_sha256":"9a0007706da03962dda51d9ab889336432228bdb1a46d238a820f15fa7e69584","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a0007706da03962dda51d9ab889336432228bdb1a46d238a820f15fa7e69584","first_computed_at":"2026-05-18T03:47:52.081665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:47:52.081665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DNK7waaWjy7MsyWb5hE0U2/fiB5sMRApCeyXGSjcAudR+mYjJGklykbeCSm2zyOu/d0OtzwmBXXcC+dohX4RDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:47:52.082176Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.5002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d19e67ad9222e6dce96624b5931d07cfedef8e21e39d359b8d61111332860ace","sha256:5a61eb86df873eef67a5aab0b0c859456ff0fb1d76743ba31d4910a8dfb91469"],"state_sha256":"74296ec78de978bda939b379d91ecbaa1a1da7b0568aa2dd2e73edb1de45b8c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sn+XjFlwGKg9qpYnR+fBs0VSKVcJ3e+3edRQsNhkYDGr+6QhQ12U/VX5T2IuQa7nz8t7O+vKr+zw5Q/atRmSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:37:53.618662Z","bundle_sha256":"cf3f10434a9315370aff0af7ab111b01c19013c42bdbed39ddc0491ea1f89ecd"}}