{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C66W5HJSZB3HSJYKJIIXLVY5FK","short_pith_number":"pith:C66W5HJS","schema_version":"1.0","canonical_sha256":"17bd6e9d32c87679270a4a1175d71d2ab56c21adad5ffae5e38fdf5072246a83","source":{"kind":"arxiv","id":"1605.01185","version":1},"attestation_state":"computed","paper":{"title":"Linear Bandit algorithms using the Bootstrap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Balaraman Ravindran, Nandan Sudarsanam","submitted_at":"2016-05-04T08:52:10Z","abstract_excerpt":"This study presents two new algorithms for solving linear stochastic bandit problems. The proposed methods use an approach from non-parametric statistics called bootstrapping to create confidence bounds. This is achieved without making any assumptions about the distribution of noise in the underlying system. We present the X-Random and X-Fixed bootstrap bandits which correspond to the two well-known approaches for conducting bootstraps on models, in the literature. The proposed methods are compared to other popular solutions for linear stochastic bandit problems, namely, OFUL, LinUCB and Thomp"},"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":"1605.01185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-04T08:52:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"606d78c6813bd0851bdb4db194e7491e07fb9e5bc08956b4633f0697b7567547","abstract_canon_sha256":"6e8a8a80a6360523c481c38b1328c8abd69329d6ace555a5f283951f11ea4e2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:37.580898Z","signature_b64":"uuyrFn87LQhBlHV8yYv1FyB7z8ObCXCoTSbH6wcIG0k1ppyAgnDO2CFuuWzs+ekw1M8JBubiJzQ+Brqg3ZnkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17bd6e9d32c87679270a4a1175d71d2ab56c21adad5ffae5e38fdf5072246a83","last_reissued_at":"2026-05-18T01:15:37.580180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:37.580180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Bandit algorithms using the Bootstrap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Balaraman Ravindran, Nandan Sudarsanam","submitted_at":"2016-05-04T08:52:10Z","abstract_excerpt":"This study presents two new algorithms for solving linear stochastic bandit problems. The proposed methods use an approach from non-parametric statistics called bootstrapping to create confidence bounds. This is achieved without making any assumptions about the distribution of noise in the underlying system. We present the X-Random and X-Fixed bootstrap bandits which correspond to the two well-known approaches for conducting bootstraps on models, in the literature. The proposed methods are compared to other popular solutions for linear stochastic bandit problems, namely, OFUL, LinUCB and Thomp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01185","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":""},"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":"1605.01185","created_at":"2026-05-18T01:15:37.580291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01185v1","created_at":"2026-05-18T01:15:37.580291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01185","created_at":"2026-05-18T01:15:37.580291+00:00"},{"alias_kind":"pith_short_12","alias_value":"C66W5HJSZB3H","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C66W5HJSZB3HSJYK","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C66W5HJS","created_at":"2026-05-18T12:30:09.641336+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/C66W5HJSZB3HSJYKJIIXLVY5FK","json":"https://pith.science/pith/C66W5HJSZB3HSJYKJIIXLVY5FK.json","graph_json":"https://pith.science/api/pith-number/C66W5HJSZB3HSJYKJIIXLVY5FK/graph.json","events_json":"https://pith.science/api/pith-number/C66W5HJSZB3HSJYKJIIXLVY5FK/events.json","paper":"https://pith.science/paper/C66W5HJS"},"agent_actions":{"view_html":"https://pith.science/pith/C66W5HJSZB3HSJYKJIIXLVY5FK","download_json":"https://pith.science/pith/C66W5HJSZB3HSJYKJIIXLVY5FK.json","view_paper":"https://pith.science/paper/C66W5HJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01185&json=true","fetch_graph":"https://pith.science/api/pith-number/C66W5HJSZB3HSJYKJIIXLVY5FK/graph.json","fetch_events":"https://pith.science/api/pith-number/C66W5HJSZB3HSJYKJIIXLVY5FK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C66W5HJSZB3HSJYKJIIXLVY5FK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C66W5HJSZB3HSJYKJIIXLVY5FK/action/storage_attestation","attest_author":"https://pith.science/pith/C66W5HJSZB3HSJYKJIIXLVY5FK/action/author_attestation","sign_citation":"https://pith.science/pith/C66W5HJSZB3HSJYKJIIXLVY5FK/action/citation_signature","submit_replication":"https://pith.science/pith/C66W5HJSZB3HSJYKJIIXLVY5FK/action/replication_record"}},"created_at":"2026-05-18T01:15:37.580291+00:00","updated_at":"2026-05-18T01:15:37.580291+00:00"}