{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SO55QTKBR2MKMLAEKT4E7BM3FU","short_pith_number":"pith:SO55QTKB","schema_version":"1.0","canonical_sha256":"93bbd84d418e98a62c0454f84f859b2d39119a117ff58f24bbe093c1026a02d7","source":{"kind":"arxiv","id":"2501.01107","version":3},"attestation_state":"computed","paper":{"title":"Computational complexity of three-dimensional Ising spin glass: Lessons from D-Wave annealer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alex Kamenev, Hao Zhang","submitted_at":"2025-01-02T07:08:13Z","abstract_excerpt":"Finding an exact ground state of a three-dimensional (3D) Ising spin glass is proven to be an NP-hard problem (i.e., at least as hard as any problem in the nondeterministic polynomial-time (NP) class). Given validity of the exponential time hypothesis, its computational complexity was proven to be no less than $2^{N^{2/3}}$, where $N$ is the total number of spins. Here, we report results of extensive experimentation with D-Wave 3D annealer with $N\\le 5627$. We found exact ground states (in a probabilistic sense) for typical realizations of 3D spin glasses with the efficiency, which scales as $"},"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":"2501.01107","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2025-01-02T07:08:13Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"2f64b1514743c43e940de0e6aa5477f96e029ac9d00fed006a89c3f69b467440","abstract_canon_sha256":"b2ad701eeaf7f4a9d8d69e3fe2e34d8ee0c9c621be7b22a5d16e2fffd8f37565"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:43.938255Z","signature_b64":"R63vv5rBG42KurIGYAA0MFsVGokhIpqDuF3kORvyQNnEvyDSdXvTWZS1YGvKVfI+tr7wrz69I00RrZPm7kC+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93bbd84d418e98a62c0454f84f859b2d39119a117ff58f24bbe093c1026a02d7","last_reissued_at":"2026-07-05T11:44:43.937774Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:43.937774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational complexity of three-dimensional Ising spin glass: Lessons from D-Wave annealer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alex Kamenev, Hao Zhang","submitted_at":"2025-01-02T07:08:13Z","abstract_excerpt":"Finding an exact ground state of a three-dimensional (3D) Ising spin glass is proven to be an NP-hard problem (i.e., at least as hard as any problem in the nondeterministic polynomial-time (NP) class). Given validity of the exponential time hypothesis, its computational complexity was proven to be no less than $2^{N^{2/3}}$, where $N$ is the total number of spins. Here, we report results of extensive experimentation with D-Wave 3D annealer with $N\\le 5627$. We found exact ground states (in a probabilistic sense) for typical realizations of 3D spin glasses with the efficiency, which scales as $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.01107","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.01107/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.01107","created_at":"2026-07-05T11:44:43.937832+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.01107v3","created_at":"2026-07-05T11:44:43.937832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.01107","created_at":"2026-07-05T11:44:43.937832+00:00"},{"alias_kind":"pith_short_12","alias_value":"SO55QTKBR2MK","created_at":"2026-07-05T11:44:43.937832+00:00"},{"alias_kind":"pith_short_16","alias_value":"SO55QTKBR2MKMLAE","created_at":"2026-07-05T11:44:43.937832+00:00"},{"alias_kind":"pith_short_8","alias_value":"SO55QTKB","created_at":"2026-07-05T11:44:43.937832+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.09308","citing_title":"Quantum Algorithm Software for Condensed Matter Physics","ref_index":63,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SO55QTKBR2MKMLAEKT4E7BM3FU","json":"https://pith.science/pith/SO55QTKBR2MKMLAEKT4E7BM3FU.json","graph_json":"https://pith.science/api/pith-number/SO55QTKBR2MKMLAEKT4E7BM3FU/graph.json","events_json":"https://pith.science/api/pith-number/SO55QTKBR2MKMLAEKT4E7BM3FU/events.json","paper":"https://pith.science/paper/SO55QTKB"},"agent_actions":{"view_html":"https://pith.science/pith/SO55QTKBR2MKMLAEKT4E7BM3FU","download_json":"https://pith.science/pith/SO55QTKBR2MKMLAEKT4E7BM3FU.json","view_paper":"https://pith.science/paper/SO55QTKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.01107&json=true","fetch_graph":"https://pith.science/api/pith-number/SO55QTKBR2MKMLAEKT4E7BM3FU/graph.json","fetch_events":"https://pith.science/api/pith-number/SO55QTKBR2MKMLAEKT4E7BM3FU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SO55QTKBR2MKMLAEKT4E7BM3FU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SO55QTKBR2MKMLAEKT4E7BM3FU/action/storage_attestation","attest_author":"https://pith.science/pith/SO55QTKBR2MKMLAEKT4E7BM3FU/action/author_attestation","sign_citation":"https://pith.science/pith/SO55QTKBR2MKMLAEKT4E7BM3FU/action/citation_signature","submit_replication":"https://pith.science/pith/SO55QTKBR2MKMLAEKT4E7BM3FU/action/replication_record"}},"created_at":"2026-07-05T11:44:43.937832+00:00","updated_at":"2026-07-05T11:44:43.937832+00:00"}