{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:DTTE6MPX2PMQWXMKY44PFOX2JX","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":"f114fe3941369f7d85ee0e04f259853de9ce93bb209f8d9ae8e21c0a9488fbaf","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-11-15T21:06:49Z","title_canon_sha256":"b4a735f16a6cb5d02285384312c3bdf8c888dd14de7e593f98b5a45ac980bb1a"},"schema_version":"1.0","source":{"id":"2311.09375","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.09375","created_at":"2026-07-05T08:19:57Z"},{"alias_kind":"arxiv_version","alias_value":"2311.09375v2","created_at":"2026-07-05T08:19:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.09375","created_at":"2026-07-05T08:19:57Z"},{"alias_kind":"pith_short_12","alias_value":"DTTE6MPX2PMQ","created_at":"2026-07-05T08:19:57Z"},{"alias_kind":"pith_short_16","alias_value":"DTTE6MPX2PMQWXMK","created_at":"2026-07-05T08:19:57Z"},{"alias_kind":"pith_short_8","alias_value":"DTTE6MPX","created_at":"2026-07-05T08:19:57Z"}],"graph_snapshots":[{"event_id":"sha256:a243f1a053a9dad0a37b90300451e045778f9893c8fe8e8ca7bd183ac6d665bf","target":"graph","created_at":"2026-07-05T08:19:57Z","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/2311.09375/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Scalable addressing of high dimensional constrained combinatorial optimization problems is a challenge that arises in several science and engineering disciplines. Recent work introduced novel application of graph neural networks for solving quadratic-cost combinatorial optimization problems. However, effective utilization of models such as graph neural networks to address general problems with higher order constraints is an unresolved challenge. This paper presents a framework, HypOp, which advances the state of the art for solving combinatorial optimization problems in several aspects: (i) it","authors_text":"Farinaz Koushanfar, Nasimeh Heydaribeni, Ruisi Zhang, Tina Eliassi-Rad, Xinrui Zhan","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-11-15T21:06:49Z","title":"Distributed Constrained Combinatorial Optimization leveraging Hypergraph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.09375","kind":"arxiv","version":2},"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:72f88828589b12326b227db0ecffe54d48f86f08ceefc068efaa5e99ddb0f7cb","target":"record","created_at":"2026-07-05T08:19:57Z","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":"f114fe3941369f7d85ee0e04f259853de9ce93bb209f8d9ae8e21c0a9488fbaf","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-11-15T21:06:49Z","title_canon_sha256":"b4a735f16a6cb5d02285384312c3bdf8c888dd14de7e593f98b5a45ac980bb1a"},"schema_version":"1.0","source":{"id":"2311.09375","kind":"arxiv","version":2}},"canonical_sha256":"1ce64f31f7d3d90b5d8ac738f2bafa4df58dff1edd4833d31bc3217f4603e1cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ce64f31f7d3d90b5d8ac738f2bafa4df58dff1edd4833d31bc3217f4603e1cf","first_computed_at":"2026-07-05T08:19:57.721869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:19:57.721869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v9ZRPO1oCaeeg6ObiyvDLzpReICfuxtQfScLcr0YvgBq94M/pxNNNu3OfhnWrzD+Hx4VuDyOIV15VHxQyQ2ADw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:19:57.722430Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.09375","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72f88828589b12326b227db0ecffe54d48f86f08ceefc068efaa5e99ddb0f7cb","sha256:a243f1a053a9dad0a37b90300451e045778f9893c8fe8e8ca7bd183ac6d665bf"],"state_sha256":"4b6ca2e903e08f9e0114573479e5e38f05044861efa226dc7c441bc9d42f384f"}