{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RXACAHFEZ4E77QGUSUSGRHTEMA","short_pith_number":"pith:RXACAHFE","canonical_record":{"source":{"id":"2504.02833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-16T11:05:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"acdbfba09b9e0c81ae60a25093d68886977c4c78a08f9193a6b93cd624b95d7a","abstract_canon_sha256":"5e8c56300331375f5f62a6a31c37831900cfe2bc14085d11894475d6b1c23a96"},"schema_version":"1.0"},"canonical_sha256":"8dc0201ca4cf09ffc0d49524689e64602a44dc9ba8c6bed9c55f3a749b5f7c08","source":{"kind":"arxiv","id":"2504.02833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.02833","created_at":"2026-07-05T10:44:03Z"},{"alias_kind":"arxiv_version","alias_value":"2504.02833v1","created_at":"2026-07-05T10:44:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.02833","created_at":"2026-07-05T10:44:03Z"},{"alias_kind":"pith_short_12","alias_value":"RXACAHFEZ4E7","created_at":"2026-07-05T10:44:03Z"},{"alias_kind":"pith_short_16","alias_value":"RXACAHFEZ4E77QGU","created_at":"2026-07-05T10:44:03Z"},{"alias_kind":"pith_short_8","alias_value":"RXACAHFE","created_at":"2026-07-05T10:44:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RXACAHFEZ4E77QGUSUSGRHTEMA","target":"record","payload":{"canonical_record":{"source":{"id":"2504.02833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-16T11:05:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"acdbfba09b9e0c81ae60a25093d68886977c4c78a08f9193a6b93cd624b95d7a","abstract_canon_sha256":"5e8c56300331375f5f62a6a31c37831900cfe2bc14085d11894475d6b1c23a96"},"schema_version":"1.0"},"canonical_sha256":"8dc0201ca4cf09ffc0d49524689e64602a44dc9ba8c6bed9c55f3a749b5f7c08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:03.597903Z","signature_b64":"woPRtOiIsPRTH1psGiIxlZPOjrkTzorEMQu5efJd51lHO6MP9YWcKdBX4iYyDBqxqIM/kNx1WUqD2sBTHLmTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dc0201ca4cf09ffc0d49524689e64602a44dc9ba8c6bed9c55f3a749b5f7c08","last_reissued_at":"2026-07-05T10:44:03.597461Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:03.597461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.02833","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-07-05T10:44:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wq8+Mi+x6t64Rmh+nOafj5H6ffHhqAw2cRiGD43NWmgAVUq+CV11IAMk/42oovCchOiG6P2qtZMYnKF+CbyxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:00:49.221034Z"},"content_sha256":"23a042d27a1637973508453e5df663cfc22ed5d1b91872db5782cd16c750e10f","schema_version":"1.0","event_id":"sha256:23a042d27a1637973508453e5df663cfc22ed5d1b91872db5782cd16c750e10f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RXACAHFEZ4E77QGUSUSGRHTEMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Min-Max Optimization via Primal-Dual Exact Pareto Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Lajos Hanzo, Sangwoo Park, Stefan Vlaski","submitted_at":"2025-03-16T11:05:51Z","abstract_excerpt":"In multi-objective optimization, minimizing the worst objective can be preferable to minimizing the average objective, as this ensures improved fairness across objectives. Due to the non-smooth nature of the resultant min-max optimization problem, classical subgradient-based approaches typically exhibit slow convergence. Motivated by primal-dual consensus techniques in multi-agent optimization and learning, we formulate a smooth variant of the min-max problem based on the augmented Lagrangian. The resultant Exact Pareto Optimization via Augmented Lagrangian (EPO-AL) algorithm scales better wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.02833","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/2504.02833/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:44:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TfmEKNN9FU0Ylu7HbCFzqNm+qRmRB+dxWhcsncLjm1ktHxVZ++vJUHDTPtf1pGauRQuxzoAWbktlm2e6RfTcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:00:49.221913Z"},"content_sha256":"1a2f5a586d3bda5123f7159f63468bf96b7de0f5bb20ba014a07c48e5f7669a9","schema_version":"1.0","event_id":"sha256:1a2f5a586d3bda5123f7159f63468bf96b7de0f5bb20ba014a07c48e5f7669a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXACAHFEZ4E77QGUSUSGRHTEMA/bundle.json","state_url":"https://pith.science/pith/RXACAHFEZ4E77QGUSUSGRHTEMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXACAHFEZ4E77QGUSUSGRHTEMA/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-05T00:00:49Z","links":{"resolver":"https://pith.science/pith/RXACAHFEZ4E77QGUSUSGRHTEMA","bundle":"https://pith.science/pith/RXACAHFEZ4E77QGUSUSGRHTEMA/bundle.json","state":"https://pith.science/pith/RXACAHFEZ4E77QGUSUSGRHTEMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXACAHFEZ4E77QGUSUSGRHTEMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RXACAHFEZ4E77QGUSUSGRHTEMA","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":"5e8c56300331375f5f62a6a31c37831900cfe2bc14085d11894475d6b1c23a96","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-16T11:05:51Z","title_canon_sha256":"acdbfba09b9e0c81ae60a25093d68886977c4c78a08f9193a6b93cd624b95d7a"},"schema_version":"1.0","source":{"id":"2504.02833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.02833","created_at":"2026-07-05T10:44:03Z"},{"alias_kind":"arxiv_version","alias_value":"2504.02833v1","created_at":"2026-07-05T10:44:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.02833","created_at":"2026-07-05T10:44:03Z"},{"alias_kind":"pith_short_12","alias_value":"RXACAHFEZ4E7","created_at":"2026-07-05T10:44:03Z"},{"alias_kind":"pith_short_16","alias_value":"RXACAHFEZ4E77QGU","created_at":"2026-07-05T10:44:03Z"},{"alias_kind":"pith_short_8","alias_value":"RXACAHFE","created_at":"2026-07-05T10:44:03Z"}],"graph_snapshots":[{"event_id":"sha256:1a2f5a586d3bda5123f7159f63468bf96b7de0f5bb20ba014a07c48e5f7669a9","target":"graph","created_at":"2026-07-05T10:44:03Z","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/2504.02833/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In multi-objective optimization, minimizing the worst objective can be preferable to minimizing the average objective, as this ensures improved fairness across objectives. Due to the non-smooth nature of the resultant min-max optimization problem, classical subgradient-based approaches typically exhibit slow convergence. Motivated by primal-dual consensus techniques in multi-agent optimization and learning, we formulate a smooth variant of the min-max problem based on the augmented Lagrangian. The resultant Exact Pareto Optimization via Augmented Lagrangian (EPO-AL) algorithm scales better wit","authors_text":"Lajos Hanzo, Sangwoo Park, Stefan Vlaski","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-16T11:05:51Z","title":"Scalable Min-Max Optimization via Primal-Dual Exact Pareto Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.02833","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:23a042d27a1637973508453e5df663cfc22ed5d1b91872db5782cd16c750e10f","target":"record","created_at":"2026-07-05T10:44:03Z","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":"5e8c56300331375f5f62a6a31c37831900cfe2bc14085d11894475d6b1c23a96","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-16T11:05:51Z","title_canon_sha256":"acdbfba09b9e0c81ae60a25093d68886977c4c78a08f9193a6b93cd624b95d7a"},"schema_version":"1.0","source":{"id":"2504.02833","kind":"arxiv","version":1}},"canonical_sha256":"8dc0201ca4cf09ffc0d49524689e64602a44dc9ba8c6bed9c55f3a749b5f7c08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dc0201ca4cf09ffc0d49524689e64602a44dc9ba8c6bed9c55f3a749b5f7c08","first_computed_at":"2026-07-05T10:44:03.597461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:44:03.597461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"woPRtOiIsPRTH1psGiIxlZPOjrkTzorEMQu5efJd51lHO6MP9YWcKdBX4iYyDBqxqIM/kNx1WUqD2sBTHLmTCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:44:03.597903Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.02833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23a042d27a1637973508453e5df663cfc22ed5d1b91872db5782cd16c750e10f","sha256:1a2f5a586d3bda5123f7159f63468bf96b7de0f5bb20ba014a07c48e5f7669a9"],"state_sha256":"9cc5d303194322f015776bb9192ff24dfde1d0746aaccf7ef94b8d6b52333938"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8w6C+FfF+uNdYNQR0lDOfhDRAKyFgIVLuF3n9v9/6bxQERL/FgzZB3Hg/n/PAnBFHF/drNzjt0k8/tnuQrY7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T00:00:49.227299Z","bundle_sha256":"fa4e709c9e182dc9a4fd5fbb8f0f1a07fa9de952801e37e3bfd33d94eea9adf3"}}