{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VYCW7Y5IKB6TRNKBQAKGDVGVLN","short_pith_number":"pith:VYCW7Y5I","schema_version":"1.0","canonical_sha256":"ae056fe3a8507d38b541801461d4d55b74ceccaf138418cbbe1f8b297316b632","source":{"kind":"arxiv","id":"1807.03827","version":1},"attestation_state":"computed","paper":{"title":"Improved Time and Space Bounds for Dynamic Range Mode","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bryce Sandlund, Hicham El-Zein, J. Ian Munro, Meng He","submitted_at":"2018-07-10T19:00:45Z","abstract_excerpt":"Given an array A of $n$ elements, we wish to support queries for the most frequent and least frequent element in a subrange $[l, r]$ of $A$. We also wish to support updates that change a particular element at index $i$ or insert/ delete an element at index $i$. For the range mode problem, our data structure supports all operations in $O(n^{2/3})$ deterministic time using only $O(n)$ space. This improves two results by Chan et al. \\cite{C14}: a linear space data structure supporting update and query operations in $\\tilde{O}(n^{3/4})$ time and an $O(n^{4/3})$ space data structure supporting upda"},"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":"1807.03827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T19:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"2f669b25b5ae8645a29a8aed035329e65c6c5144cec6db727d7894e8337c48f5","abstract_canon_sha256":"bd54a9ba4c65fea298662bfcab4929bb49c340d4b66d7b7e48ee617452f126e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:58.949268Z","signature_b64":"75u72sf68UU2M+f/iESjue68MOPYXvPyR2dYTuVLniQ7lUEcS0rXq6fzOdepk2pts1/RvtHDd1J+ofT4Gq+rDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae056fe3a8507d38b541801461d4d55b74ceccaf138418cbbe1f8b297316b632","last_reissued_at":"2026-05-18T00:10:58.948442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:58.948442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Time and Space Bounds for Dynamic Range Mode","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bryce Sandlund, Hicham El-Zein, J. Ian Munro, Meng He","submitted_at":"2018-07-10T19:00:45Z","abstract_excerpt":"Given an array A of $n$ elements, we wish to support queries for the most frequent and least frequent element in a subrange $[l, r]$ of $A$. We also wish to support updates that change a particular element at index $i$ or insert/ delete an element at index $i$. For the range mode problem, our data structure supports all operations in $O(n^{2/3})$ deterministic time using only $O(n)$ space. This improves two results by Chan et al. \\cite{C14}: a linear space data structure supporting update and query operations in $\\tilde{O}(n^{3/4})$ time and an $O(n^{4/3})$ space data structure supporting upda"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03827","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":"1807.03827","created_at":"2026-05-18T00:10:58.948580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03827v1","created_at":"2026-05-18T00:10:58.948580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03827","created_at":"2026-05-18T00:10:58.948580+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYCW7Y5IKB6T","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYCW7Y5IKB6TRNKB","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYCW7Y5I","created_at":"2026-05-18T12:32:59.047623+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/VYCW7Y5IKB6TRNKBQAKGDVGVLN","json":"https://pith.science/pith/VYCW7Y5IKB6TRNKBQAKGDVGVLN.json","graph_json":"https://pith.science/api/pith-number/VYCW7Y5IKB6TRNKBQAKGDVGVLN/graph.json","events_json":"https://pith.science/api/pith-number/VYCW7Y5IKB6TRNKBQAKGDVGVLN/events.json","paper":"https://pith.science/paper/VYCW7Y5I"},"agent_actions":{"view_html":"https://pith.science/pith/VYCW7Y5IKB6TRNKBQAKGDVGVLN","download_json":"https://pith.science/pith/VYCW7Y5IKB6TRNKBQAKGDVGVLN.json","view_paper":"https://pith.science/paper/VYCW7Y5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03827&json=true","fetch_graph":"https://pith.science/api/pith-number/VYCW7Y5IKB6TRNKBQAKGDVGVLN/graph.json","fetch_events":"https://pith.science/api/pith-number/VYCW7Y5IKB6TRNKBQAKGDVGVLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYCW7Y5IKB6TRNKBQAKGDVGVLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYCW7Y5IKB6TRNKBQAKGDVGVLN/action/storage_attestation","attest_author":"https://pith.science/pith/VYCW7Y5IKB6TRNKBQAKGDVGVLN/action/author_attestation","sign_citation":"https://pith.science/pith/VYCW7Y5IKB6TRNKBQAKGDVGVLN/action/citation_signature","submit_replication":"https://pith.science/pith/VYCW7Y5IKB6TRNKBQAKGDVGVLN/action/replication_record"}},"created_at":"2026-05-18T00:10:58.948580+00:00","updated_at":"2026-05-18T00:10:58.948580+00:00"}