{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NJKGX5UX4KGPWWNGCCBGRXMVSO","short_pith_number":"pith:NJKGX5UX","canonical_record":{"source":{"id":"1711.08217","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T10:40:06Z","cross_cats_sorted":[],"title_canon_sha256":"71ef1ff0edfe542a8304d8b2b1a0d2e7ca0c418ca630e748644b1c8c4342a2f9","abstract_canon_sha256":"bae304dedcd6370b216199b31d5b902735ad39dc1cc8b597c63d3cf938fd242d"},"schema_version":"1.0"},"canonical_sha256":"6a546bf697e28cfb59a6108268dd959389d947378068a578699e35555d0548fc","source":{"kind":"arxiv","id":"1711.08217","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08217","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08217v3","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08217","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"NJKGX5UX4KGP","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NJKGX5UX4KGPWWNG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NJKGX5UX","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NJKGX5UX4KGPWWNGCCBGRXMVSO","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08217","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T10:40:06Z","cross_cats_sorted":[],"title_canon_sha256":"71ef1ff0edfe542a8304d8b2b1a0d2e7ca0c418ca630e748644b1c8c4342a2f9","abstract_canon_sha256":"bae304dedcd6370b216199b31d5b902735ad39dc1cc8b597c63d3cf938fd242d"},"schema_version":"1.0"},"canonical_sha256":"6a546bf697e28cfb59a6108268dd959389d947378068a578699e35555d0548fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:46.038679Z","signature_b64":"lNNyNrGY3ius6nndDn5KCrZOvPO/zkFNucaBm41IVabB9CuGUqQidIOkxF4LivXK12VCli9RHPmkkE/r1QaOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a546bf697e28cfb59a6108268dd959389d947378068a578699e35555d0548fc","last_reissued_at":"2026-05-18T00:18:46.038037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:46.038037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08217","source_version":3,"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-18T00:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibI6ZvPIW5HafoaGUqLhFeiSNjRoh0Qkr8o09blNVViX+HcH3DS3Isbxl1loL59bpGFgSjYI8wIhuZlhHppSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:41:53.586685Z"},"content_sha256":"9bb389b8b0233cad313531024a6909be661bffef78b5a305ff5e1f2053afd0b6","schema_version":"1.0","event_id":"sha256:9bb389b8b0233cad313531024a6909be661bffef78b5a305ff5e1f2053afd0b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NJKGX5UX4KGPWWNGCCBGRXMVSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed Indexing with Signature Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anders Roy Christiansen, Mikko Berggren Ettienne","submitted_at":"2017-11-22T10:40:06Z","abstract_excerpt":"The compressed indexing problem is to preprocess a string $S$ of length $n$ into a compressed representation that supports pattern matching queries. That is, given a string $P$ of length $m$ report all occurrences of $P$ in $S$.\n  We present a data structure that supports pattern matching queries in $O(m + occ (\\lg\\lg n + \\lg^\\epsilon z))$ time using $O(z \\lg(n / z))$ space where $z$ is the size of the LZ77 parse of $S$ and $\\epsilon > 0$ is an arbitrarily small constant, when the alphabet is small or $z = O(n^{1 - \\delta})$ for any constant $\\delta > 0$. We also present two data structures fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08217","kind":"arxiv","version":3},"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-18T00:18:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BV/M2suiLv6BWLcq8dpAAfOcyL3LhSmsJ6XIL+LfTAe7uiZpXNUqjNCgDehlNaaFEoDCW/IVF+5dse23M3KjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:41:53.587025Z"},"content_sha256":"93ad4ce9b4fdce81874df2b863797a9e295a5b4d0440bc39f67904ec2bf621c3","schema_version":"1.0","event_id":"sha256:93ad4ce9b4fdce81874df2b863797a9e295a5b4d0440bc39f67904ec2bf621c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO/bundle.json","state_url":"https://pith.science/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO/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-27T09:41:53Z","links":{"resolver":"https://pith.science/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO","bundle":"https://pith.science/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO/bundle.json","state":"https://pith.science/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJKGX5UX4KGPWWNGCCBGRXMVSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NJKGX5UX4KGPWWNGCCBGRXMVSO","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":"bae304dedcd6370b216199b31d5b902735ad39dc1cc8b597c63d3cf938fd242d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T10:40:06Z","title_canon_sha256":"71ef1ff0edfe542a8304d8b2b1a0d2e7ca0c418ca630e748644b1c8c4342a2f9"},"schema_version":"1.0","source":{"id":"1711.08217","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08217","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08217v3","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08217","created_at":"2026-05-18T00:18:46Z"},{"alias_kind":"pith_short_12","alias_value":"NJKGX5UX4KGP","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NJKGX5UX4KGPWWNG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NJKGX5UX","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:93ad4ce9b4fdce81874df2b863797a9e295a5b4d0440bc39f67904ec2bf621c3","target":"graph","created_at":"2026-05-18T00:18:46Z","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":"The compressed indexing problem is to preprocess a string $S$ of length $n$ into a compressed representation that supports pattern matching queries. That is, given a string $P$ of length $m$ report all occurrences of $P$ in $S$.\n  We present a data structure that supports pattern matching queries in $O(m + occ (\\lg\\lg n + \\lg^\\epsilon z))$ time using $O(z \\lg(n / z))$ space where $z$ is the size of the LZ77 parse of $S$ and $\\epsilon > 0$ is an arbitrarily small constant, when the alphabet is small or $z = O(n^{1 - \\delta})$ for any constant $\\delta > 0$. We also present two data structures fo","authors_text":"Anders Roy Christiansen, Mikko Berggren Ettienne","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T10:40:06Z","title":"Compressed Indexing with Signature Grammars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08217","kind":"arxiv","version":3},"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:9bb389b8b0233cad313531024a6909be661bffef78b5a305ff5e1f2053afd0b6","target":"record","created_at":"2026-05-18T00:18:46Z","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":"bae304dedcd6370b216199b31d5b902735ad39dc1cc8b597c63d3cf938fd242d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-22T10:40:06Z","title_canon_sha256":"71ef1ff0edfe542a8304d8b2b1a0d2e7ca0c418ca630e748644b1c8c4342a2f9"},"schema_version":"1.0","source":{"id":"1711.08217","kind":"arxiv","version":3}},"canonical_sha256":"6a546bf697e28cfb59a6108268dd959389d947378068a578699e35555d0548fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a546bf697e28cfb59a6108268dd959389d947378068a578699e35555d0548fc","first_computed_at":"2026-05-18T00:18:46.038037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:46.038037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lNNyNrGY3ius6nndDn5KCrZOvPO/zkFNucaBm41IVabB9CuGUqQidIOkxF4LivXK12VCli9RHPmkkE/r1QaOBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:46.038679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08217","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bb389b8b0233cad313531024a6909be661bffef78b5a305ff5e1f2053afd0b6","sha256:93ad4ce9b4fdce81874df2b863797a9e295a5b4d0440bc39f67904ec2bf621c3"],"state_sha256":"13f40a31959b62ae98a08765b255c5cf941fa00aa7950fb8c32524490d54c6b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2mOII+JtYm/XZmZ4Gxj8fAjPLDrli9TD9j6G13ow207P7KOp0LbWsOyeaBoBKp8cIPlBKaqJ3oWDDQAZUtIHCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T09:41:53.588951Z","bundle_sha256":"b567350a7e8d4c45eb9d5764dc936b1762d3180a9b45f6e1c2cc98d0a6d4c414"}}