{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:A3W6DXSAIB2LKLQSPF6DMETQ2M","short_pith_number":"pith:A3W6DXSA","schema_version":"1.0","canonical_sha256":"06ede1de404074b52e12797c361270d33783851e3d1207d3c78f6568908b0b0b","source":{"kind":"arxiv","id":"2505.24692","version":1},"attestation_state":"computed","paper":{"title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Derek Everett, Edward Raff, Fernando Camacho, Fred Lu, James Holt","submitted_at":"2025-05-30T15:15:18Z","abstract_excerpt":"Canonical algorithms for multi-armed bandits typically assume a stationary reward environment where the size of the action space (number of arms) is small. More recently developed methods typically relax only one of these assumptions: existing non-stationary bandit policies are designed for a small number of arms, while Lipschitz, linear, and Gaussian process bandit policies are designed to handle a large (or infinite) number of arms in stationary reward environments under constraints on the reward function. In this manuscript, we propose a novel policy to learn reward environments over a cont"},"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.24692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-30T15:15:18Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"124c3c6942cd554afaf55b5505c0d47f9077e89eb838ee14b6307cb2afd87d52","abstract_canon_sha256":"3c1c1de4bdc5b2ef5ada6f0ab1c7ce04c3279a8c6c7d51a64d4b674cfe926446"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:54.814008Z","signature_b64":"hrpqC8fiPSijvv6dDAn8UOORhX/5QiGSY24l/IKOPxWEHATy/juAFaESmjZGDfBam24ooHoK1Ovt5l6TAra9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06ede1de404074b52e12797c361270d33783851e3d1207d3c78f6568908b0b0b","last_reissued_at":"2026-07-05T11:12:54.813463Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:54.813463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Derek Everett, Edward Raff, Fernando Camacho, Fred Lu, James Holt","submitted_at":"2025-05-30T15:15:18Z","abstract_excerpt":"Canonical algorithms for multi-armed bandits typically assume a stationary reward environment where the size of the action space (number of arms) is small. More recently developed methods typically relax only one of these assumptions: existing non-stationary bandit policies are designed for a small number of arms, while Lipschitz, linear, and Gaussian process bandit policies are designed to handle a large (or infinite) number of arms in stationary reward environments under constraints on the reward function. In this manuscript, we propose a novel policy to learn reward environments over a cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24692","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.24692/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.24692","created_at":"2026-07-05T11:12:54.813527+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.24692v1","created_at":"2026-07-05T11:12:54.813527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24692","created_at":"2026-07-05T11:12:54.813527+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3W6DXSAIB2L","created_at":"2026-07-05T11:12:54.813527+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3W6DXSAIB2LKLQS","created_at":"2026-07-05T11:12:54.813527+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3W6DXSA","created_at":"2026-07-05T11:12:54.813527+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/A3W6DXSAIB2LKLQSPF6DMETQ2M","json":"https://pith.science/pith/A3W6DXSAIB2LKLQSPF6DMETQ2M.json","graph_json":"https://pith.science/api/pith-number/A3W6DXSAIB2LKLQSPF6DMETQ2M/graph.json","events_json":"https://pith.science/api/pith-number/A3W6DXSAIB2LKLQSPF6DMETQ2M/events.json","paper":"https://pith.science/paper/A3W6DXSA"},"agent_actions":{"view_html":"https://pith.science/pith/A3W6DXSAIB2LKLQSPF6DMETQ2M","download_json":"https://pith.science/pith/A3W6DXSAIB2LKLQSPF6DMETQ2M.json","view_paper":"https://pith.science/paper/A3W6DXSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.24692&json=true","fetch_graph":"https://pith.science/api/pith-number/A3W6DXSAIB2LKLQSPF6DMETQ2M/graph.json","fetch_events":"https://pith.science/api/pith-number/A3W6DXSAIB2LKLQSPF6DMETQ2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3W6DXSAIB2LKLQSPF6DMETQ2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3W6DXSAIB2LKLQSPF6DMETQ2M/action/storage_attestation","attest_author":"https://pith.science/pith/A3W6DXSAIB2LKLQSPF6DMETQ2M/action/author_attestation","sign_citation":"https://pith.science/pith/A3W6DXSAIB2LKLQSPF6DMETQ2M/action/citation_signature","submit_replication":"https://pith.science/pith/A3W6DXSAIB2LKLQSPF6DMETQ2M/action/replication_record"}},"created_at":"2026-07-05T11:12:54.813527+00:00","updated_at":"2026-07-05T11:12:54.813527+00:00"}