{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DW5SC5MJVHYNT4XQ2WZ4S44BOS","short_pith_number":"pith:DW5SC5MJ","schema_version":"1.0","canonical_sha256":"1dbb217589a9f0d9f2f0d5b3c9738174a1a662eb7c2d1c5ea19480819ecd3372","source":{"kind":"arxiv","id":"1405.1789","version":1},"attestation_state":"computed","paper":{"title":"How Good Are Sparse Cutting-Planes?","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":"2014-05-08T01:23:35Z","abstract_excerpt":"Sparse cutting-planes are often the ones used in mixed-integer programing (MIP) solvers, since they help in solving the linear programs encountered during branch-&-bound more efficiently. However, how well can we approximate the integer hull by just using sparse cutting-planes? In order to understand this question better, given a polyope $P$ (e.g. the integer hull of a MIP), let $P^k$ be its best approximation using cuts with at most $k$ non-zero coefficients. We consider $d(P, P^k) = \\max_{x \\in P^k} \\left(min_{y \\in P} \\| x - y\\|\\right)$ as a measure of the quality of sparse cuts.\n  In our f"},"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":"1405.1789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-08T01:23:35Z","cross_cats_sorted":[],"title_canon_sha256":"6ff349bd49374f7348d993bf9910091a6a576149e209504bf239db673f65ef25","abstract_canon_sha256":"c468bc43c80fae1c6fa78a90ae74e279e8ebafcb269f50f945bff88859c6e7bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:22.481466Z","signature_b64":"SD6JvgwE8tnJKw10Kf2cLbXuC1vE0YZNgUniVlKRasQyrwdqgZXv6SkoTyaOKiO0ybuGSsPcZAZSqpMVH82QDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dbb217589a9f0d9f2f0d5b3c9738174a1a662eb7c2d1c5ea19480819ecd3372","last_reissued_at":"2026-05-18T02:52:22.480833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:22.480833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Good Are Sparse Cutting-Planes?","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":"2014-05-08T01:23:35Z","abstract_excerpt":"Sparse cutting-planes are often the ones used in mixed-integer programing (MIP) solvers, since they help in solving the linear programs encountered during branch-&-bound more efficiently. However, how well can we approximate the integer hull by just using sparse cutting-planes? In order to understand this question better, given a polyope $P$ (e.g. the integer hull of a MIP), let $P^k$ be its best approximation using cuts with at most $k$ non-zero coefficients. We consider $d(P, P^k) = \\max_{x \\in P^k} \\left(min_{y \\in P} \\| x - y\\|\\right)$ as a measure of the quality of sparse cuts.\n  In our f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1789","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":"1405.1789","created_at":"2026-05-18T02:52:22.480949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1789v1","created_at":"2026-05-18T02:52:22.480949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1789","created_at":"2026-05-18T02:52:22.480949+00:00"},{"alias_kind":"pith_short_12","alias_value":"DW5SC5MJVHYN","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DW5SC5MJVHYNT4XQ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DW5SC5MJ","created_at":"2026-05-18T12:28:25.294606+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/DW5SC5MJVHYNT4XQ2WZ4S44BOS","json":"https://pith.science/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS.json","graph_json":"https://pith.science/api/pith-number/DW5SC5MJVHYNT4XQ2WZ4S44BOS/graph.json","events_json":"https://pith.science/api/pith-number/DW5SC5MJVHYNT4XQ2WZ4S44BOS/events.json","paper":"https://pith.science/paper/DW5SC5MJ"},"agent_actions":{"view_html":"https://pith.science/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS","download_json":"https://pith.science/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS.json","view_paper":"https://pith.science/paper/DW5SC5MJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1789&json=true","fetch_graph":"https://pith.science/api/pith-number/DW5SC5MJVHYNT4XQ2WZ4S44BOS/graph.json","fetch_events":"https://pith.science/api/pith-number/DW5SC5MJVHYNT4XQ2WZ4S44BOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS/action/storage_attestation","attest_author":"https://pith.science/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS/action/author_attestation","sign_citation":"https://pith.science/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS/action/citation_signature","submit_replication":"https://pith.science/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS/action/replication_record"}},"created_at":"2026-05-18T02:52:22.480949+00:00","updated_at":"2026-05-18T02:52:22.480949+00:00"}