{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YI52HKOT4LJAPHE547IVLJAECV","short_pith_number":"pith:YI52HKOT","schema_version":"1.0","canonical_sha256":"c23ba3a9d3e2d2079c9de7d155a404155785283975294b830f64f2752b8e57d0","source":{"kind":"arxiv","id":"2403.16608","version":2},"attestation_state":"computed","paper":{"title":"Vector Ising Spin Annealer for Minimizing Ising Hamiltonians","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.other","physics.comp-ph","physics.optics"],"primary_cat":"quant-ph","authors_text":"James S. Cummins, Natalia G. Berloff","submitted_at":"2024-03-25T10:38:55Z","abstract_excerpt":"We introduce the Vector Ising Spin Annealer (VISA), a framework in gain-based computing that harnesses light-matter interactions to solve complex optimization problems encoded in spin Hamiltonians. Traditional driven-dissipative systems often select excited states due to limitations in spin movement. VISA transcends these constraints by enabling spins to operate in a three-dimensional space, offering a robust solution to minimize Ising Hamiltonians effectively. Our comparative analysis reveals VISA's superior performance over conventional single-dimension spin optimizers, demonstrating its abi"},"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.16608","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-25T10:38:55Z","cross_cats_sorted":["cond-mat.other","physics.comp-ph","physics.optics"],"title_canon_sha256":"3a2d19a7c960625cf089ea1b573fa0b931686ac8e06facf34368956e7ec4a2ff","abstract_canon_sha256":"ea59891aed97f319e8452bc07b408bad2509f9af23eb08abf51d6bb97ecc0b1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:20.346592Z","signature_b64":"PJtKhb7VrJRXeCyHsjQzVdbZFd97QdIhJ+sKtflTy4vWwyqggTdubtpCzMlPhpvsUDEq8tf+8cPvS7lBUm9UCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c23ba3a9d3e2d2079c9de7d155a404155785283975294b830f64f2752b8e57d0","last_reissued_at":"2026-07-05T08:23:20.346114Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:20.346114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vector Ising Spin Annealer for Minimizing Ising Hamiltonians","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.other","physics.comp-ph","physics.optics"],"primary_cat":"quant-ph","authors_text":"James S. Cummins, Natalia G. Berloff","submitted_at":"2024-03-25T10:38:55Z","abstract_excerpt":"We introduce the Vector Ising Spin Annealer (VISA), a framework in gain-based computing that harnesses light-matter interactions to solve complex optimization problems encoded in spin Hamiltonians. Traditional driven-dissipative systems often select excited states due to limitations in spin movement. VISA transcends these constraints by enabling spins to operate in a three-dimensional space, offering a robust solution to minimize Ising Hamiltonians effectively. Our comparative analysis reveals VISA's superior performance over conventional single-dimension spin optimizers, demonstrating its abi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.16608","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.16608/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.16608","created_at":"2026-07-05T08:23:20.346173+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.16608v2","created_at":"2026-07-05T08:23:20.346173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.16608","created_at":"2026-07-05T08:23:20.346173+00:00"},{"alias_kind":"pith_short_12","alias_value":"YI52HKOT4LJA","created_at":"2026-07-05T08:23:20.346173+00:00"},{"alias_kind":"pith_short_16","alias_value":"YI52HKOT4LJAPHE5","created_at":"2026-07-05T08:23:20.346173+00:00"},{"alias_kind":"pith_short_8","alias_value":"YI52HKOT","created_at":"2026-07-05T08:23:20.346173+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.07163","citing_title":"Exact Spin Elimination in Ising Hamiltonians and Energy-Based Machine Learning","ref_index":65,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YI52HKOT4LJAPHE547IVLJAECV","json":"https://pith.science/pith/YI52HKOT4LJAPHE547IVLJAECV.json","graph_json":"https://pith.science/api/pith-number/YI52HKOT4LJAPHE547IVLJAECV/graph.json","events_json":"https://pith.science/api/pith-number/YI52HKOT4LJAPHE547IVLJAECV/events.json","paper":"https://pith.science/paper/YI52HKOT"},"agent_actions":{"view_html":"https://pith.science/pith/YI52HKOT4LJAPHE547IVLJAECV","download_json":"https://pith.science/pith/YI52HKOT4LJAPHE547IVLJAECV.json","view_paper":"https://pith.science/paper/YI52HKOT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.16608&json=true","fetch_graph":"https://pith.science/api/pith-number/YI52HKOT4LJAPHE547IVLJAECV/graph.json","fetch_events":"https://pith.science/api/pith-number/YI52HKOT4LJAPHE547IVLJAECV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YI52HKOT4LJAPHE547IVLJAECV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YI52HKOT4LJAPHE547IVLJAECV/action/storage_attestation","attest_author":"https://pith.science/pith/YI52HKOT4LJAPHE547IVLJAECV/action/author_attestation","sign_citation":"https://pith.science/pith/YI52HKOT4LJAPHE547IVLJAECV/action/citation_signature","submit_replication":"https://pith.science/pith/YI52HKOT4LJAPHE547IVLJAECV/action/replication_record"}},"created_at":"2026-07-05T08:23:20.346173+00:00","updated_at":"2026-07-05T08:23:20.346173+00:00"}