{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Y2MWU2JVXV2FU62MGG5FGZMY5X","short_pith_number":"pith:Y2MWU2JV","schema_version":"1.0","canonical_sha256":"c6996a6935bd745a7b4c31ba536598edfd39d05a4f560ed6145b8d7d2c417852","source":{"kind":"arxiv","id":"1803.11062","version":2},"attestation_state":"computed","paper":{"title":"Analyzing DNA Hybridization via machine learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"q-bio.QM","authors_text":"Weijun Zhu","submitted_at":"2018-03-27T14:00:34Z","abstract_excerpt":"In DNA computing, it is impossible to decide whether a specific hybridization among complex DNA molecules is effective or not within acceptable time. In order to address this common problem, we introduce a new method based on the machine learning technique. First, a sample set is employed to train the Boosted Tree (BT) algorithm, and the corresponding model is obtained. Second, this model is used to predict classification results of molecular hybridizations. The experiments show that the average accuracy of the new method is over 94.2%, and its average efficiency is over 90839 times higher tha"},"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":"1803.11062","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-03-27T14:00:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a05afbe7e2320b545cc8d0a96033eec9d68b5234b1a77746a21198d1dac699a6","abstract_canon_sha256":"1de148c59e4c7fc8b247a6e82a184d724e9138c5b7bdda2fa6e52ddcb6834b8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:57.075106Z","signature_b64":"8Wfsvdtc0gJmiAGCFHgp9h+P9iKApNFVjuT1mNh8cT/WoikLHP4uHRsateDatXrYvxhzL0z2+XHsBFi3AJyoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6996a6935bd745a7b4c31ba536598edfd39d05a4f560ed6145b8d7d2c417852","last_reissued_at":"2026-05-18T00:11:57.074626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:57.074626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analyzing DNA Hybridization via machine learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"q-bio.QM","authors_text":"Weijun Zhu","submitted_at":"2018-03-27T14:00:34Z","abstract_excerpt":"In DNA computing, it is impossible to decide whether a specific hybridization among complex DNA molecules is effective or not within acceptable time. In order to address this common problem, we introduce a new method based on the machine learning technique. First, a sample set is employed to train the Boosted Tree (BT) algorithm, and the corresponding model is obtained. Second, this model is used to predict classification results of molecular hybridizations. The experiments show that the average accuracy of the new method is over 94.2%, and its average efficiency is over 90839 times higher tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11062","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":"1803.11062","created_at":"2026-05-18T00:11:57.074703+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.11062v2","created_at":"2026-05-18T00:11:57.074703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11062","created_at":"2026-05-18T00:11:57.074703+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2MWU2JVXV2F","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2MWU2JVXV2FU62M","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2MWU2JV","created_at":"2026-05-18T12:33:04.347982+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/Y2MWU2JVXV2FU62MGG5FGZMY5X","json":"https://pith.science/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X.json","graph_json":"https://pith.science/api/pith-number/Y2MWU2JVXV2FU62MGG5FGZMY5X/graph.json","events_json":"https://pith.science/api/pith-number/Y2MWU2JVXV2FU62MGG5FGZMY5X/events.json","paper":"https://pith.science/paper/Y2MWU2JV"},"agent_actions":{"view_html":"https://pith.science/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X","download_json":"https://pith.science/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X.json","view_paper":"https://pith.science/paper/Y2MWU2JV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.11062&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2MWU2JVXV2FU62MGG5FGZMY5X/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2MWU2JVXV2FU62MGG5FGZMY5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X/action/storage_attestation","attest_author":"https://pith.science/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X/action/author_attestation","sign_citation":"https://pith.science/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X/action/citation_signature","submit_replication":"https://pith.science/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X/action/replication_record"}},"created_at":"2026-05-18T00:11:57.074703+00:00","updated_at":"2026-05-18T00:11:57.074703+00:00"}