{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SRBAERMZPYWOH472377XSWG6SE","short_pith_number":"pith:SRBAERMZ","schema_version":"1.0","canonical_sha256":"94420245997e2ce3f3fadfff7958de9101fdd5e50aacd5e3948820fb237102a7","source":{"kind":"arxiv","id":"1806.08232","version":1},"attestation_state":"computed","paper":{"title":"A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization","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-21T13:30:27Z","abstract_excerpt":"Data compression plays a crucial part in the cloud based systems of today. One the fundaments of compression is quasi-periodicity, for which there are several models. We build upon the most popular quasi-periodicity model for strings, i.e., covers, generalizing it to trees.\n  We introduce a new type of cover automata, which we call \\textbf{D}eterministic \\textbf{T}ree \\textbf{A}utomata. Then, we formulate a cover problem on these DTA and study its complexity, in both sequential and parallel settings. We obtain bounds for the Cover Minimization Problem. Along the way, we uncover an interesting "},"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.08232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T13:30:27Z","cross_cats_sorted":[],"title_canon_sha256":"d2462f740fdcee044f2f4c710e04e2db619aaed36f7c98bf184fd88606296ce3","abstract_canon_sha256":"cef440f80025bb484dc826b755d35d551e6ce16a86d09223eaa8c617e4147c9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:41.660915Z","signature_b64":"uGLw2iW8ZEdnjwXnbhFXJoVBpdXlCSjJT6gWgoEG1infsaM575sit5eNyJ4BubAsbiencbVTcaL62fpNTOCKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94420245997e2ce3f3fadfff7958de9101fdd5e50aacd5e3948820fb237102a7","last_reissued_at":"2026-05-18T00:12:41.660355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:41.660355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization","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-21T13:30:27Z","abstract_excerpt":"Data compression plays a crucial part in the cloud based systems of today. One the fundaments of compression is quasi-periodicity, for which there are several models. We build upon the most popular quasi-periodicity model for strings, i.e., covers, generalizing it to trees.\n  We introduce a new type of cover automata, which we call \\textbf{D}eterministic \\textbf{T}ree \\textbf{A}utomata. Then, we formulate a cover problem on these DTA and study its complexity, in both sequential and parallel settings. We obtain bounds for the Cover Minimization Problem. Along the way, we uncover an interesting "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08232","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":"1806.08232","created_at":"2026-05-18T00:12:41.660433+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08232v1","created_at":"2026-05-18T00:12:41.660433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08232","created_at":"2026-05-18T00:12:41.660433+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRBAERMZPYWO","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRBAERMZPYWOH472","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRBAERMZ","created_at":"2026-05-18T12:32:53.628368+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/SRBAERMZPYWOH472377XSWG6SE","json":"https://pith.science/pith/SRBAERMZPYWOH472377XSWG6SE.json","graph_json":"https://pith.science/api/pith-number/SRBAERMZPYWOH472377XSWG6SE/graph.json","events_json":"https://pith.science/api/pith-number/SRBAERMZPYWOH472377XSWG6SE/events.json","paper":"https://pith.science/paper/SRBAERMZ"},"agent_actions":{"view_html":"https://pith.science/pith/SRBAERMZPYWOH472377XSWG6SE","download_json":"https://pith.science/pith/SRBAERMZPYWOH472377XSWG6SE.json","view_paper":"https://pith.science/paper/SRBAERMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08232&json=true","fetch_graph":"https://pith.science/api/pith-number/SRBAERMZPYWOH472377XSWG6SE/graph.json","fetch_events":"https://pith.science/api/pith-number/SRBAERMZPYWOH472377XSWG6SE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRBAERMZPYWOH472377XSWG6SE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRBAERMZPYWOH472377XSWG6SE/action/storage_attestation","attest_author":"https://pith.science/pith/SRBAERMZPYWOH472377XSWG6SE/action/author_attestation","sign_citation":"https://pith.science/pith/SRBAERMZPYWOH472377XSWG6SE/action/citation_signature","submit_replication":"https://pith.science/pith/SRBAERMZPYWOH472377XSWG6SE/action/replication_record"}},"created_at":"2026-05-18T00:12:41.660433+00:00","updated_at":"2026-05-18T00:12:41.660433+00:00"}