{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SZXBLHR7YQ7COL2HIAPTWUGTAI","short_pith_number":"pith:SZXBLHR7","schema_version":"1.0","canonical_sha256":"966e159e3fc43e272f47401f3b50d30213ac229dd8e8efd078fbd941e39b9d5e","source":{"kind":"arxiv","id":"1106.5076","version":3},"attestation_state":"computed","paper":{"title":"Dynamic Range Selection in Linear Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"J. Ian Munro, Meng He, Patrick K. Nicholson","submitted_at":"2011-06-24T22:27:37Z","abstract_excerpt":"Given a set $S$ of $n$ points in the plane, we consider the problem of answering range selection queries on $S$: that is, given an arbitrary $x$-range $Q$ and an integer $k > 0$, return the $k$-th smallest $y$-coordinate from the set of points that have $x$-coordinates in $Q$. We present a linear space data structure that maintains a dynamic set of $n$ points in the plane with real coordinates, and supports range selection queries in $O((\\lg n / \\lg \\lg n)^2)$ time, as well as insertions and deletions in $O((\\lg n / \\lg \\lg n)^2)$ amortized time. The space usage of this data structure is an $\\"},"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":"1106.5076","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-06-24T22:27:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f2d002f3d0607fbf0e1ec813ff594809ac8abbaec26f26f88fcca1051cf78275","abstract_canon_sha256":"ca0812876a5c1bde00108922c25eb9651b5c8e03a41d895ef003f3790a2412da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:20.946540Z","signature_b64":"9zBPSGRI5KvAu175l9TBHLPOT5JB/ARIZDZZ06+/oliLgdUGcTd6DtyUYXJT28XAGKgjaIaMLbCZFSZQPXUBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"966e159e3fc43e272f47401f3b50d30213ac229dd8e8efd078fbd941e39b9d5e","last_reissued_at":"2026-05-18T03:26:20.945815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:20.945815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Range Selection in Linear Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"J. Ian Munro, Meng He, Patrick K. Nicholson","submitted_at":"2011-06-24T22:27:37Z","abstract_excerpt":"Given a set $S$ of $n$ points in the plane, we consider the problem of answering range selection queries on $S$: that is, given an arbitrary $x$-range $Q$ and an integer $k > 0$, return the $k$-th smallest $y$-coordinate from the set of points that have $x$-coordinates in $Q$. We present a linear space data structure that maintains a dynamic set of $n$ points in the plane with real coordinates, and supports range selection queries in $O((\\lg n / \\lg \\lg n)^2)$ time, as well as insertions and deletions in $O((\\lg n / \\lg \\lg n)^2)$ amortized time. The space usage of this data structure is an $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5076","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":"1106.5076","created_at":"2026-05-18T03:26:20.945951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.5076v3","created_at":"2026-05-18T03:26:20.945951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5076","created_at":"2026-05-18T03:26:20.945951+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZXBLHR7YQ7C","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZXBLHR7YQ7COL2H","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZXBLHR7","created_at":"2026-05-18T12:26:41.206345+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/SZXBLHR7YQ7COL2HIAPTWUGTAI","json":"https://pith.science/pith/SZXBLHR7YQ7COL2HIAPTWUGTAI.json","graph_json":"https://pith.science/api/pith-number/SZXBLHR7YQ7COL2HIAPTWUGTAI/graph.json","events_json":"https://pith.science/api/pith-number/SZXBLHR7YQ7COL2HIAPTWUGTAI/events.json","paper":"https://pith.science/paper/SZXBLHR7"},"agent_actions":{"view_html":"https://pith.science/pith/SZXBLHR7YQ7COL2HIAPTWUGTAI","download_json":"https://pith.science/pith/SZXBLHR7YQ7COL2HIAPTWUGTAI.json","view_paper":"https://pith.science/paper/SZXBLHR7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.5076&json=true","fetch_graph":"https://pith.science/api/pith-number/SZXBLHR7YQ7COL2HIAPTWUGTAI/graph.json","fetch_events":"https://pith.science/api/pith-number/SZXBLHR7YQ7COL2HIAPTWUGTAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZXBLHR7YQ7COL2HIAPTWUGTAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZXBLHR7YQ7COL2HIAPTWUGTAI/action/storage_attestation","attest_author":"https://pith.science/pith/SZXBLHR7YQ7COL2HIAPTWUGTAI/action/author_attestation","sign_citation":"https://pith.science/pith/SZXBLHR7YQ7COL2HIAPTWUGTAI/action/citation_signature","submit_replication":"https://pith.science/pith/SZXBLHR7YQ7COL2HIAPTWUGTAI/action/replication_record"}},"created_at":"2026-05-18T03:26:20.945951+00:00","updated_at":"2026-05-18T03:26:20.945951+00:00"}