{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2JKLODZEYEYLNPQIHQVRHZ6CYC","short_pith_number":"pith:2JKLODZE","schema_version":"1.0","canonical_sha256":"d254b70f24c130b6be083c2b13e7c2c098eb8c52aaeef39db9669cbce9a0c6e4","source":{"kind":"arxiv","id":"1705.04022","version":1},"attestation_state":"computed","paper":{"title":"Faster algorithms for 1-mappability of a sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Mai Alzamel, Panagiotis Charalampopoulos, Solon P. Pissis, Wing-Kin Sung","submitted_at":"2017-05-11T05:52:51Z","abstract_excerpt":"In the k-mappability problem, we are given a string x of length n and integers m and k, and we are asked to count, for each length-m factor y of x, the number of other factors of length m of x that are at Hamming distance at most k from y. We focus here on the version of the problem where k = 1. The fastest known algorithm for k = 1 requires time O(mn log n/ log log n) and space O(n). We present two algorithms that require worst-case time O(mn) and O(n log^2 n), respectively, and space O(n), thus greatly improving the state of the art. Moreover, we present an algorithm that requires average-ca"},"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":"1705.04022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-11T05:52:51Z","cross_cats_sorted":[],"title_canon_sha256":"6c27c51392b6faa99fe59b75af5ae22793bcee060b926179555116d83ad35d80","abstract_canon_sha256":"8d44a1e05c0f0a09ed5578b4546e9e3809fbd7e6dd7b8bd726da72a51dd784cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:41.608783Z","signature_b64":"eeWjDN1e/HCT/p2CZ8ndytaVhYjK6tPkzPQiiEQdFW2duCS4teKmINAbGRQBew8WfH5GkSIyWg+OzD1Q/i62AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d254b70f24c130b6be083c2b13e7c2c098eb8c52aaeef39db9669cbce9a0c6e4","last_reissued_at":"2026-05-18T00:44:41.608277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:41.608277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster algorithms for 1-mappability of a sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Mai Alzamel, Panagiotis Charalampopoulos, Solon P. Pissis, Wing-Kin Sung","submitted_at":"2017-05-11T05:52:51Z","abstract_excerpt":"In the k-mappability problem, we are given a string x of length n and integers m and k, and we are asked to count, for each length-m factor y of x, the number of other factors of length m of x that are at Hamming distance at most k from y. We focus here on the version of the problem where k = 1. The fastest known algorithm for k = 1 requires time O(mn log n/ log log n) and space O(n). We present two algorithms that require worst-case time O(mn) and O(n log^2 n), respectively, and space O(n), thus greatly improving the state of the art. Moreover, we present an algorithm that requires average-ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04022","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":"1705.04022","created_at":"2026-05-18T00:44:41.608369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04022v1","created_at":"2026-05-18T00:44:41.608369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04022","created_at":"2026-05-18T00:44:41.608369+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JKLODZEYEYL","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JKLODZEYEYLNPQI","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JKLODZE","created_at":"2026-05-18T12:30:55.937587+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/2JKLODZEYEYLNPQIHQVRHZ6CYC","json":"https://pith.science/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC.json","graph_json":"https://pith.science/api/pith-number/2JKLODZEYEYLNPQIHQVRHZ6CYC/graph.json","events_json":"https://pith.science/api/pith-number/2JKLODZEYEYLNPQIHQVRHZ6CYC/events.json","paper":"https://pith.science/paper/2JKLODZE"},"agent_actions":{"view_html":"https://pith.science/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC","download_json":"https://pith.science/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC.json","view_paper":"https://pith.science/paper/2JKLODZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04022&json=true","fetch_graph":"https://pith.science/api/pith-number/2JKLODZEYEYLNPQIHQVRHZ6CYC/graph.json","fetch_events":"https://pith.science/api/pith-number/2JKLODZEYEYLNPQIHQVRHZ6CYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC/action/storage_attestation","attest_author":"https://pith.science/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC/action/author_attestation","sign_citation":"https://pith.science/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC/action/citation_signature","submit_replication":"https://pith.science/pith/2JKLODZEYEYLNPQIHQVRHZ6CYC/action/replication_record"}},"created_at":"2026-05-18T00:44:41.608369+00:00","updated_at":"2026-05-18T00:44:41.608369+00:00"}