{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:YZ75B7OPI2CHWJJY3A6EMTLYX7","short_pith_number":"pith:YZ75B7OP","canonical_record":{"source":{"id":"1011.3480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-15T19:30:19Z","cross_cats_sorted":[],"title_canon_sha256":"0c2130daf962295b5cb74e5456ab75d78850448148dc1fa248d562574f731701","abstract_canon_sha256":"e818a0c832ee3258040b9081c13fc0618fb4ab084d9e249ec6d2ec8318636cd1"},"schema_version":"1.0"},"canonical_sha256":"c67fd0fdcf46847b2538d83c464d78bfde1454426c39113a08711156acaf4fc5","source":{"kind":"arxiv","id":"1011.3480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3480","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3480v1","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3480","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"pith_short_12","alias_value":"YZ75B7OPI2CH","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YZ75B7OPI2CHWJJY","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YZ75B7OP","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:YZ75B7OPI2CHWJJY3A6EMTLYX7","target":"record","payload":{"canonical_record":{"source":{"id":"1011.3480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-15T19:30:19Z","cross_cats_sorted":[],"title_canon_sha256":"0c2130daf962295b5cb74e5456ab75d78850448148dc1fa248d562574f731701","abstract_canon_sha256":"e818a0c832ee3258040b9081c13fc0618fb4ab084d9e249ec6d2ec8318636cd1"},"schema_version":"1.0"},"canonical_sha256":"c67fd0fdcf46847b2538d83c464d78bfde1454426c39113a08711156acaf4fc5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:55.755750Z","signature_b64":"xmevqmbMcBeeLyBpeS0TcBomawdqIey1OZs2FRPo+I30tbjJO3D3LS1+xdH/8Vm/wCuaB75SUaFoH4rv9Xw9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c67fd0fdcf46847b2538d83c464d78bfde1454426c39113a08711156acaf4fc5","last_reissued_at":"2026-05-18T04:35:55.755121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:55.755121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.3480","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:35:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gRwM5j0TlP652VrzqLQeM3zltddjXQ3qT4HIid4lbcYyw1CGIC+SVOX3jarR72vUAoyJES/4WBSCraXPIWqMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:25:24.461486Z"},"content_sha256":"0c124d27e78c2975edef1714ccf522fa6a9a0d7f960b5a3b57e0c320b8996cff","schema_version":"1.0","event_id":"sha256:0c124d27e78c2975edef1714ccf522fa6a9a0d7f960b5a3b57e0c320b8996cff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:YZ75B7OPI2CHWJJY3A6EMTLYX7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Colours in Compressed Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Juha K\\\"arkk\\\"ainen, Travis Gagie","submitted_at":"2010-11-15T19:30:19Z","abstract_excerpt":"Suppose we are asked to preprocess a string \\(s [1..n]\\) such that later, given a substring's endpoints, we can quickly count how many distinct characters it contains. In this paper we give a data structure for this problem that takes \\(n H_0 (s) + \\Oh{n} + \\oh{n H_0 (s)}\\) bits, where \\(H_0 (s)\\) is the 0th-order empirical entropy of $s$, and answers queries in $\\Oh{\\log^{1 + \\epsilon} n}$ time for any constant \\(\\epsilon > 0\\). We also show how our data structure can be made partially dynamic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3480","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:35:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/pVxQikRIl9jvNPBSgRhC8Nqwx7OsXUEACVTL66AWRZz5sAS2OrbQK+KQgDqOOYn4H4QX0soP5BKu6bImI/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:25:24.462081Z"},"content_sha256":"d7ce1569f70890d5e2d15499317ef683413247d9654fd7bdf99d8e0bbdc5b8ad","schema_version":"1.0","event_id":"sha256:d7ce1569f70890d5e2d15499317ef683413247d9654fd7bdf99d8e0bbdc5b8ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZ75B7OPI2CHWJJY3A6EMTLYX7/bundle.json","state_url":"https://pith.science/pith/YZ75B7OPI2CHWJJY3A6EMTLYX7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZ75B7OPI2CHWJJY3A6EMTLYX7/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-06-07T05:25:24Z","links":{"resolver":"https://pith.science/pith/YZ75B7OPI2CHWJJY3A6EMTLYX7","bundle":"https://pith.science/pith/YZ75B7OPI2CHWJJY3A6EMTLYX7/bundle.json","state":"https://pith.science/pith/YZ75B7OPI2CHWJJY3A6EMTLYX7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZ75B7OPI2CHWJJY3A6EMTLYX7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YZ75B7OPI2CHWJJY3A6EMTLYX7","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":"e818a0c832ee3258040b9081c13fc0618fb4ab084d9e249ec6d2ec8318636cd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-15T19:30:19Z","title_canon_sha256":"0c2130daf962295b5cb74e5456ab75d78850448148dc1fa248d562574f731701"},"schema_version":"1.0","source":{"id":"1011.3480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3480","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3480v1","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3480","created_at":"2026-05-18T04:35:55Z"},{"alias_kind":"pith_short_12","alias_value":"YZ75B7OPI2CH","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YZ75B7OPI2CHWJJY","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YZ75B7OP","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:d7ce1569f70890d5e2d15499317ef683413247d9654fd7bdf99d8e0bbdc5b8ad","target":"graph","created_at":"2026-05-18T04:35:55Z","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":"Suppose we are asked to preprocess a string \\(s [1..n]\\) such that later, given a substring's endpoints, we can quickly count how many distinct characters it contains. In this paper we give a data structure for this problem that takes \\(n H_0 (s) + \\Oh{n} + \\oh{n H_0 (s)}\\) bits, where \\(H_0 (s)\\) is the 0th-order empirical entropy of $s$, and answers queries in $\\Oh{\\log^{1 + \\epsilon} n}$ time for any constant \\(\\epsilon > 0\\). We also show how our data structure can be made partially dynamic.","authors_text":"Juha K\\\"arkk\\\"ainen, Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-15T19:30:19Z","title":"Counting Colours in Compressed Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3480","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:0c124d27e78c2975edef1714ccf522fa6a9a0d7f960b5a3b57e0c320b8996cff","target":"record","created_at":"2026-05-18T04:35:55Z","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":"e818a0c832ee3258040b9081c13fc0618fb4ab084d9e249ec6d2ec8318636cd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-15T19:30:19Z","title_canon_sha256":"0c2130daf962295b5cb74e5456ab75d78850448148dc1fa248d562574f731701"},"schema_version":"1.0","source":{"id":"1011.3480","kind":"arxiv","version":1}},"canonical_sha256":"c67fd0fdcf46847b2538d83c464d78bfde1454426c39113a08711156acaf4fc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c67fd0fdcf46847b2538d83c464d78bfde1454426c39113a08711156acaf4fc5","first_computed_at":"2026-05-18T04:35:55.755121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:55.755121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xmevqmbMcBeeLyBpeS0TcBomawdqIey1OZs2FRPo+I30tbjJO3D3LS1+xdH/8Vm/wCuaB75SUaFoH4rv9Xw9CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:55.755750Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c124d27e78c2975edef1714ccf522fa6a9a0d7f960b5a3b57e0c320b8996cff","sha256:d7ce1569f70890d5e2d15499317ef683413247d9654fd7bdf99d8e0bbdc5b8ad"],"state_sha256":"596547a644407388547260e57e368eb176bfec0df176f72cb4e9ee3733f1578f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KbgFns9gj4mQrhsovxo2ViW+rdf8M8IC2hSOPmpcZPdwkQjKA+U5RSoqB0DYq7+6GWIXRA/vNTU22KBDN5UNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:25:24.465466Z","bundle_sha256":"a894bd05eaff09409c934d34d8a87e563fbea89b5e7d742b103b58f3fe119c0d"}}