{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4GXR7AXPEDFKQHMIUGDDXFI34U","short_pith_number":"pith:4GXR7AXP","schema_version":"1.0","canonical_sha256":"e1af1f82ef20caa81d88a1863b951be532616b63bcf983f677e87b832a80fa26","source":{"kind":"arxiv","id":"1607.04803","version":4},"attestation_state":"computed","paper":{"title":"A combinatorial approach for small and strong formulations of disjunctive constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Joey Huchette, Juan Pablo Vielma","submitted_at":"2016-07-16T20:54:15Z","abstract_excerpt":"We present a framework for constructing strong mixed-integer programming formulations for logical disjunctive constraints. Our approach is a generalization of the logarithmically-sized formulations of Vielma and Nemhauser for SOS2 constraints, and we offer a complete characterization of its expressive power. We apply the framework to a variety of disjunctive constraints, producing novel small and strong formulations for outer approximations of multilinear terms, generalizations of special ordered sets, piecewise linear functions over a variety of domains, and obstacle avoidance constraints."},"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":"1607.04803","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-16T20:54:15Z","cross_cats_sorted":[],"title_canon_sha256":"b52e37de60af7c592af5c88822ea4017978f8be06fc4252580be951b67686055","abstract_canon_sha256":"00bc5535fa487fad25cad37629aa8c4ad447d0df35da56ab1c224d81d019f1ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:05.746942Z","signature_b64":"3TWPZ2/wk/y758NV2wRi11hHDXlihtCJIPsU08l/b1XS2fjiXks/eUwWIAW3kpsU4YbCMrcMoTXanM4xCqnPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1af1f82ef20caa81d88a1863b951be532616b63bcf983f677e87b832a80fa26","last_reissued_at":"2026-05-18T00:15:05.746445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:05.746445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A combinatorial approach for small and strong formulations of disjunctive constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Joey Huchette, Juan Pablo Vielma","submitted_at":"2016-07-16T20:54:15Z","abstract_excerpt":"We present a framework for constructing strong mixed-integer programming formulations for logical disjunctive constraints. Our approach is a generalization of the logarithmically-sized formulations of Vielma and Nemhauser for SOS2 constraints, and we offer a complete characterization of its expressive power. We apply the framework to a variety of disjunctive constraints, producing novel small and strong formulations for outer approximations of multilinear terms, generalizations of special ordered sets, piecewise linear functions over a variety of domains, and obstacle avoidance constraints."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04803","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1607.04803","created_at":"2026-05-18T00:15:05.746520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04803v4","created_at":"2026-05-18T00:15:05.746520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04803","created_at":"2026-05-18T00:15:05.746520+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GXR7AXPEDFK","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GXR7AXPEDFKQHMI","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GXR7AXP","created_at":"2026-05-18T12:29:58.707656+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/4GXR7AXPEDFKQHMIUGDDXFI34U","json":"https://pith.science/pith/4GXR7AXPEDFKQHMIUGDDXFI34U.json","graph_json":"https://pith.science/api/pith-number/4GXR7AXPEDFKQHMIUGDDXFI34U/graph.json","events_json":"https://pith.science/api/pith-number/4GXR7AXPEDFKQHMIUGDDXFI34U/events.json","paper":"https://pith.science/paper/4GXR7AXP"},"agent_actions":{"view_html":"https://pith.science/pith/4GXR7AXPEDFKQHMIUGDDXFI34U","download_json":"https://pith.science/pith/4GXR7AXPEDFKQHMIUGDDXFI34U.json","view_paper":"https://pith.science/paper/4GXR7AXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04803&json=true","fetch_graph":"https://pith.science/api/pith-number/4GXR7AXPEDFKQHMIUGDDXFI34U/graph.json","fetch_events":"https://pith.science/api/pith-number/4GXR7AXPEDFKQHMIUGDDXFI34U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GXR7AXPEDFKQHMIUGDDXFI34U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GXR7AXPEDFKQHMIUGDDXFI34U/action/storage_attestation","attest_author":"https://pith.science/pith/4GXR7AXPEDFKQHMIUGDDXFI34U/action/author_attestation","sign_citation":"https://pith.science/pith/4GXR7AXPEDFKQHMIUGDDXFI34U/action/citation_signature","submit_replication":"https://pith.science/pith/4GXR7AXPEDFKQHMIUGDDXFI34U/action/replication_record"}},"created_at":"2026-05-18T00:15:05.746520+00:00","updated_at":"2026-05-18T00:15:05.746520+00:00"}