{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:E4XFS7HY7WG3HLIK6EYT6V2NLJ","short_pith_number":"pith:E4XFS7HY","schema_version":"1.0","canonical_sha256":"272e597cf8fd8db3ad0af1313f574d5a571cd062da1fa6ac5afe94dffed60d28","source":{"kind":"arxiv","id":"1407.3342","version":1},"attestation_state":"computed","paper":{"title":"Selection from read-only memory with limited workspace","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti","submitted_at":"2014-07-12T04:35:37Z","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."},"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":"1407.3342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-12T04:35:37Z","cross_cats_sorted":[],"title_canon_sha256":"3963b8a8a8cdb9d00c2eb454d92aceb8b52fec8404d300e00dde27c9768399c7","abstract_canon_sha256":"e8d594bce000ec9b7f595ba6cba0203cdf4d136df5c7b4db8d74a26adf5f7ec1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:43.246003Z","signature_b64":"WSMaXuNqhoEAQKbhXVLeDdSJu4bXKw1/Vh7N6hlXkXLGcqdLmtMn2mAsI+30672/nUzHg4U9oATG808n9F0tCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"272e597cf8fd8db3ad0af1313f574d5a571cd062da1fa6ac5afe94dffed60d28","last_reissued_at":"2026-05-18T02:47:43.245156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:43.245156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selection from read-only memory with limited workspace","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti","submitted_at":"2014-07-12T04:35:37Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3342","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.3342","created_at":"2026-05-18T02:47:43.245297+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3342v1","created_at":"2026-05-18T02:47:43.245297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3342","created_at":"2026-05-18T02:47:43.245297+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4XFS7HY7WG3","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4XFS7HY7WG3HLIK","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4XFS7HY","created_at":"2026-05-18T12:28:25.294606+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/E4XFS7HY7WG3HLIK6EYT6V2NLJ","json":"https://pith.science/pith/E4XFS7HY7WG3HLIK6EYT6V2NLJ.json","graph_json":"https://pith.science/api/pith-number/E4XFS7HY7WG3HLIK6EYT6V2NLJ/graph.json","events_json":"https://pith.science/api/pith-number/E4XFS7HY7WG3HLIK6EYT6V2NLJ/events.json","paper":"https://pith.science/paper/E4XFS7HY"},"agent_actions":{"view_html":"https://pith.science/pith/E4XFS7HY7WG3HLIK6EYT6V2NLJ","download_json":"https://pith.science/pith/E4XFS7HY7WG3HLIK6EYT6V2NLJ.json","view_paper":"https://pith.science/paper/E4XFS7HY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3342&json=true","fetch_graph":"https://pith.science/api/pith-number/E4XFS7HY7WG3HLIK6EYT6V2NLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/E4XFS7HY7WG3HLIK6EYT6V2NLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4XFS7HY7WG3HLIK6EYT6V2NLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4XFS7HY7WG3HLIK6EYT6V2NLJ/action/storage_attestation","attest_author":"https://pith.science/pith/E4XFS7HY7WG3HLIK6EYT6V2NLJ/action/author_attestation","sign_citation":"https://pith.science/pith/E4XFS7HY7WG3HLIK6EYT6V2NLJ/action/citation_signature","submit_replication":"https://pith.science/pith/E4XFS7HY7WG3HLIK6EYT6V2NLJ/action/replication_record"}},"created_at":"2026-05-18T02:47:43.245297+00:00","updated_at":"2026-05-18T02:47:43.245297+00:00"}