{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VXLEADZGMPZK4MCLZBSML6TQIK","short_pith_number":"pith:VXLEADZG","schema_version":"1.0","canonical_sha256":"add6400f2663f2ae304bc864c5fa7042a960436fa4ff214269bdc5d905cc27f5","source":{"kind":"arxiv","id":"1506.06793","version":1},"attestation_state":"computed","paper":{"title":"Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, A. S. Sohidull Islam, Jamie Simpson, M. Sohel Rahman, W. F. Smyth","submitted_at":"2015-06-22T21:13:36Z","abstract_excerpt":"A \\itbf{cover} of a string $x = x[1..n]$ is a proper substring $u$ of $x$ such that $x$ can be constructed from possibly overlapping instances of $u$. A recent paper \\cite{FIKPPST13} relaxes this definition --- an \\itbf{enhanced cover} $u$ of $x$ is a border of $x$ (that is, a proper prefix that is also a suffix) that covers a {\\it maximum} number of positions in $x$ (not necessarily all) --- and proposes efficient algorithms for the computation of enhanced covers. These algorithms depend on the prior computation of the \\itbf{border array} $\\beta[1..n]$, where $\\beta[i]$ is the length of the l"},"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":"1506.06793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T21:13:36Z","cross_cats_sorted":[],"title_canon_sha256":"b1a2b8177515566766184cacae54521540e769a4a7afe1a0c0537408146d3701","abstract_canon_sha256":"af7f57eaa33f8ff6b75725f606ece5e43be7211dce537e5f0e23036d6f074a35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:55.941812Z","signature_b64":"uosfq8V63BAKb746/MHPD2DQ3If9w1Vi0423zgflbl+ULN+P83WrDid0eV49g4CHPIjhQVa9fh1Iy5tXB7hoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"add6400f2663f2ae304bc864c5fa7042a960436fa4ff214269bdc5d905cc27f5","last_reissued_at":"2026-05-18T01:40:55.941133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:55.941133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, A. S. Sohidull Islam, Jamie Simpson, M. Sohel Rahman, W. F. Smyth","submitted_at":"2015-06-22T21:13:36Z","abstract_excerpt":"A \\itbf{cover} of a string $x = x[1..n]$ is a proper substring $u$ of $x$ such that $x$ can be constructed from possibly overlapping instances of $u$. A recent paper \\cite{FIKPPST13} relaxes this definition --- an \\itbf{enhanced cover} $u$ of $x$ is a border of $x$ (that is, a proper prefix that is also a suffix) that covers a {\\it maximum} number of positions in $x$ (not necessarily all) --- and proposes efficient algorithms for the computation of enhanced covers. These algorithms depend on the prior computation of the \\itbf{border array} $\\beta[1..n]$, where $\\beta[i]$ is the length of the l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06793","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":"1506.06793","created_at":"2026-05-18T01:40:55.941235+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06793v1","created_at":"2026-05-18T01:40:55.941235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06793","created_at":"2026-05-18T01:40:55.941235+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXLEADZGMPZK","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXLEADZGMPZK4MCL","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXLEADZG","created_at":"2026-05-18T12:29:47.479230+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/VXLEADZGMPZK4MCLZBSML6TQIK","json":"https://pith.science/pith/VXLEADZGMPZK4MCLZBSML6TQIK.json","graph_json":"https://pith.science/api/pith-number/VXLEADZGMPZK4MCLZBSML6TQIK/graph.json","events_json":"https://pith.science/api/pith-number/VXLEADZGMPZK4MCLZBSML6TQIK/events.json","paper":"https://pith.science/paper/VXLEADZG"},"agent_actions":{"view_html":"https://pith.science/pith/VXLEADZGMPZK4MCLZBSML6TQIK","download_json":"https://pith.science/pith/VXLEADZGMPZK4MCLZBSML6TQIK.json","view_paper":"https://pith.science/paper/VXLEADZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06793&json=true","fetch_graph":"https://pith.science/api/pith-number/VXLEADZGMPZK4MCLZBSML6TQIK/graph.json","fetch_events":"https://pith.science/api/pith-number/VXLEADZGMPZK4MCLZBSML6TQIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXLEADZGMPZK4MCLZBSML6TQIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXLEADZGMPZK4MCLZBSML6TQIK/action/storage_attestation","attest_author":"https://pith.science/pith/VXLEADZGMPZK4MCLZBSML6TQIK/action/author_attestation","sign_citation":"https://pith.science/pith/VXLEADZGMPZK4MCLZBSML6TQIK/action/citation_signature","submit_replication":"https://pith.science/pith/VXLEADZGMPZK4MCLZBSML6TQIK/action/replication_record"}},"created_at":"2026-05-18T01:40:55.941235+00:00","updated_at":"2026-05-18T01:40:55.941235+00:00"}