{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:M6IFWLIX552O6RA7M6VOQ27EWB","short_pith_number":"pith:M6IFWLIX","schema_version":"1.0","canonical_sha256":"67905b2d17ef74ef441f67aae86be4b058a431846905ecdb32d1a7eafe0b9ff6","source":{"kind":"arxiv","id":"2507.12831","version":2},"attestation_state":"computed","paper":{"title":"The complete edge relaxation for binary polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Aida Khajavirad, Alberto Del Pia","submitted_at":"2025-07-17T06:45:14Z","abstract_excerpt":"We consider the multilinear polytope, defined as the convex hull of the feasible region of a lifted binary polynomial optimization problem. We define a relaxation in an extended space for this polytope, which we call the complete edge relaxation. The complete edge relaxation is stronger than several well-known relaxations of the multilinear polytope, including the standard linearization, the flower relaxation, and the intersection of all possible recursive McCormick relaxations. In addition, for fixed-degree binary polynomial optimization problems, the case of primary practical interest, the c"},"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":"2507.12831","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-07-17T06:45:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e63b2d4bbb9ee5398991a9a7c7cb4e1cf70f9f6f97b54dcb56e6d5e5494367b2","abstract_canon_sha256":"18e33cd63bcc0c47c0ab4ed78b81d5d504d8417b8ec454a3b944843039b1a970"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:27.166993Z","signature_b64":"QMtuEQcj6b/TthEzRTPTM7IK1LQlbDjdW3JxLBhD8gxu9S7JPEeFflykdGhrr6Zgfl7t8hfPoEs53ZieSOvtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67905b2d17ef74ef441f67aae86be4b058a431846905ecdb32d1a7eafe0b9ff6","last_reissued_at":"2026-06-11T01:10:27.165953Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:27.165953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complete edge relaxation for binary polynomial optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Aida Khajavirad, Alberto Del Pia","submitted_at":"2025-07-17T06:45:14Z","abstract_excerpt":"We consider the multilinear polytope, defined as the convex hull of the feasible region of a lifted binary polynomial optimization problem. We define a relaxation in an extended space for this polytope, which we call the complete edge relaxation. The complete edge relaxation is stronger than several well-known relaxations of the multilinear polytope, including the standard linearization, the flower relaxation, and the intersection of all possible recursive McCormick relaxations. In addition, for fixed-degree binary polynomial optimization problems, the case of primary practical interest, the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12831","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/2507.12831/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":"2507.12831","created_at":"2026-06-11T01:10:27.166099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.12831v2","created_at":"2026-06-11T01:10:27.166099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12831","created_at":"2026-06-11T01:10:27.166099+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6IFWLIX552O","created_at":"2026-06-11T01:10:27.166099+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6IFWLIX552O6RA7","created_at":"2026-06-11T01:10:27.166099+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6IFWLIX","created_at":"2026-06-11T01:10:27.166099+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M6IFWLIX552O6RA7M6VOQ27EWB","json":"https://pith.science/pith/M6IFWLIX552O6RA7M6VOQ27EWB.json","graph_json":"https://pith.science/api/pith-number/M6IFWLIX552O6RA7M6VOQ27EWB/graph.json","events_json":"https://pith.science/api/pith-number/M6IFWLIX552O6RA7M6VOQ27EWB/events.json","paper":"https://pith.science/paper/M6IFWLIX"},"agent_actions":{"view_html":"https://pith.science/pith/M6IFWLIX552O6RA7M6VOQ27EWB","download_json":"https://pith.science/pith/M6IFWLIX552O6RA7M6VOQ27EWB.json","view_paper":"https://pith.science/paper/M6IFWLIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.12831&json=true","fetch_graph":"https://pith.science/api/pith-number/M6IFWLIX552O6RA7M6VOQ27EWB/graph.json","fetch_events":"https://pith.science/api/pith-number/M6IFWLIX552O6RA7M6VOQ27EWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6IFWLIX552O6RA7M6VOQ27EWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6IFWLIX552O6RA7M6VOQ27EWB/action/storage_attestation","attest_author":"https://pith.science/pith/M6IFWLIX552O6RA7M6VOQ27EWB/action/author_attestation","sign_citation":"https://pith.science/pith/M6IFWLIX552O6RA7M6VOQ27EWB/action/citation_signature","submit_replication":"https://pith.science/pith/M6IFWLIX552O6RA7M6VOQ27EWB/action/replication_record"}},"created_at":"2026-06-11T01:10:27.166099+00:00","updated_at":"2026-06-11T01:10:27.166099+00:00"}