{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:5MU7RXHH4C32FAEK6M6EP7ACAK","short_pith_number":"pith:5MU7RXHH","canonical_record":{"source":{"id":"2102.04523","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-08T20:41:21Z","cross_cats_sorted":[],"title_canon_sha256":"e4e2399a0643c780e8e6b657a81d1de93bd0a12cdd6e83751e8aa665d5769c27","abstract_canon_sha256":"312c0d5bb25672ddc4c0cb47ad9dd9f24b3c1d40433b4f12d0bafd0c1319032f"},"schema_version":"1.0"},"canonical_sha256":"eb29f8dce7e0b7a2808af33c47fc02029a75202989d1f4e17959aff4cf50991b","source":{"kind":"arxiv","id":"2102.04523","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.04523","created_at":"2026-07-05T03:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"2102.04523v2","created_at":"2026-07-05T03:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.04523","created_at":"2026-07-05T03:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"5MU7RXHH4C32","created_at":"2026-07-05T03:23:38Z"},{"alias_kind":"pith_short_16","alias_value":"5MU7RXHH4C32FAEK","created_at":"2026-07-05T03:23:38Z"},{"alias_kind":"pith_short_8","alias_value":"5MU7RXHH","created_at":"2026-07-05T03:23:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:5MU7RXHH4C32FAEK6M6EP7ACAK","target":"record","payload":{"canonical_record":{"source":{"id":"2102.04523","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-08T20:41:21Z","cross_cats_sorted":[],"title_canon_sha256":"e4e2399a0643c780e8e6b657a81d1de93bd0a12cdd6e83751e8aa665d5769c27","abstract_canon_sha256":"312c0d5bb25672ddc4c0cb47ad9dd9f24b3c1d40433b4f12d0bafd0c1319032f"},"schema_version":"1.0"},"canonical_sha256":"eb29f8dce7e0b7a2808af33c47fc02029a75202989d1f4e17959aff4cf50991b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:38.763755Z","signature_b64":"uw1i0C/qkyDl973EPhUrvKB3aBhhh5ZrALivHIpidvkE4lcG1ZEPVVld6uNlSKTYj5Ap5wbKJd15IZvvyGDmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb29f8dce7e0b7a2808af33c47fc02029a75202989d1f4e17959aff4cf50991b","last_reissued_at":"2026-07-05T03:23:38.763280Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:38.763280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.04523","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-05T03:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4jr0url0lAL/YhBzQ1cw4gg5oM6YrwcQxLEuHD8rqy9flkQBSj/Jq2pRWR3RRcHdSV6y7C3fz1s8JUo6DkkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:29:25.688365Z"},"content_sha256":"6bfd12144bb664ff78e5943893481c11516dabcfb32342363cb46a62354ee909","schema_version":"1.0","event_id":"sha256:6bfd12144bb664ff78e5943893481c11516dabcfb32342363cb46a62354ee909"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:5MU7RXHH4C32FAEK6M6EP7ACAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Objective Learning to Predict Pareto Fronts Using Hypervolume Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Frank J.W.M. Dankers, Monika Grewal, Peter A.N. Bosman, Tanja Alderliesten, Timo M. Deist","submitted_at":"2021-02-08T20:41:21Z","abstract_excerpt":"Real-world problems are often multi-objective with decision-makers unable to specify a priori which trade-off between the conflicting objectives is preferable. Intuitively, building machine learning solutions in such cases would entail providing multiple predictions that span and uniformly cover the Pareto front of all optimal trade-off solutions. We propose a novel approach for multi-objective training of neural networks to approximate the Pareto front during inference. In our approach, the neural networks are trained multi-objectively using a dynamic loss function, wherein each network's los"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.04523","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/2102.04523/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-05T03:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8m6C67vVply6qZcbLVlWKXl3Fqpa+z0xtV5lizM4aKQ5f0l0LF/qEBG3pXmyvIAmsew1wDx1oXexOmwZU/NsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:29:25.688915Z"},"content_sha256":"c2ca5de29076f011d63d7ec4615e0f3a8c4c9c7eb782ae2c759acd1b423bfcb7","schema_version":"1.0","event_id":"sha256:c2ca5de29076f011d63d7ec4615e0f3a8c4c9c7eb782ae2c759acd1b423bfcb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MU7RXHH4C32FAEK6M6EP7ACAK/bundle.json","state_url":"https://pith.science/pith/5MU7RXHH4C32FAEK6M6EP7ACAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MU7RXHH4C32FAEK6M6EP7ACAK/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-10T08:29:25Z","links":{"resolver":"https://pith.science/pith/5MU7RXHH4C32FAEK6M6EP7ACAK","bundle":"https://pith.science/pith/5MU7RXHH4C32FAEK6M6EP7ACAK/bundle.json","state":"https://pith.science/pith/5MU7RXHH4C32FAEK6M6EP7ACAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MU7RXHH4C32FAEK6M6EP7ACAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:5MU7RXHH4C32FAEK6M6EP7ACAK","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":"312c0d5bb25672ddc4c0cb47ad9dd9f24b3c1d40433b4f12d0bafd0c1319032f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-08T20:41:21Z","title_canon_sha256":"e4e2399a0643c780e8e6b657a81d1de93bd0a12cdd6e83751e8aa665d5769c27"},"schema_version":"1.0","source":{"id":"2102.04523","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.04523","created_at":"2026-07-05T03:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"2102.04523v2","created_at":"2026-07-05T03:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.04523","created_at":"2026-07-05T03:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"5MU7RXHH4C32","created_at":"2026-07-05T03:23:38Z"},{"alias_kind":"pith_short_16","alias_value":"5MU7RXHH4C32FAEK","created_at":"2026-07-05T03:23:38Z"},{"alias_kind":"pith_short_8","alias_value":"5MU7RXHH","created_at":"2026-07-05T03:23:38Z"}],"graph_snapshots":[{"event_id":"sha256:c2ca5de29076f011d63d7ec4615e0f3a8c4c9c7eb782ae2c759acd1b423bfcb7","target":"graph","created_at":"2026-07-05T03:23:38Z","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/2102.04523/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Real-world problems are often multi-objective with decision-makers unable to specify a priori which trade-off between the conflicting objectives is preferable. Intuitively, building machine learning solutions in such cases would entail providing multiple predictions that span and uniformly cover the Pareto front of all optimal trade-off solutions. We propose a novel approach for multi-objective training of neural networks to approximate the Pareto front during inference. In our approach, the neural networks are trained multi-objectively using a dynamic loss function, wherein each network's los","authors_text":"Frank J.W.M. Dankers, Monika Grewal, Peter A.N. Bosman, Tanja Alderliesten, Timo M. Deist","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-08T20:41:21Z","title":"Multi-Objective Learning to Predict Pareto Fronts Using Hypervolume Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.04523","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:6bfd12144bb664ff78e5943893481c11516dabcfb32342363cb46a62354ee909","target":"record","created_at":"2026-07-05T03:23:38Z","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":"312c0d5bb25672ddc4c0cb47ad9dd9f24b3c1d40433b4f12d0bafd0c1319032f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-08T20:41:21Z","title_canon_sha256":"e4e2399a0643c780e8e6b657a81d1de93bd0a12cdd6e83751e8aa665d5769c27"},"schema_version":"1.0","source":{"id":"2102.04523","kind":"arxiv","version":2}},"canonical_sha256":"eb29f8dce7e0b7a2808af33c47fc02029a75202989d1f4e17959aff4cf50991b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb29f8dce7e0b7a2808af33c47fc02029a75202989d1f4e17959aff4cf50991b","first_computed_at":"2026-07-05T03:23:38.763280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:23:38.763280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uw1i0C/qkyDl973EPhUrvKB3aBhhh5ZrALivHIpidvkE4lcG1ZEPVVld6uNlSKTYj5Ap5wbKJd15IZvvyGDmBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:23:38.763755Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.04523","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bfd12144bb664ff78e5943893481c11516dabcfb32342363cb46a62354ee909","sha256:c2ca5de29076f011d63d7ec4615e0f3a8c4c9c7eb782ae2c759acd1b423bfcb7"],"state_sha256":"5654e8095527b1b3bd080978acd88b4901483275bef0aebd54da784ad5ea265a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qTJQCVqPic8Xkgly6pWOOE0r5DyY3HgE0gNdX9OYoS1QFm6/VDAq071oNF1dKfL7vIP9o3wEWykEbeZBBA6zCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T08:29:25.693009Z","bundle_sha256":"3da91a3fc8098230b39f5d13b6231459056ba4c0e9683cb946bb99ab8b74137c"}}