{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WKAJA7QDNHUKUGGGKPO4ERGJKI","short_pith_number":"pith:WKAJA7QD","canonical_record":{"source":{"id":"1708.05223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-17T12:13:53Z","cross_cats_sorted":[],"title_canon_sha256":"0cbeb1fdb4e464a7647a6cbf04adfbaab3a9e56f39ca19467c75610bfb67bd06","abstract_canon_sha256":"57aa70ff03d7080a7ec42faf1bcf0cae96ef1ffd8d78523b80cb7630f621a2b9"},"schema_version":"1.0"},"canonical_sha256":"b280907e0369e8aa18c653ddc244c9521c0ddbaff1bd7cf6c6b6e1fac0c6188f","source":{"kind":"arxiv","id":"1708.05223","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05223","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05223v2","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05223","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"WKAJA7QDNHUK","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WKAJA7QDNHUKUGGG","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WKAJA7QD","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WKAJA7QDNHUKUGGGKPO4ERGJKI","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-17T12:13:53Z","cross_cats_sorted":[],"title_canon_sha256":"0cbeb1fdb4e464a7647a6cbf04adfbaab3a9e56f39ca19467c75610bfb67bd06","abstract_canon_sha256":"57aa70ff03d7080a7ec42faf1bcf0cae96ef1ffd8d78523b80cb7630f621a2b9"},"schema_version":"1.0"},"canonical_sha256":"b280907e0369e8aa18c653ddc244c9521c0ddbaff1bd7cf6c6b6e1fac0c6188f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:03.787876Z","signature_b64":"0nU9M9fDPzQIyBivhFpFbMGfXwU9OXIrFuLxiWpd8K7HRTZs9DHRk4Rb3QvVM5AKUfgRCEbCgfH/VpUGr3FTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b280907e0369e8aa18c653ddc244c9521c0ddbaff1bd7cf6c6b6e1fac0c6188f","last_reissued_at":"2026-05-18T00:19:03.787303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:03.787303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05223","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-18T00:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FjxxzCZ0BPboKlJsYPXUXkxYBfRh6Puli2JxLLinRTiVT84JY8YQVpi193+aLKBuJdJnORssIdXtmBFKR6cgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:43:00.516080Z"},"content_sha256":"74758f8bf85c590c7e4793fa94af2c7a1f12d8d12f87ade31186d723b5f11563","schema_version":"1.0","event_id":"sha256:74758f8bf85c590c7e4793fa94af2c7a1f12d8d12f87ade31186d723b5f11563"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WKAJA7QDNHUKUGGGKPO4ERGJKI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The streaming $k$-mismatch problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ely Porat, Rapha\\\"el Clifford, Tomasz Kociumaka","submitted_at":"2017-08-17T12:13:53Z","abstract_excerpt":"We consider the streaming complexity of a fundamental task in approximate pattern matching: the $k$-mismatch problem. It asks to compute Hamming distances between a pattern of length $n$ and all length-$n$ substrings of a text for which the Hamming distance does not exceed a given threshold $k$. In our problem formulation, we report not only the Hamming distance but also, on demand, the full \\emph{mismatch information}, that is the list of mismatched pairs of symbols and their indices. The twin challenges of streaming pattern matching derive from the need both to achieve small working space an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05223","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-18T00:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gqF+n/UUlPe5qthtnOb3+uVAK1OeUB0yKGGXY/rEGCZrgs4ByMIHTohULeP5yET105g7JUDpZhGid3CICLoUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:43:00.516735Z"},"content_sha256":"15f740b701f20a070c92e6783f93337336ea5067a81e2a343916bc1ce5ee0a6b","schema_version":"1.0","event_id":"sha256:15f740b701f20a070c92e6783f93337336ea5067a81e2a343916bc1ce5ee0a6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WKAJA7QDNHUKUGGGKPO4ERGJKI/bundle.json","state_url":"https://pith.science/pith/WKAJA7QDNHUKUGGGKPO4ERGJKI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WKAJA7QDNHUKUGGGKPO4ERGJKI/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-30T10:43:00Z","links":{"resolver":"https://pith.science/pith/WKAJA7QDNHUKUGGGKPO4ERGJKI","bundle":"https://pith.science/pith/WKAJA7QDNHUKUGGGKPO4ERGJKI/bundle.json","state":"https://pith.science/pith/WKAJA7QDNHUKUGGGKPO4ERGJKI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WKAJA7QDNHUKUGGGKPO4ERGJKI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WKAJA7QDNHUKUGGGKPO4ERGJKI","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":"57aa70ff03d7080a7ec42faf1bcf0cae96ef1ffd8d78523b80cb7630f621a2b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-17T12:13:53Z","title_canon_sha256":"0cbeb1fdb4e464a7647a6cbf04adfbaab3a9e56f39ca19467c75610bfb67bd06"},"schema_version":"1.0","source":{"id":"1708.05223","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05223","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05223v2","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05223","created_at":"2026-05-18T00:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"WKAJA7QDNHUK","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WKAJA7QDNHUKUGGG","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WKAJA7QD","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:15f740b701f20a070c92e6783f93337336ea5067a81e2a343916bc1ce5ee0a6b","target":"graph","created_at":"2026-05-18T00:19:03Z","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 streaming complexity of a fundamental task in approximate pattern matching: the $k$-mismatch problem. It asks to compute Hamming distances between a pattern of length $n$ and all length-$n$ substrings of a text for which the Hamming distance does not exceed a given threshold $k$. In our problem formulation, we report not only the Hamming distance but also, on demand, the full \\emph{mismatch information}, that is the list of mismatched pairs of symbols and their indices. The twin challenges of streaming pattern matching derive from the need both to achieve small working space an","authors_text":"Ely Porat, Rapha\\\"el Clifford, Tomasz Kociumaka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-17T12:13:53Z","title":"The streaming $k$-mismatch problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05223","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:74758f8bf85c590c7e4793fa94af2c7a1f12d8d12f87ade31186d723b5f11563","target":"record","created_at":"2026-05-18T00:19:03Z","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":"57aa70ff03d7080a7ec42faf1bcf0cae96ef1ffd8d78523b80cb7630f621a2b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-17T12:13:53Z","title_canon_sha256":"0cbeb1fdb4e464a7647a6cbf04adfbaab3a9e56f39ca19467c75610bfb67bd06"},"schema_version":"1.0","source":{"id":"1708.05223","kind":"arxiv","version":2}},"canonical_sha256":"b280907e0369e8aa18c653ddc244c9521c0ddbaff1bd7cf6c6b6e1fac0c6188f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b280907e0369e8aa18c653ddc244c9521c0ddbaff1bd7cf6c6b6e1fac0c6188f","first_computed_at":"2026-05-18T00:19:03.787303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:03.787303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0nU9M9fDPzQIyBivhFpFbMGfXwU9OXIrFuLxiWpd8K7HRTZs9DHRk4Rb3QvVM5AKUfgRCEbCgfH/VpUGr3FTAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:03.787876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05223","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74758f8bf85c590c7e4793fa94af2c7a1f12d8d12f87ade31186d723b5f11563","sha256:15f740b701f20a070c92e6783f93337336ea5067a81e2a343916bc1ce5ee0a6b"],"state_sha256":"65355adab9f9cdfe157b1a249c390add36805c2c41a209db30486e309498caed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cT/EimKi5BNnsU8SAGqWinxFocYrFniNud8Dw1tZSJ8wxKLVDbvGnz+lUSixEg8CJczhSq6pAAN7Nrph2J2BCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:43:00.520188Z","bundle_sha256":"dc7d7a3970bdefb05f38f7da469eb66776cded842b23a224577cf7d37b7206ce"}}