{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FNAULGK743SKVXFPFEY7UDPAZ2","short_pith_number":"pith:FNAULGK7","schema_version":"1.0","canonical_sha256":"2b4145995fe6e4aadcaf2931fa0de0ceaaba3aa0e5ffa0c50f42f85a39fd855e","source":{"kind":"arxiv","id":"1412.3016","version":2},"attestation_state":"computed","paper":{"title":"Computing Covers Using Prefix Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, M. Sohel Rahman, W. F. Smyth","submitted_at":"2014-12-09T16:38:25Z","abstract_excerpt":"An \\emph{indeterminate string} $x = x[1..n]$ on an alphabet $\\Sigma$ is a sequence of nonempty subsets of $\\Sigma$; $x$ is said to be \\emph{regular} if every subset is of size one. A proper substring $u$ of regular $x$ is said to be a \\emph{cover} of $x$ iff for every $i \\in 1..n$, an occurrence of $u$ in $x$ includes $x[i]$. The \\emph{cover array} $\\gamma = \\gamma[1..n]$ of $x$ is an integer array such that $\\gamma[i]$ is the longest cover of $x[1..i]$. Fifteen years ago a complex, though nevertheless linear-time, algorithm was proposed to compute the cover array of regular $x$ based on prior"},"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":"1412.3016","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-09T16:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"3b2eb4ba342655bbb143e2a2f7d25165fcadab2cb84bcd711c426aff3c604a33","abstract_canon_sha256":"44c481c4c33c8ac1b70c5312aa7be8cf8b72cb8fc26b47787fe99ebff0e6bd5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:02.411985Z","signature_b64":"P3dY4mUztqMEb5KTnV6EYk/QaaWNupDTosXj72flu9Fgmyy89HTMF9UYkyGo1d4elU9DYeStDTNJj0CapO6iDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b4145995fe6e4aadcaf2931fa0de0ceaaba3aa0e5ffa0c50f42f85a39fd855e","last_reissued_at":"2026-05-18T02:26:02.411586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:02.411586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Covers Using Prefix Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, M. Sohel Rahman, W. F. Smyth","submitted_at":"2014-12-09T16:38:25Z","abstract_excerpt":"An \\emph{indeterminate string} $x = x[1..n]$ on an alphabet $\\Sigma$ is a sequence of nonempty subsets of $\\Sigma$; $x$ is said to be \\emph{regular} if every subset is of size one. A proper substring $u$ of regular $x$ is said to be a \\emph{cover} of $x$ iff for every $i \\in 1..n$, an occurrence of $u$ in $x$ includes $x[i]$. The \\emph{cover array} $\\gamma = \\gamma[1..n]$ of $x$ is an integer array such that $\\gamma[i]$ is the longest cover of $x[1..i]$. Fifteen years ago a complex, though nevertheless linear-time, algorithm was proposed to compute the cover array of regular $x$ based on prior"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3016","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":"1412.3016","created_at":"2026-05-18T02:26:02.411651+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3016v2","created_at":"2026-05-18T02:26:02.411651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3016","created_at":"2026-05-18T02:26:02.411651+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNAULGK743SK","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNAULGK743SKVXFP","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNAULGK7","created_at":"2026-05-18T12:28:28.263976+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/FNAULGK743SKVXFPFEY7UDPAZ2","json":"https://pith.science/pith/FNAULGK743SKVXFPFEY7UDPAZ2.json","graph_json":"https://pith.science/api/pith-number/FNAULGK743SKVXFPFEY7UDPAZ2/graph.json","events_json":"https://pith.science/api/pith-number/FNAULGK743SKVXFPFEY7UDPAZ2/events.json","paper":"https://pith.science/paper/FNAULGK7"},"agent_actions":{"view_html":"https://pith.science/pith/FNAULGK743SKVXFPFEY7UDPAZ2","download_json":"https://pith.science/pith/FNAULGK743SKVXFPFEY7UDPAZ2.json","view_paper":"https://pith.science/paper/FNAULGK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3016&json=true","fetch_graph":"https://pith.science/api/pith-number/FNAULGK743SKVXFPFEY7UDPAZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/FNAULGK743SKVXFPFEY7UDPAZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNAULGK743SKVXFPFEY7UDPAZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNAULGK743SKVXFPFEY7UDPAZ2/action/storage_attestation","attest_author":"https://pith.science/pith/FNAULGK743SKVXFPFEY7UDPAZ2/action/author_attestation","sign_citation":"https://pith.science/pith/FNAULGK743SKVXFPFEY7UDPAZ2/action/citation_signature","submit_replication":"https://pith.science/pith/FNAULGK743SKVXFPFEY7UDPAZ2/action/replication_record"}},"created_at":"2026-05-18T02:26:02.411651+00:00","updated_at":"2026-05-18T02:26:02.411651+00:00"}