{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LNS3HX3V5U5KC6PZEFONA5VZXW","short_pith_number":"pith:LNS3HX3V","canonical_record":{"source":{"id":"1312.6700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-12-19T19:59:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"519a65e2556388ef1191609e3201934f36ec844370050ddd590fd418442feed3","abstract_canon_sha256":"f51dc085dc9431935b53f4e61649db9f99dc1b688b865aa30298ee4f12651d2e"},"schema_version":"1.0"},"canonical_sha256":"5b65b3df75ed3aa179f9215cd076b9bda11e127c8a95f1b7d6dd9e2fb7fdb145","source":{"kind":"arxiv","id":"1312.6700","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6700","created_at":"2026-05-18T03:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6700v1","created_at":"2026-05-18T03:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6700","created_at":"2026-05-18T03:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"LNS3HX3V5U5K","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LNS3HX3V5U5KC6PZ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LNS3HX3V","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LNS3HX3V5U5KC6PZEFONA5VZXW","target":"record","payload":{"canonical_record":{"source":{"id":"1312.6700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-12-19T19:59:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"519a65e2556388ef1191609e3201934f36ec844370050ddd590fd418442feed3","abstract_canon_sha256":"f51dc085dc9431935b53f4e61649db9f99dc1b688b865aa30298ee4f12651d2e"},"schema_version":"1.0"},"canonical_sha256":"5b65b3df75ed3aa179f9215cd076b9bda11e127c8a95f1b7d6dd9e2fb7fdb145","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:56.319106Z","signature_b64":"RcsbjVSu8FOVprtnrpqS8HlYLv5Sw23Z/1rixqGP1v1jZEHBs60jnVoq4zAtNFb8uoh0RYoxzpLDVFBh850NCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b65b3df75ed3aa179f9215cd076b9bda11e127c8a95f1b7d6dd9e2fb7fdb145","last_reissued_at":"2026-05-18T03:03:56.318389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:56.318389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.6700","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:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+yrwRnl9ehk2EeBHWM2mB4v8hVLZiGNxRZnRnv5VKjBT/qlQamV9O0TueGTcOX+q87+9eLpsB5aSl2yobM3LDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:48:43.334112Z"},"content_sha256":"f604ea407c449a130d5d18cc1cf6d0551a6db99015fa84560f8ecf1092367f34","schema_version":"1.0","event_id":"sha256:f604ea407c449a130d5d18cc1cf6d0551a6db99015fa84560f8ecf1092367f34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LNS3HX3V5U5KC6PZEFONA5VZXW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Undecidability in binary tag systems and the Post correspondence problem for four pairs of words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.FL","authors_text":"Turlough Neary","submitted_at":"2013-12-19T19:59:13Z","abstract_excerpt":"Since Cocke and Minsky proved 2-tag systems universal, they have been extensively used to prove the universality of numerous computational models. Unfortunately, all known algorithms give universal 2-tag systems that have a large number of symbols. In this work, tag systems with only 2 symbols (the minimum possible) are proved universal via an intricate construction showing that they simulate cyclic tag systems. Our simulation algorithm has a polynomial time overhead, and thus shows that binary tag systems simulate Turing machines in polynomial time.\n  We immediately find applications of our r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6700","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:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MrD3XFYgzS2GtzTWGQML3z5wZhOwYnzbOXmYWAObwzNDIf5a+eFeIpf1+cTsDu2bmXEI3+Ol7pQuGXelWLTBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:48:43.334470Z"},"content_sha256":"9f764d77c40333aac07dc66ff58afdb64a3c2d0bf21846b84e334ea67d957f2c","schema_version":"1.0","event_id":"sha256:9f764d77c40333aac07dc66ff58afdb64a3c2d0bf21846b84e334ea67d957f2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNS3HX3V5U5KC6PZEFONA5VZXW/bundle.json","state_url":"https://pith.science/pith/LNS3HX3V5U5KC6PZEFONA5VZXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNS3HX3V5U5KC6PZEFONA5VZXW/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-24T05:48:43Z","links":{"resolver":"https://pith.science/pith/LNS3HX3V5U5KC6PZEFONA5VZXW","bundle":"https://pith.science/pith/LNS3HX3V5U5KC6PZEFONA5VZXW/bundle.json","state":"https://pith.science/pith/LNS3HX3V5U5KC6PZEFONA5VZXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNS3HX3V5U5KC6PZEFONA5VZXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LNS3HX3V5U5KC6PZEFONA5VZXW","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":"f51dc085dc9431935b53f4e61649db9f99dc1b688b865aa30298ee4f12651d2e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-12-19T19:59:13Z","title_canon_sha256":"519a65e2556388ef1191609e3201934f36ec844370050ddd590fd418442feed3"},"schema_version":"1.0","source":{"id":"1312.6700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6700","created_at":"2026-05-18T03:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6700v1","created_at":"2026-05-18T03:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6700","created_at":"2026-05-18T03:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"LNS3HX3V5U5K","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LNS3HX3V5U5KC6PZ","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LNS3HX3V","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:9f764d77c40333aac07dc66ff58afdb64a3c2d0bf21846b84e334ea67d957f2c","target":"graph","created_at":"2026-05-18T03:03:56Z","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":"Since Cocke and Minsky proved 2-tag systems universal, they have been extensively used to prove the universality of numerous computational models. Unfortunately, all known algorithms give universal 2-tag systems that have a large number of symbols. In this work, tag systems with only 2 symbols (the minimum possible) are proved universal via an intricate construction showing that they simulate cyclic tag systems. Our simulation algorithm has a polynomial time overhead, and thus shows that binary tag systems simulate Turing machines in polynomial time.\n  We immediately find applications of our r","authors_text":"Turlough Neary","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-12-19T19:59:13Z","title":"Undecidability in binary tag systems and the Post correspondence problem for four pairs of words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6700","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:f604ea407c449a130d5d18cc1cf6d0551a6db99015fa84560f8ecf1092367f34","target":"record","created_at":"2026-05-18T03:03:56Z","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":"f51dc085dc9431935b53f4e61649db9f99dc1b688b865aa30298ee4f12651d2e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-12-19T19:59:13Z","title_canon_sha256":"519a65e2556388ef1191609e3201934f36ec844370050ddd590fd418442feed3"},"schema_version":"1.0","source":{"id":"1312.6700","kind":"arxiv","version":1}},"canonical_sha256":"5b65b3df75ed3aa179f9215cd076b9bda11e127c8a95f1b7d6dd9e2fb7fdb145","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b65b3df75ed3aa179f9215cd076b9bda11e127c8a95f1b7d6dd9e2fb7fdb145","first_computed_at":"2026-05-18T03:03:56.318389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:56.318389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RcsbjVSu8FOVprtnrpqS8HlYLv5Sw23Z/1rixqGP1v1jZEHBs60jnVoq4zAtNFb8uoh0RYoxzpLDVFBh850NCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:56.319106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f604ea407c449a130d5d18cc1cf6d0551a6db99015fa84560f8ecf1092367f34","sha256:9f764d77c40333aac07dc66ff58afdb64a3c2d0bf21846b84e334ea67d957f2c"],"state_sha256":"00684fb25f8d47981ee5223d7dfba8bcbea16fab9459fec1fa4239d8a6940774"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ohhYiEHHodGN8HP/DJDNBy4Zbrd+X3rIgau/AiM4BSnEbRJc/KclRcpsav1+0OyYS4weYaY254dey+mmDEvZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:48:43.336433Z","bundle_sha256":"2641f8ca2740987839ca168c0e9605f6d25e25424c790ba24e6ef0f76b03b98f"}}