{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:T3SUVAWU2FU37IHVZDDESRX4QV","short_pith_number":"pith:T3SUVAWU","canonical_record":{"source":{"id":"1705.03385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-09T15:26:46Z","cross_cats_sorted":[],"title_canon_sha256":"40de4e697e39905c9e28c4517689b576ffe353abd5b52d85f85964974622dc50","abstract_canon_sha256":"7ce3fa171fa5f040487894174bd6c4bd13ca78f432ad988ce8527976810fdc4e"},"schema_version":"1.0"},"canonical_sha256":"9ee54a82d4d169bfa0f5c8c64946fc8562da9bd1e1f4910dbb1739049161bc83","source":{"kind":"arxiv","id":"1705.03385","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03385","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03385v1","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03385","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"T3SUVAWU2FU3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T3SUVAWU2FU37IHV","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T3SUVAWU","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:T3SUVAWU2FU37IHVZDDESRX4QV","target":"record","payload":{"canonical_record":{"source":{"id":"1705.03385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-09T15:26:46Z","cross_cats_sorted":[],"title_canon_sha256":"40de4e697e39905c9e28c4517689b576ffe353abd5b52d85f85964974622dc50","abstract_canon_sha256":"7ce3fa171fa5f040487894174bd6c4bd13ca78f432ad988ce8527976810fdc4e"},"schema_version":"1.0"},"canonical_sha256":"9ee54a82d4d169bfa0f5c8c64946fc8562da9bd1e1f4910dbb1739049161bc83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:48.059760Z","signature_b64":"rt/mptPTYS1vs1gFw5HOjCoTOutZ4Cz/HhfCqWHP1Okh9mIA04WKVpHB2bgrh+ysdBKnyk8O7lE+cXLznC8nDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ee54a82d4d169bfa0f5c8c64946fc8562da9bd1e1f4910dbb1739049161bc83","last_reissued_at":"2026-05-18T00:44:48.059002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:48.059002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.03385","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:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgmA/EKlDNIgusG0YloWV2+fklbsFXrWcSJQpJ5K4U+JAZS8voaxFpZ9EN6S9FAGE/4EL/GGmSdOb2CjvpEQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:50:47.264708Z"},"content_sha256":"bedc85037a8c779fb53dc9e9dc3dcd3bed17b566f93ffdd907a54c5885860359","schema_version":"1.0","event_id":"sha256:bedc85037a8c779fb53dc9e9dc3dcd3bed17b566f93ffdd907a54c5885860359"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:T3SUVAWU2FU37IHVZDDESRX4QV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Computation of Overabundant Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Dimitris Polychronopoulos, Jia Gao, Manal Mohamed, Panagiotis Charalampopoulos, Solon P. Pissis, Yannis Almirantis","submitted_at":"2017-05-09T15:26:46Z","abstract_excerpt":"The observed frequency of the longest proper prefix, the longest proper suffix, and the longest infix of a word $w$ in a given sequence $x$ can be used for classifying $w$ as avoided or overabundant. The definitions used for the expectation and deviation of $w$ in this statistical model were described and biologically justified by Brendel et al. (J Biomol Struct Dyn 1986). We have very recently introduced a time-optimal algorithm for computing all avoided words of a given sequence over an integer alphabet (Algorithms Mol Biol 2017). In this article, we extend this study by presenting an $\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03385","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:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HB8m8VIl65garwJ2YUa+oRSSHWdmxTCr9lH6p48LnabnPXEUS+GzSe+Xo4CqYo6QJ8GjbvlofM9//NYEuS7rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:50:47.265069Z"},"content_sha256":"8dde132769c7116bc9da6dde40a621ba434eade39c328ebe29396f53624056ec","schema_version":"1.0","event_id":"sha256:8dde132769c7116bc9da6dde40a621ba434eade39c328ebe29396f53624056ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV/bundle.json","state_url":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3SUVAWU2FU37IHVZDDESRX4QV/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-30T15:50:47Z","links":{"resolver":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV","bundle":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV/bundle.json","state":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3SUVAWU2FU37IHVZDDESRX4QV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:T3SUVAWU2FU37IHVZDDESRX4QV","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":"7ce3fa171fa5f040487894174bd6c4bd13ca78f432ad988ce8527976810fdc4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-09T15:26:46Z","title_canon_sha256":"40de4e697e39905c9e28c4517689b576ffe353abd5b52d85f85964974622dc50"},"schema_version":"1.0","source":{"id":"1705.03385","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03385","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03385v1","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03385","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"T3SUVAWU2FU3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T3SUVAWU2FU37IHV","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T3SUVAWU","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:8dde132769c7116bc9da6dde40a621ba434eade39c328ebe29396f53624056ec","target":"graph","created_at":"2026-05-18T00:44:48Z","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":"The observed frequency of the longest proper prefix, the longest proper suffix, and the longest infix of a word $w$ in a given sequence $x$ can be used for classifying $w$ as avoided or overabundant. The definitions used for the expectation and deviation of $w$ in this statistical model were described and biologically justified by Brendel et al. (J Biomol Struct Dyn 1986). We have very recently introduced a time-optimal algorithm for computing all avoided words of a given sequence over an integer alphabet (Algorithms Mol Biol 2017). In this article, we extend this study by presenting an $\\math","authors_text":"Costas S. Iliopoulos, Dimitris Polychronopoulos, Jia Gao, Manal Mohamed, Panagiotis Charalampopoulos, Solon P. Pissis, Yannis Almirantis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-09T15:26:46Z","title":"Optimal Computation of Overabundant Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03385","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:bedc85037a8c779fb53dc9e9dc3dcd3bed17b566f93ffdd907a54c5885860359","target":"record","created_at":"2026-05-18T00:44:48Z","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":"7ce3fa171fa5f040487894174bd6c4bd13ca78f432ad988ce8527976810fdc4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-09T15:26:46Z","title_canon_sha256":"40de4e697e39905c9e28c4517689b576ffe353abd5b52d85f85964974622dc50"},"schema_version":"1.0","source":{"id":"1705.03385","kind":"arxiv","version":1}},"canonical_sha256":"9ee54a82d4d169bfa0f5c8c64946fc8562da9bd1e1f4910dbb1739049161bc83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ee54a82d4d169bfa0f5c8c64946fc8562da9bd1e1f4910dbb1739049161bc83","first_computed_at":"2026-05-18T00:44:48.059002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:48.059002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rt/mptPTYS1vs1gFw5HOjCoTOutZ4Cz/HhfCqWHP1Okh9mIA04WKVpHB2bgrh+ysdBKnyk8O7lE+cXLznC8nDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:48.059760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03385","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bedc85037a8c779fb53dc9e9dc3dcd3bed17b566f93ffdd907a54c5885860359","sha256:8dde132769c7116bc9da6dde40a621ba434eade39c328ebe29396f53624056ec"],"state_sha256":"16ff99fd58cb0767a383cdc9e3c32b86a3b4fe017a078288944b2d6fda8a5bfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iB+JpQ3iSVLrNH37bJPrQn7pX2lmJbadTd6bTvplxwukT5FQuxv6v4wF6/XpC8f5fu75Ho1K0nujTuaRShnxCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:50:47.267235Z","bundle_sha256":"0ceba7356fd8ecf776dded7d65d21b4bcf78b5a2d14ff7bdbce780e91d47cf7d"}}