{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HPR3TZQ67XZWPJ6LF2FZS7HSLQ","short_pith_number":"pith:HPR3TZQ6","schema_version":"1.0","canonical_sha256":"3be3b9e61efdf367a7cb2e8b997cf25c0e92999316d68264eca0e5167a32d927","source":{"kind":"arxiv","id":"2402.19078","version":3},"attestation_state":"computed","paper":{"title":"Smooth Tchebycheff Scalarization for Multi-Objective Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE","math.OC"],"primary_cat":"cs.LG","authors_text":"Fei Liu, Qingfu Zhang, Xiaoyuan Zhang, Xi Lin, Zhenkun Wang, Zhiyuan Yang","submitted_at":"2024-02-29T12:03:05Z","abstract_excerpt":"Multi-objective optimization problems can be found in many real-world applications, where the objectives often conflict each other and cannot be optimized by a single solution. In the past few decades, numerous methods have been proposed to find Pareto solutions that represent optimal trade-offs among the objectives for a given problem. However, these existing methods could have high computational complexity or may not have good theoretical properties for solving a general differentiable multi-objective optimization problem. In this work, by leveraging the smooth optimization technique, we pro"},"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.19078","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-29T12:03:05Z","cross_cats_sorted":["cs.AI","cs.NE","math.OC"],"title_canon_sha256":"ff1c77c39d81ba1d50acd8ae143bf3677af821fd10b432d4966add927e6ea3a8","abstract_canon_sha256":"cb4925d042ef07f23199f50cf0e5e0c93cf470c9be919c08f0ee9a640eeb74f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:13.432875Z","signature_b64":"bvPimP7xzQcL3SVNDwHGLU1EJ8XTFF3/ZOXoi9PGhYwDU0D9UyCarKE4eCOArfBgxJTzpknvkJyWI6pn+ZWpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3be3b9e61efdf367a7cb2e8b997cf25c0e92999316d68264eca0e5167a32d927","last_reissued_at":"2026-07-05T08:47:13.432358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:13.432358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smooth Tchebycheff Scalarization for Multi-Objective Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE","math.OC"],"primary_cat":"cs.LG","authors_text":"Fei Liu, Qingfu Zhang, Xiaoyuan Zhang, Xi Lin, Zhenkun Wang, Zhiyuan Yang","submitted_at":"2024-02-29T12:03:05Z","abstract_excerpt":"Multi-objective optimization problems can be found in many real-world applications, where the objectives often conflict each other and cannot be optimized by a single solution. In the past few decades, numerous methods have been proposed to find Pareto solutions that represent optimal trade-offs among the objectives for a given problem. However, these existing methods could have high computational complexity or may not have good theoretical properties for solving a general differentiable multi-objective optimization problem. In this work, by leveraging the smooth optimization technique, we pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.19078","kind":"arxiv","version":3},"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.19078/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.19078","created_at":"2026-07-05T08:47:13.432424+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.19078v3","created_at":"2026-07-05T08:47:13.432424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.19078","created_at":"2026-07-05T08:47:13.432424+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPR3TZQ67XZW","created_at":"2026-07-05T08:47:13.432424+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPR3TZQ67XZWPJ6L","created_at":"2026-07-05T08:47:13.432424+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPR3TZQ6","created_at":"2026-07-05T08:47:13.432424+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03904","citing_title":"MAdam: Metric-Aware Multi-Objective Adam","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20619","citing_title":"SURF: Steering the Scalarization Weight to Uniformly Traverse the Pareto Front","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12771","citing_title":"Adaptive Smooth Tchebycheff Attention for Multi-Objective Policy Optimization","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HPR3TZQ67XZWPJ6LF2FZS7HSLQ","json":"https://pith.science/pith/HPR3TZQ67XZWPJ6LF2FZS7HSLQ.json","graph_json":"https://pith.science/api/pith-number/HPR3TZQ67XZWPJ6LF2FZS7HSLQ/graph.json","events_json":"https://pith.science/api/pith-number/HPR3TZQ67XZWPJ6LF2FZS7HSLQ/events.json","paper":"https://pith.science/paper/HPR3TZQ6"},"agent_actions":{"view_html":"https://pith.science/pith/HPR3TZQ67XZWPJ6LF2FZS7HSLQ","download_json":"https://pith.science/pith/HPR3TZQ67XZWPJ6LF2FZS7HSLQ.json","view_paper":"https://pith.science/paper/HPR3TZQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.19078&json=true","fetch_graph":"https://pith.science/api/pith-number/HPR3TZQ67XZWPJ6LF2FZS7HSLQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HPR3TZQ67XZWPJ6LF2FZS7HSLQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPR3TZQ67XZWPJ6LF2FZS7HSLQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPR3TZQ67XZWPJ6LF2FZS7HSLQ/action/storage_attestation","attest_author":"https://pith.science/pith/HPR3TZQ67XZWPJ6LF2FZS7HSLQ/action/author_attestation","sign_citation":"https://pith.science/pith/HPR3TZQ67XZWPJ6LF2FZS7HSLQ/action/citation_signature","submit_replication":"https://pith.science/pith/HPR3TZQ67XZWPJ6LF2FZS7HSLQ/action/replication_record"}},"created_at":"2026-07-05T08:47:13.432424+00:00","updated_at":"2026-07-05T08:47:13.432424+00:00"}