{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZITABFEAJKLPV3W36JWW5XTLFQ","short_pith_number":"pith:ZITABFEA","canonical_record":{"source":{"id":"1811.12183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-26T14:33:56Z","cross_cats_sorted":["cs.SY","eess.SP"],"title_canon_sha256":"b1b137ad4e3b3abcd2eeb8e8b8c67443fb0c26f7bd751d0881bee9aac081b1f0","abstract_canon_sha256":"ff3605b97e467e4a72c9e26c8a4934a89d50697c7460109d816a2f5063b3c4db"},"schema_version":"1.0"},"canonical_sha256":"ca260094804a96faeedbf26d6ede6b2c33900ad8df1e1255548373417ea1e973","source":{"kind":"arxiv","id":"1811.12183","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12183","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12183v1","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12183","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZITABFEAJKLP","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZITABFEAJKLPV3W3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZITABFEA","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZITABFEAJKLPV3W36JWW5XTLFQ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.12183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-26T14:33:56Z","cross_cats_sorted":["cs.SY","eess.SP"],"title_canon_sha256":"b1b137ad4e3b3abcd2eeb8e8b8c67443fb0c26f7bd751d0881bee9aac081b1f0","abstract_canon_sha256":"ff3605b97e467e4a72c9e26c8a4934a89d50697c7460109d816a2f5063b3c4db"},"schema_version":"1.0"},"canonical_sha256":"ca260094804a96faeedbf26d6ede6b2c33900ad8df1e1255548373417ea1e973","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:34.163779Z","signature_b64":"dGWmxoTAGIOy6k+sQz2G1QUifbqMZ14hqafR6xzrApMgt99qLWLtNIWrkyjQdCrJsQdv/yGUi2lFp9pF3zm6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca260094804a96faeedbf26d6ede6b2c33900ad8df1e1255548373417ea1e973","last_reissued_at":"2026-05-17T23:59:34.162851Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:34.162851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.12183","source_version":1,"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-17T23:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xHseEW1GcfJYcujk8amXa/YIKRCyoeS3t2SNZJh/0mAfzkCqONfWy8c6FQHDmtT34BCH9M1rnyPClGWiEDWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:10:56.403342Z"},"content_sha256":"b8969d08ca5a05a9d3dd6829d44cc502f0605fd3b42ce74831d21ffcc4219297","schema_version":"1.0","event_id":"sha256:b8969d08ca5a05a9d3dd6829d44cc502f0605fd3b42ce74831d21ffcc4219297"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZITABFEAJKLPV3W36JWW5XTLFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analyzing and provably improving fixed budget ranking and selection algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SP"],"primary_cat":"math.OC","authors_text":"Di Wu, Enlu Zhou","submitted_at":"2018-11-26T14:33:56Z","abstract_excerpt":"This paper studies the fixed budget formulation of the Ranking and Selection (R&S) problem with independent normal samples, where the goal is to investigate different algorithms' convergence rate in terms of their resulting probability of false selection (PFS). First, we reveal that for the well-known Optimal Computing Budget Allocation (OCBA) algorithm and its two variants, a constant initial sample size (independent of the total budget) only amounts to a sub-exponential (or even polynomial) convergence rate. After that, a modification is proposed to achieve an exponential convergence rate, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12183","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"},"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-17T23:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hC+Vo3s19DkKAiZfYdeDtxLDUMdnrs05XDAjr/EpthMaN05yplTDpLjZIFscMcikzQCc9yu2OAD09sJNBaETAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:10:56.403847Z"},"content_sha256":"0f1e81ee1e972bd55dd4008348606f3415884aea620b16475470a3aa4d5f7215","schema_version":"1.0","event_id":"sha256:0f1e81ee1e972bd55dd4008348606f3415884aea620b16475470a3aa4d5f7215"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZITABFEAJKLPV3W36JWW5XTLFQ/bundle.json","state_url":"https://pith.science/pith/ZITABFEAJKLPV3W36JWW5XTLFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZITABFEAJKLPV3W36JWW5XTLFQ/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-05-27T02:10:56Z","links":{"resolver":"https://pith.science/pith/ZITABFEAJKLPV3W36JWW5XTLFQ","bundle":"https://pith.science/pith/ZITABFEAJKLPV3W36JWW5XTLFQ/bundle.json","state":"https://pith.science/pith/ZITABFEAJKLPV3W36JWW5XTLFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZITABFEAJKLPV3W36JWW5XTLFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZITABFEAJKLPV3W36JWW5XTLFQ","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":"ff3605b97e467e4a72c9e26c8a4934a89d50697c7460109d816a2f5063b3c4db","cross_cats_sorted":["cs.SY","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-26T14:33:56Z","title_canon_sha256":"b1b137ad4e3b3abcd2eeb8e8b8c67443fb0c26f7bd751d0881bee9aac081b1f0"},"schema_version":"1.0","source":{"id":"1811.12183","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12183","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12183v1","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12183","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZITABFEAJKLP","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZITABFEAJKLPV3W3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZITABFEA","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:0f1e81ee1e972bd55dd4008348606f3415884aea620b16475470a3aa4d5f7215","target":"graph","created_at":"2026-05-17T23:59:34Z","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":"This paper studies the fixed budget formulation of the Ranking and Selection (R&S) problem with independent normal samples, where the goal is to investigate different algorithms' convergence rate in terms of their resulting probability of false selection (PFS). First, we reveal that for the well-known Optimal Computing Budget Allocation (OCBA) algorithm and its two variants, a constant initial sample size (independent of the total budget) only amounts to a sub-exponential (or even polynomial) convergence rate. After that, a modification is proposed to achieve an exponential convergence rate, w","authors_text":"Di Wu, Enlu Zhou","cross_cats":["cs.SY","eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-26T14:33:56Z","title":"Analyzing and provably improving fixed budget ranking and selection algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12183","kind":"arxiv","version":1},"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:b8969d08ca5a05a9d3dd6829d44cc502f0605fd3b42ce74831d21ffcc4219297","target":"record","created_at":"2026-05-17T23:59:34Z","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":"ff3605b97e467e4a72c9e26c8a4934a89d50697c7460109d816a2f5063b3c4db","cross_cats_sorted":["cs.SY","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-26T14:33:56Z","title_canon_sha256":"b1b137ad4e3b3abcd2eeb8e8b8c67443fb0c26f7bd751d0881bee9aac081b1f0"},"schema_version":"1.0","source":{"id":"1811.12183","kind":"arxiv","version":1}},"canonical_sha256":"ca260094804a96faeedbf26d6ede6b2c33900ad8df1e1255548373417ea1e973","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca260094804a96faeedbf26d6ede6b2c33900ad8df1e1255548373417ea1e973","first_computed_at":"2026-05-17T23:59:34.162851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:34.162851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dGWmxoTAGIOy6k+sQz2G1QUifbqMZ14hqafR6xzrApMgt99qLWLtNIWrkyjQdCrJsQdv/yGUi2lFp9pF3zm6BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:34.163779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.12183","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8969d08ca5a05a9d3dd6829d44cc502f0605fd3b42ce74831d21ffcc4219297","sha256:0f1e81ee1e972bd55dd4008348606f3415884aea620b16475470a3aa4d5f7215"],"state_sha256":"4a8a0a18044e2922316fb7a7e76dad6ea41ff160c3845b9672a193cbad554c21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k39Yx898QaCmjG7v9PLFtka+DxnAIuSuO7RIecSbt37wPCUIWAnngnn2pLRbTI3HipnMGYx1vvzE+ki+MCRhDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:10:56.406871Z","bundle_sha256":"5be7d0fc05277bb8fc8b2fcf2afd4016cb7c4df222b63bb54ed88120e12a0edf"}}