{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NKKWL2YD3P7KQVHGDPFXBVTBEH","short_pith_number":"pith:NKKWL2YD","canonical_record":{"source":{"id":"2402.05955","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-04T10:21:03Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"30667f5561346d7907fac0ff0d26fed8b60ee28670faf6f8cf895f32f2b752c5","abstract_canon_sha256":"f66df3db77455557c152ef963c4805ad14508fc48c94b42346be93c9199b6dc7"},"schema_version":"1.0"},"canonical_sha256":"6a9565eb03dbfea854e61bcb70d66121de63d8b7ebd3c4350c2d1a2e2f38958c","source":{"kind":"arxiv","id":"2402.05955","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.05955","created_at":"2026-07-05T07:43:15Z"},{"alias_kind":"arxiv_version","alias_value":"2402.05955v1","created_at":"2026-07-05T07:43:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05955","created_at":"2026-07-05T07:43:15Z"},{"alias_kind":"pith_short_12","alias_value":"NKKWL2YD3P7K","created_at":"2026-07-05T07:43:15Z"},{"alias_kind":"pith_short_16","alias_value":"NKKWL2YD3P7KQVHG","created_at":"2026-07-05T07:43:15Z"},{"alias_kind":"pith_short_8","alias_value":"NKKWL2YD","created_at":"2026-07-05T07:43:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NKKWL2YD3P7KQVHGDPFXBVTBEH","target":"record","payload":{"canonical_record":{"source":{"id":"2402.05955","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-04T10:21:03Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"30667f5561346d7907fac0ff0d26fed8b60ee28670faf6f8cf895f32f2b752c5","abstract_canon_sha256":"f66df3db77455557c152ef963c4805ad14508fc48c94b42346be93c9199b6dc7"},"schema_version":"1.0"},"canonical_sha256":"6a9565eb03dbfea854e61bcb70d66121de63d8b7ebd3c4350c2d1a2e2f38958c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:15.917463Z","signature_b64":"UCMswnq0J0TtqPj+RieslcJck4t2l8W+zHhlo8JmgfQeaGnUWrzgjGQa4SxpjduHqbZ6vCjwfNPdy9WN3639CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a9565eb03dbfea854e61bcb70d66121de63d8b7ebd3c4350c2d1a2e2f38958c","last_reissued_at":"2026-07-05T07:43:15.916957Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:15.916957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.05955","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-05T07:43:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yas2VoEZcarrxO2SsUZG1bWEmjgHoO2+QBLgparrvPXuNgq1WUxRXGwbSfbF7cS9LuYvgaJs/ctYcMJeDBmFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T17:12:04.781470Z"},"content_sha256":"b2116d9a0dc6bb7e6fda8be834b7c31a9cb6a4ccfe1c456672ae5013a58f06b0","schema_version":"1.0","event_id":"sha256:b2116d9a0dc6bb7e6fda8be834b7c31a9cb6a4ccfe1c456672ae5013a58f06b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NKKWL2YD3P7KQVHGDPFXBVTBEH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hyper-Transformer model for Controllable Pareto Front Learning with Split Feasibility Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Nguyen Viet Dung, Tran Anh Tuan, Tran Ngoc Thang","submitted_at":"2024-02-04T10:21:03Z","abstract_excerpt":"Controllable Pareto front learning (CPFL) approximates the Pareto solution set and then locates a Pareto optimal solution with respect to a given reference vector. However, decision-maker objectives were limited to a constraint region in practice, so instead of training on the entire decision space, we only trained on the constraint region. Controllable Pareto front learning with Split Feasibility Constraints (SFC) is a way to find the best Pareto solutions to a split multi-objective optimization problem that meets certain constraints. In the previous study, CPFL used a Hypernetwork model comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05955","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/2402.05955/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-05T07:43:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FnHrniZJ5Ya9UOd8cb2/7iaeQSE8LxAsfMNOyC9I6HZF8GnnBxr4Rh40ln/hfT8rKr1flqRjeF4YNiWMP970CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T17:12:04.781968Z"},"content_sha256":"501a853ece41dce9716512ea8236aef083b4f1d4cfe2f46fea16e701755005ec","schema_version":"1.0","event_id":"sha256:501a853ece41dce9716512ea8236aef083b4f1d4cfe2f46fea16e701755005ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH/bundle.json","state_url":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH/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-07-31T17:12:04Z","links":{"resolver":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH","bundle":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH/bundle.json","state":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NKKWL2YD3P7KQVHGDPFXBVTBEH","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":"f66df3db77455557c152ef963c4805ad14508fc48c94b42346be93c9199b6dc7","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-04T10:21:03Z","title_canon_sha256":"30667f5561346d7907fac0ff0d26fed8b60ee28670faf6f8cf895f32f2b752c5"},"schema_version":"1.0","source":{"id":"2402.05955","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.05955","created_at":"2026-07-05T07:43:15Z"},{"alias_kind":"arxiv_version","alias_value":"2402.05955v1","created_at":"2026-07-05T07:43:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05955","created_at":"2026-07-05T07:43:15Z"},{"alias_kind":"pith_short_12","alias_value":"NKKWL2YD3P7K","created_at":"2026-07-05T07:43:15Z"},{"alias_kind":"pith_short_16","alias_value":"NKKWL2YD3P7KQVHG","created_at":"2026-07-05T07:43:15Z"},{"alias_kind":"pith_short_8","alias_value":"NKKWL2YD","created_at":"2026-07-05T07:43:15Z"}],"graph_snapshots":[{"event_id":"sha256:501a853ece41dce9716512ea8236aef083b4f1d4cfe2f46fea16e701755005ec","target":"graph","created_at":"2026-07-05T07:43:15Z","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/2402.05955/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Controllable Pareto front learning (CPFL) approximates the Pareto solution set and then locates a Pareto optimal solution with respect to a given reference vector. However, decision-maker objectives were limited to a constraint region in practice, so instead of training on the entire decision space, we only trained on the constraint region. Controllable Pareto front learning with Split Feasibility Constraints (SFC) is a way to find the best Pareto solutions to a split multi-objective optimization problem that meets certain constraints. In the previous study, CPFL used a Hypernetwork model comp","authors_text":"Nguyen Viet Dung, Tran Anh Tuan, Tran Ngoc Thang","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-04T10:21:03Z","title":"A Hyper-Transformer model for Controllable Pareto Front Learning with Split Feasibility Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05955","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:b2116d9a0dc6bb7e6fda8be834b7c31a9cb6a4ccfe1c456672ae5013a58f06b0","target":"record","created_at":"2026-07-05T07:43:15Z","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":"f66df3db77455557c152ef963c4805ad14508fc48c94b42346be93c9199b6dc7","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-04T10:21:03Z","title_canon_sha256":"30667f5561346d7907fac0ff0d26fed8b60ee28670faf6f8cf895f32f2b752c5"},"schema_version":"1.0","source":{"id":"2402.05955","kind":"arxiv","version":1}},"canonical_sha256":"6a9565eb03dbfea854e61bcb70d66121de63d8b7ebd3c4350c2d1a2e2f38958c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a9565eb03dbfea854e61bcb70d66121de63d8b7ebd3c4350c2d1a2e2f38958c","first_computed_at":"2026-07-05T07:43:15.916957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:43:15.916957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UCMswnq0J0TtqPj+RieslcJck4t2l8W+zHhlo8JmgfQeaGnUWrzgjGQa4SxpjduHqbZ6vCjwfNPdy9WN3639CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:43:15.917463Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.05955","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2116d9a0dc6bb7e6fda8be834b7c31a9cb6a4ccfe1c456672ae5013a58f06b0","sha256:501a853ece41dce9716512ea8236aef083b4f1d4cfe2f46fea16e701755005ec"],"state_sha256":"6ab4953a84574c9a9fcf09787b1ef5810c94dee5fd447d1691c8a92170a541f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVEPgabGTQbSfaCG3dF/CIGbdgbIZEYSkGhaNgM3t8fBJ4AP2Zr9mQmnEUdcDc2hfhyI6lqshjj4nuyC9DrUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T17:12:04.787279Z","bundle_sha256":"f51fede450699ab9e1c548753679bedeee9eeacdb20b06cde5c7379292b471f7"}}