{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BTIAREX5LPA5G3VVWPJGFW2V3G","short_pith_number":"pith:BTIAREX5","canonical_record":{"source":{"id":"1507.04564","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-16T13:33:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2a4267c02d8c33d1a4ed7bdb6199a232db9cb1bed36610c77eb9733470836ae6","abstract_canon_sha256":"9711b585798e91e3a4ca0f13ba3147d28e82eb9087153b80b5ab6c354006cda0"},"schema_version":"1.0"},"canonical_sha256":"0cd00892fd5bc1d36eb5b3d262db55d9bdb841b164b64f5b0bd24de66e4e671c","source":{"kind":"arxiv","id":"1507.04564","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04564","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04564v3","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04564","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"BTIAREX5LPA5","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BTIAREX5LPA5G3VV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BTIAREX5","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BTIAREX5LPA5G3VVWPJGFW2V3G","target":"record","payload":{"canonical_record":{"source":{"id":"1507.04564","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-16T13:33:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2a4267c02d8c33d1a4ed7bdb6199a232db9cb1bed36610c77eb9733470836ae6","abstract_canon_sha256":"9711b585798e91e3a4ca0f13ba3147d28e82eb9087153b80b5ab6c354006cda0"},"schema_version":"1.0"},"canonical_sha256":"0cd00892fd5bc1d36eb5b3d262db55d9bdb841b164b64f5b0bd24de66e4e671c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:12.786260Z","signature_b64":"fWnpe6icF//pxR2uOv4q7rdQNySTyDAb32NyPqEIijsSCX5f197XWXhWrAIl051RAgexvNN8wF/uR2W+Gwq2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cd00892fd5bc1d36eb5b3d262db55d9bdb841b164b64f5b0bd24de66e4e671c","last_reissued_at":"2026-05-18T00:06:12.785531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:12.785531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.04564","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-18T00:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FxkZ6037yYLSEm+2WoVpjggbLIsfFBSdX0KB4TongX+smLB0gOXgTAmdciO6Tjd5FTovUoYou4K5TXjSeMbUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:26:14.752209Z"},"content_sha256":"1c7b8d429cbabcb3ab7de74954eb45ae7254daed47bb9857b35cebe492f262ad","schema_version":"1.0","event_id":"sha256:1c7b8d429cbabcb3ab7de74954eb45ae7254daed47bb9857b35cebe492f262ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BTIAREX5LPA5G3VVWPJGFW2V3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Selecting the best system and multi-armed bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.PR","authors_text":"Peter Glynn, Sandeep Juneja","submitted_at":"2015-07-16T13:33:13Z","abstract_excerpt":"Consider the problem of finding a population or a probability distribution amongst many with the largest mean when these means are unknown but population samples can be simulated or otherwise generated. Typically, by selecting largest sample mean population, it can be shown that false selection probability decays at an exponential rate. Lately, researchers have sought algorithms that guarantee that this probability is restricted to a small $\\delta$ in order $\\log(1/\\delta)$ computational time by estimating the associated large deviations rate function via simulation. We show that such guarante"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04564","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-18T00:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a2UMp6YpYJgXF/9tq1l+ma5jA2OG1S5WXQc2Ol//km9w3DGqnM3/fqFAD3gB8tuUfqvt17PpsUJq+g+qGkBnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:26:14.752577Z"},"content_sha256":"185b0dfed67cc92947afcb8fe1278e1b5033656d3ade7e5e758f06b0911b6883","schema_version":"1.0","event_id":"sha256:185b0dfed67cc92947afcb8fe1278e1b5033656d3ade7e5e758f06b0911b6883"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTIAREX5LPA5G3VVWPJGFW2V3G/bundle.json","state_url":"https://pith.science/pith/BTIAREX5LPA5G3VVWPJGFW2V3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTIAREX5LPA5G3VVWPJGFW2V3G/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-09T00:26:14Z","links":{"resolver":"https://pith.science/pith/BTIAREX5LPA5G3VVWPJGFW2V3G","bundle":"https://pith.science/pith/BTIAREX5LPA5G3VVWPJGFW2V3G/bundle.json","state":"https://pith.science/pith/BTIAREX5LPA5G3VVWPJGFW2V3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTIAREX5LPA5G3VVWPJGFW2V3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BTIAREX5LPA5G3VVWPJGFW2V3G","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":"9711b585798e91e3a4ca0f13ba3147d28e82eb9087153b80b5ab6c354006cda0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-16T13:33:13Z","title_canon_sha256":"2a4267c02d8c33d1a4ed7bdb6199a232db9cb1bed36610c77eb9733470836ae6"},"schema_version":"1.0","source":{"id":"1507.04564","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04564","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04564v3","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04564","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"BTIAREX5LPA5","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BTIAREX5LPA5G3VV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BTIAREX5","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:185b0dfed67cc92947afcb8fe1278e1b5033656d3ade7e5e758f06b0911b6883","target":"graph","created_at":"2026-05-18T00:06:12Z","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":"Consider the problem of finding a population or a probability distribution amongst many with the largest mean when these means are unknown but population samples can be simulated or otherwise generated. Typically, by selecting largest sample mean population, it can be shown that false selection probability decays at an exponential rate. Lately, researchers have sought algorithms that guarantee that this probability is restricted to a small $\\delta$ in order $\\log(1/\\delta)$ computational time by estimating the associated large deviations rate function via simulation. We show that such guarante","authors_text":"Peter Glynn, Sandeep Juneja","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-16T13:33:13Z","title":"Selecting the best system and multi-armed bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04564","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:1c7b8d429cbabcb3ab7de74954eb45ae7254daed47bb9857b35cebe492f262ad","target":"record","created_at":"2026-05-18T00:06:12Z","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":"9711b585798e91e3a4ca0f13ba3147d28e82eb9087153b80b5ab6c354006cda0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-16T13:33:13Z","title_canon_sha256":"2a4267c02d8c33d1a4ed7bdb6199a232db9cb1bed36610c77eb9733470836ae6"},"schema_version":"1.0","source":{"id":"1507.04564","kind":"arxiv","version":3}},"canonical_sha256":"0cd00892fd5bc1d36eb5b3d262db55d9bdb841b164b64f5b0bd24de66e4e671c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cd00892fd5bc1d36eb5b3d262db55d9bdb841b164b64f5b0bd24de66e4e671c","first_computed_at":"2026-05-18T00:06:12.785531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:12.785531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fWnpe6icF//pxR2uOv4q7rdQNySTyDAb32NyPqEIijsSCX5f197XWXhWrAIl051RAgexvNN8wF/uR2W+Gwq2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:12.786260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04564","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c7b8d429cbabcb3ab7de74954eb45ae7254daed47bb9857b35cebe492f262ad","sha256:185b0dfed67cc92947afcb8fe1278e1b5033656d3ade7e5e758f06b0911b6883"],"state_sha256":"70a61f69da85cd516cd70ddbffdc7404698b5a370c2943f510c989e14ee13541"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"82GtfIcP2sBhklRNpJGelegWBNQXa2ZjfWVGNhBr8m17HfAwF6KJxtoc6abbhZmvtu4rjsicDAS3BUXl4xcWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:26:14.754448Z","bundle_sha256":"9205888573aa10d7ae456748f3fcc1eedd3a4fe1017fc1b1dd9a0f54e18a4c94"}}