{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LCZ76F5UH4A4TK7FANG75HXQ3T","short_pith_number":"pith:LCZ76F5U","canonical_record":{"source":{"id":"2605.30452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T18:21:53Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"49c1636e762b25998ccdea9931637d3263bb3bf5e08a0b9382db37c943474597","abstract_canon_sha256":"fae18331db4a4473c4f2cad26ac0dad88b854cb094a0bec5e59bc78d6147713b"},"schema_version":"1.0"},"canonical_sha256":"58b3ff17b43f01c9abe5034dfe9ef0dcf79165e6976515a54cf919a5e35f6dd6","source":{"kind":"arxiv","id":"2605.30452","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30452","created_at":"2026-06-01T01:02:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30452v1","created_at":"2026-06-01T01:02:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30452","created_at":"2026-06-01T01:02:55Z"},{"alias_kind":"pith_short_12","alias_value":"LCZ76F5UH4A4","created_at":"2026-06-01T01:02:55Z"},{"alias_kind":"pith_short_16","alias_value":"LCZ76F5UH4A4TK7F","created_at":"2026-06-01T01:02:55Z"},{"alias_kind":"pith_short_8","alias_value":"LCZ76F5U","created_at":"2026-06-01T01:02:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LCZ76F5UH4A4TK7FANG75HXQ3T","target":"record","payload":{"canonical_record":{"source":{"id":"2605.30452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T18:21:53Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"49c1636e762b25998ccdea9931637d3263bb3bf5e08a0b9382db37c943474597","abstract_canon_sha256":"fae18331db4a4473c4f2cad26ac0dad88b854cb094a0bec5e59bc78d6147713b"},"schema_version":"1.0"},"canonical_sha256":"58b3ff17b43f01c9abe5034dfe9ef0dcf79165e6976515a54cf919a5e35f6dd6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:02:55.055145Z","signature_b64":"6dzVyEXKFNzy+lZT2vri99acT+6ky1+h9mGt4q0QPQ26ESIY9wOqvka+5b/uiFTQS910VPT55lpgHo/Po8sECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58b3ff17b43f01c9abe5034dfe9ef0dcf79165e6976515a54cf919a5e35f6dd6","last_reissued_at":"2026-06-01T01:02:55.054248Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:02:55.054248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.30452","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-06-01T01:02:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jLmowNhMiolbagj0voxEJ9ZXTUfuJtEeed6H4js7bkeNNr12lXZe54t1eAKAb7P6/ZTwMvPr1GXlrIuUQV17CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:37:54.078344Z"},"content_sha256":"0b57e3377d9cb9c1b8acf2d272cb3ab68e3a78f998dbfb68c0d4c807c723c85b","schema_version":"1.0","event_id":"sha256:0b57e3377d9cb9c1b8acf2d272cb3ab68e3a78f998dbfb68c0d4c807c723c85b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LCZ76F5UH4A4TK7FANG75HXQ3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified Framework for Gradient Aggregation in Multi-Objective Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Kelvin Ho, Yaoliang Yu, Zeou Hu","submitted_at":"2026-05-28T18:21:53Z","abstract_excerpt":"Many machine learning problems involve multiple inherent trade-offs that are best addressed by gradient-based multi-objective optimization (MOO) algorithms. Existing methods are often proposed with various motivations, analyzed case by case, and differ algorithmically in how the component gradients are aggregated at each step. In this work, we develop a unifying framework for gradient aggregation in MOO, establishing (optimal) rates of convergence to Pareto stationarity, the standard measure of performance in MOO. Central to our analysis is a sufficient alignment condition, from which we deriv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30452","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.30452/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-01T01:02:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2xv1VD4ch22IH9Qfa3znWCmEzYAncpK4RSm9yepPxkDJuiajDgk/L1psTALd+zbD9TyMrhl1+9oH5AyfopkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:37:54.078727Z"},"content_sha256":"99ea48c7d794209229e4bee242d0fe4fcae185c36798e76f7602af6d2f12ea6a","schema_version":"1.0","event_id":"sha256:99ea48c7d794209229e4bee242d0fe4fcae185c36798e76f7602af6d2f12ea6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCZ76F5UH4A4TK7FANG75HXQ3T/bundle.json","state_url":"https://pith.science/pith/LCZ76F5UH4A4TK7FANG75HXQ3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCZ76F5UH4A4TK7FANG75HXQ3T/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-12T09:37:54Z","links":{"resolver":"https://pith.science/pith/LCZ76F5UH4A4TK7FANG75HXQ3T","bundle":"https://pith.science/pith/LCZ76F5UH4A4TK7FANG75HXQ3T/bundle.json","state":"https://pith.science/pith/LCZ76F5UH4A4TK7FANG75HXQ3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCZ76F5UH4A4TK7FANG75HXQ3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LCZ76F5UH4A4TK7FANG75HXQ3T","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":"fae18331db4a4473c4f2cad26ac0dad88b854cb094a0bec5e59bc78d6147713b","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T18:21:53Z","title_canon_sha256":"49c1636e762b25998ccdea9931637d3263bb3bf5e08a0b9382db37c943474597"},"schema_version":"1.0","source":{"id":"2605.30452","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30452","created_at":"2026-06-01T01:02:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30452v1","created_at":"2026-06-01T01:02:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30452","created_at":"2026-06-01T01:02:55Z"},{"alias_kind":"pith_short_12","alias_value":"LCZ76F5UH4A4","created_at":"2026-06-01T01:02:55Z"},{"alias_kind":"pith_short_16","alias_value":"LCZ76F5UH4A4TK7F","created_at":"2026-06-01T01:02:55Z"},{"alias_kind":"pith_short_8","alias_value":"LCZ76F5U","created_at":"2026-06-01T01:02:55Z"}],"graph_snapshots":[{"event_id":"sha256:99ea48c7d794209229e4bee242d0fe4fcae185c36798e76f7602af6d2f12ea6a","target":"graph","created_at":"2026-06-01T01:02:55Z","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.30452/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many machine learning problems involve multiple inherent trade-offs that are best addressed by gradient-based multi-objective optimization (MOO) algorithms. Existing methods are often proposed with various motivations, analyzed case by case, and differ algorithmically in how the component gradients are aggregated at each step. In this work, we develop a unifying framework for gradient aggregation in MOO, establishing (optimal) rates of convergence to Pareto stationarity, the standard measure of performance in MOO. Central to our analysis is a sufficient alignment condition, from which we deriv","authors_text":"Kelvin Ho, Yaoliang Yu, Zeou Hu","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T18:21:53Z","title":"A Unified Framework for Gradient Aggregation in Multi-Objective Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30452","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:0b57e3377d9cb9c1b8acf2d272cb3ab68e3a78f998dbfb68c0d4c807c723c85b","target":"record","created_at":"2026-06-01T01:02:55Z","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":"fae18331db4a4473c4f2cad26ac0dad88b854cb094a0bec5e59bc78d6147713b","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T18:21:53Z","title_canon_sha256":"49c1636e762b25998ccdea9931637d3263bb3bf5e08a0b9382db37c943474597"},"schema_version":"1.0","source":{"id":"2605.30452","kind":"arxiv","version":1}},"canonical_sha256":"58b3ff17b43f01c9abe5034dfe9ef0dcf79165e6976515a54cf919a5e35f6dd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58b3ff17b43f01c9abe5034dfe9ef0dcf79165e6976515a54cf919a5e35f6dd6","first_computed_at":"2026-06-01T01:02:55.054248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:02:55.054248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6dzVyEXKFNzy+lZT2vri99acT+6ky1+h9mGt4q0QPQ26ESIY9wOqvka+5b/uiFTQS910VPT55lpgHo/Po8sECw==","signature_status":"signed_v1","signed_at":"2026-06-01T01:02:55.055145Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.30452","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b57e3377d9cb9c1b8acf2d272cb3ab68e3a78f998dbfb68c0d4c807c723c85b","sha256:99ea48c7d794209229e4bee242d0fe4fcae185c36798e76f7602af6d2f12ea6a"],"state_sha256":"efde09dc16a0c46b11c3094945f1c3f554c855356a01a2723df9f3cd46afe8f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xMku1rdSO84MJY+d7sgRJC8v1qafuxqpTn+BrUJpvD3Uqsmm1Y2koh3P5VZdhDr+fBRDwuGiwGLjWpuU/8bPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:37:54.080804Z","bundle_sha256":"8f3e832c454e7cd84277aa8aeef9723ce1c1b00c724afeb67f4bd7a636a3fff2"}}