{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:62SHLEJH7J4T2O3NW7ASDZ77ED","short_pith_number":"pith:62SHLEJH","schema_version":"1.0","canonical_sha256":"f6a4759127fa793d3b6db7c121e7ff20e1fa633a6bcf8ed3168a106af3ed2925","source":{"kind":"arxiv","id":"2505.14102","version":1},"attestation_state":"computed","paper":{"title":"High-dimensional Nonparametric Contextual Bandit Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Junpei Komiyama, Masaaki Imaizumi, Shogo Iwazaki","submitted_at":"2025-05-20T09:10:39Z","abstract_excerpt":"We consider the kernelized contextual bandit problem with a large feature space. This problem involves $K$ arms, and the goal of the forecaster is to maximize the cumulative rewards through learning the relationship between the contexts and the rewards. It serves as a general framework for various decision-making scenarios, such as personalized online advertising and recommendation systems. Kernelized contextual bandits generalize the linear contextual bandit problem and offers a greater modeling flexibility. Existing methods, when applied to Gaussian kernels, yield a trivial bound of $O(T)$ w"},"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":"2505.14102","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-05-20T09:10:39Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"9e54025802b9f0efa666967b10d48314d92dbc6f534d4ce784043f7c2c8254fe","abstract_canon_sha256":"36831d6e46e223067077bb437fb2ece1060df137d4a497f2a76905dff27fe4f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:56.267075Z","signature_b64":"6Cf82+J3rsrTJOFGf6Jkhw/hUP3e6AiMZcDBw6IWEDqNlhjx2r9bQ97wFg6JHAG0G9c4ZzmY678oDWxwrUEQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6a4759127fa793d3b6db7c121e7ff20e1fa633a6bcf8ed3168a106af3ed2925","last_reissued_at":"2026-07-05T11:05:56.266633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:56.266633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-dimensional Nonparametric Contextual Bandit Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Junpei Komiyama, Masaaki Imaizumi, Shogo Iwazaki","submitted_at":"2025-05-20T09:10:39Z","abstract_excerpt":"We consider the kernelized contextual bandit problem with a large feature space. This problem involves $K$ arms, and the goal of the forecaster is to maximize the cumulative rewards through learning the relationship between the contexts and the rewards. It serves as a general framework for various decision-making scenarios, such as personalized online advertising and recommendation systems. Kernelized contextual bandits generalize the linear contextual bandit problem and offers a greater modeling flexibility. Existing methods, when applied to Gaussian kernels, yield a trivial bound of $O(T)$ w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14102","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/2505.14102/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":"2505.14102","created_at":"2026-07-05T11:05:56.266687+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.14102v1","created_at":"2026-07-05T11:05:56.266687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14102","created_at":"2026-07-05T11:05:56.266687+00:00"},{"alias_kind":"pith_short_12","alias_value":"62SHLEJH7J4T","created_at":"2026-07-05T11:05:56.266687+00:00"},{"alias_kind":"pith_short_16","alias_value":"62SHLEJH7J4T2O3N","created_at":"2026-07-05T11:05:56.266687+00:00"},{"alias_kind":"pith_short_8","alias_value":"62SHLEJH","created_at":"2026-07-05T11:05:56.266687+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/62SHLEJH7J4T2O3NW7ASDZ77ED","json":"https://pith.science/pith/62SHLEJH7J4T2O3NW7ASDZ77ED.json","graph_json":"https://pith.science/api/pith-number/62SHLEJH7J4T2O3NW7ASDZ77ED/graph.json","events_json":"https://pith.science/api/pith-number/62SHLEJH7J4T2O3NW7ASDZ77ED/events.json","paper":"https://pith.science/paper/62SHLEJH"},"agent_actions":{"view_html":"https://pith.science/pith/62SHLEJH7J4T2O3NW7ASDZ77ED","download_json":"https://pith.science/pith/62SHLEJH7J4T2O3NW7ASDZ77ED.json","view_paper":"https://pith.science/paper/62SHLEJH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.14102&json=true","fetch_graph":"https://pith.science/api/pith-number/62SHLEJH7J4T2O3NW7ASDZ77ED/graph.json","fetch_events":"https://pith.science/api/pith-number/62SHLEJH7J4T2O3NW7ASDZ77ED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62SHLEJH7J4T2O3NW7ASDZ77ED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62SHLEJH7J4T2O3NW7ASDZ77ED/action/storage_attestation","attest_author":"https://pith.science/pith/62SHLEJH7J4T2O3NW7ASDZ77ED/action/author_attestation","sign_citation":"https://pith.science/pith/62SHLEJH7J4T2O3NW7ASDZ77ED/action/citation_signature","submit_replication":"https://pith.science/pith/62SHLEJH7J4T2O3NW7ASDZ77ED/action/replication_record"}},"created_at":"2026-07-05T11:05:56.266687+00:00","updated_at":"2026-07-05T11:05:56.266687+00:00"}