{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7JNU6U3BFRSKQAYNP6NYXAYUIL","short_pith_number":"pith:7JNU6U3B","canonical_record":{"source":{"id":"2606.11171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-09T17:49:09Z","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","math.IT","math.OC","math.ST","stat.TH"],"title_canon_sha256":"bd1c275484f4307ffd3afbed09312baf154cc9f99492a42b33a98d2c589407cd","abstract_canon_sha256":"5477566029e84684bffb78a9b52e5de7fac0e6698fffbbcc5ee4877631a80cc9"},"schema_version":"1.0"},"canonical_sha256":"fa5b4f53612c64a8030d7f9b8b831442e5cbf8d16e55817576830465be9638b7","source":{"kind":"arxiv","id":"2606.11171","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11171","created_at":"2026-06-10T01:11:15Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11171v1","created_at":"2026-06-10T01:11:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11171","created_at":"2026-06-10T01:11:15Z"},{"alias_kind":"pith_short_12","alias_value":"7JNU6U3BFRSK","created_at":"2026-06-10T01:11:15Z"},{"alias_kind":"pith_short_16","alias_value":"7JNU6U3BFRSKQAYN","created_at":"2026-06-10T01:11:15Z"},{"alias_kind":"pith_short_8","alias_value":"7JNU6U3B","created_at":"2026-06-10T01:11:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7JNU6U3BFRSKQAYNP6NYXAYUIL","target":"record","payload":{"canonical_record":{"source":{"id":"2606.11171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-09T17:49:09Z","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","math.IT","math.OC","math.ST","stat.TH"],"title_canon_sha256":"bd1c275484f4307ffd3afbed09312baf154cc9f99492a42b33a98d2c589407cd","abstract_canon_sha256":"5477566029e84684bffb78a9b52e5de7fac0e6698fffbbcc5ee4877631a80cc9"},"schema_version":"1.0"},"canonical_sha256":"fa5b4f53612c64a8030d7f9b8b831442e5cbf8d16e55817576830465be9638b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:11:15.134035Z","signature_b64":"So7vDbsesaAl2XrWfVSFp40qjB/JbSxeYC3P7OAUzFAiD12ar6g6fJ4aEAxCparORnhtjbCXZ1ejvYo08wFxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa5b4f53612c64a8030d7f9b8b831442e5cbf8d16e55817576830465be9638b7","last_reissued_at":"2026-06-10T01:11:15.133182Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:11:15.133182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.11171","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-06-10T01:11:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CsSmjTEgKIbXkY66uqX7bgiw/LLHmTsMKSn4yioJkh2F0y4x0245680yCe5J5tA3JG/7y4EkEEFNNi5/bNbhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T05:48:55.101358Z"},"content_sha256":"32dbbf765f7679e5693b611992adc3de666cde16d318f3df22fde5b525702e77","schema_version":"1.0","event_id":"sha256:32dbbf765f7679e5693b611992adc3de666cde16d318f3df22fde5b525702e77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7JNU6U3BFRSKQAYNP6NYXAYUIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic and Minimax Complexities in Kernel Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.IT","math.IT","math.OC","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Yunbei Xu","submitted_at":"2026-06-09T17:49:09Z","abstract_excerpt":"Gaussian-process upper confidence bound (GP-UCB) and decision-estimation-coefficient (DEC) methods may appear, at first sight, to belong to different theories. This paper places the two viewpoints in a common algorithmic-information language for frequentist RKHS bandits. GP-UCB fixes an algorithmic, rather than true, Gaussian-process prior and exploits realized-trajectory complexity together with computational tractability, whereas MAMS optimizes a robust class-wide MAIR/DEC envelope. Through the unified MAIR framework and heterogeneous positive-semidefinite algorithmic priors, we generalize b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11171","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/2606.11171/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-06-10T01:11:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGYThdGX8IeOxPhrLoKXzauGLBYu9paKl3ntNnzdnZSMuciNTqk5IziCvP+j2D6cAMIqtXIEUNAUqIwsTUYGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T05:48:55.101990Z"},"content_sha256":"d6a9f8f9641fa4d07cb650cc4fe1057be36fecdb941a6e2e7775e859cb4cbff1","schema_version":"1.0","event_id":"sha256:d6a9f8f9641fa4d07cb650cc4fe1057be36fecdb941a6e2e7775e859cb4cbff1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JNU6U3BFRSKQAYNP6NYXAYUIL/bundle.json","state_url":"https://pith.science/pith/7JNU6U3BFRSKQAYNP6NYXAYUIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JNU6U3BFRSKQAYNP6NYXAYUIL/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-07-08T05:48:55Z","links":{"resolver":"https://pith.science/pith/7JNU6U3BFRSKQAYNP6NYXAYUIL","bundle":"https://pith.science/pith/7JNU6U3BFRSKQAYNP6NYXAYUIL/bundle.json","state":"https://pith.science/pith/7JNU6U3BFRSKQAYNP6NYXAYUIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JNU6U3BFRSKQAYNP6NYXAYUIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7JNU6U3BFRSKQAYNP6NYXAYUIL","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":"5477566029e84684bffb78a9b52e5de7fac0e6698fffbbcc5ee4877631a80cc9","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","math.IT","math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-09T17:49:09Z","title_canon_sha256":"bd1c275484f4307ffd3afbed09312baf154cc9f99492a42b33a98d2c589407cd"},"schema_version":"1.0","source":{"id":"2606.11171","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.11171","created_at":"2026-06-10T01:11:15Z"},{"alias_kind":"arxiv_version","alias_value":"2606.11171v1","created_at":"2026-06-10T01:11:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11171","created_at":"2026-06-10T01:11:15Z"},{"alias_kind":"pith_short_12","alias_value":"7JNU6U3BFRSK","created_at":"2026-06-10T01:11:15Z"},{"alias_kind":"pith_short_16","alias_value":"7JNU6U3BFRSKQAYN","created_at":"2026-06-10T01:11:15Z"},{"alias_kind":"pith_short_8","alias_value":"7JNU6U3B","created_at":"2026-06-10T01:11:15Z"}],"graph_snapshots":[{"event_id":"sha256:d6a9f8f9641fa4d07cb650cc4fe1057be36fecdb941a6e2e7775e859cb4cbff1","target":"graph","created_at":"2026-06-10T01:11:15Z","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/2606.11171/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Gaussian-process upper confidence bound (GP-UCB) and decision-estimation-coefficient (DEC) methods may appear, at first sight, to belong to different theories. This paper places the two viewpoints in a common algorithmic-information language for frequentist RKHS bandits. GP-UCB fixes an algorithmic, rather than true, Gaussian-process prior and exploits realized-trajectory complexity together with computational tractability, whereas MAMS optimizes a robust class-wide MAIR/DEC envelope. Through the unified MAIR framework and heterogeneous positive-semidefinite algorithmic priors, we generalize b","authors_text":"Yunbei Xu","cross_cats":["cond-mat.stat-mech","cs.IT","math.IT","math.OC","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-09T17:49:09Z","title":"Algorithmic and Minimax Complexities in Kernel Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11171","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:32dbbf765f7679e5693b611992adc3de666cde16d318f3df22fde5b525702e77","target":"record","created_at":"2026-06-10T01:11:15Z","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":"5477566029e84684bffb78a9b52e5de7fac0e6698fffbbcc5ee4877631a80cc9","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","math.IT","math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-09T17:49:09Z","title_canon_sha256":"bd1c275484f4307ffd3afbed09312baf154cc9f99492a42b33a98d2c589407cd"},"schema_version":"1.0","source":{"id":"2606.11171","kind":"arxiv","version":1}},"canonical_sha256":"fa5b4f53612c64a8030d7f9b8b831442e5cbf8d16e55817576830465be9638b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa5b4f53612c64a8030d7f9b8b831442e5cbf8d16e55817576830465be9638b7","first_computed_at":"2026-06-10T01:11:15.133182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:11:15.133182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"So7vDbsesaAl2XrWfVSFp40qjB/JbSxeYC3P7OAUzFAiD12ar6g6fJ4aEAxCparORnhtjbCXZ1ejvYo08wFxDg==","signature_status":"signed_v1","signed_at":"2026-06-10T01:11:15.134035Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.11171","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32dbbf765f7679e5693b611992adc3de666cde16d318f3df22fde5b525702e77","sha256:d6a9f8f9641fa4d07cb650cc4fe1057be36fecdb941a6e2e7775e859cb4cbff1"],"state_sha256":"899ea7009e545a33da983154b7a5a89454875d553d9bffaa429e1c7584795d1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R185HEl3PZ00m97Cpu44rKSB2/5V3n+FjDtYsoM1aAh76SgB3saBMjAsrOQIKoEqaDCZZjeJB1nBLB6c95ZCDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T05:48:55.105677Z","bundle_sha256":"b1371df0b6d03aa1f026e2fafb216541b9b6bf896858a4c748be2fff1b93a343"}}