{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WG3LDSBKHDZOCWGDOMX6MC2BAQ","short_pith_number":"pith:WG3LDSBK","schema_version":"1.0","canonical_sha256":"b1b6b1c82a38f2e158c3732fe60b410405b200beea6c84307f8a2302674ac6be","source":{"kind":"arxiv","id":"1806.01804","version":2},"attestation_state":"computed","paper":{"title":"Tree Path Majority 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":"2018-06-05T16:53:02Z","abstract_excerpt":"We present the first solution to $\\tau$-majorities on tree paths. Given a tree of $n$ nodes, each with a label from $[1..\\sigma]$, and a fixed threshold $0<\\tau<1$, such a query gives two nodes $u$ and $v$ and asks for all the labels that appear more than $\\tau \\cdot |P_{uv}|$ times in the path $P_{uv}$ from $u$ to $v$, where $|P_{uv}|$ denotes the number of nodes in $P_{uv}$. Note that the answer to any query is of size up to $1/\\tau$. On a $w$-bit RAM, we obtain a linear-space data structure with $O((1/\\tau)\\log^* n \\log\\log_w \\sigma)$ query time. For any $\\kappa > 1$, we can also build a st"},"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":"1806.01804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T16:53:02Z","cross_cats_sorted":[],"title_canon_sha256":"c7dbdb31625671a127010b3ff85f58348921c45546373efca6b588e890b59efd","abstract_canon_sha256":"0059a63ee13b88ee7c129e7e73e4af0aec8b4f03d107afdf878cb396badc8173"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:20.170621Z","signature_b64":"z+xZMMSU2HhcTPIYXRt7uOlUp2/K6GudaEICo2xlA98IQwWDsRRI+2AftYWUODnkA38ShdhjsKyAXeoOPqvPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1b6b1c82a38f2e158c3732fe60b410405b200beea6c84307f8a2302674ac6be","last_reissued_at":"2026-05-18T00:06:20.170081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:20.170081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree Path Majority 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":"2018-06-05T16:53:02Z","abstract_excerpt":"We present the first solution to $\\tau$-majorities on tree paths. Given a tree of $n$ nodes, each with a label from $[1..\\sigma]$, and a fixed threshold $0<\\tau<1$, such a query gives two nodes $u$ and $v$ and asks for all the labels that appear more than $\\tau \\cdot |P_{uv}|$ times in the path $P_{uv}$ from $u$ to $v$, where $|P_{uv}|$ denotes the number of nodes in $P_{uv}$. Note that the answer to any query is of size up to $1/\\tau$. On a $w$-bit RAM, we obtain a linear-space data structure with $O((1/\\tau)\\log^* n \\log\\log_w \\sigma)$ query time. For any $\\kappa > 1$, we can also build a st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01804","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":"1806.01804","created_at":"2026-05-18T00:06:20.170163+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01804v2","created_at":"2026-05-18T00:06:20.170163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01804","created_at":"2026-05-18T00:06:20.170163+00:00"},{"alias_kind":"pith_short_12","alias_value":"WG3LDSBKHDZO","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WG3LDSBKHDZOCWGD","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WG3LDSBK","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/WG3LDSBKHDZOCWGDOMX6MC2BAQ","json":"https://pith.science/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ.json","graph_json":"https://pith.science/api/pith-number/WG3LDSBKHDZOCWGDOMX6MC2BAQ/graph.json","events_json":"https://pith.science/api/pith-number/WG3LDSBKHDZOCWGDOMX6MC2BAQ/events.json","paper":"https://pith.science/paper/WG3LDSBK"},"agent_actions":{"view_html":"https://pith.science/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ","download_json":"https://pith.science/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ.json","view_paper":"https://pith.science/paper/WG3LDSBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01804&json=true","fetch_graph":"https://pith.science/api/pith-number/WG3LDSBKHDZOCWGDOMX6MC2BAQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WG3LDSBKHDZOCWGDOMX6MC2BAQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ/action/storage_attestation","attest_author":"https://pith.science/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ/action/author_attestation","sign_citation":"https://pith.science/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ/action/citation_signature","submit_replication":"https://pith.science/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ/action/replication_record"}},"created_at":"2026-05-18T00:06:20.170163+00:00","updated_at":"2026-05-18T00:06:20.170163+00:00"}