{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:NTCJEAWVTAFWAU3GBKI5IBLYOB","short_pith_number":"pith:NTCJEAWV","canonical_record":{"source":{"id":"2010.04104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-08T16:39:20Z","cross_cats_sorted":[],"title_canon_sha256":"4117d9ab37217a22d07675340078147aec507cfe3692acc07d6f34b73ee0628b","abstract_canon_sha256":"52c24d99fec29d81c2f12c2971f7d0a981dd7fca8173f388a2ec7f8ba5536f7e"},"schema_version":"1.0"},"canonical_sha256":"6cc49202d5980b6053660a91d40578705c6cde7d262f02d0f8d0381666d6b68a","source":{"kind":"arxiv","id":"2010.04104","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.04104","created_at":"2026-07-05T02:34:42Z"},{"alias_kind":"arxiv_version","alias_value":"2010.04104v2","created_at":"2026-07-05T02:34:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.04104","created_at":"2026-07-05T02:34:42Z"},{"alias_kind":"pith_short_12","alias_value":"NTCJEAWVTAFW","created_at":"2026-07-05T02:34:42Z"},{"alias_kind":"pith_short_16","alias_value":"NTCJEAWVTAFWAU3G","created_at":"2026-07-05T02:34:42Z"},{"alias_kind":"pith_short_8","alias_value":"NTCJEAWV","created_at":"2026-07-05T02:34:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:NTCJEAWVTAFWAU3GBKI5IBLYOB","target":"record","payload":{"canonical_record":{"source":{"id":"2010.04104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-08T16:39:20Z","cross_cats_sorted":[],"title_canon_sha256":"4117d9ab37217a22d07675340078147aec507cfe3692acc07d6f34b73ee0628b","abstract_canon_sha256":"52c24d99fec29d81c2f12c2971f7d0a981dd7fca8173f388a2ec7f8ba5536f7e"},"schema_version":"1.0"},"canonical_sha256":"6cc49202d5980b6053660a91d40578705c6cde7d262f02d0f8d0381666d6b68a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:42.519142Z","signature_b64":"r5JMaqz/JdwopAS0JS+rG7s0ILe6v71/rsPPFbzPUEU2NRIRgZjdgD5fAHyig/WpE22IJ/aRHZNTCqfveaaFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cc49202d5980b6053660a91d40578705c6cde7d262f02d0f8d0381666d6b68a","last_reissued_at":"2026-07-05T02:34:42.518663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:42.518663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.04104","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-07-05T02:34:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkgjMin50SKltbhk23qmrLI8OpoU15wYh0XirIQOs6tnFX+O7xXENIrIJ6JK4y/kKKOx6v0j/ZBkYz67u4NTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T08:04:14.639330Z"},"content_sha256":"f3cd4b2a2d18d17b5482bfe38075d69d84c8ff55ffa5e6a5c2c17717aba17f33","schema_version":"1.0","event_id":"sha256:f3cd4b2a2d18d17b5482bfe38075d69d84c8ff55ffa5e6a5c2c17717aba17f33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:NTCJEAWVTAFWAU3GBKI5IBLYOB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning the Pareto Front with Hypernetworks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aviv Navon, Aviv Shamsian, Ethan Fetaya, Gal Chechik","submitted_at":"2020-10-08T16:39:20Z","abstract_excerpt":"Multi-objective optimization (MOO) problems are prevalent in machine learning. These problems have a set of optimal solutions, called the Pareto front, where each point on the front represents a different trade-off between possibly conflicting objectives. Recent MOO methods can target a specific desired ray in loss space however, most approaches still face two grave limitations: (i) A separate model has to be trained for each point on the front; and (ii) The exact trade-off must be known before the optimization process. Here, we tackle the problem of learning the entire Pareto front, with the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.04104","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/2010.04104/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-05T02:34:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r7IyAuRGexRxZeIXkxAeL7n479UDI5vj+N1gBnJjItMNx2Fh9kL/qoLM+wXg2vpm6wnGn7pSCeIao+N+kEZXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T08:04:14.640190Z"},"content_sha256":"a05153bcf2e5853b4f621c7010081a6ce1160820e035a720ad1333aecc7603ad","schema_version":"1.0","event_id":"sha256:a05153bcf2e5853b4f621c7010081a6ce1160820e035a720ad1333aecc7603ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB/bundle.json","state_url":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB/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-12T08:04:14Z","links":{"resolver":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB","bundle":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB/bundle.json","state":"https://pith.science/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTCJEAWVTAFWAU3GBKI5IBLYOB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NTCJEAWVTAFWAU3GBKI5IBLYOB","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":"52c24d99fec29d81c2f12c2971f7d0a981dd7fca8173f388a2ec7f8ba5536f7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-08T16:39:20Z","title_canon_sha256":"4117d9ab37217a22d07675340078147aec507cfe3692acc07d6f34b73ee0628b"},"schema_version":"1.0","source":{"id":"2010.04104","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.04104","created_at":"2026-07-05T02:34:42Z"},{"alias_kind":"arxiv_version","alias_value":"2010.04104v2","created_at":"2026-07-05T02:34:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.04104","created_at":"2026-07-05T02:34:42Z"},{"alias_kind":"pith_short_12","alias_value":"NTCJEAWVTAFW","created_at":"2026-07-05T02:34:42Z"},{"alias_kind":"pith_short_16","alias_value":"NTCJEAWVTAFWAU3G","created_at":"2026-07-05T02:34:42Z"},{"alias_kind":"pith_short_8","alias_value":"NTCJEAWV","created_at":"2026-07-05T02:34:42Z"}],"graph_snapshots":[{"event_id":"sha256:a05153bcf2e5853b4f621c7010081a6ce1160820e035a720ad1333aecc7603ad","target":"graph","created_at":"2026-07-05T02:34:42Z","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/2010.04104/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-objective optimization (MOO) problems are prevalent in machine learning. These problems have a set of optimal solutions, called the Pareto front, where each point on the front represents a different trade-off between possibly conflicting objectives. Recent MOO methods can target a specific desired ray in loss space however, most approaches still face two grave limitations: (i) A separate model has to be trained for each point on the front; and (ii) The exact trade-off must be known before the optimization process. Here, we tackle the problem of learning the entire Pareto front, with the ","authors_text":"Aviv Navon, Aviv Shamsian, Ethan Fetaya, Gal Chechik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-08T16:39:20Z","title":"Learning the Pareto Front with Hypernetworks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.04104","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:f3cd4b2a2d18d17b5482bfe38075d69d84c8ff55ffa5e6a5c2c17717aba17f33","target":"record","created_at":"2026-07-05T02:34:42Z","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":"52c24d99fec29d81c2f12c2971f7d0a981dd7fca8173f388a2ec7f8ba5536f7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-08T16:39:20Z","title_canon_sha256":"4117d9ab37217a22d07675340078147aec507cfe3692acc07d6f34b73ee0628b"},"schema_version":"1.0","source":{"id":"2010.04104","kind":"arxiv","version":2}},"canonical_sha256":"6cc49202d5980b6053660a91d40578705c6cde7d262f02d0f8d0381666d6b68a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cc49202d5980b6053660a91d40578705c6cde7d262f02d0f8d0381666d6b68a","first_computed_at":"2026-07-05T02:34:42.518663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:34:42.518663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r5JMaqz/JdwopAS0JS+rG7s0ILe6v71/rsPPFbzPUEU2NRIRgZjdgD5fAHyig/WpE22IJ/aRHZNTCqfveaaFBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:34:42.519142Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.04104","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3cd4b2a2d18d17b5482bfe38075d69d84c8ff55ffa5e6a5c2c17717aba17f33","sha256:a05153bcf2e5853b4f621c7010081a6ce1160820e035a720ad1333aecc7603ad"],"state_sha256":"02f994468dacc6218066c2dacff740c6981635ea03aa6afacdba2eb8a3d31cde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HWvQ8yf4SmFBUNwU+A1k8FT+yBnXk6DnL3CkJjnd62Z5oDSEj8cG2HF/B21xCwFfPzWV/9zJjeun/xqcOZUyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T08:04:14.648687Z","bundle_sha256":"7a59e1e93c03fba65c42113fc1574507b391c4777ac45bc6ed253b58597799fe"}}