{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VLCUSZMWSY432YRTRHJD3SZ3UA","short_pith_number":"pith:VLCUSZMW","canonical_record":{"source":{"id":"1109.6872","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-09-30T16:09:28Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"638cbe5b087a32a2bccb624f4738eebeb56424e959101ea1e095276efa4a1db2","abstract_canon_sha256":"738f5317c5595d2451dc83bf8ce30bd28b51db4e92828e86d23e64e14d264f65"},"schema_version":"1.0"},"canonical_sha256":"aac54965969639bd623389d23dcb3ba005785d10a1ee9b6c4752c0902f272a3f","source":{"kind":"arxiv","id":"1109.6872","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6872","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6872v2","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6872","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"VLCUSZMWSY43","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VLCUSZMWSY432YRT","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VLCUSZMW","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VLCUSZMWSY432YRTRHJD3SZ3UA","target":"record","payload":{"canonical_record":{"source":{"id":"1109.6872","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-09-30T16:09:28Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"638cbe5b087a32a2bccb624f4738eebeb56424e959101ea1e095276efa4a1db2","abstract_canon_sha256":"738f5317c5595d2451dc83bf8ce30bd28b51db4e92828e86d23e64e14d264f65"},"schema_version":"1.0"},"canonical_sha256":"aac54965969639bd623389d23dcb3ba005785d10a1ee9b6c4752c0902f272a3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:35.855768Z","signature_b64":"0f5jO7YcfmWszwVoOuOPZ6kZFRNgXAMOZeZbZ4GMnua4ttTbctAgIjK1m0sHri6dGt7FnTledkI4tqAwx+y4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aac54965969639bd623389d23dcb3ba005785d10a1ee9b6c4752c0902f272a3f","last_reissued_at":"2026-05-18T02:21:35.855201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:35.855201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.6872","source_version":2,"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:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJzC9bhkv9ikxMISBWq1EO5PMJRjCpZ2c8JZfUMvAH7Up8diuDNJTE57zjjkN7tIY9q+XuE8FHLBi5Owydj+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:34:39.002953Z"},"content_sha256":"fc703516bb8d2a3b144c2882096398a6c6be036f500ae7b35ea04eefcdbdd622","schema_version":"1.0","event_id":"sha256:fc703516bb8d2a3b144c2882096398a6c6be036f500ae7b35ea04eefcdbdd622"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VLCUSZMWSY432YRTRHJD3SZ3UA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponential Complexity of the Quantum Adiabatic Algorithm for certain Satisfiability Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"A. P. Young, Itay Hen","submitted_at":"2011-09-30T16:09:28Z","abstract_excerpt":"We determine the complexity of several constraint satisfaction problems using the quantum adiabatic algorithm in its simplest implementation. We do so by studying the size dependence of the gap to the first excited state of \"typical\" instances. We find that at large sizes N, the complexity increases exponentially for all models that we study. We also compare our results against the complexity of the analogous classical algorithm WalkSAT and show that the harder the problem is for the classical algorithm the harder it is also for the quantum adiabatic algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6872","kind":"arxiv","version":2},"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:21:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ftezmXkAw6lkWtFI//y36d+uPrkvVmc4KV6O5VtoBtWARYeXz5Oom55u2MZXfTLdK6O/fb0REuWcizVy2IgJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:34:39.003575Z"},"content_sha256":"4427fd7bf67cadb5cac87548787e1ac91f6157a263d118da1fa7aa20fee227f5","schema_version":"1.0","event_id":"sha256:4427fd7bf67cadb5cac87548787e1ac91f6157a263d118da1fa7aa20fee227f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLCUSZMWSY432YRTRHJD3SZ3UA/bundle.json","state_url":"https://pith.science/pith/VLCUSZMWSY432YRTRHJD3SZ3UA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLCUSZMWSY432YRTRHJD3SZ3UA/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-06T21:34:39Z","links":{"resolver":"https://pith.science/pith/VLCUSZMWSY432YRTRHJD3SZ3UA","bundle":"https://pith.science/pith/VLCUSZMWSY432YRTRHJD3SZ3UA/bundle.json","state":"https://pith.science/pith/VLCUSZMWSY432YRTRHJD3SZ3UA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLCUSZMWSY432YRTRHJD3SZ3UA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VLCUSZMWSY432YRTRHJD3SZ3UA","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":"738f5317c5595d2451dc83bf8ce30bd28b51db4e92828e86d23e64e14d264f65","cross_cats_sorted":["cs.CC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-09-30T16:09:28Z","title_canon_sha256":"638cbe5b087a32a2bccb624f4738eebeb56424e959101ea1e095276efa4a1db2"},"schema_version":"1.0","source":{"id":"1109.6872","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6872","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6872v2","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6872","created_at":"2026-05-18T02:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"VLCUSZMWSY43","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VLCUSZMWSY432YRT","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VLCUSZMW","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:4427fd7bf67cadb5cac87548787e1ac91f6157a263d118da1fa7aa20fee227f5","target":"graph","created_at":"2026-05-18T02:21:35Z","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":"We determine the complexity of several constraint satisfaction problems using the quantum adiabatic algorithm in its simplest implementation. We do so by studying the size dependence of the gap to the first excited state of \"typical\" instances. We find that at large sizes N, the complexity increases exponentially for all models that we study. We also compare our results against the complexity of the analogous classical algorithm WalkSAT and show that the harder the problem is for the classical algorithm the harder it is also for the quantum adiabatic algorithm.","authors_text":"A. P. Young, Itay Hen","cross_cats":["cs.CC","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-09-30T16:09:28Z","title":"Exponential Complexity of the Quantum Adiabatic Algorithm for certain Satisfiability Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6872","kind":"arxiv","version":2},"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:fc703516bb8d2a3b144c2882096398a6c6be036f500ae7b35ea04eefcdbdd622","target":"record","created_at":"2026-05-18T02:21:35Z","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":"738f5317c5595d2451dc83bf8ce30bd28b51db4e92828e86d23e64e14d264f65","cross_cats_sorted":["cs.CC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2011-09-30T16:09:28Z","title_canon_sha256":"638cbe5b087a32a2bccb624f4738eebeb56424e959101ea1e095276efa4a1db2"},"schema_version":"1.0","source":{"id":"1109.6872","kind":"arxiv","version":2}},"canonical_sha256":"aac54965969639bd623389d23dcb3ba005785d10a1ee9b6c4752c0902f272a3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aac54965969639bd623389d23dcb3ba005785d10a1ee9b6c4752c0902f272a3f","first_computed_at":"2026-05-18T02:21:35.855201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:35.855201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0f5jO7YcfmWszwVoOuOPZ6kZFRNgXAMOZeZbZ4GMnua4ttTbctAgIjK1m0sHri6dGt7FnTledkI4tqAwx+y4AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:35.855768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6872","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc703516bb8d2a3b144c2882096398a6c6be036f500ae7b35ea04eefcdbdd622","sha256:4427fd7bf67cadb5cac87548787e1ac91f6157a263d118da1fa7aa20fee227f5"],"state_sha256":"c923087adc56e038560d2252eb737d19b105366885c5cec2bbac0b5cc0070088"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6y/vZmhb7e8kZtXJnW+2JGNHGY+vYPCFhyWmQuhLWVMfxXiyCW1HCWCtWmAkTu0cqicCzmAE1MNnkL/aNEf6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:34:39.006754Z","bundle_sha256":"3cc04280cb46c7a766aa91b93a521704e95b0a1689082b30452508cf92e46f8e"}}