{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GTWHR7GCEVS7NNFGWAD7EONMP5","short_pith_number":"pith:GTWHR7GC","schema_version":"1.0","canonical_sha256":"34ec78fcc22565f6b4a6b007f239ac7f579fcfcf796441780579e930621fb576","source":{"kind":"arxiv","id":"2311.09275","version":1},"attestation_state":"computed","paper":{"title":"Improved Sparse Ising Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cs.LG","authors_text":"Kenneth M. Zick","submitted_at":"2023-11-15T17:59:06Z","abstract_excerpt":"Sparse Ising problems can be found in application areas such as logistics, condensed matter physics and training of deep Boltzmann networks, but can be very difficult to tackle with high efficiency and accuracy. This report presents new data demonstrating significantly higher performance on some longstanding benchmark problems with up to 20,000 variables. The data come from a new heuristic algorithm tested on the large sparse instances from the Gset benchmark suite. Relative to leading reported combinations of speed and accuracy (e.g., from Toshiba's Simulated Bifurcation Machine and Breakout "},"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":"2311.09275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-15T17:59:06Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"afc2c3776773d65f73b6f3cd19f70cf3fd97aadf264466ba4bdf2e63b681a4cc","abstract_canon_sha256":"d0796ea9fe05b68f1a36ea9eb39daa26446be1c47b303a2916fbdf3f66f4be4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:13:12.388137Z","signature_b64":"2JGr6yPKyPZh0ej5bQa+oXc8keJ2hZdQ+wsp4i/Ql6bzFVHbtV3yIPr1EYeFpxHsmax0NvaTNROMBRU+pM4VCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34ec78fcc22565f6b4a6b007f239ac7f579fcfcf796441780579e930621fb576","last_reissued_at":"2026-07-05T07:13:12.387702Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:13:12.387702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Sparse Ising Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cs.LG","authors_text":"Kenneth M. Zick","submitted_at":"2023-11-15T17:59:06Z","abstract_excerpt":"Sparse Ising problems can be found in application areas such as logistics, condensed matter physics and training of deep Boltzmann networks, but can be very difficult to tackle with high efficiency and accuracy. This report presents new data demonstrating significantly higher performance on some longstanding benchmark problems with up to 20,000 variables. The data come from a new heuristic algorithm tested on the large sparse instances from the Gset benchmark suite. Relative to leading reported combinations of speed and accuracy (e.g., from Toshiba's Simulated Bifurcation Machine and Breakout "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.09275","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/2311.09275/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":"2311.09275","created_at":"2026-07-05T07:13:12.387766+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.09275v1","created_at":"2026-07-05T07:13:12.387766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.09275","created_at":"2026-07-05T07:13:12.387766+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTWHR7GCEVS7","created_at":"2026-07-05T07:13:12.387766+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTWHR7GCEVS7NNFG","created_at":"2026-07-05T07:13:12.387766+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTWHR7GC","created_at":"2026-07-05T07:13:12.387766+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18508","citing_title":"Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GTWHR7GCEVS7NNFGWAD7EONMP5","json":"https://pith.science/pith/GTWHR7GCEVS7NNFGWAD7EONMP5.json","graph_json":"https://pith.science/api/pith-number/GTWHR7GCEVS7NNFGWAD7EONMP5/graph.json","events_json":"https://pith.science/api/pith-number/GTWHR7GCEVS7NNFGWAD7EONMP5/events.json","paper":"https://pith.science/paper/GTWHR7GC"},"agent_actions":{"view_html":"https://pith.science/pith/GTWHR7GCEVS7NNFGWAD7EONMP5","download_json":"https://pith.science/pith/GTWHR7GCEVS7NNFGWAD7EONMP5.json","view_paper":"https://pith.science/paper/GTWHR7GC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.09275&json=true","fetch_graph":"https://pith.science/api/pith-number/GTWHR7GCEVS7NNFGWAD7EONMP5/graph.json","fetch_events":"https://pith.science/api/pith-number/GTWHR7GCEVS7NNFGWAD7EONMP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTWHR7GCEVS7NNFGWAD7EONMP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTWHR7GCEVS7NNFGWAD7EONMP5/action/storage_attestation","attest_author":"https://pith.science/pith/GTWHR7GCEVS7NNFGWAD7EONMP5/action/author_attestation","sign_citation":"https://pith.science/pith/GTWHR7GCEVS7NNFGWAD7EONMP5/action/citation_signature","submit_replication":"https://pith.science/pith/GTWHR7GCEVS7NNFGWAD7EONMP5/action/replication_record"}},"created_at":"2026-07-05T07:13:12.387766+00:00","updated_at":"2026-07-05T07:13:12.387766+00:00"}