{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Y5QCI3SPCA43WF5BWSBH6CHAY4","short_pith_number":"pith:Y5QCI3SP","schema_version":"1.0","canonical_sha256":"c760246e4f1039bb17a1b4827f08e0c70e9e011721839d9dd9cdcf7888efe2e7","source":{"kind":"arxiv","id":"1901.11305","version":1},"attestation_state":"computed","paper":{"title":"Quasi-Linear-Time Algorithm for Longest Common Circular Factor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Juliusz Straszy\\'nski, Mai Alzamel, Maxime Crochemore, Tomasz Kociumaka, Tomasz Wale\\'n, Wiktor Zuba, Wojciech Rytter","submitted_at":"2019-01-31T11:15:04Z","abstract_excerpt":"We introduce the Longest Common Circular Factor (LCCF) problem in which, given strings $S$ and $T$ of length $n$, we are to compute the longest factor of $S$ whose cyclic shift occurs as a factor of $T$. It is a new similarity measure, an extension of the classic Longest Common Factor. We show how to solve the LCCF problem in $O(n \\log^5 n)$ time."},"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":"1901.11305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-31T11:15:04Z","cross_cats_sorted":[],"title_canon_sha256":"07a19417a55c69c1e273d02e5632346ca1d086ccee6e5c1a98bbae96a5c6dfcb","abstract_canon_sha256":"9c7dae5d0df8fc2dc2b3f6c79fa3b2f5421b15e220f728ec1d2032166411472b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:02.249119Z","signature_b64":"GQXZhuaJYaTL+XZeAronCi6cCzjwUMGoI5zWM00usn9n6cVDYLyyfZTDf7Ok8Q0tEYOZTZYsJIsnatf/w9TFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c760246e4f1039bb17a1b4827f08e0c70e9e011721839d9dd9cdcf7888efe2e7","last_reissued_at":"2026-05-17T23:55:02.248558Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:02.248558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-Linear-Time Algorithm for Longest Common Circular Factor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Juliusz Straszy\\'nski, Mai Alzamel, Maxime Crochemore, Tomasz Kociumaka, Tomasz Wale\\'n, Wiktor Zuba, Wojciech Rytter","submitted_at":"2019-01-31T11:15:04Z","abstract_excerpt":"We introduce the Longest Common Circular Factor (LCCF) problem in which, given strings $S$ and $T$ of length $n$, we are to compute the longest factor of $S$ whose cyclic shift occurs as a factor of $T$. It is a new similarity measure, an extension of the classic Longest Common Factor. We show how to solve the LCCF problem in $O(n \\log^5 n)$ time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11305","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":"1901.11305","created_at":"2026-05-17T23:55:02.248633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.11305v1","created_at":"2026-05-17T23:55:02.248633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11305","created_at":"2026-05-17T23:55:02.248633+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5QCI3SPCA43","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5QCI3SPCA43WF5B","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5QCI3SP","created_at":"2026-05-18T12:33:33.725879+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/Y5QCI3SPCA43WF5BWSBH6CHAY4","json":"https://pith.science/pith/Y5QCI3SPCA43WF5BWSBH6CHAY4.json","graph_json":"https://pith.science/api/pith-number/Y5QCI3SPCA43WF5BWSBH6CHAY4/graph.json","events_json":"https://pith.science/api/pith-number/Y5QCI3SPCA43WF5BWSBH6CHAY4/events.json","paper":"https://pith.science/paper/Y5QCI3SP"},"agent_actions":{"view_html":"https://pith.science/pith/Y5QCI3SPCA43WF5BWSBH6CHAY4","download_json":"https://pith.science/pith/Y5QCI3SPCA43WF5BWSBH6CHAY4.json","view_paper":"https://pith.science/paper/Y5QCI3SP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.11305&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5QCI3SPCA43WF5BWSBH6CHAY4/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5QCI3SPCA43WF5BWSBH6CHAY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5QCI3SPCA43WF5BWSBH6CHAY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5QCI3SPCA43WF5BWSBH6CHAY4/action/storage_attestation","attest_author":"https://pith.science/pith/Y5QCI3SPCA43WF5BWSBH6CHAY4/action/author_attestation","sign_citation":"https://pith.science/pith/Y5QCI3SPCA43WF5BWSBH6CHAY4/action/citation_signature","submit_replication":"https://pith.science/pith/Y5QCI3SPCA43WF5BWSBH6CHAY4/action/replication_record"}},"created_at":"2026-05-17T23:55:02.248633+00:00","updated_at":"2026-05-17T23:55:02.248633+00:00"}