{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:33WZ7LLRJDUGJU2OHDFO6C5GFB","short_pith_number":"pith:33WZ7LLR","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"},"canonical_sha256":"deed9fad7148e864d34e38caef0ba6285037c538f3c67a8398d6fbd1e658bfd0","source":{"kind":"arxiv","id":"1804.11020","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11020","created_at":"2026-05-18T00:15:54Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11020v2","created_at":"2026-05-18T00:15:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11020","created_at":"2026-05-18T00:15:54Z"},{"alias_kind":"pith_short_12","alias_value":"33WZ7LLRJDUG","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"33WZ7LLRJDUGJU2O","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"33WZ7LLR","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:33WZ7LLRJDUGJU2OHDFO6C5GFB","target":"record","payload":{"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"},"canonical_sha256":"deed9fad7148e864d34e38caef0ba6285037c538f3c67a8398d6fbd1e658bfd0","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"},"source_kind":"arxiv","source_id":"1804.11020","source_version":2,"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-05-18T00:15:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Yvkdo2bOPAt3pqbpNZ8rdq2H0F58lCTPkUG28Riw0gqncOsQbFYTUpjyswB5rvaVx0jtqaVJwVw4Fx2AOxRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:23:22.644110Z"},"content_sha256":"073edf18d9ed326c36d6f24e6f35705f5e30bdf7b6bcc5bdfcc71549eb43bc32","schema_version":"1.0","event_id":"sha256:073edf18d9ed326c36d6f24e6f35705f5e30bdf7b6bcc5bdfcc71549eb43bc32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:33WZ7LLRJDUGJU2OHDFO6C5GFB","target":"graph","payload":{"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"},"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-05-18T00:15:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6NWYyaT7Y30fdWcAHPD3ubbaj1eUtnZlFZtPcW+F481nmqwf8/Lk52q3vIPVNmUx9QUw0RIUm1jqme+LXSeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:23:22.644805Z"},"content_sha256":"0e4ca069a6db1324f5c7757f033aeff6bb382b4c4475391d3a4befd282400864","schema_version":"1.0","event_id":"sha256:0e4ca069a6db1324f5c7757f033aeff6bb382b4c4475391d3a4befd282400864"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB/bundle.json","state_url":"https://pith.science/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB/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-06-06T17:23:22Z","links":{"resolver":"https://pith.science/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB","bundle":"https://pith.science/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB/bundle.json","state":"https://pith.science/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33WZ7LLRJDUGJU2OHDFO6C5GFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:33WZ7LLRJDUGJU2OHDFO6C5GFB","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":"f3315f6510b5fa5a3476bf0d4925bae42b64a7144bcbbf806867b875202cb462","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-30T02:03:58Z","title_canon_sha256":"a1c36e99b7c4fc78b7d1bcceaa58e2ef1e9b4e34263af307d787891efbfa9d13"},"schema_version":"1.0","source":{"id":"1804.11020","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11020","created_at":"2026-05-18T00:15:54Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11020v2","created_at":"2026-05-18T00:15:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11020","created_at":"2026-05-18T00:15:54Z"},{"alias_kind":"pith_short_12","alias_value":"33WZ7LLRJDUG","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"33WZ7LLRJDUGJU2O","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"33WZ7LLR","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:0e4ca069a6db1324f5c7757f033aeff6bb382b4c4475391d3a4befd282400864","target":"graph","created_at":"2026-05-18T00:15:54Z","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"},"paper":{"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","authors_text":"Abdullah Al-Dujaili, S. Suresh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-30T02:03:58Z","title":"Revisiting Norm Optimization for Multi-Objective Black-Box Problems: A Finite-Time Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11020","kind":"arxiv","version":2},"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:073edf18d9ed326c36d6f24e6f35705f5e30bdf7b6bcc5bdfcc71549eb43bc32","target":"record","created_at":"2026-05-18T00:15:54Z","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":"f3315f6510b5fa5a3476bf0d4925bae42b64a7144bcbbf806867b875202cb462","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-30T02:03:58Z","title_canon_sha256":"a1c36e99b7c4fc78b7d1bcceaa58e2ef1e9b4e34263af307d787891efbfa9d13"},"schema_version":"1.0","source":{"id":"1804.11020","kind":"arxiv","version":2}},"canonical_sha256":"deed9fad7148e864d34e38caef0ba6285037c538f3c67a8398d6fbd1e658bfd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"deed9fad7148e864d34e38caef0ba6285037c538f3c67a8398d6fbd1e658bfd0","first_computed_at":"2026-05-18T00:15:54.408642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:54.408642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N54eowjDShyiXugCbyNgOaAzrGuzb9ZrxwPpV/1oHVm4+rhJ20ce2MtDNQWF7LMCRfclSp4jqe3yQ9V83FzyAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:54.409427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.11020","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:073edf18d9ed326c36d6f24e6f35705f5e30bdf7b6bcc5bdfcc71549eb43bc32","sha256:0e4ca069a6db1324f5c7757f033aeff6bb382b4c4475391d3a4befd282400864"],"state_sha256":"dbedc3eb70475090008f63a9deacdf66ee491db814fde0464eaaa55d2355fac7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9YmzZLYfkVfCHN6BsLlD7YzvoIxIhcm3AQWOu+a+WyfU3VJbb5TkmbgqIeEU1c/4j2LdfpMEgY2jpiwCCQAJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T17:23:22.648918Z","bundle_sha256":"0fcaaa5a0709d1329ee40b55b404a90c9909b407bb50d0855373877c66cefafc"}}