{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZWJDLNKDSLMHXYQ5LLTBONIT4A","short_pith_number":"pith:ZWJDLNKD","schema_version":"1.0","canonical_sha256":"cd9235b54392d87be21d5ae6173513e019390156f1ef82d58d3c6f0c329727ab","source":{"kind":"arxiv","id":"1704.06149","version":1},"attestation_state":"computed","paper":{"title":"Optimal Query Time for Encoding Range Majority","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Patrick K. Nicholson, Pawel Gawrychowski","submitted_at":"2017-04-20T14:03:31Z","abstract_excerpt":"We revisit the range $\\tau$-majority problem, which asks us to preprocess an array $A[1..n]$ for a fixed value of $\\tau \\in (0,1/2]$, such that for any query range $[i,j]$ we can return a position in $A$ of each distinct $\\tau$-majority element. A $\\tau$-majority element is one that has relative frequency at least $\\tau$ in the range $[i,j]$: i.e., frequency at least $\\tau (j-i+1)$. Belazzougui et al. [WADS 2013] presented a data structure that can answer such queries in $O(1/\\tau)$ time, which is optimal, but the space can be as much as $\\Theta(n \\lg n)$ bits. Recently, Navarro and Thankachan"},"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":"1704.06149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-20T14:03:31Z","cross_cats_sorted":[],"title_canon_sha256":"3f963f80e268deb716b0e9728c5e9a11b5a04fd29a097877ff386262375c2a12","abstract_canon_sha256":"42ada8a91321a15984560124735e6858e20fb3865a5ad24a0213b6cca3b0ad74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:03.156966Z","signature_b64":"A7nih3iTHXt0xdpSYbLtmX++uLamvjn2CC0lEtNwuBD1xWayjvlR77yphbwncAQymtigfuWyxZGu35Vw3vO4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd9235b54392d87be21d5ae6173513e019390156f1ef82d58d3c6f0c329727ab","last_reissued_at":"2026-05-18T00:46:03.156524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:03.156524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Query Time for Encoding Range Majority","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Patrick K. Nicholson, Pawel Gawrychowski","submitted_at":"2017-04-20T14:03:31Z","abstract_excerpt":"We revisit the range $\\tau$-majority problem, which asks us to preprocess an array $A[1..n]$ for a fixed value of $\\tau \\in (0,1/2]$, such that for any query range $[i,j]$ we can return a position in $A$ of each distinct $\\tau$-majority element. A $\\tau$-majority element is one that has relative frequency at least $\\tau$ in the range $[i,j]$: i.e., frequency at least $\\tau (j-i+1)$. Belazzougui et al. [WADS 2013] presented a data structure that can answer such queries in $O(1/\\tau)$ time, which is optimal, but the space can be as much as $\\Theta(n \\lg n)$ bits. Recently, Navarro and Thankachan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06149","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":"1704.06149","created_at":"2026-05-18T00:46:03.156597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.06149v1","created_at":"2026-05-18T00:46:03.156597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06149","created_at":"2026-05-18T00:46:03.156597+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWJDLNKDSLMH","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWJDLNKDSLMHXYQ5","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWJDLNKD","created_at":"2026-05-18T12:31:59.375834+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/ZWJDLNKDSLMHXYQ5LLTBONIT4A","json":"https://pith.science/pith/ZWJDLNKDSLMHXYQ5LLTBONIT4A.json","graph_json":"https://pith.science/api/pith-number/ZWJDLNKDSLMHXYQ5LLTBONIT4A/graph.json","events_json":"https://pith.science/api/pith-number/ZWJDLNKDSLMHXYQ5LLTBONIT4A/events.json","paper":"https://pith.science/paper/ZWJDLNKD"},"agent_actions":{"view_html":"https://pith.science/pith/ZWJDLNKDSLMHXYQ5LLTBONIT4A","download_json":"https://pith.science/pith/ZWJDLNKDSLMHXYQ5LLTBONIT4A.json","view_paper":"https://pith.science/paper/ZWJDLNKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.06149&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWJDLNKDSLMHXYQ5LLTBONIT4A/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWJDLNKDSLMHXYQ5LLTBONIT4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWJDLNKDSLMHXYQ5LLTBONIT4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWJDLNKDSLMHXYQ5LLTBONIT4A/action/storage_attestation","attest_author":"https://pith.science/pith/ZWJDLNKDSLMHXYQ5LLTBONIT4A/action/author_attestation","sign_citation":"https://pith.science/pith/ZWJDLNKDSLMHXYQ5LLTBONIT4A/action/citation_signature","submit_replication":"https://pith.science/pith/ZWJDLNKDSLMHXYQ5LLTBONIT4A/action/replication_record"}},"created_at":"2026-05-18T00:46:03.156597+00:00","updated_at":"2026-05-18T00:46:03.156597+00:00"}