{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Y2MWU2JVXV2FU62MGG5FGZMY5X","short_pith_number":"pith:Y2MWU2JV","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"},"canonical_sha256":"c6996a6935bd745a7b4c31ba536598edfd39d05a4f560ed6145b8d7d2c417852","source":{"kind":"arxiv","id":"1803.11062","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.11062","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1803.11062v2","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11062","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"Y2MWU2JVXV2F","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y2MWU2JVXV2FU62M","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y2MWU2JV","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Y2MWU2JVXV2FU62MGG5FGZMY5X","target":"record","payload":{"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"},"canonical_sha256":"c6996a6935bd745a7b4c31ba536598edfd39d05a4f560ed6145b8d7d2c417852","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"},"source_kind":"arxiv","source_id":"1803.11062","source_version":2,"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-18T00:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XuxNjth0IIXY/2wVCWhFP86MmIp/yT+5e9BJjhjNZ3gwrUzp02hvIR6Ciux1Oyv3r9URc5ueL6bduBG1TC3CAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T05:09:17.954848Z"},"content_sha256":"f34b28b782384ccb60e95c92b71e40b55aae719aa7e2b81e4f74cc2cc31851a1","schema_version":"1.0","event_id":"sha256:f34b28b782384ccb60e95c92b71e40b55aae719aa7e2b81e4f74cc2cc31851a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Y2MWU2JVXV2FU62MGG5FGZMY5X","target":"graph","payload":{"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"},"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-18T00:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yhd7r4Jbytv+eVCzzh51ssVqQi/WicrIm2GWNMh9KvBL8Q79n5l5/ZxTdzVrffSrO/nfLVTgwewc5+6o8QMhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T05:09:17.955306Z"},"content_sha256":"5636c02ba847dca5579a9f9eea26cd6dc1d3ca0d326e32d9eb48d5e7fbf6ccb2","schema_version":"1.0","event_id":"sha256:5636c02ba847dca5579a9f9eea26cd6dc1d3ca0d326e32d9eb48d5e7fbf6ccb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X/bundle.json","state_url":"https://pith.science/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X/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-08-01T05:09:17Z","links":{"resolver":"https://pith.science/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X","bundle":"https://pith.science/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X/bundle.json","state":"https://pith.science/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2MWU2JVXV2FU62MGG5FGZMY5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Y2MWU2JVXV2FU62MGG5FGZMY5X","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":"1de148c59e4c7fc8b247a6e82a184d724e9138c5b7bdda2fa6e52ddcb6834b8e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-03-27T14:00:34Z","title_canon_sha256":"a05afbe7e2320b545cc8d0a96033eec9d68b5234b1a77746a21198d1dac699a6"},"schema_version":"1.0","source":{"id":"1803.11062","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.11062","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1803.11062v2","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11062","created_at":"2026-05-18T00:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"Y2MWU2JVXV2F","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Y2MWU2JVXV2FU62M","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Y2MWU2JV","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:5636c02ba847dca5579a9f9eea26cd6dc1d3ca0d326e32d9eb48d5e7fbf6ccb2","target":"graph","created_at":"2026-05-18T00:11:57Z","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":"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","authors_text":"Weijun Zhu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-03-27T14:00:34Z","title":"Analyzing DNA Hybridization via machine learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11062","kind":"arxiv","version":2},"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:f34b28b782384ccb60e95c92b71e40b55aae719aa7e2b81e4f74cc2cc31851a1","target":"record","created_at":"2026-05-18T00:11:57Z","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":"1de148c59e4c7fc8b247a6e82a184d724e9138c5b7bdda2fa6e52ddcb6834b8e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2018-03-27T14:00:34Z","title_canon_sha256":"a05afbe7e2320b545cc8d0a96033eec9d68b5234b1a77746a21198d1dac699a6"},"schema_version":"1.0","source":{"id":"1803.11062","kind":"arxiv","version":2}},"canonical_sha256":"c6996a6935bd745a7b4c31ba536598edfd39d05a4f560ed6145b8d7d2c417852","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6996a6935bd745a7b4c31ba536598edfd39d05a4f560ed6145b8d7d2c417852","first_computed_at":"2026-05-18T00:11:57.074626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:57.074626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Wfsvdtc0gJmiAGCFHgp9h+P9iKApNFVjuT1mNh8cT/WoikLHP4uHRsateDatXrYvxhzL0z2+XHsBFi3AJyoBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:57.075106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.11062","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f34b28b782384ccb60e95c92b71e40b55aae719aa7e2b81e4f74cc2cc31851a1","sha256:5636c02ba847dca5579a9f9eea26cd6dc1d3ca0d326e32d9eb48d5e7fbf6ccb2"],"state_sha256":"ff8aa0c18782fda772d38cc82e8b057ef99f72aef0ca37884d8ff49d26838055"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lzgplr2SC+nyXzdLNIPL5iiex6UcaD2dmAYQ9gb+sJcdvSHx4FoRj0jhqXh+2MKshepWr7gOcXlf6wxFOeMoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T05:09:17.960000Z","bundle_sha256":"3efa9f266c4963868acee525e50f10c7bb6d3e2b6da39d022df1786a1359f531"}}