{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:33WZ7LLRJDUGJU2OHDFO6C5GFB","short_pith_number":"pith:33WZ7LLR","schema_version":"1.0","canonical_sha256":"deed9fad7148e864d34e38caef0ba6285037c538f3c67a8398d6fbd1e658bfd0","source":{"kind":"arxiv","id":"1804.11020","version":2},"attestation_state":"computed","paper":{"title":"Revisiting Norm Optimization for Multi-Objective Black-Box Problems: A Finite-Time Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abdullah Al-Dujaili, S. Suresh","submitted_at":"2018-04-30T02:03:58Z","abstract_excerpt":"The complexity of Pareto fronts imposes a great challenge on the convergence analysis of multi-objective optimization methods. While most theoretical convergence studies have addressed finite-set and/or discrete problems, others have provided probabilistic guarantees, assumed a total order on the solutions, or studied their asymptotic behaviour. In this paper, we revisit the Tchebycheff weighted method in a hierarchical bandits setting and provide a finite-time bound on the Pareto-compliant additive $\\epsilon$-indicator. To the best of our knowledge, this paper is one of few that establish a l"},"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":"1804.11020","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-30T02:03:58Z","cross_cats_sorted":[],"title_canon_sha256":"a1c36e99b7c4fc78b7d1bcceaa58e2ef1e9b4e34263af307d787891efbfa9d13","abstract_canon_sha256":"f3315f6510b5fa5a3476bf0d4925bae42b64a7144bcbbf806867b875202cb462"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:54.409427Z","signature_b64":"N54eowjDShyiXugCbyNgOaAzrGuzb9ZrxwPpV/1oHVm4+rhJ20ce2MtDNQWF7LMCRfclSp4jqe3yQ9V83FzyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deed9fad7148e864d34e38caef0ba6285037c538f3c67a8398d6fbd1e658bfd0","last_reissued_at":"2026-05-18T00:15:54.408642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:54.408642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Norm Optimization for Multi-Objective Black-Box Problems: A Finite-Time Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abdullah Al-Dujaili, S. Suresh","submitted_at":"2018-04-30T02:03:58Z","abstract_excerpt":"The complexity of Pareto fronts imposes a great challenge on the convergence analysis of multi-objective optimization methods. While most theoretical convergence studies have addressed finite-set and/or discrete problems, others have provided probabilistic guarantees, assumed a total order on the solutions, or studied their asymptotic behaviour. In this paper, we revisit the Tchebycheff weighted method in a hierarchical bandits setting and provide a finite-time bound on the Pareto-compliant additive $\\epsilon$-indicator. To the best of our knowledge, this paper is one of few that establish a l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11020","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":""},"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":"1804.11020","created_at":"2026-05-18T00:15:54.408769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.11020v2","created_at":"2026-05-18T00:15:54.408769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11020","created_at":"2026-05-18T00:15:54.408769+00:00"},{"alias_kind":"pith_short_12","alias_value":"33WZ7LLRJDUG","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"33WZ7LLRJDUGJU2O","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"33WZ7LLR","created_at":"2026-05-18T12:32:02.567920+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/33WZ7LLRJDUGJU2OHDFO6C5GFB","json":"https://pith.science/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB.json","graph_json":"https://pith.science/api/pith-number/33WZ7LLRJDUGJU2OHDFO6C5GFB/graph.json","events_json":"https://pith.science/api/pith-number/33WZ7LLRJDUGJU2OHDFO6C5GFB/events.json","paper":"https://pith.science/paper/33WZ7LLR"},"agent_actions":{"view_html":"https://pith.science/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB","download_json":"https://pith.science/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB.json","view_paper":"https://pith.science/paper/33WZ7LLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.11020&json=true","fetch_graph":"https://pith.science/api/pith-number/33WZ7LLRJDUGJU2OHDFO6C5GFB/graph.json","fetch_events":"https://pith.science/api/pith-number/33WZ7LLRJDUGJU2OHDFO6C5GFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB/action/storage_attestation","attest_author":"https://pith.science/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB/action/author_attestation","sign_citation":"https://pith.science/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB/action/citation_signature","submit_replication":"https://pith.science/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB/action/replication_record"}},"created_at":"2026-05-18T00:15:54.408769+00:00","updated_at":"2026-05-18T00:15:54.408769+00:00"}