{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:C4PFLMG2Z3FZYMWTZKSIWZ2YK4","short_pith_number":"pith:C4PFLMG2","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"},"canonical_sha256":"171e55b0dacecb9c32d3caa48b675857081183c9966b9bc276708fcd0d254868","source":{"kind":"arxiv","id":"1803.10415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10415","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10415v1","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10415","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"C4PFLMG2Z3FZ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C4PFLMG2Z3FZYMWT","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C4PFLMG2","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:C4PFLMG2Z3FZYMWTZKSIWZ2YK4","target":"record","payload":{"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"},"canonical_sha256":"171e55b0dacecb9c32d3caa48b675857081183c9966b9bc276708fcd0d254868","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"},"source_kind":"arxiv","source_id":"1803.10415","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-18T00:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"COTih1wEmfM8v2siGRW+FLxsSoWrPbFtcjwhSF9yuRk0SsFF/GKwraKmnJfu1HLKjQHiMBQCRlUNrCnIZVEoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:07:46.258514Z"},"content_sha256":"1669371f3922b6e763a314555c7279edd67ab42ab620c61a39f5ea9326a5ef2b","schema_version":"1.0","event_id":"sha256:1669371f3922b6e763a314555c7279edd67ab42ab620c61a39f5ea9326a5ef2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:C4PFLMG2Z3FZYMWTZKSIWZ2YK4","target":"graph","payload":{"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"},"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-18T00:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZIawB9v2lNYlG8Fr5G5QkhHJDJiul4Z4zKRMldKp7wJSHuDZPo0rFl8KBF0M/WsqzFUlEOiU7bEfda7hf6bAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:07:46.258911Z"},"content_sha256":"4c2c1cb8f4781a8f4d8bf163a05d415461aac344a3064b43541aebb5061fc902","schema_version":"1.0","event_id":"sha256:4c2c1cb8f4781a8f4d8bf163a05d415461aac344a3064b43541aebb5061fc902"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/bundle.json","state_url":"https://pith.science/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/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-05-30T12:07:46Z","links":{"resolver":"https://pith.science/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4","bundle":"https://pith.science/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/bundle.json","state":"https://pith.science/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4PFLMG2Z3FZYMWTZKSIWZ2YK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:C4PFLMG2Z3FZYMWTZKSIWZ2YK4","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":"20724bae5d1da442f77fb63c3ff8854395c6b5688e8921828c49d6e3595cdfae","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-28T05:05:24Z","title_canon_sha256":"73bde08ff45e462eaa7ebaaf3149b937d8af69393ff8619a630780a4dc009b98"},"schema_version":"1.0","source":{"id":"1803.10415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10415","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10415v1","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10415","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"C4PFLMG2Z3FZ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C4PFLMG2Z3FZYMWT","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C4PFLMG2","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:4c2c1cb8f4781a8f4d8bf163a05d415461aac344a3064b43541aebb5061fc902","target":"graph","created_at":"2026-05-18T00:19:55Z","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 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","authors_text":"Koby Crammer, Yuval Dagan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-28T05:05:24Z","title":"A Better Resource Allocation Algorithm with Semi-Bandit Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10415","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:1669371f3922b6e763a314555c7279edd67ab42ab620c61a39f5ea9326a5ef2b","target":"record","created_at":"2026-05-18T00:19:55Z","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":"20724bae5d1da442f77fb63c3ff8854395c6b5688e8921828c49d6e3595cdfae","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-28T05:05:24Z","title_canon_sha256":"73bde08ff45e462eaa7ebaaf3149b937d8af69393ff8619a630780a4dc009b98"},"schema_version":"1.0","source":{"id":"1803.10415","kind":"arxiv","version":1}},"canonical_sha256":"171e55b0dacecb9c32d3caa48b675857081183c9966b9bc276708fcd0d254868","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"171e55b0dacecb9c32d3caa48b675857081183c9966b9bc276708fcd0d254868","first_computed_at":"2026-05-18T00:19:55.467777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:55.467777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZTHyonfPHXzbaEzAyNwpsWDDuyfp0+mgLmqQeNrS5w867rZ9Xoakr/trKx9fhifTSm3JWVfbBHia5WZlyFaYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:55.468360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1669371f3922b6e763a314555c7279edd67ab42ab620c61a39f5ea9326a5ef2b","sha256:4c2c1cb8f4781a8f4d8bf163a05d415461aac344a3064b43541aebb5061fc902"],"state_sha256":"8148f5ea3803d10ae3785b2014f7eac362f9c261f1874cc5d40a1e979c363935"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdqO9U9FC77g69RkMHvhlS2EpG2Uktq5y2PgPtbmBUMZAYyh9QiempIb24h9nURWFFyboa3/LI5onjBLz3MxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:07:46.261481Z","bundle_sha256":"bed3b105feb552c9b8e29a1c543a8c41d280147ebfe9571ef15c300811877e58"}}