{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MTSCDRFSDCG6PI6NDFSQWPB4W4","short_pith_number":"pith:MTSCDRFS","schema_version":"1.0","canonical_sha256":"64e421c4b2188de7a3cd19650b3c3cb733198c50a932aa41be9b2e5a083f2cff","source":{"kind":"arxiv","id":"1602.07241","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.07241","created_at":"2026-05-18T01:20:06.863360+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07241v1","created_at":"2026-05-18T01:20:06.863360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07241","created_at":"2026-05-18T01:20:06.863360+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTSCDRFSDCG6","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTSCDRFSDCG6PI6N","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTSCDRFS","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4","json":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4.json","graph_json":"https://pith.science/api/pith-number/MTSCDRFSDCG6PI6NDFSQWPB4W4/graph.json","events_json":"https://pith.science/api/pith-number/MTSCDRFSDCG6PI6NDFSQWPB4W4/events.json","paper":"https://pith.science/paper/MTSCDRFS"},"agent_actions":{"view_html":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4","download_json":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4.json","view_paper":"https://pith.science/paper/MTSCDRFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07241&json=true","fetch_graph":"https://pith.science/api/pith-number/MTSCDRFSDCG6PI6NDFSQWPB4W4/graph.json","fetch_events":"https://pith.science/api/pith-number/MTSCDRFSDCG6PI6NDFSQWPB4W4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4/action/storage_attestation","attest_author":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4/action/author_attestation","sign_citation":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4/action/citation_signature","submit_replication":"https://pith.science/pith/MTSCDRFSDCG6PI6NDFSQWPB4W4/action/replication_record"}},"created_at":"2026-05-18T01:20:06.863360+00:00","updated_at":"2026-05-18T01:20:06.863360+00:00"}