{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FRAP6WLWILMGBUYKTXM7N5VXE5","short_pith_number":"pith:FRAP6WLW","canonical_record":{"source":{"id":"1606.04495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-14T18:47:01Z","cross_cats_sorted":[],"title_canon_sha256":"de5f7c52b56054c9395342c625b4208f539f00a21a3ac57e79686d9af3ac6722","abstract_canon_sha256":"02c6da5377bca4ba1a755f712bc7d9871cb6931cdfbe24d8ec44481c762f31fb"},"schema_version":"1.0"},"canonical_sha256":"2c40ff597642d860d30a9dd9f6f6b7275403e06954948f63c0b602422446c78b","source":{"kind":"arxiv","id":"1606.04495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04495","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04495v1","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04495","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"FRAP6WLWILMG","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRAP6WLWILMGBUYK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRAP6WLW","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FRAP6WLWILMGBUYKTXM7N5VXE5","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-14T18:47:01Z","cross_cats_sorted":[],"title_canon_sha256":"de5f7c52b56054c9395342c625b4208f539f00a21a3ac57e79686d9af3ac6722","abstract_canon_sha256":"02c6da5377bca4ba1a755f712bc7d9871cb6931cdfbe24d8ec44481c762f31fb"},"schema_version":"1.0"},"canonical_sha256":"2c40ff597642d860d30a9dd9f6f6b7275403e06954948f63c0b602422446c78b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:25.527003Z","signature_b64":"QVfcWmw8K1SqdaXq9jV8gxsGZtQ2Eg0wL9RrBixA/TJVYHImrrM3RCrt/OMVpwEzS3YCmg3GcsaZMkSnclRHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c40ff597642d860d30a9dd9f6f6b7275403e06954948f63c0b602422446c78b","last_reissued_at":"2026-05-18T01:12:25.526676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:25.526676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04495","source_version":1,"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-18T01:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"267AJ6MpUO5T99wX3QMjBqCCgUAb9Qsh/5+DamTRqHul9KXlcdDcaVxZfgd7qKDTjhriLbbu+TMYf+0g54FNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:51:54.309433Z"},"content_sha256":"90409a5f31920a75a096378eebcd3a26c3c9eca612226b0a4c34602e729b8a3f","schema_version":"1.0","event_id":"sha256:90409a5f31920a75a096378eebcd3a26c3c9eca612226b0a4c34602e729b8a3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FRAP6WLWILMGBUYKTXM7N5VXE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Range Majorities and Minorities in Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Gonzalo Navarro, J. Ian Munro, Travis Gagie, Yakov Nekrich","submitted_at":"2016-06-14T18:47:01Z","abstract_excerpt":"Karpinski and Nekrich (2008) introduced the problem of parameterized range majority, which asks us to preprocess a string of length $n$ such that, given the endpoints of a range, one can quickly find all the distinct elements whose relative frequencies in that range are more than a threshold $\\tau$. Subsequent authors have reduced their time and space bounds such that, when $\\tau$ is fixed at preprocessing time, we need either $O(n \\log (1 / \\tau))$ space and optimal $O(1 / \\tau)$ query time or linear space and $O((1 / \\tau) \\log \\log \\sigma)$ query time, where $\\sigma$ is the alphabet size. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04495","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"},"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-18T01:12:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Ul3h9RMnuwKAY1KTOso16D1QV6kZXF3zvwO6Qpr3Ey1nDO2TzM8ci6mQoHrtNKe7+W5wlneRkCnBrkt23M4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:51:54.309824Z"},"content_sha256":"08b612aab01fc9081049ce666a65f81ed4dbd0bde8244005fcfc31c143447f58","schema_version":"1.0","event_id":"sha256:08b612aab01fc9081049ce666a65f81ed4dbd0bde8244005fcfc31c143447f58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRAP6WLWILMGBUYKTXM7N5VXE5/bundle.json","state_url":"https://pith.science/pith/FRAP6WLWILMGBUYKTXM7N5VXE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRAP6WLWILMGBUYKTXM7N5VXE5/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-31T18:51:54Z","links":{"resolver":"https://pith.science/pith/FRAP6WLWILMGBUYKTXM7N5VXE5","bundle":"https://pith.science/pith/FRAP6WLWILMGBUYKTXM7N5VXE5/bundle.json","state":"https://pith.science/pith/FRAP6WLWILMGBUYKTXM7N5VXE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRAP6WLWILMGBUYKTXM7N5VXE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FRAP6WLWILMGBUYKTXM7N5VXE5","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":"02c6da5377bca4ba1a755f712bc7d9871cb6931cdfbe24d8ec44481c762f31fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-14T18:47:01Z","title_canon_sha256":"de5f7c52b56054c9395342c625b4208f539f00a21a3ac57e79686d9af3ac6722"},"schema_version":"1.0","source":{"id":"1606.04495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04495","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04495v1","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04495","created_at":"2026-05-18T01:12:25Z"},{"alias_kind":"pith_short_12","alias_value":"FRAP6WLWILMG","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRAP6WLWILMGBUYK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRAP6WLW","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:08b612aab01fc9081049ce666a65f81ed4dbd0bde8244005fcfc31c143447f58","target":"graph","created_at":"2026-05-18T01:12:25Z","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":"Karpinski and Nekrich (2008) introduced the problem of parameterized range majority, which asks us to preprocess a string of length $n$ such that, given the endpoints of a range, one can quickly find all the distinct elements whose relative frequencies in that range are more than a threshold $\\tau$. Subsequent authors have reduced their time and space bounds such that, when $\\tau$ is fixed at preprocessing time, we need either $O(n \\log (1 / \\tau))$ space and optimal $O(1 / \\tau)$ query time or linear space and $O((1 / \\tau) \\log \\log \\sigma)$ query time, where $\\sigma$ is the alphabet size. I","authors_text":"Djamal Belazzougui, Gonzalo Navarro, J. Ian Munro, Travis Gagie, Yakov Nekrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-14T18:47:01Z","title":"Range Majorities and Minorities in Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04495","kind":"arxiv","version":1},"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:90409a5f31920a75a096378eebcd3a26c3c9eca612226b0a4c34602e729b8a3f","target":"record","created_at":"2026-05-18T01:12:25Z","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":"02c6da5377bca4ba1a755f712bc7d9871cb6931cdfbe24d8ec44481c762f31fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-14T18:47:01Z","title_canon_sha256":"de5f7c52b56054c9395342c625b4208f539f00a21a3ac57e79686d9af3ac6722"},"schema_version":"1.0","source":{"id":"1606.04495","kind":"arxiv","version":1}},"canonical_sha256":"2c40ff597642d860d30a9dd9f6f6b7275403e06954948f63c0b602422446c78b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c40ff597642d860d30a9dd9f6f6b7275403e06954948f63c0b602422446c78b","first_computed_at":"2026-05-18T01:12:25.526676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:25.526676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QVfcWmw8K1SqdaXq9jV8gxsGZtQ2Eg0wL9RrBixA/TJVYHImrrM3RCrt/OMVpwEzS3YCmg3GcsaZMkSnclRHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:25.527003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90409a5f31920a75a096378eebcd3a26c3c9eca612226b0a4c34602e729b8a3f","sha256:08b612aab01fc9081049ce666a65f81ed4dbd0bde8244005fcfc31c143447f58"],"state_sha256":"314b770bb582fe3b2b1a2e4e6cb73806c18451ed2ffe538cf493cc14a51d7842"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GaJtVCqXN68u0ce1eyLkjLuIrgL/CITG/+qLYaEPZrTd3ZEbm3VI96KlbvMMlMM9k3Yg8KHckoQuC9c+h07UAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:51:54.312157Z","bundle_sha256":"b4095bcf35515fcb11ed7f5ca24f6cc499555b09f860467bf82e9b98db1425c2"}}