{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GKIHNVDLFCYXA4QPYN2QXAQVVQ","short_pith_number":"pith:GKIHNVDL","canonical_record":{"source":{"id":"1210.1765","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-05T14:01:58Z","cross_cats_sorted":[],"title_canon_sha256":"00d8ba8f0c233a861eee91506ce7fa3806cc224a6fda186082d90d228b75d7dc","abstract_canon_sha256":"ba8cf0b24c382d122efff5ff285057ccfd07fca4e1b768c9a912a9f881b65ca8"},"schema_version":"1.0"},"canonical_sha256":"329076d46b28b170720fc3750b8215ac1036eb30b6ccccbc5ab890c5052455b4","source":{"kind":"arxiv","id":"1210.1765","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1765","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1765v2","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1765","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"pith_short_12","alias_value":"GKIHNVDLFCYX","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GKIHNVDLFCYXA4QP","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GKIHNVDL","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GKIHNVDLFCYXA4QPYN2QXAQVVQ","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1765","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-05T14:01:58Z","cross_cats_sorted":[],"title_canon_sha256":"00d8ba8f0c233a861eee91506ce7fa3806cc224a6fda186082d90d228b75d7dc","abstract_canon_sha256":"ba8cf0b24c382d122efff5ff285057ccfd07fca4e1b768c9a912a9f881b65ca8"},"schema_version":"1.0"},"canonical_sha256":"329076d46b28b170720fc3750b8215ac1036eb30b6ccccbc5ab890c5052455b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:51.115076Z","signature_b64":"HuW39DlTJgW0OZ+NXvrQ+KFbdsDhqbuuH16IhsM7SdFV5IVkkqMwobzhITa1uyEIgEAwYiQDaDZp4NUU32e1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"329076d46b28b170720fc3750b8215ac1036eb30b6ccccbc5ab890c5052455b4","last_reissued_at":"2026-05-18T02:47:51.114605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:51.114605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1765","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-18T02:47:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIExHiakE9JzplHtKUuUHOGzXdUQPsMnt60LpCNUYLZmjerYuIAKMd8AakfC5vDf3EMmnSRUTnAoy3T5cG24Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:01:34.263015Z"},"content_sha256":"1bc955253cddb6150aee98582c2703f22a18cdd280316b38d3b5988953bcc4a9","schema_version":"1.0","event_id":"sha256:1bc955253cddb6150aee98582c2703f22a18cdd280316b38d3b5988953bcc4a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GKIHNVDLFCYXA4QPYN2QXAQVVQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Better Space Bounds for Parameterized Range Majority and Minority","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Gonzalo Navarro, Travis Gagie","submitted_at":"2012-10-05T14:01:58Z","abstract_excerpt":"Karpinski and Nekrich (2008) introduced the problem of parameterized range majority, which asks 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 given at preprocessing time, we need either $\\Oh{n \\log (1 / \\tau)}$ space and optimal $\\Oh{1 / \\tau}$ query time or linear space and $\\Oh{(1 / \\tau) \\log \\log \\sigma}$ query time, where $\\sigma$ is the alphabet size"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1765","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-18T02:47:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bMAuYbHFiTEJB+KC5gv2x6dSzaq/4pctZf6W/9v+lqvl0cPyKK+8eNprEKzyeZIK0Xztbsym4Y5JKfgIU4KwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:01:34.263437Z"},"content_sha256":"79a6999f9ef62592513d1d0b1da4add1bf0cbe2217a03ab5a7c8ed381774f002","schema_version":"1.0","event_id":"sha256:79a6999f9ef62592513d1d0b1da4add1bf0cbe2217a03ab5a7c8ed381774f002"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKIHNVDLFCYXA4QPYN2QXAQVVQ/bundle.json","state_url":"https://pith.science/pith/GKIHNVDLFCYXA4QPYN2QXAQVVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKIHNVDLFCYXA4QPYN2QXAQVVQ/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-27T03:01:34Z","links":{"resolver":"https://pith.science/pith/GKIHNVDLFCYXA4QPYN2QXAQVVQ","bundle":"https://pith.science/pith/GKIHNVDLFCYXA4QPYN2QXAQVVQ/bundle.json","state":"https://pith.science/pith/GKIHNVDLFCYXA4QPYN2QXAQVVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKIHNVDLFCYXA4QPYN2QXAQVVQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GKIHNVDLFCYXA4QPYN2QXAQVVQ","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":"ba8cf0b24c382d122efff5ff285057ccfd07fca4e1b768c9a912a9f881b65ca8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-05T14:01:58Z","title_canon_sha256":"00d8ba8f0c233a861eee91506ce7fa3806cc224a6fda186082d90d228b75d7dc"},"schema_version":"1.0","source":{"id":"1210.1765","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1765","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1765v2","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1765","created_at":"2026-05-18T02:47:51Z"},{"alias_kind":"pith_short_12","alias_value":"GKIHNVDLFCYX","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GKIHNVDLFCYXA4QP","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GKIHNVDL","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:79a6999f9ef62592513d1d0b1da4add1bf0cbe2217a03ab5a7c8ed381774f002","target":"graph","created_at":"2026-05-18T02:47:51Z","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 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 given at preprocessing time, we need either $\\Oh{n \\log (1 / \\tau)}$ space and optimal $\\Oh{1 / \\tau}$ query time or linear space and $\\Oh{(1 / \\tau) \\log \\log \\sigma}$ query time, where $\\sigma$ is the alphabet size","authors_text":"Djamal Belazzougui, Gonzalo Navarro, Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-05T14:01:58Z","title":"Better Space Bounds for Parameterized Range Majority and Minority"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1765","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:1bc955253cddb6150aee98582c2703f22a18cdd280316b38d3b5988953bcc4a9","target":"record","created_at":"2026-05-18T02:47:51Z","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":"ba8cf0b24c382d122efff5ff285057ccfd07fca4e1b768c9a912a9f881b65ca8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-05T14:01:58Z","title_canon_sha256":"00d8ba8f0c233a861eee91506ce7fa3806cc224a6fda186082d90d228b75d7dc"},"schema_version":"1.0","source":{"id":"1210.1765","kind":"arxiv","version":2}},"canonical_sha256":"329076d46b28b170720fc3750b8215ac1036eb30b6ccccbc5ab890c5052455b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"329076d46b28b170720fc3750b8215ac1036eb30b6ccccbc5ab890c5052455b4","first_computed_at":"2026-05-18T02:47:51.114605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:51.114605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HuW39DlTJgW0OZ+NXvrQ+KFbdsDhqbuuH16IhsM7SdFV5IVkkqMwobzhITa1uyEIgEAwYiQDaDZp4NUU32e1Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:51.115076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1765","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bc955253cddb6150aee98582c2703f22a18cdd280316b38d3b5988953bcc4a9","sha256:79a6999f9ef62592513d1d0b1da4add1bf0cbe2217a03ab5a7c8ed381774f002"],"state_sha256":"25f1c694929227e96250b6696175813bac0c65084afb51d6f7504391364a4f4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"liZ4o2n+ZUFRzTW78Sv8npBQNRI9CiHxcXggSUWC9sn00cG2Aj7kVtj7kQ9YarfpGZ3yDdYOEPIyA+lRSJNsDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:01:34.266383Z","bundle_sha256":"e8e1402259e357db5ec54d446ba0c4ecc351d41acd8d5736aeb2c05bace8c09e"}}