{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MVTI7FCWIZD6A4CFUYEJYV2LDG","short_pith_number":"pith:MVTI7FCW","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"},"canonical_sha256":"65668f94564647e07045a6089c574b1981cc9c9d271f857f9073b7977d34c562","source":{"kind":"arxiv","id":"2605.25635","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MVTI7FCWIZD6A4CFUYEJYV2LDG","target":"record","payload":{"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"},"canonical_sha256":"65668f94564647e07045a6089c574b1981cc9c9d271f857f9073b7977d34c562","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"},"source_kind":"arxiv","source_id":"2605.25635","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-26T02:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3lYXPYgGXC5iKa5UbnNc60IdeY2gjmf2plCAf0HlmzR7zy/SaVRCvWNxnPoloZu9ULS9VCeHXlThIrkEg49BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:09:17.057938Z"},"content_sha256":"16d58e813cccd1cacc7ff965b50fd46246346dd0c165429397acbc455a758f3e","schema_version":"1.0","event_id":"sha256:16d58e813cccd1cacc7ff965b50fd46246346dd0c165429397acbc455a758f3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MVTI7FCWIZD6A4CFUYEJYV2LDG","target":"graph","payload":{"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"},"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-26T02:04:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V4yy4Kh2y5g0EcROMhxXeexdmwtryh5ioBN8OEBz9G4bRPV4KBY5VXKdPvuNB4RLC+iWM8DGhScgJg9f22uwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:09:17.058578Z"},"content_sha256":"3a11e4d3b50e8474cabb36e0019ab295d407efaa11ab1686b75ede3f7bbcdd8e","schema_version":"1.0","event_id":"sha256:3a11e4d3b50e8474cabb36e0019ab295d407efaa11ab1686b75ede3f7bbcdd8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG/bundle.json","state_url":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG/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-30T22:09:17Z","links":{"resolver":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG","bundle":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG/bundle.json","state":"https://pith.science/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVTI7FCWIZD6A4CFUYEJYV2LDG/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9l0o+Z0Xli97C2817dunYJ+MSE6s3J2HhK/GGYSPYWh9F777AVAWAEolfKxRudYfZOJWlLsc6nhziBgLu4VTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T22:09:17.061760Z","bundle_sha256":"174943c7a35c61afb998f49fc6dac718879cc65f02a4ba9941d3924bd7810736"}}