{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LXNCUGMAQHNAH7IA2TPPDVB555","short_pith_number":"pith:LXNCUGMA","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"},"canonical_sha256":"5dda2a198081da03fd00d4def1d43def57ef8c10bc1dfef452da77de0ec43ee9","source":{"kind":"arxiv","id":"1806.08131","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08131","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08131v2","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08131","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"LXNCUGMAQHNA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LXNCUGMAQHNAH7IA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LXNCUGMA","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LXNCUGMAQHNAH7IA2TPPDVB555","target":"record","payload":{"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"},"canonical_sha256":"5dda2a198081da03fd00d4def1d43def57ef8c10bc1dfef452da77de0ec43ee9","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"},"source_kind":"arxiv","source_id":"1806.08131","source_version":2,"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-17T23:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0yJ3l8JsEup5XN36gCl4woZdXAmrMGnahlPy3451xkT9rbl7nLDTHhJvuNx1RGG4RYlCIo7ngJIrQidCiTUyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:49:36.816909Z"},"content_sha256":"d2d9668cc3bdfb1265b26957b8fdb3988f91682a50a0f00137dd573bf18aa93d","schema_version":"1.0","event_id":"sha256:d2d9668cc3bdfb1265b26957b8fdb3988f91682a50a0f00137dd573bf18aa93d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LXNCUGMAQHNAH7IA2TPPDVB555","target":"graph","payload":{"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"},"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-17T23:47:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zNC3GNMo2ByV8hTJZRMPAUP5b2oEU3IzObVevOd+vw/kV3CC6zea42OkP7dUdP3bAuPzEIYeAmStkgmkYj7NDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:49:36.817244Z"},"content_sha256":"33fff9c0ad65a2912e0a82d380233744d8afa65948e5236a4baf77cff6d12b3b","schema_version":"1.0","event_id":"sha256:33fff9c0ad65a2912e0a82d380233744d8afa65948e5236a4baf77cff6d12b3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXNCUGMAQHNAH7IA2TPPDVB555/bundle.json","state_url":"https://pith.science/pith/LXNCUGMAQHNAH7IA2TPPDVB555/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXNCUGMAQHNAH7IA2TPPDVB555/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-03T12:49:36Z","links":{"resolver":"https://pith.science/pith/LXNCUGMAQHNAH7IA2TPPDVB555","bundle":"https://pith.science/pith/LXNCUGMAQHNAH7IA2TPPDVB555/bundle.json","state":"https://pith.science/pith/LXNCUGMAQHNAH7IA2TPPDVB555/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXNCUGMAQHNAH7IA2TPPDVB555/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LXNCUGMAQHNAH7IA2TPPDVB555","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":"0c875974d0c6a126e6e9ddf5f8425b614d36f7f07c59176eab20f13ec649287b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T09:23:03Z","title_canon_sha256":"8d9e9d774121b0459341fa6ac3b50d6f1b10d24486a7f81f0631b6c9ef6fbe24"},"schema_version":"1.0","source":{"id":"1806.08131","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08131","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08131v2","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08131","created_at":"2026-05-17T23:47:12Z"},{"alias_kind":"pith_short_12","alias_value":"LXNCUGMAQHNA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LXNCUGMAQHNAH7IA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LXNCUGMA","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:33fff9c0ad65a2912e0a82d380233744d8afa65948e5236a4baf77cff6d12b3b","target":"graph","created_at":"2026-05-17T23:47:12Z","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":"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","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-21T09:23:03Z","title":"An output-sensitive algorithm for the minimization of 2-dimensional String Covers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08131","kind":"arxiv","version":2},"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:d2d9668cc3bdfb1265b26957b8fdb3988f91682a50a0f00137dd573bf18aa93d","target":"record","created_at":"2026-05-17T23:47:12Z","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":"0c875974d0c6a126e6e9ddf5f8425b614d36f7f07c59176eab20f13ec649287b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T09:23:03Z","title_canon_sha256":"8d9e9d774121b0459341fa6ac3b50d6f1b10d24486a7f81f0631b6c9ef6fbe24"},"schema_version":"1.0","source":{"id":"1806.08131","kind":"arxiv","version":2}},"canonical_sha256":"5dda2a198081da03fd00d4def1d43def57ef8c10bc1dfef452da77de0ec43ee9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5dda2a198081da03fd00d4def1d43def57ef8c10bc1dfef452da77de0ec43ee9","first_computed_at":"2026-05-17T23:47:12.609101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:12.609101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iIQ/nmIi1hPS0FgYdhDimhCZAFMOYjczlHOJ2g5oJWy5Agtld2+cHjWU6K5MgEsyfkvy3PKRDaypikSRY3XzDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:12.609512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08131","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2d9668cc3bdfb1265b26957b8fdb3988f91682a50a0f00137dd573bf18aa93d","sha256:33fff9c0ad65a2912e0a82d380233744d8afa65948e5236a4baf77cff6d12b3b"],"state_sha256":"dd752cf9a2ce8100098d191f366259740f35e288c86adcff8670ff3caa94d6b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pJNJnNWEZMcRXPM8/Hg50cIyxuNC+sE922fm7gl2MdBEF6i2MtKWUikVMqB3u8X6TvQ/QO0eHddHY7b0O50gCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T12:49:36.819151Z","bundle_sha256":"037a54a2c99f467bfce71f9e16212466b4d17ba2c1b4e8f609a3dc89f2e88483"}}