{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:YUCRX5Z5JMHDJLO4RM4UQEOS32","short_pith_number":"pith:YUCRX5Z5","canonical_record":{"source":{"id":"2410.16052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-21T14:28:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c15a56f41ee14f4c7950fb623c0e3d52637cd5b2998504b1abfc7e3570dc0f99","abstract_canon_sha256":"541d4b2731e94d60ecc5893a3e493b211f242cc149528bcd453a94857052b38a"},"schema_version":"1.0"},"canonical_sha256":"c5051bf73d4b0e34addc8b394811d2de86363cb3292788675b999493d09c4d43","source":{"kind":"arxiv","id":"2410.16052","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.16052","created_at":"2026-07-05T09:23:28Z"},{"alias_kind":"arxiv_version","alias_value":"2410.16052v1","created_at":"2026-07-05T09:23:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16052","created_at":"2026-07-05T09:23:28Z"},{"alias_kind":"pith_short_12","alias_value":"YUCRX5Z5JMHD","created_at":"2026-07-05T09:23:28Z"},{"alias_kind":"pith_short_16","alias_value":"YUCRX5Z5JMHDJLO4","created_at":"2026-07-05T09:23:28Z"},{"alias_kind":"pith_short_8","alias_value":"YUCRX5Z5","created_at":"2026-07-05T09:23:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:YUCRX5Z5JMHDJLO4RM4UQEOS32","target":"record","payload":{"canonical_record":{"source":{"id":"2410.16052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-21T14:28:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c15a56f41ee14f4c7950fb623c0e3d52637cd5b2998504b1abfc7e3570dc0f99","abstract_canon_sha256":"541d4b2731e94d60ecc5893a3e493b211f242cc149528bcd453a94857052b38a"},"schema_version":"1.0"},"canonical_sha256":"c5051bf73d4b0e34addc8b394811d2de86363cb3292788675b999493d09c4d43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:28.580536Z","signature_b64":"pXZlWVw3izWI7jlDl7thRIv4D3Tw5734LmgF4f9tVyQpIA2Z3+/Z/2iVlNubtLYHdj8ohfVjT9HMGTFkQfQnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5051bf73d4b0e34addc8b394811d2de86363cb3292788675b999493d09c4d43","last_reissued_at":"2026-07-05T09:23:28.580069Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:28.580069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.16052","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-05T09:23:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvfwe3OXUbxtQRfQsdiBRfzDnzH8yq8D+o2mhI6Aigk5Wpjzb/f0n5dzhboWLsYOJS6RRvc482xVX1Ht98QiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:02:40.221034Z"},"content_sha256":"7170aef19486e8702b64df333b8d19db848333a115528e8cdbd81c3d138caf61","schema_version":"1.0","event_id":"sha256:7170aef19486e8702b64df333b8d19db848333a115528e8cdbd81c3d138caf61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:YUCRX5Z5JMHDJLO4RM4UQEOS32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Algorithm for Non-Stationary Kernelized Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Shion Takeno, Shogo Iwazaki","submitted_at":"2024-10-21T14:28:26Z","abstract_excerpt":"This paper studies a non-stationary kernelized bandit (KB) problem, also called time-varying Bayesian optimization, where one seeks to minimize the regret under an unknown reward function that varies over time. In particular, we focus on a near-optimal algorithm whose regret upper bound matches the regret lower bound. For this goal, we show the first algorithm-independent regret lower bound for non-stationary KB with squared exponential and Mat\\'ern kernels, which reveals that an existing optimization-based KB algorithm with slight modification is near-optimal. However, this existing algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16052","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/2410.16052/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-05T09:23:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d1jfG3Jhr8F28FwDplq3saeN5plFhwDFjtSzqQbCGXYg5eHe22RuhkzHSeuR6NvspEyqQf12jPNTW71+Kd0VCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:02:40.221538Z"},"content_sha256":"f337142576c2d0d779272ffbb335fde2362f33c7df7e5e5e6d4212ab9ee99d7c","schema_version":"1.0","event_id":"sha256:f337142576c2d0d779272ffbb335fde2362f33c7df7e5e5e6d4212ab9ee99d7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32/bundle.json","state_url":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32/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-08-10T14:02:40Z","links":{"resolver":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32","bundle":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32/bundle.json","state":"https://pith.science/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YUCRX5Z5JMHDJLO4RM4UQEOS32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:YUCRX5Z5JMHDJLO4RM4UQEOS32","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":"541d4b2731e94d60ecc5893a3e493b211f242cc149528bcd453a94857052b38a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-21T14:28:26Z","title_canon_sha256":"c15a56f41ee14f4c7950fb623c0e3d52637cd5b2998504b1abfc7e3570dc0f99"},"schema_version":"1.0","source":{"id":"2410.16052","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.16052","created_at":"2026-07-05T09:23:28Z"},{"alias_kind":"arxiv_version","alias_value":"2410.16052v1","created_at":"2026-07-05T09:23:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16052","created_at":"2026-07-05T09:23:28Z"},{"alias_kind":"pith_short_12","alias_value":"YUCRX5Z5JMHD","created_at":"2026-07-05T09:23:28Z"},{"alias_kind":"pith_short_16","alias_value":"YUCRX5Z5JMHDJLO4","created_at":"2026-07-05T09:23:28Z"},{"alias_kind":"pith_short_8","alias_value":"YUCRX5Z5","created_at":"2026-07-05T09:23:28Z"}],"graph_snapshots":[{"event_id":"sha256:f337142576c2d0d779272ffbb335fde2362f33c7df7e5e5e6d4212ab9ee99d7c","target":"graph","created_at":"2026-07-05T09:23:28Z","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/2410.16052/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies a non-stationary kernelized bandit (KB) problem, also called time-varying Bayesian optimization, where one seeks to minimize the regret under an unknown reward function that varies over time. In particular, we focus on a near-optimal algorithm whose regret upper bound matches the regret lower bound. For this goal, we show the first algorithm-independent regret lower bound for non-stationary KB with squared exponential and Mat\\'ern kernels, which reveals that an existing optimization-based KB algorithm with slight modification is near-optimal. However, this existing algorithm","authors_text":"Shion Takeno, Shogo Iwazaki","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-21T14:28:26Z","title":"Near-Optimal Algorithm for Non-Stationary Kernelized Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16052","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:7170aef19486e8702b64df333b8d19db848333a115528e8cdbd81c3d138caf61","target":"record","created_at":"2026-07-05T09:23:28Z","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":"541d4b2731e94d60ecc5893a3e493b211f242cc149528bcd453a94857052b38a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-21T14:28:26Z","title_canon_sha256":"c15a56f41ee14f4c7950fb623c0e3d52637cd5b2998504b1abfc7e3570dc0f99"},"schema_version":"1.0","source":{"id":"2410.16052","kind":"arxiv","version":1}},"canonical_sha256":"c5051bf73d4b0e34addc8b394811d2de86363cb3292788675b999493d09c4d43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5051bf73d4b0e34addc8b394811d2de86363cb3292788675b999493d09c4d43","first_computed_at":"2026-07-05T09:23:28.580069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:23:28.580069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pXZlWVw3izWI7jlDl7thRIv4D3Tw5734LmgF4f9tVyQpIA2Z3+/Z/2iVlNubtLYHdj8ohfVjT9HMGTFkQfQnAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:23:28.580536Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.16052","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7170aef19486e8702b64df333b8d19db848333a115528e8cdbd81c3d138caf61","sha256:f337142576c2d0d779272ffbb335fde2362f33c7df7e5e5e6d4212ab9ee99d7c"],"state_sha256":"820507606965d5d1eee7ef090380f5cea1c7c26e4e750132b1670ee1c8495a35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/88FylRsJIqesP1WgjtXZ8kPNW1DbL4wL92l58VuVHvMLIjxx90LyjwdEFfWGSuU2vbflsPufLCarvwv60PAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T14:02:40.225703Z","bundle_sha256":"bf5d21742dbe0e9e2feb70fcb5cb1924653c70743cf8704f720e9e91a7c739a7"}}