{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HYWFYJJQ6WKGPCXQATIMD5JLMO","short_pith_number":"pith:HYWFYJJQ","canonical_record":{"source":{"id":"1304.5373","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-19T11:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"6004c507fc8d006ec70391469af0e9cda81983e1d5d5c3638e92eb4729472251","abstract_canon_sha256":"159b1b38794f25254679577950967e94de301859a33d1b2f9458a433b9fa8e72"},"schema_version":"1.0"},"canonical_sha256":"3e2c5c2530f594678af004d0c1f52b639166b318a16d13338381ee61da4b57a4","source":{"kind":"arxiv","id":"1304.5373","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5373","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5373v2","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5373","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"HYWFYJJQ6WKG","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HYWFYJJQ6WKGPCXQ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HYWFYJJQ","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HYWFYJJQ6WKGPCXQATIMD5JLMO","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5373","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-19T11:11:36Z","cross_cats_sorted":[],"title_canon_sha256":"6004c507fc8d006ec70391469af0e9cda81983e1d5d5c3638e92eb4729472251","abstract_canon_sha256":"159b1b38794f25254679577950967e94de301859a33d1b2f9458a433b9fa8e72"},"schema_version":"1.0"},"canonical_sha256":"3e2c5c2530f594678af004d0c1f52b639166b318a16d13338381ee61da4b57a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:22.977107Z","signature_b64":"qrZ+zCIN/gA5vloRNpEMTJ0mik+cEpFeA+XQszrNOgCE5ciZsQZFLPsOxiFZGXhMu7yYa7GNal3vZB7TYPlDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e2c5c2530f594678af004d0c1f52b639166b318a16d13338381ee61da4b57a4","last_reissued_at":"2026-05-18T02:50:22.976578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:22.976578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5373","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:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ah6CLuBYuypt5TTw5HWGiNx15DKLj9nppndfDb3fFMpdUoopQCuH6fnHoiXiXnOyrocCZlc+JvJEQkWHyLGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:40:14.493166Z"},"content_sha256":"a590ab6d5947b63f23c5176d5436ac5486ed9b528983c48edb7c9f2c30571841","schema_version":"1.0","event_id":"sha256:a590ab6d5947b63f23c5176d5436ac5486ed9b528983c48edb7c9f2c30571841"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HYWFYJJQ6WKGPCXQATIMD5JLMO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact q-gram Profiling of Compressed Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li G{\\o}rtz, Patrick Hagge Cording, Philip Bille","submitted_at":"2013-04-19T11:11:36Z","abstract_excerpt":"We consider the problem of computing the q-gram profile of a string \\str of size $N$ compressed by a context-free grammar with $n$ production rules. We present an algorithm that runs in $O(N-\\alpha)$ expected time and uses $O(n+q+\\kq)$ space, where $N-\\alpha\\leq qn$ is the exact number of characters decompressed by the algorithm and $\\kq\\leq N-\\alpha$ is the number of distinct q-grams in $\\str$. This simultaneously matches the current best known time bound and improves the best known space bound. Our space bound is asymptotically optimal in the sense that any algorithm storing the grammar and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5373","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:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ih5UpiMgSkzuvjm0v5ShS6yCrGdr/ySLBjpdkeGymV0uUTSbPHE5vIVznO4Ei2ro2cZTn2w7Kp6/PlJhbnT+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:40:14.493536Z"},"content_sha256":"ac1d7f4419f5214e68b0439fdddb385b38f50bc6b88a6253d83c3458bcaa99b9","schema_version":"1.0","event_id":"sha256:ac1d7f4419f5214e68b0439fdddb385b38f50bc6b88a6253d83c3458bcaa99b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HYWFYJJQ6WKGPCXQATIMD5JLMO/bundle.json","state_url":"https://pith.science/pith/HYWFYJJQ6WKGPCXQATIMD5JLMO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HYWFYJJQ6WKGPCXQATIMD5JLMO/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-09T15:40:14Z","links":{"resolver":"https://pith.science/pith/HYWFYJJQ6WKGPCXQATIMD5JLMO","bundle":"https://pith.science/pith/HYWFYJJQ6WKGPCXQATIMD5JLMO/bundle.json","state":"https://pith.science/pith/HYWFYJJQ6WKGPCXQATIMD5JLMO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HYWFYJJQ6WKGPCXQATIMD5JLMO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HYWFYJJQ6WKGPCXQATIMD5JLMO","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":"159b1b38794f25254679577950967e94de301859a33d1b2f9458a433b9fa8e72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-19T11:11:36Z","title_canon_sha256":"6004c507fc8d006ec70391469af0e9cda81983e1d5d5c3638e92eb4729472251"},"schema_version":"1.0","source":{"id":"1304.5373","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5373","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5373v2","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5373","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"HYWFYJJQ6WKG","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HYWFYJJQ6WKGPCXQ","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HYWFYJJQ","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:ac1d7f4419f5214e68b0439fdddb385b38f50bc6b88a6253d83c3458bcaa99b9","target":"graph","created_at":"2026-05-18T02:50:22Z","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 consider the problem of computing the q-gram profile of a string \\str of size $N$ compressed by a context-free grammar with $n$ production rules. We present an algorithm that runs in $O(N-\\alpha)$ expected time and uses $O(n+q+\\kq)$ space, where $N-\\alpha\\leq qn$ is the exact number of characters decompressed by the algorithm and $\\kq\\leq N-\\alpha$ is the number of distinct q-grams in $\\str$. This simultaneously matches the current best known time bound and improves the best known space bound. Our space bound is asymptotically optimal in the sense that any algorithm storing the grammar and ","authors_text":"Inge Li G{\\o}rtz, Patrick Hagge Cording, Philip Bille","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-19T11:11:36Z","title":"Compact q-gram Profiling of Compressed Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5373","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:a590ab6d5947b63f23c5176d5436ac5486ed9b528983c48edb7c9f2c30571841","target":"record","created_at":"2026-05-18T02:50:22Z","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":"159b1b38794f25254679577950967e94de301859a33d1b2f9458a433b9fa8e72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-19T11:11:36Z","title_canon_sha256":"6004c507fc8d006ec70391469af0e9cda81983e1d5d5c3638e92eb4729472251"},"schema_version":"1.0","source":{"id":"1304.5373","kind":"arxiv","version":2}},"canonical_sha256":"3e2c5c2530f594678af004d0c1f52b639166b318a16d13338381ee61da4b57a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e2c5c2530f594678af004d0c1f52b639166b318a16d13338381ee61da4b57a4","first_computed_at":"2026-05-18T02:50:22.976578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:22.976578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qrZ+zCIN/gA5vloRNpEMTJ0mik+cEpFeA+XQszrNOgCE5ciZsQZFLPsOxiFZGXhMu7yYa7GNal3vZB7TYPlDBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:22.977107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5373","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a590ab6d5947b63f23c5176d5436ac5486ed9b528983c48edb7c9f2c30571841","sha256:ac1d7f4419f5214e68b0439fdddb385b38f50bc6b88a6253d83c3458bcaa99b9"],"state_sha256":"0acab80710ef245cabddf3e67c8cf50cf46c01ceb2000bc22041ba4a3d667c95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lydwZpLYf0GJ8C9P1fka+ZMiFr+ecseZqRYCA1NtTj/d7TnVzI6RH9APKtphfJM1RKtYoz1Mqk0L1WoZNlC/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:40:14.495436Z","bundle_sha256":"41c9bf505af461f30c79cac789835a698b69cd3a5d94cab63b621f78f4e9c2e2"}}