{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6LXHXKL6L36OL3MVEUHWSDBYQI","short_pith_number":"pith:6LXHXKL6","canonical_record":{"source":{"id":"1711.06963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-19T04:06:21Z","cross_cats_sorted":[],"title_canon_sha256":"6b2ce6acaa6bb72803852ad1cf3751468af3386d216748b84571b9aa14389d53","abstract_canon_sha256":"1920b7d79e5e8af97730ba4e205acd35b08ea7bff17d64c984e8e1b06606c4d8"},"schema_version":"1.0"},"canonical_sha256":"f2ee7ba97e5efce5ed95250f690c388207d3656f7857e92aa457cfda43a25387","source":{"kind":"arxiv","id":"1711.06963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06963","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06963v1","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06963","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"6LXHXKL6L36O","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6LXHXKL6L36OL3MV","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6LXHXKL6","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6LXHXKL6L36OL3MVEUHWSDBYQI","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-19T04:06:21Z","cross_cats_sorted":[],"title_canon_sha256":"6b2ce6acaa6bb72803852ad1cf3751468af3386d216748b84571b9aa14389d53","abstract_canon_sha256":"1920b7d79e5e8af97730ba4e205acd35b08ea7bff17d64c984e8e1b06606c4d8"},"schema_version":"1.0"},"canonical_sha256":"f2ee7ba97e5efce5ed95250f690c388207d3656f7857e92aa457cfda43a25387","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:15.012465Z","signature_b64":"GPRPzgNbhjo6A46yTLGbk2NQd5V8gHFbIaP45Xa3BQb3SHGf+KpcsOxN/sSDoltvdPZ4le5ftdgHa4ZMslFYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2ee7ba97e5efce5ed95250f690c388207d3656f7857e92aa457cfda43a25387","last_reissued_at":"2026-05-18T00:30:15.011812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:15.011812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06963","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-18T00:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iXHSm6au1IOSlrwZaxbSh7WMyrOkqM45J86bjxa6iO/kb+QCScmi8nhjdxwLxJpbeoywMy0FsD3mQCdyb0M5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:57:16.060668Z"},"content_sha256":"8c16b53bab7afdc34277bbde239b2bcfcfbfa1504b915d9049952f6b89df0877","schema_version":"1.0","event_id":"sha256:8c16b53bab7afdc34277bbde239b2bcfcfbfa1504b915d9049952f6b89df0877"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6LXHXKL6L36OL3MVEUHWSDBYQI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andres Iroume, Guanyi Wang, Santanu S. Dey","submitted_at":"2017-11-19T04:06:21Z","abstract_excerpt":"In this paper, we study the strength of aggregation cuts for sign-pattern integer programs (IPs). Sign-pattern IPs are a generalization of packing IPs and are of the form $\\{x\\in \\mathbb{Z}^n_+\\ | \\ Ax\\le b\\}$ where for a given column $j$, $A_{ij}$ is either non-negative for all $i$ or non-positive for all $i$. Our first result is that the aggregation closure for such sign-pattern IPs can be 2-approximated by the original 1-row closure. This generalizes a result for packing IPs. On the other hand, unlike in the case of packing IPs, we show that the multi-row aggregation closure cannot be well "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06963","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-18T00:30:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ty6HZiUOeoM09KVyZb8pbmRawxfiDYalwsOrfXbeeiYxzs+vk4sPjOH8DkxQLlMjJ+BbMzoyCrwy+qL0sx0NCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T03:57:16.061365Z"},"content_sha256":"df20839f594af2623cde95c58452064f3dd092f1222a42bd54c7fb856440ff0a","schema_version":"1.0","event_id":"sha256:df20839f594af2623cde95c58452064f3dd092f1222a42bd54c7fb856440ff0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LXHXKL6L36OL3MVEUHWSDBYQI/bundle.json","state_url":"https://pith.science/pith/6LXHXKL6L36OL3MVEUHWSDBYQI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LXHXKL6L36OL3MVEUHWSDBYQI/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-06T03:57:16Z","links":{"resolver":"https://pith.science/pith/6LXHXKL6L36OL3MVEUHWSDBYQI","bundle":"https://pith.science/pith/6LXHXKL6L36OL3MVEUHWSDBYQI/bundle.json","state":"https://pith.science/pith/6LXHXKL6L36OL3MVEUHWSDBYQI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LXHXKL6L36OL3MVEUHWSDBYQI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6LXHXKL6L36OL3MVEUHWSDBYQI","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":"1920b7d79e5e8af97730ba4e205acd35b08ea7bff17d64c984e8e1b06606c4d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-19T04:06:21Z","title_canon_sha256":"6b2ce6acaa6bb72803852ad1cf3751468af3386d216748b84571b9aa14389d53"},"schema_version":"1.0","source":{"id":"1711.06963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06963","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06963v1","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06963","created_at":"2026-05-18T00:30:15Z"},{"alias_kind":"pith_short_12","alias_value":"6LXHXKL6L36O","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6LXHXKL6L36OL3MV","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6LXHXKL6","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:df20839f594af2623cde95c58452064f3dd092f1222a42bd54c7fb856440ff0a","target":"graph","created_at":"2026-05-18T00:30:15Z","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 aggregation cuts for sign-pattern integer programs (IPs). Sign-pattern IPs are a generalization of packing IPs and are of the form $\\{x\\in \\mathbb{Z}^n_+\\ | \\ Ax\\le b\\}$ where for a given column $j$, $A_{ij}$ is either non-negative for all $i$ or non-positive for all $i$. Our first result is that the aggregation closure for such sign-pattern IPs can be 2-approximated by the original 1-row closure. This generalizes a result for packing IPs. On the other hand, unlike in the case of packing IPs, we show that the multi-row aggregation closure cannot be well ","authors_text":"Andres Iroume, Guanyi Wang, Santanu S. Dey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-19T04:06:21Z","title":"The Strength of Multi-row Aggregation Cuts for Sign-pattern Integer Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06963","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:8c16b53bab7afdc34277bbde239b2bcfcfbfa1504b915d9049952f6b89df0877","target":"record","created_at":"2026-05-18T00:30:15Z","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":"1920b7d79e5e8af97730ba4e205acd35b08ea7bff17d64c984e8e1b06606c4d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-19T04:06:21Z","title_canon_sha256":"6b2ce6acaa6bb72803852ad1cf3751468af3386d216748b84571b9aa14389d53"},"schema_version":"1.0","source":{"id":"1711.06963","kind":"arxiv","version":1}},"canonical_sha256":"f2ee7ba97e5efce5ed95250f690c388207d3656f7857e92aa457cfda43a25387","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2ee7ba97e5efce5ed95250f690c388207d3656f7857e92aa457cfda43a25387","first_computed_at":"2026-05-18T00:30:15.011812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:15.011812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GPRPzgNbhjo6A46yTLGbk2NQd5V8gHFbIaP45Xa3BQb3SHGf+KpcsOxN/sSDoltvdPZ4le5ftdgHa4ZMslFYCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:15.012465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c16b53bab7afdc34277bbde239b2bcfcfbfa1504b915d9049952f6b89df0877","sha256:df20839f594af2623cde95c58452064f3dd092f1222a42bd54c7fb856440ff0a"],"state_sha256":"4779f7460440a5e650f8ae4548a762dc8cf727e09da52456cefc363384a5d211"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4QvSlyTeeD9LM9b7wBjd93gfujU4Nx8ysKduEVmFKHF8fON6phqBEBVJ3rBzwKLLZdyE8YNMXnGQgr89il1qAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T03:57:16.065270Z","bundle_sha256":"6eff328b8ae4679fe5053889feb9bd6a02c3fa8d76222e1215d9a24d4ac4d796"}}