{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PEO6AXFDY5LXBULVSKBSD525ED","short_pith_number":"pith:PEO6AXFD","schema_version":"1.0","canonical_sha256":"791de05ca3c75770d175928321f75d20ee47c053fd45d42bc78adaf27cfc1aa5","source":{"kind":"arxiv","id":"1905.11046","version":1},"attestation_state":"computed","paper":{"title":"Thresholding Bandit with Optimal Aggregate Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chao Tao, Jian Peng, Sa\\`ul Blanco, Yuan Zhou","submitted_at":"2019-05-27T08:51:26Z","abstract_excerpt":"We consider the thresholding bandit problem, whose goal is to find arms of mean rewards above a given threshold $\\theta$, with a fixed budget of $T$ trials. We introduce LSA, a new, simple and anytime algorithm that aims to minimize the aggregate regret (or the expected number of mis-classified arms). We prove that our algorithm is instance-wise asymptotically optimal. We also provide comprehensive empirical results to demonstrate the algorithm's superior performance over existing algorithms under a variety of different scenarios."},"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":"1905.11046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T08:51:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"fd161d266877355d2ed3692498828612335a1d808973655bfcc066b6ad903487","abstract_canon_sha256":"c2db81ea38e50ca1cd19e852cbc2c003c8719e56468e335ab4f73dac66473235"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:03.055395Z","signature_b64":"RrFloQVydpSQIPE48qA45abikHBhGtNkA18F5QkUMbn3XBdKg7rEhVMDUJm9nsSlACwWNS4EsDSZfMIDCNcvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"791de05ca3c75770d175928321f75d20ee47c053fd45d42bc78adaf27cfc1aa5","last_reissued_at":"2026-05-17T23:45:03.054772Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:03.054772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thresholding Bandit with Optimal Aggregate Regret","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chao Tao, Jian Peng, Sa\\`ul Blanco, Yuan Zhou","submitted_at":"2019-05-27T08:51:26Z","abstract_excerpt":"We consider the thresholding bandit problem, whose goal is to find arms of mean rewards above a given threshold $\\theta$, with a fixed budget of $T$ trials. We introduce LSA, a new, simple and anytime algorithm that aims to minimize the aggregate regret (or the expected number of mis-classified arms). We prove that our algorithm is instance-wise asymptotically optimal. We also provide comprehensive empirical results to demonstrate the algorithm's superior performance over existing algorithms under a variety of different scenarios."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11046","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":"1905.11046","created_at":"2026-05-17T23:45:03.054875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11046v1","created_at":"2026-05-17T23:45:03.054875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11046","created_at":"2026-05-17T23:45:03.054875+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEO6AXFDY5LX","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEO6AXFDY5LXBULV","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEO6AXFD","created_at":"2026-05-18T12:33:24.271573+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/PEO6AXFDY5LXBULVSKBSD525ED","json":"https://pith.science/pith/PEO6AXFDY5LXBULVSKBSD525ED.json","graph_json":"https://pith.science/api/pith-number/PEO6AXFDY5LXBULVSKBSD525ED/graph.json","events_json":"https://pith.science/api/pith-number/PEO6AXFDY5LXBULVSKBSD525ED/events.json","paper":"https://pith.science/paper/PEO6AXFD"},"agent_actions":{"view_html":"https://pith.science/pith/PEO6AXFDY5LXBULVSKBSD525ED","download_json":"https://pith.science/pith/PEO6AXFDY5LXBULVSKBSD525ED.json","view_paper":"https://pith.science/paper/PEO6AXFD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11046&json=true","fetch_graph":"https://pith.science/api/pith-number/PEO6AXFDY5LXBULVSKBSD525ED/graph.json","fetch_events":"https://pith.science/api/pith-number/PEO6AXFDY5LXBULVSKBSD525ED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEO6AXFDY5LXBULVSKBSD525ED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEO6AXFDY5LXBULVSKBSD525ED/action/storage_attestation","attest_author":"https://pith.science/pith/PEO6AXFDY5LXBULVSKBSD525ED/action/author_attestation","sign_citation":"https://pith.science/pith/PEO6AXFDY5LXBULVSKBSD525ED/action/citation_signature","submit_replication":"https://pith.science/pith/PEO6AXFDY5LXBULVSKBSD525ED/action/replication_record"}},"created_at":"2026-05-17T23:45:03.054875+00:00","updated_at":"2026-05-17T23:45:03.054875+00:00"}