{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZP72KWT7NE5CQ5NISM5CR5ET5W","short_pith_number":"pith:ZP72KWT7","schema_version":"1.0","canonical_sha256":"cbffa55a7f693a2875a8933a28f493eda8b2c8fdc7856fdabd8b9d8413513a27","source":{"kind":"arxiv","id":"1707.00314","version":2},"attestation_state":"computed","paper":{"title":"On The Asymptotic Efficiency of Selection Procedures for Independent Gaussian Populations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Or Zuk, Royi Jacobovic","submitted_at":"2017-07-02T16:26:43Z","abstract_excerpt":"The field of discrete event simulation and optimization techniques motivates researchers to adjust classic ranking and selection (R&S) procedures to the settings where the number of populations is large. We use insights from extreme value theory in order to reveal the asymptotic properties of R&S procedures. Namely, we generalize the asymptotic result of Robbins and Siegmund regarding selection from independent Gaussian populations with known constant variance by their means to the case of selecting a subset of varying size out of a given set of populations. In addition, we revisit the problem"},"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":"1707.00314","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-02T16:26:43Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"f4ec17cb8d7c15209e0b2037fcbef9b038f2a1bc7f45a9cccccf5864845fb3df","abstract_canon_sha256":"426764cafea5456dc813e0a1f3836f150a9dd56025027ee6662f333ac450103c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:45.862819Z","signature_b64":"bTSDTOjIg/1Byzc6T8NCi8SYemvQc/rdI9q+7KoVvMaPchISQPkeZLcDq4v8DkyknjpE7Gj+oNJdGy++sUNQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbffa55a7f693a2875a8933a28f493eda8b2c8fdc7856fdabd8b9d8413513a27","last_reissued_at":"2026-05-18T00:29:45.862133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:45.862133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On The Asymptotic Efficiency of Selection Procedures for Independent Gaussian Populations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Or Zuk, Royi Jacobovic","submitted_at":"2017-07-02T16:26:43Z","abstract_excerpt":"The field of discrete event simulation and optimization techniques motivates researchers to adjust classic ranking and selection (R&S) procedures to the settings where the number of populations is large. We use insights from extreme value theory in order to reveal the asymptotic properties of R&S procedures. Namely, we generalize the asymptotic result of Robbins and Siegmund regarding selection from independent Gaussian populations with known constant variance by their means to the case of selecting a subset of varying size out of a given set of populations. In addition, we revisit the problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00314","kind":"arxiv","version":2},"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":"1707.00314","created_at":"2026-05-18T00:29:45.862247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00314v2","created_at":"2026-05-18T00:29:45.862247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00314","created_at":"2026-05-18T00:29:45.862247+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZP72KWT7NE5C","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZP72KWT7NE5CQ5NI","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZP72KWT7","created_at":"2026-05-18T12:31:59.375834+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/ZP72KWT7NE5CQ5NISM5CR5ET5W","json":"https://pith.science/pith/ZP72KWT7NE5CQ5NISM5CR5ET5W.json","graph_json":"https://pith.science/api/pith-number/ZP72KWT7NE5CQ5NISM5CR5ET5W/graph.json","events_json":"https://pith.science/api/pith-number/ZP72KWT7NE5CQ5NISM5CR5ET5W/events.json","paper":"https://pith.science/paper/ZP72KWT7"},"agent_actions":{"view_html":"https://pith.science/pith/ZP72KWT7NE5CQ5NISM5CR5ET5W","download_json":"https://pith.science/pith/ZP72KWT7NE5CQ5NISM5CR5ET5W.json","view_paper":"https://pith.science/paper/ZP72KWT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00314&json=true","fetch_graph":"https://pith.science/api/pith-number/ZP72KWT7NE5CQ5NISM5CR5ET5W/graph.json","fetch_events":"https://pith.science/api/pith-number/ZP72KWT7NE5CQ5NISM5CR5ET5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZP72KWT7NE5CQ5NISM5CR5ET5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZP72KWT7NE5CQ5NISM5CR5ET5W/action/storage_attestation","attest_author":"https://pith.science/pith/ZP72KWT7NE5CQ5NISM5CR5ET5W/action/author_attestation","sign_citation":"https://pith.science/pith/ZP72KWT7NE5CQ5NISM5CR5ET5W/action/citation_signature","submit_replication":"https://pith.science/pith/ZP72KWT7NE5CQ5NISM5CR5ET5W/action/replication_record"}},"created_at":"2026-05-18T00:29:45.862247+00:00","updated_at":"2026-05-18T00:29:45.862247+00:00"}