{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WDPGIAFHG6N4PNVQLXBOSUY7CP","short_pith_number":"pith:WDPGIAFH","canonical_record":{"source":{"id":"1009.5104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-09-26T16:09:31Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c14c0b553e7ca12b7bf56e9de805330b5d24a9aadc183ad662cca12f9399eedf","abstract_canon_sha256":"d37d7a4294a84763861008896773a63e16ace3b8efd1b17a97a51ba30057477f"},"schema_version":"1.0"},"canonical_sha256":"b0de6400a7379bc7b6b05dc2e9531f13c395713e49e82127dbd992fb97b6a319","source":{"kind":"arxiv","id":"1009.5104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5104","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5104v1","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5104","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"pith_short_12","alias_value":"WDPGIAFHG6N4","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WDPGIAFHG6N4PNVQ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WDPGIAFH","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WDPGIAFHG6N4PNVQLXBOSUY7CP","target":"record","payload":{"canonical_record":{"source":{"id":"1009.5104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-09-26T16:09:31Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c14c0b553e7ca12b7bf56e9de805330b5d24a9aadc183ad662cca12f9399eedf","abstract_canon_sha256":"d37d7a4294a84763861008896773a63e16ace3b8efd1b17a97a51ba30057477f"},"schema_version":"1.0"},"canonical_sha256":"b0de6400a7379bc7b6b05dc2e9531f13c395713e49e82127dbd992fb97b6a319","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:19.165879Z","signature_b64":"4CZTsk06EZzcM4/D3tZYVjGeU3g3wCi2iFkL1efcrHuD9xSIP9M+pIoYCn6bYNdfg2nua7nntU5AC1sX0jkGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0de6400a7379bc7b6b05dc2e9531f13c395713e49e82127dbd992fb97b6a319","last_reissued_at":"2026-05-18T04:40:19.165154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:19.165154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.5104","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-18T04:40:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PI4WiU1JjwGPiRD87amuv1Tx+MdvzGY8hmxZ1oxIqHl1Rx+S0OfzthxTCSoummmhDX3Ty1bnR3SBr3wiqV01CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:30:52.339998Z"},"content_sha256":"7e17226b21cef2311ecb2785d965c2c960b3ab621def59e82f47903c8a3f2823","schema_version":"1.0","event_id":"sha256:7e17226b21cef2311ecb2785d965c2c960b3ab621def59e82f47903c8a3f2823"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WDPGIAFHG6N4PNVQLXBOSUY7CP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Equivalence of Sampling and Searching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Scott Aaronson","submitted_at":"2010-09-26T16:09:31Z","abstract_excerpt":"In a sampling problem, we are given an input x, and asked to sample approximately from a probability distribution D_x. In a search problem, we are given an input x, and asked to find a member of a nonempty set A_x with high probability. (An example is finding a Nash equilibrium.) In this paper, we use tools from Kolmogorov complexity and algorithmic information theory to show that sampling and search problems are essentially equivalent. More precisely, for any sampling problem S, there exists a search problem R_S such that, if C is any \"reasonable\" complexity class, then R_S is in the search v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5104","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-18T04:40:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCgsS/qrIc8yaHbW6jgdc660R5FU64b1G9Lslygkhcxodpdhhz7FmyetKC4ua6sHoekhCOjGPqgXvQLOhOcaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:30:52.340361Z"},"content_sha256":"caeed0e886fe04ebe69008c29504dadec84dc3005df6a3d07422b5a62bd33639","schema_version":"1.0","event_id":"sha256:caeed0e886fe04ebe69008c29504dadec84dc3005df6a3d07422b5a62bd33639"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDPGIAFHG6N4PNVQLXBOSUY7CP/bundle.json","state_url":"https://pith.science/pith/WDPGIAFHG6N4PNVQLXBOSUY7CP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDPGIAFHG6N4PNVQLXBOSUY7CP/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-20T09:30:52Z","links":{"resolver":"https://pith.science/pith/WDPGIAFHG6N4PNVQLXBOSUY7CP","bundle":"https://pith.science/pith/WDPGIAFHG6N4PNVQLXBOSUY7CP/bundle.json","state":"https://pith.science/pith/WDPGIAFHG6N4PNVQLXBOSUY7CP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDPGIAFHG6N4PNVQLXBOSUY7CP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WDPGIAFHG6N4PNVQLXBOSUY7CP","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":"d37d7a4294a84763861008896773a63e16ace3b8efd1b17a97a51ba30057477f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-09-26T16:09:31Z","title_canon_sha256":"c14c0b553e7ca12b7bf56e9de805330b5d24a9aadc183ad662cca12f9399eedf"},"schema_version":"1.0","source":{"id":"1009.5104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5104","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5104v1","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5104","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"pith_short_12","alias_value":"WDPGIAFHG6N4","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WDPGIAFHG6N4PNVQ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WDPGIAFH","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:caeed0e886fe04ebe69008c29504dadec84dc3005df6a3d07422b5a62bd33639","target":"graph","created_at":"2026-05-18T04:40:19Z","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":"In a sampling problem, we are given an input x, and asked to sample approximately from a probability distribution D_x. In a search problem, we are given an input x, and asked to find a member of a nonempty set A_x with high probability. (An example is finding a Nash equilibrium.) In this paper, we use tools from Kolmogorov complexity and algorithmic information theory to show that sampling and search problems are essentially equivalent. More precisely, for any sampling problem S, there exists a search problem R_S such that, if C is any \"reasonable\" complexity class, then R_S is in the search v","authors_text":"Scott Aaronson","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-09-26T16:09:31Z","title":"The Equivalence of Sampling and Searching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5104","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:7e17226b21cef2311ecb2785d965c2c960b3ab621def59e82f47903c8a3f2823","target":"record","created_at":"2026-05-18T04:40:19Z","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":"d37d7a4294a84763861008896773a63e16ace3b8efd1b17a97a51ba30057477f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-09-26T16:09:31Z","title_canon_sha256":"c14c0b553e7ca12b7bf56e9de805330b5d24a9aadc183ad662cca12f9399eedf"},"schema_version":"1.0","source":{"id":"1009.5104","kind":"arxiv","version":1}},"canonical_sha256":"b0de6400a7379bc7b6b05dc2e9531f13c395713e49e82127dbd992fb97b6a319","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0de6400a7379bc7b6b05dc2e9531f13c395713e49e82127dbd992fb97b6a319","first_computed_at":"2026-05-18T04:40:19.165154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:19.165154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4CZTsk06EZzcM4/D3tZYVjGeU3g3wCi2iFkL1efcrHuD9xSIP9M+pIoYCn6bYNdfg2nua7nntU5AC1sX0jkGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:19.165879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.5104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e17226b21cef2311ecb2785d965c2c960b3ab621def59e82f47903c8a3f2823","sha256:caeed0e886fe04ebe69008c29504dadec84dc3005df6a3d07422b5a62bd33639"],"state_sha256":"1508c80c1c6618707e04f397e929fb7f8aa41eb2e8332dfd5b00d10e019faeae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nUzbLL8OOo4JzODmdqASzKV1ZuZcose/izGuiajM+FELPqSAE0ggbln7KXqQsFOilTuukeVQ/XBfyN59nPk7Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T09:30:52.342444Z","bundle_sha256":"ea689551f34adbbbb9560f01944609bdc0ed007e28a4687dddbb759ba0e72935"}}