{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GUAAJ6PEC3R2X3FV7DSIAR3O3C","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":"c463e2dc8bd58f78b9d78b113923b7c69a09ca55c1eae86389db11019c47e83f","cross_cats_sorted":["cs.PF","math.OC","nlin.AO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-08-29T18:19:48Z","title_canon_sha256":"9730e5f2c9b3440e82eac5c35dff110406d5aa3094c55159e535e7217fe10860"},"schema_version":"1.0","source":{"id":"1808.09999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09999","created_at":"2026-05-18T00:06:50Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09999v1","created_at":"2026-05-18T00:06:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09999","created_at":"2026-05-18T00:06:50Z"},{"alias_kind":"pith_short_12","alias_value":"GUAAJ6PEC3R2","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GUAAJ6PEC3R2X3FV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GUAAJ6PE","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:a27b8c4f10b1098f4dab4241179aabfd872624b44f76168249d6faf52bfa0442","target":"graph","created_at":"2026-05-18T00:06:50Z","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"},"paper":{"abstract_excerpt":"Integer linear programming (ILP) encompasses a very important class of optimization problems that are of great interest to both academia and industry. Several algorithms are available that attempt to explore the solution space of this class efficiently, while requiring a reasonable compute time. However, although these algorithms have reached various degrees of success over the years, they still face considerable challenges when confronted with particularly hard problem instances, such as those of the MIPLIB 2010 library. In this work we propose a radically different non-algorithmic approach t","authors_text":"Fabio L. Traversa, Massimiliano Di Ventra","cross_cats":["cs.PF","math.OC","nlin.AO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-08-29T18:19:48Z","title":"MemComputing Integer Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09999","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:2362fb8bc1518ab6b42cb6f87aa0c1c589168c932f8b4d8cadc8486b0a9d464e","target":"record","created_at":"2026-05-18T00:06:50Z","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":"c463e2dc8bd58f78b9d78b113923b7c69a09ca55c1eae86389db11019c47e83f","cross_cats_sorted":["cs.PF","math.OC","nlin.AO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-08-29T18:19:48Z","title_canon_sha256":"9730e5f2c9b3440e82eac5c35dff110406d5aa3094c55159e535e7217fe10860"},"schema_version":"1.0","source":{"id":"1808.09999","kind":"arxiv","version":1}},"canonical_sha256":"350004f9e416e3abecb5f8e480476ed88f06ab9e5568062da0d913a19b6f9db2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"350004f9e416e3abecb5f8e480476ed88f06ab9e5568062da0d913a19b6f9db2","first_computed_at":"2026-05-18T00:06:50.219926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:50.219926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MRBQlS/bIZL3a4HCStu/gFtvZIKh/WaEFKRKialtmUdPRCW3nMz/JdSpOa2dtXJyIF4yAOS+fc1Zfs3pYH68CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:50.220629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2362fb8bc1518ab6b42cb6f87aa0c1c589168c932f8b4d8cadc8486b0a9d464e","sha256:a27b8c4f10b1098f4dab4241179aabfd872624b44f76168249d6faf52bfa0442"],"state_sha256":"6a415317755d88d97a1d78fa1cd2fbb548530b86faa014004c21f4292ac3acc6"}