{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:64WEZYTITJZECA33BTHOTRTM63","short_pith_number":"pith:64WEZYTI","schema_version":"1.0","canonical_sha256":"f72c4ce2689a7241037b0ccee9c66cf6d1fd590078932c799992f2e0f28935a6","source":{"kind":"arxiv","id":"1312.2381","version":1},"attestation_state":"computed","paper":{"title":"A Note on the Longest Common Compatible Prefix Problem for Partial Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"Alessio Langiu, Bartosz Szreder, Costas S. Iliopoulos, Jakub Radoszewski, Marcin Kubica, Maxime Crochemore, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","submitted_at":"2013-12-09T11:10:11Z","abstract_excerpt":"For a partial word $w$ the longest common compatible prefix of two positions $i,j$, denoted $lccp(i,j)$, is the largest $k$ such that $w[i,i+k-1]\\uparrow w[j,j+k-1]$, where $\\uparrow$ is the compatibility relation of partial words (it is not an equivalence relation). The LCCP problem is to preprocess a partial word in such a way that any query $lccp(i,j)$ about this word can be answered in $O(1)$ time. It is a natural generalization of the longest common prefix (LCP) problem for regular words, for which an $O(n)$ preprocessing time and $O(1)$ query time solution exists.\n  Recently an efficient"},"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":"1312.2381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-09T11:10:11Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"0b0dc821bc3f12471006f5841cc6da14d34fe085804bca7cbc6e1b8239cd1904","abstract_canon_sha256":"889906ff5a668e2378e7bbe39f06916e8e74dc8a1954dc4b5733d3d4111b5c85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:10.390844Z","signature_b64":"dw3gi6L/aj0DDP3EAmNxR85CZ5x578Nc5I9svIAUgDGqAbtI5V7e22Mmwj/OUtc5c2c6NX9DI74B4XHAg5qDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f72c4ce2689a7241037b0ccee9c66cf6d1fd590078932c799992f2e0f28935a6","last_reissued_at":"2026-05-18T03:05:10.390371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:10.390371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on the Longest Common Compatible Prefix Problem for Partial Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DS","authors_text":"Alessio Langiu, Bartosz Szreder, Costas S. Iliopoulos, Jakub Radoszewski, Marcin Kubica, Maxime Crochemore, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","submitted_at":"2013-12-09T11:10:11Z","abstract_excerpt":"For a partial word $w$ the longest common compatible prefix of two positions $i,j$, denoted $lccp(i,j)$, is the largest $k$ such that $w[i,i+k-1]\\uparrow w[j,j+k-1]$, where $\\uparrow$ is the compatibility relation of partial words (it is not an equivalence relation). The LCCP problem is to preprocess a partial word in such a way that any query $lccp(i,j)$ about this word can be answered in $O(1)$ time. It is a natural generalization of the longest common prefix (LCP) problem for regular words, for which an $O(n)$ preprocessing time and $O(1)$ query time solution exists.\n  Recently an efficient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2381","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":"1312.2381","created_at":"2026-05-18T03:05:10.390446+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.2381v1","created_at":"2026-05-18T03:05:10.390446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2381","created_at":"2026-05-18T03:05:10.390446+00:00"},{"alias_kind":"pith_short_12","alias_value":"64WEZYTITJZE","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"64WEZYTITJZECA33","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"64WEZYTI","created_at":"2026-05-18T12:27:34.582898+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/64WEZYTITJZECA33BTHOTRTM63","json":"https://pith.science/pith/64WEZYTITJZECA33BTHOTRTM63.json","graph_json":"https://pith.science/api/pith-number/64WEZYTITJZECA33BTHOTRTM63/graph.json","events_json":"https://pith.science/api/pith-number/64WEZYTITJZECA33BTHOTRTM63/events.json","paper":"https://pith.science/paper/64WEZYTI"},"agent_actions":{"view_html":"https://pith.science/pith/64WEZYTITJZECA33BTHOTRTM63","download_json":"https://pith.science/pith/64WEZYTITJZECA33BTHOTRTM63.json","view_paper":"https://pith.science/paper/64WEZYTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.2381&json=true","fetch_graph":"https://pith.science/api/pith-number/64WEZYTITJZECA33BTHOTRTM63/graph.json","fetch_events":"https://pith.science/api/pith-number/64WEZYTITJZECA33BTHOTRTM63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/64WEZYTITJZECA33BTHOTRTM63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/64WEZYTITJZECA33BTHOTRTM63/action/storage_attestation","attest_author":"https://pith.science/pith/64WEZYTITJZECA33BTHOTRTM63/action/author_attestation","sign_citation":"https://pith.science/pith/64WEZYTITJZECA33BTHOTRTM63/action/citation_signature","submit_replication":"https://pith.science/pith/64WEZYTITJZECA33BTHOTRTM63/action/replication_record"}},"created_at":"2026-05-18T03:05:10.390446+00:00","updated_at":"2026-05-18T03:05:10.390446+00:00"}