{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SJQ32HVAHHOQU2ZGVLZ4PPCCEF","short_pith_number":"pith:SJQ32HVA","canonical_record":{"source":{"id":"2508.20880","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-28T15:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"bb739252ce437b423b2f0d9ed5f76d42845647739214977f99c7024dc5a93d15","abstract_canon_sha256":"175ce883c2fad9d03b45443c1ed51b32ae651d5ee9ee48740c36b2b5530a2b65"},"schema_version":"1.0"},"canonical_sha256":"9261bd1ea039dd0a6b26aaf3c7bc42216131e5e47cc4490113ddfe2c7446f6fe","source":{"kind":"arxiv","id":"2508.20880","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20880","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20880v2","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20880","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"SJQ32HVAHHOQ","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"pith_short_16","alias_value":"SJQ32HVAHHOQU2ZG","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"pith_short_8","alias_value":"SJQ32HVA","created_at":"2026-06-19T16:10:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SJQ32HVAHHOQU2ZGVLZ4PPCCEF","target":"record","payload":{"canonical_record":{"source":{"id":"2508.20880","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-28T15:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"bb739252ce437b423b2f0d9ed5f76d42845647739214977f99c7024dc5a93d15","abstract_canon_sha256":"175ce883c2fad9d03b45443c1ed51b32ae651d5ee9ee48740c36b2b5530a2b65"},"schema_version":"1.0"},"canonical_sha256":"9261bd1ea039dd0a6b26aaf3c7bc42216131e5e47cc4490113ddfe2c7446f6fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:53.739103Z","signature_b64":"Cnc2ZfBw8ii4Y+P9sB2vPVGVenwd0/M2NSIISnw5j5mezk/4QRXYdgk24kNf1C4IkZoA/un042uvGWaHUC55DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9261bd1ea039dd0a6b26aaf3c7bc42216131e5e47cc4490113ddfe2c7446f6fe","last_reissued_at":"2026-06-19T16:10:53.738671Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:53.738671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.20880","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-06-19T16:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k0rmOA7LWWe0dZQl6lXQBqQdFogzQ6L2VyKD6pwpREgscbbcVfSq0c7DiE6kcp0kE/EHV8Yixouwoe49pNMJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:25:39.098698Z"},"content_sha256":"4614787838c93226ec281bf7728f760e901b7b1e396f596ba3c167913ade1d38","schema_version":"1.0","event_id":"sha256:4614787838c93226ec281bf7728f760e901b7b1e396f596ba3c167913ade1d38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SJQ32HVAHHOQU2ZGVLZ4PPCCEF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Rank Multi-Objective Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andreas L\\\"ohne, Pascal Zillmann","submitted_at":"2025-08-28T15:10:35Z","abstract_excerpt":"When solving multi-objective programs (MOLPs), the number of objectives essentially determines the computing time. This can even lead to practically unsolvable problems. Consequently, it is of huge interest to reduce the number of objectives without losing information. There exist approaches for transforming vector linear programs (VLPs), i.e., the ordering cone is non-standard, into MOLPs in the literature. We here propose a method for solving MOLPs more efficiently by applying the transformation in reverse. In particular, we discuss MOLPs with linear dependent objective functions. The result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20880","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/2508.20880/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-06-19T16:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t1iuyfi8yg/+9K2HZiPoV6ELgHfXgeQmssoqGmPbklhAxDgM88lsGEZiFHtKJpDi0mf/2+Z1pJ4vjltGzbsACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:25:39.099078Z"},"content_sha256":"22a765f077f9c7ded4f17825d87bda6d86ef0339de4757458c592e1607eb0251","schema_version":"1.0","event_id":"sha256:22a765f077f9c7ded4f17825d87bda6d86ef0339de4757458c592e1607eb0251"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJQ32HVAHHOQU2ZGVLZ4PPCCEF/bundle.json","state_url":"https://pith.science/pith/SJQ32HVAHHOQU2ZGVLZ4PPCCEF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJQ32HVAHHOQU2ZGVLZ4PPCCEF/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-27T21:25:39Z","links":{"resolver":"https://pith.science/pith/SJQ32HVAHHOQU2ZGVLZ4PPCCEF","bundle":"https://pith.science/pith/SJQ32HVAHHOQU2ZGVLZ4PPCCEF/bundle.json","state":"https://pith.science/pith/SJQ32HVAHHOQU2ZGVLZ4PPCCEF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJQ32HVAHHOQU2ZGVLZ4PPCCEF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SJQ32HVAHHOQU2ZGVLZ4PPCCEF","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":"175ce883c2fad9d03b45443c1ed51b32ae651d5ee9ee48740c36b2b5530a2b65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-28T15:10:35Z","title_canon_sha256":"bb739252ce437b423b2f0d9ed5f76d42845647739214977f99c7024dc5a93d15"},"schema_version":"1.0","source":{"id":"2508.20880","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20880","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20880v2","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20880","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"SJQ32HVAHHOQ","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"pith_short_16","alias_value":"SJQ32HVAHHOQU2ZG","created_at":"2026-06-19T16:10:53Z"},{"alias_kind":"pith_short_8","alias_value":"SJQ32HVA","created_at":"2026-06-19T16:10:53Z"}],"graph_snapshots":[{"event_id":"sha256:22a765f077f9c7ded4f17825d87bda6d86ef0339de4757458c592e1607eb0251","target":"graph","created_at":"2026-06-19T16:10:53Z","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/2508.20880/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"When solving multi-objective programs (MOLPs), the number of objectives essentially determines the computing time. This can even lead to practically unsolvable problems. Consequently, it is of huge interest to reduce the number of objectives without losing information. There exist approaches for transforming vector linear programs (VLPs), i.e., the ordering cone is non-standard, into MOLPs in the literature. We here propose a method for solving MOLPs more efficiently by applying the transformation in reverse. In particular, we discuss MOLPs with linear dependent objective functions. The result","authors_text":"Andreas L\\\"ohne, Pascal Zillmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-28T15:10:35Z","title":"Low-Rank Multi-Objective Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20880","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:4614787838c93226ec281bf7728f760e901b7b1e396f596ba3c167913ade1d38","target":"record","created_at":"2026-06-19T16:10:53Z","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":"175ce883c2fad9d03b45443c1ed51b32ae651d5ee9ee48740c36b2b5530a2b65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-28T15:10:35Z","title_canon_sha256":"bb739252ce437b423b2f0d9ed5f76d42845647739214977f99c7024dc5a93d15"},"schema_version":"1.0","source":{"id":"2508.20880","kind":"arxiv","version":2}},"canonical_sha256":"9261bd1ea039dd0a6b26aaf3c7bc42216131e5e47cc4490113ddfe2c7446f6fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9261bd1ea039dd0a6b26aaf3c7bc42216131e5e47cc4490113ddfe2c7446f6fe","first_computed_at":"2026-06-19T16:10:53.738671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:53.738671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cnc2ZfBw8ii4Y+P9sB2vPVGVenwd0/M2NSIISnw5j5mezk/4QRXYdgk24kNf1C4IkZoA/un042uvGWaHUC55DA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:53.739103Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.20880","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4614787838c93226ec281bf7728f760e901b7b1e396f596ba3c167913ade1d38","sha256:22a765f077f9c7ded4f17825d87bda6d86ef0339de4757458c592e1607eb0251"],"state_sha256":"edffa571af61c5200cdf00cedaaf3795432a11132139639ac63aaa1af67a3256"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nxtc+VIe+PkScLzPZIppb9vFIeyDONxG9P4Cwf6HVh/En9PQDGDWbWdB5QJaPV8yKq367oapH8QHt0au2BB+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T21:25:39.101168Z","bundle_sha256":"4f42d741e3281fd8eb308cb30521a7a34fafb0344bf1ce66f525b910577bf88d"}}