{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LNNG3ACJ3ISFSFJ4XQKABVCOBK","short_pith_number":"pith:LNNG3ACJ","canonical_record":{"source":{"id":"1504.06647","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-24T21:26:58Z","cross_cats_sorted":[],"title_canon_sha256":"11e7b635548463236e48e0097f24437709cfc0f8aad67b5d39595eb0f15162ab","abstract_canon_sha256":"5fd3dd7ca9fd16ad44c853bcf0c49a6c4d7a66ba06ed9f9ff652594a7004a7c3"},"schema_version":"1.0"},"canonical_sha256":"5b5a6d8049da2459153cbc1400d44e0a806af1ee6d12129d50ff1b208c912531","source":{"kind":"arxiv","id":"1504.06647","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06647","created_at":"2026-05-18T01:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06647v2","created_at":"2026-05-18T01:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06647","created_at":"2026-05-18T01:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"LNNG3ACJ3ISF","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LNNG3ACJ3ISFSFJ4","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LNNG3ACJ","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LNNG3ACJ3ISFSFJ4XQKABVCOBK","target":"record","payload":{"canonical_record":{"source":{"id":"1504.06647","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-24T21:26:58Z","cross_cats_sorted":[],"title_canon_sha256":"11e7b635548463236e48e0097f24437709cfc0f8aad67b5d39595eb0f15162ab","abstract_canon_sha256":"5fd3dd7ca9fd16ad44c853bcf0c49a6c4d7a66ba06ed9f9ff652594a7004a7c3"},"schema_version":"1.0"},"canonical_sha256":"5b5a6d8049da2459153cbc1400d44e0a806af1ee6d12129d50ff1b208c912531","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:32.173103Z","signature_b64":"8344uUZfjfT5JWvrswLH4bOq5J1S3H5eRmkrCN5N9BNBEVnyK5xPJqcYiHdK957CcpXLWe64pyesQOBztVh/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b5a6d8049da2459153cbc1400d44e0a806af1ee6d12129d50ff1b208c912531","last_reissued_at":"2026-05-18T01:33:32.172379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:32.172379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.06647","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-18T01:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omHjHjCSbxMWrSCTqnXHz62VDbj4yYOHufGrUt97VXYu/Uji05u341H8o1hhHzU2xJY0alQ/CEWsgLrsZ7roAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:36:03.729060Z"},"content_sha256":"2598f4c625a778b70efa7be8398b800cdbb9d0bd1b8f83b9ede2af5d46c17a3b","schema_version":"1.0","event_id":"sha256:2598f4c625a778b70efa7be8398b800cdbb9d0bd1b8f83b9ede2af5d46c17a3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LNNG3ACJ3ISFSFJ4XQKABVCOBK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating LZ77 via Small-Space Multiple-Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Johannes Fischer, Pawe{\\l} Gawrychowski, Tomasz Kociumaka, Travis Gagie","submitted_at":"2015-04-24T21:26:58Z","abstract_excerpt":"We generalize Karp-Rabin string matching to handle multiple patterns in $\\mathcal{O}(n \\log n + m)$ time and $\\mathcal{O}(s)$ space, where $n$ is the length of the text and $m$ is the total length of the $s$ patterns, returning correct answers with high probability. As a prime application of our algorithm, we show how to approximate the LZ77 parse of a string of length $n$. If the optimal parse consists of $z$ phrases, using only $\\mathcal{O}(z)$ working space we can return a parse consisting of at most $(1+\\varepsilon)z$ phrases in $\\mathcal{O}(\\varepsilon^{-1}n\\log n)$ time, for any $\\vareps"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06647","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-18T01:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/sQ3zvyGZZfiH6Zy/Sdu/jd5wqiLwBtkgeGiknV3wVgmCJ7TQATfu/oj1luO/tFXm/99JOH/35CZn2cOMv/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:36:03.729675Z"},"content_sha256":"540827ea79f0e9354a5cf600f66f2884d6981653ac6d84694a4f2b411134cadd","schema_version":"1.0","event_id":"sha256:540827ea79f0e9354a5cf600f66f2884d6981653ac6d84694a4f2b411134cadd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNNG3ACJ3ISFSFJ4XQKABVCOBK/bundle.json","state_url":"https://pith.science/pith/LNNG3ACJ3ISFSFJ4XQKABVCOBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNNG3ACJ3ISFSFJ4XQKABVCOBK/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:36:03Z","links":{"resolver":"https://pith.science/pith/LNNG3ACJ3ISFSFJ4XQKABVCOBK","bundle":"https://pith.science/pith/LNNG3ACJ3ISFSFJ4XQKABVCOBK/bundle.json","state":"https://pith.science/pith/LNNG3ACJ3ISFSFJ4XQKABVCOBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNNG3ACJ3ISFSFJ4XQKABVCOBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LNNG3ACJ3ISFSFJ4XQKABVCOBK","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":"5fd3dd7ca9fd16ad44c853bcf0c49a6c4d7a66ba06ed9f9ff652594a7004a7c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-24T21:26:58Z","title_canon_sha256":"11e7b635548463236e48e0097f24437709cfc0f8aad67b5d39595eb0f15162ab"},"schema_version":"1.0","source":{"id":"1504.06647","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06647","created_at":"2026-05-18T01:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06647v2","created_at":"2026-05-18T01:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06647","created_at":"2026-05-18T01:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"LNNG3ACJ3ISF","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LNNG3ACJ3ISFSFJ4","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LNNG3ACJ","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:540827ea79f0e9354a5cf600f66f2884d6981653ac6d84694a4f2b411134cadd","target":"graph","created_at":"2026-05-18T01:33:32Z","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 generalize Karp-Rabin string matching to handle multiple patterns in $\\mathcal{O}(n \\log n + m)$ time and $\\mathcal{O}(s)$ space, where $n$ is the length of the text and $m$ is the total length of the $s$ patterns, returning correct answers with high probability. As a prime application of our algorithm, we show how to approximate the LZ77 parse of a string of length $n$. If the optimal parse consists of $z$ phrases, using only $\\mathcal{O}(z)$ working space we can return a parse consisting of at most $(1+\\varepsilon)z$ phrases in $\\mathcal{O}(\\varepsilon^{-1}n\\log n)$ time, for any $\\vareps","authors_text":"Johannes Fischer, Pawe{\\l} Gawrychowski, Tomasz Kociumaka, Travis Gagie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-24T21:26:58Z","title":"Approximating LZ77 via Small-Space Multiple-Pattern Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06647","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:2598f4c625a778b70efa7be8398b800cdbb9d0bd1b8f83b9ede2af5d46c17a3b","target":"record","created_at":"2026-05-18T01:33:32Z","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":"5fd3dd7ca9fd16ad44c853bcf0c49a6c4d7a66ba06ed9f9ff652594a7004a7c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-24T21:26:58Z","title_canon_sha256":"11e7b635548463236e48e0097f24437709cfc0f8aad67b5d39595eb0f15162ab"},"schema_version":"1.0","source":{"id":"1504.06647","kind":"arxiv","version":2}},"canonical_sha256":"5b5a6d8049da2459153cbc1400d44e0a806af1ee6d12129d50ff1b208c912531","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b5a6d8049da2459153cbc1400d44e0a806af1ee6d12129d50ff1b208c912531","first_computed_at":"2026-05-18T01:33:32.172379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:32.172379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8344uUZfjfT5JWvrswLH4bOq5J1S3H5eRmkrCN5N9BNBEVnyK5xPJqcYiHdK957CcpXLWe64pyesQOBztVh/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:32.173103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06647","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2598f4c625a778b70efa7be8398b800cdbb9d0bd1b8f83b9ede2af5d46c17a3b","sha256:540827ea79f0e9354a5cf600f66f2884d6981653ac6d84694a4f2b411134cadd"],"state_sha256":"6cc4d5d35c8493308af960a675c2aec1872811ba998d6115fc21cbb5d347a701"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYcEVd6Ef5tZ/B2Y3cHNkxUaT1fs8oRTSeICjJQ3XWrf+Ny690PcDNuCU7yngyx09GSSHNY6FeDL9+lSg/zKBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:36:03.733541Z","bundle_sha256":"91af3ee134564f0cde2c9b00a3379000e8e9e2bc9a7a7e5211b7619b8e0edfeb"}}