{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PEO6AXFDY5LXBULVSKBSD525ED","short_pith_number":"pith:PEO6AXFD","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"},"canonical_sha256":"791de05ca3c75770d175928321f75d20ee47c053fd45d42bc78adaf27cfc1aa5","source":{"kind":"arxiv","id":"1905.11046","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11046","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11046v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11046","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"PEO6AXFDY5LX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PEO6AXFDY5LXBULV","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PEO6AXFD","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PEO6AXFDY5LXBULVSKBSD525ED","target":"record","payload":{"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"},"canonical_sha256":"791de05ca3c75770d175928321f75d20ee47c053fd45d42bc78adaf27cfc1aa5","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"},"source_kind":"arxiv","source_id":"1905.11046","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-05-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18Nr0dqtJnkiRLkeo7cvDXV8KtZMQqGKcmGI77fXCb+4x3JAnRF+SSeoC1U2ECcqc1qwi+mF8DX4CF9K2vuWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:18:31.924137Z"},"content_sha256":"14988d525c709b9e97302490f16df58e5d7f1234aa4f8746332dc0cf609a641e","schema_version":"1.0","event_id":"sha256:14988d525c709b9e97302490f16df58e5d7f1234aa4f8746332dc0cf609a641e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PEO6AXFDY5LXBULVSKBSD525ED","target":"graph","payload":{"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"},"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-05-17T23:45:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qPuL7S8w8PIjVzyn4dTIoQb+Kx/ZO7o0w0lE4UqCmgohYutp2SnZ1avc1ubej9zLdeTAzS/upxnM0IqjY+GFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:18:31.924794Z"},"content_sha256":"68d830d54193965b7fa6075455e4d75842d6b9b6f4bc31610f0cca43cf1f6cd8","schema_version":"1.0","event_id":"sha256:68d830d54193965b7fa6075455e4d75842d6b9b6f4bc31610f0cca43cf1f6cd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PEO6AXFDY5LXBULVSKBSD525ED/bundle.json","state_url":"https://pith.science/pith/PEO6AXFDY5LXBULVSKBSD525ED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PEO6AXFDY5LXBULVSKBSD525ED/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-06-06T15:18:31Z","links":{"resolver":"https://pith.science/pith/PEO6AXFDY5LXBULVSKBSD525ED","bundle":"https://pith.science/pith/PEO6AXFDY5LXBULVSKBSD525ED/bundle.json","state":"https://pith.science/pith/PEO6AXFDY5LXBULVSKBSD525ED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PEO6AXFDY5LXBULVSKBSD525ED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PEO6AXFDY5LXBULVSKBSD525ED","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":"c2db81ea38e50ca1cd19e852cbc2c003c8719e56468e335ab4f73dac66473235","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T08:51:26Z","title_canon_sha256":"fd161d266877355d2ed3692498828612335a1d808973655bfcc066b6ad903487"},"schema_version":"1.0","source":{"id":"1905.11046","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11046","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11046v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11046","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"PEO6AXFDY5LX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PEO6AXFDY5LXBULV","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PEO6AXFD","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:68d830d54193965b7fa6075455e4d75842d6b9b6f4bc31610f0cca43cf1f6cd8","target":"graph","created_at":"2026-05-17T23:45:03Z","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"},"paper":{"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.","authors_text":"Chao Tao, Jian Peng, Sa\\`ul Blanco, Yuan Zhou","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T08:51:26Z","title":"Thresholding Bandit with Optimal Aggregate Regret"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11046","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:14988d525c709b9e97302490f16df58e5d7f1234aa4f8746332dc0cf609a641e","target":"record","created_at":"2026-05-17T23:45:03Z","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":"c2db81ea38e50ca1cd19e852cbc2c003c8719e56468e335ab4f73dac66473235","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T08:51:26Z","title_canon_sha256":"fd161d266877355d2ed3692498828612335a1d808973655bfcc066b6ad903487"},"schema_version":"1.0","source":{"id":"1905.11046","kind":"arxiv","version":1}},"canonical_sha256":"791de05ca3c75770d175928321f75d20ee47c053fd45d42bc78adaf27cfc1aa5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"791de05ca3c75770d175928321f75d20ee47c053fd45d42bc78adaf27cfc1aa5","first_computed_at":"2026-05-17T23:45:03.054772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:03.054772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RrFloQVydpSQIPE48qA45abikHBhGtNkA18F5QkUMbn3XBdKg7rEhVMDUJm9nsSlACwWNS4EsDSZfMIDCNcvDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:03.055395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11046","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14988d525c709b9e97302490f16df58e5d7f1234aa4f8746332dc0cf609a641e","sha256:68d830d54193965b7fa6075455e4d75842d6b9b6f4bc31610f0cca43cf1f6cd8"],"state_sha256":"e5e44a4c88462ac256a3730329afcd3893f06545edd396f9748e69825e941f23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RBvbPoAVyBG+UOgwHXcb4mpYe08u1OBS0SOdKzhYcFjHAqW60yHaHYtNUtPmkmc/ZVEi6z175qhXIcDKz9NoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:18:31.928592Z","bundle_sha256":"758160dbc9cec217664c6d542e24cadec8cdb3bbd3c04e0f6f03121a3a361eef"}}