{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PRYFITAFLUJQVAOQULLYQZB7L6","short_pith_number":"pith:PRYFITAF","schema_version":"1.0","canonical_sha256":"7c70544c055d130a81d0a2d788643f5fa979c0eba98be323555cdd9a8779f76d","source":{"kind":"arxiv","id":"1611.01835","version":2},"attestation_state":"computed","paper":{"title":"Compressed Dynamic Range Majority and Minority Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, Meng He, Travis Gagie","submitted_at":"2016-11-06T20:07:59Z","abstract_excerpt":"In the range $\\alpha$-majority query problem, we are given a sequence $S[1..n]$ and a fixed threshold $\\alpha \\in (0, 1)$, and are asked to preprocess $S$ such that, given a query range $[i..j]$, we can efficiently report the symbols that occur more than $\\alpha (j-i+1)$ times in $S[i..j]$, which are called the range $\\alpha$-majorities. In this article we first describe a dynamic data structure that represents $S$ in compressed space --- $nH_k+ o(n\\lg \\sigma)$ bits for any $k = o(\\log_{\\sigma} n)$, where $\\sigma$ is the alphabet size and $H_k \\le H_0 \\le \\lg\\sigma $ is the $k$-th order empiri"},"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":"1611.01835","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-06T20:07:59Z","cross_cats_sorted":[],"title_canon_sha256":"54c07dfe6576c9d760344284314d829beeddab2bb6e5bf9e8b4bc7f9b09871f2","abstract_canon_sha256":"48f4be78b221e26a3244ef04c0c9ece684c08d7f6011862260b8e043f1e854d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:10.648257Z","signature_b64":"bmrkhcjSN/bRHDP11UfqYaOHXkWO4rTUrHLiCcMGI0msN21tBfp/biHurcc1iewwOp1jVHtoLWJq1mE1se3qDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c70544c055d130a81d0a2d788643f5fa979c0eba98be323555cdd9a8779f76d","last_reissued_at":"2026-05-18T00:15:10.647480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:10.647480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Dynamic Range Majority and Minority Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gonzalo Navarro, Meng He, Travis Gagie","submitted_at":"2016-11-06T20:07:59Z","abstract_excerpt":"In the range $\\alpha$-majority query problem, we are given a sequence $S[1..n]$ and a fixed threshold $\\alpha \\in (0, 1)$, and are asked to preprocess $S$ such that, given a query range $[i..j]$, we can efficiently report the symbols that occur more than $\\alpha (j-i+1)$ times in $S[i..j]$, which are called the range $\\alpha$-majorities. In this article we first describe a dynamic data structure that represents $S$ in compressed space --- $nH_k+ o(n\\lg \\sigma)$ bits for any $k = o(\\log_{\\sigma} n)$, where $\\sigma$ is the alphabet size and $H_k \\le H_0 \\le \\lg\\sigma $ is the $k$-th order empiri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01835","kind":"arxiv","version":2},"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":"1611.01835","created_at":"2026-05-18T00:15:10.647617+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01835v2","created_at":"2026-05-18T00:15:10.647617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01835","created_at":"2026-05-18T00:15:10.647617+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRYFITAFLUJQ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRYFITAFLUJQVAOQ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRYFITAF","created_at":"2026-05-18T12:30:39.010887+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/PRYFITAFLUJQVAOQULLYQZB7L6","json":"https://pith.science/pith/PRYFITAFLUJQVAOQULLYQZB7L6.json","graph_json":"https://pith.science/api/pith-number/PRYFITAFLUJQVAOQULLYQZB7L6/graph.json","events_json":"https://pith.science/api/pith-number/PRYFITAFLUJQVAOQULLYQZB7L6/events.json","paper":"https://pith.science/paper/PRYFITAF"},"agent_actions":{"view_html":"https://pith.science/pith/PRYFITAFLUJQVAOQULLYQZB7L6","download_json":"https://pith.science/pith/PRYFITAFLUJQVAOQULLYQZB7L6.json","view_paper":"https://pith.science/paper/PRYFITAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01835&json=true","fetch_graph":"https://pith.science/api/pith-number/PRYFITAFLUJQVAOQULLYQZB7L6/graph.json","fetch_events":"https://pith.science/api/pith-number/PRYFITAFLUJQVAOQULLYQZB7L6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRYFITAFLUJQVAOQULLYQZB7L6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRYFITAFLUJQVAOQULLYQZB7L6/action/storage_attestation","attest_author":"https://pith.science/pith/PRYFITAFLUJQVAOQULLYQZB7L6/action/author_attestation","sign_citation":"https://pith.science/pith/PRYFITAFLUJQVAOQULLYQZB7L6/action/citation_signature","submit_replication":"https://pith.science/pith/PRYFITAFLUJQVAOQULLYQZB7L6/action/replication_record"}},"created_at":"2026-05-18T00:15:10.647617+00:00","updated_at":"2026-05-18T00:15:10.647617+00:00"}