{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:E4XFS7HY7WG3HLIK6EYT6V2NLJ","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":"e8d594bce000ec9b7f595ba6cba0203cdf4d136df5c7b4db8d74a26adf5f7ec1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-12T04:35:37Z","title_canon_sha256":"3963b8a8a8cdb9d00c2eb454d92aceb8b52fec8404d300e00dde27c9768399c7"},"schema_version":"1.0","source":{"id":"1407.3342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3342","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3342v1","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3342","created_at":"2026-05-18T02:47:43Z"},{"alias_kind":"pith_short_12","alias_value":"E4XFS7HY7WG3","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"E4XFS7HY7WG3HLIK","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"E4XFS7HY","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:7b26d3e1600023fbe10374939a29a8ad64ddfb0e1463ee6e318ab731d678dc86","target":"graph","created_at":"2026-05-18T02:47:43Z","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":"Given an unordered array of $N$ elements drawn from a totally ordered set and an integer $k$ in the range from $1$ to $N$, in the classic selection problem the task is to find the $k$-th smallest element in the array. We study the complexity of this problem in the space-restricted random-access model: The input array is stored on read-only memory, and the algorithm has access to a limited amount of workspace. We prove that the linear-time prune-and-search algorithm---presented in most textbooks on algorithms---can be modified to use $\\Theta(N)$ bits instead of $\\Theta(N)$ words of extra space.","authors_text":"Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-12T04:35:37Z","title":"Selection from read-only memory with limited workspace"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3342","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:4143614c6840334ac3c42ee0592a9796ac8046278f7691d69479edd0491c620b","target":"record","created_at":"2026-05-18T02:47:43Z","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":"e8d594bce000ec9b7f595ba6cba0203cdf4d136df5c7b4db8d74a26adf5f7ec1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-12T04:35:37Z","title_canon_sha256":"3963b8a8a8cdb9d00c2eb454d92aceb8b52fec8404d300e00dde27c9768399c7"},"schema_version":"1.0","source":{"id":"1407.3342","kind":"arxiv","version":1}},"canonical_sha256":"272e597cf8fd8db3ad0af1313f574d5a571cd062da1fa6ac5afe94dffed60d28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"272e597cf8fd8db3ad0af1313f574d5a571cd062da1fa6ac5afe94dffed60d28","first_computed_at":"2026-05-18T02:47:43.245156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:43.245156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WSMaXuNqhoEAQKbhXVLeDdSJu4bXKw1/Vh7N6hlXkXLGcqdLmtMn2mAsI+30672/nUzHg4U9oATG808n9F0tCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:43.246003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4143614c6840334ac3c42ee0592a9796ac8046278f7691d69479edd0491c620b","sha256:7b26d3e1600023fbe10374939a29a8ad64ddfb0e1463ee6e318ab731d678dc86"],"state_sha256":"4d9d4d41a27b00f5fe5e1546eef054b987df871758e95b682469fd007bd820e1"}