{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TVAVIPRMOJRM54EK4FSQHSD6XV","short_pith_number":"pith:TVAVIPRM","schema_version":"1.0","canonical_sha256":"9d41543e2c7262cef08ae16503c87ebd597dd4b3afb10959508d97d01095b221","source":{"kind":"arxiv","id":"2507.22117","version":1},"attestation_state":"computed","paper":{"title":"A comprehensive benchmark of an Ising machine on the Max-Cut problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Christian M\\\"unch, Fritz Schinkel, Markus Kirsch, Marten Winkler, Martin Kliesch, Salwa Shaglel, Stefan Walter","submitted_at":"2025-07-29T18:00:01Z","abstract_excerpt":"QUBO formulations of combinatorial optimization problems allow for solving them using various quantum heuristics. While large-scale quantum computations are currently still out of reach, we can already numerically test such QUBO formulations on a perhaps surprisingly large scale. In this work, we benchmark Fujitsu's Digital Annealer (DA) on the Max-Cut problem, which captures the main complexity of the QUBO problem. We make a comprehensive benchmark against leading other heuristic algorithms on graphs with up to 53,000 variables by focusing on the wall-clock time. Moreover, we compare the DA p"},"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":"2507.22117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-07-29T18:00:01Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"f35b04b93835c17d6bc01ddf2a35cf7f7ed822feb4bb23f978de2024b2845cc4","abstract_canon_sha256":"8e68275932dfdca029d8d517c5921d0d4747d856c1ce2af3ac3e76271b0282d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:16.767092Z","signature_b64":"kmCiIYcSBTrcAsCk9+ehgvY0lJJAyUkUZZ39zi7sLzGvESjTkGpSlDwdUt8p6lq0MlYijRDCVZmODqRA3EQWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d41543e2c7262cef08ae16503c87ebd597dd4b3afb10959508d97d01095b221","last_reissued_at":"2026-07-05T11:45:16.766620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:16.766620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A comprehensive benchmark of an Ising machine on the Max-Cut problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Christian M\\\"unch, Fritz Schinkel, Markus Kirsch, Marten Winkler, Martin Kliesch, Salwa Shaglel, Stefan Walter","submitted_at":"2025-07-29T18:00:01Z","abstract_excerpt":"QUBO formulations of combinatorial optimization problems allow for solving them using various quantum heuristics. While large-scale quantum computations are currently still out of reach, we can already numerically test such QUBO formulations on a perhaps surprisingly large scale. In this work, we benchmark Fujitsu's Digital Annealer (DA) on the Max-Cut problem, which captures the main complexity of the QUBO problem. We make a comprehensive benchmark against leading other heuristic algorithms on graphs with up to 53,000 variables by focusing on the wall-clock time. Moreover, we compare the DA p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22117","kind":"arxiv","version":1},"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/2507.22117/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":"2507.22117","created_at":"2026-07-05T11:45:16.766678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.22117v1","created_at":"2026-07-05T11:45:16.766678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22117","created_at":"2026-07-05T11:45:16.766678+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVAVIPRMOJRM","created_at":"2026-07-05T11:45:16.766678+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVAVIPRMOJRM54EK","created_at":"2026-07-05T11:45:16.766678+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVAVIPRM","created_at":"2026-07-05T11:45:16.766678+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.00170","citing_title":"Scaling Up Thermodynamic AI Models","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TVAVIPRMOJRM54EK4FSQHSD6XV","json":"https://pith.science/pith/TVAVIPRMOJRM54EK4FSQHSD6XV.json","graph_json":"https://pith.science/api/pith-number/TVAVIPRMOJRM54EK4FSQHSD6XV/graph.json","events_json":"https://pith.science/api/pith-number/TVAVIPRMOJRM54EK4FSQHSD6XV/events.json","paper":"https://pith.science/paper/TVAVIPRM"},"agent_actions":{"view_html":"https://pith.science/pith/TVAVIPRMOJRM54EK4FSQHSD6XV","download_json":"https://pith.science/pith/TVAVIPRMOJRM54EK4FSQHSD6XV.json","view_paper":"https://pith.science/paper/TVAVIPRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.22117&json=true","fetch_graph":"https://pith.science/api/pith-number/TVAVIPRMOJRM54EK4FSQHSD6XV/graph.json","fetch_events":"https://pith.science/api/pith-number/TVAVIPRMOJRM54EK4FSQHSD6XV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVAVIPRMOJRM54EK4FSQHSD6XV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVAVIPRMOJRM54EK4FSQHSD6XV/action/storage_attestation","attest_author":"https://pith.science/pith/TVAVIPRMOJRM54EK4FSQHSD6XV/action/author_attestation","sign_citation":"https://pith.science/pith/TVAVIPRMOJRM54EK4FSQHSD6XV/action/citation_signature","submit_replication":"https://pith.science/pith/TVAVIPRMOJRM54EK4FSQHSD6XV/action/replication_record"}},"created_at":"2026-07-05T11:45:16.766678+00:00","updated_at":"2026-07-05T11:45:16.766678+00:00"}