{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MVTI7FCWIZD6A4CFUYEJYV2LDG","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":"1f466224048541f7dd142a2eb2fdf9032d55f85accdecb997c1b6507eeaf2eac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-25T09:33:53Z","title_canon_sha256":"b76cfa505550161924983e42678bf5f79f782d0bd0fbaf3c30d5406fb238878a"},"schema_version":"1.0","source":{"id":"2605.25635","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25635","created_at":"2026-05-26T02:04:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25635v1","created_at":"2026-05-26T02:04:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25635","created_at":"2026-05-26T02:04:47Z"},{"alias_kind":"pith_short_12","alias_value":"MVTI7FCWIZD6","created_at":"2026-05-26T02:04:47Z"},{"alias_kind":"pith_short_16","alias_value":"MVTI7FCWIZD6A4CF","created_at":"2026-05-26T02:04:47Z"},{"alias_kind":"pith_short_8","alias_value":"MVTI7FCW","created_at":"2026-05-26T02:04:47Z"}],"graph_snapshots":[{"event_id":"sha256:3a11e4d3b50e8474cabb36e0019ab295d407efaa11ab1686b75ede3f7bbcdd8e","target":"graph","created_at":"2026-05-26T02:04:47Z","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/2605.25635/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study how much a linear program (LP) can be compressed when solved repeatedly, given prior knowledge about its objective function. Existing data-driven projection methods learn low-dimensional surrogate LPs with approximate objective-value guarantees, but cannot provably identify the optimal projection for a prescribed compression budget. We instead ask a sharper question: how far can an LP be compressed into a lower-dimensional equivalent while \\emph{exactly} preserving optimality, enabling faster repeated solves with no loss in solution quality? We provide an exact geometric characterizat","authors_text":"Omar Bennouna, Yuhan Ye","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-25T09:33:53Z","title":"The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25635","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:16d58e813cccd1cacc7ff965b50fd46246346dd0c165429397acbc455a758f3e","target":"record","created_at":"2026-05-26T02:04:47Z","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":"1f466224048541f7dd142a2eb2fdf9032d55f85accdecb997c1b6507eeaf2eac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-25T09:33:53Z","title_canon_sha256":"b76cfa505550161924983e42678bf5f79f782d0bd0fbaf3c30d5406fb238878a"},"schema_version":"1.0","source":{"id":"2605.25635","kind":"arxiv","version":1}},"canonical_sha256":"65668f94564647e07045a6089c574b1981cc9c9d271f857f9073b7977d34c562","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65668f94564647e07045a6089c574b1981cc9c9d271f857f9073b7977d34c562","first_computed_at":"2026-05-26T02:04:47.439879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:04:47.439879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ovpwER62cxtu+RrGgE8PXv2DCl8m2ovpyJu1o7JRbTqwqHxnClF46gx+3KF+KxApSsxJZDbR7x8+yPIY06ZoAg==","signature_status":"signed_v1","signed_at":"2026-05-26T02:04:47.440683Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.25635","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16d58e813cccd1cacc7ff965b50fd46246346dd0c165429397acbc455a758f3e","sha256:3a11e4d3b50e8474cabb36e0019ab295d407efaa11ab1686b75ede3f7bbcdd8e"],"state_sha256":"7824cd46d0ea51706b71e537760b11d14691f257322049456eca6d55bef16971"}