{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CHS6HEFRNR4PBGK5BYRIA4C2JN","short_pith_number":"pith:CHS6HEFR","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"},"canonical_sha256":"11e5e390b16c78f0995d0e2280705a4b45f552a1b14743d1cfd0bd56997c0925","source":{"kind":"arxiv","id":"1509.02857","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02857","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02857v3","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02857","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"CHS6HEFRNR4P","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CHS6HEFRNR4PBGK5","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CHS6HEFR","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CHS6HEFRNR4PBGK5BYRIA4C2JN","target":"record","payload":{"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"},"canonical_sha256":"11e5e390b16c78f0995d0e2280705a4b45f552a1b14743d1cfd0bd56997c0925","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"},"source_kind":"arxiv","source_id":"1509.02857","source_version":3,"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-18T01:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUHRc4AJ/METPEHJc0tXbw3jHBbKPMYjospiIx4hL99t6ICaeJvQNq6Y+yKXJGgCH793Tj13R5Tgil1QaPekBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:14:51.550067Z"},"content_sha256":"7ee4cb020e4defb1c94ad0291ccf38668d874bdea732790051b7fc293066d339","schema_version":"1.0","event_id":"sha256:7ee4cb020e4defb1c94ad0291ccf38668d874bdea732790051b7fc293066d339"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CHS6HEFRNR4PBGK5BYRIA4C2JN","target":"graph","payload":{"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"},"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-18T01:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7qbVItmWeE1I6lC3BlKNVMeZBc+brWJnzvWq+8KdP2GvuCbni5rp4Vu15MTxL0S+BXBRimrq+C2r7Kypi5A5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:14:51.550791Z"},"content_sha256":"1ecae0a3c0243061f6b35b0fd11dfd5e558a2ffb5999f22acffd4b223254f9ec","schema_version":"1.0","event_id":"sha256:1ecae0a3c0243061f6b35b0fd11dfd5e558a2ffb5999f22acffd4b223254f9ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN/bundle.json","state_url":"https://pith.science/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN/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-09T01:14:51Z","links":{"resolver":"https://pith.science/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN","bundle":"https://pith.science/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN/bundle.json","state":"https://pith.science/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CHS6HEFRNR4PBGK5BYRIA4C2JN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CHS6HEFRNR4PBGK5BYRIA4C2JN","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":"f96f22c1ad9194765914a8e871847a25ea76a0a90154816d3699fb0a9b735418","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-09T17:27:19Z","title_canon_sha256":"8555a573d4bd5204fa10e62cc19f550239a58e70d0f490bd5c6f49f1ab4220ab"},"schema_version":"1.0","source":{"id":"1509.02857","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02857","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02857v3","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02857","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"CHS6HEFRNR4P","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CHS6HEFRNR4PBGK5","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CHS6HEFR","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:1ecae0a3c0243061f6b35b0fd11dfd5e558a2ffb5999f22acffd4b223254f9ec","target":"graph","created_at":"2026-05-18T01:24:10Z","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 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 ","authors_text":"Apostolos N. Burnetas, Michael N. Katehakis, Odysseas Kanavetas","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-09T17:27:19Z","title":"Asymptotically Optimal Multi-Armed Bandit Policies under a Cost Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02857","kind":"arxiv","version":3},"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:7ee4cb020e4defb1c94ad0291ccf38668d874bdea732790051b7fc293066d339","target":"record","created_at":"2026-05-18T01:24:10Z","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":"f96f22c1ad9194765914a8e871847a25ea76a0a90154816d3699fb0a9b735418","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-09T17:27:19Z","title_canon_sha256":"8555a573d4bd5204fa10e62cc19f550239a58e70d0f490bd5c6f49f1ab4220ab"},"schema_version":"1.0","source":{"id":"1509.02857","kind":"arxiv","version":3}},"canonical_sha256":"11e5e390b16c78f0995d0e2280705a4b45f552a1b14743d1cfd0bd56997c0925","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11e5e390b16c78f0995d0e2280705a4b45f552a1b14743d1cfd0bd56997c0925","first_computed_at":"2026-05-18T01:24:10.568844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:10.568844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ewvr1CuQvobBoQzemv9YRizPHKPZnslaZ9lMC/CqUXmgOgx5nMrZsBKOs+AXWOfNV9PdHFyCCr6dMZ+IJSKmAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:10.569435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02857","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ee4cb020e4defb1c94ad0291ccf38668d874bdea732790051b7fc293066d339","sha256:1ecae0a3c0243061f6b35b0fd11dfd5e558a2ffb5999f22acffd4b223254f9ec"],"state_sha256":"d4ed653a65b60954430bca36c9c0ae2796f9b3f0526f37afa99e48944215ad66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yrLePdCHwMQJZOq7Ch0zj5njMcfV3CucSLA4yrkYvz93urkEAtNKOnJa1aMeVVXZf4VZSKVW8L1ijGfQJT/WDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:14:51.554255Z","bundle_sha256":"ea55cc701b4a45cc1a1baca8c3771295fb88c375f5033e8a6891a9d138f46e8d"}}