{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VE4ML4UXWX6P7E3UAZV5ICC56I","short_pith_number":"pith:VE4ML4UX","schema_version":"1.0","canonical_sha256":"a938c5f297b5fcff9374066bd4085df2326d34fbd4a43222fed5f63d02629806","source":{"kind":"arxiv","id":"1912.03166","version":2},"attestation_state":"computed","paper":{"title":"Disjunctive cuts in Mixed-Integer Conic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Lodi, Juan Pablo Vielma, Mathieu Tanneau","submitted_at":"2019-12-06T14:56:02Z","abstract_excerpt":"This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating conic program for separating disjunctive cuts, and investigate the impact of the normalization condition on its resolution. In particular, we show that a careful selection of normalization guarantees its solvability and conic strong duality. Then, we highlight the shortcomings of separating conic-infeasible points in an outer-approximation context, and propose conic extensions to the classical lifting and monoidal strengthening procedures. Finally, we asses"},"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":"1912.03166","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-12-06T14:56:02Z","cross_cats_sorted":[],"title_canon_sha256":"7d60b7549cf1d88779a79cf32da784a24a8ba44bb5fa51cbec83a98946b9977e","abstract_canon_sha256":"16e0b60ab9088e21d31a4bc4a57dacfd46132de21bcd12c520e875656e808c6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:33:06.249784Z","signature_b64":"tmJHlivvTJ3YN7P0zwNEhYDrHKIgRVaeOg4Urkqsoyd76y/iYUBt9Wecboyq/rVmaq2d9BFK3Ec2+Ux1McpqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a938c5f297b5fcff9374066bd4085df2326d34fbd4a43222fed5f63d02629806","last_reissued_at":"2026-07-05T01:33:06.249387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:33:06.249387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disjunctive cuts in Mixed-Integer Conic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Lodi, Juan Pablo Vielma, Mathieu Tanneau","submitted_at":"2019-12-06T14:56:02Z","abstract_excerpt":"This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating conic program for separating disjunctive cuts, and investigate the impact of the normalization condition on its resolution. In particular, we show that a careful selection of normalization guarantees its solvability and conic strong duality. Then, we highlight the shortcomings of separating conic-infeasible points in an outer-approximation context, and propose conic extensions to the classical lifting and monoidal strengthening procedures. Finally, we asses"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.03166","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/1912.03166/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":"1912.03166","created_at":"2026-07-05T01:33:06.249450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.03166v2","created_at":"2026-07-05T01:33:06.249450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.03166","created_at":"2026-07-05T01:33:06.249450+00:00"},{"alias_kind":"pith_short_12","alias_value":"VE4ML4UXWX6P","created_at":"2026-07-05T01:33:06.249450+00:00"},{"alias_kind":"pith_short_16","alias_value":"VE4ML4UXWX6P7E3U","created_at":"2026-07-05T01:33:06.249450+00:00"},{"alias_kind":"pith_short_8","alias_value":"VE4ML4UX","created_at":"2026-07-05T01:33:06.249450+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/VE4ML4UXWX6P7E3UAZV5ICC56I","json":"https://pith.science/pith/VE4ML4UXWX6P7E3UAZV5ICC56I.json","graph_json":"https://pith.science/api/pith-number/VE4ML4UXWX6P7E3UAZV5ICC56I/graph.json","events_json":"https://pith.science/api/pith-number/VE4ML4UXWX6P7E3UAZV5ICC56I/events.json","paper":"https://pith.science/paper/VE4ML4UX"},"agent_actions":{"view_html":"https://pith.science/pith/VE4ML4UXWX6P7E3UAZV5ICC56I","download_json":"https://pith.science/pith/VE4ML4UXWX6P7E3UAZV5ICC56I.json","view_paper":"https://pith.science/paper/VE4ML4UX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.03166&json=true","fetch_graph":"https://pith.science/api/pith-number/VE4ML4UXWX6P7E3UAZV5ICC56I/graph.json","fetch_events":"https://pith.science/api/pith-number/VE4ML4UXWX6P7E3UAZV5ICC56I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VE4ML4UXWX6P7E3UAZV5ICC56I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VE4ML4UXWX6P7E3UAZV5ICC56I/action/storage_attestation","attest_author":"https://pith.science/pith/VE4ML4UXWX6P7E3UAZV5ICC56I/action/author_attestation","sign_citation":"https://pith.science/pith/VE4ML4UXWX6P7E3UAZV5ICC56I/action/citation_signature","submit_replication":"https://pith.science/pith/VE4ML4UXWX6P7E3UAZV5ICC56I/action/replication_record"}},"created_at":"2026-07-05T01:33:06.249450+00:00","updated_at":"2026-07-05T01:33:06.249450+00:00"}