{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:R2S7NCM4FSYVNVLO4YMP5GQFNU","short_pith_number":"pith:R2S7NCM4","canonical_record":{"source":{"id":"2110.03461","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-10-07T13:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"72a2b10c5b16b40e1e709b3f7897b54ae78065cf45e04949f9a5e77586e877ff","abstract_canon_sha256":"a303417a09330900c13ad0d2a94b11c2bc024337337b2da4ad8bc602527c71af"},"schema_version":"1.0"},"canonical_sha256":"8ea5f6899c2cb156d56ee618fe9a056d0deb18c92d02e02fa341df43ada473ad","source":{"kind":"arxiv","id":"2110.03461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.03461","created_at":"2026-07-05T03:20:43Z"},{"alias_kind":"arxiv_version","alias_value":"2110.03461v1","created_at":"2026-07-05T03:20:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.03461","created_at":"2026-07-05T03:20:43Z"},{"alias_kind":"pith_short_12","alias_value":"R2S7NCM4FSYV","created_at":"2026-07-05T03:20:43Z"},{"alias_kind":"pith_short_16","alias_value":"R2S7NCM4FSYVNVLO","created_at":"2026-07-05T03:20:43Z"},{"alias_kind":"pith_short_8","alias_value":"R2S7NCM4","created_at":"2026-07-05T03:20:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:R2S7NCM4FSYVNVLO4YMP5GQFNU","target":"record","payload":{"canonical_record":{"source":{"id":"2110.03461","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-10-07T13:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"72a2b10c5b16b40e1e709b3f7897b54ae78065cf45e04949f9a5e77586e877ff","abstract_canon_sha256":"a303417a09330900c13ad0d2a94b11c2bc024337337b2da4ad8bc602527c71af"},"schema_version":"1.0"},"canonical_sha256":"8ea5f6899c2cb156d56ee618fe9a056d0deb18c92d02e02fa341df43ada473ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:43.051490Z","signature_b64":"DbTmPdDyP3E/NfksDlhf50JmBe5d9vT+fzgS2HIqRw8L0G0hpR4CmFsQuOXeU8wnxwS6mtAd1XghySbAYmFOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ea5f6899c2cb156d56ee618fe9a056d0deb18c92d02e02fa341df43ada473ad","last_reissued_at":"2026-07-05T03:20:43.051096Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:43.051096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.03461","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-05T03:20:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jEKq8AWPi0Vo9u2hj5z4dtdilJL2+prO3wBqW7Tj+X8JS+/8KZfIYatUZlTbo331NYBVRVsdg8nmGDDa8Wc+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:13:58.621067Z"},"content_sha256":"33421ab8309ac13c9561dd1a22d93dadedfcbb0ff003fcdbf67a6621b3b87640","schema_version":"1.0","event_id":"sha256:33421ab8309ac13c9561dd1a22d93dadedfcbb0ff003fcdbf67a6621b3b87640"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:R2S7NCM4FSYVNVLO4YMP5GQFNU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-Evolutionary Optimization for Pareto Front Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jiho Jang, KiYoon Yoo, Nojun Kwak, Simyung Chang","submitted_at":"2021-10-07T13:38:57Z","abstract_excerpt":"Multi-task learning (MTL), which aims to improve performance by learning multiple tasks simultaneously, inherently presents an optimization challenge due to multiple objectives. Hence, multi-objective optimization (MOO) approaches have been proposed for multitasking problems. Recent MOO methods approximate multiple optimal solutions (Pareto front) with a single unified model, which is collectively referred to as Pareto front learning (PFL). In this paper, we show that PFL can be re-formulated into another MOO problem with multiple objectives, each of which corresponds to different preference w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.03461","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/2110.03461/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:20:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tvyGeQroDK36ZW+UU0FUH8WuyzvbD2XqpyEJMKXGUcIUZQ4b07zm8X1/OsLqD0EpDv/COgJ1qAZSvfnlRRrQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:13:58.622039Z"},"content_sha256":"95855ac1704372f1981c5d4b124f19eb6de18d81eaedb017c197ef0242ef3243","schema_version":"1.0","event_id":"sha256:95855ac1704372f1981c5d4b124f19eb6de18d81eaedb017c197ef0242ef3243"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2S7NCM4FSYVNVLO4YMP5GQFNU/bundle.json","state_url":"https://pith.science/pith/R2S7NCM4FSYVNVLO4YMP5GQFNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2S7NCM4FSYVNVLO4YMP5GQFNU/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-10T16:13:58Z","links":{"resolver":"https://pith.science/pith/R2S7NCM4FSYVNVLO4YMP5GQFNU","bundle":"https://pith.science/pith/R2S7NCM4FSYVNVLO4YMP5GQFNU/bundle.json","state":"https://pith.science/pith/R2S7NCM4FSYVNVLO4YMP5GQFNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2S7NCM4FSYVNVLO4YMP5GQFNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:R2S7NCM4FSYVNVLO4YMP5GQFNU","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":"a303417a09330900c13ad0d2a94b11c2bc024337337b2da4ad8bc602527c71af","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-10-07T13:38:57Z","title_canon_sha256":"72a2b10c5b16b40e1e709b3f7897b54ae78065cf45e04949f9a5e77586e877ff"},"schema_version":"1.0","source":{"id":"2110.03461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.03461","created_at":"2026-07-05T03:20:43Z"},{"alias_kind":"arxiv_version","alias_value":"2110.03461v1","created_at":"2026-07-05T03:20:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.03461","created_at":"2026-07-05T03:20:43Z"},{"alias_kind":"pith_short_12","alias_value":"R2S7NCM4FSYV","created_at":"2026-07-05T03:20:43Z"},{"alias_kind":"pith_short_16","alias_value":"R2S7NCM4FSYVNVLO","created_at":"2026-07-05T03:20:43Z"},{"alias_kind":"pith_short_8","alias_value":"R2S7NCM4","created_at":"2026-07-05T03:20:43Z"}],"graph_snapshots":[{"event_id":"sha256:95855ac1704372f1981c5d4b124f19eb6de18d81eaedb017c197ef0242ef3243","target":"graph","created_at":"2026-07-05T03:20:43Z","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/2110.03461/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-task learning (MTL), which aims to improve performance by learning multiple tasks simultaneously, inherently presents an optimization challenge due to multiple objectives. Hence, multi-objective optimization (MOO) approaches have been proposed for multitasking problems. Recent MOO methods approximate multiple optimal solutions (Pareto front) with a single unified model, which is collectively referred to as Pareto front learning (PFL). In this paper, we show that PFL can be re-formulated into another MOO problem with multiple objectives, each of which corresponds to different preference w","authors_text":"Jiho Jang, KiYoon Yoo, Nojun Kwak, Simyung Chang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-10-07T13:38:57Z","title":"Self-Evolutionary Optimization for Pareto Front Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.03461","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:33421ab8309ac13c9561dd1a22d93dadedfcbb0ff003fcdbf67a6621b3b87640","target":"record","created_at":"2026-07-05T03:20:43Z","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":"a303417a09330900c13ad0d2a94b11c2bc024337337b2da4ad8bc602527c71af","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-10-07T13:38:57Z","title_canon_sha256":"72a2b10c5b16b40e1e709b3f7897b54ae78065cf45e04949f9a5e77586e877ff"},"schema_version":"1.0","source":{"id":"2110.03461","kind":"arxiv","version":1}},"canonical_sha256":"8ea5f6899c2cb156d56ee618fe9a056d0deb18c92d02e02fa341df43ada473ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ea5f6899c2cb156d56ee618fe9a056d0deb18c92d02e02fa341df43ada473ad","first_computed_at":"2026-07-05T03:20:43.051096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:20:43.051096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DbTmPdDyP3E/NfksDlhf50JmBe5d9vT+fzgS2HIqRw8L0G0hpR4CmFsQuOXeU8wnxwS6mtAd1XghySbAYmFOAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:20:43.051490Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.03461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33421ab8309ac13c9561dd1a22d93dadedfcbb0ff003fcdbf67a6621b3b87640","sha256:95855ac1704372f1981c5d4b124f19eb6de18d81eaedb017c197ef0242ef3243"],"state_sha256":"038b0ae9e903f6faf20fd2237a1c2edd95435bcdd706758dca768a6ff71d6822"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vKDC9DmxbjRuAFJTO+Mtsei3qN7x6xLlGBgnno3JPWiBvmE5o13nJMSCy3sHC2qxCGQzYtjvE6L1GD5ROweHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T16:13:58.629301Z","bundle_sha256":"2dfe48079cc338aabdbc93c972dcae1239107385ac16f6bad10b8ec9e6534de6"}}