{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:A7UKGS4ZWE2KKXU6A5VFTJ3HR3","short_pith_number":"pith:A7UKGS4Z","schema_version":"1.0","canonical_sha256":"07e8a34b99b134a55e9e076a59a7678eda7694fe7b9deb0bb9c5928ce15da276","source":{"kind":"arxiv","id":"0802.0314","version":6},"attestation_state":"computed","paper":{"title":"On the complexity of finding gapped motifs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Esko Ukkonen, Francois Nicolas, Morris Michael","submitted_at":"2008-02-04T00:08:40Z","abstract_excerpt":"This paper has been withdrawn by the corresponding author because the newest version is now published in Journal of Discrete Algorithms."},"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":"0802.0314","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-02-04T00:08:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3d5a98ada84bdad33cb4cabc2fc27fa6542fda63f324ee80458f7dd5ce718bd6","abstract_canon_sha256":"797adcce3a0c26dc913e24cc93230fa59fe2d203a97057ccbe767c414f733eaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:36.019124Z","signature_b64":"Diot+B9EZ+NgecbAvwrtyR9SwGEzxnaL/inQoa8e5RuX78izbVXk+5p0iKhyhRr5Q/6onnwYpmj++HGLb7jiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07e8a34b99b134a55e9e076a59a7678eda7694fe7b9deb0bb9c5928ce15da276","last_reissued_at":"2026-05-18T04:41:36.018729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:36.018729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of finding gapped motifs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Esko Ukkonen, Francois Nicolas, Morris Michael","submitted_at":"2008-02-04T00:08:40Z","abstract_excerpt":"This paper has been withdrawn by the corresponding author because the newest version is now published in Journal of Discrete Algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.0314","kind":"arxiv","version":6},"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":"0802.0314","created_at":"2026-05-18T04:41:36.018788+00:00"},{"alias_kind":"arxiv_version","alias_value":"0802.0314v6","created_at":"2026-05-18T04:41:36.018788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.0314","created_at":"2026-05-18T04:41:36.018788+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7UKGS4ZWE2K","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7UKGS4ZWE2KKXU6","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7UKGS4Z","created_at":"2026-05-18T12:25:56.245647+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/A7UKGS4ZWE2KKXU6A5VFTJ3HR3","json":"https://pith.science/pith/A7UKGS4ZWE2KKXU6A5VFTJ3HR3.json","graph_json":"https://pith.science/api/pith-number/A7UKGS4ZWE2KKXU6A5VFTJ3HR3/graph.json","events_json":"https://pith.science/api/pith-number/A7UKGS4ZWE2KKXU6A5VFTJ3HR3/events.json","paper":"https://pith.science/paper/A7UKGS4Z"},"agent_actions":{"view_html":"https://pith.science/pith/A7UKGS4ZWE2KKXU6A5VFTJ3HR3","download_json":"https://pith.science/pith/A7UKGS4ZWE2KKXU6A5VFTJ3HR3.json","view_paper":"https://pith.science/paper/A7UKGS4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0802.0314&json=true","fetch_graph":"https://pith.science/api/pith-number/A7UKGS4ZWE2KKXU6A5VFTJ3HR3/graph.json","fetch_events":"https://pith.science/api/pith-number/A7UKGS4ZWE2KKXU6A5VFTJ3HR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7UKGS4ZWE2KKXU6A5VFTJ3HR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7UKGS4ZWE2KKXU6A5VFTJ3HR3/action/storage_attestation","attest_author":"https://pith.science/pith/A7UKGS4ZWE2KKXU6A5VFTJ3HR3/action/author_attestation","sign_citation":"https://pith.science/pith/A7UKGS4ZWE2KKXU6A5VFTJ3HR3/action/citation_signature","submit_replication":"https://pith.science/pith/A7UKGS4ZWE2KKXU6A5VFTJ3HR3/action/replication_record"}},"created_at":"2026-05-18T04:41:36.018788+00:00","updated_at":"2026-05-18T04:41:36.018788+00:00"}