{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:63NRK2BQ7XJMYA77NBA5YX3Q2R","short_pith_number":"pith:63NRK2BQ","schema_version":"1.0","canonical_sha256":"f6db156830fdd2cc03ff6841dc5f70d4760ebc82dabd6c027310c6e17eaaa87e","source":{"kind":"arxiv","id":"quant-ph/0012104","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0012104","created_at":"2026-05-17T23:57:54.650608+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0012104v1","created_at":"2026-05-17T23:57:54.650608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0012104","created_at":"2026-05-17T23:57:54.650608+00:00"},{"alias_kind":"pith_short_12","alias_value":"63NRK2BQ7XJM","created_at":"2026-05-18T12:25:49.631198+00:00"},{"alias_kind":"pith_short_16","alias_value":"63NRK2BQ7XJMYA77","created_at":"2026-05-18T12:25:49.631198+00:00"},{"alias_kind":"pith_short_8","alias_value":"63NRK2BQ","created_at":"2026-05-18T12:25:49.631198+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R","json":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R.json","graph_json":"https://pith.science/api/pith-number/63NRK2BQ7XJMYA77NBA5YX3Q2R/graph.json","events_json":"https://pith.science/api/pith-number/63NRK2BQ7XJMYA77NBA5YX3Q2R/events.json","paper":"https://pith.science/paper/63NRK2BQ"},"agent_actions":{"view_html":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R","download_json":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R.json","view_paper":"https://pith.science/paper/63NRK2BQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0012104&json=true","fetch_graph":"https://pith.science/api/pith-number/63NRK2BQ7XJMYA77NBA5YX3Q2R/graph.json","fetch_events":"https://pith.science/api/pith-number/63NRK2BQ7XJMYA77NBA5YX3Q2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R/action/storage_attestation","attest_author":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R/action/author_attestation","sign_citation":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R/action/citation_signature","submit_replication":"https://pith.science/pith/63NRK2BQ7XJMYA77NBA5YX3Q2R/action/replication_record"}},"created_at":"2026-05-17T23:57:54.650608+00:00","updated_at":"2026-05-17T23:57:54.650608+00:00"}