{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VXLEADZGMPZK4MCLZBSML6TQIK","short_pith_number":"pith:VXLEADZG","canonical_record":{"source":{"id":"1506.06793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T21:13:36Z","cross_cats_sorted":[],"title_canon_sha256":"b1a2b8177515566766184cacae54521540e769a4a7afe1a0c0537408146d3701","abstract_canon_sha256":"af7f57eaa33f8ff6b75725f606ece5e43be7211dce537e5f0e23036d6f074a35"},"schema_version":"1.0"},"canonical_sha256":"add6400f2663f2ae304bc864c5fa7042a960436fa4ff214269bdc5d905cc27f5","source":{"kind":"arxiv","id":"1506.06793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06793","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06793v1","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06793","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"VXLEADZGMPZK","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VXLEADZGMPZK4MCL","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VXLEADZG","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VXLEADZGMPZK4MCLZBSML6TQIK","target":"record","payload":{"canonical_record":{"source":{"id":"1506.06793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T21:13:36Z","cross_cats_sorted":[],"title_canon_sha256":"b1a2b8177515566766184cacae54521540e769a4a7afe1a0c0537408146d3701","abstract_canon_sha256":"af7f57eaa33f8ff6b75725f606ece5e43be7211dce537e5f0e23036d6f074a35"},"schema_version":"1.0"},"canonical_sha256":"add6400f2663f2ae304bc864c5fa7042a960436fa4ff214269bdc5d905cc27f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:55.941812Z","signature_b64":"uosfq8V63BAKb746/MHPD2DQ3If9w1Vi0423zgflbl+ULN+P83WrDid0eV49g4CHPIjhQVa9fh1Iy5tXB7hoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"add6400f2663f2ae304bc864c5fa7042a960436fa4ff214269bdc5d905cc27f5","last_reissued_at":"2026-05-18T01:40:55.941133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:55.941133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.06793","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-18T01:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J9iCpAFCMLCG4M8a72TeCZD8jHYAnyhjnCyfjEky++6GKkldvXTKb3MEaPxoqANGFZIP7ryXWmVvVz7nOSeyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:15:27.151758Z"},"content_sha256":"783b9a3e88a0b6eff88957ba87294c7641c49688aee1937338181317df400bca","schema_version":"1.0","event_id":"sha256:783b9a3e88a0b6eff88957ba87294c7641c49688aee1937338181317df400bca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VXLEADZGMPZK4MCLZBSML6TQIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, A. S. Sohidull Islam, Jamie Simpson, M. Sohel Rahman, W. F. Smyth","submitted_at":"2015-06-22T21:13:36Z","abstract_excerpt":"A \\itbf{cover} of a string $x = x[1..n]$ is a proper substring $u$ of $x$ such that $x$ can be constructed from possibly overlapping instances of $u$. A recent paper \\cite{FIKPPST13} relaxes this definition --- an \\itbf{enhanced cover} $u$ of $x$ is a border of $x$ (that is, a proper prefix that is also a suffix) that covers a {\\it maximum} number of positions in $x$ (not necessarily all) --- and proposes efficient algorithms for the computation of enhanced covers. These algorithms depend on the prior computation of the \\itbf{border array} $\\beta[1..n]$, where $\\beta[i]$ is the length of the l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06793","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-18T01:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DEP3bpTHEf7n+OmE6a7+d2/4ib0oMwWecYJN/yzF+W7n+s6ba6xCh4KNUzudBXY96C9UmYDWMwBjY9EhZh/3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:15:27.152401Z"},"content_sha256":"0cf880fdf73e3ddff26f101fd28b5437bea70b40727a4e3bf2b20629f9c089f5","schema_version":"1.0","event_id":"sha256:0cf880fdf73e3ddff26f101fd28b5437bea70b40727a4e3bf2b20629f9c089f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXLEADZGMPZK4MCLZBSML6TQIK/bundle.json","state_url":"https://pith.science/pith/VXLEADZGMPZK4MCLZBSML6TQIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXLEADZGMPZK4MCLZBSML6TQIK/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-05-31T07:15:27Z","links":{"resolver":"https://pith.science/pith/VXLEADZGMPZK4MCLZBSML6TQIK","bundle":"https://pith.science/pith/VXLEADZGMPZK4MCLZBSML6TQIK/bundle.json","state":"https://pith.science/pith/VXLEADZGMPZK4MCLZBSML6TQIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXLEADZGMPZK4MCLZBSML6TQIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VXLEADZGMPZK4MCLZBSML6TQIK","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":"af7f57eaa33f8ff6b75725f606ece5e43be7211dce537e5f0e23036d6f074a35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T21:13:36Z","title_canon_sha256":"b1a2b8177515566766184cacae54521540e769a4a7afe1a0c0537408146d3701"},"schema_version":"1.0","source":{"id":"1506.06793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06793","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06793v1","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06793","created_at":"2026-05-18T01:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"VXLEADZGMPZK","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VXLEADZGMPZK4MCL","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VXLEADZG","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:0cf880fdf73e3ddff26f101fd28b5437bea70b40727a4e3bf2b20629f9c089f5","target":"graph","created_at":"2026-05-18T01:40:55Z","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":"A \\itbf{cover} of a string $x = x[1..n]$ is a proper substring $u$ of $x$ such that $x$ can be constructed from possibly overlapping instances of $u$. A recent paper \\cite{FIKPPST13} relaxes this definition --- an \\itbf{enhanced cover} $u$ of $x$ is a border of $x$ (that is, a proper prefix that is also a suffix) that covers a {\\it maximum} number of positions in $x$ (not necessarily all) --- and proposes efficient algorithms for the computation of enhanced covers. These algorithms depend on the prior computation of the \\itbf{border array} $\\beta[1..n]$, where $\\beta[i]$ is the length of the l","authors_text":"Ali Alatabbi, A. S. Sohidull Islam, Jamie Simpson, M. Sohel Rahman, W. F. Smyth","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T21:13:36Z","title":"Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06793","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:783b9a3e88a0b6eff88957ba87294c7641c49688aee1937338181317df400bca","target":"record","created_at":"2026-05-18T01:40:55Z","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":"af7f57eaa33f8ff6b75725f606ece5e43be7211dce537e5f0e23036d6f074a35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-22T21:13:36Z","title_canon_sha256":"b1a2b8177515566766184cacae54521540e769a4a7afe1a0c0537408146d3701"},"schema_version":"1.0","source":{"id":"1506.06793","kind":"arxiv","version":1}},"canonical_sha256":"add6400f2663f2ae304bc864c5fa7042a960436fa4ff214269bdc5d905cc27f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"add6400f2663f2ae304bc864c5fa7042a960436fa4ff214269bdc5d905cc27f5","first_computed_at":"2026-05-18T01:40:55.941133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:40:55.941133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uosfq8V63BAKb746/MHPD2DQ3If9w1Vi0423zgflbl+ULN+P83WrDid0eV49g4CHPIjhQVa9fh1Iy5tXB7hoBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:40:55.941812Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:783b9a3e88a0b6eff88957ba87294c7641c49688aee1937338181317df400bca","sha256:0cf880fdf73e3ddff26f101fd28b5437bea70b40727a4e3bf2b20629f9c089f5"],"state_sha256":"795f3f547fe41ccb123a6697251bff5e267c5b265465b7164575367add70ff85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aHgUGJ5V5P2N2po8P0DknGcKOf1S7OegLOuaH7LSQsGjBb7yaovgaLIGoPUTyjR+RL3DsqEIODfojkv8tesDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:15:27.155397Z","bundle_sha256":"ff34fbaf82614dad2da6576635861cc982f6c2c3774e603182068a243d7ec847"}}