{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4TLV22R3HKWO4E2A4LZ7YPZG5X","short_pith_number":"pith:4TLV22R3","schema_version":"1.0","canonical_sha256":"e4d75d6a3b3aacee1340e2f3fc3f26edc437f4bbd8e5c114ab90dcc8e689b5a7","source":{"kind":"arxiv","id":"2409.12240","version":2},"attestation_state":"computed","paper":{"title":"Large-scale quantum annealing simulation with tensor networks and belief propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Egor S. Tiunov, Ilia A. Luchnikov, Leandro Aolita, Tobias Haug","submitted_at":"2024-09-18T18:00:08Z","abstract_excerpt":"Quantum annealing and quantum approximate optimization algorithms hold a great potential to speed-up optimization problems. This could be game-changing for a plethora of applications. Yet, in order to hope to beat classical solvers, quantum circuits must scale up to sizes and performances much beyond current hardware. In that quest, intense experimental effort has been recently devoted to optimizations on 3-regular graphs, which are computationally hard but experimentally relatively amenable. However, even there, the amount and quality of quantum resources required for quantum solvers to outpe"},"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":"2409.12240","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-09-18T18:00:08Z","cross_cats_sorted":[],"title_canon_sha256":"75c1280ff018de1be5cbedfd1acac5968e2cc5cc290d4c97bb1b6464ea2f5ac2","abstract_canon_sha256":"5b92e68eb82c8c08be371c3ed09b9a6608420434fc6f535d9d8562efbf41627e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:31.694448Z","signature_b64":"BzbtFgBaOL7aykSYGXwLraLRJNyBEquEZ31veKyKbiEyL2r25rX5sUOhCHOg9ReWSNhcayBu1QdORpHygEmDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4d75d6a3b3aacee1340e2f3fc3f26edc437f4bbd8e5c114ab90dcc8e689b5a7","last_reissued_at":"2026-07-05T09:19:31.693994Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:31.693994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large-scale quantum annealing simulation with tensor networks and belief propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Egor S. Tiunov, Ilia A. Luchnikov, Leandro Aolita, Tobias Haug","submitted_at":"2024-09-18T18:00:08Z","abstract_excerpt":"Quantum annealing and quantum approximate optimization algorithms hold a great potential to speed-up optimization problems. This could be game-changing for a plethora of applications. Yet, in order to hope to beat classical solvers, quantum circuits must scale up to sizes and performances much beyond current hardware. In that quest, intense experimental effort has been recently devoted to optimizations on 3-regular graphs, which are computationally hard but experimentally relatively amenable. However, even there, the amount and quality of quantum resources required for quantum solvers to outpe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12240","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.12240/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":"2409.12240","created_at":"2026-07-05T09:19:31.694050+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.12240v2","created_at":"2026-07-05T09:19:31.694050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12240","created_at":"2026-07-05T09:19:31.694050+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TLV22R3HKWO","created_at":"2026-07-05T09:19:31.694050+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TLV22R3HKWO4E2A","created_at":"2026-07-05T09:19:31.694050+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TLV22R3","created_at":"2026-07-05T09:19:31.694050+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05311","citing_title":"Setting angles in quantum approximate optimization at utility-scale","ref_index":151,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26233","citing_title":"A fidelity metric for quantum annealing benchmarked by extreme scaling quantum Monte-Carlo simulations","ref_index":58,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4TLV22R3HKWO4E2A4LZ7YPZG5X","json":"https://pith.science/pith/4TLV22R3HKWO4E2A4LZ7YPZG5X.json","graph_json":"https://pith.science/api/pith-number/4TLV22R3HKWO4E2A4LZ7YPZG5X/graph.json","events_json":"https://pith.science/api/pith-number/4TLV22R3HKWO4E2A4LZ7YPZG5X/events.json","paper":"https://pith.science/paper/4TLV22R3"},"agent_actions":{"view_html":"https://pith.science/pith/4TLV22R3HKWO4E2A4LZ7YPZG5X","download_json":"https://pith.science/pith/4TLV22R3HKWO4E2A4LZ7YPZG5X.json","view_paper":"https://pith.science/paper/4TLV22R3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.12240&json=true","fetch_graph":"https://pith.science/api/pith-number/4TLV22R3HKWO4E2A4LZ7YPZG5X/graph.json","fetch_events":"https://pith.science/api/pith-number/4TLV22R3HKWO4E2A4LZ7YPZG5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TLV22R3HKWO4E2A4LZ7YPZG5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TLV22R3HKWO4E2A4LZ7YPZG5X/action/storage_attestation","attest_author":"https://pith.science/pith/4TLV22R3HKWO4E2A4LZ7YPZG5X/action/author_attestation","sign_citation":"https://pith.science/pith/4TLV22R3HKWO4E2A4LZ7YPZG5X/action/citation_signature","submit_replication":"https://pith.science/pith/4TLV22R3HKWO4E2A4LZ7YPZG5X/action/replication_record"}},"created_at":"2026-07-05T09:19:31.694050+00:00","updated_at":"2026-07-05T09:19:31.694050+00:00"}