{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:32TNOPZUKAC5JDVNVQ7LUZQT5E","short_pith_number":"pith:32TNOPZU","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"},"canonical_sha256":"dea6d73f345005d48eadac3eba6613e904ebb3576e1631fdc6296f4b944c9788","source":{"kind":"arxiv","id":"1409.3600","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3600","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3600v3","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3600","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"pith_short_12","alias_value":"32TNOPZUKAC5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"32TNOPZUKAC5JDVN","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"32TNOPZU","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:32TNOPZUKAC5JDVNVQ7LUZQT5E","target":"record","payload":{"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"},"canonical_sha256":"dea6d73f345005d48eadac3eba6613e904ebb3576e1631fdc6296f4b944c9788","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"},"source_kind":"arxiv","source_id":"1409.3600","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-17T23:49:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aqcgvwQOyJnOXDhA7JxQ+RVf/aPEfxyv4Dn5nzxZK6T+4VW1by4gbJI4/bigQ/vURPTvwFx5uAFe0Qn8f+hyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:29:37.697923Z"},"content_sha256":"f3e704425def72b178653fe0fd473c6c67d983121394d06037d5331a058051d0","schema_version":"1.0","event_id":"sha256:f3e704425def72b178653fe0fd473c6c67d983121394d06037d5331a058051d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:32TNOPZUKAC5JDVNVQ7LUZQT5E","target":"graph","payload":{"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"},"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:49:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qIdr5Zb6MQWEPSHnQfaH/2wSrh9S/zjDNYfzMA+IEDE9yQJcA4wYLtnSuSuUS0Qpu7l0KBmc2byr6Vc0nolECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:29:37.698278Z"},"content_sha256":"079fa87c85b06f8eef47a12d29eb4840783c32ebbd19d68cfd4ad5f8cd37b673","schema_version":"1.0","event_id":"sha256:079fa87c85b06f8eef47a12d29eb4840783c32ebbd19d68cfd4ad5f8cd37b673"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E/bundle.json","state_url":"https://pith.science/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E/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-03T20:29:37Z","links":{"resolver":"https://pith.science/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E","bundle":"https://pith.science/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E/bundle.json","state":"https://pith.science/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32TNOPZUKAC5JDVNVQ7LUZQT5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:32TNOPZUKAC5JDVNVQ7LUZQT5E","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":"cd9324cb497edc77b13efd65ef6cb8707689d8507fdc5a12cc9cfc119064c60a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-11T21:18:21Z","title_canon_sha256":"81cb58342d7f640ae36cfb2d1dba112e0ddace8dcabdad6d5df87949717bd6a3"},"schema_version":"1.0","source":{"id":"1409.3600","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3600","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3600v3","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3600","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"pith_short_12","alias_value":"32TNOPZUKAC5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"32TNOPZUKAC5JDVN","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"32TNOPZU","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:079fa87c85b06f8eef47a12d29eb4840783c32ebbd19d68cfd4ad5f8cd37b673","target":"graph","created_at":"2026-05-17T23:49:18Z","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":"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 ","authors_text":"Adrian Dumitrescu, Ke Chen","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-11T21:18:21Z","title":"Selection Algorithms with Small Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3600","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:f3e704425def72b178653fe0fd473c6c67d983121394d06037d5331a058051d0","target":"record","created_at":"2026-05-17T23:49:18Z","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":"cd9324cb497edc77b13efd65ef6cb8707689d8507fdc5a12cc9cfc119064c60a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-11T21:18:21Z","title_canon_sha256":"81cb58342d7f640ae36cfb2d1dba112e0ddace8dcabdad6d5df87949717bd6a3"},"schema_version":"1.0","source":{"id":"1409.3600","kind":"arxiv","version":3}},"canonical_sha256":"dea6d73f345005d48eadac3eba6613e904ebb3576e1631fdc6296f4b944c9788","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dea6d73f345005d48eadac3eba6613e904ebb3576e1631fdc6296f4b944c9788","first_computed_at":"2026-05-17T23:49:18.214024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:18.214024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"egiiAQGWz++VFIj9/4Pb1mBJG7yXwp11YTZZyd7p0mmKJ1evI1ljiCpmDN2MDo99sJtNa7oz0HwKxET+MiQyCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:18.214638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3600","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3e704425def72b178653fe0fd473c6c67d983121394d06037d5331a058051d0","sha256:079fa87c85b06f8eef47a12d29eb4840783c32ebbd19d68cfd4ad5f8cd37b673"],"state_sha256":"b5027034505c6d0c46fabd3b00af69da6f80d206e95bff4d494f8a124b68d0e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6LxZ0wHGG/K7RqCZDogI5M0BYZHHnyUeXVsswLJ+MxybEOyIZCoKC6DCoo1Svb4shji07LSBHH7aWeeeMV1zBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:29:37.700348Z","bundle_sha256":"2d4214b20f485a6a60e7ba9f9bc4b92c3bcfd7943ecc41ce9ee83703112e38d4"}}