{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LO77HMVC7IHWUJJDAFA42F7VTK","short_pith_number":"pith:LO77HMVC","canonical_record":{"source":{"id":"1605.04343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-13T22:05:58Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d6c808e486f6f46c2d5c6ea01fc970719cf02f81e02ca87e9b556ffac266719e","abstract_canon_sha256":"8f3c7ac2182aa05dc3200aadf88632124379919a48b0f974390f1c9aa6878aef"},"schema_version":"1.0"},"canonical_sha256":"5bbff3b2a2fa0f6a25230141cd17f59a81556152f0d1c53b96e35937a5541ebc","source":{"kind":"arxiv","id":"1605.04343","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04343","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04343v1","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04343","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"LO77HMVC7IHW","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LO77HMVC7IHWUJJD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LO77HMVC","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LO77HMVC7IHWUJJDAFA42F7VTK","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-13T22:05:58Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d6c808e486f6f46c2d5c6ea01fc970719cf02f81e02ca87e9b556ffac266719e","abstract_canon_sha256":"8f3c7ac2182aa05dc3200aadf88632124379919a48b0f974390f1c9aa6878aef"},"schema_version":"1.0"},"canonical_sha256":"5bbff3b2a2fa0f6a25230141cd17f59a81556152f0d1c53b96e35937a5541ebc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:51.993056Z","signature_b64":"Y99ZxdMVDaw18oe3pBv9+sdyspwRaG24O0Lk54LVmqyy5JxDOnwON9JqyNiGOQn1RTCEv93EE9pRTIDrYCmaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bbff3b2a2fa0f6a25230141cd17f59a81556152f0d1c53b96e35937a5541ebc","last_reissued_at":"2026-05-18T01:14:51.992481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:51.992481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04343","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:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L71nMFYrRDBbUi4pK8oRhGvV0NyH1j2JlslpBGO+r4XOy7gNEF6xzPNEbqkGv6e9GeRw7tVFQdjsX9yZscYHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:28:46.655450Z"},"content_sha256":"7923d884896e01a3627e07f321c3500d86001fef66cbf6c648e5f9ba1540af4b","schema_version":"1.0","event_id":"sha256:7923d884896e01a3627e07f321c3500d86001fef66cbf6c648e5f9ba1540af4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LO77HMVC7IHWUJJDAFA42F7VTK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Adam Yedidia, Scott Aaronson","submitted_at":"2016-05-13T22:05:58Z","abstract_excerpt":"Since the definition of the Busy Beaver function by Rado in 1962, an interesting open question has been the smallest value of n for which BB(n) is independent of ZFC set theory. Is this n approximately 10, or closer to 1,000,000, or is it even larger? In this paper, we show that it is at most 7,910 by presenting an explicit description of a 7,910-state Turing machine Z with 1 tape and a 2-symbol alphabet that cannot be proved to run forever in ZFC (even though it presumably does), assuming ZFC is consistent. The machine is based on the work of Harvey Friedman on independent statements involvin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04343","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:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFkHjLljw5i0oxpqh5+F288xIr6wE8bHkNxHpwqdGqXfhGhi2GQHR2ll23vsSp4ePMBcJMDqGnAkUyJLL0T9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:28:46.655815Z"},"content_sha256":"7dbd04096ed733a579cab6f8b7b8d4c36949cccdcdf13532d2ad50545c0cf7a2","schema_version":"1.0","event_id":"sha256:7dbd04096ed733a579cab6f8b7b8d4c36949cccdcdf13532d2ad50545c0cf7a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LO77HMVC7IHWUJJDAFA42F7VTK/bundle.json","state_url":"https://pith.science/pith/LO77HMVC7IHWUJJDAFA42F7VTK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LO77HMVC7IHWUJJDAFA42F7VTK/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-25T20:28:46Z","links":{"resolver":"https://pith.science/pith/LO77HMVC7IHWUJJDAFA42F7VTK","bundle":"https://pith.science/pith/LO77HMVC7IHWUJJDAFA42F7VTK/bundle.json","state":"https://pith.science/pith/LO77HMVC7IHWUJJDAFA42F7VTK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LO77HMVC7IHWUJJDAFA42F7VTK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LO77HMVC7IHWUJJDAFA42F7VTK","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":"8f3c7ac2182aa05dc3200aadf88632124379919a48b0f974390f1c9aa6878aef","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-13T22:05:58Z","title_canon_sha256":"d6c808e486f6f46c2d5c6ea01fc970719cf02f81e02ca87e9b556ffac266719e"},"schema_version":"1.0","source":{"id":"1605.04343","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04343","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04343v1","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04343","created_at":"2026-05-18T01:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"LO77HMVC7IHW","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LO77HMVC7IHWUJJD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LO77HMVC","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:7dbd04096ed733a579cab6f8b7b8d4c36949cccdcdf13532d2ad50545c0cf7a2","target":"graph","created_at":"2026-05-18T01:14:51Z","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 the definition of the Busy Beaver function by Rado in 1962, an interesting open question has been the smallest value of n for which BB(n) is independent of ZFC set theory. Is this n approximately 10, or closer to 1,000,000, or is it even larger? In this paper, we show that it is at most 7,910 by presenting an explicit description of a 7,910-state Turing machine Z with 1 tape and a 2-symbol alphabet that cannot be proved to run forever in ZFC (even though it presumably does), assuming ZFC is consistent. The machine is based on the work of Harvey Friedman on independent statements involvin","authors_text":"Adam Yedidia, Scott Aaronson","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-13T22:05:58Z","title":"A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04343","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:7923d884896e01a3627e07f321c3500d86001fef66cbf6c648e5f9ba1540af4b","target":"record","created_at":"2026-05-18T01:14:51Z","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":"8f3c7ac2182aa05dc3200aadf88632124379919a48b0f974390f1c9aa6878aef","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-13T22:05:58Z","title_canon_sha256":"d6c808e486f6f46c2d5c6ea01fc970719cf02f81e02ca87e9b556ffac266719e"},"schema_version":"1.0","source":{"id":"1605.04343","kind":"arxiv","version":1}},"canonical_sha256":"5bbff3b2a2fa0f6a25230141cd17f59a81556152f0d1c53b96e35937a5541ebc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bbff3b2a2fa0f6a25230141cd17f59a81556152f0d1c53b96e35937a5541ebc","first_computed_at":"2026-05-18T01:14:51.992481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:51.992481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y99ZxdMVDaw18oe3pBv9+sdyspwRaG24O0Lk54LVmqyy5JxDOnwON9JqyNiGOQn1RTCEv93EE9pRTIDrYCmaCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:51.993056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04343","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7923d884896e01a3627e07f321c3500d86001fef66cbf6c648e5f9ba1540af4b","sha256:7dbd04096ed733a579cab6f8b7b8d4c36949cccdcdf13532d2ad50545c0cf7a2"],"state_sha256":"8a1b4abdd3b6cacbc258958463fb6c72821fe6a2404f57ce38b50503dc42b28c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/AUCCkhq5W903UUeXC6LZgK/igxDgJsw+tLpaxxAqf6BPuJfIKpzyJNbNHwSu+L7hsxQYNAOaS1EZ6c/ojEZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:28:46.657792Z","bundle_sha256":"e9a5228dc1a481744ec6bf24639a45d8a1dad767b1d5714c3679bd1f073b09ce"}}