{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:T3WMXF2PBKDH5CN45FJWBO6D4P","short_pith_number":"pith:T3WMXF2P","schema_version":"1.0","canonical_sha256":"9eeccb974f0a867e89bce95360bbc3e3d855a25a5ce561b299d8557502cff77f","source":{"kind":"arxiv","id":"2411.16431","version":3},"attestation_state":"computed","paper":{"title":"Limitations of tensor network approaches for optimization and sampling: A comparison to quantum and classical Ising machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Anna Maria Dziubyna, Bart{\\l}omiej Gardas, Marek M. Rams, Masoud Mohseni, Tomasz \\'Smierzchalski","submitted_at":"2024-11-25T14:35:14Z","abstract_excerpt":"Optimization problems pose challenges across various fields. In recent years, quantum annealers have emerged as a promising platform for tackling such challenges. To provide a new perspective, we develop a heuristic tensor network (TN) based algorithm to reveal the low-energy spectrum of Ising spin-glass systems with interaction graphs relevant to present-day quantum annealers. Our deterministic approach combines a branch-and-bound search strategy with an approximate calculation of marginals via TN contractions. Its application to quasi-two-dimensional lattices with large unit cells of up to 2"},"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":"2411.16431","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2024-11-25T14:35:14Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"926d9852c85f594408d49b6e29b8862e8a249fd0ce68c5df881d2caf94d7ccd0","abstract_canon_sha256":"81aa3e670ac573f05c37decc97d24fa5d60bace0972c42643195b9ff4bb9a7cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:38.590389Z","signature_b64":"gbpt1Jf5xZBfE5fKsCUhb6C5BNX/9Nq7X7u9CWydVPZi3/M/eFaMjSC/T0gn7YfmkreZ+/I4VJO01fEUYw+2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9eeccb974f0a867e89bce95360bbc3e3d855a25a5ce561b299d8557502cff77f","last_reissued_at":"2026-07-05T11:21:38.589895Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:38.589895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limitations of tensor network approaches for optimization and sampling: A comparison to quantum and classical Ising machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Anna Maria Dziubyna, Bart{\\l}omiej Gardas, Marek M. Rams, Masoud Mohseni, Tomasz \\'Smierzchalski","submitted_at":"2024-11-25T14:35:14Z","abstract_excerpt":"Optimization problems pose challenges across various fields. In recent years, quantum annealers have emerged as a promising platform for tackling such challenges. To provide a new perspective, we develop a heuristic tensor network (TN) based algorithm to reveal the low-energy spectrum of Ising spin-glass systems with interaction graphs relevant to present-day quantum annealers. Our deterministic approach combines a branch-and-bound search strategy with an approximate calculation of marginals via TN contractions. Its application to quasi-two-dimensional lattices with large unit cells of up to 2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16431","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/2411.16431/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":"2411.16431","created_at":"2026-07-05T11:21:38.589953+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16431v3","created_at":"2026-07-05T11:21:38.589953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16431","created_at":"2026-07-05T11:21:38.589953+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3WMXF2PBKDH","created_at":"2026-07-05T11:21:38.589953+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3WMXF2PBKDH5CN4","created_at":"2026-07-05T11:21:38.589953+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3WMXF2P","created_at":"2026-07-05T11:21:38.589953+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.19221","citing_title":"VeloxQ: A Fast and Efficient QUBO Solver","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T3WMXF2PBKDH5CN45FJWBO6D4P","json":"https://pith.science/pith/T3WMXF2PBKDH5CN45FJWBO6D4P.json","graph_json":"https://pith.science/api/pith-number/T3WMXF2PBKDH5CN45FJWBO6D4P/graph.json","events_json":"https://pith.science/api/pith-number/T3WMXF2PBKDH5CN45FJWBO6D4P/events.json","paper":"https://pith.science/paper/T3WMXF2P"},"agent_actions":{"view_html":"https://pith.science/pith/T3WMXF2PBKDH5CN45FJWBO6D4P","download_json":"https://pith.science/pith/T3WMXF2PBKDH5CN45FJWBO6D4P.json","view_paper":"https://pith.science/paper/T3WMXF2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16431&json=true","fetch_graph":"https://pith.science/api/pith-number/T3WMXF2PBKDH5CN45FJWBO6D4P/graph.json","fetch_events":"https://pith.science/api/pith-number/T3WMXF2PBKDH5CN45FJWBO6D4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3WMXF2PBKDH5CN45FJWBO6D4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3WMXF2PBKDH5CN45FJWBO6D4P/action/storage_attestation","attest_author":"https://pith.science/pith/T3WMXF2PBKDH5CN45FJWBO6D4P/action/author_attestation","sign_citation":"https://pith.science/pith/T3WMXF2PBKDH5CN45FJWBO6D4P/action/citation_signature","submit_replication":"https://pith.science/pith/T3WMXF2PBKDH5CN45FJWBO6D4P/action/replication_record"}},"created_at":"2026-07-05T11:21:38.589953+00:00","updated_at":"2026-07-05T11:21:38.589953+00:00"}