{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7ROWTSLMUUPTFRVROZVOI3WQHH","short_pith_number":"pith:7ROWTSLM","schema_version":"1.0","canonical_sha256":"fc5d69c96ca51f32c6b1766ae46ed039e94aaf7f0f6a477e27dc2862a8a8b484","source":{"kind":"arxiv","id":"2403.01320","version":2},"attestation_state":"computed","paper":{"title":"Energy landscapes of combinatorial optimization in Ising machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"Adrien Renaudineau, Dmitrii Dobrynin, Dmitri Strukov, John Paul Strachan, Masoud Mohseni, Mohammad Hizzani","submitted_at":"2024-03-02T21:42:02Z","abstract_excerpt":"Physics-based Ising machines (IM) have been developed as dedicated processors for solving hard combinatorial optimization problems with higher speed and better energy efficiency. Generally, such systems employ local search heuristics to traverse energy landscapes in searching for optimal solutions. Here, we quantify and address some of the major challenges met by IMs by extending energy-landscape geometry visualization tools known as disconnectivity graphs. Using efficient sampling methods, we visually capture landscapes of problems having diverse structure and hardness manifesting as energeti"},"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":"2403.01320","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2024-03-02T21:42:02Z","cross_cats_sorted":[],"title_canon_sha256":"ce8f7f17a5a5fab20b11c5941f5e5d703a6f157f4a654d9ffdec0c04abb3a4a5","abstract_canon_sha256":"5b96f1fae45668a5f96ac9af4cb64f3b664ea1e8a0a43ee5dc0ce9110381f771"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:38.618668Z","signature_b64":"atOw56Kteyy2TBNSfIASpJYrw47cYpsersIKPBNcQaAZqNe0/yhgGEld25UV4zR8Zn4EQecGYmAuQPpD4TwfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc5d69c96ca51f32c6b1766ae46ed039e94aaf7f0f6a477e27dc2862a8a8b484","last_reissued_at":"2026-07-05T09:22:38.618157Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:38.618157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy landscapes of combinatorial optimization in Ising machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"Adrien Renaudineau, Dmitrii Dobrynin, Dmitri Strukov, John Paul Strachan, Masoud Mohseni, Mohammad Hizzani","submitted_at":"2024-03-02T21:42:02Z","abstract_excerpt":"Physics-based Ising machines (IM) have been developed as dedicated processors for solving hard combinatorial optimization problems with higher speed and better energy efficiency. Generally, such systems employ local search heuristics to traverse energy landscapes in searching for optimal solutions. Here, we quantify and address some of the major challenges met by IMs by extending energy-landscape geometry visualization tools known as disconnectivity graphs. Using efficient sampling methods, we visually capture landscapes of problems having diverse structure and hardness manifesting as energeti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01320","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/2403.01320/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":"2403.01320","created_at":"2026-07-05T09:22:38.618216+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.01320v2","created_at":"2026-07-05T09:22:38.618216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01320","created_at":"2026-07-05T09:22:38.618216+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ROWTSLMUUPT","created_at":"2026-07-05T09:22:38.618216+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ROWTSLMUUPTFRVR","created_at":"2026-07-05T09:22:38.618216+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ROWTSLM","created_at":"2026-07-05T09:22:38.618216+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.07917","citing_title":"Roadmap on Neuromorphic Photonics","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7ROWTSLMUUPTFRVROZVOI3WQHH","json":"https://pith.science/pith/7ROWTSLMUUPTFRVROZVOI3WQHH.json","graph_json":"https://pith.science/api/pith-number/7ROWTSLMUUPTFRVROZVOI3WQHH/graph.json","events_json":"https://pith.science/api/pith-number/7ROWTSLMUUPTFRVROZVOI3WQHH/events.json","paper":"https://pith.science/paper/7ROWTSLM"},"agent_actions":{"view_html":"https://pith.science/pith/7ROWTSLMUUPTFRVROZVOI3WQHH","download_json":"https://pith.science/pith/7ROWTSLMUUPTFRVROZVOI3WQHH.json","view_paper":"https://pith.science/paper/7ROWTSLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.01320&json=true","fetch_graph":"https://pith.science/api/pith-number/7ROWTSLMUUPTFRVROZVOI3WQHH/graph.json","fetch_events":"https://pith.science/api/pith-number/7ROWTSLMUUPTFRVROZVOI3WQHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ROWTSLMUUPTFRVROZVOI3WQHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ROWTSLMUUPTFRVROZVOI3WQHH/action/storage_attestation","attest_author":"https://pith.science/pith/7ROWTSLMUUPTFRVROZVOI3WQHH/action/author_attestation","sign_citation":"https://pith.science/pith/7ROWTSLMUUPTFRVROZVOI3WQHH/action/citation_signature","submit_replication":"https://pith.science/pith/7ROWTSLMUUPTFRVROZVOI3WQHH/action/replication_record"}},"created_at":"2026-07-05T09:22:38.618216+00:00","updated_at":"2026-07-05T09:22:38.618216+00:00"}