{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MVTI7FCWIZD6A4CFUYEJYV2LDG","short_pith_number":"pith:MVTI7FCW","schema_version":"1.0","canonical_sha256":"65668f94564647e07045a6089c574b1981cc9c9d271f857f9073b7977d34c562","source":{"kind":"arxiv","id":"2605.25635","version":1},"attestation_state":"computed","paper":{"title":"The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Omar Bennouna, Yuhan Ye","submitted_at":"2026-05-25T09:33:53Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.25635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-25T09:33:53Z","cross_cats_sorted":[],"title_canon_sha256":"b76cfa505550161924983e42678bf5f79f782d0bd0fbaf3c30d5406fb238878a","abstract_canon_sha256":"1f466224048541f7dd142a2eb2fdf9032d55f85accdecb997c1b6507eeaf2eac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:47.440683Z","signature_b64":"ovpwER62cxtu+RrGgE8PXv2DCl8m2ovpyJu1o7JRbTqwqHxnClF46gx+3KF+KxApSsxJZDbR7x8+yPIY06ZoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65668f94564647e07045a6089c574b1981cc9c9d271f857f9073b7977d34c562","last_reissued_at":"2026-05-26T02:04:47.439879Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:47.439879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Omar Bennouna, Yuhan Ye","submitted_at":"2026-05-25T09:33:53Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25635","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.25635/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.25635","created_at":"2026-05-26T02:04:47.440006+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.25635v1","created_at":"2026-05-26T02:04:47.440006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25635","created_at":"2026-05-26T02:04:47.440006+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVTI7FCWIZD6","created_at":"2026-05-26T02:04:47.440006+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVTI7FCWIZD6A4CF","created_at":"2026-05-26T02:04:47.440006+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVTI7FCW","created_at":"2026-05-26T02:04:47.440006+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG","json":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG.json","graph_json":"https://pith.science/api/pith-number/MVTI7FCWIZD6A4CFUYEJYV2LDG/graph.json","events_json":"https://pith.science/api/pith-number/MVTI7FCWIZD6A4CFUYEJYV2LDG/events.json","paper":"https://pith.science/paper/MVTI7FCW"},"agent_actions":{"view_html":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG","download_json":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG.json","view_paper":"https://pith.science/paper/MVTI7FCW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.25635&json=true","fetch_graph":"https://pith.science/api/pith-number/MVTI7FCWIZD6A4CFUYEJYV2LDG/graph.json","fetch_events":"https://pith.science/api/pith-number/MVTI7FCWIZD6A4CFUYEJYV2LDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG/action/storage_attestation","attest_author":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG/action/author_attestation","sign_citation":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG/action/citation_signature","submit_replication":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG/action/replication_record"}},"created_at":"2026-05-26T02:04:47.440006+00:00","updated_at":"2026-05-26T02:04:47.440006+00:00"}