{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VKN52O3XNKAWCTWY3N3ZLWNJMP","short_pith_number":"pith:VKN52O3X","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"},"canonical_sha256":"aa9bdd3b776a81614ed8db7795d9a963d9ee566ac9fa755bb2d8eda21e6de98f","source":{"kind":"arxiv","id":"1601.00198","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00198","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00198v1","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00198","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"pith_short_12","alias_value":"VKN52O3XNKAW","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VKN52O3XNKAWCTWY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VKN52O3X","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VKN52O3XNKAWCTWY3N3ZLWNJMP","target":"record","payload":{"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"},"canonical_sha256":"aa9bdd3b776a81614ed8db7795d9a963d9ee566ac9fa755bb2d8eda21e6de98f","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"},"source_kind":"arxiv","source_id":"1601.00198","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-18T01:23:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZQfFQbqTcbz0+WCpcMmEUi/nacXMxtx/ZxZEHM8SqoxYtswIbcDhjB2a5gPIUpRXulAAWHIq8KLzMk9Cp9wCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:00:23.725091Z"},"content_sha256":"b545b11d8027bd23f4b734286d9e4c42983b285f18e46c2d3526dbfd3a733c53","schema_version":"1.0","event_id":"sha256:b545b11d8027bd23f4b734286d9e4c42983b285f18e46c2d3526dbfd3a733c53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VKN52O3XNKAWCTWY3N3ZLWNJMP","target":"graph","payload":{"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"},"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-18T01:23:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJqZYaHXouay6h4r/g5/00K3qITWWw6J++gAFNZSjPj9QBRrY1+zWQ21SpQ4hqgwbRzA7G4QHM50LZTbuECYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:00:23.725826Z"},"content_sha256":"809c65ab0004d0302ccd5af2e977cb40ce3b26091f97f11d1f9ddfeb01202c96","schema_version":"1.0","event_id":"sha256:809c65ab0004d0302ccd5af2e977cb40ce3b26091f97f11d1f9ddfeb01202c96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP/bundle.json","state_url":"https://pith.science/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP/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-05T20:00:23Z","links":{"resolver":"https://pith.science/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP","bundle":"https://pith.science/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP/bundle.json","state":"https://pith.science/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKN52O3XNKAWCTWY3N3ZLWNJMP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VKN52O3XNKAWCTWY3N3ZLWNJMP","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":"5b1ae5e6ef094bcea120ea618e464130607ec4284f598cb59e19931ecf18f50e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-02T17:47:48Z","title_canon_sha256":"573ed72744806161d8d1d5157c7b4f7239ce9c2e7c2fe8559c8840eaa24e4216"},"schema_version":"1.0","source":{"id":"1601.00198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00198","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00198v1","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00198","created_at":"2026-05-18T01:23:28Z"},{"alias_kind":"pith_short_12","alias_value":"VKN52O3XNKAW","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VKN52O3XNKAWCTWY","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VKN52O3X","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:809c65ab0004d0302ccd5af2e977cb40ce3b26091f97f11d1f9ddfeb01202c96","target":"graph","created_at":"2026-05-18T01:23:28Z","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":"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","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":"2016-01-02T17:47:48Z","title":"Analysis of Sparse Cutting-planes for Sparse MILPs with Applications to Stochastic MILPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00198","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:b545b11d8027bd23f4b734286d9e4c42983b285f18e46c2d3526dbfd3a733c53","target":"record","created_at":"2026-05-18T01:23:28Z","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":"5b1ae5e6ef094bcea120ea618e464130607ec4284f598cb59e19931ecf18f50e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-02T17:47:48Z","title_canon_sha256":"573ed72744806161d8d1d5157c7b4f7239ce9c2e7c2fe8559c8840eaa24e4216"},"schema_version":"1.0","source":{"id":"1601.00198","kind":"arxiv","version":1}},"canonical_sha256":"aa9bdd3b776a81614ed8db7795d9a963d9ee566ac9fa755bb2d8eda21e6de98f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa9bdd3b776a81614ed8db7795d9a963d9ee566ac9fa755bb2d8eda21e6de98f","first_computed_at":"2026-05-18T01:23:28.243308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:28.243308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6acU8rceUQsNYj5OT6rHRGRrr8mRc6RHT18jiHi1Q36GUJDh7Gk9DFft/4AQk58KDlkNYXontW0MdrCGFAuUAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:28.244086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.00198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b545b11d8027bd23f4b734286d9e4c42983b285f18e46c2d3526dbfd3a733c53","sha256:809c65ab0004d0302ccd5af2e977cb40ce3b26091f97f11d1f9ddfeb01202c96"],"state_sha256":"3ee42bffb99b10a0426d5196f0300bb2aeb747227098c52cb87374ebe4a44954"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i28QbFy9lOV0/OmFvJQXt1H26L9KJFznEfjk0nMEAVCzzscRQHQL25zduXHgzlURa3vO6yA2G84M8sxbD28OBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:00:23.730036Z","bundle_sha256":"65d27da640ed030fb25aa35cc3f394789a0c7475f8c758c6fc57ebb0c62f6597"}}