{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CHS6HEFRNR4PBGK5BYRIA4C2JN","short_pith_number":"pith:CHS6HEFR","schema_version":"1.0","canonical_sha256":"11e5e390b16c78f0995d0e2280705a4b45f552a1b14743d1cfd0bd56997c0925","source":{"kind":"arxiv","id":"1509.02857","version":3},"attestation_state":"computed","paper":{"title":"Asymptotically Optimal Multi-Armed Bandit Policies under a Cost Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.ML","authors_text":"Apostolos N. Burnetas, Michael N. Katehakis, Odysseas Kanavetas","submitted_at":"2015-09-09T17:27:19Z","abstract_excerpt":"We develop asymptotically optimal policies for the multi armed bandit (MAB), problem, under a cost constraint. This model is applicable in situations where each sample (or activation) from a population (bandit) incurs a known bandit dependent cost. Successive samples from each population are iid random variables with unknown distribution. The objective is to design a feasible policy for deciding from which population to sample from, so as to maximize the expected sum of outcomes of $n$ total samples or equivalently to minimize the regret due to lack on information on sample distributions, For "},"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":"1509.02857","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-09T17:27:19Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8555a573d4bd5204fa10e62cc19f550239a58e70d0f490bd5c6f49f1ab4220ab","abstract_canon_sha256":"f96f22c1ad9194765914a8e871847a25ea76a0a90154816d3699fb0a9b735418"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:10.569435Z","signature_b64":"ewvr1CuQvobBoQzemv9YRizPHKPZnslaZ9lMC/CqUXmgOgx5nMrZsBKOs+AXWOfNV9PdHFyCCr6dMZ+IJSKmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11e5e390b16c78f0995d0e2280705a4b45f552a1b14743d1cfd0bd56997c0925","last_reissued_at":"2026-05-18T01:24:10.568844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:10.568844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Multi-Armed Bandit Policies under a Cost Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.ML","authors_text":"Apostolos N. Burnetas, Michael N. Katehakis, Odysseas Kanavetas","submitted_at":"2015-09-09T17:27:19Z","abstract_excerpt":"We develop asymptotically optimal policies for the multi armed bandit (MAB), problem, under a cost constraint. This model is applicable in situations where each sample (or activation) from a population (bandit) incurs a known bandit dependent cost. Successive samples from each population are iid random variables with unknown distribution. The objective is to design a feasible policy for deciding from which population to sample from, so as to maximize the expected sum of outcomes of $n$ total samples or equivalently to minimize the regret due to lack on information on sample distributions, For "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02857","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":"1509.02857","created_at":"2026-05-18T01:24:10.568918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.02857v3","created_at":"2026-05-18T01:24:10.568918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02857","created_at":"2026-05-18T01:24:10.568918+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHS6HEFRNR4P","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHS6HEFRNR4PBGK5","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHS6HEFR","created_at":"2026-05-18T12:29:14.074870+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/CHS6HEFRNR4PBGK5BYRIA4C2JN","json":"https://pith.science/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN.json","graph_json":"https://pith.science/api/pith-number/CHS6HEFRNR4PBGK5BYRIA4C2JN/graph.json","events_json":"https://pith.science/api/pith-number/CHS6HEFRNR4PBGK5BYRIA4C2JN/events.json","paper":"https://pith.science/paper/CHS6HEFR"},"agent_actions":{"view_html":"https://pith.science/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN","download_json":"https://pith.science/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN.json","view_paper":"https://pith.science/paper/CHS6HEFR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.02857&json=true","fetch_graph":"https://pith.science/api/pith-number/CHS6HEFRNR4PBGK5BYRIA4C2JN/graph.json","fetch_events":"https://pith.science/api/pith-number/CHS6HEFRNR4PBGK5BYRIA4C2JN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN/action/storage_attestation","attest_author":"https://pith.science/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN/action/author_attestation","sign_citation":"https://pith.science/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN/action/citation_signature","submit_replication":"https://pith.science/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN/action/replication_record"}},"created_at":"2026-05-18T01:24:10.568918+00:00","updated_at":"2026-05-18T01:24:10.568918+00:00"}