{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ICKJN2TPU3FH7Y4KTHPZIKK52U","short_pith_number":"pith:ICKJN2TP","schema_version":"1.0","canonical_sha256":"409496ea6fa6ca7fe38a99df94295dd5026dbc22064623d93b3f562615dbb149","source":{"kind":"arxiv","id":"1201.4002","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Policies for Sequential Sampling under Incomplete Information and a Cost Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Apostolos Burnetas, Odysseas Kanavetas","submitted_at":"2012-01-19T10:06:29Z","abstract_excerpt":"We consider the problem of sequential sampling from a finite number of independent statistical populations to maximize the expected infinite horizon average outcome per period, under a constraint that the expected average sampling cost does not exceed an upper bound. The outcome distributions are not known. We construct a class of consistent adaptive policies, under which the average outcome converges with probability 1 to the true value under complete information for all distributions with finite means. We also compare the rate of convergence for various policies in this class using simulatio"},"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":"1201.4002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-01-19T10:06:29Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"1521a0498fcc00d097754580e060e49e7d4198e1a146dd161baae018a0d9e5e6","abstract_canon_sha256":"e83afb3b0f927cf1f5558d41e9f3d0f192a5a311a903885865808ee602e3f157"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:16.185153Z","signature_b64":"9c11QItCLN+n71J8SWoYcFhMrWKHuPOP6HOzVO/3USFoi1YqRW4SUvDoxmD6rgKZ0LpYs9OsQtJGyE5GcrboDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"409496ea6fa6ca7fe38a99df94295dd5026dbc22064623d93b3f562615dbb149","last_reissued_at":"2026-05-18T04:04:16.184448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:16.184448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Policies for Sequential Sampling under Incomplete Information and a Cost Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Apostolos Burnetas, Odysseas Kanavetas","submitted_at":"2012-01-19T10:06:29Z","abstract_excerpt":"We consider the problem of sequential sampling from a finite number of independent statistical populations to maximize the expected infinite horizon average outcome per period, under a constraint that the expected average sampling cost does not exceed an upper bound. The outcome distributions are not known. We construct a class of consistent adaptive policies, under which the average outcome converges with probability 1 to the true value under complete information for all distributions with finite means. We also compare the rate of convergence for various policies in this class using simulatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4002","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":"1201.4002","created_at":"2026-05-18T04:04:16.184589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4002v1","created_at":"2026-05-18T04:04:16.184589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4002","created_at":"2026-05-18T04:04:16.184589+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICKJN2TPU3FH","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICKJN2TPU3FH7Y4K","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICKJN2TP","created_at":"2026-05-18T12:27:09.501522+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/ICKJN2TPU3FH7Y4KTHPZIKK52U","json":"https://pith.science/pith/ICKJN2TPU3FH7Y4KTHPZIKK52U.json","graph_json":"https://pith.science/api/pith-number/ICKJN2TPU3FH7Y4KTHPZIKK52U/graph.json","events_json":"https://pith.science/api/pith-number/ICKJN2TPU3FH7Y4KTHPZIKK52U/events.json","paper":"https://pith.science/paper/ICKJN2TP"},"agent_actions":{"view_html":"https://pith.science/pith/ICKJN2TPU3FH7Y4KTHPZIKK52U","download_json":"https://pith.science/pith/ICKJN2TPU3FH7Y4KTHPZIKK52U.json","view_paper":"https://pith.science/paper/ICKJN2TP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4002&json=true","fetch_graph":"https://pith.science/api/pith-number/ICKJN2TPU3FH7Y4KTHPZIKK52U/graph.json","fetch_events":"https://pith.science/api/pith-number/ICKJN2TPU3FH7Y4KTHPZIKK52U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICKJN2TPU3FH7Y4KTHPZIKK52U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICKJN2TPU3FH7Y4KTHPZIKK52U/action/storage_attestation","attest_author":"https://pith.science/pith/ICKJN2TPU3FH7Y4KTHPZIKK52U/action/author_attestation","sign_citation":"https://pith.science/pith/ICKJN2TPU3FH7Y4KTHPZIKK52U/action/citation_signature","submit_replication":"https://pith.science/pith/ICKJN2TPU3FH7Y4KTHPZIKK52U/action/replication_record"}},"created_at":"2026-05-18T04:04:16.184589+00:00","updated_at":"2026-05-18T04:04:16.184589+00:00"}