{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QHRHVDZXH6IULW2MBGXCPGXBEJ","short_pith_number":"pith:QHRHVDZX","schema_version":"1.0","canonical_sha256":"81e27a8f373f9145db4c09ae279ae1226d13e2af69a27aee090cf8a9cc2b8163","source":{"kind":"arxiv","id":"1011.3445","version":5},"attestation_state":"computed","paper":{"title":"Quantum Hamiltonian complexity and the detectability lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Itai Arad, Umesh Vazirani, Zeph Landau","submitted_at":"2010-11-15T16:45:43Z","abstract_excerpt":"Quantum Hamiltonian complexity studies computational complexity aspects of local Hamiltonians and ground states; these questions can be viewed as generalizations of classical computational complexity problems related to local constraint satisfaction (such as SAT), with the additional ingredient of multi-particle entanglement. This additional ingredient of course makes generalizations of celebrated theorems such as the PCP theorem from classical to the quantum domain highly non-trivial; it also raises entirely new questions such as bounds on entanglement and correlations in ground states, and i"},"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":"1011.3445","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-15T16:45:43Z","cross_cats_sorted":["cond-mat.other"],"title_canon_sha256":"aabdc2f60764d96d88562f1af9f63cf5a8a1936fc799f32fdc8775e5c86f1618","abstract_canon_sha256":"86dbdc9cc406d412f4a9f8726e1ecfd23095339bbfbb7a4df6da9f16d50cf405"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:36.647611Z","signature_b64":"IaU5FzGxq9xe2k4mRVEveHjJ8M44gf+FLmkstzIaRbzrbPb1CN/3fWzizlPA3MCwy94ZQOEQLf7ffIvFGedsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81e27a8f373f9145db4c09ae279ae1226d13e2af69a27aee090cf8a9cc2b8163","last_reissued_at":"2026-05-18T02:23:36.647004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:36.647004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Hamiltonian complexity and the detectability lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other"],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Itai Arad, Umesh Vazirani, Zeph Landau","submitted_at":"2010-11-15T16:45:43Z","abstract_excerpt":"Quantum Hamiltonian complexity studies computational complexity aspects of local Hamiltonians and ground states; these questions can be viewed as generalizations of classical computational complexity problems related to local constraint satisfaction (such as SAT), with the additional ingredient of multi-particle entanglement. This additional ingredient of course makes generalizations of celebrated theorems such as the PCP theorem from classical to the quantum domain highly non-trivial; it also raises entirely new questions such as bounds on entanglement and correlations in ground states, and i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3445","kind":"arxiv","version":5},"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":"1011.3445","created_at":"2026-05-18T02:23:36.647095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3445v5","created_at":"2026-05-18T02:23:36.647095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3445","created_at":"2026-05-18T02:23:36.647095+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHRHVDZXH6IU","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHRHVDZXH6IULW2M","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHRHVDZX","created_at":"2026-05-18T12:26:12.377268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00088","citing_title":"A Unified Framework for Locally Stable Phases","ref_index":85,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07214","citing_title":"Quantum Gibbs sampling through the detectability lemma","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QHRHVDZXH6IULW2MBGXCPGXBEJ","json":"https://pith.science/pith/QHRHVDZXH6IULW2MBGXCPGXBEJ.json","graph_json":"https://pith.science/api/pith-number/QHRHVDZXH6IULW2MBGXCPGXBEJ/graph.json","events_json":"https://pith.science/api/pith-number/QHRHVDZXH6IULW2MBGXCPGXBEJ/events.json","paper":"https://pith.science/paper/QHRHVDZX"},"agent_actions":{"view_html":"https://pith.science/pith/QHRHVDZXH6IULW2MBGXCPGXBEJ","download_json":"https://pith.science/pith/QHRHVDZXH6IULW2MBGXCPGXBEJ.json","view_paper":"https://pith.science/paper/QHRHVDZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3445&json=true","fetch_graph":"https://pith.science/api/pith-number/QHRHVDZXH6IULW2MBGXCPGXBEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QHRHVDZXH6IULW2MBGXCPGXBEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHRHVDZXH6IULW2MBGXCPGXBEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHRHVDZXH6IULW2MBGXCPGXBEJ/action/storage_attestation","attest_author":"https://pith.science/pith/QHRHVDZXH6IULW2MBGXCPGXBEJ/action/author_attestation","sign_citation":"https://pith.science/pith/QHRHVDZXH6IULW2MBGXCPGXBEJ/action/citation_signature","submit_replication":"https://pith.science/pith/QHRHVDZXH6IULW2MBGXCPGXBEJ/action/replication_record"}},"created_at":"2026-05-18T02:23:36.647095+00:00","updated_at":"2026-05-18T02:23:36.647095+00:00"}