{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TNNTJBT4AXOYVRAZATQUV5J6KN","short_pith_number":"pith:TNNTJBT4","schema_version":"1.0","canonical_sha256":"9b5b34867c05dd8ac41904e14af53e535dfd97d63c00efd86def8df0e6775427","source":{"kind":"arxiv","id":"1810.01414","version":1},"attestation_state":"computed","paper":{"title":"PromID: human promoter prediction by deep learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"q-bio.GN","authors_text":"Hiroyuki Kuwahara, Ramzan Umarov, Victor Solovyev, Xin Gao, Yu Li","submitted_at":"2018-10-02T17:35:46Z","abstract_excerpt":"Computational identification of promoters is notoriously difficult as human genes often have unique promoter sequences that provide regulation of transcription and interaction with transcription initiation complex. While there are many attempts to develop computational promoter identification methods, we have no reliable tool to analyze long genomic sequences. In this work we further develop our deep learning approach that was relatively successful to discriminate short promoter and non-promoter sequences. Instead of focusing on the classification accuracy, in this work we predict the exact po"},"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":"1810.01414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2018-10-02T17:35:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"78aa91c02c4adb9a92ce4ad97438f29cbbcf69f883d0a601550fbf9f87c2e75c","abstract_canon_sha256":"09eb3870b6e3299e7888e2109251fc41eed66b449f0ebad7e2d18a5b514fd338"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:12.286173Z","signature_b64":"OjyHsUmetfDfoDt7hahSUb+71WxIYFjmh1U6t2ubthuI9M52KOTgYykikxXd4g2XR45r2gY9BmBwBEjNe9YGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b5b34867c05dd8ac41904e14af53e535dfd97d63c00efd86def8df0e6775427","last_reissued_at":"2026-05-18T00:04:12.285480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:12.285480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PromID: human promoter prediction by deep learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"q-bio.GN","authors_text":"Hiroyuki Kuwahara, Ramzan Umarov, Victor Solovyev, Xin Gao, Yu Li","submitted_at":"2018-10-02T17:35:46Z","abstract_excerpt":"Computational identification of promoters is notoriously difficult as human genes often have unique promoter sequences that provide regulation of transcription and interaction with transcription initiation complex. While there are many attempts to develop computational promoter identification methods, we have no reliable tool to analyze long genomic sequences. In this work we further develop our deep learning approach that was relatively successful to discriminate short promoter and non-promoter sequences. Instead of focusing on the classification accuracy, in this work we predict the exact po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01414","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":"1810.01414","created_at":"2026-05-18T00:04:12.285593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01414v1","created_at":"2026-05-18T00:04:12.285593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01414","created_at":"2026-05-18T00:04:12.285593+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNNTJBT4AXOY","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNNTJBT4AXOYVRAZ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNNTJBT4","created_at":"2026-05-18T12:32:53.628368+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/TNNTJBT4AXOYVRAZATQUV5J6KN","json":"https://pith.science/pith/TNNTJBT4AXOYVRAZATQUV5J6KN.json","graph_json":"https://pith.science/api/pith-number/TNNTJBT4AXOYVRAZATQUV5J6KN/graph.json","events_json":"https://pith.science/api/pith-number/TNNTJBT4AXOYVRAZATQUV5J6KN/events.json","paper":"https://pith.science/paper/TNNTJBT4"},"agent_actions":{"view_html":"https://pith.science/pith/TNNTJBT4AXOYVRAZATQUV5J6KN","download_json":"https://pith.science/pith/TNNTJBT4AXOYVRAZATQUV5J6KN.json","view_paper":"https://pith.science/paper/TNNTJBT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01414&json=true","fetch_graph":"https://pith.science/api/pith-number/TNNTJBT4AXOYVRAZATQUV5J6KN/graph.json","fetch_events":"https://pith.science/api/pith-number/TNNTJBT4AXOYVRAZATQUV5J6KN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNNTJBT4AXOYVRAZATQUV5J6KN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNNTJBT4AXOYVRAZATQUV5J6KN/action/storage_attestation","attest_author":"https://pith.science/pith/TNNTJBT4AXOYVRAZATQUV5J6KN/action/author_attestation","sign_citation":"https://pith.science/pith/TNNTJBT4AXOYVRAZATQUV5J6KN/action/citation_signature","submit_replication":"https://pith.science/pith/TNNTJBT4AXOYVRAZATQUV5J6KN/action/replication_record"}},"created_at":"2026-05-18T00:04:12.285593+00:00","updated_at":"2026-05-18T00:04:12.285593+00:00"}