{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WG3LDSBKHDZOCWGDOMX6MC2BAQ","short_pith_number":"pith:WG3LDSBK","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"},"canonical_sha256":"b1b6b1c82a38f2e158c3732fe60b410405b200beea6c84307f8a2302674ac6be","source":{"kind":"arxiv","id":"1806.01804","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01804","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01804v2","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01804","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"WG3LDSBKHDZO","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WG3LDSBKHDZOCWGD","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WG3LDSBK","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WG3LDSBKHDZOCWGDOMX6MC2BAQ","target":"record","payload":{"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"},"canonical_sha256":"b1b6b1c82a38f2e158c3732fe60b410405b200beea6c84307f8a2302674ac6be","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"},"source_kind":"arxiv","source_id":"1806.01804","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ysVYAst4CoLq8TNiaLz9kTNQaARNJ8+lUaiBcPO+erdHC0BWf3xL9M4grWHGO4kXQfGdaQ/c/s3rSoFSSGlHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:59:10.354413Z"},"content_sha256":"9d455dc61cf4ce0e9774bd0cda13f2131b3b4f1577f016c4233e605fa4c73fb8","schema_version":"1.0","event_id":"sha256:9d455dc61cf4ce0e9774bd0cda13f2131b3b4f1577f016c4233e605fa4c73fb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WG3LDSBKHDZOCWGDOMX6MC2BAQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a45Dyt9EA8ClIJeCkLE/SuKJ7xirKc71WbSFFr+ZNCzX8HWfQ5655F+aVSfF87UVuAtHmcFccZbJZLpxN6xPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:59:10.354988Z"},"content_sha256":"a1bd628524a7b822c3f27b77c1e0c808a92bfc0bc9ebb7eb9221fd83a901790e","schema_version":"1.0","event_id":"sha256:a1bd628524a7b822c3f27b77c1e0c808a92bfc0bc9ebb7eb9221fd83a901790e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ/bundle.json","state_url":"https://pith.science/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T19:59:10Z","links":{"resolver":"https://pith.science/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ","bundle":"https://pith.science/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ/bundle.json","state":"https://pith.science/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WG3LDSBKHDZOCWGDOMX6MC2BAQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WG3LDSBKHDZOCWGDOMX6MC2BAQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0059a63ee13b88ee7c129e7e73e4af0aec8b4f03d107afdf878cb396badc8173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T16:53:02Z","title_canon_sha256":"c7dbdb31625671a127010b3ff85f58348921c45546373efca6b588e890b59efd"},"schema_version":"1.0","source":{"id":"1806.01804","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01804","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01804v2","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01804","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"WG3LDSBKHDZO","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WG3LDSBKHDZOCWGD","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WG3LDSBK","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:a1bd628524a7b822c3f27b77c1e0c808a92bfc0bc9ebb7eb9221fd83a901790e","target":"graph","created_at":"2026-05-18T00:06:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Gonzalo Navarro, Meng He, Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T16:53:02Z","title":"Tree Path Majority Data Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01804","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9d455dc61cf4ce0e9774bd0cda13f2131b3b4f1577f016c4233e605fa4c73fb8","target":"record","created_at":"2026-05-18T00:06:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0059a63ee13b88ee7c129e7e73e4af0aec8b4f03d107afdf878cb396badc8173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-05T16:53:02Z","title_canon_sha256":"c7dbdb31625671a127010b3ff85f58348921c45546373efca6b588e890b59efd"},"schema_version":"1.0","source":{"id":"1806.01804","kind":"arxiv","version":2}},"canonical_sha256":"b1b6b1c82a38f2e158c3732fe60b410405b200beea6c84307f8a2302674ac6be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1b6b1c82a38f2e158c3732fe60b410405b200beea6c84307f8a2302674ac6be","first_computed_at":"2026-05-18T00:06:20.170081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:20.170081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z+xZMMSU2HhcTPIYXRt7uOlUp2/K6GudaEICo2xlA98IQwWDsRRI+2AftYWUODnkA38ShdhjsKyAXeoOPqvPCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:20.170621Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01804","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d455dc61cf4ce0e9774bd0cda13f2131b3b4f1577f016c4233e605fa4c73fb8","sha256:a1bd628524a7b822c3f27b77c1e0c808a92bfc0bc9ebb7eb9221fd83a901790e"],"state_sha256":"abb67cdfccfd4ec24238ef671a482ded448b6a9cbaeca2c7cd30f7a9c78c32aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fi0qjHz1qPYpxrrjG2rdBoE2RQr2lhrxvpDM1f4DZVenIPVQrJu2jje502mx5HGVDSMbC/E0J3vSSxCDF1wXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:59:10.359022Z","bundle_sha256":"164951d6c240a9c05a7f595a3b4d22ab7ed499ef11f4642ceabb247b702589ae"}}