{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ANALKEAS7OPSLC7FZGREKKNZAN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d8f146056e9ecf1b7ae57e20653472c68c576211676c88c617d0b0e28ec2f2aa","cross_cats_sorted":["cs.DC","cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2022-12-07T03:18:05Z","title_canon_sha256":"50c3250eeb05c341b38e8c302867d556e1f4b558f61124973f72e394436c2795"},"schema_version":"1.0","source":{"id":"2212.03426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.03426","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"arxiv_version","alias_value":"2212.03426v1","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.03426","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"pith_short_12","alias_value":"ANALKEAS7OPS","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"pith_short_16","alias_value":"ANALKEAS7OPSLC7F","created_at":"2026-07-05T05:23:16Z"},{"alias_kind":"pith_short_8","alias_value":"ANALKEAS","created_at":"2026-07-05T05:23:16Z"}],"graph_snapshots":[{"event_id":"sha256:cd072f5204bf4a4ec8d153a8bac1cfcfc33d8db770bfbeedfd399f8bebf5ab2a","target":"graph","created_at":"2026-07-05T05:23:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2212.03426/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A prominent approach to solving combinatorial optimization problems on parallel hardware is Ising machines, i.e., hardware implementations of networks of interacting binary spin variables. Most Ising machines leverage second-order interactions although important classes of optimization problems, such as satisfiability problems, map more seamlessly to Ising networks with higher-order interactions. Here, we demonstrate that higher-order Ising machines can solve satisfiability problems more resource-efficiently in terms of the number of spin variables and their connections when compared to tradit","authors_text":"Amir Khosrowshahi, Bruno A. Olshausen, Connor Bybee, Denis Kleyko, Dmitri E. Nikonov, Friedrich T. Sommer","cross_cats":["cs.DC","cs.NE"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2022-12-07T03:18:05Z","title":"Efficient Optimization with Higher-Order Ising Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.03426","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:292d608d8510e8a4274c74c99d9085795d45ae116f49336b08e05d8c63a341c0","target":"record","created_at":"2026-07-05T05:23:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d8f146056e9ecf1b7ae57e20653472c68c576211676c88c617d0b0e28ec2f2aa","cross_cats_sorted":["cs.DC","cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2022-12-07T03:18:05Z","title_canon_sha256":"50c3250eeb05c341b38e8c302867d556e1f4b558f61124973f72e394436c2795"},"schema_version":"1.0","source":{"id":"2212.03426","kind":"arxiv","version":1}},"canonical_sha256":"0340b51012fb9f258be5c9a24529b9036e8494bb3910248a6d2a9b8ef4633ff8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0340b51012fb9f258be5c9a24529b9036e8494bb3910248a6d2a9b8ef4633ff8","first_computed_at":"2026-07-05T05:23:16.274360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:23:16.274360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gehx4LaSRLTR5+LW3L5BtYlVZOgVE1hc/5ThNqgs+Zn1CJF4cPdzwbum3vZ4+Rhafv0dlS5zL9Xo8JY+bknZDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:23:16.274851Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.03426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:292d608d8510e8a4274c74c99d9085795d45ae116f49336b08e05d8c63a341c0","sha256:cd072f5204bf4a4ec8d153a8bac1cfcfc33d8db770bfbeedfd399f8bebf5ab2a"],"state_sha256":"0baa5d74b4ef4294e3f55101233cb29f009f607411881162bce0077d48e4b49e"}