{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DTTE6MPX2PMQWXMKY44PFOX2JX","short_pith_number":"pith:DTTE6MPX","schema_version":"1.0","canonical_sha256":"1ce64f31f7d3d90b5d8ac738f2bafa4df58dff1edd4833d31bc3217f4603e1cf","source":{"kind":"arxiv","id":"2311.09375","version":2},"attestation_state":"computed","paper":{"title":"Distributed Constrained Combinatorial Optimization leveraging Hypergraph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Farinaz Koushanfar, Nasimeh Heydaribeni, Ruisi Zhang, Tina Eliassi-Rad, Xinrui Zhan","submitted_at":"2023-11-15T21:06:49Z","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"},"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.09375","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-11-15T21:06:49Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"b4a735f16a6cb5d02285384312c3bdf8c888dd14de7e593f98b5a45ac980bb1a","abstract_canon_sha256":"f114fe3941369f7d85ee0e04f259853de9ce93bb209f8d9ae8e21c0a9488fbaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:19:57.722430Z","signature_b64":"v9ZRPO1oCaeeg6ObiyvDLzpReICfuxtQfScLcr0YvgBq94M/pxNNNu3OfhnWrzD+Hx4VuDyOIV15VHxQyQ2ADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ce64f31f7d3d90b5d8ac738f2bafa4df58dff1edd4833d31bc3217f4603e1cf","last_reissued_at":"2026-07-05T08:19:57.721869Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:19:57.721869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Constrained Combinatorial Optimization leveraging Hypergraph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Farinaz Koushanfar, Nasimeh Heydaribeni, Ruisi Zhang, Tina Eliassi-Rad, Xinrui Zhan","submitted_at":"2023-11-15T21:06:49Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.09375","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/2311.09375/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.09375","created_at":"2026-07-05T08:19:57.721927+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.09375v2","created_at":"2026-07-05T08:19:57.721927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.09375","created_at":"2026-07-05T08:19:57.721927+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTTE6MPX2PMQ","created_at":"2026-07-05T08:19:57.721927+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTTE6MPX2PMQWXMK","created_at":"2026-07-05T08:19:57.721927+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTTE6MPX","created_at":"2026-07-05T08:19:57.721927+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01620","citing_title":"Structured Parameterization and Non-Stabilizerness in Hypergraph QAOA","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DTTE6MPX2PMQWXMKY44PFOX2JX","json":"https://pith.science/pith/DTTE6MPX2PMQWXMKY44PFOX2JX.json","graph_json":"https://pith.science/api/pith-number/DTTE6MPX2PMQWXMKY44PFOX2JX/graph.json","events_json":"https://pith.science/api/pith-number/DTTE6MPX2PMQWXMKY44PFOX2JX/events.json","paper":"https://pith.science/paper/DTTE6MPX"},"agent_actions":{"view_html":"https://pith.science/pith/DTTE6MPX2PMQWXMKY44PFOX2JX","download_json":"https://pith.science/pith/DTTE6MPX2PMQWXMKY44PFOX2JX.json","view_paper":"https://pith.science/paper/DTTE6MPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.09375&json=true","fetch_graph":"https://pith.science/api/pith-number/DTTE6MPX2PMQWXMKY44PFOX2JX/graph.json","fetch_events":"https://pith.science/api/pith-number/DTTE6MPX2PMQWXMKY44PFOX2JX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTTE6MPX2PMQWXMKY44PFOX2JX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTTE6MPX2PMQWXMKY44PFOX2JX/action/storage_attestation","attest_author":"https://pith.science/pith/DTTE6MPX2PMQWXMKY44PFOX2JX/action/author_attestation","sign_citation":"https://pith.science/pith/DTTE6MPX2PMQWXMKY44PFOX2JX/action/citation_signature","submit_replication":"https://pith.science/pith/DTTE6MPX2PMQWXMKY44PFOX2JX/action/replication_record"}},"created_at":"2026-07-05T08:19:57.721927+00:00","updated_at":"2026-07-05T08:19:57.721927+00:00"}