{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:C4PFLMG2Z3FZYMWTZKSIWZ2YK4","short_pith_number":"pith:C4PFLMG2","schema_version":"1.0","canonical_sha256":"171e55b0dacecb9c32d3caa48b675857081183c9966b9bc276708fcd0d254868","source":{"kind":"arxiv","id":"1803.10415","version":1},"attestation_state":"computed","paper":{"title":"A Better Resource Allocation Algorithm with Semi-Bandit Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Koby Crammer, Yuval Dagan","submitted_at":"2018-03-28T05:05:24Z","abstract_excerpt":"We study a sequential resource allocation problem between a fixed number of arms. On each iteration the algorithm distributes a resource among the arms in order to maximize the expected success rate. Allocating more of the resource to a given arm increases the probability that it succeeds, yet with a cut-off. We follow Lattimore et al. (2014) and assume that the probability increases linearly until it equals one, after which allocating more of the resource is wasteful. These cut-off values are fixed and unknown to the learner. We present an algorithm for this problem and prove a regret upper b"},"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":"1803.10415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-28T05:05:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"73bde08ff45e462eaa7ebaaf3149b937d8af69393ff8619a630780a4dc009b98","abstract_canon_sha256":"20724bae5d1da442f77fb63c3ff8854395c6b5688e8921828c49d6e3595cdfae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:55.468360Z","signature_b64":"ZTHyonfPHXzbaEzAyNwpsWDDuyfp0+mgLmqQeNrS5w867rZ9Xoakr/trKx9fhifTSm3JWVfbBHia5WZlyFaYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"171e55b0dacecb9c32d3caa48b675857081183c9966b9bc276708fcd0d254868","last_reissued_at":"2026-05-18T00:19:55.467777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:55.467777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Better Resource Allocation Algorithm with Semi-Bandit Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Koby Crammer, Yuval Dagan","submitted_at":"2018-03-28T05:05:24Z","abstract_excerpt":"We study a sequential resource allocation problem between a fixed number of arms. On each iteration the algorithm distributes a resource among the arms in order to maximize the expected success rate. Allocating more of the resource to a given arm increases the probability that it succeeds, yet with a cut-off. We follow Lattimore et al. (2014) and assume that the probability increases linearly until it equals one, after which allocating more of the resource is wasteful. These cut-off values are fixed and unknown to the learner. We present an algorithm for this problem and prove a regret upper b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10415","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":"1803.10415","created_at":"2026-05-18T00:19:55.467865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10415v1","created_at":"2026-05-18T00:19:55.467865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10415","created_at":"2026-05-18T00:19:55.467865+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4PFLMG2Z3FZ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4PFLMG2Z3FZYMWT","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4PFLMG2","created_at":"2026-05-18T12:32:16.446611+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/C4PFLMG2Z3FZYMWTZKSIWZ2YK4","json":"https://pith.science/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4.json","graph_json":"https://pith.science/api/pith-number/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/graph.json","events_json":"https://pith.science/api/pith-number/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/events.json","paper":"https://pith.science/paper/C4PFLMG2"},"agent_actions":{"view_html":"https://pith.science/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4","download_json":"https://pith.science/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4.json","view_paper":"https://pith.science/paper/C4PFLMG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10415&json=true","fetch_graph":"https://pith.science/api/pith-number/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/graph.json","fetch_events":"https://pith.science/api/pith-number/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/action/storage_attestation","attest_author":"https://pith.science/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/action/author_attestation","sign_citation":"https://pith.science/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/action/citation_signature","submit_replication":"https://pith.science/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/action/replication_record"}},"created_at":"2026-05-18T00:19:55.467865+00:00","updated_at":"2026-05-18T00:19:55.467865+00:00"}