{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LA5MMFZLIOLRWDVJAYUTS34QKK","short_pith_number":"pith:LA5MMFZL","schema_version":"1.0","canonical_sha256":"583ac6172b43971b0ea90629396f90529bec37438729c321319ec3bf759e0945","source":{"kind":"arxiv","id":"2505.20250","version":2},"attestation_state":"computed","paper":{"title":"Efficient Optimization Accelerator Framework for Multistate Ising Problems","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC","cs.ET","cs.LG","stat.CO"],"primary_cat":"cs.AR","authors_text":"Chirag Garg, Sayeef Salahuddin","submitted_at":"2025-05-26T17:23:47Z","abstract_excerpt":"Ising Machines are emerging hardware architectures that efficiently solve NP-Hard combinatorial optimization problems. Generally, combinatorial problems are transformed into quadratic unconstrained binary optimization (QUBO) form, but this transformation often complicates the solution landscape, degrading performance, especially for multi-state problems. To address this challenge, we model spin interactions as generalized boolean logic function to significantly reduce the exploration space. We demonstrate the effectiveness of our approach on graph coloring problem using probabilistic Ising sol"},"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":"2505.20250","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AR","submitted_at":"2025-05-26T17:23:47Z","cross_cats_sorted":["cs.DC","cs.ET","cs.LG","stat.CO"],"title_canon_sha256":"2b51985d65fe36a1cb001e0a61c67213c0d5e208d7e28e0e093eb3793efcd90e","abstract_canon_sha256":"c3e5c0941919c153b8f0d9c24f6abcbbe2ce77fa827cdc0a0018b715e54579d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:18.280017Z","signature_b64":"AH9L//qMWFQkx4E8ycE7qBDFONgx5QrgRfWA4w05ff0N/qx1sgQG0PrBIarZdaq7CCyXSwwflPljbjJIYUFmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"583ac6172b43971b0ea90629396f90529bec37438729c321319ec3bf759e0945","last_reissued_at":"2026-07-05T12:09:18.279545Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:18.279545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Optimization Accelerator Framework for Multistate Ising Problems","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC","cs.ET","cs.LG","stat.CO"],"primary_cat":"cs.AR","authors_text":"Chirag Garg, Sayeef Salahuddin","submitted_at":"2025-05-26T17:23:47Z","abstract_excerpt":"Ising Machines are emerging hardware architectures that efficiently solve NP-Hard combinatorial optimization problems. Generally, combinatorial problems are transformed into quadratic unconstrained binary optimization (QUBO) form, but this transformation often complicates the solution landscape, degrading performance, especially for multi-state problems. To address this challenge, we model spin interactions as generalized boolean logic function to significantly reduce the exploration space. We demonstrate the effectiveness of our approach on graph coloring problem using probabilistic Ising sol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.20250","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/2505.20250/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":"2505.20250","created_at":"2026-07-05T12:09:18.279606+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.20250v2","created_at":"2026-07-05T12:09:18.279606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.20250","created_at":"2026-07-05T12:09:18.279606+00:00"},{"alias_kind":"pith_short_12","alias_value":"LA5MMFZLIOLR","created_at":"2026-07-05T12:09:18.279606+00:00"},{"alias_kind":"pith_short_16","alias_value":"LA5MMFZLIOLRWDVJ","created_at":"2026-07-05T12:09:18.279606+00:00"},{"alias_kind":"pith_short_8","alias_value":"LA5MMFZL","created_at":"2026-07-05T12:09:18.279606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LA5MMFZLIOLRWDVJAYUTS34QKK","json":"https://pith.science/pith/LA5MMFZLIOLRWDVJAYUTS34QKK.json","graph_json":"https://pith.science/api/pith-number/LA5MMFZLIOLRWDVJAYUTS34QKK/graph.json","events_json":"https://pith.science/api/pith-number/LA5MMFZLIOLRWDVJAYUTS34QKK/events.json","paper":"https://pith.science/paper/LA5MMFZL"},"agent_actions":{"view_html":"https://pith.science/pith/LA5MMFZLIOLRWDVJAYUTS34QKK","download_json":"https://pith.science/pith/LA5MMFZLIOLRWDVJAYUTS34QKK.json","view_paper":"https://pith.science/paper/LA5MMFZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.20250&json=true","fetch_graph":"https://pith.science/api/pith-number/LA5MMFZLIOLRWDVJAYUTS34QKK/graph.json","fetch_events":"https://pith.science/api/pith-number/LA5MMFZLIOLRWDVJAYUTS34QKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LA5MMFZLIOLRWDVJAYUTS34QKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LA5MMFZLIOLRWDVJAYUTS34QKK/action/storage_attestation","attest_author":"https://pith.science/pith/LA5MMFZLIOLRWDVJAYUTS34QKK/action/author_attestation","sign_citation":"https://pith.science/pith/LA5MMFZLIOLRWDVJAYUTS34QKK/action/citation_signature","submit_replication":"https://pith.science/pith/LA5MMFZLIOLRWDVJAYUTS34QKK/action/replication_record"}},"created_at":"2026-07-05T12:09:18.279606+00:00","updated_at":"2026-07-05T12:09:18.279606+00:00"}