{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MTSCDRFSDCG6PI6NDFSQWPB4W4","short_pith_number":"pith:MTSCDRFS","canonical_record":{"source":{"id":"1602.07241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-23T17:21:26Z","cross_cats_sorted":[],"title_canon_sha256":"2d042084f4a181d7b31920a28cf2cd324e5f3a0de17920e30eb9e1efc7d6617f","abstract_canon_sha256":"6ccc075ee70e814509a46cf3edf42fe6edee3bd1516424222764ef9b82f7cf82"},"schema_version":"1.0"},"canonical_sha256":"64e421c4b2188de7a3cd19650b3c3cb733198c50a932aa41be9b2e5a083f2cff","source":{"kind":"arxiv","id":"1602.07241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07241","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07241v1","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07241","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"MTSCDRFSDCG6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MTSCDRFSDCG6PI6N","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MTSCDRFS","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MTSCDRFSDCG6PI6NDFSQWPB4W4","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-23T17:21:26Z","cross_cats_sorted":[],"title_canon_sha256":"2d042084f4a181d7b31920a28cf2cd324e5f3a0de17920e30eb9e1efc7d6617f","abstract_canon_sha256":"6ccc075ee70e814509a46cf3edf42fe6edee3bd1516424222764ef9b82f7cf82"},"schema_version":"1.0"},"canonical_sha256":"64e421c4b2188de7a3cd19650b3c3cb733198c50a932aa41be9b2e5a083f2cff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:06.863817Z","signature_b64":"ed1UQ+ox2I9s3v0xNlrtoJUCsj0UMirGWZnyKui+43rnMR5NW4DwBtwTeOztI9JHy4vKH6InMNrnvupo7GtADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64e421c4b2188de7a3cd19650b3c3cb733198c50a932aa41be9b2e5a083f2cff","last_reissued_at":"2026-05-18T01:20:06.863259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:06.863259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07241","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-18T01:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"29oGkK8TIwM18gee3n1GO4ZPp99rTueUP5h9MZQM2kxOKusjacescLCoI4JNY+6wqWoMOl469PVtWlamuw5BDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:14:30.679442Z"},"content_sha256":"220db3b37cfca81b6ab95af98c89e0cea3946f710a1034f792fe05e5b7acc270","schema_version":"1.0","event_id":"sha256:220db3b37cfca81b6ab95af98c89e0cea3946f710a1034f792fe05e5b7acc270"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MTSCDRFSDCG6PI6NDFSQWPB4W4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Hamming distance in a stream","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raphael Clifford, Tatiana Starikovskaya","submitted_at":"2016-02-23T17:21:26Z","abstract_excerpt":"We consider the problem of computing a $(1+\\epsilon)$-approximation of the Hamming distance between a pattern of length $n$ and successive substrings of a stream. We first look at the one-way randomised communication complexity of this problem, giving Alice the first half of the stream and Bob the second half. We show the following: (1) If Alice and Bob both share the pattern then there is an $O(\\epsilon^{-4} \\log^2 n)$ bit randomised one-way communication protocol. (2) If only Alice has the pattern then there is an $O(\\epsilon^{-2}\\sqrt{n}\\log n)$ bit randomised one-way communication protocol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07241","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-18T01:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UD0mX5aw5lhHbsmkrfTNqupV/f5XnHOBjdndn89iD9m0BggEpwJP073QoljdIb1H6h+WEK7ZEYjb1sCPmwveDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:14:30.680058Z"},"content_sha256":"db4f9f189da3b00770d18d07cab507330c397883d5597d131ac262e3dc3e3184","schema_version":"1.0","event_id":"sha256:db4f9f189da3b00770d18d07cab507330c397883d5597d131ac262e3dc3e3184"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4/bundle.json","state_url":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4/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-24T20:14:30Z","links":{"resolver":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4","bundle":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4/bundle.json","state":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MTSCDRFSDCG6PI6NDFSQWPB4W4","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":"6ccc075ee70e814509a46cf3edf42fe6edee3bd1516424222764ef9b82f7cf82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-23T17:21:26Z","title_canon_sha256":"2d042084f4a181d7b31920a28cf2cd324e5f3a0de17920e30eb9e1efc7d6617f"},"schema_version":"1.0","source":{"id":"1602.07241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07241","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07241v1","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07241","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"MTSCDRFSDCG6","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MTSCDRFSDCG6PI6N","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MTSCDRFS","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:db4f9f189da3b00770d18d07cab507330c397883d5597d131ac262e3dc3e3184","target":"graph","created_at":"2026-05-18T01:20:06Z","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 a $(1+\\epsilon)$-approximation of the Hamming distance between a pattern of length $n$ and successive substrings of a stream. We first look at the one-way randomised communication complexity of this problem, giving Alice the first half of the stream and Bob the second half. We show the following: (1) If Alice and Bob both share the pattern then there is an $O(\\epsilon^{-4} \\log^2 n)$ bit randomised one-way communication protocol. (2) If only Alice has the pattern then there is an $O(\\epsilon^{-2}\\sqrt{n}\\log n)$ bit randomised one-way communication protocol","authors_text":"Raphael Clifford, Tatiana Starikovskaya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-23T17:21:26Z","title":"Approximate Hamming distance in a stream"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07241","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:220db3b37cfca81b6ab95af98c89e0cea3946f710a1034f792fe05e5b7acc270","target":"record","created_at":"2026-05-18T01:20:06Z","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":"6ccc075ee70e814509a46cf3edf42fe6edee3bd1516424222764ef9b82f7cf82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-23T17:21:26Z","title_canon_sha256":"2d042084f4a181d7b31920a28cf2cd324e5f3a0de17920e30eb9e1efc7d6617f"},"schema_version":"1.0","source":{"id":"1602.07241","kind":"arxiv","version":1}},"canonical_sha256":"64e421c4b2188de7a3cd19650b3c3cb733198c50a932aa41be9b2e5a083f2cff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64e421c4b2188de7a3cd19650b3c3cb733198c50a932aa41be9b2e5a083f2cff","first_computed_at":"2026-05-18T01:20:06.863259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:06.863259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ed1UQ+ox2I9s3v0xNlrtoJUCsj0UMirGWZnyKui+43rnMR5NW4DwBtwTeOztI9JHy4vKH6InMNrnvupo7GtADw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:06.863817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:220db3b37cfca81b6ab95af98c89e0cea3946f710a1034f792fe05e5b7acc270","sha256:db4f9f189da3b00770d18d07cab507330c397883d5597d131ac262e3dc3e3184"],"state_sha256":"2618a50cff59deea5e1fe142806026aae19744db366799a36fbad49f5a205617"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IszVF4Tw4tZu27kA8QADnqCoR3pkwWe9/dJJrV9CDzT2PgnNgpPh970K+iHt2ECIsa0MHasyRaxxhZ3Ijw0KDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T20:14:30.683290Z","bundle_sha256":"474acb259cd3597a1ea3a7b920ab9e9505f17b7128877eb2f5d7d77cd90a9357"}}