{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TIAI4T4MHMLJZRYHLUECXG7RV3","short_pith_number":"pith:TIAI4T4M","canonical_record":{"source":{"id":"2406.16232","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-23T22:06:25Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"6f8096ba2b1d92341f745d995ebf108698d57a8d8c6e145fa23926f520b77e2c","abstract_canon_sha256":"5865de3fd2a0ee3ee8ff603fd2965a286ca109292991799176e18b0d5ca9642f"},"schema_version":"1.0"},"canonical_sha256":"9a008e4f8c3b169cc7075d082b9bf1aef252f65e2b4b221c9a82d9b4f3ccea04","source":{"kind":"arxiv","id":"2406.16232","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.16232","created_at":"2026-07-05T10:08:18Z"},{"alias_kind":"arxiv_version","alias_value":"2406.16232v3","created_at":"2026-07-05T10:08:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16232","created_at":"2026-07-05T10:08:18Z"},{"alias_kind":"pith_short_12","alias_value":"TIAI4T4MHMLJ","created_at":"2026-07-05T10:08:18Z"},{"alias_kind":"pith_short_16","alias_value":"TIAI4T4MHMLJZRYH","created_at":"2026-07-05T10:08:18Z"},{"alias_kind":"pith_short_8","alias_value":"TIAI4T4M","created_at":"2026-07-05T10:08:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TIAI4T4MHMLJZRYHLUECXG7RV3","target":"record","payload":{"canonical_record":{"source":{"id":"2406.16232","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-23T22:06:25Z","cross_cats_sorted":["cs.AI","math.OC"],"title_canon_sha256":"6f8096ba2b1d92341f745d995ebf108698d57a8d8c6e145fa23926f520b77e2c","abstract_canon_sha256":"5865de3fd2a0ee3ee8ff603fd2965a286ca109292991799176e18b0d5ca9642f"},"schema_version":"1.0"},"canonical_sha256":"9a008e4f8c3b169cc7075d082b9bf1aef252f65e2b4b221c9a82d9b4f3ccea04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:18.691070Z","signature_b64":"SaoMcNulJ7U8XBJLUC3RcoAK6shNYERUnYnuoA1VumxtMMyqzxPkE+vX61DF1XIT0Jr7hlHLkl6bMtTl0RzCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a008e4f8c3b169cc7075d082b9bf1aef252f65e2b4b221c9a82d9b4f3ccea04","last_reissued_at":"2026-07-05T10:08:18.690621Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:18.690621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.16232","source_version":3,"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:08:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Wc09UbPIUt5Pcok36JYMqXtmgzKtoOKIvtfXnfwhHLFFPHWWnxIjJ3y2fUow6hsS7ydv3YxP0WezZ1L1h0VCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:29:42.837184Z"},"content_sha256":"82dfbc6007cc8c5a5cd3e9e01455db0ed568307ec8144b30e0057287331904c0","schema_version":"1.0","event_id":"sha256:82dfbc6007cc8c5a5cd3e9e01455db0ed568307ec8144b30e0057287331904c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TIAI4T4MHMLJZRYHLUECXG7RV3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Jacobian Descent for Multi-Objective Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.OC"],"primary_cat":"cs.LG","authors_text":"Pierre Quinton, Val\\'erian Rey","submitted_at":"2024-06-23T22:06:25Z","abstract_excerpt":"Many optimization problems require balancing multiple conflicting objectives. As gradient descent is limited to single-objective optimization, we introduce its direct generalization: Jacobian descent (JD). This algorithm iteratively updates parameters using the Jacobian matrix of a vector-valued objective function, in which each row is the gradient of an individual objective. While several methods to combine gradients already exist in the literature, they are generally hindered when the objectives conflict. In contrast, we propose projecting gradients to fully resolve conflict while ensuring t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16232","kind":"arxiv","version":3},"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/2406.16232/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:08:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hyDnP9Hd7x9uyzjLQqJVpPMhArJhR85TIKOjmGL08qZV0W678Hsx4/l4xkwnvCrwSyvtV4sEmLwuwLLKSFtMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:29:42.837726Z"},"content_sha256":"856422fc8c274060e82c3e1a8c6d2dac22cd63f09da95e2740eb2d6b26e7f465","schema_version":"1.0","event_id":"sha256:856422fc8c274060e82c3e1a8c6d2dac22cd63f09da95e2740eb2d6b26e7f465"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIAI4T4MHMLJZRYHLUECXG7RV3/bundle.json","state_url":"https://pith.science/pith/TIAI4T4MHMLJZRYHLUECXG7RV3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIAI4T4MHMLJZRYHLUECXG7RV3/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-04T21:29:42Z","links":{"resolver":"https://pith.science/pith/TIAI4T4MHMLJZRYHLUECXG7RV3","bundle":"https://pith.science/pith/TIAI4T4MHMLJZRYHLUECXG7RV3/bundle.json","state":"https://pith.science/pith/TIAI4T4MHMLJZRYHLUECXG7RV3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIAI4T4MHMLJZRYHLUECXG7RV3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TIAI4T4MHMLJZRYHLUECXG7RV3","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":"5865de3fd2a0ee3ee8ff603fd2965a286ca109292991799176e18b0d5ca9642f","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-23T22:06:25Z","title_canon_sha256":"6f8096ba2b1d92341f745d995ebf108698d57a8d8c6e145fa23926f520b77e2c"},"schema_version":"1.0","source":{"id":"2406.16232","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.16232","created_at":"2026-07-05T10:08:18Z"},{"alias_kind":"arxiv_version","alias_value":"2406.16232v3","created_at":"2026-07-05T10:08:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16232","created_at":"2026-07-05T10:08:18Z"},{"alias_kind":"pith_short_12","alias_value":"TIAI4T4MHMLJ","created_at":"2026-07-05T10:08:18Z"},{"alias_kind":"pith_short_16","alias_value":"TIAI4T4MHMLJZRYH","created_at":"2026-07-05T10:08:18Z"},{"alias_kind":"pith_short_8","alias_value":"TIAI4T4M","created_at":"2026-07-05T10:08:18Z"}],"graph_snapshots":[{"event_id":"sha256:856422fc8c274060e82c3e1a8c6d2dac22cd63f09da95e2740eb2d6b26e7f465","target":"graph","created_at":"2026-07-05T10:08:18Z","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/2406.16232/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many optimization problems require balancing multiple conflicting objectives. As gradient descent is limited to single-objective optimization, we introduce its direct generalization: Jacobian descent (JD). This algorithm iteratively updates parameters using the Jacobian matrix of a vector-valued objective function, in which each row is the gradient of an individual objective. While several methods to combine gradients already exist in the literature, they are generally hindered when the objectives conflict. In contrast, we propose projecting gradients to fully resolve conflict while ensuring t","authors_text":"Pierre Quinton, Val\\'erian Rey","cross_cats":["cs.AI","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-23T22:06:25Z","title":"Jacobian Descent for Multi-Objective Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16232","kind":"arxiv","version":3},"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:82dfbc6007cc8c5a5cd3e9e01455db0ed568307ec8144b30e0057287331904c0","target":"record","created_at":"2026-07-05T10:08:18Z","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":"5865de3fd2a0ee3ee8ff603fd2965a286ca109292991799176e18b0d5ca9642f","cross_cats_sorted":["cs.AI","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-23T22:06:25Z","title_canon_sha256":"6f8096ba2b1d92341f745d995ebf108698d57a8d8c6e145fa23926f520b77e2c"},"schema_version":"1.0","source":{"id":"2406.16232","kind":"arxiv","version":3}},"canonical_sha256":"9a008e4f8c3b169cc7075d082b9bf1aef252f65e2b4b221c9a82d9b4f3ccea04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a008e4f8c3b169cc7075d082b9bf1aef252f65e2b4b221c9a82d9b4f3ccea04","first_computed_at":"2026-07-05T10:08:18.690621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:18.690621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SaoMcNulJ7U8XBJLUC3RcoAK6shNYERUnYnuoA1VumxtMMyqzxPkE+vX61DF1XIT0Jr7hlHLkl6bMtTl0RzCDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:18.691070Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.16232","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82dfbc6007cc8c5a5cd3e9e01455db0ed568307ec8144b30e0057287331904c0","sha256:856422fc8c274060e82c3e1a8c6d2dac22cd63f09da95e2740eb2d6b26e7f465"],"state_sha256":"3c376184d5206cf437629d5e5393bd1034fbf1dde58d5f2535a15392a8a1abc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HpbSsivszkJxW1H5QybdJgDyBbdHmKRoDJr5fmwN6PLlfAs7IdRrSZUiYxxklR0uKuwxV7yKNd83qJw6090hBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T21:29:42.843207Z","bundle_sha256":"0ad474f176ab23d3c116ef67c235d4e99501c0d07a45a871cb230444f2785915"}}