{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6PFXCW335LTET3OKM577LMJXXN","short_pith_number":"pith:6PFXCW33","schema_version":"1.0","canonical_sha256":"f3cb715b7beae649edca677ff5b137bb664a8db13d8a499d8e43fb3949c21c20","source":{"kind":"arxiv","id":"1412.3696","version":1},"attestation_state":"computed","paper":{"title":"Covering Problems for Partial Words and for Indeterminate Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Maxime Crochemore, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","submitted_at":"2014-12-11T16:00:26Z","abstract_excerpt":"We consider the problem of computing a shortest solid cover of an indeterminate string. An indeterminate string may contain non-solid symbols, each of which specifies a subset of the alphabet that could be present at the corresponding position. We also consider covering partial words, which are a special case of indeterminate strings where each non-solid symbol is a don't care symbol. We prove that indeterminate string covering problem and partial word covering problem are NP-complete for binary alphabet and show that both problems are fixed-parameter tractable with respect to $k$, the number "},"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.3696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T16:00:26Z","cross_cats_sorted":[],"title_canon_sha256":"fcbc7a73461bbd02071936cb3df5a858274c250988a02c29174731331879a89a","abstract_canon_sha256":"2cea299c0e2712f7d65d27a02e76a5b747efbd1651be13a5565ba7c8dadbb0c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:30.507679Z","signature_b64":"I6BO+gUNqQmBqyVlS52a72DrvNozADcwb/R3/+Qnjl03JjAcxv0/fzUPSlIbfS1ULNnWITlYGRYBlyCGTT6HAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3cb715b7beae649edca677ff5b137bb664a8db13d8a499d8e43fb3949c21c20","last_reissued_at":"2026-05-18T02:31:30.507300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:30.507300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering Problems for Partial Words and for Indeterminate Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Maxime Crochemore, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","submitted_at":"2014-12-11T16:00:26Z","abstract_excerpt":"We consider the problem of computing a shortest solid cover of an indeterminate string. An indeterminate string may contain non-solid symbols, each of which specifies a subset of the alphabet that could be present at the corresponding position. We also consider covering partial words, which are a special case of indeterminate strings where each non-solid symbol is a don't care symbol. We prove that indeterminate string covering problem and partial word covering problem are NP-complete for binary alphabet and show that both problems are fixed-parameter tractable with respect to $k$, the number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3696","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":"1412.3696","created_at":"2026-05-18T02:31:30.507369+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3696v1","created_at":"2026-05-18T02:31:30.507369+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3696","created_at":"2026-05-18T02:31:30.507369+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PFXCW335LTE","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PFXCW335LTET3OK","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PFXCW33","created_at":"2026-05-18T12:28:16.859392+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/6PFXCW335LTET3OKM577LMJXXN","json":"https://pith.science/pith/6PFXCW335LTET3OKM577LMJXXN.json","graph_json":"https://pith.science/api/pith-number/6PFXCW335LTET3OKM577LMJXXN/graph.json","events_json":"https://pith.science/api/pith-number/6PFXCW335LTET3OKM577LMJXXN/events.json","paper":"https://pith.science/paper/6PFXCW33"},"agent_actions":{"view_html":"https://pith.science/pith/6PFXCW335LTET3OKM577LMJXXN","download_json":"https://pith.science/pith/6PFXCW335LTET3OKM577LMJXXN.json","view_paper":"https://pith.science/paper/6PFXCW33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3696&json=true","fetch_graph":"https://pith.science/api/pith-number/6PFXCW335LTET3OKM577LMJXXN/graph.json","fetch_events":"https://pith.science/api/pith-number/6PFXCW335LTET3OKM577LMJXXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PFXCW335LTET3OKM577LMJXXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PFXCW335LTET3OKM577LMJXXN/action/storage_attestation","attest_author":"https://pith.science/pith/6PFXCW335LTET3OKM577LMJXXN/action/author_attestation","sign_citation":"https://pith.science/pith/6PFXCW335LTET3OKM577LMJXXN/action/citation_signature","submit_replication":"https://pith.science/pith/6PFXCW335LTET3OKM577LMJXXN/action/replication_record"}},"created_at":"2026-05-18T02:31:30.507369+00:00","updated_at":"2026-05-18T02:31:30.507369+00:00"}