{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DW5SC5MJVHYNT4XQ2WZ4S44BOS","short_pith_number":"pith:DW5SC5MJ","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"},"canonical_sha256":"1dbb217589a9f0d9f2f0d5b3c9738174a1a662eb7c2d1c5ea19480819ecd3372","source":{"kind":"arxiv","id":"1405.1789","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1789","created_at":"2026-05-18T02:52:22Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1789v1","created_at":"2026-05-18T02:52:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1789","created_at":"2026-05-18T02:52:22Z"},{"alias_kind":"pith_short_12","alias_value":"DW5SC5MJVHYN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DW5SC5MJVHYNT4XQ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DW5SC5MJ","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DW5SC5MJVHYNT4XQ2WZ4S44BOS","target":"record","payload":{"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"},"canonical_sha256":"1dbb217589a9f0d9f2f0d5b3c9738174a1a662eb7c2d1c5ea19480819ecd3372","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"},"source_kind":"arxiv","source_id":"1405.1789","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:52:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sVDh/B88dCnqVEw0LLXapWs2dUmCMb6LoIHsntdrclsxsTFdIbmzvzkAZibV5ThRe5REDCDFldyONovMCCDGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:58:02.722828Z"},"content_sha256":"22acb6d8a168ffa493fe3f81bfc37154821ba79cdbbc40565a249975940b89c5","schema_version":"1.0","event_id":"sha256:22acb6d8a168ffa493fe3f81bfc37154821ba79cdbbc40565a249975940b89c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DW5SC5MJVHYNT4XQ2WZ4S44BOS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:52:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"blzAGp1kMkHXjtHcHiz5XJfnDU+qfwwm7v9taWDjglS3DXJTT4pIRcojskxl/ZXejsMc97P+a78fVJI94oJkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T22:58:02.723597Z"},"content_sha256":"0ce07c8bfb25ee433cbd7c814ea2d2eaf128348f3f826135b682e1b7e5530bf0","schema_version":"1.0","event_id":"sha256:0ce07c8bfb25ee433cbd7c814ea2d2eaf128348f3f826135b682e1b7e5530bf0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS/bundle.json","state_url":"https://pith.science/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T22:58:02Z","links":{"resolver":"https://pith.science/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS","bundle":"https://pith.science/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS/bundle.json","state":"https://pith.science/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DW5SC5MJVHYNT4XQ2WZ4S44BOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DW5SC5MJVHYNT4XQ2WZ4S44BOS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c468bc43c80fae1c6fa78a90ae74e279e8ebafcb269f50f945bff88859c6e7bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-08T01:23:35Z","title_canon_sha256":"6ff349bd49374f7348d993bf9910091a6a576149e209504bf239db673f65ef25"},"schema_version":"1.0","source":{"id":"1405.1789","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1789","created_at":"2026-05-18T02:52:22Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1789v1","created_at":"2026-05-18T02:52:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1789","created_at":"2026-05-18T02:52:22Z"},{"alias_kind":"pith_short_12","alias_value":"DW5SC5MJVHYN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DW5SC5MJVHYNT4XQ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DW5SC5MJ","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:0ce07c8bfb25ee433cbd7c814ea2d2eaf128348f3f826135b682e1b7e5530bf0","target":"graph","created_at":"2026-05-18T02:52:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Marco Molinaro, Qianyi Wang, Santanu S. Dey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-08T01:23:35Z","title":"How Good Are Sparse Cutting-Planes?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1789","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:22acb6d8a168ffa493fe3f81bfc37154821ba79cdbbc40565a249975940b89c5","target":"record","created_at":"2026-05-18T02:52:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c468bc43c80fae1c6fa78a90ae74e279e8ebafcb269f50f945bff88859c6e7bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-08T01:23:35Z","title_canon_sha256":"6ff349bd49374f7348d993bf9910091a6a576149e209504bf239db673f65ef25"},"schema_version":"1.0","source":{"id":"1405.1789","kind":"arxiv","version":1}},"canonical_sha256":"1dbb217589a9f0d9f2f0d5b3c9738174a1a662eb7c2d1c5ea19480819ecd3372","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dbb217589a9f0d9f2f0d5b3c9738174a1a662eb7c2d1c5ea19480819ecd3372","first_computed_at":"2026-05-18T02:52:22.480833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:22.480833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SD6JvgwE8tnJKw10Kf2cLbXuC1vE0YZNgUniVlKRasQyrwdqgZXv6SkoTyaOKiO0ybuGSsPcZAZSqpMVH82QDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:22.481466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1789","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22acb6d8a168ffa493fe3f81bfc37154821ba79cdbbc40565a249975940b89c5","sha256:0ce07c8bfb25ee433cbd7c814ea2d2eaf128348f3f826135b682e1b7e5530bf0"],"state_sha256":"0506424e7e08f03949e523a2c34f5bf80354c5770f2606e1332d200320edddb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqCS6j2FG693ds3Jg7Sf3CEvjgjPUoxTyQKjTL5JAZEUqCZiJtfs69+XsIpAMs8KkE6Mj3WTc3EJsknGAaDqDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T22:58:02.728487Z","bundle_sha256":"1a279fa76c6cac940bd1fdc20350f3dacfe8f4c2bb50ad938a8b0e440883f791"}}