{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SRBAERMZPYWOH472377XSWG6SE","short_pith_number":"pith:SRBAERMZ","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"},"canonical_sha256":"94420245997e2ce3f3fadfff7958de9101fdd5e50aacd5e3948820fb237102a7","source":{"kind":"arxiv","id":"1806.08232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08232","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08232v1","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08232","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"SRBAERMZPYWO","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SRBAERMZPYWOH472","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SRBAERMZ","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SRBAERMZPYWOH472377XSWG6SE","target":"record","payload":{"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"},"canonical_sha256":"94420245997e2ce3f3fadfff7958de9101fdd5e50aacd5e3948820fb237102a7","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"},"source_kind":"arxiv","source_id":"1806.08232","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NyMwoRI74F6OAlIQE2GbZFIwZXaLw41I0Gkk8OeP0SAZQdFwdDvltqk/KftLNAaS7C2XEjwt3PezypEM9IypCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T11:51:35.346341Z"},"content_sha256":"eb2778ad0b6c934a3c9207772ed61916f528dd8b63f108dbda4c4a9857ad8882","schema_version":"1.0","event_id":"sha256:eb2778ad0b6c934a3c9207772ed61916f528dd8b63f108dbda4c4a9857ad8882"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SRBAERMZPYWOH472377XSWG6SE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mhn85W7AoWB263ROBoIxV9WRQ2LWxoyhbGG52mXo9nbyR+vB3iu0fORHoRgmR3D9kwJiXTrJMUZ5Y5SnOc5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T11:51:35.346956Z"},"content_sha256":"fe8f6b6d618aeafb613875240e28e16869981f6b568ef7df3f5b8676882f5d12","schema_version":"1.0","event_id":"sha256:fe8f6b6d618aeafb613875240e28e16869981f6b568ef7df3f5b8676882f5d12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SRBAERMZPYWOH472377XSWG6SE/bundle.json","state_url":"https://pith.science/pith/SRBAERMZPYWOH472377XSWG6SE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SRBAERMZPYWOH472377XSWG6SE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T11:51:35Z","links":{"resolver":"https://pith.science/pith/SRBAERMZPYWOH472377XSWG6SE","bundle":"https://pith.science/pith/SRBAERMZPYWOH472377XSWG6SE/bundle.json","state":"https://pith.science/pith/SRBAERMZPYWOH472377XSWG6SE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SRBAERMZPYWOH472377XSWG6SE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SRBAERMZPYWOH472377XSWG6SE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cef440f80025bb484dc826b755d35d551e6ce16a86d09223eaa8c617e4147c9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T13:30:27Z","title_canon_sha256":"d2462f740fdcee044f2f4c710e04e2db619aaed36f7c98bf184fd88606296ce3"},"schema_version":"1.0","source":{"id":"1806.08232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08232","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08232v1","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08232","created_at":"2026-05-18T00:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"SRBAERMZPYWO","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SRBAERMZPYWOH472","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SRBAERMZ","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:fe8f6b6d618aeafb613875240e28e16869981f6b568ef7df3f5b8676882f5d12","target":"graph","created_at":"2026-05-18T00:12:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Alexandru Popa, Andrei Tanasescu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T13:30:27Z","title":"A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08232","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eb2778ad0b6c934a3c9207772ed61916f528dd8b63f108dbda4c4a9857ad8882","target":"record","created_at":"2026-05-18T00:12:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cef440f80025bb484dc826b755d35d551e6ce16a86d09223eaa8c617e4147c9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T13:30:27Z","title_canon_sha256":"d2462f740fdcee044f2f4c710e04e2db619aaed36f7c98bf184fd88606296ce3"},"schema_version":"1.0","source":{"id":"1806.08232","kind":"arxiv","version":1}},"canonical_sha256":"94420245997e2ce3f3fadfff7958de9101fdd5e50aacd5e3948820fb237102a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94420245997e2ce3f3fadfff7958de9101fdd5e50aacd5e3948820fb237102a7","first_computed_at":"2026-05-18T00:12:41.660355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:41.660355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uGLw2iW8ZEdnjwXnbhFXJoVBpdXlCSjJT6gWgoEG1infsaM575sit5eNyJ4BubAsbiencbVTcaL62fpNTOCKAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:41.660915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb2778ad0b6c934a3c9207772ed61916f528dd8b63f108dbda4c4a9857ad8882","sha256:fe8f6b6d618aeafb613875240e28e16869981f6b568ef7df3f5b8676882f5d12"],"state_sha256":"386a4717ceecbc9ac23c7ab208aa1eb527fa4b91de64011283078735d4c4291e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qpTTdTv3JMfH8XynYE0adtY504VV82Yg1YOLUmIhhjWDuQr9OigfS/IadUmt/rbuOr89mBaV4OwaAqImqHkxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T11:51:35.350000Z","bundle_sha256":"f457a23f62bfc05c9b2b3546a1ccb763f7d5dd52f69721949e13b20704876115"}}