{"id":"W4230939127","doi":"10.26434/chemrxiv.10250897.v1","title":"A Molecular Computing Approach to Solving Optimization Problems via Programmable Microdroplet Arrays","year":2019,"lang":"en","type":"preprint","venue":"ChemRxiv","topic":"Molecular Junctions and Nanostructures","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Simulated annealing; Computation; Computer science; Satisfiability; Hamiltonian (control theory); Unconventional computing; Ising model; Boolean satisfiability problem; Theoretical computer science; Computational science; Statistical physics; Algorithm; Mathematical optimization; Mathematics; Physics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001718325,0.000227816,0.0002917208,0.0002502879,0.0002910424,0.0006015813,0.000832152,0.0005948438,0.002676387],"category_scores_gemma":[0.0005412584,0.000188726,0.0003862747,0.0003183362,0.000956422,0.0009844543,0.0005280282,0.001225412,0.0003338509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004566923,"about_ca_system_score_gemma":0.0003853703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003575846,"about_ca_topic_score_gemma":0.0004996765,"domain_scores_codex":[0.9998586,0.00003274405,0.000006926698,0.00002905855,0.00006024276,0.00001239535],"domain_scores_gemma":[0.9998133,0.000114157,0.00001406435,0.00003237836,0.00001409522,0.00001209364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005620316,0.00009397719,0.0001844705,0.0001609465,0.00002994801,0.00008731038,0.00007859879,0.1608387,0.05493323,0.7470512,0.0009632703,0.03552219],"study_design_scores_gemma":[0.00004012627,0.0001130999,0.00008622993,0.00001676594,0.00001209164,0.00007206656,0.00001623868,0.8044655,0.02810668,0.1555664,0.01148592,0.00001895621],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03325816,0.0008023529,0.9507641,0.0007981965,0.0001234531,0.00007122699,0.00005325089,0.0003183052,0.01381091],"genre_scores_gemma":[0.4286876,0.001382183,0.5621992,0.0003254875,0.0001106809,0.000266247,0.00006289346,0.00006876412,0.006896918],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002676387,"threshold_uncertainty_score":0.008953452,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007808329053206301,"score_gpt":0.1918920210219567,"score_spread":0.1840836919687504,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}