{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:32TNOPZUKAC5JDVNVQ7LUZQT5E","short_pith_number":"pith:32TNOPZU","schema_version":"1.0","canonical_sha256":"dea6d73f345005d48eadac3eba6613e904ebb3576e1631fdc6296f4b944c9788","source":{"kind":"arxiv","id":"1409.3600","version":3},"attestation_state":"computed","paper":{"title":"Selection Algorithms with Small Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Adrian Dumitrescu, Ke Chen","submitted_at":"2014-09-11T21:18:21Z","abstract_excerpt":"We revisit the selection problem, namely that of computing the $i$th order statistic of $n$ given elements, in particular the classic deterministic algorithm by grouping and partition due to Blum, Floyd, Pratt, Rivest, and Tarjan (1973). Whereas the original algorithm uses groups of odd size at least $5$ and runs in linear time, it has been perpetuated in the literature that using smaller group sizes will force the worst-case running time to become superlinear, namely $\\Omega(n \\log{n})$. We first point out that the usual arguments found in the literature justifying the superlinear worst-case "},"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":"1409.3600","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-11T21:18:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"81cb58342d7f640ae36cfb2d1dba112e0ddace8dcabdad6d5df87949717bd6a3","abstract_canon_sha256":"cd9324cb497edc77b13efd65ef6cb8707689d8507fdc5a12cc9cfc119064c60a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:18.214638Z","signature_b64":"egiiAQGWz++VFIj9/4Pb1mBJG7yXwp11YTZZyd7p0mmKJ1evI1ljiCpmDN2MDo99sJtNa7oz0HwKxET+MiQyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dea6d73f345005d48eadac3eba6613e904ebb3576e1631fdc6296f4b944c9788","last_reissued_at":"2026-05-17T23:49:18.214024Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:18.214024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selection Algorithms with Small Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Adrian Dumitrescu, Ke Chen","submitted_at":"2014-09-11T21:18:21Z","abstract_excerpt":"We revisit the selection problem, namely that of computing the $i$th order statistic of $n$ given elements, in particular the classic deterministic algorithm by grouping and partition due to Blum, Floyd, Pratt, Rivest, and Tarjan (1973). Whereas the original algorithm uses groups of odd size at least $5$ and runs in linear time, it has been perpetuated in the literature that using smaller group sizes will force the worst-case running time to become superlinear, namely $\\Omega(n \\log{n})$. We first point out that the usual arguments found in the literature justifying the superlinear worst-case "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3600","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":"1409.3600","created_at":"2026-05-17T23:49:18.214107+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.3600v3","created_at":"2026-05-17T23:49:18.214107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3600","created_at":"2026-05-17T23:49:18.214107+00:00"},{"alias_kind":"pith_short_12","alias_value":"32TNOPZUKAC5","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"32TNOPZUKAC5JDVN","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"32TNOPZU","created_at":"2026-05-18T12:28:11.866339+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/32TNOPZUKAC5JDVNVQ7LUZQT5E","json":"https://pith.science/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E.json","graph_json":"https://pith.science/api/pith-number/32TNOPZUKAC5JDVNVQ7LUZQT5E/graph.json","events_json":"https://pith.science/api/pith-number/32TNOPZUKAC5JDVNVQ7LUZQT5E/events.json","paper":"https://pith.science/paper/32TNOPZU"},"agent_actions":{"view_html":"https://pith.science/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E","download_json":"https://pith.science/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E.json","view_paper":"https://pith.science/paper/32TNOPZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.3600&json=true","fetch_graph":"https://pith.science/api/pith-number/32TNOPZUKAC5JDVNVQ7LUZQT5E/graph.json","fetch_events":"https://pith.science/api/pith-number/32TNOPZUKAC5JDVNVQ7LUZQT5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E/action/storage_attestation","attest_author":"https://pith.science/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E/action/author_attestation","sign_citation":"https://pith.science/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E/action/citation_signature","submit_replication":"https://pith.science/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E/action/replication_record"}},"created_at":"2026-05-17T23:49:18.214107+00:00","updated_at":"2026-05-17T23:49:18.214107+00:00"}