{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:W5VX7GZS7QBEZQQPHP6AG6VC4S","short_pith_number":"pith:W5VX7GZS","canonical_record":{"source":{"id":"1606.08951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T04:42:30Z","cross_cats_sorted":[],"title_canon_sha256":"efb72d512838b249b5e93f512fac768b4f3aabf0b054caa58f2a5b89bb6171a6","abstract_canon_sha256":"fe294a5f2d80d36b97c17be0e720bf3658c27075d0359078854790f0b9626977"},"schema_version":"1.0"},"canonical_sha256":"b76b7f9b32fc024cc20f3bfc037aa2e4b24c2d5d37b59d342f8fabdf4a9fc35a","source":{"kind":"arxiv","id":"1606.08951","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08951","created_at":"2026-05-18T01:11:42Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08951v1","created_at":"2026-05-18T01:11:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08951","created_at":"2026-05-18T01:11:42Z"},{"alias_kind":"pith_short_12","alias_value":"W5VX7GZS7QBE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W5VX7GZS7QBEZQQP","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W5VX7GZS","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:W5VX7GZS7QBEZQQPHP6AG6VC4S","target":"record","payload":{"canonical_record":{"source":{"id":"1606.08951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T04:42:30Z","cross_cats_sorted":[],"title_canon_sha256":"efb72d512838b249b5e93f512fac768b4f3aabf0b054caa58f2a5b89bb6171a6","abstract_canon_sha256":"fe294a5f2d80d36b97c17be0e720bf3658c27075d0359078854790f0b9626977"},"schema_version":"1.0"},"canonical_sha256":"b76b7f9b32fc024cc20f3bfc037aa2e4b24c2d5d37b59d342f8fabdf4a9fc35a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:42.005585Z","signature_b64":"Z8OZUxvexpZMQDG0LG6oQy6APNl9YKPRBNmB8YUi48wX6KANdLUG63q/PT5NAZbRHjuS4+7S1xS42lA48lKtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b76b7f9b32fc024cc20f3bfc037aa2e4b24c2d5d37b59d342f8fabdf4a9fc35a","last_reissued_at":"2026-05-18T01:11:42.005216Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:42.005216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.08951","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:11:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g2IGDipAiPPh2kN99wywHlA4tdm/cmeMf4t+0ADXxhpyTJlsNbUci3kvl9CF2MpsAGBzl/iqpS4ili7IkrOFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:30:50.054832Z"},"content_sha256":"b105200d39a9e109f98f64b84bd7715e7134ff0b7d812994867c7064a0f6dae1","schema_version":"1.0","event_id":"sha256:b105200d39a9e109f98f64b84bd7715e7134ff0b7d812994867c7064a0f6dae1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:W5VX7GZS7QBEZQQPHP6AG6VC4S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Aggregation-based cutting-planes for packing and covering integer programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alberto Del Pia, Marco Molinaro, Merve Bodur, Santanu S. Dey, Sebastian Pokutta","submitted_at":"2016-06-29T04:42:30Z","abstract_excerpt":"In this paper, we study the strength of Chvatal-Gomory (CG) cuts and more generally aggregation cuts for packing and covering integer programs (IPs). Aggregation cuts are obtained as follows: Given an IP formulation, we first generate a single implied inequality using aggregation of the original constraints, then obtain the integer hull of the set defined by this single inequality with variable bounds, and finally use the inequalities describing the integer hull as cutting-planes. Our first main result is to show that for packing and covering IPs, the CG and aggregation closures can be 2-appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08951","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:11:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sWYeXFruB5i/DA62tqcMN500DYLOZa5mCRFKBOeBRQMdT+RgQl/KT0UpPRdHJH7ynQlKSdFoICJ5JcAKkE1ODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:30:50.055338Z"},"content_sha256":"09779f07e45572225127fabcbed7285eb79d2f954702a2c588c659fdbdacf0d4","schema_version":"1.0","event_id":"sha256:09779f07e45572225127fabcbed7285eb79d2f954702a2c588c659fdbdacf0d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5VX7GZS7QBEZQQPHP6AG6VC4S/bundle.json","state_url":"https://pith.science/pith/W5VX7GZS7QBEZQQPHP6AG6VC4S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5VX7GZS7QBEZQQPHP6AG6VC4S/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-05-24T02:30:50Z","links":{"resolver":"https://pith.science/pith/W5VX7GZS7QBEZQQPHP6AG6VC4S","bundle":"https://pith.science/pith/W5VX7GZS7QBEZQQPHP6AG6VC4S/bundle.json","state":"https://pith.science/pith/W5VX7GZS7QBEZQQPHP6AG6VC4S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5VX7GZS7QBEZQQPHP6AG6VC4S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:W5VX7GZS7QBEZQQPHP6AG6VC4S","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":"fe294a5f2d80d36b97c17be0e720bf3658c27075d0359078854790f0b9626977","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T04:42:30Z","title_canon_sha256":"efb72d512838b249b5e93f512fac768b4f3aabf0b054caa58f2a5b89bb6171a6"},"schema_version":"1.0","source":{"id":"1606.08951","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08951","created_at":"2026-05-18T01:11:42Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08951v1","created_at":"2026-05-18T01:11:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08951","created_at":"2026-05-18T01:11:42Z"},{"alias_kind":"pith_short_12","alias_value":"W5VX7GZS7QBE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W5VX7GZS7QBEZQQP","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W5VX7GZS","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:09779f07e45572225127fabcbed7285eb79d2f954702a2c588c659fdbdacf0d4","target":"graph","created_at":"2026-05-18T01:11:42Z","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 study the strength of Chvatal-Gomory (CG) cuts and more generally aggregation cuts for packing and covering integer programs (IPs). Aggregation cuts are obtained as follows: Given an IP formulation, we first generate a single implied inequality using aggregation of the original constraints, then obtain the integer hull of the set defined by this single inequality with variable bounds, and finally use the inequalities describing the integer hull as cutting-planes. Our first main result is to show that for packing and covering IPs, the CG and aggregation closures can be 2-appro","authors_text":"Alberto Del Pia, Marco Molinaro, Merve Bodur, Santanu S. Dey, Sebastian Pokutta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T04:42:30Z","title":"Aggregation-based cutting-planes for packing and covering integer programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08951","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:b105200d39a9e109f98f64b84bd7715e7134ff0b7d812994867c7064a0f6dae1","target":"record","created_at":"2026-05-18T01:11:42Z","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":"fe294a5f2d80d36b97c17be0e720bf3658c27075d0359078854790f0b9626977","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-29T04:42:30Z","title_canon_sha256":"efb72d512838b249b5e93f512fac768b4f3aabf0b054caa58f2a5b89bb6171a6"},"schema_version":"1.0","source":{"id":"1606.08951","kind":"arxiv","version":1}},"canonical_sha256":"b76b7f9b32fc024cc20f3bfc037aa2e4b24c2d5d37b59d342f8fabdf4a9fc35a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b76b7f9b32fc024cc20f3bfc037aa2e4b24c2d5d37b59d342f8fabdf4a9fc35a","first_computed_at":"2026-05-18T01:11:42.005216Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:42.005216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z8OZUxvexpZMQDG0LG6oQy6APNl9YKPRBNmB8YUi48wX6KANdLUG63q/PT5NAZbRHjuS4+7S1xS42lA48lKtDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:42.005585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.08951","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b105200d39a9e109f98f64b84bd7715e7134ff0b7d812994867c7064a0f6dae1","sha256:09779f07e45572225127fabcbed7285eb79d2f954702a2c588c659fdbdacf0d4"],"state_sha256":"1d174eb6e8f50c1bd8cd8d7f405f99eb75a16b2dcef6f5575f0377a266ce868b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JWVoY61tNyqiqTi5+mft7dFyR/2WBY3Vx5HRJntJs3orZshAkrZolmqOTUWztaQlRWL+fBNjuC0fZmKqcn2oBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T02:30:50.057627Z","bundle_sha256":"56d9d354e0474eb082109c574a485e568cb1642074a324ce6338980cc9c6c32c"}}