{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WVZTI3EWSLCCRLQFXNHHJMUB37","short_pith_number":"pith:WVZTI3EW","canonical_record":{"source":{"id":"1406.1808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-06-06T20:14:50Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"dd248e6f10c46cebae3af811acf3bad2e3fb36be956cc74921e48020d9eacbc9","abstract_canon_sha256":"66af3940d4aa314c04ba7cbc55631c01d3c325b51294cd734d3e3029a9dd32de"},"schema_version":"1.0"},"canonical_sha256":"b573346c9692c428ae05bb4e74b281dfc390d837047f83e766b1697c0c5edfc5","source":{"kind":"arxiv","id":"1406.1808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1808","created_at":"2026-05-18T02:50:12Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1808v1","created_at":"2026-05-18T02:50:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1808","created_at":"2026-05-18T02:50:12Z"},{"alias_kind":"pith_short_12","alias_value":"WVZTI3EWSLCC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WVZTI3EWSLCCRLQF","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WVZTI3EW","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WVZTI3EWSLCCRLQFXNHHJMUB37","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-06-06T20:14:50Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"dd248e6f10c46cebae3af811acf3bad2e3fb36be956cc74921e48020d9eacbc9","abstract_canon_sha256":"66af3940d4aa314c04ba7cbc55631c01d3c325b51294cd734d3e3029a9dd32de"},"schema_version":"1.0"},"canonical_sha256":"b573346c9692c428ae05bb4e74b281dfc390d837047f83e766b1697c0c5edfc5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:12.489945Z","signature_b64":"hJ6Ngd05jTyWev2lISSqlwBnbQmTFFcqczil/wZRnP2ATsyJOPHik3g1l03FIP9RaWNeQs5cwZ3IyLwVN8k/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b573346c9692c428ae05bb4e74b281dfc390d837047f83e766b1697c0c5edfc5","last_reissued_at":"2026-05-18T02:50:12.489256Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:12.489256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1808","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-18T02:50:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LaR1bSWN7nSIGDGfy7FFJXE46lzzcDgwzc9VJ3hduWi5nB+PTitt2Ekl7t5TzHvr9Udf05jyK2TTVrcXAWaFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:31:50.307698Z"},"content_sha256":"be6c48fd60918eda93fd645f78ee4c90cd55604bfa560bb332908a72fc9e91a6","schema_version":"1.0","event_id":"sha256:be6c48fd60918eda93fd645f78ee4c90cd55604bfa560bb332908a72fc9e91a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WVZTI3EWSLCCRLQFXNHHJMUB37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper-Bounding Proof Length with the Busy Beaver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Gustavo Lacerda","submitted_at":"2014-06-06T20:14:50Z","abstract_excerpt":"Consider a short theorem, i.e. one that can be written down using just a few symbols. Can its shortest proof be arbitrarily long? We answer this question in the negative. Inspired by arguments by Calude et al (1999) and Chaitin (1984) that construct an upper bound on the first counterexample of a $\\Pi_1$ sentence as a function of the sentence's length, we present a similar argument about proof length for arbitrary statements. As with the above, our bound is uncomputable, since it uses a Busy Beaver oracle. Unlike the above, our result is not restricted to any complexity class. Finally, we comb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1808","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-18T02:50:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WnhuGiQHHDNGP7KkVL+CsLC9oq/8j0s6SQVfOpKSapS3X4+OxAudTO/395XfaCxpyvMWPQc+1eVuIGFFQwHMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:31:50.308234Z"},"content_sha256":"f8be1f5aa6e1714bf481335526c37c7036d7705454309708a5dddbb109aacb2b","schema_version":"1.0","event_id":"sha256:f8be1f5aa6e1714bf481335526c37c7036d7705454309708a5dddbb109aacb2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVZTI3EWSLCCRLQFXNHHJMUB37/bundle.json","state_url":"https://pith.science/pith/WVZTI3EWSLCCRLQFXNHHJMUB37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVZTI3EWSLCCRLQFXNHHJMUB37/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-26T22:31:50Z","links":{"resolver":"https://pith.science/pith/WVZTI3EWSLCCRLQFXNHHJMUB37","bundle":"https://pith.science/pith/WVZTI3EWSLCCRLQFXNHHJMUB37/bundle.json","state":"https://pith.science/pith/WVZTI3EWSLCCRLQFXNHHJMUB37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVZTI3EWSLCCRLQFXNHHJMUB37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WVZTI3EWSLCCRLQFXNHHJMUB37","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":"66af3940d4aa314c04ba7cbc55631c01d3c325b51294cd734d3e3029a9dd32de","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-06-06T20:14:50Z","title_canon_sha256":"dd248e6f10c46cebae3af811acf3bad2e3fb36be956cc74921e48020d9eacbc9"},"schema_version":"1.0","source":{"id":"1406.1808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1808","created_at":"2026-05-18T02:50:12Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1808v1","created_at":"2026-05-18T02:50:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1808","created_at":"2026-05-18T02:50:12Z"},{"alias_kind":"pith_short_12","alias_value":"WVZTI3EWSLCC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WVZTI3EWSLCCRLQF","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WVZTI3EW","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:f8be1f5aa6e1714bf481335526c37c7036d7705454309708a5dddbb109aacb2b","target":"graph","created_at":"2026-05-18T02:50:12Z","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":"Consider a short theorem, i.e. one that can be written down using just a few symbols. Can its shortest proof be arbitrarily long? We answer this question in the negative. Inspired by arguments by Calude et al (1999) and Chaitin (1984) that construct an upper bound on the first counterexample of a $\\Pi_1$ sentence as a function of the sentence's length, we present a similar argument about proof length for arbitrary statements. As with the above, our bound is uncomputable, since it uses a Busy Beaver oracle. Unlike the above, our result is not restricted to any complexity class. Finally, we comb","authors_text":"Gustavo Lacerda","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-06-06T20:14:50Z","title":"Upper-Bounding Proof Length with the Busy Beaver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1808","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:be6c48fd60918eda93fd645f78ee4c90cd55604bfa560bb332908a72fc9e91a6","target":"record","created_at":"2026-05-18T02:50:12Z","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":"66af3940d4aa314c04ba7cbc55631c01d3c325b51294cd734d3e3029a9dd32de","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-06-06T20:14:50Z","title_canon_sha256":"dd248e6f10c46cebae3af811acf3bad2e3fb36be956cc74921e48020d9eacbc9"},"schema_version":"1.0","source":{"id":"1406.1808","kind":"arxiv","version":1}},"canonical_sha256":"b573346c9692c428ae05bb4e74b281dfc390d837047f83e766b1697c0c5edfc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b573346c9692c428ae05bb4e74b281dfc390d837047f83e766b1697c0c5edfc5","first_computed_at":"2026-05-18T02:50:12.489256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:12.489256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hJ6Ngd05jTyWev2lISSqlwBnbQmTFFcqczil/wZRnP2ATsyJOPHik3g1l03FIP9RaWNeQs5cwZ3IyLwVN8k/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:12.489945Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be6c48fd60918eda93fd645f78ee4c90cd55604bfa560bb332908a72fc9e91a6","sha256:f8be1f5aa6e1714bf481335526c37c7036d7705454309708a5dddbb109aacb2b"],"state_sha256":"3fb804e66ec9af03fb4b2a16d8075bde8204c0dbfe6c1aa61d8aedb380bc7298"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DndDJKt1ZXUn1J5RW8x7YQLW4YxxXWDaCvQb/3JdyB/wjFyjwzKdCCOTFjx8RqgQx1hwmfLbbfif57VfFC4BBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:31:50.311696Z","bundle_sha256":"6307438ebeb9af2afcb5d5ba18f210cb1130ec60c79a8ac4f509f7a2b1b0b8b2"}}