{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7XPD47WUTBZK767PAXYSVNXYVV","short_pith_number":"pith:7XPD47WU","schema_version":"1.0","canonical_sha256":"fdde3e7ed49872affbef05f12ab6f8ad75b5339ca9c881c7171aa0c555801b7b","source":{"kind":"arxiv","id":"1510.02041","version":3},"attestation_state":"computed","paper":{"title":"Asymptotically Optimal Sequential Experimentation Under Generalized Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Michael N. Katehakis, Wesley Cowan","submitted_at":"2015-10-07T17:52:30Z","abstract_excerpt":"We consider the \\mnk{classical} problem of a controller activating (or sampling) sequentially from a finite number of $N \\geq 2$ populations, specified by unknown distributions. Over some time horizon, at each time $n = 1, 2, \\ldots$, the controller wishes to select a population to sample, with the goal of sampling from a population that optimizes some \"score\" function of its distribution, e.g., maximizing the expected sum of outcomes or minimizing variability. We define a class of \\textit{Uniformly Fast (UF)} sampling policies and show, under mild regularity conditions, that there is an asymp"},"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":"1510.02041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-10-07T17:52:30Z","cross_cats_sorted":[],"title_canon_sha256":"4745838dbfe24905ae4e480a3b124cfb225b9f605c3ad99c705a34f214c1ad44","abstract_canon_sha256":"dbcc15442ecc66146068fa1ec0a3789765c9c31eefddbc928c5a84552e6b3531"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:10.485487Z","signature_b64":"H6JFrdnPhB/69MzmVFuhBFz5U1DoWAxi1hJEJwqb0DmHnpgp+8Qcyr9JddhPj2naty9+Z12K19tITAr08oDUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdde3e7ed49872affbef05f12ab6f8ad75b5339ca9c881c7171aa0c555801b7b","last_reissued_at":"2026-05-18T01:24:10.484824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:10.484824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Sequential Experimentation Under Generalized Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Michael N. Katehakis, Wesley Cowan","submitted_at":"2015-10-07T17:52:30Z","abstract_excerpt":"We consider the \\mnk{classical} problem of a controller activating (or sampling) sequentially from a finite number of $N \\geq 2$ populations, specified by unknown distributions. Over some time horizon, at each time $n = 1, 2, \\ldots$, the controller wishes to select a population to sample, with the goal of sampling from a population that optimizes some \"score\" function of its distribution, e.g., maximizing the expected sum of outcomes or minimizing variability. We define a class of \\textit{Uniformly Fast (UF)} sampling policies and show, under mild regularity conditions, that there is an asymp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02041","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":"1510.02041","created_at":"2026-05-18T01:24:10.484924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02041v3","created_at":"2026-05-18T01:24:10.484924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02041","created_at":"2026-05-18T01:24:10.484924+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XPD47WUTBZK","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XPD47WUTBZK767P","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XPD47WU","created_at":"2026-05-18T12:29:10.953037+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/7XPD47WUTBZK767PAXYSVNXYVV","json":"https://pith.science/pith/7XPD47WUTBZK767PAXYSVNXYVV.json","graph_json":"https://pith.science/api/pith-number/7XPD47WUTBZK767PAXYSVNXYVV/graph.json","events_json":"https://pith.science/api/pith-number/7XPD47WUTBZK767PAXYSVNXYVV/events.json","paper":"https://pith.science/paper/7XPD47WU"},"agent_actions":{"view_html":"https://pith.science/pith/7XPD47WUTBZK767PAXYSVNXYVV","download_json":"https://pith.science/pith/7XPD47WUTBZK767PAXYSVNXYVV.json","view_paper":"https://pith.science/paper/7XPD47WU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02041&json=true","fetch_graph":"https://pith.science/api/pith-number/7XPD47WUTBZK767PAXYSVNXYVV/graph.json","fetch_events":"https://pith.science/api/pith-number/7XPD47WUTBZK767PAXYSVNXYVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XPD47WUTBZK767PAXYSVNXYVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XPD47WUTBZK767PAXYSVNXYVV/action/storage_attestation","attest_author":"https://pith.science/pith/7XPD47WUTBZK767PAXYSVNXYVV/action/author_attestation","sign_citation":"https://pith.science/pith/7XPD47WUTBZK767PAXYSVNXYVV/action/citation_signature","submit_replication":"https://pith.science/pith/7XPD47WUTBZK767PAXYSVNXYVV/action/replication_record"}},"created_at":"2026-05-18T01:24:10.484924+00:00","updated_at":"2026-05-18T01:24:10.484924+00:00"}