{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FNAULGK743SKVXFPFEY7UDPAZ2","short_pith_number":"pith:FNAULGK7","canonical_record":{"source":{"id":"1412.3016","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-09T16:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"3b2eb4ba342655bbb143e2a2f7d25165fcadab2cb84bcd711c426aff3c604a33","abstract_canon_sha256":"44c481c4c33c8ac1b70c5312aa7be8cf8b72cb8fc26b47787fe99ebff0e6bd5f"},"schema_version":"1.0"},"canonical_sha256":"2b4145995fe6e4aadcaf2931fa0de0ceaaba3aa0e5ffa0c50f42f85a39fd855e","source":{"kind":"arxiv","id":"1412.3016","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3016","created_at":"2026-05-18T02:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3016v2","created_at":"2026-05-18T02:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3016","created_at":"2026-05-18T02:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"FNAULGK743SK","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FNAULGK743SKVXFP","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FNAULGK7","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FNAULGK743SKVXFPFEY7UDPAZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1412.3016","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-09T16:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"3b2eb4ba342655bbb143e2a2f7d25165fcadab2cb84bcd711c426aff3c604a33","abstract_canon_sha256":"44c481c4c33c8ac1b70c5312aa7be8cf8b72cb8fc26b47787fe99ebff0e6bd5f"},"schema_version":"1.0"},"canonical_sha256":"2b4145995fe6e4aadcaf2931fa0de0ceaaba3aa0e5ffa0c50f42f85a39fd855e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:02.411985Z","signature_b64":"P3dY4mUztqMEb5KTnV6EYk/QaaWNupDTosXj72flu9Fgmyy89HTMF9UYkyGo1d4elU9DYeStDTNJj0CapO6iDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b4145995fe6e4aadcaf2931fa0de0ceaaba3aa0e5ffa0c50f42f85a39fd855e","last_reissued_at":"2026-05-18T02:26:02.411586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:02.411586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.3016","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-18T02:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u1gMTD3CzxGrk6HTDlME2eBuCgtO1oueYx5c8tH1nnNYZBt7srKHquttuJ1GHXBdTWt0LRvN1SsvXnmO2HJoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:02:35.130826Z"},"content_sha256":"7fd7ef16cc8515cc4b839eb4952e213d8cbe5af897896495cb62012342b65d9e","schema_version":"1.0","event_id":"sha256:7fd7ef16cc8515cc4b839eb4952e213d8cbe5af897896495cb62012342b65d9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FNAULGK743SKVXFPFEY7UDPAZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Covers Using Prefix Tables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, M. Sohel Rahman, W. F. Smyth","submitted_at":"2014-12-09T16:38:25Z","abstract_excerpt":"An \\emph{indeterminate string} $x = x[1..n]$ on an alphabet $\\Sigma$ is a sequence of nonempty subsets of $\\Sigma$; $x$ is said to be \\emph{regular} if every subset is of size one. A proper substring $u$ of regular $x$ is said to be a \\emph{cover} of $x$ iff for every $i \\in 1..n$, an occurrence of $u$ in $x$ includes $x[i]$. The \\emph{cover array} $\\gamma = \\gamma[1..n]$ of $x$ is an integer array such that $\\gamma[i]$ is the longest cover of $x[1..i]$. Fifteen years ago a complex, though nevertheless linear-time, algorithm was proposed to compute the cover array of regular $x$ based on prior"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3016","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-18T02:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AUSMr3RxwEkTAkG3ul0IzNO0tCdWcsNF4WZJiWCsEK26q9RSjgtYaSJ5Yyv5e0E4svX/ezI0kqWU8ln8kTquAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:02:35.131573Z"},"content_sha256":"09c9177748d115cab781d64fa8e7ea530509e75291ebad7aa72633d689265f6d","schema_version":"1.0","event_id":"sha256:09c9177748d115cab781d64fa8e7ea530509e75291ebad7aa72633d689265f6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNAULGK743SKVXFPFEY7UDPAZ2/bundle.json","state_url":"https://pith.science/pith/FNAULGK743SKVXFPFEY7UDPAZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNAULGK743SKVXFPFEY7UDPAZ2/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-06-09T08:02:35Z","links":{"resolver":"https://pith.science/pith/FNAULGK743SKVXFPFEY7UDPAZ2","bundle":"https://pith.science/pith/FNAULGK743SKVXFPFEY7UDPAZ2/bundle.json","state":"https://pith.science/pith/FNAULGK743SKVXFPFEY7UDPAZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNAULGK743SKVXFPFEY7UDPAZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FNAULGK743SKVXFPFEY7UDPAZ2","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":"44c481c4c33c8ac1b70c5312aa7be8cf8b72cb8fc26b47787fe99ebff0e6bd5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-09T16:38:25Z","title_canon_sha256":"3b2eb4ba342655bbb143e2a2f7d25165fcadab2cb84bcd711c426aff3c604a33"},"schema_version":"1.0","source":{"id":"1412.3016","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3016","created_at":"2026-05-18T02:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3016v2","created_at":"2026-05-18T02:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3016","created_at":"2026-05-18T02:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"FNAULGK743SK","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FNAULGK743SKVXFP","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FNAULGK7","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:09c9177748d115cab781d64fa8e7ea530509e75291ebad7aa72633d689265f6d","target":"graph","created_at":"2026-05-18T02:26:02Z","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":"An \\emph{indeterminate string} $x = x[1..n]$ on an alphabet $\\Sigma$ is a sequence of nonempty subsets of $\\Sigma$; $x$ is said to be \\emph{regular} if every subset is of size one. A proper substring $u$ of regular $x$ is said to be a \\emph{cover} of $x$ iff for every $i \\in 1..n$, an occurrence of $u$ in $x$ includes $x[i]$. The \\emph{cover array} $\\gamma = \\gamma[1..n]$ of $x$ is an integer array such that $\\gamma[i]$ is the longest cover of $x[1..i]$. Fifteen years ago a complex, though nevertheless linear-time, algorithm was proposed to compute the cover array of regular $x$ based on prior","authors_text":"Ali Alatabbi, M. Sohel Rahman, W. F. Smyth","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-09T16:38:25Z","title":"Computing Covers Using Prefix Tables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3016","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:7fd7ef16cc8515cc4b839eb4952e213d8cbe5af897896495cb62012342b65d9e","target":"record","created_at":"2026-05-18T02:26:02Z","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":"44c481c4c33c8ac1b70c5312aa7be8cf8b72cb8fc26b47787fe99ebff0e6bd5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-09T16:38:25Z","title_canon_sha256":"3b2eb4ba342655bbb143e2a2f7d25165fcadab2cb84bcd711c426aff3c604a33"},"schema_version":"1.0","source":{"id":"1412.3016","kind":"arxiv","version":2}},"canonical_sha256":"2b4145995fe6e4aadcaf2931fa0de0ceaaba3aa0e5ffa0c50f42f85a39fd855e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b4145995fe6e4aadcaf2931fa0de0ceaaba3aa0e5ffa0c50f42f85a39fd855e","first_computed_at":"2026-05-18T02:26:02.411586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:02.411586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P3dY4mUztqMEb5KTnV6EYk/QaaWNupDTosXj72flu9Fgmyy89HTMF9UYkyGo1d4elU9DYeStDTNJj0CapO6iDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:02.411985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3016","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fd7ef16cc8515cc4b839eb4952e213d8cbe5af897896495cb62012342b65d9e","sha256:09c9177748d115cab781d64fa8e7ea530509e75291ebad7aa72633d689265f6d"],"state_sha256":"f94f257e234021480e2316c65d33259207e085bad290fc7a57634fe8e537794a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M5SJ3wuLAZ6vOsEht/O+ho7IEa6bpDsyyUJZ1ytrhchiiCdj/HTfhSWXFwTvPNkkSPSMfGCXNhvI6x4WiXgRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:02:35.135825Z","bundle_sha256":"db5ad0745a57cd80e9d23a515e1796f67537865abd47d2d8fa590b8891bb6478"}}