{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YX337UM7EIYFV3OO4PDNRV5BWK","short_pith_number":"pith:YX337UM7","schema_version":"1.0","canonical_sha256":"c5f7bfd19f22305aedcee3c6d8d7a1b2805df606679a725e1cf93aee6a1e9165","source":{"kind":"arxiv","id":"1512.04515","version":1},"attestation_state":"computed","paper":{"title":"Breaking the Variance: Approximating the Hamming Distance in $\\tilde O(1/\\epsilon)$ Time Per Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ely Porat, Tsvi Kopelowitz","submitted_at":"2015-12-14T20:53:15Z","abstract_excerpt":"The algorithmic tasks of computing the Hamming distance between a given pattern of length $m$ and each location in a text of length $n$ is one of the most fundamental algorithmic tasks in string algorithms. Unfortunately, there is evidence that for a text $T$ of size $n$ and a pattern $P$ of size $m$, one cannot compute the exact Hamming distance for all locations in $T$ in time which is less than $\\tilde O(n\\sqrt m)$. However, Karloff~\\cite{karloff} showed that if one is willing to suffer a $1\\pm\\epsilon$ approximation, then it is possible to solve the problem with high probability, in $\\tild"},"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":"1512.04515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-14T20:53:15Z","cross_cats_sorted":[],"title_canon_sha256":"999080caab497237c9123fe93f211200a277e64225d9c478f1da3dbdaf2587b3","abstract_canon_sha256":"d9a4afb6e566391452fd3008675865f93c0e2dad4582af23c67eae5d79f4508a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:22.079982Z","signature_b64":"fOgoCFIHBP4iTB8TSyWzef6XljbMSoQqPj2XcsE3NwsOcFM8B1phK0jRxgT/CzpZ3rLWwvtkr6VEcmaYcEcQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5f7bfd19f22305aedcee3c6d8d7a1b2805df606679a725e1cf93aee6a1e9165","last_reissued_at":"2026-05-18T01:24:22.079308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:22.079308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking the Variance: Approximating the Hamming Distance in $\\tilde O(1/\\epsilon)$ Time Per Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ely Porat, Tsvi Kopelowitz","submitted_at":"2015-12-14T20:53:15Z","abstract_excerpt":"The algorithmic tasks of computing the Hamming distance between a given pattern of length $m$ and each location in a text of length $n$ is one of the most fundamental algorithmic tasks in string algorithms. Unfortunately, there is evidence that for a text $T$ of size $n$ and a pattern $P$ of size $m$, one cannot compute the exact Hamming distance for all locations in $T$ in time which is less than $\\tilde O(n\\sqrt m)$. However, Karloff~\\cite{karloff} showed that if one is willing to suffer a $1\\pm\\epsilon$ approximation, then it is possible to solve the problem with high probability, in $\\tild"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04515","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":"1512.04515","created_at":"2026-05-18T01:24:22.079420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04515v1","created_at":"2026-05-18T01:24:22.079420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04515","created_at":"2026-05-18T01:24:22.079420+00:00"},{"alias_kind":"pith_short_12","alias_value":"YX337UM7EIYF","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YX337UM7EIYFV3OO","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YX337UM7","created_at":"2026-05-18T12:29:52.810259+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/YX337UM7EIYFV3OO4PDNRV5BWK","json":"https://pith.science/pith/YX337UM7EIYFV3OO4PDNRV5BWK.json","graph_json":"https://pith.science/api/pith-number/YX337UM7EIYFV3OO4PDNRV5BWK/graph.json","events_json":"https://pith.science/api/pith-number/YX337UM7EIYFV3OO4PDNRV5BWK/events.json","paper":"https://pith.science/paper/YX337UM7"},"agent_actions":{"view_html":"https://pith.science/pith/YX337UM7EIYFV3OO4PDNRV5BWK","download_json":"https://pith.science/pith/YX337UM7EIYFV3OO4PDNRV5BWK.json","view_paper":"https://pith.science/paper/YX337UM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04515&json=true","fetch_graph":"https://pith.science/api/pith-number/YX337UM7EIYFV3OO4PDNRV5BWK/graph.json","fetch_events":"https://pith.science/api/pith-number/YX337UM7EIYFV3OO4PDNRV5BWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YX337UM7EIYFV3OO4PDNRV5BWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YX337UM7EIYFV3OO4PDNRV5BWK/action/storage_attestation","attest_author":"https://pith.science/pith/YX337UM7EIYFV3OO4PDNRV5BWK/action/author_attestation","sign_citation":"https://pith.science/pith/YX337UM7EIYFV3OO4PDNRV5BWK/action/citation_signature","submit_replication":"https://pith.science/pith/YX337UM7EIYFV3OO4PDNRV5BWK/action/replication_record"}},"created_at":"2026-05-18T01:24:22.079420+00:00","updated_at":"2026-05-18T01:24:22.079420+00:00"}