{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AGH7ATPRMURSD6QR7X67H2OF7O","short_pith_number":"pith:AGH7ATPR","canonical_record":{"source":{"id":"1507.08582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-30T16:58:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cf78694014347d9ed07df021ac5f95571412f03acf25bbccc03da9cee5c49366","abstract_canon_sha256":"8e8f57f93691d2fe73dcf8fce2e1f0f865b11f499e69d24cde3af8ad7d0d8039"},"schema_version":"1.0"},"canonical_sha256":"018ff04df1652321fa11fdfdf3e9c5fb976d8930bfb9e44bd22ffaae08709732","source":{"kind":"arxiv","id":"1507.08582","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08582","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08582v1","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08582","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"AGH7ATPRMURS","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AGH7ATPRMURSD6QR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AGH7ATPR","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AGH7ATPRMURSD6QR7X67H2OF7O","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-30T16:58:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cf78694014347d9ed07df021ac5f95571412f03acf25bbccc03da9cee5c49366","abstract_canon_sha256":"8e8f57f93691d2fe73dcf8fce2e1f0f865b11f499e69d24cde3af8ad7d0d8039"},"schema_version":"1.0"},"canonical_sha256":"018ff04df1652321fa11fdfdf3e9c5fb976d8930bfb9e44bd22ffaae08709732","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:06.084741Z","signature_b64":"hDuU1mddcYZ2vIyy5XDa0dSgUxqgdisb+ILu8g1FtpwVgxwbPUyVdLm8jPt3fplkf3Q7EG0Y9Gs117V0/IxOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"018ff04df1652321fa11fdfdf3e9c5fb976d8930bfb9e44bd22ffaae08709732","last_reissued_at":"2026-05-18T01:36:06.084271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:06.084271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08582","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-18T01:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bxkziOnQa9jHLSBKbbv3Lrn3D1FsSph989G2vg5I/fQJgefDcIp93A0cUERedivkY0qRmiuhwVHShJ0mIbBGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:32:13.986491Z"},"content_sha256":"e8f0a70e492202c8abeb402f84d6c1a11ffe706f3186b6c999db7c3bb9b621a0","schema_version":"1.0","event_id":"sha256:e8f0a70e492202c8abeb402f84d6c1a11ffe706f3186b6c999db7c3bb9b621a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AGH7ATPRMURSD6QR7X67H2OF7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"One-Tape Turing Machine Variants and Language Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Giovanni Pighizzini","submitted_at":"2015-07-30T16:58:23Z","abstract_excerpt":"We present two restricted versions of one-tape Turing machines. Both characterize the class of context-free languages. In the first version, proposed by Hibbard in 1967 and called limited automata, each tape cell can be rewritten only in the first $d$ visits, for a fixed constant $d\\geq 2$. Furthermore, for $d=2$ deterministic limited automata are equivalent to deterministic pushdown automata, namely they characterize deterministic context-free languages. Further restricting the possible operations, we consider strongly limited automata. These models still characterize context-free languages. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08582","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-18T01:36:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WzGUEMoUEt+5lp7VEs+PeE/lRK9ydQlWq48OE/YXjxbEWchrt8p8zhMK99hpA/9vDZnGqmM250VL3lvv4swSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:32:13.986819Z"},"content_sha256":"81d33b39bc5375a47305e7c0a029471ba5e55d9fb2a3bc5709785ec752a173fc","schema_version":"1.0","event_id":"sha256:81d33b39bc5375a47305e7c0a029471ba5e55d9fb2a3bc5709785ec752a173fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGH7ATPRMURSD6QR7X67H2OF7O/bundle.json","state_url":"https://pith.science/pith/AGH7ATPRMURSD6QR7X67H2OF7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGH7ATPRMURSD6QR7X67H2OF7O/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-24T23:32:13Z","links":{"resolver":"https://pith.science/pith/AGH7ATPRMURSD6QR7X67H2OF7O","bundle":"https://pith.science/pith/AGH7ATPRMURSD6QR7X67H2OF7O/bundle.json","state":"https://pith.science/pith/AGH7ATPRMURSD6QR7X67H2OF7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGH7ATPRMURSD6QR7X67H2OF7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AGH7ATPRMURSD6QR7X67H2OF7O","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":"8e8f57f93691d2fe73dcf8fce2e1f0f865b11f499e69d24cde3af8ad7d0d8039","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-30T16:58:23Z","title_canon_sha256":"cf78694014347d9ed07df021ac5f95571412f03acf25bbccc03da9cee5c49366"},"schema_version":"1.0","source":{"id":"1507.08582","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08582","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08582v1","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08582","created_at":"2026-05-18T01:36:06Z"},{"alias_kind":"pith_short_12","alias_value":"AGH7ATPRMURS","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AGH7ATPRMURSD6QR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AGH7ATPR","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:81d33b39bc5375a47305e7c0a029471ba5e55d9fb2a3bc5709785ec752a173fc","target":"graph","created_at":"2026-05-18T01:36:06Z","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 present two restricted versions of one-tape Turing machines. Both characterize the class of context-free languages. In the first version, proposed by Hibbard in 1967 and called limited automata, each tape cell can be rewritten only in the first $d$ visits, for a fixed constant $d\\geq 2$. Furthermore, for $d=2$ deterministic limited automata are equivalent to deterministic pushdown automata, namely they characterize deterministic context-free languages. Further restricting the possible operations, we consider strongly limited automata. These models still characterize context-free languages. ","authors_text":"Giovanni Pighizzini","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-30T16:58:23Z","title":"One-Tape Turing Machine Variants and Language Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08582","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:e8f0a70e492202c8abeb402f84d6c1a11ffe706f3186b6c999db7c3bb9b621a0","target":"record","created_at":"2026-05-18T01:36:06Z","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":"8e8f57f93691d2fe73dcf8fce2e1f0f865b11f499e69d24cde3af8ad7d0d8039","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-07-30T16:58:23Z","title_canon_sha256":"cf78694014347d9ed07df021ac5f95571412f03acf25bbccc03da9cee5c49366"},"schema_version":"1.0","source":{"id":"1507.08582","kind":"arxiv","version":1}},"canonical_sha256":"018ff04df1652321fa11fdfdf3e9c5fb976d8930bfb9e44bd22ffaae08709732","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"018ff04df1652321fa11fdfdf3e9c5fb976d8930bfb9e44bd22ffaae08709732","first_computed_at":"2026-05-18T01:36:06.084271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:06.084271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hDuU1mddcYZ2vIyy5XDa0dSgUxqgdisb+ILu8g1FtpwVgxwbPUyVdLm8jPt3fplkf3Q7EG0Y9Gs117V0/IxOCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:06.084741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08582","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8f0a70e492202c8abeb402f84d6c1a11ffe706f3186b6c999db7c3bb9b621a0","sha256:81d33b39bc5375a47305e7c0a029471ba5e55d9fb2a3bc5709785ec752a173fc"],"state_sha256":"1c4a8ae04bbbbc9b4d82b85f1fea22f631a607bc44bf4b7f085db2e1e60142e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASW6arD1mFJnwQZOlYshzZIAWx5xlQwG8W892Nobm+W7ylTTRRy1WFfgjn8RnRq9YNGOiJccS4OTjxQnhQtoDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:32:13.988679Z","bundle_sha256":"081d7630ba57ee66fb57ed784a576a4d5a75124ca80b9916bc5c5c0165464ff5"}}