{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RJJ3MOXM5UOISMBPDCKGPMZQZG","short_pith_number":"pith:RJJ3MOXM","canonical_record":{"source":{"id":"2502.01192","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-03T09:30:13Z","cross_cats_sorted":[],"title_canon_sha256":"4aaca482e8cb8fca78b273d6f2b907ea996084bc9c0155d5fa0f8038f826c8fa","abstract_canon_sha256":"d750560e7d8e023bfabc2b40ea0960e9ba19784c4ca622d2cbda9793fac731db"},"schema_version":"1.0"},"canonical_sha256":"8a53b63aeced1c89302f189467b330c9a7fa42b51eb712cd98c42a009d640ceb","source":{"kind":"arxiv","id":"2502.01192","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01192","created_at":"2026-07-05T10:09:16Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01192v2","created_at":"2026-07-05T10:09:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01192","created_at":"2026-07-05T10:09:16Z"},{"alias_kind":"pith_short_12","alias_value":"RJJ3MOXM5UOI","created_at":"2026-07-05T10:09:16Z"},{"alias_kind":"pith_short_16","alias_value":"RJJ3MOXM5UOISMBP","created_at":"2026-07-05T10:09:16Z"},{"alias_kind":"pith_short_8","alias_value":"RJJ3MOXM","created_at":"2026-07-05T10:09:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RJJ3MOXM5UOISMBPDCKGPMZQZG","target":"record","payload":{"canonical_record":{"source":{"id":"2502.01192","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-03T09:30:13Z","cross_cats_sorted":[],"title_canon_sha256":"4aaca482e8cb8fca78b273d6f2b907ea996084bc9c0155d5fa0f8038f826c8fa","abstract_canon_sha256":"d750560e7d8e023bfabc2b40ea0960e9ba19784c4ca622d2cbda9793fac731db"},"schema_version":"1.0"},"canonical_sha256":"8a53b63aeced1c89302f189467b330c9a7fa42b51eb712cd98c42a009d640ceb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:16.643636Z","signature_b64":"SL6cGLAt30r/oeubixXCo6dJZGYzArPEoAeG3yCKW3HhbXEhJi2SpcZJZ5H0zr557V1Nf+wWDAiBYtrSoXG3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a53b63aeced1c89302f189467b330c9a7fa42b51eb712cd98c42a009d640ceb","last_reissued_at":"2026-07-05T10:09:16.643187Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:16.643187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.01192","source_version":2,"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-07-05T10:09:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TC0lo7pabAkj/3egGUT5NN6kspxZpauwAWFixO792Xbcn5TspZCnX7YPFg8bylihgs3hHuotk84eVJY4UJ4pDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:29:19.361765Z"},"content_sha256":"c0d7385d9b280a8bf3a9df3c63a62a2ad59e096514024270320e5be10cf54709","schema_version":"1.0","event_id":"sha256:c0d7385d9b280a8bf3a9df3c63a62a2ad59e096514024270320e5be10cf54709"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RJJ3MOXM5UOISMBPDCKGPMZQZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsity-driven Aggregation of Mixed Integer Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gioni Mexi, Ksenia Bestuzheva, Liding Xu","submitted_at":"2025-02-03T09:30:13Z","abstract_excerpt":"Cutting planes are crucial for the performance of branch-and-cut algorithms for solving mixed-integer programming (MIP) problems, and linear row aggregation has been successfully applied to better leverage the potential of several major families of MIP cutting planes. This paper formulates the problem of finding good quality aggregations as an $\\ell_0$-norm minimization problem and employs a combination of the lasso method and iterative reweighting to efficiently find sparse solutions corresponding to good aggregations. A comparative analysis of the proposed algorithm and the state-of-the-art "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01192","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.01192/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:09:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cmnMh3uIaGrsrHFA8fuqbHSffSSVJ7p4Rs+qeWwMfTMFDg4gz95JICCaD20W5RiCdm5PWCqhQB3vWNZ3+1keAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:29:19.362649Z"},"content_sha256":"9564f97e2309730f962ad4499ca0cc46a0be6da240d3c28edd6e4b9328d02e01","schema_version":"1.0","event_id":"sha256:9564f97e2309730f962ad4499ca0cc46a0be6da240d3c28edd6e4b9328d02e01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJJ3MOXM5UOISMBPDCKGPMZQZG/bundle.json","state_url":"https://pith.science/pith/RJJ3MOXM5UOISMBPDCKGPMZQZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJJ3MOXM5UOISMBPDCKGPMZQZG/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-08-10T09:29:19Z","links":{"resolver":"https://pith.science/pith/RJJ3MOXM5UOISMBPDCKGPMZQZG","bundle":"https://pith.science/pith/RJJ3MOXM5UOISMBPDCKGPMZQZG/bundle.json","state":"https://pith.science/pith/RJJ3MOXM5UOISMBPDCKGPMZQZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJJ3MOXM5UOISMBPDCKGPMZQZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RJJ3MOXM5UOISMBPDCKGPMZQZG","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":"d750560e7d8e023bfabc2b40ea0960e9ba19784c4ca622d2cbda9793fac731db","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-03T09:30:13Z","title_canon_sha256":"4aaca482e8cb8fca78b273d6f2b907ea996084bc9c0155d5fa0f8038f826c8fa"},"schema_version":"1.0","source":{"id":"2502.01192","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01192","created_at":"2026-07-05T10:09:16Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01192v2","created_at":"2026-07-05T10:09:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01192","created_at":"2026-07-05T10:09:16Z"},{"alias_kind":"pith_short_12","alias_value":"RJJ3MOXM5UOI","created_at":"2026-07-05T10:09:16Z"},{"alias_kind":"pith_short_16","alias_value":"RJJ3MOXM5UOISMBP","created_at":"2026-07-05T10:09:16Z"},{"alias_kind":"pith_short_8","alias_value":"RJJ3MOXM","created_at":"2026-07-05T10:09:16Z"}],"graph_snapshots":[{"event_id":"sha256:9564f97e2309730f962ad4499ca0cc46a0be6da240d3c28edd6e4b9328d02e01","target":"graph","created_at":"2026-07-05T10:09:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.01192/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cutting planes are crucial for the performance of branch-and-cut algorithms for solving mixed-integer programming (MIP) problems, and linear row aggregation has been successfully applied to better leverage the potential of several major families of MIP cutting planes. This paper formulates the problem of finding good quality aggregations as an $\\ell_0$-norm minimization problem and employs a combination of the lasso method and iterative reweighting to efficiently find sparse solutions corresponding to good aggregations. A comparative analysis of the proposed algorithm and the state-of-the-art ","authors_text":"Gioni Mexi, Ksenia Bestuzheva, Liding Xu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-03T09:30:13Z","title":"Sparsity-driven Aggregation of Mixed Integer Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01192","kind":"arxiv","version":2},"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:c0d7385d9b280a8bf3a9df3c63a62a2ad59e096514024270320e5be10cf54709","target":"record","created_at":"2026-07-05T10:09:16Z","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":"d750560e7d8e023bfabc2b40ea0960e9ba19784c4ca622d2cbda9793fac731db","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-03T09:30:13Z","title_canon_sha256":"4aaca482e8cb8fca78b273d6f2b907ea996084bc9c0155d5fa0f8038f826c8fa"},"schema_version":"1.0","source":{"id":"2502.01192","kind":"arxiv","version":2}},"canonical_sha256":"8a53b63aeced1c89302f189467b330c9a7fa42b51eb712cd98c42a009d640ceb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a53b63aeced1c89302f189467b330c9a7fa42b51eb712cd98c42a009d640ceb","first_computed_at":"2026-07-05T10:09:16.643187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:09:16.643187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SL6cGLAt30r/oeubixXCo6dJZGYzArPEoAeG3yCKW3HhbXEhJi2SpcZJZ5H0zr557V1Nf+wWDAiBYtrSoXG3BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:09:16.643636Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.01192","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0d7385d9b280a8bf3a9df3c63a62a2ad59e096514024270320e5be10cf54709","sha256:9564f97e2309730f962ad4499ca0cc46a0be6da240d3c28edd6e4b9328d02e01"],"state_sha256":"f4972d28a9b123ce7fdeb905f623b6fb53b9d370f2c126537d8b22b7dcef245f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f9GBGVeXEUSjt3pEId5TcVRPuK4tBdP3xBglAlKJUd0fGQuUQqY5fKKSa/D5/dssh8Vo8ATxS/0ZWaL4lsb3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T09:29:19.367354Z","bundle_sha256":"ed1a8341a6cd4d65022e411a297ceefa3c5592d5dadff2d69a62a35a4d74ce55"}}