{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7PQVMMR3KW6KIXDQOEKH3SGRLI","short_pith_number":"pith:7PQVMMR3","schema_version":"1.0","canonical_sha256":"fbe156323b55bca45c7071147dc8d15a3b802d8a0cd68a4505402ded2f557b1a","source":{"kind":"arxiv","id":"1406.5480","version":2},"attestation_state":"computed","paper":{"title":"Average-Case Optimal Approximate Circular String Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carl Barton, Costas S. Iliopoulos, Solon P. Pissis","submitted_at":"2014-06-20T18:37:14Z","abstract_excerpt":"Approximate string matching is the problem of finding all factors of a text t of length n that are at a distance at most k from a pattern x of length m. Approximate circular string matching is the problem of finding all factors of t that are at a distance at most k from x or from any of its rotations. In this article, we present a new algorithm for approximate circular string matching under the edit distance model with optimal average-case search time O(n(k + log m)/m). Optimal average-case search time can also be achieved by the algorithms for multiple approximate string matching (Fredriksson"},"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":"1406.5480","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-20T18:37:14Z","cross_cats_sorted":[],"title_canon_sha256":"602992fdfeb89f58a34fc75318b5cd525e1be5b64a9d10747b0773c3327975ee","abstract_canon_sha256":"299f5d286988555b8bee137bb35d19a8e02cff7ed4aadcabd37e6f48960ab236"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:26.764950Z","signature_b64":"Qgrjx6xUqWnaEGHXZyYRVkWu5N1XQXQ4iar8MsRrwGfaMtsCygwkPdBJY6X7+zvGGxOL/NdYXT9Aj1VrunUdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbe156323b55bca45c7071147dc8d15a3b802d8a0cd68a4505402ded2f557b1a","last_reissued_at":"2026-05-18T01:16:26.764555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:26.764555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average-Case Optimal Approximate Circular String Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carl Barton, Costas S. Iliopoulos, Solon P. Pissis","submitted_at":"2014-06-20T18:37:14Z","abstract_excerpt":"Approximate string matching is the problem of finding all factors of a text t of length n that are at a distance at most k from a pattern x of length m. Approximate circular string matching is the problem of finding all factors of t that are at a distance at most k from x or from any of its rotations. In this article, we present a new algorithm for approximate circular string matching under the edit distance model with optimal average-case search time O(n(k + log m)/m). Optimal average-case search time can also be achieved by the algorithms for multiple approximate string matching (Fredriksson"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5480","kind":"arxiv","version":2},"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":"1406.5480","created_at":"2026-05-18T01:16:26.764606+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5480v2","created_at":"2026-05-18T01:16:26.764606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5480","created_at":"2026-05-18T01:16:26.764606+00:00"},{"alias_kind":"pith_short_12","alias_value":"7PQVMMR3KW6K","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7PQVMMR3KW6KIXDQ","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7PQVMMR3","created_at":"2026-05-18T12:28:19.803747+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/7PQVMMR3KW6KIXDQOEKH3SGRLI","json":"https://pith.science/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI.json","graph_json":"https://pith.science/api/pith-number/7PQVMMR3KW6KIXDQOEKH3SGRLI/graph.json","events_json":"https://pith.science/api/pith-number/7PQVMMR3KW6KIXDQOEKH3SGRLI/events.json","paper":"https://pith.science/paper/7PQVMMR3"},"agent_actions":{"view_html":"https://pith.science/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI","download_json":"https://pith.science/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI.json","view_paper":"https://pith.science/paper/7PQVMMR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5480&json=true","fetch_graph":"https://pith.science/api/pith-number/7PQVMMR3KW6KIXDQOEKH3SGRLI/graph.json","fetch_events":"https://pith.science/api/pith-number/7PQVMMR3KW6KIXDQOEKH3SGRLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI/action/storage_attestation","attest_author":"https://pith.science/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI/action/author_attestation","sign_citation":"https://pith.science/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI/action/citation_signature","submit_replication":"https://pith.science/pith/7PQVMMR3KW6KIXDQOEKH3SGRLI/action/replication_record"}},"created_at":"2026-05-18T01:16:26.764606+00:00","updated_at":"2026-05-18T01:16:26.764606+00:00"}