{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FHY2FBTQVMTG45AWS5P6ZSUEOH","short_pith_number":"pith:FHY2FBTQ","schema_version":"1.0","canonical_sha256":"29f1a28670ab266e7416975fecca8471ece3e64274ca602bd0ab99f4572def61","source":{"kind":"arxiv","id":"1612.06246","version":3},"attestation_state":"computed","paper":{"title":"Corralling a Band of Bandit Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alekh Agarwal, Behnam Neyshabur, Haipeng Luo, Robert E. Schapire","submitted_at":"2016-12-19T16:17:56Z","abstract_excerpt":"We study the problem of combining multiple bandit algorithms (that is, online learning algorithms with partial feedback) with the goal of creating a master algorithm that performs almost as well as the best base algorithm if it were to be run on its own. The main challenge is that when run with a master, base algorithms unavoidably receive much less feedback and it is thus critical that the master not starve a base algorithm that might perform uncompetitively initially but would eventually outperform others if given enough feedback. We address this difficulty by devising a version of Online Mi"},"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":"1612.06246","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-19T16:17:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"30c10d05a4d0c95439faf6b3dc0721c636ec0548c5b7034daa5c8bbe836a32f4","abstract_canon_sha256":"8fc9a10c1f9d26f4f0e53ab280be0bd334dab7d36efbfc659d85894ee3acdf0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:01.408300Z","signature_b64":"dPJitp5ZV8XcTTeav0kMPm4NDJJxQ5xsNYTzsVrKZlDEUrTyCHKRevdLaOoqe21m3Rzje+nPjeZSEleuYr/iBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29f1a28670ab266e7416975fecca8471ece3e64274ca602bd0ab99f4572def61","last_reissued_at":"2026-05-18T00:43:01.407656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:01.407656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Corralling a Band of Bandit Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alekh Agarwal, Behnam Neyshabur, Haipeng Luo, Robert E. Schapire","submitted_at":"2016-12-19T16:17:56Z","abstract_excerpt":"We study the problem of combining multiple bandit algorithms (that is, online learning algorithms with partial feedback) with the goal of creating a master algorithm that performs almost as well as the best base algorithm if it were to be run on its own. The main challenge is that when run with a master, base algorithms unavoidably receive much less feedback and it is thus critical that the master not starve a base algorithm that might perform uncompetitively initially but would eventually outperform others if given enough feedback. We address this difficulty by devising a version of Online Mi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06246","kind":"arxiv","version":3},"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":"1612.06246","created_at":"2026-05-18T00:43:01.407760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.06246v3","created_at":"2026-05-18T00:43:01.407760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06246","created_at":"2026-05-18T00:43:01.407760+00:00"},{"alias_kind":"pith_short_12","alias_value":"FHY2FBTQVMTG","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FHY2FBTQVMTG45AW","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FHY2FBTQ","created_at":"2026-05-18T12:30:15.759754+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/FHY2FBTQVMTG45AWS5P6ZSUEOH","json":"https://pith.science/pith/FHY2FBTQVMTG45AWS5P6ZSUEOH.json","graph_json":"https://pith.science/api/pith-number/FHY2FBTQVMTG45AWS5P6ZSUEOH/graph.json","events_json":"https://pith.science/api/pith-number/FHY2FBTQVMTG45AWS5P6ZSUEOH/events.json","paper":"https://pith.science/paper/FHY2FBTQ"},"agent_actions":{"view_html":"https://pith.science/pith/FHY2FBTQVMTG45AWS5P6ZSUEOH","download_json":"https://pith.science/pith/FHY2FBTQVMTG45AWS5P6ZSUEOH.json","view_paper":"https://pith.science/paper/FHY2FBTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.06246&json=true","fetch_graph":"https://pith.science/api/pith-number/FHY2FBTQVMTG45AWS5P6ZSUEOH/graph.json","fetch_events":"https://pith.science/api/pith-number/FHY2FBTQVMTG45AWS5P6ZSUEOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FHY2FBTQVMTG45AWS5P6ZSUEOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FHY2FBTQVMTG45AWS5P6ZSUEOH/action/storage_attestation","attest_author":"https://pith.science/pith/FHY2FBTQVMTG45AWS5P6ZSUEOH/action/author_attestation","sign_citation":"https://pith.science/pith/FHY2FBTQVMTG45AWS5P6ZSUEOH/action/citation_signature","submit_replication":"https://pith.science/pith/FHY2FBTQVMTG45AWS5P6ZSUEOH/action/replication_record"}},"created_at":"2026-05-18T00:43:01.407760+00:00","updated_at":"2026-05-18T00:43:01.407760+00:00"}