{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:B6CKHTXGDH455BNU5NIXVW5X22","short_pith_number":"pith:B6CKHTXG","canonical_record":{"source":{"id":"1101.4068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-21T03:23:57Z","cross_cats_sorted":[],"title_canon_sha256":"78ac1c0813fdad68b85a6d1e332f857ef0851dd168b3db6785eec317789c8fdd","abstract_canon_sha256":"85675b670e00ab0df59114baf549e12f7ac048fbb826635dfc85e6bc946eee94"},"schema_version":"1.0"},"canonical_sha256":"0f84a3cee619f9de85b4eb517adbb7d6a3fe2f6353514194cd0e51ee0e1ea62f","source":{"kind":"arxiv","id":"1101.4068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4068","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4068v1","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4068","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"B6CKHTXGDH45","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"B6CKHTXGDH455BNU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"B6CKHTXG","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:B6CKHTXGDH455BNU5NIXVW5X22","target":"record","payload":{"canonical_record":{"source":{"id":"1101.4068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-21T03:23:57Z","cross_cats_sorted":[],"title_canon_sha256":"78ac1c0813fdad68b85a6d1e332f857ef0851dd168b3db6785eec317789c8fdd","abstract_canon_sha256":"85675b670e00ab0df59114baf549e12f7ac048fbb826635dfc85e6bc946eee94"},"schema_version":"1.0"},"canonical_sha256":"0f84a3cee619f9de85b4eb517adbb7d6a3fe2f6353514194cd0e51ee0e1ea62f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:12.749258Z","signature_b64":"M2WxS9HFU22IZCKVv/1cLXrNM+xisZOdWCKlge3hQ4Trysyzm0YeJu/PTZRvtB94PMlg9boAxeoqoF7AQoMaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f84a3cee619f9de85b4eb517adbb7d6a3fe2f6353514194cd0e51ee0e1ea62f","last_reissued_at":"2026-05-18T04:31:12.748561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:12.748561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.4068","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-18T04:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+FbyX8vqGMd5uea7gbv+mMbIkLVxzHlHO4HxLo3gCYeL5Af0H9cjMdoCSGY1m30fODRMz1OCL1M5reFCj4cBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:50:38.013709Z"},"content_sha256":"e1d1f78c057c48e331f481791616fc36cc4879e832c54d55b1c4e93c3252656d","schema_version":"1.0","event_id":"sha256:e1d1f78c057c48e331f481791616fc36cc4879e832c54d55b1c4e93c3252656d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:B6CKHTXGDH455BNU5NIXVW5X22","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear-Space Data Structures for Range Mode Query in Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jason Morrison, Stephane Durocher","submitted_at":"2011-01-21T03:23:57Z","abstract_excerpt":"A mode of a multiset $S$ is an element $a \\in S$ of maximum multiplicity; that is, $a$ occurs at least as frequently as any other element in $S$. Given a list $A[1:n]$ of $n$ items, we consider the problem of constructing a data structure that efficiently answers range mode queries on $A$. Each query consists of an input pair of indices $(i, j)$ for which a mode of $A[i:j]$ must be returned. We present an $O(n^{2-2\\epsilon})$-space static data structure that supports range mode queries in $O(n^\\epsilon)$ time in the worst case, for any fixed $\\epsilon \\in [0,1/2]$. When $\\epsilon = 1/2$, this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4068","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-18T04:31:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQMzGjCduyFt4r2Vdd+KyfW8tjoCT/gpEKiqKzylMvMt/A4+yuBzGKxzXnj9+AzTXNyJxLPwnYn69N/GwE7uAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:50:38.014388Z"},"content_sha256":"606d1a5f43ace6d4ed733001bb7cf8339dfc282681d72d945041f6b5993e94a0","schema_version":"1.0","event_id":"sha256:606d1a5f43ace6d4ed733001bb7cf8339dfc282681d72d945041f6b5993e94a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B6CKHTXGDH455BNU5NIXVW5X22/bundle.json","state_url":"https://pith.science/pith/B6CKHTXGDH455BNU5NIXVW5X22/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B6CKHTXGDH455BNU5NIXVW5X22/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-30T00:50:38Z","links":{"resolver":"https://pith.science/pith/B6CKHTXGDH455BNU5NIXVW5X22","bundle":"https://pith.science/pith/B6CKHTXGDH455BNU5NIXVW5X22/bundle.json","state":"https://pith.science/pith/B6CKHTXGDH455BNU5NIXVW5X22/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B6CKHTXGDH455BNU5NIXVW5X22/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:B6CKHTXGDH455BNU5NIXVW5X22","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":"85675b670e00ab0df59114baf549e12f7ac048fbb826635dfc85e6bc946eee94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-21T03:23:57Z","title_canon_sha256":"78ac1c0813fdad68b85a6d1e332f857ef0851dd168b3db6785eec317789c8fdd"},"schema_version":"1.0","source":{"id":"1101.4068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4068","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4068v1","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4068","created_at":"2026-05-18T04:31:12Z"},{"alias_kind":"pith_short_12","alias_value":"B6CKHTXGDH45","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"B6CKHTXGDH455BNU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"B6CKHTXG","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:606d1a5f43ace6d4ed733001bb7cf8339dfc282681d72d945041f6b5993e94a0","target":"graph","created_at":"2026-05-18T04:31:12Z","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":"A mode of a multiset $S$ is an element $a \\in S$ of maximum multiplicity; that is, $a$ occurs at least as frequently as any other element in $S$. Given a list $A[1:n]$ of $n$ items, we consider the problem of constructing a data structure that efficiently answers range mode queries on $A$. Each query consists of an input pair of indices $(i, j)$ for which a mode of $A[i:j]$ must be returned. We present an $O(n^{2-2\\epsilon})$-space static data structure that supports range mode queries in $O(n^\\epsilon)$ time in the worst case, for any fixed $\\epsilon \\in [0,1/2]$. When $\\epsilon = 1/2$, this ","authors_text":"Jason Morrison, Stephane Durocher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-21T03:23:57Z","title":"Linear-Space Data Structures for Range Mode Query in Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4068","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:e1d1f78c057c48e331f481791616fc36cc4879e832c54d55b1c4e93c3252656d","target":"record","created_at":"2026-05-18T04:31:12Z","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":"85675b670e00ab0df59114baf549e12f7ac048fbb826635dfc85e6bc946eee94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-21T03:23:57Z","title_canon_sha256":"78ac1c0813fdad68b85a6d1e332f857ef0851dd168b3db6785eec317789c8fdd"},"schema_version":"1.0","source":{"id":"1101.4068","kind":"arxiv","version":1}},"canonical_sha256":"0f84a3cee619f9de85b4eb517adbb7d6a3fe2f6353514194cd0e51ee0e1ea62f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f84a3cee619f9de85b4eb517adbb7d6a3fe2f6353514194cd0e51ee0e1ea62f","first_computed_at":"2026-05-18T04:31:12.748561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:12.748561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M2WxS9HFU22IZCKVv/1cLXrNM+xisZOdWCKlge3hQ4Trysyzm0YeJu/PTZRvtB94PMlg9boAxeoqoF7AQoMaCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:12.749258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1d1f78c057c48e331f481791616fc36cc4879e832c54d55b1c4e93c3252656d","sha256:606d1a5f43ace6d4ed733001bb7cf8339dfc282681d72d945041f6b5993e94a0"],"state_sha256":"7fb722c945cbc9193873c550ed717ddbb718b7622d1c75753e590001c711a029"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5OltnLLjdEjIMkZ9S2r92iVW49gQw+SayDUfk/kaLntM/kS7BPzHyxD5etM8fos7nM3V4z3lvM5y3tjngylMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:50:38.017672Z","bundle_sha256":"9ad322551dac9acdea21a8258247b0813e17d8cd5cfaedc9b7c7dc4f686a25d8"}}