{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:MGWKXD4MMKLSPXHXOLXSWGGSBL","short_pith_number":"pith:MGWKXD4M","schema_version":"1.0","canonical_sha256":"61acab8f8c629727dcf772ef2b18d20ac3f6f6a72636414ea0b1795335b89b58","source":{"kind":"arxiv","id":"1007.2618","version":2},"attestation_state":"computed","paper":{"title":"Sublinear Time Motif Discovery from Multiple Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bin Fu, Yunhui Fu","submitted_at":"2010-07-15T17:09:54Z","abstract_excerpt":"A natural probabilistic model for motif discovery has been used to experimentally test the quality of motif discovery programs. In this model, there are $k$ background sequences, and each character in a background sequence is a random character from an alphabet $\\Sigma$. A motif $G=g_1g_2...g_m$ is a string of $m$ characters. Each background sequence is implanted a probabilistically generated approximate copy of $G$. For a probabilistically generated approximate copy $b_1b_2...b_m$ of $G$, every character $b_i$ is probabilistically generated such that the probability for $b_i\\neq g_i$ is at mo"},"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":"1007.2618","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-15T17:09:54Z","cross_cats_sorted":[],"title_canon_sha256":"24dfc610291f15ed39ae4567965f9a2e5f84ebeeb018d22ed9f527a9eeb3f666","abstract_canon_sha256":"9ddcbcc661b88cc8539270394a7ef12564c0b2c2d8b617246450e9021e911f58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:16.158489Z","signature_b64":"Spx71HSWh0D5zy+zRdoXKenUqY49qW3ND3S4dP2kMbTY2D8Agy316a9TV2vJVyypTsrZH5QcmgVTGTM16aXBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61acab8f8c629727dcf772ef2b18d20ac3f6f6a72636414ea0b1795335b89b58","last_reissued_at":"2026-05-18T04:00:16.157741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:16.157741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sublinear Time Motif Discovery from Multiple Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bin Fu, Yunhui Fu","submitted_at":"2010-07-15T17:09:54Z","abstract_excerpt":"A natural probabilistic model for motif discovery has been used to experimentally test the quality of motif discovery programs. In this model, there are $k$ background sequences, and each character in a background sequence is a random character from an alphabet $\\Sigma$. A motif $G=g_1g_2...g_m$ is a string of $m$ characters. Each background sequence is implanted a probabilistically generated approximate copy of $G$. For a probabilistically generated approximate copy $b_1b_2...b_m$ of $G$, every character $b_i$ is probabilistically generated such that the probability for $b_i\\neq g_i$ is at mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.2618","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1007.2618","created_at":"2026-05-18T04:00:16.157864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.2618v2","created_at":"2026-05-18T04:00:16.157864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.2618","created_at":"2026-05-18T04:00:16.157864+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGWKXD4MMKLS","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGWKXD4MMKLSPXHX","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGWKXD4M","created_at":"2026-05-18T12:26:10.704358+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/MGWKXD4MMKLSPXHXOLXSWGGSBL","json":"https://pith.science/pith/MGWKXD4MMKLSPXHXOLXSWGGSBL.json","graph_json":"https://pith.science/api/pith-number/MGWKXD4MMKLSPXHXOLXSWGGSBL/graph.json","events_json":"https://pith.science/api/pith-number/MGWKXD4MMKLSPXHXOLXSWGGSBL/events.json","paper":"https://pith.science/paper/MGWKXD4M"},"agent_actions":{"view_html":"https://pith.science/pith/MGWKXD4MMKLSPXHXOLXSWGGSBL","download_json":"https://pith.science/pith/MGWKXD4MMKLSPXHXOLXSWGGSBL.json","view_paper":"https://pith.science/paper/MGWKXD4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.2618&json=true","fetch_graph":"https://pith.science/api/pith-number/MGWKXD4MMKLSPXHXOLXSWGGSBL/graph.json","fetch_events":"https://pith.science/api/pith-number/MGWKXD4MMKLSPXHXOLXSWGGSBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGWKXD4MMKLSPXHXOLXSWGGSBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGWKXD4MMKLSPXHXOLXSWGGSBL/action/storage_attestation","attest_author":"https://pith.science/pith/MGWKXD4MMKLSPXHXOLXSWGGSBL/action/author_attestation","sign_citation":"https://pith.science/pith/MGWKXD4MMKLSPXHXOLXSWGGSBL/action/citation_signature","submit_replication":"https://pith.science/pith/MGWKXD4MMKLSPXHXOLXSWGGSBL/action/replication_record"}},"created_at":"2026-05-18T04:00:16.157864+00:00","updated_at":"2026-05-18T04:00:16.157864+00:00"}