{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NKKWL2YD3P7KQVHGDPFXBVTBEH","short_pith_number":"pith:NKKWL2YD","schema_version":"1.0","canonical_sha256":"6a9565eb03dbfea854e61bcb70d66121de63d8b7ebd3c4350c2d1a2e2f38958c","source":{"kind":"arxiv","id":"2402.05955","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.05955","created_at":"2026-07-05T07:43:15.917024+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.05955v1","created_at":"2026-07-05T07:43:15.917024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05955","created_at":"2026-07-05T07:43:15.917024+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKKWL2YD3P7K","created_at":"2026-07-05T07:43:15.917024+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKKWL2YD3P7KQVHG","created_at":"2026-07-05T07:43:15.917024+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKKWL2YD","created_at":"2026-07-05T07:43:15.917024+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH","json":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH.json","graph_json":"https://pith.science/api/pith-number/NKKWL2YD3P7KQVHGDPFXBVTBEH/graph.json","events_json":"https://pith.science/api/pith-number/NKKWL2YD3P7KQVHGDPFXBVTBEH/events.json","paper":"https://pith.science/paper/NKKWL2YD"},"agent_actions":{"view_html":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH","download_json":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH.json","view_paper":"https://pith.science/paper/NKKWL2YD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.05955&json=true","fetch_graph":"https://pith.science/api/pith-number/NKKWL2YD3P7KQVHGDPFXBVTBEH/graph.json","fetch_events":"https://pith.science/api/pith-number/NKKWL2YD3P7KQVHGDPFXBVTBEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH/action/storage_attestation","attest_author":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH/action/author_attestation","sign_citation":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH/action/citation_signature","submit_replication":"https://pith.science/pith/NKKWL2YD3P7KQVHGDPFXBVTBEH/action/replication_record"}},"created_at":"2026-07-05T07:43:15.917024+00:00","updated_at":"2026-07-05T07:43:15.917024+00:00"}