{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VKN52O3XNKAWCTWY3N3ZLWNJMP","short_pith_number":"pith:VKN52O3X","schema_version":"1.0","canonical_sha256":"aa9bdd3b776a81614ed8db7795d9a963d9ee566ac9fa755bb2d8eda21e6de98f","source":{"kind":"arxiv","id":"1601.00198","version":1},"attestation_state":"computed","paper":{"title":"Analysis of Sparse Cutting-planes for Sparse MILPs with Applications to Stochastic MILPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marco Molinaro, Qianyi Wang, Santanu S. Dey","submitted_at":"2016-01-02T17:47:48Z","abstract_excerpt":"In this paper, we present an analysis of the strength of sparse cutting-planes for mixed integer linear programs (MILP) with sparse formulations. We examine three kinds of problems: packing problems, covering problems, and more general MILPs with the only assumption that the objective function is non-negative. Given a MILP instance of one of these three types, assume that we decide on the support of cutting-planes to be used and the strongest inequalities on these supports are added to the linear programming relaxation. Call the optimal objective function value of the linear programming relaxa"},"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":"1601.00198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-02T17:47:48Z","cross_cats_sorted":[],"title_canon_sha256":"573ed72744806161d8d1d5157c7b4f7239ce9c2e7c2fe8559c8840eaa24e4216","abstract_canon_sha256":"5b1ae5e6ef094bcea120ea618e464130607ec4284f598cb59e19931ecf18f50e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:28.244086Z","signature_b64":"6acU8rceUQsNYj5OT6rHRGRrr8mRc6RHT18jiHi1Q36GUJDh7Gk9DFft/4AQk58KDlkNYXontW0MdrCGFAuUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa9bdd3b776a81614ed8db7795d9a963d9ee566ac9fa755bb2d8eda21e6de98f","last_reissued_at":"2026-05-18T01:23:28.243308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:28.243308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Sparse Cutting-planes for Sparse MILPs with Applications to Stochastic MILPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marco Molinaro, Qianyi Wang, Santanu S. Dey","submitted_at":"2016-01-02T17:47:48Z","abstract_excerpt":"In this paper, we present an analysis of the strength of sparse cutting-planes for mixed integer linear programs (MILP) with sparse formulations. We examine three kinds of problems: packing problems, covering problems, and more general MILPs with the only assumption that the objective function is non-negative. Given a MILP instance of one of these three types, assume that we decide on the support of cutting-planes to be used and the strongest inequalities on these supports are added to the linear programming relaxation. Call the optimal objective function value of the linear programming relaxa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00198","kind":"arxiv","version":1},"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":"1601.00198","created_at":"2026-05-18T01:23:28.243447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.00198v1","created_at":"2026-05-18T01:23:28.243447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00198","created_at":"2026-05-18T01:23:28.243447+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKN52O3XNKAW","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKN52O3XNKAWCTWY","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKN52O3X","created_at":"2026-05-18T12:30:48.956258+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/VKN52O3XNKAWCTWY3N3ZLWNJMP","json":"https://pith.science/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP.json","graph_json":"https://pith.science/api/pith-number/VKN52O3XNKAWCTWY3N3ZLWNJMP/graph.json","events_json":"https://pith.science/api/pith-number/VKN52O3XNKAWCTWY3N3ZLWNJMP/events.json","paper":"https://pith.science/paper/VKN52O3X"},"agent_actions":{"view_html":"https://pith.science/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP","download_json":"https://pith.science/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP.json","view_paper":"https://pith.science/paper/VKN52O3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.00198&json=true","fetch_graph":"https://pith.science/api/pith-number/VKN52O3XNKAWCTWY3N3ZLWNJMP/graph.json","fetch_events":"https://pith.science/api/pith-number/VKN52O3XNKAWCTWY3N3ZLWNJMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP/action/storage_attestation","attest_author":"https://pith.science/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP/action/author_attestation","sign_citation":"https://pith.science/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP/action/citation_signature","submit_replication":"https://pith.science/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP/action/replication_record"}},"created_at":"2026-05-18T01:23:28.243447+00:00","updated_at":"2026-05-18T01:23:28.243447+00:00"}