{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:63NRK2BQ7XJMYA77NBA5YX3Q2R","short_pith_number":"pith:63NRK2BQ","canonical_record":{"source":{"id":"quant-ph/0012104","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-12-19T18:58:08Z","cross_cats_sorted":[],"title_canon_sha256":"3aebaba7475e7a06c2ff9e810e2e3803043bc83cc4cd8de1cde1e62061f6d283","abstract_canon_sha256":"2bfdbd7dd2dea18cbabbe07dad2bdb9a68ed2de65930be88cf0e61db1ba79072"},"schema_version":"1.0"},"canonical_sha256":"f6db156830fdd2cc03ff6841dc5f70d4760ebc82dabd6c027310c6e17eaaa87e","source":{"kind":"arxiv","id":"quant-ph/0012104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0012104","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0012104v1","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0012104","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"pith_short_12","alias_value":"63NRK2BQ7XJM","created_at":"2026-05-18T12:25:49Z"},{"alias_kind":"pith_short_16","alias_value":"63NRK2BQ7XJMYA77","created_at":"2026-05-18T12:25:49Z"},{"alias_kind":"pith_short_8","alias_value":"63NRK2BQ","created_at":"2026-05-18T12:25:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:63NRK2BQ7XJMYA77NBA5YX3Q2R","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0012104","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-12-19T18:58:08Z","cross_cats_sorted":[],"title_canon_sha256":"3aebaba7475e7a06c2ff9e810e2e3803043bc83cc4cd8de1cde1e62061f6d283","abstract_canon_sha256":"2bfdbd7dd2dea18cbabbe07dad2bdb9a68ed2de65930be88cf0e61db1ba79072"},"schema_version":"1.0"},"canonical_sha256":"f6db156830fdd2cc03ff6841dc5f70d4760ebc82dabd6c027310c6e17eaaa87e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:54.651138Z","signature_b64":"hZUeJfqxQ0d0K7zdWG1koc+TFQp4u9ykMrqkg5j1jPg+Y4Wm+UABU1xDGu2fUoEuyhAnIguZ24pCuUvTDrpYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6db156830fdd2cc03ff6841dc5f70d4760ebc82dabd6c027310c6e17eaaa87e","last_reissued_at":"2026-05-17T23:57:54.650528Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:54.650528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0012104","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-17T23:57:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AZGOBG4ff5YDtfbVYl23+1uH11/BiBRy2bCYrs1DTtXeiP31A9mSp8u/M51RoDzMpuoDunjQPpPsASOvlqYIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:35:59.148912Z"},"content_sha256":"99147c9753f82dc196bdc688487b17638a9951f59a180fb7137c27915bec281d","schema_version":"1.0","event_id":"sha256:99147c9753f82dc196bdc688487b17638a9951f59a180fb7137c27915bec281d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:63NRK2BQ7XJMYA77NBA5YX3Q2R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding cliques by quantum adiabatic evolution","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Edward Farhi, Jeffrey Goldstone, Sam Gutmann","submitted_at":"2000-12-19T18:58:08Z","abstract_excerpt":"Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An n-vertex random graph has each edge included with probability 1/2, and a clique is a completely connected subgraph. There is no known classical algorithm that finds the largest clique in a random graph with high probability and runs in a time polynomial in n. For the small graphs we are able to investi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0012104","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-17T23:57:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"whySLHEnmXHeFRiZJohX8ljpVLSNyp3B//zCZqCHFMCcugp1eDsxAtKim4L7N2DXboMTXaHalxxiZoIPvoapCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:35:59.149272Z"},"content_sha256":"969520711c89425b391ee2e16b707006c9a546625efd4319f70c612c6e6ff94f","schema_version":"1.0","event_id":"sha256:969520711c89425b391ee2e16b707006c9a546625efd4319f70c612c6e6ff94f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R/bundle.json","state_url":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R/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-01T21:35:59Z","links":{"resolver":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R","bundle":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R/bundle.json","state":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:63NRK2BQ7XJMYA77NBA5YX3Q2R","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":"2bfdbd7dd2dea18cbabbe07dad2bdb9a68ed2de65930be88cf0e61db1ba79072","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2000-12-19T18:58:08Z","title_canon_sha256":"3aebaba7475e7a06c2ff9e810e2e3803043bc83cc4cd8de1cde1e62061f6d283"},"schema_version":"1.0","source":{"id":"quant-ph/0012104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0012104","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0012104v1","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0012104","created_at":"2026-05-17T23:57:54Z"},{"alias_kind":"pith_short_12","alias_value":"63NRK2BQ7XJM","created_at":"2026-05-18T12:25:49Z"},{"alias_kind":"pith_short_16","alias_value":"63NRK2BQ7XJMYA77","created_at":"2026-05-18T12:25:49Z"},{"alias_kind":"pith_short_8","alias_value":"63NRK2BQ","created_at":"2026-05-18T12:25:49Z"}],"graph_snapshots":[{"event_id":"sha256:969520711c89425b391ee2e16b707006c9a546625efd4319f70c612c6e6ff94f","target":"graph","created_at":"2026-05-17T23:57:54Z","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":"Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An n-vertex random graph has each edge included with probability 1/2, and a clique is a completely connected subgraph. There is no known classical algorithm that finds the largest clique in a random graph with high probability and runs in a time polynomial in n. For the small graphs we are able to investi","authors_text":"Andrew M. Childs, Edward Farhi, Jeffrey Goldstone, Sam Gutmann","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2000-12-19T18:58:08Z","title":"Finding cliques by quantum adiabatic evolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0012104","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:99147c9753f82dc196bdc688487b17638a9951f59a180fb7137c27915bec281d","target":"record","created_at":"2026-05-17T23:57:54Z","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":"2bfdbd7dd2dea18cbabbe07dad2bdb9a68ed2de65930be88cf0e61db1ba79072","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2000-12-19T18:58:08Z","title_canon_sha256":"3aebaba7475e7a06c2ff9e810e2e3803043bc83cc4cd8de1cde1e62061f6d283"},"schema_version":"1.0","source":{"id":"quant-ph/0012104","kind":"arxiv","version":1}},"canonical_sha256":"f6db156830fdd2cc03ff6841dc5f70d4760ebc82dabd6c027310c6e17eaaa87e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6db156830fdd2cc03ff6841dc5f70d4760ebc82dabd6c027310c6e17eaaa87e","first_computed_at":"2026-05-17T23:57:54.650528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:54.650528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hZUeJfqxQ0d0K7zdWG1koc+TFQp4u9ykMrqkg5j1jPg+Y4Wm+UABU1xDGu2fUoEuyhAnIguZ24pCuUvTDrpYCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:54.651138Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0012104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99147c9753f82dc196bdc688487b17638a9951f59a180fb7137c27915bec281d","sha256:969520711c89425b391ee2e16b707006c9a546625efd4319f70c612c6e6ff94f"],"state_sha256":"bb6ff35aa7358e0d04b72e8ab5f4ab82e05d1bd2b53a9efcc4c3cd2440fb6de4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xg9XcPjkXuRi/7EG7zmiXZ4Iquq13GaUPQ0LWJb5sWwFvpAYdLiC8xmyL7aE++17Cxi7IUHlvqd+xOR4yxTgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:35:59.151171Z","bundle_sha256":"8269f30e1814aa68b56bf6802ed7001403a4e06e219d6c7540fbd53caebfabcb"}}