{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FDCARDFETHHVUG56W5SK3YAX6G","short_pith_number":"pith:FDCARDFE","schema_version":"1.0","canonical_sha256":"28c4088ca499cf5a1bbeb764ade017f1a58704d40bbe41191d7327f6d9547746","source":{"kind":"arxiv","id":"1208.3757","version":2},"attestation_state":"computed","paper":{"title":"The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"A. P. Young, A. W. Sandvik, David Gosset, Edward Farhi, Francesco Zamponi, Itay Hen, Peter Shor","submitted_at":"2012-08-18T15:59:12Z","abstract_excerpt":"In this paper we study the performance of the quantum adiabatic algorithm on random instances of two combinatorial optimization problems, 3-regular 3-XORSAT and 3-regular Max-Cut. The cost functions associated with these two clause-based optimization problems are similar as they are both defined on 3-regular hypergraphs. For 3-regular 3-XORSAT the clauses contain three variables and for 3-regular Max-Cut the clauses contain two variables. The quantum adiabatic algorithms we study for these two problems use interpolating Hamiltonians which are stoquastic and therefore amenable to sign-problem f"},"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":"1208.3757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-18T15:59:12Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"c3ffb0e5e71b7e27f22d77aa26102dc5e79264fcbf8716c3a9b180f61083f32c","abstract_canon_sha256":"669f50031235bbfa61a26c28ca0b472960b8dacc34f4132f00c5229248a11f4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:28.186846Z","signature_b64":"SYuAgWkXFs9RB3qqt3WZrOxQ9+dGmRxW66ids8Mg7QF0e0nHoc9PLrWVLqFnYcQHcRSbKL+iju3X8bQd2uynDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28c4088ca499cf5a1bbeb764ade017f1a58704d40bbe41191d7327f6d9547746","last_reissued_at":"2026-05-18T03:39:28.186062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:28.186062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"quant-ph","authors_text":"A. P. Young, A. W. Sandvik, David Gosset, Edward Farhi, Francesco Zamponi, Itay Hen, Peter Shor","submitted_at":"2012-08-18T15:59:12Z","abstract_excerpt":"In this paper we study the performance of the quantum adiabatic algorithm on random instances of two combinatorial optimization problems, 3-regular 3-XORSAT and 3-regular Max-Cut. The cost functions associated with these two clause-based optimization problems are similar as they are both defined on 3-regular hypergraphs. For 3-regular 3-XORSAT the clauses contain three variables and for 3-regular Max-Cut the clauses contain two variables. The quantum adiabatic algorithms we study for these two problems use interpolating Hamiltonians which are stoquastic and therefore amenable to sign-problem f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3757","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1208.3757","created_at":"2026-05-18T03:39:28.186184+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.3757v2","created_at":"2026-05-18T03:39:28.186184+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3757","created_at":"2026-05-18T03:39:28.186184+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDCARDFETHHV","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDCARDFETHHVUG56","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDCARDFE","created_at":"2026-05-18T12:27:06.952714+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/FDCARDFETHHVUG56W5SK3YAX6G","json":"https://pith.science/pith/FDCARDFETHHVUG56W5SK3YAX6G.json","graph_json":"https://pith.science/api/pith-number/FDCARDFETHHVUG56W5SK3YAX6G/graph.json","events_json":"https://pith.science/api/pith-number/FDCARDFETHHVUG56W5SK3YAX6G/events.json","paper":"https://pith.science/paper/FDCARDFE"},"agent_actions":{"view_html":"https://pith.science/pith/FDCARDFETHHVUG56W5SK3YAX6G","download_json":"https://pith.science/pith/FDCARDFETHHVUG56W5SK3YAX6G.json","view_paper":"https://pith.science/paper/FDCARDFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.3757&json=true","fetch_graph":"https://pith.science/api/pith-number/FDCARDFETHHVUG56W5SK3YAX6G/graph.json","fetch_events":"https://pith.science/api/pith-number/FDCARDFETHHVUG56W5SK3YAX6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDCARDFETHHVUG56W5SK3YAX6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDCARDFETHHVUG56W5SK3YAX6G/action/storage_attestation","attest_author":"https://pith.science/pith/FDCARDFETHHVUG56W5SK3YAX6G/action/author_attestation","sign_citation":"https://pith.science/pith/FDCARDFETHHVUG56W5SK3YAX6G/action/citation_signature","submit_replication":"https://pith.science/pith/FDCARDFETHHVUG56W5SK3YAX6G/action/replication_record"}},"created_at":"2026-05-18T03:39:28.186184+00:00","updated_at":"2026-05-18T03:39:28.186184+00:00"}