{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JHWN3DNKMNUYBZDFBIU3RSJRZA","short_pith_number":"pith:JHWN3DNK","canonical_record":{"source":{"id":"1711.04367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-12T21:53:25Z","cross_cats_sorted":[],"title_canon_sha256":"b18d9ad7b45db0c95d74cec7eaad35cd5ae4eeae1ed229534d4922e63478983a","abstract_canon_sha256":"4bbe92d3a6c7fe42257b8683737c4593b55277d28d411ead28d2981018997e0b"},"schema_version":"1.0"},"canonical_sha256":"49ecdd8daa636980e4650a29b8c931c83b0125886e582fe6b62e8840658ba411","source":{"kind":"arxiv","id":"1711.04367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04367","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04367v1","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04367","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"JHWN3DNKMNUY","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JHWN3DNKMNUYBZDF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JHWN3DNK","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JHWN3DNKMNUYBZDFBIU3RSJRZA","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-12T21:53:25Z","cross_cats_sorted":[],"title_canon_sha256":"b18d9ad7b45db0c95d74cec7eaad35cd5ae4eeae1ed229534d4922e63478983a","abstract_canon_sha256":"4bbe92d3a6c7fe42257b8683737c4593b55277d28d411ead28d2981018997e0b"},"schema_version":"1.0"},"canonical_sha256":"49ecdd8daa636980e4650a29b8c931c83b0125886e582fe6b62e8840658ba411","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:39.246339Z","signature_b64":"wUb7KfG7YwQb0aKe8zfbYwc+EN6Uio9nA+Jbs+IV4mfDGeZMdKq0I32HIBRw2iCLJNLARr6dhxUmVHFe5ow/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49ecdd8daa636980e4650a29b8c931c83b0125886e582fe6b62e8840658ba411","last_reissued_at":"2026-05-18T00:30:39.245667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:39.245667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04367","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-18T00:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K00tQvsvtFAuXl1/0gLXfcFSPL8MG0HIiM/yhsiXc4dGg0nNYXmFCKe9M8ojZ54pNydNR2/+v3Ej93kl8Z2oBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:51:32.900420Z"},"content_sha256":"e79e76db2c7e10bf8a425b9e1cbc0105d50f1dde45dc0b6fd1917cd792627c6c","schema_version":"1.0","event_id":"sha256:e79e76db2c7e10bf8a425b9e1cbc0105d50f1dde45dc0b6fd1917cd792627c6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JHWN3DNKMNUYBZDFBIU3RSJRZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Longest Alignment with Edits in Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou","submitted_at":"2017-11-12T21:53:25Z","abstract_excerpt":"Analyzing patterns in data streams generated by network traffic, sensor networks, or satellite feeds is a challenge for systems in which the available storage is limited. In addition, real data is noisy, which makes designing data stream algorithms even more challenging.\n  Motivated by such challenges, we study algorithms for detecting the similarity of two data streams that can be read in sync. Two strings $S, T\\in \\Sigma^n$ form a $d$-near-alignment if the distance between them in some given metric is at most $d$. We study the problem of identifying a longest substring of $S$ and $T$ that fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04367","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-18T00:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Fy1DP63qTlh66i1TFZ2nPQev80fmXFDWGR0X/NnZ4aTFOqBzjKEYgIP6pGIXCdpTAB9yRmWOsDIn9Vbo3KUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:51:32.900820Z"},"content_sha256":"cca5368ad4dd52ccd9dcaeb1da1ee76541d82d481ccb5faf2d495789b198a8b5","schema_version":"1.0","event_id":"sha256:cca5368ad4dd52ccd9dcaeb1da1ee76541d82d481ccb5faf2d495789b198a8b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JHWN3DNKMNUYBZDFBIU3RSJRZA/bundle.json","state_url":"https://pith.science/pith/JHWN3DNKMNUYBZDFBIU3RSJRZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JHWN3DNKMNUYBZDFBIU3RSJRZA/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-27T00:51:32Z","links":{"resolver":"https://pith.science/pith/JHWN3DNKMNUYBZDFBIU3RSJRZA","bundle":"https://pith.science/pith/JHWN3DNKMNUYBZDFBIU3RSJRZA/bundle.json","state":"https://pith.science/pith/JHWN3DNKMNUYBZDFBIU3RSJRZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JHWN3DNKMNUYBZDFBIU3RSJRZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JHWN3DNKMNUYBZDFBIU3RSJRZA","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":"4bbe92d3a6c7fe42257b8683737c4593b55277d28d411ead28d2981018997e0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-12T21:53:25Z","title_canon_sha256":"b18d9ad7b45db0c95d74cec7eaad35cd5ae4eeae1ed229534d4922e63478983a"},"schema_version":"1.0","source":{"id":"1711.04367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04367","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04367v1","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04367","created_at":"2026-05-18T00:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"JHWN3DNKMNUY","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JHWN3DNKMNUYBZDF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JHWN3DNK","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:cca5368ad4dd52ccd9dcaeb1da1ee76541d82d481ccb5faf2d495789b198a8b5","target":"graph","created_at":"2026-05-18T00:30:39Z","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":"Analyzing patterns in data streams generated by network traffic, sensor networks, or satellite feeds is a challenge for systems in which the available storage is limited. In addition, real data is noisy, which makes designing data stream algorithms even more challenging.\n  Motivated by such challenges, we study algorithms for detecting the similarity of two data streams that can be read in sync. Two strings $S, T\\in \\Sigma^n$ form a $d$-near-alignment if the distance between them in some given metric is at most $d$. We study the problem of identifying a longest substring of $S$ and $T$ that fo","authors_text":"Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-12T21:53:25Z","title":"Longest Alignment with Edits in Data Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04367","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:e79e76db2c7e10bf8a425b9e1cbc0105d50f1dde45dc0b6fd1917cd792627c6c","target":"record","created_at":"2026-05-18T00:30:39Z","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":"4bbe92d3a6c7fe42257b8683737c4593b55277d28d411ead28d2981018997e0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-12T21:53:25Z","title_canon_sha256":"b18d9ad7b45db0c95d74cec7eaad35cd5ae4eeae1ed229534d4922e63478983a"},"schema_version":"1.0","source":{"id":"1711.04367","kind":"arxiv","version":1}},"canonical_sha256":"49ecdd8daa636980e4650a29b8c931c83b0125886e582fe6b62e8840658ba411","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49ecdd8daa636980e4650a29b8c931c83b0125886e582fe6b62e8840658ba411","first_computed_at":"2026-05-18T00:30:39.245667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:39.245667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wUb7KfG7YwQb0aKe8zfbYwc+EN6Uio9nA+Jbs+IV4mfDGeZMdKq0I32HIBRw2iCLJNLARr6dhxUmVHFe5ow/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:39.246339Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e79e76db2c7e10bf8a425b9e1cbc0105d50f1dde45dc0b6fd1917cd792627c6c","sha256:cca5368ad4dd52ccd9dcaeb1da1ee76541d82d481ccb5faf2d495789b198a8b5"],"state_sha256":"623a2ae536b7970104350e1a6b8589e5b3f202df9551be5073150994aa6e1770"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HlGdAWvjyj2DK+So37Iy+cxiynjZh4rr2RQfrA+H9UfWgHnps3jVGnNc5PQSyZU3JFaZWVo3kdzaxIBbG35ZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:51:32.903574Z","bundle_sha256":"13c8b6a3ea2ba48f29efaed61e97e2082509466b296d36c09ce789dc5dc7edbf"}}