{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:53Y6IA6RBFW4VVGDMVBTZWH5RI","short_pith_number":"pith:53Y6IA6R","schema_version":"1.0","canonical_sha256":"eef1e403d1096dcad4c365433cd8fd8a2c9201fb5adc623366c4d6d1442be515","source":{"kind":"arxiv","id":"1807.10483","version":1},"attestation_state":"computed","paper":{"title":"Faster Recovery of Approximate Periods over Edit Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Radoszewski, Juliusz Straszy\\'nski, Tomasz Kociumaka, Tomasz Wale\\'n, Wiktor Zuba, Wojciech Rytter","submitted_at":"2018-07-27T08:16:29Z","abstract_excerpt":"The approximate period recovery problem asks to compute all $\\textit{approximate word-periods}$ of a given word $S$ of length $n$: all primitive words $P$ ($|P|=p$) which have a periodic extension at edit distance smaller than $\\tau_p$ from $S$, where $\\tau_p = \\lfloor \\frac{n}{(3.75+\\epsilon)\\cdot p} \\rfloor$ for some $\\epsilon>0$. Here, the set of periodic extensions of $P$ consists of all finite prefixes of $P^\\infty$.\n  We improve the time complexity of the fastest known algorithm for this problem of Amir et al. [Theor. Comput. Sci., 2018] from $O(n^{4/3})$ to $O(n \\log n)$. Our tool is a "},"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":"1807.10483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-27T08:16:29Z","cross_cats_sorted":[],"title_canon_sha256":"4f93b679e2e49137d001cb5fa71c0e09ade76759bcf25b31ba05fe2f7cd621ae","abstract_canon_sha256":"32c38218d4cd53f671c819b122c814078ddad931790526f940899aaeb95d85ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:40.454831Z","signature_b64":"gNdS60NB6i1INnRA1StD05QmN/1O8nvj7BPtWbfZYnX5GNVXlfQDMEEqMppD+YZmp+98fGCOVGozL3PO25ZIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eef1e403d1096dcad4c365433cd8fd8a2c9201fb5adc623366c4d6d1442be515","last_reissued_at":"2026-05-18T00:09:40.454235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:40.454235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Recovery of Approximate Periods over Edit Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Radoszewski, Juliusz Straszy\\'nski, Tomasz Kociumaka, Tomasz Wale\\'n, Wiktor Zuba, Wojciech Rytter","submitted_at":"2018-07-27T08:16:29Z","abstract_excerpt":"The approximate period recovery problem asks to compute all $\\textit{approximate word-periods}$ of a given word $S$ of length $n$: all primitive words $P$ ($|P|=p$) which have a periodic extension at edit distance smaller than $\\tau_p$ from $S$, where $\\tau_p = \\lfloor \\frac{n}{(3.75+\\epsilon)\\cdot p} \\rfloor$ for some $\\epsilon>0$. Here, the set of periodic extensions of $P$ consists of all finite prefixes of $P^\\infty$.\n  We improve the time complexity of the fastest known algorithm for this problem of Amir et al. [Theor. Comput. Sci., 2018] from $O(n^{4/3})$ to $O(n \\log n)$. Our tool is a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10483","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":"1807.10483","created_at":"2026-05-18T00:09:40.454327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10483v1","created_at":"2026-05-18T00:09:40.454327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10483","created_at":"2026-05-18T00:09:40.454327+00:00"},{"alias_kind":"pith_short_12","alias_value":"53Y6IA6RBFW4","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"53Y6IA6RBFW4VVGD","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"53Y6IA6R","created_at":"2026-05-18T12:32:05.422762+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/53Y6IA6RBFW4VVGDMVBTZWH5RI","json":"https://pith.science/pith/53Y6IA6RBFW4VVGDMVBTZWH5RI.json","graph_json":"https://pith.science/api/pith-number/53Y6IA6RBFW4VVGDMVBTZWH5RI/graph.json","events_json":"https://pith.science/api/pith-number/53Y6IA6RBFW4VVGDMVBTZWH5RI/events.json","paper":"https://pith.science/paper/53Y6IA6R"},"agent_actions":{"view_html":"https://pith.science/pith/53Y6IA6RBFW4VVGDMVBTZWH5RI","download_json":"https://pith.science/pith/53Y6IA6RBFW4VVGDMVBTZWH5RI.json","view_paper":"https://pith.science/paper/53Y6IA6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10483&json=true","fetch_graph":"https://pith.science/api/pith-number/53Y6IA6RBFW4VVGDMVBTZWH5RI/graph.json","fetch_events":"https://pith.science/api/pith-number/53Y6IA6RBFW4VVGDMVBTZWH5RI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53Y6IA6RBFW4VVGDMVBTZWH5RI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53Y6IA6RBFW4VVGDMVBTZWH5RI/action/storage_attestation","attest_author":"https://pith.science/pith/53Y6IA6RBFW4VVGDMVBTZWH5RI/action/author_attestation","sign_citation":"https://pith.science/pith/53Y6IA6RBFW4VVGDMVBTZWH5RI/action/citation_signature","submit_replication":"https://pith.science/pith/53Y6IA6RBFW4VVGDMVBTZWH5RI/action/replication_record"}},"created_at":"2026-05-18T00:09:40.454327+00:00","updated_at":"2026-05-18T00:09:40.454327+00:00"}