{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LXNCUGMAQHNAH7IA2TPPDVB555","short_pith_number":"pith:LXNCUGMA","schema_version":"1.0","canonical_sha256":"5dda2a198081da03fd00d4def1d43def57ef8c10bc1dfef452da77de0ec43ee9","source":{"kind":"arxiv","id":"1806.08131","version":2},"attestation_state":"computed","paper":{"title":"An output-sensitive algorithm for the minimization of 2-dimensional String Covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru Popa, Andrei Tanasescu","submitted_at":"2018-06-21T09:23:03Z","abstract_excerpt":"String covers are a powerful tool for analyzing the quasi-periodicity of 1-dimensional data and find applications in automata theory, computational biology, coding and the analysis of transactional data. A \\emph{cover} of a string $T$ is a string $C$ for which every letter of $T$ lies within some occurrence of $C$. String covers have been generalized in many ways, leading to \\emph{k-covers}, \\emph{$\\lambda$-covers}, \\emph{approximate covers} and were studied in different contexts such as \\emph{indeterminate strings}.\n  In this paper we generalize string covers to the context of 2-dimensional d"},"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":"1806.08131","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T09:23:03Z","cross_cats_sorted":[],"title_canon_sha256":"8d9e9d774121b0459341fa6ac3b50d6f1b10d24486a7f81f0631b6c9ef6fbe24","abstract_canon_sha256":"0c875974d0c6a126e6e9ddf5f8425b614d36f7f07c59176eab20f13ec649287b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:12.609512Z","signature_b64":"iIQ/nmIi1hPS0FgYdhDimhCZAFMOYjczlHOJ2g5oJWy5Agtld2+cHjWU6K5MgEsyfkvy3PKRDaypikSRY3XzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dda2a198081da03fd00d4def1d43def57ef8c10bc1dfef452da77de0ec43ee9","last_reissued_at":"2026-05-17T23:47:12.609101Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:12.609101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An output-sensitive algorithm for the minimization of 2-dimensional String Covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru Popa, Andrei Tanasescu","submitted_at":"2018-06-21T09:23:03Z","abstract_excerpt":"String covers are a powerful tool for analyzing the quasi-periodicity of 1-dimensional data and find applications in automata theory, computational biology, coding and the analysis of transactional data. A \\emph{cover} of a string $T$ is a string $C$ for which every letter of $T$ lies within some occurrence of $C$. String covers have been generalized in many ways, leading to \\emph{k-covers}, \\emph{$\\lambda$-covers}, \\emph{approximate covers} and were studied in different contexts such as \\emph{indeterminate strings}.\n  In this paper we generalize string covers to the context of 2-dimensional d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08131","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":"1806.08131","created_at":"2026-05-17T23:47:12.609165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08131v2","created_at":"2026-05-17T23:47:12.609165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08131","created_at":"2026-05-17T23:47:12.609165+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXNCUGMAQHNA","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXNCUGMAQHNAH7IA","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXNCUGMA","created_at":"2026-05-18T12:32:37.024351+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/LXNCUGMAQHNAH7IA2TPPDVB555","json":"https://pith.science/pith/LXNCUGMAQHNAH7IA2TPPDVB555.json","graph_json":"https://pith.science/api/pith-number/LXNCUGMAQHNAH7IA2TPPDVB555/graph.json","events_json":"https://pith.science/api/pith-number/LXNCUGMAQHNAH7IA2TPPDVB555/events.json","paper":"https://pith.science/paper/LXNCUGMA"},"agent_actions":{"view_html":"https://pith.science/pith/LXNCUGMAQHNAH7IA2TPPDVB555","download_json":"https://pith.science/pith/LXNCUGMAQHNAH7IA2TPPDVB555.json","view_paper":"https://pith.science/paper/LXNCUGMA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08131&json=true","fetch_graph":"https://pith.science/api/pith-number/LXNCUGMAQHNAH7IA2TPPDVB555/graph.json","fetch_events":"https://pith.science/api/pith-number/LXNCUGMAQHNAH7IA2TPPDVB555/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXNCUGMAQHNAH7IA2TPPDVB555/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXNCUGMAQHNAH7IA2TPPDVB555/action/storage_attestation","attest_author":"https://pith.science/pith/LXNCUGMAQHNAH7IA2TPPDVB555/action/author_attestation","sign_citation":"https://pith.science/pith/LXNCUGMAQHNAH7IA2TPPDVB555/action/citation_signature","submit_replication":"https://pith.science/pith/LXNCUGMAQHNAH7IA2TPPDVB555/action/replication_record"}},"created_at":"2026-05-17T23:47:12.609165+00:00","updated_at":"2026-05-17T23:47:12.609165+00:00"}