{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:XVZD2KJUD2G3VAIJZSKXDRTEJM","short_pith_number":"pith:XVZD2KJU","canonical_record":{"source":{"id":"0906.3765","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-06-20T02:58:26Z","cross_cats_sorted":[],"title_canon_sha256":"6c64ae3dd2035ef9426b14f28aec7eb583b34cd48df89d8dbb71555c7df12766","abstract_canon_sha256":"74142af975ba7477ddcba150234f86d5e9016f64d5527634f3e86b46d8a93e4d"},"schema_version":"1.0"},"canonical_sha256":"bd723d29341e8dba8109cc9571c6644b04ca4fabd5378c6aaf0d8557cfc7c95b","source":{"kind":"arxiv","id":"0906.3765","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.3765","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"0906.3765v3","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.3765","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"XVZD2KJUD2G3","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"XVZD2KJUD2G3VAIJ","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"XVZD2KJU","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:XVZD2KJUD2G3VAIJZSKXDRTEJM","target":"record","payload":{"canonical_record":{"source":{"id":"0906.3765","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-06-20T02:58:26Z","cross_cats_sorted":[],"title_canon_sha256":"6c64ae3dd2035ef9426b14f28aec7eb583b34cd48df89d8dbb71555c7df12766","abstract_canon_sha256":"74142af975ba7477ddcba150234f86d5e9016f64d5527634f3e86b46d8a93e4d"},"schema_version":"1.0"},"canonical_sha256":"bd723d29341e8dba8109cc9571c6644b04ca4fabd5378c6aaf0d8557cfc7c95b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:10.968192Z","signature_b64":"yk81ullMRyINxCg/2Dtv3ZMov7Nyn3kB8OMAmne1eL9kLM8MmGY9MTfglE9XK6rBeGH4FcLogMCvqQ2xXec9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd723d29341e8dba8109cc9571c6644b04ca4fabd5378c6aaf0d8557cfc7c95b","last_reissued_at":"2026-05-18T03:45:10.967389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:10.967389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.3765","source_version":3,"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:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PzGisGw/K+AHN1S7t6LHb0bFGV1tgzn5SCA77dEwrC/8succLqzgcg+Q19P1Y7b3ZtpSWLXG8f9bhKe0XoePDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:00:57.809309Z"},"content_sha256":"e72a9521227857e40234e920a2c7ee9e5ff431044698916a98b248f456af77b1","schema_version":"1.0","event_id":"sha256:e72a9521227857e40234e920a2c7ee9e5ff431044698916a98b248f456af77b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:XVZD2KJUD2G3VAIJZSKXDRTEJM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speedup for Natural Problems and Noncomputability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hunter Monroe","submitted_at":"2009-06-20T02:58:26Z","abstract_excerpt":"A resource-bounded version of the statement \"no algorithm recognizes all non-halting Turing machines\" is equivalent to an infinitely often (i.o.) superpolynomial speedup for the time required to accept any coNP-complete language and also equivalent to a superpolynomial speedup in proof length in propositional proof systems for tautologies, each of which implies P!=NP. This suggests a correspondence between the properties 'has no algorithm at all' and 'has no best algorithm' which seems relevant to open problems in computational and proof complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.3765","kind":"arxiv","version":3},"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:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfl97RSrtafRtP0mE5A5eSe4CYO4Aq8B8p6Q1J80Hk3SZn3A2ztWlKCMgfdU4Tx5aUVi0jVynKNOlkwPizl/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:00:57.810178Z"},"content_sha256":"35d55ac10e976b0de1a7a8700ce0429fe137e4e5b7ecff499285cea74bfa22de","schema_version":"1.0","event_id":"sha256:35d55ac10e976b0de1a7a8700ce0429fe137e4e5b7ecff499285cea74bfa22de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVZD2KJUD2G3VAIJZSKXDRTEJM/bundle.json","state_url":"https://pith.science/pith/XVZD2KJUD2G3VAIJZSKXDRTEJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVZD2KJUD2G3VAIJZSKXDRTEJM/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-10T23:00:57Z","links":{"resolver":"https://pith.science/pith/XVZD2KJUD2G3VAIJZSKXDRTEJM","bundle":"https://pith.science/pith/XVZD2KJUD2G3VAIJZSKXDRTEJM/bundle.json","state":"https://pith.science/pith/XVZD2KJUD2G3VAIJZSKXDRTEJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVZD2KJUD2G3VAIJZSKXDRTEJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:XVZD2KJUD2G3VAIJZSKXDRTEJM","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":"74142af975ba7477ddcba150234f86d5e9016f64d5527634f3e86b46d8a93e4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-06-20T02:58:26Z","title_canon_sha256":"6c64ae3dd2035ef9426b14f28aec7eb583b34cd48df89d8dbb71555c7df12766"},"schema_version":"1.0","source":{"id":"0906.3765","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.3765","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"0906.3765v3","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.3765","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"XVZD2KJUD2G3","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"XVZD2KJUD2G3VAIJ","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"XVZD2KJU","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:35d55ac10e976b0de1a7a8700ce0429fe137e4e5b7ecff499285cea74bfa22de","target":"graph","created_at":"2026-05-18T03:45:10Z","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":"A resource-bounded version of the statement \"no algorithm recognizes all non-halting Turing machines\" is equivalent to an infinitely often (i.o.) superpolynomial speedup for the time required to accept any coNP-complete language and also equivalent to a superpolynomial speedup in proof length in propositional proof systems for tautologies, each of which implies P!=NP. This suggests a correspondence between the properties 'has no algorithm at all' and 'has no best algorithm' which seems relevant to open problems in computational and proof complexity.","authors_text":"Hunter Monroe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-06-20T02:58:26Z","title":"Speedup for Natural Problems and Noncomputability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.3765","kind":"arxiv","version":3},"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:e72a9521227857e40234e920a2c7ee9e5ff431044698916a98b248f456af77b1","target":"record","created_at":"2026-05-18T03:45:10Z","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":"74142af975ba7477ddcba150234f86d5e9016f64d5527634f3e86b46d8a93e4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-06-20T02:58:26Z","title_canon_sha256":"6c64ae3dd2035ef9426b14f28aec7eb583b34cd48df89d8dbb71555c7df12766"},"schema_version":"1.0","source":{"id":"0906.3765","kind":"arxiv","version":3}},"canonical_sha256":"bd723d29341e8dba8109cc9571c6644b04ca4fabd5378c6aaf0d8557cfc7c95b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd723d29341e8dba8109cc9571c6644b04ca4fabd5378c6aaf0d8557cfc7c95b","first_computed_at":"2026-05-18T03:45:10.967389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:10.967389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yk81ullMRyINxCg/2Dtv3ZMov7Nyn3kB8OMAmne1eL9kLM8MmGY9MTfglE9XK6rBeGH4FcLogMCvqQ2xXec9Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:10.968192Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.3765","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e72a9521227857e40234e920a2c7ee9e5ff431044698916a98b248f456af77b1","sha256:35d55ac10e976b0de1a7a8700ce0429fe137e4e5b7ecff499285cea74bfa22de"],"state_sha256":"1b37f6ca57e85620e0da3669ecef4daab8a8fafacdbb4aebbd9a1034e07b0fc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ek4bO8S6m7811/zoTft9YQMPegq9FYwW9HZPbwz8BTsL+L7B1Jq9l6Y22ybWLqo0eT2itkcPPWyIibd1hosMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:00:57.813994Z","bundle_sha256":"82bb999d1bc5ededdd64c6b442e645d073a779aa72d0e31c9aa572189047a1f4"}}