{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JXW5M7WAQZJFKUM563EZGR2TB7","short_pith_number":"pith:JXW5M7WA","schema_version":"1.0","canonical_sha256":"4dedd67ec0865255519df6c99347530ff5b73d08cfed609cb6cd164799e05213","source":{"kind":"arxiv","id":"1709.10132","version":2},"attestation_state":"computed","paper":{"title":"A mixed-integer branching approach for very small 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":"2017-09-28T19:09:57Z","abstract_excerpt":"An important problem in optimization is the construction of mixed-integer programming (MIP) formulations of disjunctive constraints that are both strong and small. Motivated by lower bounds on the number of integer variables that are required by traditional MIP formulations, we present a more general mixed-integer branching formulation framework. Our approach maintains favorable algorithmic properties of traditional MIP formulations: in particular, amenability to branch-and-bound and branch-and-cut algorithms. Our main technical result gives an explicit linear inequality description for both t"},"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":"1709.10132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-28T19:09:57Z","cross_cats_sorted":[],"title_canon_sha256":"eacb4caf49a33ebf18a48d8520c53a8c80120f01d7ffc998f08e030303f0e4bf","abstract_canon_sha256":"6348dc24af930626ba67e6cb85a57fe8ac2d75c666c00730aad868fa5b4333bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:01.120955Z","signature_b64":"Z0RU0J4ExdjoHb1Km8uoOiqD59qr19Jf3T9BKWipQ1Wh3qqE02nIDGtbm3qD0rAEkCjIDmL4RYAEN3SG4G51Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dedd67ec0865255519df6c99347530ff5b73d08cfed609cb6cd164799e05213","last_reissued_at":"2026-05-18T00:29:01.120482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:01.120482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A mixed-integer branching approach for very small 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":"2017-09-28T19:09:57Z","abstract_excerpt":"An important problem in optimization is the construction of mixed-integer programming (MIP) formulations of disjunctive constraints that are both strong and small. Motivated by lower bounds on the number of integer variables that are required by traditional MIP formulations, we present a more general mixed-integer branching formulation framework. Our approach maintains favorable algorithmic properties of traditional MIP formulations: in particular, amenability to branch-and-bound and branch-and-cut algorithms. Our main technical result gives an explicit linear inequality description for both t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10132","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":""},"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":"1709.10132","created_at":"2026-05-18T00:29:01.120567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.10132v2","created_at":"2026-05-18T00:29:01.120567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10132","created_at":"2026-05-18T00:29:01.120567+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXW5M7WAQZJF","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXW5M7WAQZJFKUM5","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXW5M7WA","created_at":"2026-05-18T12:31:24.725408+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/JXW5M7WAQZJFKUM563EZGR2TB7","json":"https://pith.science/pith/JXW5M7WAQZJFKUM563EZGR2TB7.json","graph_json":"https://pith.science/api/pith-number/JXW5M7WAQZJFKUM563EZGR2TB7/graph.json","events_json":"https://pith.science/api/pith-number/JXW5M7WAQZJFKUM563EZGR2TB7/events.json","paper":"https://pith.science/paper/JXW5M7WA"},"agent_actions":{"view_html":"https://pith.science/pith/JXW5M7WAQZJFKUM563EZGR2TB7","download_json":"https://pith.science/pith/JXW5M7WAQZJFKUM563EZGR2TB7.json","view_paper":"https://pith.science/paper/JXW5M7WA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.10132&json=true","fetch_graph":"https://pith.science/api/pith-number/JXW5M7WAQZJFKUM563EZGR2TB7/graph.json","fetch_events":"https://pith.science/api/pith-number/JXW5M7WAQZJFKUM563EZGR2TB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXW5M7WAQZJFKUM563EZGR2TB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXW5M7WAQZJFKUM563EZGR2TB7/action/storage_attestation","attest_author":"https://pith.science/pith/JXW5M7WAQZJFKUM563EZGR2TB7/action/author_attestation","sign_citation":"https://pith.science/pith/JXW5M7WAQZJFKUM563EZGR2TB7/action/citation_signature","submit_replication":"https://pith.science/pith/JXW5M7WAQZJFKUM563EZGR2TB7/action/replication_record"}},"created_at":"2026-05-18T00:29:01.120567+00:00","updated_at":"2026-05-18T00:29:01.120567+00:00"}