{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IQHCKY3R7HFYFJPW6VTOEQ533D","short_pith_number":"pith:IQHCKY3R","canonical_record":{"source":{"id":"1102.4015","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"q-bio.GN","submitted_at":"2011-02-19T19:07:52Z","cross_cats_sorted":[],"title_canon_sha256":"fa762980e6a780790ffb4fc3a00153897c491b2377ecfda0978cc498f7863751","abstract_canon_sha256":"b67830e755ab42144c60ffe02f9a8b185423ca50ddf887bf66a169dbc8ed940d"},"schema_version":"1.0"},"canonical_sha256":"440e256371f9cb82a5f6f566e243bbd8d6754ae09c44980db75c7fdc105152c5","source":{"kind":"arxiv","id":"1102.4015","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4015","created_at":"2026-05-18T04:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4015v1","created_at":"2026-05-18T04:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4015","created_at":"2026-05-18T04:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"IQHCKY3R7HFY","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IQHCKY3R7HFYFJPW","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IQHCKY3R","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IQHCKY3R7HFYFJPW6VTOEQ533D","target":"record","payload":{"canonical_record":{"source":{"id":"1102.4015","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"q-bio.GN","submitted_at":"2011-02-19T19:07:52Z","cross_cats_sorted":[],"title_canon_sha256":"fa762980e6a780790ffb4fc3a00153897c491b2377ecfda0978cc498f7863751","abstract_canon_sha256":"b67830e755ab42144c60ffe02f9a8b185423ca50ddf887bf66a169dbc8ed940d"},"schema_version":"1.0"},"canonical_sha256":"440e256371f9cb82a5f6f566e243bbd8d6754ae09c44980db75c7fdc105152c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:19.218862Z","signature_b64":"DX083Ln9r+pAdJ9t0x/0EGSsqcRD8eKc2RQlwjb/PU7rlNGIbaP1jAQ4T4XddUUeoLsem9DYzAaHQzfe69rHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"440e256371f9cb82a5f6f566e243bbd8d6754ae09c44980db75c7fdc105152c5","last_reissued_at":"2026-05-18T04:28:19.218086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:19.218086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.4015","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-18T04:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8lMt4I3qRVDHuTzTq50OFdwd9UHo29IUxxo2EHTtrN+YpbEpSSAR3ZHlo7HIecWIaVE8dlg+2kfwXaLm6PxbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:01:59.739565Z"},"content_sha256":"6d726174d42b0190fee4ab6a3ff9119866024cdd20477354ba2b8df7d4c81144","schema_version":"1.0","event_id":"sha256:6d726174d42b0190fee4ab6a3ff9119866024cdd20477354ba2b8df7d4c81144"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IQHCKY3R7HFYFJPW6VTOEQ533D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"dMotifGreedy: a novel tool for de novo discovery of DNA motifs with enhanced power of reporting distinct motifs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.GN","authors_text":"Michael Kelley, Romdhane Rekaya, Xinyu Liu, Yupeng Wang","submitted_at":"2011-02-19T19:07:52Z","abstract_excerpt":"De novo discovery of over-represented DNA motifs is one of the major challenges in computational biology. Although numerous tools have been available for de novo motif discovery, many of these tools are subject to local optima phenomena, which may hinder detection of multiple distinct motifs. A greedy algorithm based tool named dMotifGreedy was developed. dMotifGreedy begins by searching for candidate motifs from pair-wise local alignments of input sequences and then computes an optimal global solution for each candidate motif through a greedy algorithm. dMotifGreedy has competitive performanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4015","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-18T04:28:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKdQfKRnGVPPYnJa6wsCsEQoJZxEtSyA1vD7+upgXYpX2bfXa+YYoCgXYdO9KD9ihCpwt7nRlVqKd935kfx1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T22:01:59.739912Z"},"content_sha256":"b618917cdc738cf6be50406be59eee0a94ba90d9e3e21862ec3dce3b3061228b","schema_version":"1.0","event_id":"sha256:b618917cdc738cf6be50406be59eee0a94ba90d9e3e21862ec3dce3b3061228b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQHCKY3R7HFYFJPW6VTOEQ533D/bundle.json","state_url":"https://pith.science/pith/IQHCKY3R7HFYFJPW6VTOEQ533D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQHCKY3R7HFYFJPW6VTOEQ533D/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-19T22:01:59Z","links":{"resolver":"https://pith.science/pith/IQHCKY3R7HFYFJPW6VTOEQ533D","bundle":"https://pith.science/pith/IQHCKY3R7HFYFJPW6VTOEQ533D/bundle.json","state":"https://pith.science/pith/IQHCKY3R7HFYFJPW6VTOEQ533D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQHCKY3R7HFYFJPW6VTOEQ533D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IQHCKY3R7HFYFJPW6VTOEQ533D","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":"b67830e755ab42144c60ffe02f9a8b185423ca50ddf887bf66a169dbc8ed940d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"q-bio.GN","submitted_at":"2011-02-19T19:07:52Z","title_canon_sha256":"fa762980e6a780790ffb4fc3a00153897c491b2377ecfda0978cc498f7863751"},"schema_version":"1.0","source":{"id":"1102.4015","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4015","created_at":"2026-05-18T04:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4015v1","created_at":"2026-05-18T04:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4015","created_at":"2026-05-18T04:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"IQHCKY3R7HFY","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IQHCKY3R7HFYFJPW","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IQHCKY3R","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:b618917cdc738cf6be50406be59eee0a94ba90d9e3e21862ec3dce3b3061228b","target":"graph","created_at":"2026-05-18T04:28:19Z","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":"De novo discovery of over-represented DNA motifs is one of the major challenges in computational biology. Although numerous tools have been available for de novo motif discovery, many of these tools are subject to local optima phenomena, which may hinder detection of multiple distinct motifs. A greedy algorithm based tool named dMotifGreedy was developed. dMotifGreedy begins by searching for candidate motifs from pair-wise local alignments of input sequences and then computes an optimal global solution for each candidate motif through a greedy algorithm. dMotifGreedy has competitive performanc","authors_text":"Michael Kelley, Romdhane Rekaya, Xinyu Liu, Yupeng Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"q-bio.GN","submitted_at":"2011-02-19T19:07:52Z","title":"dMotifGreedy: a novel tool for de novo discovery of DNA motifs with enhanced power of reporting distinct motifs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4015","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:6d726174d42b0190fee4ab6a3ff9119866024cdd20477354ba2b8df7d4c81144","target":"record","created_at":"2026-05-18T04:28:19Z","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":"b67830e755ab42144c60ffe02f9a8b185423ca50ddf887bf66a169dbc8ed940d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"q-bio.GN","submitted_at":"2011-02-19T19:07:52Z","title_canon_sha256":"fa762980e6a780790ffb4fc3a00153897c491b2377ecfda0978cc498f7863751"},"schema_version":"1.0","source":{"id":"1102.4015","kind":"arxiv","version":1}},"canonical_sha256":"440e256371f9cb82a5f6f566e243bbd8d6754ae09c44980db75c7fdc105152c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"440e256371f9cb82a5f6f566e243bbd8d6754ae09c44980db75c7fdc105152c5","first_computed_at":"2026-05-18T04:28:19.218086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:19.218086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DX083Ln9r+pAdJ9t0x/0EGSsqcRD8eKc2RQlwjb/PU7rlNGIbaP1jAQ4T4XddUUeoLsem9DYzAaHQzfe69rHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:19.218862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4015","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d726174d42b0190fee4ab6a3ff9119866024cdd20477354ba2b8df7d4c81144","sha256:b618917cdc738cf6be50406be59eee0a94ba90d9e3e21862ec3dce3b3061228b"],"state_sha256":"128051cc7ba6056b71fc98c34026db053eef8f9719be62e447dc2943d98a0a49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfQvrzl8OLKWaF5qlFwVRw0zcH2xE3/ijRWsTqiKc6s18IJJk58Z6gr1O1ngjMWCgG7qMpEa+OVNrqpJapttAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T22:01:59.741958Z","bundle_sha256":"f599f20c34b9e20aa182f14b370b560fbfeba69892885da2abe751c32387c03d"}}