{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:T3SUVAWU2FU37IHVZDDESRX4QV","short_pith_number":"pith:T3SUVAWU","schema_version":"1.0","canonical_sha256":"9ee54a82d4d169bfa0f5c8c64946fc8562da9bd1e1f4910dbb1739049161bc83","source":{"kind":"arxiv","id":"1705.03385","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.03385","created_at":"2026-05-18T00:44:48.059128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03385v1","created_at":"2026-05-18T00:44:48.059128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03385","created_at":"2026-05-18T00:44:48.059128+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3SUVAWU2FU3","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3SUVAWU2FU37IHV","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3SUVAWU","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV","json":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV.json","graph_json":"https://pith.science/api/pith-number/T3SUVAWU2FU37IHVZDDESRX4QV/graph.json","events_json":"https://pith.science/api/pith-number/T3SUVAWU2FU37IHVZDDESRX4QV/events.json","paper":"https://pith.science/paper/T3SUVAWU"},"agent_actions":{"view_html":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV","download_json":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV.json","view_paper":"https://pith.science/paper/T3SUVAWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03385&json=true","fetch_graph":"https://pith.science/api/pith-number/T3SUVAWU2FU37IHVZDDESRX4QV/graph.json","fetch_events":"https://pith.science/api/pith-number/T3SUVAWU2FU37IHVZDDESRX4QV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV/action/storage_attestation","attest_author":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV/action/author_attestation","sign_citation":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV/action/citation_signature","submit_replication":"https://pith.science/pith/T3SUVAWU2FU37IHVZDDESRX4QV/action/replication_record"}},"created_at":"2026-05-18T00:44:48.059128+00:00","updated_at":"2026-05-18T00:44:48.059128+00:00"}