{"meta":{"query_hash":"2b2309294cc4","filters":{"topic":"Quantum Computing Algorithms and Architecture"},"cohort_total":2386,"direct_labels_cover":3,"predictions_cover":2386,"exported":2386,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/2b2309294cc4","api":"https://metacan.xera.ac/api/v1/cohort?topic=Quantum+Computing+Algorithms+and+Architecture"},"results":[{"id":"W112280384","doi":"10.1017/9781009417020.003","title":"Introduction to Quantum Computing","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum computer; Computer science; Notation; Quantum; Theoretical computer science; Quantum mechanics; Physics; Mathematics; Arithmetic","score_opus":0.011822867917491769,"score_gpt":0.19785323931894336,"score_spread":0.1860303714014516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112280384","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010571338,0.00014832157,0.17115629,0.0008750015,0.002548525,0.0003295759,0.000040367562,0.0009277206,0.8238685],"genre_scores_gemma":[0.00062288763,0.000009100612,0.005491194,0.00014976574,0.0020788603,2.0622448e-7,0.000012937043,0.00005157789,0.99158347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99779737,0.0000299429,0.00023265119,0.0011726102,0.00036164053,0.00040579616],"domain_scores_gemma":[0.9984313,0.00006495364,0.00013882648,0.0009726285,0.00013977497,0.00025246773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017813331,0.00044395385,0.00040049636,0.00042224125,0.00027634628,0.0002692831,0.0013788494,0.00024290437,0.0000015272768],"category_scores_gemma":[0.000008617001,0.00049402996,0.0002405466,0.000041122585,0.00008496471,0.000085970365,0.0018742274,0.00081673183,0.0001528291],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007533294,0.000004366846,4.0845027e-8,0.0000658912,0.0000671336,0.00029591392,0.00012855577,0.00056742784,0.000031059986,0.9017811,0.0846663,0.012384677],"study_design_scores_gemma":[0.00011172235,0.00008581253,0.000001971045,0.0002142794,0.00004920778,0.000077923825,0.0000061339124,0.10255713,0.00009459506,0.0002022332,0.89609694,0.000502072],"about_ca_topic_score_codex":0.000044197288,"about_ca_topic_score_gemma":5.189126e-7,"teacher_disagreement_score":0.90157884,"about_ca_system_score_codex":0.0001835286,"about_ca_system_score_gemma":0.00009316109,"threshold_uncertainty_score":0.99975115},"labels":[],"label_agreement":null},{"id":"W1137114999","doi":"10.1088/2058-9565/1/1/015003","title":"Parallelizing quantum circuit synthesis","year":2016,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Quantum circuit; Quantum gate; Quantum computer; Quantum algorithm; Speedup; Qubit; Electronic circuit; Adder; Pseudorandom number generator; Quantum dot cellular automaton","score_opus":0.012908538488906905,"score_gpt":0.22883092938126526,"score_spread":0.21592239089235835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1137114999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68131477,0.00047396636,0.28707722,0.028579658,0.0006068931,0.00016540875,0.0000026041175,0.0012242774,0.0005551924],"genre_scores_gemma":[0.9924746,0.0000893962,0.007145844,0.00018390082,0.000044390512,0.000020067335,4.4055454e-8,0.000009653484,0.00003208641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746966,0.000032468717,0.00026348938,0.00093160913,0.00050058705,0.0008021727],"domain_scores_gemma":[0.9983628,0.0002630897,0.000115253606,0.00088155986,0.00021590982,0.00016143512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009865162,0.00020943425,0.00025514266,0.00085509685,0.00065511785,0.00018375112,0.0021168937,0.00013223839,0.0000071574927],"category_scores_gemma":[0.0008078582,0.00013295886,0.00003718671,0.002383089,0.0015165594,0.00053964753,0.00084909354,0.00018065677,0.00006671762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5252185e-7,0.000018631074,0.00056431384,0.000004236607,0.000003909711,0.000022691906,0.000063227395,0.0000013082413,0.037794344,0.64859885,0.000064358406,0.3128633],"study_design_scores_gemma":[0.00056853367,0.0004611478,0.0031064916,0.00027670898,0.000012710996,0.0007892029,0.00014358353,0.2177312,0.061623555,0.6998818,0.014429201,0.00097587344],"about_ca_topic_score_codex":0.00001357196,"about_ca_topic_score_gemma":0.0000020053626,"teacher_disagreement_score":0.3118874,"about_ca_system_score_codex":0.000052999694,"about_ca_system_score_gemma":0.0002476512,"threshold_uncertainty_score":0.55878264},"labels":[],"label_agreement":null},{"id":"W11928035","doi":"10.1007/s00464-001-8216-5","title":"1-qubit versus 2-qubit measurement based quantum computing","year":2005,"lang":"en","type":"article","venue":"Surgical Endoscopy","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Qubit; Embedding; Quantum entanglement; Quantum computer; Computer science; Quantum; Algorithm; Theoretical computer science; Quantum mechanics; Physics; Artificial intelligence","score_opus":0.02607193807216458,"score_gpt":0.2687587716185666,"score_spread":0.24268683354640203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11928035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24247359,0.0014314238,0.7279218,0.011546606,0.0045189233,0.00065608445,0.000009321272,0.0021957292,0.009246554],"genre_scores_gemma":[0.91972136,0.000006349399,0.079000376,0.00043002953,0.00076972326,0.000007633129,0.0000038033052,0.000026060261,0.000034681143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965472,0.00021153336,0.0004769914,0.00078964484,0.0011409037,0.00083368155],"domain_scores_gemma":[0.9981526,0.00045116604,0.0001493572,0.00075947115,0.00015839034,0.00032898106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009677914,0.00035557518,0.00038761314,0.00015568102,0.00035961482,0.00024675368,0.0011663315,0.00011253076,0.00008273552],"category_scores_gemma":[0.00010139374,0.00030704765,0.0002395666,0.00057243975,0.00008748235,0.00018536337,0.00035112904,0.00048658793,0.00026400993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011323802,0.0015794793,0.00047035073,0.00014984272,0.00027287877,0.00095821946,0.0013068774,0.27702728,0.00196268,0.1526562,0.0060645244,0.5564193],"study_design_scores_gemma":[0.0066147544,0.0002458089,0.00013352495,0.00007278557,0.000008935471,0.000023754757,0.0000061150395,0.89747554,0.0032284502,0.00031558314,0.09150057,0.00037415678],"about_ca_topic_score_codex":0.000033664193,"about_ca_topic_score_gemma":0.0000074789905,"teacher_disagreement_score":0.67724776,"about_ca_system_score_codex":0.0001602519,"about_ca_system_score_gemma":0.00019036532,"threshold_uncertainty_score":0.9999382},"labels":[],"label_agreement":null},{"id":"W142413548","doi":"10.1103/physrevx.5.031043","title":"Single-Shot Fault-Tolerant Quantum Error Correction","year":2015,"lang":"en","type":"article","venue":"Physical Review X","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":154,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"CHIST-ERA; Ministerio de Economía y Competitividad; European Research Council; Danmarks Frie Forskningsfond; Institut Périmètre de physique théorique; Industry Canada","keywords":"Initialization; Computer science; Quantum; Quantum computer; Quantum error correction; Quantum algorithm; Error detection and correction; Feature (linguistics); Topology (electrical circuits); Computation; Algorithm; Physics; Quantum mechanics; Mathematics","score_opus":0.059816140207830173,"score_gpt":0.32039073475852003,"score_spread":0.2605745945506899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142413548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34575543,0.040658187,0.5744465,0.016698241,0.01003742,0.0013647863,0.000007051689,0.0019296255,0.009102767],"genre_scores_gemma":[0.9925243,0.0002432742,0.0043105176,0.0021411404,0.0006461091,0.000017390541,0.000003924171,0.000017779434,0.000095553114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853164,0.00014220046,0.00022658275,0.0004099212,0.0003904975,0.00029914064],"domain_scores_gemma":[0.99892527,0.0001056091,0.000112240006,0.00051689416,0.000115286595,0.00022472865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002862167,0.00018656297,0.00036371947,0.00003344878,0.000080868136,0.00008083175,0.0005908319,0.000022156777,0.0000029654436],"category_scores_gemma":[0.00018223819,0.00013916947,0.00015812884,0.0004867643,0.00003847915,0.0001783557,0.00020318945,0.00024336863,0.0002183839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011855762,0.0010856065,0.000036377394,0.0006380811,0.000039437968,0.000058534293,0.0014852313,0.004615866,0.0017225456,0.029680805,0.026571445,0.9340542],"study_design_scores_gemma":[0.00015426628,0.00024603622,0.00007330717,0.00074551103,0.000014875805,0.000044228298,0.0000063053817,0.936374,0.00047467343,0.010339889,0.05128793,0.0002389521],"about_ca_topic_score_codex":0.000019382815,"about_ca_topic_score_gemma":0.000001810304,"teacher_disagreement_score":0.93381524,"about_ca_system_score_codex":0.00004056175,"about_ca_system_score_gemma":0.00006204122,"threshold_uncertainty_score":0.5675166},"labels":[],"label_agreement":null},{"id":"W1442388864","doi":"10.1007/978-3-642-36315-3_10","title":"Properties of Quantum Templates","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Template; Rewriting; Computer science; Electronic circuit; Quantum; Set (abstract data type); Identity (music); Process (computing); Template matching; Theoretical computer science; Algorithm; Programming language; Image (mathematics); Artificial intelligence; Electrical engineering; Physics","score_opus":0.01877705793520472,"score_gpt":0.22070524635497776,"score_spread":0.20192818841977306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1442388864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002406249,0.0012827053,0.99236935,0.0008019222,0.0015047787,0.00040871336,0.0000031216869,0.00020214035,0.0010210397],"genre_scores_gemma":[0.65494776,0.00004931483,0.34348744,0.0005421952,0.000470143,0.000009902329,0.0000019429,0.00005492541,0.0004363627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960858,0.000038546117,0.00073050364,0.001397185,0.0010274549,0.000720488],"domain_scores_gemma":[0.99724114,0.00025860092,0.00044547045,0.0015360219,0.00034980252,0.00016896795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006387548,0.0006075708,0.0007557605,0.00086698576,0.00021938123,0.00040377417,0.004011636,0.00030579793,0.00002323309],"category_scores_gemma":[0.00008281361,0.0004657187,0.00018663362,0.00057508925,0.0009998708,0.0004420835,0.0017869354,0.00086824445,0.00007023532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053484528,0.000056657434,0.000028012166,0.00019762204,0.000028282893,0.00005089947,0.0019049502,0.08758849,0.002177613,0.044877354,0.000049055758,0.86303574],"study_design_scores_gemma":[0.0001483096,0.00019072529,0.00004795817,0.00088455586,0.000004963926,0.00007669877,1.5362097e-7,0.8803893,0.007472109,0.109665744,0.00056393037,0.0005555869],"about_ca_topic_score_codex":0.000072384406,"about_ca_topic_score_gemma":0.000009001886,"teacher_disagreement_score":0.8624801,"about_ca_system_score_codex":0.000101523736,"about_ca_system_score_gemma":0.00049990235,"threshold_uncertainty_score":0.99977946},"labels":[],"label_agreement":null},{"id":"W1479892629","doi":"10.26421/qic14.9-10-1","title":"Fault-tolerant renormalization group decoder for abelian topological codes","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Abelian group; Generalization; Decoding methods; Logarithm; Mathematics; Code (set theory); Discrete mathematics; Fault tolerance; Computer science; Matching (statistics); Algorithm; Combinatorics; Topology (electrical circuits); Set (abstract data type)","score_opus":0.010078647771845322,"score_gpt":0.24871246661697136,"score_spread":0.23863381884512602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479892629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07348453,0.000030324116,0.9244767,0.00093823177,0.0003371108,0.00024397501,0.0000042696583,0.00026060248,0.00022425699],"genre_scores_gemma":[0.90284854,0.000010364482,0.09571953,0.0011991503,0.000076262135,0.000021092299,0.000113314396,0.000005229775,0.00000651454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998891,0.00007451185,0.000414605,0.00019502974,0.00019930274,0.00022553753],"domain_scores_gemma":[0.9992324,0.00017709193,0.00020393722,0.00014618231,0.00015360324,0.00008675207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047375634,0.00015043622,0.00016624977,0.0001601958,0.00036610084,0.00037573956,0.0002149099,0.00008444213,0.0000022246538],"category_scores_gemma":[0.00007176915,0.00012740938,0.000049844817,0.00022077783,0.00004089839,0.00097243325,0.00007584316,0.00008951204,0.000014305904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001700207,0.000029679364,0.000094791,0.00006520053,0.0000090558915,2.006473e-7,0.001533748,0.05840595,0.000030616953,0.4659457,0.00044232665,0.47342575],"study_design_scores_gemma":[0.00060164445,0.000254061,0.0022178213,0.000020547059,0.0000044350754,0.000018188637,0.00005399354,0.9517728,0.00004026475,0.034218423,0.010618271,0.0001795536],"about_ca_topic_score_codex":0.000016101301,"about_ca_topic_score_gemma":0.0000033211645,"teacher_disagreement_score":0.8933669,"about_ca_system_score_codex":0.000016816122,"about_ca_system_score_gemma":0.000018791863,"threshold_uncertainty_score":0.5195604},"labels":[],"label_agreement":null},{"id":"W1480910789","doi":"10.26421/qic14.15-16-2","title":"Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Unitary state; Electronic circuit; State (computer science); Scaling; Mathematics; Quantum circuit; Computer science; Algorithm; Topology (electrical circuits); Discrete mathematics; Quantum; Combinatorics; Physics; Quantum mechanics; Quantum error correction","score_opus":0.007566230245772135,"score_gpt":0.24024921081578604,"score_spread":0.2326829805700139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480910789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.344826,0.000011119199,0.6540509,0.0001905925,0.00021096942,0.000094516676,0.0000021296273,0.00009606361,0.00051767885],"genre_scores_gemma":[0.96580327,0.0000041413123,0.033821736,0.0002735281,0.000040969862,0.0000043306736,0.000044138942,0.0000049845758,0.0000029051691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879736,0.00007313646,0.00052977074,0.00016632471,0.00025894,0.00017448845],"domain_scores_gemma":[0.9989927,0.00017542916,0.00037276628,0.00020746188,0.00017773977,0.00007392992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003207777,0.00015122982,0.00020044923,0.00025028424,0.00021496884,0.00027903606,0.00024702697,0.00006320892,0.0000019899417],"category_scores_gemma":[0.000058830297,0.00014186617,0.000046924204,0.00031238678,0.00007138827,0.0011267287,0.00011502904,0.00010188088,0.000015534797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003280463,0.000093627656,0.00038165363,0.00029781734,0.000024181216,0.0000015023401,0.005046959,0.04680573,0.00075950177,0.16345164,0.00018162993,0.782923],"study_design_scores_gemma":[0.0004056988,0.00034850262,0.005995454,0.00007284549,0.000007478703,0.000032069725,0.00005445552,0.97735316,0.0005694895,0.014268163,0.00072508975,0.00016757098],"about_ca_topic_score_codex":0.000023563101,"about_ca_topic_score_gemma":0.0000015670133,"teacher_disagreement_score":0.9305475,"about_ca_system_score_codex":0.00001749848,"about_ca_system_score_gemma":0.000030626667,"threshold_uncertainty_score":0.57851344},"labels":[],"label_agreement":null},{"id":"W1481633365","doi":"10.1002/0471469882.cardpl","title":"Pure and Applied Mathematics","year":2003,"lang":"en","type":"other","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Mathematics; Library science; Citation; Computer science","score_opus":0.007017370622976213,"score_gpt":0.20754073398075282,"score_spread":0.2005233633577766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481633365","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004251278,0.00023647553,0.36288664,0.0000939255,0.00013590066,0.000089987705,9.4095594e-7,0.00034355867,0.6362083],"genre_scores_gemma":[0.000022637818,0.000018921952,0.60188425,0.00025016774,0.00008745704,0.0000030047458,8.2929773e-7,0.00009761038,0.39763516],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992948,0.000006906824,0.00009263406,0.00030789644,0.00013193191,0.00016579569],"domain_scores_gemma":[0.9994072,0.000022133636,0.00007071259,0.000435098,0.000004702896,0.000060166512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000063449086,0.00017952683,0.00019859553,0.00010104607,0.00003263076,0.00009959841,0.00037587588,0.00013303781,0.00015182883],"category_scores_gemma":[0.0000034402117,0.00013291459,0.00002602351,0.000111331065,0.000026837171,0.000009023858,0.00016442232,0.00014368053,0.00007062568],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5850694e-8,0.0000296693,5.624084e-7,0.00012332949,0.000026652162,0.000009501427,0.00021463395,0.000012818276,0.000010214597,0.31579772,0.62464523,0.059129562],"study_design_scores_gemma":[0.00019461355,0.000022052456,0.0000022493105,0.000107634965,0.000007361756,0.000098618264,0.000013299611,0.03177202,0.000052365933,0.01383572,0.9534185,0.00047558305],"about_ca_topic_score_codex":0.0000032450885,"about_ca_topic_score_gemma":0.0000032122618,"teacher_disagreement_score":0.32877323,"about_ca_system_score_codex":0.0000032633625,"about_ca_system_score_gemma":0.000017197075,"threshold_uncertainty_score":0.54200995},"labels":[],"label_agreement":null},{"id":"W1484385501","doi":"10.4230/lipics.tqc.2013.80","title":"Dequantizing Read-once Quantum Formulas","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Toffoli gate; Qubit; Quantum circuit; Quantum gate; Quantum; Mathematics; Quantum computer; Quantum algorithm; Discrete mathematics; Quantum error correction; Computer science; Quantum mechanics; Physics","score_opus":0.018988195329939568,"score_gpt":0.26012099073690825,"score_spread":0.2411327954069687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484385501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17489932,0.00031709744,0.81179744,0.00096701307,0.0055249603,0.0024906707,0.00043429792,0.0012108787,0.002358323],"genre_scores_gemma":[0.567097,0.00018572026,0.42674497,0.0024422617,0.001272497,0.00050674117,0.00097627926,0.00023721733,0.00053730916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99321854,0.00011074498,0.0024445257,0.0011039901,0.0011583298,0.001963888],"domain_scores_gemma":[0.9937007,0.00044123008,0.0016611044,0.002992037,0.0006694682,0.000535464],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0011656393,0.0013296164,0.0013879474,0.0006791714,0.00083954557,0.0025148634,0.0052180747,0.0009711144,0.00002886866],"category_scores_gemma":[0.00021483273,0.0011847239,0.0009191347,0.0005063335,0.00019654515,0.001693636,0.0062270565,0.0026214467,0.00037915376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021469072,0.0018005014,0.00235196,0.014749247,0.0022808546,0.00016528546,0.07052297,0.06926711,0.00027431746,0.33975974,0.04234648,0.45626685],"study_design_scores_gemma":[0.0012935866,0.0002390596,0.0002044446,0.0010962337,0.000051083745,0.00014674402,0.0002189164,0.9243122,0.000292498,0.026408145,0.044301584,0.0014355171],"about_ca_topic_score_codex":0.00011296276,"about_ca_topic_score_gemma":0.000011599101,"teacher_disagreement_score":0.8550451,"about_ca_system_score_codex":0.00026075292,"about_ca_system_score_gemma":0.00037684516,"threshold_uncertainty_score":0.9999455},"labels":[],"label_agreement":null},{"id":"W1486244752","doi":"10.1063/1.4926427","title":"Generalized graph states based on Hadamard matrices","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Guelph; University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Symmetric graph; Voltage graph; Hadamard three-lines theorem; Line graph; Graph; Graph property; Pauli matrices; Distance-regular graph; Complement graph","score_opus":0.0232837799552378,"score_gpt":0.2626320988776151,"score_spread":0.23934831892237732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486244752","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064779066,0.00006324645,0.9327184,0.0016475553,0.00024940397,0.000049470793,0.0000011298724,0.000041225205,0.00045051545],"genre_scores_gemma":[0.31909177,0.0000072021344,0.67923355,0.0009951942,0.00061278895,0.0000012732305,7.15638e-7,0.000020527566,0.000037010006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985056,0.00009442946,0.0003833303,0.00012711089,0.0006895554,0.00019997],"domain_scores_gemma":[0.99864614,0.00032531042,0.00031911375,0.00028313475,0.00020856035,0.00021776384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061802816,0.00014142906,0.00031230628,0.00008622808,0.000050158375,0.00014622821,0.0006515345,0.00003393875,0.0000041168914],"category_scores_gemma":[0.000099427,0.000092348375,0.00018032324,0.00030513585,0.000038416372,0.00016339005,0.00007567883,0.00025277302,0.00002570291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010969188,0.0016513121,0.00006237086,0.00018726067,0.00013073886,0.00025342865,0.0023735687,0.6294137,0.00022742743,0.27363998,0.023065154,0.068885334],"study_design_scores_gemma":[0.0004263565,0.00026069477,0.0000122294305,0.00007034401,0.000008637834,0.00002515534,0.00000956686,0.5921573,0.00034090984,0.406272,0.00033521248,0.00008162793],"about_ca_topic_score_codex":8.444921e-7,"about_ca_topic_score_gemma":3.5015276e-8,"teacher_disagreement_score":0.2543127,"about_ca_system_score_codex":0.000025119405,"about_ca_system_score_gemma":0.000102917,"threshold_uncertainty_score":0.37658572},"labels":[],"label_agreement":null},{"id":"W1492520002","doi":"10.1007/978-3-540-89304-2","title":"Theory of Quantum Computation, Communication, and Cryptography: Third Workshop, TQC 2008 Tokyo, Japan, January 30 - February 1, 2008. Revised Selected Papers","year":2008,"lang":"en","type":"book","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum cryptography; Quantum computer; Quantum entanglement; Cryptography; Computer science; Quantum algorithm; Theoretical computer science; Quantum; Discrete mathematics; Quantum information; Mathematics; Algorithm; Quantum mechanics; Physics","score_opus":0.010868349622109984,"score_gpt":0.22355803905417643,"score_spread":0.21268968943206645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492520002","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004496021,0.053823337,0.72478133,0.0030790176,0.001099788,0.0030189313,0.00010245469,0.002487673,0.20711143],"genre_scores_gemma":[0.064021595,0.03796951,0.687925,0.008166941,0.0018765177,0.0002249478,0.002613961,0.00085746736,0.19634408],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951384,0.00075206516,0.0013213629,0.0012408594,0.0008532563,0.0006940734],"domain_scores_gemma":[0.99411494,0.0018374939,0.0009977135,0.0019306828,0.00080444827,0.00031474803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085704617,0.0009054228,0.0012582678,0.00072948355,0.0007456221,0.0002066634,0.0023693678,0.00062789995,0.000059836573],"category_scores_gemma":[0.00014743202,0.00081513904,0.00037202224,0.0012327173,0.000867792,0.00027874715,0.000984913,0.0014153126,0.000027574704],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008250862,0.0003602134,0.00027684274,0.00052949396,0.00085533183,0.00008581912,0.0049850573,0.0040448285,0.000062537954,0.24593501,0.67615986,0.06662248],"study_design_scores_gemma":[0.004375644,0.0011989069,0.027794633,0.0052581816,0.0004472244,0.0015095822,0.0003626636,0.5330273,0.00010951538,0.33068714,0.089128114,0.0061011086],"about_ca_topic_score_codex":0.0000815346,"about_ca_topic_score_gemma":0.000013346318,"teacher_disagreement_score":0.5870318,"about_ca_system_score_codex":0.00007424463,"about_ca_system_score_gemma":0.00088441203,"threshold_uncertainty_score":0.99942994},"labels":[],"label_agreement":null},{"id":"W1496853341","doi":"10.1109/focs.2015.53","title":"Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Thomas and Stacey Siebel Foundation; Simons Foundation; National Science Foundation","keywords":"Communication complexity; Upper and lower bounds; Corollary; Bounded function; Quantum; Mathematics; Quantum information science; Omega; Logarithm; Function (biology); Computational complexity theory; Discrete mathematics; Quantum information; Combinatorics; Physics; Algorithm; Quantum mechanics","score_opus":0.06095299159912352,"score_gpt":0.29952927698930654,"score_spread":0.23857628539018302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496853341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53268015,0.000403879,0.45564982,0.0033926032,0.0013396195,0.00048262175,0.000045025747,0.0005712889,0.0054349834],"genre_scores_gemma":[0.79361516,0.000017179316,0.20577072,0.00019148237,0.000110184716,0.000015341744,0.00008471757,0.000030285311,0.00016492975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965806,0.00041946585,0.00075677334,0.000919017,0.00084068085,0.0004834431],"domain_scores_gemma":[0.9949626,0.0002394417,0.0006337276,0.0034995587,0.00044475534,0.00021995879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011829616,0.0005130004,0.0007809013,0.00017911487,0.00040415794,0.0009265758,0.003943156,0.00032521595,0.000019349463],"category_scores_gemma":[0.0000829862,0.0004464542,0.00027376346,0.0003499491,0.0008741692,0.00017078544,0.005388595,0.0013478573,0.000037675094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006516777,0.0008730631,0.00017215643,0.00033214546,0.00017612624,0.000015332453,0.0044357427,0.16161323,0.000029655925,0.8078495,0.005926295,0.018511564],"study_design_scores_gemma":[0.0002967912,0.00020367211,0.0011192723,0.00022868309,0.000012738561,0.000016304934,0.00003389296,0.79561913,0.00009355998,0.20010464,0.0018459909,0.00042531374],"about_ca_topic_score_codex":0.001032887,"about_ca_topic_score_gemma":0.00007022269,"teacher_disagreement_score":0.6340059,"about_ca_system_score_codex":0.00016379755,"about_ca_system_score_gemma":0.00067766855,"threshold_uncertainty_score":0.9997987},"labels":[],"label_agreement":null},{"id":"W1500361768","doi":"10.26421/qic8.5-5","title":"An extremal result for geometries in the one-way measurement model","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Embedding; Mathematics; Unitary state; Combinatorics; Flow (mathematics); Discrete mathematics; Graph; Computer science; Mathematical analysis; Geometry","score_opus":0.057444445662429504,"score_gpt":0.2683101966550184,"score_spread":0.21086575099258886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500361768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23253268,0.0000386955,0.7661385,0.0008035774,0.00007217738,0.00025016462,0.0000031693467,0.00007132393,0.00008970922],"genre_scores_gemma":[0.9568425,0.000013466559,0.04239373,0.0006650854,0.00003246372,0.000024639447,0.000023445089,0.0000031637228,0.0000014983467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987827,0.000055864206,0.00036872647,0.00015073414,0.0004552251,0.00018673131],"domain_scores_gemma":[0.99933004,0.000092512986,0.00014013464,0.00018664393,0.0002051466,0.0000455204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093130034,0.00011241,0.00011515782,0.00024546168,0.0003658956,0.00022959102,0.00031741583,0.000044272263,2.7462806e-7],"category_scores_gemma":[0.00006110795,0.0000858642,0.00003300753,0.0003882965,0.0000377848,0.0012545406,0.00003556164,0.00010909501,0.0000033487238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004276504,0.00012444583,0.00010137608,0.000055456956,0.000008687326,0.0000012386563,0.026800552,0.6494771,0.000070246875,0.08394612,0.00046647715,0.23890549],"study_design_scores_gemma":[0.00056878995,0.00017653544,0.0063195745,0.00001525318,0.000002120283,0.000022374876,0.00019813175,0.97975,0.000042467393,0.012432002,0.000350829,0.00012195214],"about_ca_topic_score_codex":0.000021254547,"about_ca_topic_score_gemma":0.0000062068766,"teacher_disagreement_score":0.72430986,"about_ca_system_score_codex":0.00002746243,"about_ca_system_score_gemma":0.00007159312,"threshold_uncertainty_score":0.35014406},"labels":[],"label_agreement":null},{"id":"W1501182936","doi":"10.1145/2786982","title":"Embedding of Large Boolean Functions for Reversible Logic","year":2015,"lang":"en","type":"article","venue":"ACM Journal on Emerging Technologies in Computing Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Embedding; Boolean function; Binary decision diagram; Heuristic; Overhead (engineering); Function (biology); Binary number; Computer science; Boolean algebra; Theoretical computer science; Mathematics; Algorithm; Mathematical optimization; Arithmetic; Artificial intelligence","score_opus":0.03783683448729422,"score_gpt":0.31518631123309765,"score_spread":0.27734947674580346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501182936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12716077,0.0011090855,0.86378133,0.0033337532,0.0035021005,0.00026352823,0.0000043252994,0.0007230429,0.000122036836],"genre_scores_gemma":[0.853834,0.0000141491855,0.14586097,0.00005546803,0.0001735368,0.000004425418,0.0000011035393,0.000016914839,0.000039487113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767804,0.00011806133,0.00074409647,0.0004198146,0.0004180416,0.0006219175],"domain_scores_gemma":[0.9976076,0.00051476853,0.0006092568,0.00093462365,0.00025916574,0.00007460844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002560459,0.00023568634,0.0004583961,0.000800689,0.0003408198,0.00016052944,0.0024782112,0.00016556513,3.0853678e-7],"category_scores_gemma":[0.001966812,0.00019941997,0.00014625605,0.0009439446,0.000059058173,0.00017611493,0.0010371087,0.0007150727,0.000004271986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020968715,0.00019793356,0.0022370198,0.0001351157,0.000076344186,0.00006400617,0.0013324816,0.8876864,0.00017036649,0.03637155,0.012453482,0.059254378],"study_design_scores_gemma":[0.0009026012,0.0005115013,0.000043644384,0.00077573553,0.0000067835144,0.00027092805,0.0024560657,0.96997476,0.00018146815,0.01562742,0.008991101,0.00025802414],"about_ca_topic_score_codex":0.000010135383,"about_ca_topic_score_gemma":8.757567e-7,"teacher_disagreement_score":0.7266732,"about_ca_system_score_codex":0.00018552692,"about_ca_system_score_gemma":0.000103293096,"threshold_uncertainty_score":0.813211},"labels":[],"label_agreement":null},{"id":"W1505437954","doi":"10.1063/1.1827924","title":"Implementation of group-covariant positive operator valued measures by orthogonal measurements","year":2004,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"POVM; Covariant transformation; Mathematics; Operator (biology); Group (periodic table); Rank (graph theory); Group theory; Symmetry group; Symmetry (geometry); Pure mathematics; Algebra over a field; Quantum; Quantum operation; Quantum mechanics; Mathematical physics; Physics; Combinatorics; Open quantum system; Geometry","score_opus":0.022146818918949377,"score_gpt":0.281116300275729,"score_spread":0.2589694813567796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505437954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1865386,0.000052724616,0.8127836,0.0003573795,0.00010731774,0.00008872388,0.000005775337,0.00001082722,0.00005502227],"genre_scores_gemma":[0.8344189,0.0000021279798,0.16531955,0.000119175595,0.00012736159,0.0000010120419,9.997833e-7,0.000009425641,0.0000014440457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980574,0.00009091146,0.0006006772,0.00014049884,0.0009173876,0.00019309089],"domain_scores_gemma":[0.9988322,0.00007299911,0.00046783953,0.00017934266,0.00033814835,0.00010947084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073671335,0.00014334045,0.0003285874,0.000045430217,0.000074975615,0.00007005016,0.00048612244,0.000034637727,0.000006141751],"category_scores_gemma":[0.00004598028,0.00010509452,0.00016815012,0.00021743611,0.000043838343,0.0002827744,0.00008903932,0.00020223085,0.000004312959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087348664,0.0032939443,0.0003128048,0.0002723536,0.0009843794,0.00007565838,0.009285479,0.0142461145,0.18178277,0.64757556,0.0009328376,0.14115076],"study_design_scores_gemma":[0.004782704,0.001843228,0.0024233265,0.0007021036,0.00015331976,0.00030790534,0.00026615505,0.02656964,0.20381066,0.7585548,0.00004572909,0.00054042065],"about_ca_topic_score_codex":0.0000058304645,"about_ca_topic_score_gemma":5.220047e-7,"teacher_disagreement_score":0.6478803,"about_ca_system_score_codex":0.00006022671,"about_ca_system_score_gemma":0.00014825178,"threshold_uncertainty_score":0.42856303},"labels":[],"label_agreement":null},{"id":"W1514575725","doi":"10.26421/qic10.5-6-12","title":"Exact quantum lower bound for Grover's problem","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Upper and lower bounds; Oracle; Mathematics; Intuition; Simple (philosophy); Quantum algorithm; Set (abstract data type); Combinatorics; Quantum; Discrete mathematics; Computer science; Quantum mechanics; Physics","score_opus":0.009243585197173913,"score_gpt":0.24577145728734529,"score_spread":0.23652787209017137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514575725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076153874,0.0000632129,0.9195265,0.002594397,0.00042957958,0.0004130293,0.0000056387426,0.00031992412,0.00049382553],"genre_scores_gemma":[0.9485247,0.000013608328,0.0494985,0.001783139,0.00009268936,0.000013709501,0.000053350315,0.000006011467,0.0000143091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870265,0.000035475914,0.0004632803,0.0002311491,0.00026571084,0.00030175768],"domain_scores_gemma":[0.9991598,0.000111140864,0.0002495129,0.00019000238,0.0001796262,0.00010990374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034970086,0.00019559926,0.00018496499,0.0002025888,0.00036424896,0.0006524022,0.00026973494,0.00007945304,0.000002031254],"category_scores_gemma":[0.000032077,0.00017665827,0.00007662091,0.00029668357,0.000029526971,0.0017573802,0.000054438555,0.00013162136,0.000023088858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034641147,0.00006565051,0.000013848053,0.000059344802,0.000012555782,0.0000012563752,0.001836649,0.015689012,0.000058391754,0.38380548,0.0026053225,0.59581786],"study_design_scores_gemma":[0.000625729,0.0005382286,0.0017621676,0.000030935178,0.0000047851954,0.000028167893,0.000040262876,0.87870425,0.000039364826,0.10814322,0.009859701,0.00022317254],"about_ca_topic_score_codex":0.000010200751,"about_ca_topic_score_gemma":6.310743e-7,"teacher_disagreement_score":0.87237084,"about_ca_system_score_codex":0.000030571224,"about_ca_system_score_gemma":0.00006586821,"threshold_uncertainty_score":0.7203915},"labels":[],"label_agreement":null},{"id":"W1516672897","doi":"","title":"Theory of quantum computation, communication and cryptography : 4th Workshop, TQC 2009, Waterloo, Canada, May 11-13, 2009 : revised selected papers","year":2009,"lang":"en","type":"book","venue":"Springer eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum cryptography; Quantum computer; Quantum entanglement; Computer science; Quantum; Theoretical computer science; Computation; Cryptography; Mathematics; Topology (electrical circuits); Discrete mathematics; Algorithm; Quantum information; Quantum mechanics; Combinatorics; Physics","score_opus":0.0076096728784898334,"score_gpt":0.20589022082328987,"score_spread":0.19828054794480005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516672897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059259176,0.036151588,0.44766325,0.005632713,0.0030718772,0.00752552,0.0003070308,0.0034555837,0.43693325],"genre_scores_gemma":[0.50542545,0.0009882181,0.21940404,0.004757161,0.0013237036,0.000110050154,0.00057701406,0.00061924005,0.2667951],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99666005,0.00041671103,0.0008409285,0.00084629044,0.00064325065,0.0005927575],"domain_scores_gemma":[0.9968709,0.0005034559,0.0007068165,0.0012913956,0.0003958966,0.00023153458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007320794,0.0006297333,0.00082033215,0.00044210863,0.0003670013,0.00019847263,0.001484363,0.0003236519,0.000009674031],"category_scores_gemma":[0.00004848973,0.0005851124,0.00018134346,0.00030433023,0.00026138205,0.00007245139,0.00045228744,0.0008671948,0.0000021279768],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009705008,0.0001611665,0.0003235902,0.00078241207,0.00070139347,0.0001248316,0.0068937885,0.0034334231,0.00040153493,0.17813708,0.072304636,0.7366391],"study_design_scores_gemma":[0.004817646,0.0009886976,0.030771228,0.009864725,0.00073359883,0.00030787775,0.00025818375,0.23173831,0.0009165853,0.2635786,0.44872403,0.0073005143],"about_ca_topic_score_codex":0.0077825584,"about_ca_topic_score_gemma":0.015802816,"teacher_disagreement_score":0.7293386,"about_ca_system_score_codex":0.000116769814,"about_ca_system_score_gemma":0.0011752605,"threshold_uncertainty_score":0.99966},"labels":[],"label_agreement":null},{"id":"W1518254600","doi":"10.1007/978-3-540-72504-6_28","title":"Quantum Multiparty Communication Complexity and Circuit Lower Bounds","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Omega; Communication complexity; Quantum; Function (biology); Quantum information science; Upper and lower bounds; Mathematics; Discrete mathematics; Computer science; Topology (electrical circuits); Combinatorics; Physics; Quantum mechanics; Mathematical analysis; Quantum entanglement","score_opus":0.04172055486106492,"score_gpt":0.27308264432930723,"score_spread":0.23136208946824233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518254600","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012489854,0.0012386974,0.99185944,0.0007986037,0.0014198871,0.00038357094,0.000007839606,0.00030147276,0.0027415352],"genre_scores_gemma":[0.43016678,0.00012474624,0.56664884,0.002233114,0.00051645143,0.000005906327,0.000014674352,0.0000668731,0.00022259733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547905,0.0000776504,0.000707227,0.0017534161,0.0010616313,0.0009210487],"domain_scores_gemma":[0.995837,0.00083365664,0.00040332926,0.0023371882,0.00028099972,0.00030786943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001845009,0.0006958763,0.0006913882,0.00086597557,0.00076634984,0.000925281,0.0038146963,0.0004173332,0.000015755131],"category_scores_gemma":[0.00009565834,0.0006412822,0.00015079965,0.00065469876,0.0021702566,0.00047507786,0.0026874477,0.00160132,0.000026548687],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000870262,0.00006771631,0.00009452407,0.000054328422,0.000015399179,0.00009989205,0.0014540461,0.0093146255,0.000053590775,0.141179,0.000028531116,0.84762967],"study_design_scores_gemma":[0.000262721,0.00014242704,0.0006288126,0.00030824283,0.0000059762606,0.00014373938,1.814364e-7,0.7022837,0.000075339674,0.29292366,0.002602061,0.0006231709],"about_ca_topic_score_codex":0.00008523378,"about_ca_topic_score_gemma":0.000171006,"teacher_disagreement_score":0.8470065,"about_ca_system_score_codex":0.0002279295,"about_ca_system_score_gemma":0.00033996996,"threshold_uncertainty_score":0.99960387},"labels":[],"label_agreement":null},{"id":"W1519448302","doi":"10.1007/3-540-45655-4_63","title":"Quantum DNF Learnability Revisited","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Learnability; Computer science; Probably approximately correct learning; Computational complexity theory; Quantum; Upper and lower bounds; Theoretical computer science; Algorithm; Quantum complexity theory; Quantum algorithm; Mathematics; Artificial intelligence; Computational learning theory; Physics; Quantum mechanics; Active learning (machine learning)","score_opus":0.015956673637853747,"score_gpt":0.23883361879661905,"score_spread":0.2228769451587653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519448302","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029102093,0.0009768422,0.9906263,0.0016535204,0.001852696,0.00046352422,0.000007884893,0.00051869755,0.0036095371],"genre_scores_gemma":[0.23411477,0.00021622915,0.757444,0.0039654975,0.0023679982,0.000015325379,0.000015256755,0.00016280574,0.0016981135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99366134,0.000098772834,0.00085669395,0.0027405932,0.0014830634,0.0011595578],"domain_scores_gemma":[0.9953753,0.0006684487,0.0004382662,0.002833486,0.00034299275,0.000341525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014007757,0.00088405644,0.0009274097,0.0010282223,0.0005059083,0.00086576364,0.0053092926,0.0004775022,0.00008303921],"category_scores_gemma":[0.00022839972,0.00078039814,0.00031688882,0.001169993,0.00092220627,0.0004750052,0.002382221,0.001972154,0.00017326663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040725417,0.000057126927,0.00006543584,0.00008407659,0.000015895217,0.00021585746,0.00067206804,0.042359546,0.000039654362,0.030089004,0.000104747065,0.92629254],"study_design_scores_gemma":[0.00020514532,0.00019341876,0.00022110408,0.0004274054,0.0000067715782,0.00014146455,4.9192327e-8,0.82532114,0.00012213939,0.16719167,0.0053615114,0.0008081996],"about_ca_topic_score_codex":0.000019414863,"about_ca_topic_score_gemma":0.0000071844634,"teacher_disagreement_score":0.9254843,"about_ca_system_score_codex":0.00034529518,"about_ca_system_score_gemma":0.0003611165,"threshold_uncertainty_score":0.9994647},"labels":[],"label_agreement":null},{"id":"W1520004449","doi":"10.1103/physreva.87.062338","title":"Kitaev's<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\"><mml:msub><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:math>-code threshold estimates","year":2013,"lang":"lv","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Decoding methods; Code (set theory); Algorithm; Renormalization group; Combinatorics; Physics; Mathematics; Mathematical physics; Computer science","score_opus":0.020146341341957533,"score_gpt":0.26361110669011717,"score_spread":0.24346476534815964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520004449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9602242,0.009760235,0.008345945,0.0037438206,0.0024156617,0.00020507927,0.00014900052,0.00048798518,0.0146680605],"genre_scores_gemma":[0.9770992,0.0031623773,0.013375474,0.002694613,0.002401891,0.00061289023,0.00020572232,0.00035524767,0.00009262738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926273,0.00024659734,0.0014662299,0.0018610966,0.0018202538,0.0019785056],"domain_scores_gemma":[0.9938961,0.0011202195,0.001307259,0.0025589282,0.00017983111,0.00093761936],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011594218,0.00094856287,0.0006829212,0.0001788285,0.0012052677,0.0016146636,0.002910151,0.00063912076,0.0023116546],"category_scores_gemma":[0.0006470159,0.0012122687,0.0015732532,0.0011289506,0.0008254741,0.0010915832,0.0025452543,0.0016852171,0.004841934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093697396,0.00043109345,0.000007927683,0.0029291187,0.0004352533,0.0004374364,0.0010529133,0.0020183208,0.0007237534,0.96087825,0.014846662,0.01614554],"study_design_scores_gemma":[0.00089621433,0.0008519906,0.00011334996,0.0055475025,0.000722001,0.00063303014,0.000078223944,0.94266343,0.034526903,0.008100308,0.00456582,0.0013012127],"about_ca_topic_score_codex":0.000687759,"about_ca_topic_score_gemma":0.00008432039,"teacher_disagreement_score":0.952778,"about_ca_system_score_codex":0.000019541521,"about_ca_system_score_gemma":0.0007127674,"threshold_uncertainty_score":0.9994218},"labels":[],"label_agreement":null},{"id":"W1522393113","doi":"10.5555/2685155.2685156","title":"The computational power of matchgates and the XY interaction on arbitrary graphs","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Universal set; Quantum computer; Mathematics; Quantum; Computation; Path (computing); Discrete mathematics; Graph; Set (abstract data type); Combinatorics; Topology (electrical circuits); Computer science; Quantum mechanics; Algorithm; Physics","score_opus":0.004914132702145928,"score_gpt":0.22189516212647112,"score_spread":0.21698102942432518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522393113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33464995,0.000063638916,0.66016954,0.0037951567,0.0003679314,0.00018891823,0.000001603807,0.00007145897,0.0006917959],"genre_scores_gemma":[0.99514276,0.000022553173,0.0039501,0.00084564625,0.000017784962,0.0000060291045,0.0000095986,0.000003090406,0.00000246333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989999,0.00014809893,0.00036884687,0.00011318753,0.00025372772,0.00011622934],"domain_scores_gemma":[0.9984407,0.0009874516,0.00028399887,0.00013762944,0.00011301077,0.00003722276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006618447,0.00011176979,0.00012221509,0.00010697342,0.0004385825,0.00031902234,0.0001922839,0.00003300902,7.363314e-7],"category_scores_gemma":[0.000062612744,0.00006348261,0.000042174743,0.00019376821,0.00017214198,0.00051875354,0.00008167089,0.00015263032,0.0000069026187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004545431,0.00001013219,0.000025271778,0.000014466909,0.0000122687115,6.5981105e-8,0.0026548917,0.052459292,0.0000014333442,0.80065644,0.00014678683,0.14397347],"study_design_scores_gemma":[0.0005592205,0.00010830074,0.0033565972,0.00002297479,0.0000028140416,0.00001734622,0.00018237894,0.79422015,0.000015777727,0.2005832,0.0008666275,0.00006461955],"about_ca_topic_score_codex":0.00001780799,"about_ca_topic_score_gemma":8.0773094e-7,"teacher_disagreement_score":0.74176085,"about_ca_system_score_codex":0.0000066256916,"about_ca_system_score_gemma":0.00001777979,"threshold_uncertainty_score":0.33732662},"labels":[],"label_agreement":null},{"id":"W1532834996","doi":"10.1103/physrevlett.106.180504","title":"Scalable and Robust Randomized Benchmarking of Quantum Processes","year":2011,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":752,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Benchmarking; Computer science; Fidelity; Observable; Protocol (science); Scalability; Simple (philosophy); Set (abstract data type); Quantum; Quantum gate; Algorithm; Function (biology); Statistical physics; Theoretical computer science; Quantum computer; Physics; Quantum mechanics","score_opus":0.02061735995245464,"score_gpt":0.244881616726865,"score_spread":0.22426425677441036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532834996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2754875,0.030661214,0.688187,0.0040389495,0.00022656516,0.0007875182,0.0000017135418,0.00015827508,0.0004512391],"genre_scores_gemma":[0.9337228,0.007980456,0.052244045,0.0058182185,0.00017530347,0.000038510443,0.0000013944858,0.000016224922,0.0000030778194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989012,0.0001368596,0.0002603598,0.0003015777,0.00019436645,0.00020566443],"domain_scores_gemma":[0.9990992,0.00033185203,0.00017152907,0.00027756797,0.000051711573,0.000068163994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004169589,0.00014644729,0.0006078627,0.000036411195,0.000056386187,0.000024830955,0.00040419548,0.0000068436793,0.0000048161146],"category_scores_gemma":[0.0001399603,0.00010120919,0.00012308062,0.0003468663,0.00014912924,0.00014680883,0.00018033518,0.000121233184,0.0000041716808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022775952,0.0026884584,0.0012771187,0.0725102,0.0010573439,0.00019214611,0.025110276,0.00764884,0.012534521,0.32111734,0.014731548,0.5388546],"study_design_scores_gemma":[0.006960849,0.00010112487,0.00032273607,0.004634693,0.0001011576,0.00002445353,0.0000032757132,0.97813255,0.0010288527,0.0076876534,0.0005842722,0.00041836203],"about_ca_topic_score_codex":0.000023487273,"about_ca_topic_score_gemma":1.9357121e-7,"teacher_disagreement_score":0.9704837,"about_ca_system_score_codex":0.0000043610426,"about_ca_system_score_gemma":0.000023209554,"threshold_uncertainty_score":0.4127191},"labels":[],"label_agreement":null},{"id":"W1533211775","doi":"10.1007/978-3-642-38986-3_10","title":"An Introduction to Quantum Programming in Quipper","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Quantum computer; Quantum; Theoretical computer science; Programming language; Computation; Quantum information; Quantum algorithm; Quantum mechanics; Physics","score_opus":0.010064551957939108,"score_gpt":0.24337859365673484,"score_spread":0.23331404169879572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533211775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032213996,0.00013355035,0.9868995,0.0056697885,0.0028566576,0.00075204484,0.0000014889315,0.000302823,0.00016277909],"genre_scores_gemma":[0.1667983,0.00000739619,0.8285983,0.0015368509,0.002806732,0.000031652184,0.000006835679,0.00006376779,0.00015013624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461746,0.00007276884,0.00067655504,0.0025414506,0.0009932346,0.0010985208],"domain_scores_gemma":[0.9970344,0.00018162864,0.00022089473,0.001973922,0.00023177847,0.0003574176],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012202577,0.000661606,0.00062440947,0.0017041117,0.00025335368,0.0011017394,0.003816559,0.00032855285,0.000025476587],"category_scores_gemma":[0.00009296803,0.0005951143,0.00011051512,0.00133054,0.0003472053,0.00080721197,0.0012072066,0.0012601139,0.000106892134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003240529,0.000047340753,0.000031071573,0.00001923178,0.0000033155625,0.00004305447,0.0012051134,0.16763704,0.0001990945,0.014074876,0.000037812104,0.8166988],"study_design_scores_gemma":[0.00017968773,0.00048172416,0.00029996314,0.00023092152,0.0000026711218,0.000090047004,4.434849e-7,0.93690634,0.00030895328,0.053868443,0.0068238303,0.0008069818],"about_ca_topic_score_codex":0.00010840145,"about_ca_topic_score_gemma":0.00013823874,"teacher_disagreement_score":0.81589186,"about_ca_system_score_codex":0.00032775092,"about_ca_system_score_gemma":0.00036475065,"threshold_uncertainty_score":0.9999352},"labels":[],"label_agreement":null},{"id":"W1533466547","doi":"10.48550/arxiv.0707.1527","title":"Programming Telepathy: Implementing Quantum Non-Locality Games","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Quantum entanglement; Quantum information science; Quantum; Phenomenon; Theoretical computer science; Quantum capacity; Locality; Quantum pseudo-telepathy; Quantum information; Observer (physics); Mathematics; Theoretical physics; Quantum network; Quantum mechanics; Physics; Philosophy","score_opus":0.030537406425613294,"score_gpt":0.2956253244787455,"score_spread":0.2650879180531322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533466547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5944563,0.00027356035,0.40229356,0.0004489398,0.0013037901,0.0004056972,0.000005645929,0.0005705635,0.00024193872],"genre_scores_gemma":[0.91078496,0.000022387076,0.08759877,0.00039343533,0.0009872583,0.000041816565,0.000031588923,0.00005472318,0.00008508209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950863,0.0001495904,0.00092922576,0.0016706269,0.0006847864,0.0014794593],"domain_scores_gemma":[0.9968012,0.00021228526,0.0006245909,0.0018633475,0.00021593539,0.0002826532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002079212,0.00066440844,0.0006770164,0.00029945036,0.0005027835,0.0005431183,0.0025889613,0.000374525,0.000011290831],"category_scores_gemma":[0.00012101356,0.0006215721,0.00040552916,0.0005728007,0.00012112862,0.00018096835,0.005843681,0.0017517647,0.00007775338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010406455,0.0002934407,0.25019282,0.00052269327,0.00020639974,0.00033962657,0.0033402334,0.0030872652,0.00032160172,0.0019897528,0.0005081614,0.7391876],"study_design_scores_gemma":[0.0005885677,0.00018634925,0.16838054,0.00064523023,0.000056455967,0.00006775524,0.00015895267,0.7869422,0.0021919094,0.004407599,0.03463894,0.0017355273],"about_ca_topic_score_codex":0.00043951123,"about_ca_topic_score_gemma":0.000032490094,"teacher_disagreement_score":0.7838549,"about_ca_system_score_codex":0.00011026993,"about_ca_system_score_gemma":0.000299656,"threshold_uncertainty_score":0.99962354},"labels":[],"label_agreement":null},{"id":"W1534322248","doi":"10.1140/epjqt/s40507-015-0025-1","title":"Quantum lattice Boltzmann is a quantum walk","year":2015,"lang":"en","type":"article","venue":"EPJ Quantum Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Quantum walk; Quantum algorithm; Dirac equation; Quantum dynamics; Lattice Boltzmann methods; Quantum process; Quantum operation; Quantum discord; Quantum dissipation","score_opus":0.01979958835453908,"score_gpt":0.25834611627780835,"score_spread":0.23854652792326927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534322248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55206233,0.0035767495,0.38808337,0.046298165,0.0036339206,0.00055576593,0.00002260848,0.004845426,0.0009216619],"genre_scores_gemma":[0.9497016,0.00008249563,0.04753793,0.0019343352,0.00035190125,0.000034293575,0.000008957074,0.00007233232,0.0002761636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952541,0.00017965822,0.00080181815,0.0014972457,0.00079293683,0.0014742645],"domain_scores_gemma":[0.99613583,0.00022077915,0.0003749949,0.0024374132,0.00037238045,0.0004585883],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00090969336,0.0006565471,0.00078095397,0.0010444776,0.00039190854,0.00025960544,0.003659782,0.00064315257,0.000033995584],"category_scores_gemma":[0.00035666884,0.0005984834,0.00023117726,0.0025250593,0.00042932175,0.00044042055,0.00095473137,0.0012366284,0.001118705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030308334,0.0002964086,0.0010186392,0.00004008287,0.00010706965,0.00048494292,0.0018884167,0.00033203853,0.00061978196,0.9227098,0.01646617,0.05600631],"study_design_scores_gemma":[0.0007647689,0.0006102545,0.00028015187,0.000058896385,0.000017716253,0.00049606356,0.00018747794,0.5969438,0.0016452038,0.33646062,0.06188703,0.0006480384],"about_ca_topic_score_codex":0.00015667784,"about_ca_topic_score_gemma":0.000016701975,"teacher_disagreement_score":0.59661174,"about_ca_system_score_codex":0.00009347562,"about_ca_system_score_gemma":0.00033371814,"threshold_uncertainty_score":0.99965906},"labels":[],"label_agreement":null},{"id":"W1539399626","doi":"10.1103/physreva.85.062316","title":"Entanglement monotones for<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\"><mml:mi>W</mml:mi></mml:math>-type states","year":2012,"lang":"lv","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"LOCC; Quantum entanglement; Class (philosophy); Physics; Separable space; Transformation (genetics); State (computer science); Qubit; Quantum teleportation; Discrete mathematics; Quantum; Separable state; Multipartite entanglement; Quantum mechanics; Combinatorics; Squashed entanglement; Quantum discord; Computer science; Quantum channel; Mathematics; Algorithm; Mathematical analysis","score_opus":0.021580766213351206,"score_gpt":0.28204213636679026,"score_spread":0.26046137015343906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539399626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96803063,0.019003946,0.009630556,0.0014478152,0.0013393025,0.00021656723,0.000063391075,0.00013417876,0.00013360339],"genre_scores_gemma":[0.9774073,0.007450574,0.010067663,0.0021683662,0.002390121,0.0002529265,0.00011341317,0.00010633915,0.000043315307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673146,0.00013669564,0.00065639545,0.0007230611,0.0007268001,0.0010255998],"domain_scores_gemma":[0.99739337,0.0006097548,0.0005313962,0.0009768353,0.00009798029,0.0003906703],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00075143337,0.00046201027,0.00045797002,0.00004786952,0.00045800765,0.00029192396,0.0009579226,0.0001324146,0.000011616544],"category_scores_gemma":[0.0002520507,0.00044283603,0.0006888938,0.00043009594,0.00018705266,0.00038306206,0.00092904863,0.00048592262,0.00090795086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002875579,0.00043131624,0.000008923733,0.002024457,0.00014799758,0.00002389421,0.0011552554,0.00037241404,0.0001761961,0.9602361,0.0005729381,0.0348218],"study_design_scores_gemma":[0.00026733472,0.0005949007,0.000067804045,0.0024451667,0.00027276453,0.00005302368,0.00004275038,0.95372325,0.0011283585,0.0023416225,0.038628902,0.0004341036],"about_ca_topic_score_codex":0.00007097995,"about_ca_topic_score_gemma":0.0000055177975,"teacher_disagreement_score":0.95789444,"about_ca_system_score_codex":0.000018938292,"about_ca_system_score_gemma":0.00018095672,"threshold_uncertainty_score":0.99986994},"labels":[],"label_agreement":null},{"id":"W1540106918","doi":"10.26421/qic12.11-12-10","title":"Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Binary Golay code; Qubit; Fault tolerance; Computer science; Quantum computer; Algorithm; Overhead (engineering); Noise (video); Error detection and correction; Hamming bound; Code (set theory); Mathematics; Quantum; Set (abstract data type); Block code; Hamming code; Decoding methods; Physics; Quantum mechanics","score_opus":0.01386412253971376,"score_gpt":0.26585872440441627,"score_spread":0.2519946018647025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540106918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25160047,0.00041787743,0.74570185,0.0009992154,0.00059496996,0.00042223802,0.000008542662,0.0001226829,0.00013214104],"genre_scores_gemma":[0.9893727,0.000037665544,0.009463848,0.00087627064,0.00014645013,0.000039231516,0.00003812445,0.0000066014495,0.000019141853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889725,0.000034347097,0.00037392977,0.00016015691,0.0002498184,0.0002845177],"domain_scores_gemma":[0.99912566,0.00021915212,0.00021028308,0.00019396924,0.00014565123,0.00010526777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059335824,0.00016728077,0.00014192562,0.00009870311,0.0005662915,0.00055392453,0.00018630642,0.00006903508,0.0000012760049],"category_scores_gemma":[0.000034862027,0.00012026013,0.000047558795,0.00019365722,0.00005873707,0.0017568147,0.000101765836,0.0001185642,0.000013675428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020903794,0.00015808971,0.0011200488,0.00026360486,0.000086911,7.5819463e-7,0.03534445,0.15594836,0.00019107811,0.23848209,0.0063884333,0.56180716],"study_design_scores_gemma":[0.0005209384,0.00014791562,0.0054266257,0.000020056355,0.000011304878,0.00003516417,0.00012151435,0.9722487,0.00005085275,0.0025460718,0.01869671,0.00017419786],"about_ca_topic_score_codex":0.000009521966,"about_ca_topic_score_gemma":0.0000030824242,"teacher_disagreement_score":0.8163003,"about_ca_system_score_codex":0.000023375662,"about_ca_system_score_gemma":0.00003927585,"threshold_uncertainty_score":0.5341507},"labels":[],"label_agreement":null},{"id":"W1540757460","doi":"","title":"Hidden symmetry detection on a quantum computer","year":2003,"lang":"en","type":"article","venue":"CERN Document Server (European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Canadian Institute for Advanced Research","funders":"","keywords":"Homogeneous space; Quantum algorithm; Quantum; Symmetry (geometry); Simple (philosophy); Class (philosophy); Quantum computer; Discrete symmetry; Discrete mathematics; Similarity (geometry); Mathematics; Point (geometry); Algorithm; Combinatorics; Computer science; Pure mathematics; Theoretical computer science; Quantum mechanics; Physics; Artificial intelligence; Geometry","score_opus":0.017649014100054837,"score_gpt":0.24677521682978362,"score_spread":0.22912620272972878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540757460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9585575,0.000042320327,0.03413514,0.0020079426,0.0012226874,0.00080820784,0.0000013266076,0.0013776392,0.0018472723],"genre_scores_gemma":[0.99781317,0.000011137479,0.0009616966,0.00045061889,0.00020389269,5.711013e-7,0.000014462244,0.00018283373,0.00036162205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971969,0.0007096828,0.0002841939,0.00067863986,0.00061412976,0.0005164216],"domain_scores_gemma":[0.9985184,0.000096465745,0.000106149855,0.0007514331,0.00032457995,0.00020297649],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011797685,0.00021184645,0.00016427171,0.00032393972,0.0011661627,0.0010877162,0.001268942,0.000063688705,0.00022647397],"category_scores_gemma":[0.00020593464,0.00020016225,0.00008503201,0.0010623969,0.00006890255,0.00037159913,0.0006507755,0.00037831406,0.0016263772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018317602,0.00019836662,0.000028105283,0.00005512916,0.0000492651,0.000030227646,0.0008539114,0.000906975,0.00015017003,0.9599724,0.0019135415,0.035823636],"study_design_scores_gemma":[0.009070864,0.008836488,0.017759126,0.00067226647,0.00007328515,0.00085429556,0.00052511966,0.08122783,0.037492067,0.42603296,0.41342977,0.004025921],"about_ca_topic_score_codex":0.000008571387,"about_ca_topic_score_gemma":4.7075056e-7,"teacher_disagreement_score":0.53393936,"about_ca_system_score_codex":0.00016929746,"about_ca_system_score_gemma":0.00001840525,"threshold_uncertainty_score":0.9999493},"labels":[],"label_agreement":null},{"id":"W1543584257","doi":"10.26421/qic8.1-2-6","title":"On the role of shared entanglement","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Binary logarithm; Communication complexity; Randomness; Logarithm; Upper and lower bounds; Context (archaeology); Mathematics; Log-log plot; Bounded function; Combinatorics; Discrete mathematics; Quantum; Physics; Quantum mechanics; Statistics","score_opus":0.010152187340386913,"score_gpt":0.21738577799073508,"score_spread":0.20723359065034816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543584257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56369996,0.000045305023,0.43395832,0.0008194749,0.00010901164,0.00014704329,0.0000034316627,0.000076059645,0.00114137],"genre_scores_gemma":[0.9946638,0.000009658798,0.004820646,0.0004745326,0.000012114538,0.0000047266776,0.000009996293,0.0000017539708,0.0000028075574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999324,0.000035960667,0.0002409074,0.00007652087,0.00022808663,0.00009450068],"domain_scores_gemma":[0.999502,0.0001199036,0.00015107718,0.00012686777,0.00006987801,0.000030296933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014799679,0.00007429435,0.0000747134,0.00008811139,0.00020527547,0.000057398047,0.00018455746,0.000020850883,0.0000057636366],"category_scores_gemma":[0.000021509477,0.000050601637,0.000028652597,0.0001832856,0.000034287306,0.00036896975,0.00006724941,0.00007142014,0.000020212605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001062976,0.00004011526,0.00017395963,0.000013654215,0.000012477717,7.78557e-7,0.008797662,0.017803403,0.00006513453,0.7406858,0.0007658727,0.23163047],"study_design_scores_gemma":[0.00016590582,0.00011586222,0.0035228457,0.000014158364,0.000001053236,0.000018567254,0.00014091899,0.96791834,0.0003215108,0.026152616,0.0015645559,0.000063662315],"about_ca_topic_score_codex":0.000012396723,"about_ca_topic_score_gemma":2.1854606e-7,"teacher_disagreement_score":0.95011497,"about_ca_system_score_codex":0.000009349606,"about_ca_system_score_gemma":0.00002533524,"threshold_uncertainty_score":0.20634748},"labels":[],"label_agreement":null},{"id":"W1544479598","doi":"10.26421/qic14.11-12-4","title":"Decomposition and gluing for adiabatic quantum optimization","year":2014,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Adiabatic process; Overhead (engineering); Factorization; Decomposition; Computer science; Quantum; Exploit; Quantum computer; Integer (computer science); Mathematical optimization; Algorithm; Theoretical computer science; Mathematics; Quantum mechanics; Physics","score_opus":0.009687598522840056,"score_gpt":0.2610205254780608,"score_spread":0.25133292695522075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544479598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05976251,0.00018630284,0.9370021,0.0010125807,0.00092476915,0.0007090789,0.000018187973,0.0003318726,0.000052578824],"genre_scores_gemma":[0.75205797,0.000081961014,0.24651824,0.0005865157,0.00013916752,0.00006932063,0.0005276685,0.000016633649,0.000002518699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982082,0.00010861729,0.0007069139,0.000416783,0.00027725595,0.00028220454],"domain_scores_gemma":[0.9983751,0.00031103412,0.00063029147,0.0002649701,0.00028108124,0.0001375188],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00057434075,0.00033731657,0.00036186533,0.00041000673,0.00041493392,0.0011321771,0.00029118257,0.00024041724,0.0000011033916],"category_scores_gemma":[0.000088104905,0.0003411667,0.00008449462,0.0001696997,0.000052293537,0.0009425182,0.0004313507,0.00030498698,0.000004760115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012072115,0.000014932275,0.000013030077,0.00049185986,0.000021332582,2.6087304e-7,0.0015474106,0.82352895,0.0000051025777,0.033270966,0.00019097184,0.14090313],"study_design_scores_gemma":[0.0006036818,0.00017547279,0.00043100453,0.00024923868,0.000025530617,0.000027966638,0.000048443133,0.9594432,0.000015577345,0.038160495,0.00043190672,0.0003874792],"about_ca_topic_score_codex":0.000021591855,"about_ca_topic_score_gemma":9.178606e-7,"teacher_disagreement_score":0.69229543,"about_ca_system_score_codex":0.00004693518,"about_ca_system_score_gemma":0.00008683297,"threshold_uncertainty_score":0.99990475},"labels":[],"label_agreement":null},{"id":"W1558301011","doi":"10.26421/qic8.8-9-10","title":"Distinguishing quantum operations having few Kraus operators","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dimension (graph theory); Unitary state; Quantum entanglement; Quantum; Quantum information; Quantum system; Computer science; Mathematics; Space (punctuation); Quantum state; Theoretical computer science; Pure mathematics; Quantum mechanics; Physics","score_opus":0.015056086278999112,"score_gpt":0.24566876863793188,"score_spread":0.23061268235893279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558301011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39357382,0.00006337868,0.6046488,0.0005587168,0.0003991674,0.00013799292,0.0000030433298,0.0003036875,0.00031137883],"genre_scores_gemma":[0.95750505,0.0000309736,0.04160548,0.0006964905,0.00007651795,0.00001127299,0.000051563744,0.000008584457,0.0000140589855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984628,0.00008163817,0.0005537363,0.0002560068,0.00035212983,0.00029370855],"domain_scores_gemma":[0.99915177,0.000099364835,0.00014701429,0.00022847584,0.00022723567,0.00014615785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031583442,0.00021263555,0.00020007388,0.00025133477,0.0011744144,0.0006556524,0.0003346108,0.00007486839,0.000004131486],"category_scores_gemma":[0.00012499005,0.00019782597,0.00005613498,0.00049965386,0.000070991,0.002311041,0.00019012553,0.00023732828,0.000055778673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012677256,0.00010403867,0.0014026951,0.00010349135,0.000040853436,0.000029535202,0.027404664,0.42792702,0.00013900863,0.31494543,0.0015670616,0.22632353],"study_design_scores_gemma":[0.00036785635,0.00008709658,0.006856973,0.000039762454,0.0000040029518,0.00021013891,0.00018641508,0.9886009,0.000049400896,0.0015568968,0.0017728755,0.000267648],"about_ca_topic_score_codex":0.00012594386,"about_ca_topic_score_gemma":0.000005081149,"teacher_disagreement_score":0.5639312,"about_ca_system_score_codex":0.000039640425,"about_ca_system_score_gemma":0.00011906617,"threshold_uncertainty_score":0.9032765},"labels":[],"label_agreement":null},{"id":"W1563058589","doi":"10.1007/978-3-642-14165-2_46","title":"Finding Is as Easy as Detecting for Quantum Walks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Random walk; Mathematics; Quadratic growth; Graph; Quantum; Discrete mathematics; Combinatorics; Statistical physics; Quantum algorithm; Quantum mechanics; Algorithm; Physics; Statistics","score_opus":0.017008136227171566,"score_gpt":0.2652777477026309,"score_spread":0.24826961147545934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563058589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023177436,0.00028620454,0.98802716,0.0015499117,0.0049998653,0.0007366516,0.000009813767,0.00040027013,0.0016724122],"genre_scores_gemma":[0.17191684,0.000020380754,0.8200459,0.0048510903,0.0021202664,0.00002869296,0.0000060861207,0.00012967718,0.00088105764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939206,0.00003839211,0.0007695616,0.002644521,0.0012378903,0.0013890375],"domain_scores_gemma":[0.99536157,0.00145121,0.0005524205,0.0019161204,0.0003637052,0.00035497866],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015224766,0.00091951294,0.0008188107,0.0011237634,0.0011204617,0.0012412813,0.0050874413,0.00073706417,0.000037068105],"category_scores_gemma":[0.00044345175,0.0008414191,0.00038890258,0.00073750044,0.000631015,0.00045265988,0.0020408405,0.0023391617,0.000108416265],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011653693,0.000029300278,0.000015538722,0.00008196368,0.00002396843,0.00010610552,0.002071084,0.0107589355,0.0014641257,0.023742901,0.000017816965,0.9616766],"study_design_scores_gemma":[0.00028835554,0.00034526005,0.00001782503,0.00040321963,0.00000967914,0.00029591448,2.7568814e-7,0.6597269,0.007378769,0.3248192,0.0058713406,0.00084326783],"about_ca_topic_score_codex":0.00006161349,"about_ca_topic_score_gemma":0.000038321738,"teacher_disagreement_score":0.9608333,"about_ca_system_score_codex":0.0002004435,"about_ca_system_score_gemma":0.00090646266,"threshold_uncertainty_score":0.9999625},"labels":[],"label_agreement":null},{"id":"W1565897310","doi":"10.5555/2230936.2230942","title":"Deciding unitary equivalence between matrix polynomials and sets of bipartite quantum states","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Mathematics; Unitary matrix; Unitary state; Equivalence (formal languages); Circular ensemble; Combinatorics; Matrix (chemical analysis); Discrete mathematics; Pure mathematics","score_opus":0.028246135048057633,"score_gpt":0.2734307705553494,"score_spread":0.2451846355072918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565897310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58296996,0.00013080784,0.4164341,0.000110029345,0.00009907338,0.00010229801,0.00000968621,0.00008558226,0.000058447884],"genre_scores_gemma":[0.9711816,0.00007410429,0.02858289,0.00010018324,0.000021528165,0.0000030481003,0.00002925715,0.00000557582,0.0000018157654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986878,0.00008378852,0.00058686367,0.00018225233,0.00023203429,0.00022724054],"domain_scores_gemma":[0.99903435,0.00019521528,0.000359897,0.00016473368,0.00013066127,0.00011513303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004800648,0.0001661009,0.00023232622,0.00029892364,0.00019018137,0.00013378396,0.00023622015,0.000064331754,0.000003099657],"category_scores_gemma":[0.0000357633,0.00015183042,0.000034860826,0.00033194892,0.00008728076,0.0013929689,0.00020521478,0.00011937607,0.000009441424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065801396,0.00007913985,0.017156508,0.00057546934,0.00009783138,0.000006164915,0.04524933,0.00977319,0.00030917657,0.15859655,0.00033021864,0.76776063],"study_design_scores_gemma":[0.00034896945,0.00021712002,0.040381324,0.0000766345,0.000011114602,0.000022092569,0.00029642027,0.9327211,0.0005537426,0.025034659,0.00014256977,0.00019430443],"about_ca_topic_score_codex":0.00012641086,"about_ca_topic_score_gemma":0.0000011376077,"teacher_disagreement_score":0.9229479,"about_ca_system_score_codex":0.000011992455,"about_ca_system_score_gemma":0.000043748438,"threshold_uncertainty_score":0.61914647},"labels":[],"label_agreement":null},{"id":"W1569763258","doi":"10.1007/3-540-45841-7_24","title":"Improved Quantum Communication Complexity Bounds for Disjointness and Equality","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Upper and lower bounds; Bounded function; Communication complexity; Protocol (science); Omega; Discrete mathematics; Class (philosophy); Combinatorics; Qubit; Binary logarithm; Quantum; Mathematics; Computer science; Physics; Quantum mechanics","score_opus":0.039517654476778234,"score_gpt":0.27676003651978087,"score_spread":0.23724238204300263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569763258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053359085,0.00088102923,0.99397314,0.0021992559,0.0009511633,0.00071915303,0.00002649176,0.00024973348,0.00046647244],"genre_scores_gemma":[0.26465282,0.000097473945,0.7333816,0.0011237488,0.00041279616,0.000027323042,0.00002324962,0.00005728659,0.00022367532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960761,0.0000894303,0.0007081818,0.001715408,0.00061780086,0.0007930631],"domain_scores_gemma":[0.9958709,0.0010096926,0.0004647601,0.0021150094,0.00030878503,0.00023083815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015711113,0.0006438506,0.000753302,0.00048874965,0.0008514544,0.0009989969,0.0033943595,0.0003349969,0.000007686959],"category_scores_gemma":[0.00012794278,0.00058484473,0.0001776541,0.0004211697,0.0016581919,0.00043783456,0.0022840383,0.00095424167,0.000004356097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011691379,0.000068057314,0.000023407089,0.00016168995,0.000021532047,0.000007362965,0.0015566251,0.0053258943,0.000088856745,0.19612439,0.000030474503,0.79658],"study_design_scores_gemma":[0.0003001236,0.00015817913,0.000115174764,0.00020186376,0.0000067956203,0.00004110202,1.6562831e-7,0.67881435,0.000092933835,0.31850344,0.0012715693,0.0004943215],"about_ca_topic_score_codex":0.000080562975,"about_ca_topic_score_gemma":0.00009692032,"teacher_disagreement_score":0.7960857,"about_ca_system_score_codex":0.00019068446,"about_ca_system_score_gemma":0.00022017487,"threshold_uncertainty_score":0.9996603},"labels":[],"label_agreement":null},{"id":"W1573484378","doi":"10.1007/3-540-44828-4_16","title":"Unitary Error Bases: Constructions, Equivalence, and Applications","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unitary state; Mutually unbiased bases; Equivalence (formal languages); Mathematics; Algebra over a field; Counterexample; Hadamard transform; Algebraic number; Dimension (graph theory); Pure mathematics; Discrete mathematics","score_opus":0.013437660593218029,"score_gpt":0.2417368057881924,"score_spread":0.22829914519497438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573484378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000095511896,0.0012855177,0.9929367,0.0010908796,0.0009943177,0.00050138857,0.00001421492,0.00021972103,0.0028617913],"genre_scores_gemma":[0.01907181,0.00018420295,0.9755209,0.0039579934,0.00073320826,0.000036565354,0.000009871794,0.000056695797,0.0004287213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996462,0.000051835796,0.0004965765,0.0016689121,0.00067515887,0.0006455384],"domain_scores_gemma":[0.99743426,0.00049120607,0.00024613354,0.0013694742,0.00019960095,0.0002593405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006185952,0.00054734846,0.0004809837,0.00087758095,0.00059953105,0.00046618617,0.0020894797,0.0002650946,0.000016387414],"category_scores_gemma":[0.00004698296,0.0005074735,0.0001030106,0.00082887104,0.0013664291,0.0003562308,0.0011241958,0.00096689316,0.000019738682],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014149313,0.000023325234,0.000042476633,0.000052281226,0.000012063921,0.000042978143,0.00019964801,0.026616992,0.000022455,0.07894456,0.000042747382,0.89399904],"study_design_scores_gemma":[0.0002633985,0.00013710214,0.00006376112,0.0003282712,0.000014103622,0.0007091638,5.5779526e-7,0.6538493,0.00011053674,0.32212138,0.021537205,0.0008651958],"about_ca_topic_score_codex":0.000013248818,"about_ca_topic_score_gemma":0.000014587254,"teacher_disagreement_score":0.8931339,"about_ca_system_score_codex":0.00012119568,"about_ca_system_score_gemma":0.00044504856,"threshold_uncertainty_score":0.9997377},"labels":[],"label_agreement":null},{"id":"W1576758715","doi":"10.1086/521969","title":"Quantum Hypercomputation—Hype or Computation?","year":2007,"lang":"en","type":"article","venue":"Philosophy of Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Recursion (computer science); Computability; Computability theory; Quantum computer; Speculation; Computer science; Quantum; Computation; Quantum algorithm; Function (biology); Theoretical computer science; Mathematics; Algorithm; Quantum mechanics; Physics","score_opus":0.027879744551242827,"score_gpt":0.29085649816273385,"score_spread":0.26297675361149103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576758715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22369611,0.00007120796,0.7711432,0.0012952152,0.0007193669,0.00012702408,0.0000014812478,0.00018413027,0.0027622674],"genre_scores_gemma":[0.8055822,0.0000022017634,0.19400293,0.00025720737,0.00013715086,8.3636724e-7,5.44783e-7,0.000006003586,0.0000108827235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976181,0.000026130288,0.00042815195,0.00056727114,0.00089488004,0.00046546452],"domain_scores_gemma":[0.9985165,0.000317273,0.00020915837,0.0004078802,0.00034935228,0.00019985759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014870127,0.00016495306,0.00021209707,0.0004965874,0.00045280266,0.000114444534,0.0016631952,0.000037783193,0.0000044210274],"category_scores_gemma":[0.00013712705,0.00012827369,0.00006761435,0.0026292258,0.0010755113,0.0006035143,0.0003714793,0.00016006643,0.000025103056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049642964,0.00040968225,0.0007130141,0.00008917402,0.000020547135,0.00009813957,0.0040596174,0.039537266,0.013175346,0.6395485,0.00014600973,0.3021531],"study_design_scores_gemma":[0.0003273449,0.00029439008,0.010304832,0.000056938625,0.000003481185,0.00010484311,0.000040954226,0.81348807,0.00464662,0.1702613,0.00020202617,0.00026919896],"about_ca_topic_score_codex":0.000016420352,"about_ca_topic_score_gemma":0.0000012667297,"teacher_disagreement_score":0.7739508,"about_ca_system_score_codex":0.00003840407,"about_ca_system_score_gemma":0.00026148598,"threshold_uncertainty_score":0.52308494},"labels":[],"label_agreement":null},{"id":"W1576866980","doi":"10.5555/2231036.2231040","title":"Black-box hamiltonian simulation and unitary implementation","year":2012,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unitary matrix; Unitary state; Black box; Hamiltonian (control theory); Bounded function; Scaling; Matrix (chemical analysis); Mathematics; Quantum; Speedup; Hamiltonian matrix; Computer science; Discrete mathematics; Algorithm; Quantum mechanics; Physics; Eigenvalues and eigenvectors; Symmetric matrix; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.016003642517707514,"score_gpt":0.2939876597075383,"score_spread":0.2779840171898308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576866980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48233932,0.000048615086,0.5164052,0.00047758187,0.00012339112,0.000060820814,5.3865233e-7,0.00010654333,0.00043798983],"genre_scores_gemma":[0.9387771,0.0000018234273,0.060699333,0.00035561062,0.00010916301,8.554819e-7,0.000002744886,0.0000037834616,0.0000495799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994312,0.00003396534,0.00009925187,0.00012981136,0.00010528408,0.00020051358],"domain_scores_gemma":[0.9996483,0.000064760934,0.000029062405,0.00015616666,0.000020282023,0.000081455124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016848922,0.00007068102,0.00005442967,0.000056015742,0.00010227348,0.00006163558,0.00012350715,0.000020751302,0.000017371485],"category_scores_gemma":[0.0000048044317,0.000058485228,0.00001530758,0.00013839596,0.000019428337,0.00034439226,0.0001222689,0.0000547753,0.000016176058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024714388,0.00006262838,0.020665029,0.000018184159,0.000021121956,0.0000024085143,0.008445499,0.043735504,0.0004257421,0.06204066,0.000570849,0.8640099],"study_design_scores_gemma":[0.0001518204,0.00003215481,0.0675168,0.0000029306225,0.0000023194627,0.0000057666693,0.00008294285,0.92793053,0.0002847673,0.0012868214,0.0026013318,0.00010179133],"about_ca_topic_score_codex":0.000039371458,"about_ca_topic_score_gemma":0.000006751421,"teacher_disagreement_score":0.884195,"about_ca_system_score_codex":0.00000907979,"about_ca_system_score_gemma":0.000009492399,"threshold_uncertainty_score":0.23849584},"labels":[],"label_agreement":null},{"id":"W1583476325","doi":"10.48550/arxiv.quant-ph/0411051","title":"Quantum Communication Cannot Simulate a Public Coin","year":2004,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Quantum; Class (philosophy); Theoretical computer science; Communication complexity; Quantum information science; Hamming distance; Protocol (science); Quadratic equation; Mathematics; Algorithm; Physics; Quantum mechanics; Artificial intelligence; Quantum entanglement","score_opus":0.05912015551230322,"score_gpt":0.19449352916241866,"score_spread":0.13537337365011543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583476325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36281037,0.0001945058,0.6336371,0.0012010318,0.0004913994,0.00026628384,0.000014505153,0.0006005636,0.0007842866],"genre_scores_gemma":[0.9949791,0.00011763831,0.0042697457,0.00020871633,0.000069627895,8.228156e-7,0.000035132787,0.000026097627,0.00029316355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975985,0.00028923323,0.00027760604,0.0011524853,0.00014511215,0.00053705386],"domain_scores_gemma":[0.996424,0.00015841392,0.00036184586,0.0025805533,0.00022455005,0.00025061218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003792796,0.00040706483,0.00039654062,0.00036038965,0.00041065595,0.00037069997,0.0039388556,0.00032431507,0.000012887584],"category_scores_gemma":[0.000048304522,0.00045635577,0.0002557285,0.00082919694,0.00017212197,0.00030755645,0.0043710233,0.001199287,0.00007964009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004847477,0.00008042589,0.0001369633,0.000036506084,0.000048705082,0.00012919362,0.00031519204,0.77938384,0.000005236499,0.21844472,0.00008465042,0.0013297377],"study_design_scores_gemma":[0.00042153272,0.000041003812,0.00045320232,0.00013659976,0.00002048491,0.000010964871,0.000020357866,0.8632998,0.000015371203,0.13389288,0.0012407708,0.0004470771],"about_ca_topic_score_codex":0.0007326427,"about_ca_topic_score_gemma":0.00011606483,"teacher_disagreement_score":0.6321687,"about_ca_system_score_codex":0.0003298356,"about_ca_system_score_gemma":0.0006100372,"threshold_uncertainty_score":0.9997888},"labels":[],"label_agreement":null},{"id":"W158370897","doi":"10.1007/978-3-642-29517-1_7","title":"Transforming MCT Circuits to NCVW Circuits","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Electronic circuit; Computer science; Benchmark (surveying); Square root; Boolean function; Quantum gate; Quantum circuit; Logic gate; Key (lock); Quantum; Boolean circuit; Quantum computer; Topology (electrical circuits); Algorithm; Computer engineering; Mathematics; Electrical engineering; Quantum error correction; Physics; Quantum mechanics; Engineering","score_opus":0.01853989326118558,"score_gpt":0.242190142292005,"score_spread":0.22365024903081943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158370897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004992762,0.0010802421,0.98895764,0.0012776413,0.0035196885,0.0007187799,0.000010026916,0.00042182207,0.0035148528],"genre_scores_gemma":[0.6672194,0.00007574593,0.32306838,0.0056860754,0.0031113923,0.000027416037,0.000008716745,0.00015967734,0.0006431954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936249,0.00005413432,0.0007864006,0.002248513,0.0015610168,0.0017250137],"domain_scores_gemma":[0.99621046,0.0006430587,0.0002685391,0.0019395106,0.00024279386,0.00069562154],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013864898,0.0009490307,0.00086724514,0.0014916135,0.00054439553,0.0007795277,0.0054380917,0.00045271395,0.000026920688],"category_scores_gemma":[0.00011023488,0.00087946607,0.00028137787,0.0012947638,0.00040667524,0.0007201522,0.0014334136,0.0014476426,0.00019725836],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.936854e-7,0.000027526448,0.000016863296,0.000047697697,0.0000118478165,0.00007744372,0.002167144,0.034163486,0.0004267709,0.008149833,0.000017167467,0.95489323],"study_design_scores_gemma":[0.00090589194,0.00082588685,0.000526303,0.0026764013,0.00004460928,0.0010715742,6.283696e-7,0.79876465,0.0078770835,0.14583601,0.03683912,0.004631869],"about_ca_topic_score_codex":0.000023624965,"about_ca_topic_score_gemma":0.000049445116,"teacher_disagreement_score":0.95026135,"about_ca_system_score_codex":0.00035396026,"about_ca_system_score_gemma":0.00075604976,"threshold_uncertainty_score":0.99994296},"labels":[],"label_agreement":null},{"id":"W1588169958","doi":"10.26421/qic12.9-10-8","title":"Quantum algorithms for invariants of triangulated manifolds","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Invariant (physics); Tensor (intrinsic definition); Euler characteristic; Pure mathematics; Mathematical physics","score_opus":0.021683940076733847,"score_gpt":0.269551820940237,"score_spread":0.24786788086350314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588169958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12960368,0.000117802265,0.8688074,0.00028352157,0.0006079474,0.00031625087,0.00001159834,0.00013307054,0.00011875124],"genre_scores_gemma":[0.9406845,0.0000106524185,0.058907006,0.00022891739,0.0000832313,0.000013852207,0.00005927068,0.0000067224555,0.000005838604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871117,0.000055604443,0.0005628821,0.00013243212,0.0002402646,0.00029763387],"domain_scores_gemma":[0.9989904,0.00016581311,0.00036364142,0.0001703505,0.00019102907,0.00011872123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006192194,0.00015675207,0.00021657931,0.00025226147,0.00017067413,0.00012845344,0.00022807936,0.00008721492,0.0000029032046],"category_scores_gemma":[0.000062492036,0.00014163615,0.000069050206,0.00035863617,0.00003342621,0.001667164,0.00009249082,0.000087591696,0.000012518714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047207155,0.000121575715,0.00033700513,0.00020911709,0.00004963821,3.9602295e-7,0.0071224347,0.007086466,0.00016931847,0.46737206,0.00083614676,0.51664865],"study_design_scores_gemma":[0.0009124096,0.00017436515,0.006776162,0.000028723765,0.000009425644,0.000027204065,0.000131043,0.97955704,0.00027698677,0.010138152,0.0017892914,0.00017922332],"about_ca_topic_score_codex":0.000023537166,"about_ca_topic_score_gemma":3.1503484e-7,"teacher_disagreement_score":0.9724705,"about_ca_system_score_codex":0.00001815735,"about_ca_system_score_gemma":0.000046396704,"threshold_uncertainty_score":0.5775755},"labels":[],"label_agreement":null},{"id":"W1590894447","doi":"10.1063/1.3131355","title":"A Fair Loss-Tolerant Quantum Coin Flipping Protocol","year":2009,"lang":"en","type":"article","venue":"AIP conference proceedings","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Coin flipping; Cheating; Protocol (science); Computer science; Outcome (game theory); Quantum cryptography; Cryptography; Cryptographic protocol; Quantum; Qubit; Computer security; Theoretical computer science; Mathematics; Quantum information; Statistics; Mathematical economics; Quantum mechanics; Physics","score_opus":0.01693639213620867,"score_gpt":0.26288877334728084,"score_spread":0.24595238121107216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590894447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07412899,0.00002133683,0.878973,0.013061251,0.0003271308,0.023848843,0.0000026228547,0.0018594182,0.007777371],"genre_scores_gemma":[0.9701242,0.0000015165373,0.02517606,0.0012640482,0.00022057249,0.0030680727,9.209758e-7,0.000015503107,0.00012914708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974417,0.00001840733,0.00044318286,0.00084212306,0.0005131959,0.00074136705],"domain_scores_gemma":[0.99877506,0.000039291775,0.00023235803,0.0003304581,0.0003888583,0.00023395222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040271934,0.00036896634,0.00036278737,0.00018955808,0.00034233648,0.00080947,0.0015760799,0.0001259311,0.00002287037],"category_scores_gemma":[0.00007362363,0.0003156002,0.00011610058,0.0006536054,0.0000902835,0.0006844273,0.00027895975,0.0004959596,0.000070534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079401594,0.00051714847,0.0031965477,0.0002540403,0.00004500324,0.00012940726,0.01338202,0.00010393069,0.023528297,0.6109552,0.0035233756,0.34428564],"study_design_scores_gemma":[0.0007014307,0.0005761372,0.004566573,0.00029023807,0.000004858732,0.00016337426,0.000073421674,0.93320453,0.0010627194,0.04912749,0.009692287,0.00053696876],"about_ca_topic_score_codex":0.00001738089,"about_ca_topic_score_gemma":8.567684e-7,"teacher_disagreement_score":0.9331006,"about_ca_system_score_codex":0.000046730296,"about_ca_system_score_gemma":0.00019631925,"threshold_uncertainty_score":0.9999296},"labels":[],"label_agreement":null},{"id":"W1592762815","doi":"10.1109/cec.2003.1299571","title":"Exploring the search space of quantum programs","year":2003,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Fitness landscape; Context (archaeology); Theoretical computer science; Quantum; Point (geometry); Space (punctuation); Mathematics; Geography; Physics; Sociology","score_opus":0.0742217737671268,"score_gpt":0.256661437563492,"score_spread":0.18243966379636523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592762815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34766436,0.000060720682,0.64600927,0.0016324844,0.00043335007,0.00013685825,1.122324e-7,0.00014424205,0.0039185756],"genre_scores_gemma":[0.9400188,0.000006030862,0.059731446,0.000038442595,0.000032724034,0.0000073018086,1.0969262e-7,0.000005585289,0.00015960631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900466,0.000109563094,0.00013373935,0.0002128654,0.00026995948,0.00026919582],"domain_scores_gemma":[0.9992386,0.00011246777,0.000031811764,0.0005116791,0.00005330248,0.000052147654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051359093,0.000087254615,0.00009959329,0.00004516672,0.00012693477,0.00008088808,0.0006551891,0.000013523673,0.0000045100683],"category_scores_gemma":[0.000029465667,0.000049752573,0.00006017207,0.0005037541,0.000059786085,0.00013158248,0.00015202051,0.00015522634,0.000013164451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.665797e-7,0.000050162085,0.00017749937,0.000010786747,0.000009340195,0.0000039550437,0.0015712363,0.0022575296,0.000248913,0.87977993,0.00006724263,0.11582264],"study_design_scores_gemma":[0.00021310935,0.00023830785,0.00188179,0.000044212644,0.000003142804,0.000052515275,0.0003596271,0.949502,0.023015706,0.011686916,0.012780082,0.00022257787],"about_ca_topic_score_codex":0.000050194576,"about_ca_topic_score_gemma":0.0000019529998,"teacher_disagreement_score":0.94724447,"about_ca_system_score_codex":0.0000062119802,"about_ca_system_score_gemma":0.00004341159,"threshold_uncertainty_score":0.2028851},"labels":[],"label_agreement":null},{"id":"W1594537107","doi":"10.1007/3-540-45841-7_26","title":"A Quantum Goldreich-Levin Theorem with Cryptographic Applications","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Qubit; Quantum; Quantum algorithm; Reduction (mathematics); Quantum computer; Permutation (music); Discrete mathematics; Theoretical computer science; Mathematics; Quantum mechanics; Physics","score_opus":0.010395302736202714,"score_gpt":0.21846412816962701,"score_spread":0.2080688254334243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594537107","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007317684,0.00085679744,0.99239,0.0010571198,0.0005401968,0.0007609066,0.0000079977835,0.00048994995,0.0038238761],"genre_scores_gemma":[0.12180187,0.00013448638,0.8745795,0.0018207066,0.0010607309,0.00007397944,0.000008445048,0.00011959834,0.0004006765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945922,0.00006976288,0.0006132312,0.00235686,0.0013223647,0.0010455683],"domain_scores_gemma":[0.99582434,0.00065447367,0.0004196637,0.0024948376,0.00029249274,0.0003141818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009055969,0.0008714273,0.00072800653,0.0013381195,0.00058371486,0.00087959156,0.0049808496,0.00035596758,0.00003229265],"category_scores_gemma":[0.00003195912,0.00067860767,0.0002179787,0.001776376,0.0013898683,0.00037814814,0.0012694407,0.0014918514,0.00008071754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048146767,0.00006515977,0.000037669062,0.00004931554,0.000026534712,0.00010516921,0.00053340977,0.06055072,0.000026313659,0.20834632,0.000022139386,0.7302324],"study_design_scores_gemma":[0.00024026216,0.0002482003,0.000076935496,0.0003816651,0.000012032358,0.00024255412,1.2488692e-7,0.7529708,0.00006708123,0.24038915,0.004554206,0.00081699045],"about_ca_topic_score_codex":0.000016228152,"about_ca_topic_score_gemma":0.000026615817,"teacher_disagreement_score":0.7294154,"about_ca_system_score_codex":0.00014879025,"about_ca_system_score_gemma":0.0003818676,"threshold_uncertainty_score":0.9995665},"labels":[],"label_agreement":null},{"id":"W1595148576","doi":"10.1007/978-3-540-92910-9_43","title":"Algorithms for Quantum Computers","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Jerome's University; Perimeter Institute; University of Waterloo","funders":"","keywords":"Quantum algorithm; Quantum computer; Quantum; Quantum Fourier transform; Computer science; Quantum walk; Algorithm; Quantum sort; Field (mathematics); Polynomial; Quantum information; Quantum network; Theoretical computer science; Mathematics; Pure mathematics; Physics; Quantum mechanics","score_opus":0.03249155986784901,"score_gpt":0.2804765211780066,"score_spread":0.24798496131015757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595148576","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013948751,0.0005758458,0.9844498,0.0023275034,0.008970432,0.00070252985,0.000029088696,0.0010165797,0.0005333592],"genre_scores_gemma":[0.05817135,0.000015877817,0.9385697,0.0009097874,0.0018383956,0.000093992,0.00005068967,0.000050177518,0.00029997472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718523,0.00007892651,0.00046741348,0.0010438226,0.00037456973,0.00085003517],"domain_scores_gemma":[0.997509,0.00035327423,0.00026280177,0.0014357226,0.00015597329,0.0002832337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005890127,0.00051830674,0.0005577128,0.00020537621,0.0002229102,0.0004866069,0.0027504181,0.00034726402,0.000009185227],"category_scores_gemma":[0.000028862349,0.00044113948,0.00043877793,0.0001840005,0.000058277794,0.00014752726,0.003511874,0.00071386265,0.00004430746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008688365,0.00030601793,0.00004995305,0.00048272428,0.00024229306,0.00001526104,0.0017887163,0.03504202,0.00005029093,0.24876036,0.030694779,0.6825589],"study_design_scores_gemma":[0.000263738,0.00005781189,0.00016866687,0.00008916396,0.000016475748,0.000024335617,0.0000052594764,0.94317275,0.00013295659,0.03689482,0.018574433,0.0005995838],"about_ca_topic_score_codex":0.00005265224,"about_ca_topic_score_gemma":0.0000015024234,"teacher_disagreement_score":0.9081307,"about_ca_system_score_codex":0.00005858128,"about_ca_system_score_gemma":0.00017146104,"threshold_uncertainty_score":0.999804},"labels":[],"label_agreement":null},{"id":"W1597310767","doi":"10.1063/1.2400876","title":"Approximate Randomization of Quantum States With Fewer Bits of Key","year":2006,"lang":"en","type":"article","venue":"AIP conference proceedings","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"State (computer science); Unitary state; Mathematics; Sequence (biology); Upper and lower bounds; Quantum state; Discrete mathematics; Set (abstract data type); Quantum; Pseudorandomness; Combinatorics; Algorithm; Computer science; Pseudorandom number generator; Quantum mechanics","score_opus":0.007382653269150726,"score_gpt":0.20341874585422098,"score_spread":0.19603609258507027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597310767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4239685,0.000037635415,0.57483697,0.00025282803,0.00004055944,0.0001502599,0.0000025501347,0.00007939504,0.000631317],"genre_scores_gemma":[0.9638777,0.000010259873,0.035984185,0.000024953817,0.00003064393,0.000008371244,0.0000041181243,0.000010411332,0.000049403643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987296,0.000012083304,0.00035539587,0.0003238159,0.00032947876,0.00024965318],"domain_scores_gemma":[0.99876684,0.000057664452,0.00036558273,0.00014870625,0.00061714626,0.00004403627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026738722,0.00017058535,0.00032618362,0.00014355175,0.00006443616,0.00009285186,0.00051417085,0.00005071252,0.0000047965978],"category_scores_gemma":[0.000028675988,0.0001249411,0.00004651241,0.0004954319,0.00012398786,0.00028352873,0.00012198952,0.00011146569,0.0000015084169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004928615,0.0006150186,0.042493213,0.0009711037,0.00011282742,0.000007965675,0.012384055,0.0058184904,0.057372812,0.8554765,0.0008914727,0.02336369],"study_design_scores_gemma":[0.0013795261,0.00024711384,0.0028310583,0.00018023077,0.000010976869,0.000012713982,0.00007288274,0.9597713,0.015332701,0.019878266,0.00010265926,0.0001805682],"about_ca_topic_score_codex":0.0001179144,"about_ca_topic_score_gemma":0.0000026487373,"teacher_disagreement_score":0.9539528,"about_ca_system_score_codex":0.000008898366,"about_ca_system_score_gemma":0.00008129876,"threshold_uncertainty_score":0.509495},"labels":[],"label_agreement":null},{"id":"W1598829068","doi":"10.26421/qic13.5-6-1","title":"The robustness of magic state distillation against errors in Clifford gates","year":2013,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Quantum computer; Quantum error correction; Computer science; Qubit; MAGIC (telescope); Algorithm; Quantum gate; Mathematics; Quantum algorithm; Topology (electrical circuits); Quantum mechanics; Quantum; Physics","score_opus":0.007043994590803551,"score_gpt":0.22239548095482298,"score_spread":0.21535148636401943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598829068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58407754,0.000036359448,0.41469255,0.00066351116,0.00016573956,0.00017964643,9.93604e-7,0.000044066208,0.00013960162],"genre_scores_gemma":[0.99423224,0.00004104172,0.0055816537,0.00009590674,0.000012960762,0.000008323376,0.000017372737,0.0000032071332,0.000007307601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989511,0.00006342073,0.00049957907,0.00010698428,0.0002053365,0.00017360962],"domain_scores_gemma":[0.9992274,0.00015923183,0.00028350006,0.00013494864,0.00015155807,0.000043360058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003055479,0.00010717778,0.00011648167,0.00015331528,0.00015837938,0.00027705161,0.00020571185,0.000032661766,8.492424e-7],"category_scores_gemma":[0.000035940222,0.00007658908,0.000027546279,0.00037168947,0.00005877906,0.0011162688,0.0000821645,0.0001059329,0.000013306493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047461435,0.0000112399575,0.000539341,0.000031696825,0.000003927629,1.5994807e-7,0.0013113519,0.4753134,0.000013175203,0.01106816,0.00011370095,0.5115891],"study_design_scores_gemma":[0.0002563797,0.000042496467,0.04148923,0.000028862356,8.517191e-7,0.000003451145,0.0001868718,0.9513406,0.000029899515,0.0062317178,0.0002951914,0.00009441814],"about_ca_topic_score_codex":0.00005737199,"about_ca_topic_score_gemma":0.0000066421603,"teacher_disagreement_score":0.5114947,"about_ca_system_score_codex":0.000018196337,"about_ca_system_score_gemma":0.000031629697,"threshold_uncertainty_score":0.31232122},"labels":[],"label_agreement":null},{"id":"W1599413552","doi":"10.4230/lipics.stacs.2014.482","title":"An optimal quantum algorithm for the oracle identification problem","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum algorithm; Oracle; Algorithm; Mathematics; Matrix multiplication; Conjecture; Discrete mathematics; Reduction (mathematics); Quantum; Computer science","score_opus":0.014599000787750742,"score_gpt":0.2688054297050613,"score_spread":0.2542064289173106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599413552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014014108,0.00019274578,0.9747109,0.0011183766,0.003319461,0.0049194214,0.0010166256,0.00061614683,0.00009223949],"genre_scores_gemma":[0.071755484,0.000080369966,0.92186743,0.0008353213,0.001164966,0.002152324,0.0017219492,0.00014890597,0.00027326186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509364,0.00009952352,0.0019033357,0.00089376065,0.0008097935,0.0011999503],"domain_scores_gemma":[0.9941186,0.0004399367,0.0014649848,0.0027744484,0.00089139224,0.00031068636],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016946696,0.00083990727,0.00075739966,0.00033415962,0.0011435953,0.0034394497,0.005311303,0.00058610796,0.000012134332],"category_scores_gemma":[0.00006968037,0.0006329465,0.0006172951,0.00033799338,0.0001972579,0.0015411546,0.0020205847,0.0013309243,0.00009424654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042907897,0.0006446189,0.000041711257,0.0014100544,0.0004947617,0.0000030247916,0.016570529,0.06186835,0.000040659448,0.014983212,0.009431492,0.89446867],"study_design_scores_gemma":[0.0010186126,0.00030083372,0.00016922847,0.00020674361,0.00007272499,0.000042970398,0.00037866217,0.9629656,0.0003180634,0.009042934,0.024673982,0.0008096657],"about_ca_topic_score_codex":0.000061318904,"about_ca_topic_score_gemma":0.000005251909,"teacher_disagreement_score":0.90109724,"about_ca_system_score_codex":0.0001496313,"about_ca_system_score_gemma":0.00028422865,"threshold_uncertainty_score":0.9996122},"labels":[],"label_agreement":null},{"id":"W1602553661","doi":"10.1007/978-1-4939-3658-8_7","title":"NMR Quantum Information Processing","year":2016,"lang":"en","type":"book-chapter","venue":"Biological magnetic resonance","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"","keywords":"Quantum computer; Computer science; Quantum information; Quantum; Quantum technology; Quantum network; Qubit; Quantum algorithm; Quantum simulator; Theoretical computer science; Computer engineering; Open quantum system; Computational science; Physics; Quantum mechanics","score_opus":0.01641170653950189,"score_gpt":0.21670832873220872,"score_spread":0.20029662219270683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602553661","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039088458,0.046395823,0.23078229,0.0035123571,0.0011684732,0.0009199083,0.00007964692,0.001371054,0.7153796],"genre_scores_gemma":[0.06187671,0.008661841,0.19672513,0.008953155,0.0044271057,0.00017091988,0.0000976737,0.00018559971,0.7189019],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981673,0.000033154138,0.0004851904,0.00055805646,0.000335445,0.0004208892],"domain_scores_gemma":[0.99877316,0.0001327714,0.00028557624,0.00056476844,0.00012407287,0.000119651246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021124381,0.00039288535,0.0003787059,0.00010757841,0.00016946669,0.0001998976,0.0012152512,0.00042088787,0.00010579286],"category_scores_gemma":[0.00007434818,0.00023680039,0.00013880135,0.00006829046,0.00020036145,0.00021885922,0.0005106419,0.00038238612,0.00049328845],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049246455,0.000004434801,0.0000037803998,0.000014447988,0.0000011823554,0.000010377838,0.000028397444,0.0000026703456,0.000008679691,0.2620809,0.0005758039,0.7372644],"study_design_scores_gemma":[0.00018188627,0.0004127693,0.000829502,0.00035189767,0.0000026792857,0.000038725968,5.6067233e-7,0.024801796,0.0000042689458,0.11331744,0.85963035,0.00042811516],"about_ca_topic_score_codex":0.000001355252,"about_ca_topic_score_gemma":2.2497798e-7,"teacher_disagreement_score":0.85905457,"about_ca_system_score_codex":0.000037205744,"about_ca_system_score_gemma":0.00009120409,"threshold_uncertainty_score":0.965644},"labels":[],"label_agreement":null},{"id":"W1607694089","doi":"10.1142/s012962641000017x","title":"COPING WITH DECOHERENCE: PARALLELIZING THE QUANTUM FOURIER TRANSFORM","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Quantum decoherence; Computer science; Quantum computer; Scalability; Computation; Computational complexity theory; Fourier transform; Theoretical computer science; Quantum; Quantum Fourier transform; Fast Fourier transform; Algorithm; Computational science; Quantum error correction; Quantum mechanics; Physics","score_opus":0.008926463917114678,"score_gpt":0.22950308301609124,"score_spread":0.22057661909897655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607694089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15799904,0.00014725942,0.7969839,0.043655455,0.0003153856,0.0002106486,3.7369756e-7,0.0003112642,0.00037667598],"genre_scores_gemma":[0.7384932,0.000005027721,0.25411424,0.0070064473,0.00028095965,0.000039134848,0.0000015350327,0.000028094719,0.000031331678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799705,0.00005134184,0.0002801315,0.00056103634,0.0004691035,0.0006413676],"domain_scores_gemma":[0.9988979,0.00015695614,0.000157553,0.0005997609,0.000064594926,0.00012322876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044738044,0.00029568787,0.00022375652,0.00008128988,0.00088853104,0.0009048268,0.0014493021,0.00007276755,0.000008049535],"category_scores_gemma":[0.00002684725,0.0001763811,0.00008169838,0.00044630142,0.00023397431,0.0005732427,0.000109939596,0.0008603979,0.000018318695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007901061,0.00015736083,0.0012233327,0.00026534358,0.00012304861,0.00020625857,0.016057862,0.05744576,0.014391497,0.014363434,0.005851382,0.8898357],"study_design_scores_gemma":[0.00070496806,0.00008096028,0.00092483725,0.000119222714,0.000017369903,0.0002887089,0.00006417247,0.97276384,0.0003530852,0.0030418413,0.021049239,0.00059175305],"about_ca_topic_score_codex":0.00003089168,"about_ca_topic_score_gemma":0.000028812256,"teacher_disagreement_score":0.9153181,"about_ca_system_score_codex":0.000014649395,"about_ca_system_score_gemma":0.00012485356,"threshold_uncertainty_score":0.8725266},"labels":[],"label_agreement":null},{"id":"W1608621648","doi":"10.1109/tit.2009.2018339","title":"Quantum Serial Turbo Codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; Université de Sherbrooke","funders":"","keywords":"Turbo code; Serial concatenated convolutional codes; Quantum convolutional code; Convolutional code; Concatenated error correction code; Low-density parity-check code; Algorithm; Computer science; Block code; Linear code; Theoretical computer science; BCJR algorithm; Decoding methods","score_opus":0.006329227655511901,"score_gpt":0.2174012273477657,"score_spread":0.21107199969225382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608621648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012123692,0.000007723604,0.98366195,0.00069420243,0.0012088824,0.00012634619,0.00001061356,0.00044439145,0.0017222189],"genre_scores_gemma":[0.988261,0.0000063343714,0.009824309,0.0017502633,0.000067355795,0.0000063710263,0.0000027568622,0.000003845008,0.000077798075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901754,0.000086251996,0.00029060652,0.00013656892,0.00024254437,0.00022646529],"domain_scores_gemma":[0.9992757,0.00011329555,0.00009261652,0.00037255845,0.000063342384,0.00008248023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003671845,0.00014895607,0.00012502285,0.00022329297,0.00031926457,0.00022090657,0.00045613627,0.0000724523,0.000039972547],"category_scores_gemma":[0.0000067754668,0.00012874677,0.000097605305,0.00031404448,0.00003354623,0.001165421,0.0000016991092,0.00025279174,0.00023861206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053927197,0.000068117006,1.2878023e-7,0.0000072006465,0.000014335494,0.0000013880834,0.002405861,0.13358842,0.00014835817,0.109618254,0.00024646378,0.75384754],"study_design_scores_gemma":[0.0006758937,0.0004919697,0.00014692174,0.000046079233,0.000010733342,0.00006169025,0.00011746697,0.88093793,0.022046333,0.09148586,0.003578773,0.0004003223],"about_ca_topic_score_codex":0.000003148363,"about_ca_topic_score_gemma":4.333302e-7,"teacher_disagreement_score":0.9761373,"about_ca_system_score_codex":0.000029232622,"about_ca_system_score_gemma":0.00004777836,"threshold_uncertainty_score":0.5250141},"labels":[],"label_agreement":null},{"id":"W1608861503","doi":"10.1007/11940128_63","title":"Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hamming distance; Upper and lower bounds; Alice and Bob; Mathematics; Discrete mathematics; Quantum; Hamming code; Protocol (science); Quantum information science; Combinatorics; Algorithm; Quantum mechanics; Physics; Quantum entanglement","score_opus":0.01821230751630273,"score_gpt":0.23208179868430612,"score_spread":0.21386949116800338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608861503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014889279,0.0008915235,0.9926032,0.0014439665,0.0006104757,0.00039839928,0.000011544236,0.00009990823,0.002452062],"genre_scores_gemma":[0.9230202,0.000036462694,0.07577553,0.00073766493,0.00018078467,0.000010158963,0.0000056842596,0.00003418219,0.00019932911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969876,0.00008480654,0.00061765494,0.0009884717,0.00082068687,0.00050081],"domain_scores_gemma":[0.99585795,0.0015228534,0.0005077184,0.0018345445,0.00019541576,0.00008151238],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009640358,0.0004988274,0.00053386926,0.00039624106,0.0005761329,0.00054761546,0.0031685568,0.00018071066,0.00000468144],"category_scores_gemma":[0.00007532439,0.00036006863,0.000110076464,0.00039642054,0.0022328177,0.00017657512,0.0012246295,0.00086603407,0.000004419273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016200604,0.000109023305,0.000042019692,0.00020721498,0.000024733361,0.00004289357,0.0026741342,0.17835905,0.00008751284,0.5383119,0.00016456166,0.27996078],"study_design_scores_gemma":[0.00011860095,0.00024665715,0.00015616181,0.00078407675,0.0000051519028,0.000038561197,3.4242106e-7,0.7162495,0.00008135587,0.28056744,0.0014142226,0.00033789544],"about_ca_topic_score_codex":0.000050280552,"about_ca_topic_score_gemma":0.000075565724,"teacher_disagreement_score":0.92153126,"about_ca_system_score_codex":0.000097326774,"about_ca_system_score_gemma":0.0002266774,"threshold_uncertainty_score":0.99988514},"labels":[],"label_agreement":null},{"id":"W1617831777","doi":"10.4086/cjtcs.2016.013","title":"Optimal bounds for quantum weak oblivious transfer","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Agence Nationale de la Recherche","keywords":"Oblivious transfer; Alice (programming language); Alice and Bob; Computer science; Transfer (computing); Upper and lower bounds; Cryptography; Quantum; Cryptographic protocol; Quantum cryptography; Discrete mathematics; Protocol (science); Point (geometry); Coin flipping; Mathematics; Quantum information; Algorithm; Quantum mechanics; Physics; Statistics","score_opus":0.04041892535300748,"score_gpt":0.18641272773649722,"score_spread":0.14599380238348975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1617831777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38822037,0.00007034061,0.6095018,0.00020628331,0.00091563404,0.00041159458,0.000023813958,0.00034561194,0.0003045613],"genre_scores_gemma":[0.9809484,0.00005517283,0.017102677,0.00012458769,0.0002620024,0.000005296299,0.000022689574,0.00004133311,0.0014378631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972197,0.0001106245,0.0002803326,0.0015508599,0.00012948629,0.00070902373],"domain_scores_gemma":[0.9978452,0.00020471518,0.00012507715,0.0013455253,0.00021319311,0.00026630197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027056952,0.00050843,0.00050441315,0.00031211704,0.00035388774,0.00040958554,0.0027159362,0.00040175157,0.000023716257],"category_scores_gemma":[0.000021485526,0.00053693494,0.0005054757,0.00044656332,0.00014364047,0.000273,0.0013086408,0.00079888856,0.00007213718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022018641,0.00011921484,0.00007320646,0.00012150091,0.0001174681,0.00007185068,0.00042216372,0.76250756,0.000037718954,0.23228239,0.0013544876,0.0028704475],"study_design_scores_gemma":[0.00058080273,0.00017091066,0.00021487867,0.00009050151,0.00005188059,0.0000130771205,0.000029759452,0.949519,0.000062131825,0.04488996,0.003737014,0.00064012234],"about_ca_topic_score_codex":0.00015559181,"about_ca_topic_score_gemma":0.000012041204,"teacher_disagreement_score":0.592728,"about_ca_system_score_codex":0.00011624141,"about_ca_system_score_gemma":0.00027019187,"threshold_uncertainty_score":0.99970824},"labels":[],"label_agreement":null},{"id":"W1619297896","doi":"10.26421/qic12.9-10-9","title":"Quantum phase estimation with arbitrary constant-precision phase shift operators","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Quantitative precipitation estimation; Quantum Fourier transform; Operator (biology); Algorithm; Quantum; Quantum algorithm; Computer science; Phase (matter); Constant (computer programming); Mathematics; Quantum error correction; Quantum mechanics; Physics; Chemistry","score_opus":0.012269652418089817,"score_gpt":0.27970929421332713,"score_spread":0.2674396417952373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1619297896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3775332,0.00010194718,0.6210065,0.00032138947,0.00031153928,0.00023986219,0.000008750667,0.00024549986,0.00023135454],"genre_scores_gemma":[0.9360351,0.00001251181,0.06316864,0.00055623846,0.00006983426,0.000014188208,0.00013073662,0.000010719006,0.000002041839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981736,0.00011994514,0.0005909707,0.00023353216,0.00047258093,0.0004093789],"domain_scores_gemma":[0.99884135,0.00017189927,0.0003293382,0.0002594593,0.00013639423,0.00026156055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057953986,0.00027866065,0.00024654716,0.00033412277,0.00042576971,0.00053296494,0.00026218008,0.00009316553,0.000008907409],"category_scores_gemma":[0.0000397172,0.00022411405,0.00004864102,0.0005584238,0.00009351322,0.004560258,0.000109946486,0.00024155996,0.00006853112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001329472,0.00040853515,0.00013870635,0.00007606742,0.000031405598,0.0000041317917,0.0082835285,0.016358372,0.00005799408,0.1882573,0.00039519023,0.7858558],"study_design_scores_gemma":[0.003111849,0.0006303705,0.0005834555,0.00007183717,0.000013219482,0.000109066525,0.00019497491,0.98804384,0.00022176692,0.0052166777,0.0014665178,0.00033644337],"about_ca_topic_score_codex":0.000018175993,"about_ca_topic_score_gemma":5.976882e-7,"teacher_disagreement_score":0.97168547,"about_ca_system_score_codex":0.000046438487,"about_ca_system_score_gemma":0.00011791854,"threshold_uncertainty_score":0.9139105},"labels":[],"label_agreement":null},{"id":"W1621715716","doi":"10.48550/arxiv.1501.04592","title":"Near-linear constructions of exact unitary 2-designs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Canadian Institute for Advanced Research","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Unitary state; Logarithm; Hash function; Mathematics; Qubit; Quadratic equation; Quantum; Quantum circuit; Quantum gate; Quantum Fourier transform; Electronic circuit; Discrete mathematics; Quantum mechanics; Computer science; Quantum error correction; Physics; Mathematical analysis","score_opus":0.08234227684867206,"score_gpt":0.2052925741962482,"score_spread":0.12295029734757613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1621715716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49400076,0.00005847765,0.50363886,0.00008638607,0.00067457993,0.00014692351,0.000030261239,0.00021798213,0.0011458063],"genre_scores_gemma":[0.96720564,0.000025748173,0.032311257,0.000036708057,0.00010233432,2.4813843e-7,0.0000142095905,0.000016505594,0.00028732064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983015,0.00019644275,0.00024599675,0.0008129737,0.00012597404,0.00031712314],"domain_scores_gemma":[0.99777234,0.00013343278,0.0002966,0.0012608808,0.00031654086,0.0002202022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029784386,0.00029764723,0.00039923677,0.00023520018,0.00018350502,0.00006565686,0.0017620306,0.00024384154,0.00001631795],"category_scores_gemma":[0.00004088048,0.00032404903,0.00021373665,0.0007112098,0.0003221275,0.00016107589,0.0019538263,0.0007406644,0.000030248688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010280715,0.00007008376,0.0005808211,0.000048326485,0.00008373473,0.00015101099,0.0003550722,0.9638777,0.000019900286,0.03293138,0.00039164495,0.0014800453],"study_design_scores_gemma":[0.00031643145,0.00008226687,0.0002808267,0.0000887791,0.000042419422,0.000026540622,0.000060863254,0.9571014,0.00007923555,0.041050415,0.00054463046,0.00032620042],"about_ca_topic_score_codex":0.00025238085,"about_ca_topic_score_gemma":0.000010635437,"teacher_disagreement_score":0.4732049,"about_ca_system_score_codex":0.00008865187,"about_ca_system_score_gemma":0.0006907808,"threshold_uncertainty_score":0.99992114},"labels":[],"label_agreement":null},{"id":"W1624499016","doi":"10.1109/mwscas.2015.7282143","title":"Efficient architecture and implementation for NTRUEncrypt system","year":2015,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Field-programmable gate array; Shift register; Modular design; Architecture; Cryptosystem; Computer architecture; Key (lock); Adder; Linear feedback shift register; NTRU; Public-key cryptography; Embedded system; Computer hardware; Computer engineering; Cryptography; Parallel computing; Encryption; Computer network; Latency (audio); Algorithm","score_opus":0.012637345002698858,"score_gpt":0.2626495059603843,"score_spread":0.2500121609576854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1624499016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12651734,0.000071035865,0.8712632,0.0010136437,0.00026931692,0.00026383757,0.0000029710488,0.00022129515,0.00037734327],"genre_scores_gemma":[0.72259533,1.5048406e-7,0.2771093,0.00015276119,0.00008826023,0.0000157155,0.0000018925131,0.0000053320896,0.000031266143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991953,0.00002956481,0.00013487895,0.0002725444,0.00015841611,0.00020931118],"domain_scores_gemma":[0.99949706,0.00006403805,0.00004497676,0.0002001504,0.00006357623,0.00013017545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030555855,0.00009669464,0.00010077191,0.00006716752,0.00010351275,0.00012141896,0.00023371194,0.00002479674,5.8669e-7],"category_scores_gemma":[0.000011714994,0.00007136218,0.000029897676,0.00012944879,0.000016415026,0.000024671255,0.0001345007,0.000051774525,0.000003277908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013381909,0.000033510798,0.00015776009,0.00011228092,0.000025352625,0.000007941707,0.0051124953,0.07613309,0.00033144173,0.38355556,0.0027331323,0.53178406],"study_design_scores_gemma":[0.00060084515,0.00014002107,0.00021523797,0.0000100096495,0.0000035001349,0.00006550671,0.00032593575,0.99317265,0.00035914825,0.0025775353,0.0024117187,0.00011790223],"about_ca_topic_score_codex":0.000027809197,"about_ca_topic_score_gemma":0.0000042071583,"teacher_disagreement_score":0.9170396,"about_ca_system_score_codex":0.000026075786,"about_ca_system_score_gemma":0.00004617143,"threshold_uncertainty_score":0.2910065},"labels":[],"label_agreement":null},{"id":"W1624887593","doi":"10.26421/qic3.2-8","title":"Circuit for Shor's algorithm using 2n+3 qubits","year":2003,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":207,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum computer; Qubit; Quantum circuit; Integer factorization; Integer (computer science); Mathematics; Discrete mathematics; Quantum algorithm; Factorization; Algorithm; Quantum gate; Quantum; Polynomial; Property (philosophy); Combinatorics; Computer science; Quantum error correction; Quantum mechanics; Physics","score_opus":0.02214648016103968,"score_gpt":0.26119808501020597,"score_spread":0.2390516048491663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1624887593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032505292,0.0000746024,0.9659952,0.00013813928,0.0005233035,0.0002917667,0.000006379774,0.00017838662,0.0002869138],"genre_scores_gemma":[0.61368746,0.000008193881,0.3855487,0.0006229133,0.000064197324,0.000014828217,0.000034162953,0.0000095342575,0.000009996927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885255,0.000057173587,0.00042385166,0.00019343529,0.0002169489,0.00025605533],"domain_scores_gemma":[0.9992576,0.00010980691,0.00020806647,0.00015079259,0.00017991265,0.00009377861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043095235,0.0001581415,0.00015597104,0.00020093116,0.00035681482,0.0003878823,0.0001755929,0.00006926182,0.0000021010017],"category_scores_gemma":[0.00005787737,0.0001529748,0.00005740016,0.0003149917,0.000027903929,0.0011445727,0.00004414583,0.00010103744,0.000010769958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028624247,0.000024506908,0.00002779606,0.000051608593,0.000015002361,7.2914287e-7,0.0018497814,0.03933302,0.00004917752,0.2310787,0.00019203022,0.7273748],"study_design_scores_gemma":[0.00050392986,0.00009097454,0.0001812889,0.00002017852,0.0000056001118,0.000067484536,0.00009985373,0.9586331,0.00015028207,0.033403896,0.006642078,0.00020128409],"about_ca_topic_score_codex":0.000010497824,"about_ca_topic_score_gemma":3.9368135e-7,"teacher_disagreement_score":0.91930014,"about_ca_system_score_codex":0.000031832213,"about_ca_system_score_gemma":0.000087125736,"threshold_uncertainty_score":0.62381315},"labels":[],"label_agreement":null},{"id":"W1624997067","doi":"10.1017/s0960129518000051","title":"The quantum walk search algorithm: factors affecting efficiency","year":2018,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Curse of dimensionality; Quantum walk; Dimension (graph theory); Symmetry (geometry); Quantum; Carry (investment); Current (fluid); Work (physics)","score_opus":0.014624811358282669,"score_gpt":0.2780769385946162,"score_spread":0.2634521272363335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1624997067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31366622,0.00003972121,0.68438166,0.0002765876,0.0011449165,0.00019004503,7.386508e-7,0.00016078407,0.0001393144],"genre_scores_gemma":[0.7404827,0.0000014635068,0.2590962,0.000105982086,0.00029846214,0.0000014910572,2.2161115e-7,0.0000090744525,0.000004423882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958039,0.00017297266,0.00050073495,0.0009936409,0.0012931057,0.0012356669],"domain_scores_gemma":[0.9970073,0.0012097833,0.000117477175,0.0012091005,0.00020182776,0.0002544767],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022152192,0.00033078462,0.0002992591,0.00027886397,0.0018149341,0.0013801296,0.0047621913,0.000068346126,0.000013674248],"category_scores_gemma":[0.00025749987,0.00019378215,0.00010138349,0.0022998555,0.0018466266,0.0003781886,0.0016313972,0.000524571,0.0000346599],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025943052,0.000060340997,0.0006644824,0.000021967486,0.0000066443476,0.000028498911,0.005191124,0.003737754,0.00013014868,0.094264664,0.000034971068,0.8958568],"study_design_scores_gemma":[0.0001333114,0.00013557846,0.013750986,0.000042080315,0.0000013052872,0.000084984065,0.00004119372,0.8710361,0.0016091805,0.1128904,0.000033180357,0.00024170388],"about_ca_topic_score_codex":0.000031171363,"about_ca_topic_score_gemma":0.0000066952653,"teacher_disagreement_score":0.8956151,"about_ca_system_score_codex":0.00008617939,"about_ca_system_score_gemma":0.00018998721,"threshold_uncertainty_score":0.99965656},"labels":[],"label_agreement":null},{"id":"W1625693084","doi":"10.1016/j.tcs.2016.05.005","title":"Correlation bounds and #SAT algorithms for small linear-size circuits","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Mathematics; Correlation; Electronic circuit; Computer science","score_opus":0.013558984464381517,"score_gpt":0.24609904038473077,"score_spread":0.23254005592034924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1625693084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041797217,0.000041082818,0.9538607,0.002583791,0.0009922995,0.0002497806,0.000004806155,0.00025922726,0.00021108058],"genre_scores_gemma":[0.6611784,0.0000035481085,0.3381028,0.0003839908,0.00027099386,0.000007682361,3.964869e-7,0.000009539018,0.00004269353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758714,0.0000740213,0.00028867376,0.0009457599,0.000427932,0.0006764487],"domain_scores_gemma":[0.9973297,0.001410742,0.00008901425,0.00062548235,0.00022444592,0.00032057372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014242582,0.00022706843,0.0002301941,0.00012708317,0.00061765703,0.00038316174,0.0014780303,0.000076204946,0.000006894026],"category_scores_gemma":[0.00030095346,0.00014535862,0.00007327823,0.0005966996,0.001905837,0.00039067207,0.0008366224,0.00013985277,0.000021460508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033939107,0.000021830629,0.000053509466,0.0000062777635,0.0000031482289,0.0000031724537,0.00022311676,0.00015001341,0.0005270411,0.57032746,0.00001698338,0.42866403],"study_design_scores_gemma":[0.00045249864,0.0003038316,0.0014035505,0.000055298715,0.000004081414,0.0000710862,0.00000126146,0.79935217,0.00084406696,0.19696642,0.00031268166,0.00023306404],"about_ca_topic_score_codex":0.0000013411722,"about_ca_topic_score_gemma":3.22155e-7,"teacher_disagreement_score":0.79920214,"about_ca_system_score_codex":0.00004473171,"about_ca_system_score_gemma":0.00012212445,"threshold_uncertainty_score":0.7022136},"labels":[],"label_agreement":null},{"id":"W1634169806","doi":"10.1063/1.3131389","title":"Analysis of a tripartite Bell inequality for 3-qubit states","year":2009,"lang":"en","type":"article","venue":"AIP conference proceedings","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Qubit; Bell state; Quantum entanglement; Bell's theorem; Hidden variable theory; CHSH inequality; Bell test experiments; Local hidden variable theory; Value (mathematics); Quantum mechanics; Operator (biology); Set (abstract data type); Mathematics; Expression (computer science); Quantum teleportation; Physics; Computer science; Quantum; Quantum channel; Statistics; Gene; Genetics","score_opus":0.023396477122387373,"score_gpt":0.27583053837268096,"score_spread":0.2524340612502936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634169806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4330626,0.00003992021,0.56477565,0.0015088393,0.000045771365,0.00018335853,0.000012175479,0.00012190941,0.0002497759],"genre_scores_gemma":[0.9698278,0.000010919454,0.029644758,0.0003992417,0.000035823927,0.0000118664175,0.0000076300885,0.0000043429136,0.00005765538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855417,0.000010707821,0.00039067917,0.00045416967,0.00024966078,0.0003405917],"domain_scores_gemma":[0.99881977,0.00010238613,0.00025622296,0.00021349435,0.000504459,0.000103661296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048653176,0.00016995185,0.0004223043,0.00030428573,0.00010665547,0.00016585464,0.0007635482,0.00006019182,0.0000072351404],"category_scores_gemma":[0.00008026032,0.00014616415,0.00018933187,0.0013336539,0.000046925757,0.00025975556,0.00010124493,0.00011834129,0.0000018871032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020683142,0.001026461,0.043884654,0.00035168894,0.0013457204,0.0000057058523,0.04979355,0.0023361917,0.034280844,0.36245975,0.0021196625,0.5021889],"study_design_scores_gemma":[0.00030064536,0.00036431433,0.01607848,0.000030077255,0.000113630405,0.0000012187633,0.00007152724,0.95521384,0.0018761792,0.025201652,0.0005560033,0.0001924297],"about_ca_topic_score_codex":0.00002865021,"about_ca_topic_score_gemma":0.0000036832953,"teacher_disagreement_score":0.95287764,"about_ca_system_score_codex":0.000015618203,"about_ca_system_score_gemma":0.000065206885,"threshold_uncertainty_score":0.59604007},"labels":[],"label_agreement":null},{"id":"W1636149824","doi":"10.5555/2016985.2016986","title":"The geometry of quantum computation","year":2008,"lang":"en","type":"article","venue":"CERN Document Server (European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Geodesic; Mathematics; Qubit; Hamiltonian (control theory); Unitary state; Quantum computer; Constant curvature; Curvature; Quantum; Geometry; Quantum mechanics; Physics; Mathematical optimization","score_opus":0.023314361701674214,"score_gpt":0.2587160433347178,"score_spread":0.2354016816330436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636149824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97993165,0.00012145134,0.016436843,0.002156486,0.00030857293,0.0003614195,8.9223875e-7,0.00034171788,0.00034098251],"genre_scores_gemma":[0.9989848,0.00007334105,0.0004060821,0.000084384505,0.000081537415,2.3039577e-7,0.000018320145,0.000088674016,0.0002626179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980964,0.0003550761,0.00030643045,0.00032806586,0.00058086467,0.00033315568],"domain_scores_gemma":[0.99855876,0.0001692594,0.00014693978,0.0004962309,0.00052908825,0.00009974907],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010466125,0.0001173373,0.00012226298,0.00016043092,0.0018561255,0.00034149087,0.001520865,0.000031402655,0.000044930362],"category_scores_gemma":[0.00024142225,0.00009113639,0.000063271764,0.0010263958,0.00020252075,0.0002830283,0.0010090537,0.0002039588,0.00024679748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034276407,0.00020874197,0.00026735198,0.00009636716,0.00009002256,0.00003134636,0.003939081,0.009488254,0.00022423467,0.95909214,0.0076763406,0.018851852],"study_design_scores_gemma":[0.007619842,0.0043711383,0.12765566,0.00045605193,0.000059568803,0.0011114528,0.0013868425,0.2725219,0.011529249,0.39393836,0.17669135,0.0026585748],"about_ca_topic_score_codex":0.000014575258,"about_ca_topic_score_gemma":2.3863984e-7,"teacher_disagreement_score":0.5651538,"about_ca_system_score_codex":0.000060136783,"about_ca_system_score_gemma":0.000024256124,"threshold_uncertainty_score":0.9994433},"labels":[],"label_agreement":null},{"id":"W1638930871","doi":"10.26421/qic2.2-5","title":"NMR quantum information processing and entanglement","year":2002,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum entanglement; Quantum information processing; Quantum; Quantum information; Physics; Quantum sensor; Quantum mechanics; Quantum network","score_opus":0.01162527823708187,"score_gpt":0.2282391988132924,"score_spread":0.21661392057621054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1638930871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1342142,0.0002401133,0.8624311,0.0016844854,0.00020565787,0.00024278434,0.0000041413855,0.00029943802,0.0006780545],"genre_scores_gemma":[0.9839555,0.00007535395,0.014758672,0.0011139752,0.000038197515,0.000011244833,0.000036300175,0.0000043780524,0.0000063590196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987027,0.000044112156,0.0005206995,0.00015422469,0.0003373972,0.00024085579],"domain_scores_gemma":[0.9992633,0.00004770845,0.00029535074,0.00013545055,0.00014391677,0.000114300055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000268225,0.00018074774,0.0001502063,0.00028658775,0.00039961428,0.00088497245,0.00017583767,0.00006459315,0.000008097664],"category_scores_gemma":[0.000027908098,0.00016550465,0.000029201321,0.00034225287,0.00004616396,0.004505073,0.00014254368,0.00014802541,0.000061435116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003997294,0.000019811981,0.00009708094,0.000100074416,0.0000066094462,6.9563055e-7,0.008013499,0.004399413,0.0000063180046,0.03691688,0.0006493537,0.94978625],"study_design_scores_gemma":[0.0005383493,0.0001276157,0.0023912012,0.000045800232,0.00000489375,0.00006268113,0.00033046227,0.9821113,0.000018126027,0.0042550634,0.00990172,0.0002128035],"about_ca_topic_score_codex":0.000017000119,"about_ca_topic_score_gemma":6.957487e-7,"teacher_disagreement_score":0.97771186,"about_ca_system_score_codex":0.000029735218,"about_ca_system_score_gemma":0.000020827036,"threshold_uncertainty_score":0.853381},"labels":[],"label_agreement":null},{"id":"W1639121495","doi":"10.5555/2011373.2011380","title":"Limitations on the simulation of non-sparse hamiltonians","year":2010,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hamiltonian (control theory); Quantum; Arboricity; Running time; Dense graph; Combinatorics; Mathematics; Computer science; Discrete mathematics; Statistical physics; Algorithm; Physics; Quantum mechanics; Graph; Mathematical optimization; Pathwidth","score_opus":0.03146106731322644,"score_gpt":0.2552195061686184,"score_spread":0.22375843885539193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1639121495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.351722,0.0000011713333,0.6397303,0.0029468394,0.00026497757,0.00007623175,6.034112e-7,0.000057703473,0.0052002077],"genre_scores_gemma":[0.9536811,4.27543e-7,0.04572151,0.00040695918,0.000048461516,0.000001963289,3.2076855e-7,0.0000032172495,0.00013605008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995017,0.000020079038,0.000107448504,0.00013273308,0.00013746638,0.00010059022],"domain_scores_gemma":[0.9988161,0.0006375028,0.000047461155,0.0004190888,0.000053489453,0.000026374115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016169925,0.000059427406,0.00005611335,0.000046027028,0.00011843,0.000042319884,0.00042807258,0.000027347585,0.000010157498],"category_scores_gemma":[0.00007652894,0.000034665114,0.00004012099,0.00021017101,0.000037007692,0.000051605533,0.00006632973,0.00016848526,0.000028460865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016569766,0.00008196734,0.000083868275,0.0000026975893,0.000008568013,0.0000012259209,0.0016284073,0.6706219,0.0052819867,0.17614509,0.0004213138,0.14572138],"study_design_scores_gemma":[0.00005408678,0.000048953145,0.005251921,0.0000046630225,0.0000010255619,0.0000011039508,0.000008899251,0.98831207,0.0016336921,0.0032162433,0.0014196689,0.000047688565],"about_ca_topic_score_codex":0.000010257329,"about_ca_topic_score_gemma":0.00001921741,"teacher_disagreement_score":0.6019591,"about_ca_system_score_codex":0.0000020244697,"about_ca_system_score_gemma":0.000022513814,"threshold_uncertainty_score":0.14136024},"labels":[],"label_agreement":null},{"id":"W1642510076","doi":"10.26421/qic5.45-6","title":"Stabilizing qubit coherence via tracking-control","year":2005,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dynamical decoupling; Qubit; Quantum decoherence; Coherence (philosophical gambling strategy); Coherence time; Control theory (sociology); Quantum; Hamiltonian (control theory); Markov process; Decoupling (probability); Computer science; Control (management); Mathematics; Quantum mechanics; Physics; Mathematical optimization; Artificial intelligence; Control engineering; Engineering; Statistics","score_opus":0.008980207097274944,"score_gpt":0.23467951403764,"score_spread":0.22569930694036505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1642510076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123674676,0.00007453218,0.87357754,0.0016970977,0.0002138721,0.00017714548,0.000002004185,0.00029152117,0.0002916049],"genre_scores_gemma":[0.9644793,0.0000043099685,0.034312498,0.0010787884,0.00009734894,0.000007986873,0.0000104103865,0.000004574071,0.000004769019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988328,0.00005761853,0.00042176544,0.00018104022,0.00027330077,0.00023347171],"domain_scores_gemma":[0.9992785,0.00011045286,0.00020719887,0.00016498387,0.00014240589,0.00009645378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033626877,0.00015190865,0.00015329878,0.00016298599,0.00026093706,0.000435553,0.0002484233,0.000056907887,0.000005907375],"category_scores_gemma":[0.000026259668,0.00014008724,0.00004289967,0.00027020235,0.00003477681,0.0021846103,0.00006469209,0.00016011618,0.00008145929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064490764,0.000019739273,0.00012302781,0.000020198739,0.0000070749848,5.379479e-7,0.0021606092,0.075547,0.00007549904,0.0148594,0.00012091616,0.90705955],"study_design_scores_gemma":[0.000624174,0.000086984604,0.0039803595,0.000019753394,0.000003625168,0.000040489937,0.00006938222,0.9874254,0.000121382625,0.004145415,0.0032993678,0.00018368106],"about_ca_topic_score_codex":0.00001697723,"about_ca_topic_score_gemma":0.000004106113,"teacher_disagreement_score":0.9118784,"about_ca_system_score_codex":0.000032386182,"about_ca_system_score_gemma":0.00004211675,"threshold_uncertainty_score":0.5712592},"labels":[],"label_agreement":null},{"id":"W1643360887","doi":"10.26421/qic8.3-4-7","title":"Universal fault tolerant quantum computation on bilinear nearest neighbor arrays","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum computer; Qubit; Quantum circuit; Word error rate; Upper and lower bounds; Quantum; Computation; Quantum error correction; Fault tolerance; Computer science; Algorithm; Mathematics; Topology (electrical circuits); Physics; Quantum mechanics; Combinatorics; Mathematical analysis","score_opus":0.014404918950552008,"score_gpt":0.234745910412612,"score_spread":0.22034099146206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1643360887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34783,0.00002415012,0.64951676,0.0012244252,0.00046615966,0.00021714387,0.0000071920226,0.00035649064,0.0003576865],"genre_scores_gemma":[0.9802517,0.000030906813,0.0185079,0.0009628851,0.0001053623,0.0000062230565,0.00011139791,0.000012391381,0.000011201184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998048,0.00011683991,0.0005941178,0.00034621533,0.00054629875,0.0003485438],"domain_scores_gemma":[0.9987912,0.00020396976,0.000332681,0.00024188902,0.0002518958,0.00017832771],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025712658,0.0002933214,0.00026833505,0.00040459042,0.0007049906,0.0003163281,0.00032238287,0.00011458421,0.0000047237054],"category_scores_gemma":[0.000046274505,0.00026894364,0.00008666405,0.0006091085,0.000106974716,0.0015216589,0.000119077136,0.00030396634,0.0001459986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007421629,0.00013216436,0.00014957089,0.000062673964,0.00002923569,0.000026920501,0.007527675,0.74616134,0.000055152414,0.09851101,0.0017646332,0.14550544],"study_design_scores_gemma":[0.0010009935,0.0004428229,0.0052732234,0.000047288908,0.0000052746245,0.00013772101,0.00019065698,0.9867711,0.0000689691,0.0027992174,0.0029267122,0.00033602837],"about_ca_topic_score_codex":0.00006889177,"about_ca_topic_score_gemma":0.0000017849089,"teacher_disagreement_score":0.63242173,"about_ca_system_score_codex":0.00006185126,"about_ca_system_score_gemma":0.00013573696,"threshold_uncertainty_score":0.9999763},"labels":[],"label_agreement":null},{"id":"W1644115585","doi":"10.26421/qic10.3-4-11","title":"Strong NP-hardness of the quantum separability problem","year":2010,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":243,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Separable state; Combinatorics; Mathematics; Quantum entanglement; Separable space; Bipartite graph; Dimension (graph theory); Inverse; Simple (philosophy); Quantum; Quantum state; State (computer science); Upper and lower bounds; Discrete mathematics; TRACE (psycholinguistics); Density matrix; Quantum discord; Quantum mechanics; Physics; Algorithm; Mathematical analysis; Geometry","score_opus":0.007837065178921783,"score_gpt":0.24050588659340416,"score_spread":0.2326688214144824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1644115585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5644844,0.000008926865,0.43329597,0.00087820063,0.0006899945,0.00020660162,0.0000043083423,0.000094910225,0.00033671444],"genre_scores_gemma":[0.9873128,0.0000017759113,0.012445048,0.00018439228,0.000031980402,0.000006839088,0.0000079052625,0.0000037004668,0.0000055368337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987927,0.00007396225,0.00046978428,0.0001619128,0.000320377,0.00018124843],"domain_scores_gemma":[0.9989934,0.000084782696,0.00034026598,0.00031858712,0.00019946363,0.000063516265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004957249,0.00013558922,0.00015132957,0.000095777985,0.0002564403,0.00018493799,0.00044401063,0.000071517694,0.000003433682],"category_scores_gemma":[0.000051232022,0.00009584714,0.00006741806,0.0003766364,0.00010749756,0.0009035163,0.00021028402,0.00029333073,0.000008400087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015298718,0.00009037531,0.002734302,0.00020160667,0.000021140708,3.610016e-7,0.005879596,0.026587581,0.0006669177,0.68383104,0.0005744329,0.27939737],"study_design_scores_gemma":[0.00027345942,0.00005453172,0.02281252,0.000017662456,0.000003896006,0.00002563426,0.0000623784,0.95152783,0.00027885626,0.023049204,0.0017721342,0.00012189374],"about_ca_topic_score_codex":0.000043463264,"about_ca_topic_score_gemma":0.0000068198074,"teacher_disagreement_score":0.9249402,"about_ca_system_score_codex":0.000010392518,"about_ca_system_score_gemma":0.00008820606,"threshold_uncertainty_score":0.3908533},"labels":[],"label_agreement":null},{"id":"W1649877900","doi":"10.4230/lipics.tqc.2014.212","title":"Graph Homomorphisms for Quantum Players","year":2012,"lang":"en","type":"preprint","venue":"DR-NTU (Nanyang Technological University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Homomorphism; Graph homomorphism; Mathematics; Discrete mathematics; Combinatorics; Quantum; Graph; Line graph; Voltage graph; Quantum mechanics; Physics","score_opus":0.02228823952224338,"score_gpt":0.21788270860043407,"score_spread":0.1955944690781907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1649877900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04851055,0.0004340545,0.9411994,0.002732993,0.0015682217,0.0008365047,0.00007815282,0.0034209858,0.0012191253],"genre_scores_gemma":[0.8495875,0.00015909386,0.14849174,0.00020049111,0.00025519016,0.000017282286,0.00006439015,0.00005394495,0.0011703986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686664,0.00011052416,0.00031670168,0.0013231484,0.00037101572,0.0010119461],"domain_scores_gemma":[0.997412,0.00028203728,0.00035294308,0.0015526983,0.00014547132,0.00025483218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042636384,0.00059982674,0.00067602645,0.0009769559,0.000502871,0.00017757353,0.0046831965,0.0012513568,0.000012124239],"category_scores_gemma":[0.00011432896,0.0005517188,0.0005758008,0.0011510695,0.0004747538,0.00019066271,0.0050837677,0.0015846696,0.00003715262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027154061,0.0002645269,0.000107344305,0.00010031777,0.00012854261,0.00023058518,0.000114328475,0.00236663,0.00022456424,0.95134825,0.0019089109,0.04317884],"study_design_scores_gemma":[0.0016265891,0.0005415448,0.00060649967,0.00042385174,0.00019289793,0.000105446015,0.00023097116,0.40899956,0.0015798176,0.3136778,0.26931453,0.0027005135],"about_ca_topic_score_codex":0.000022132486,"about_ca_topic_score_gemma":0.0000029344742,"teacher_disagreement_score":0.80107695,"about_ca_system_score_codex":0.00017725422,"about_ca_system_score_gemma":0.00012324876,"threshold_uncertainty_score":0.99969345},"labels":[],"label_agreement":null},{"id":"W1650080385","doi":"10.26421/qic13.7-8-4","title":"Fast and efficient exact synthesis of single-qubit unitaries generated by Clifford and T gates","year":2013,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Hadamard transform; Conjecture; Qubit; Equivalence (formal languages); Mathematics; Discrete mathematics; Ring (chemistry); Combinatorics; Quantum; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.007051825671954051,"score_gpt":0.2003256337283936,"score_spread":0.19327380805643954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650080385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.678661,0.00012362123,0.32053703,0.00038062275,0.000054874497,0.00012670763,0.0000048930574,0.00005957544,0.00005165765],"genre_scores_gemma":[0.9889169,0.000028055989,0.010868026,0.00014388375,0.000009863603,0.0000076628885,0.000018837754,0.0000038777416,0.0000028973193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991526,0.000050505598,0.00034639874,0.00014156193,0.00016134574,0.00014757729],"domain_scores_gemma":[0.9993155,0.0001805414,0.00019984896,0.0000924498,0.00013148125,0.000080195125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015809818,0.00013356368,0.00016277622,0.00014771885,0.00018876232,0.0003826179,0.00009614045,0.000050456318,0.0000024810622],"category_scores_gemma":[0.00004278724,0.00011280784,0.000016435724,0.00020749075,0.000097830074,0.0006424271,0.00010074548,0.000069230686,0.000004517015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009914656,0.000056320256,0.00045363628,0.00015082887,0.00002439022,3.6035064e-7,0.0041741906,0.03388863,0.0014996725,0.016291892,0.00040949328,0.94304067],"study_design_scores_gemma":[0.00022339524,0.00012372105,0.003972321,0.000039504645,0.000005364307,0.0000180907,0.00023879737,0.9922647,0.0013023403,0.0014730417,0.00020203419,0.00013669707],"about_ca_topic_score_codex":0.00007893689,"about_ca_topic_score_gemma":7.964529e-7,"teacher_disagreement_score":0.95837605,"about_ca_system_score_codex":0.00000900351,"about_ca_system_score_gemma":0.000015663285,"threshold_uncertainty_score":0.460017},"labels":[],"label_agreement":null},{"id":"W1651438266","doi":"10.1007/11783596_25","title":"Quantum Predicative Programming","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Predicative expression; Computer science; Generality; Programming language; Theoretical computer science; Inductive programming; Probabilistic logic; Programming language theory; Programming paradigm; Artificial intelligence","score_opus":0.011072265208880029,"score_gpt":0.236761692314619,"score_spread":0.22568942710573897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1651438266","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013337863,0.0005631772,0.99222964,0.0012289627,0.0017587993,0.000537157,0.000006521792,0.0005279608,0.0030144104],"genre_scores_gemma":[0.09599603,0.000020005586,0.9009475,0.00083988876,0.001401557,0.000020829177,0.000015044076,0.00008302608,0.000676116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99451214,0.000051409996,0.0006989119,0.0022255788,0.0013979234,0.0011140353],"domain_scores_gemma":[0.9968434,0.0004116838,0.00046484047,0.0017440759,0.00029055096,0.00024545784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095788017,0.0007769122,0.000688707,0.000995509,0.00045519657,0.0009003766,0.0046896744,0.00039811447,0.000010573474],"category_scores_gemma":[0.00006959285,0.00068145385,0.00022278016,0.0009328699,0.0010128136,0.0004398504,0.0020543223,0.0014599197,0.000048460122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024077608,0.0000433104,0.000024728111,0.00003743471,0.00001205126,0.00014653725,0.00059752155,0.075603984,0.000026443768,0.020283416,0.00009860526,0.90312356],"study_design_scores_gemma":[0.00019458625,0.00020252736,0.000087641456,0.00042106578,0.000006833635,0.000108125605,8.449638e-8,0.8414355,0.00025634386,0.15048583,0.0060778456,0.00072361215],"about_ca_topic_score_codex":0.000046860507,"about_ca_topic_score_gemma":0.000028063234,"teacher_disagreement_score":0.90239996,"about_ca_system_score_codex":0.00027008101,"about_ca_system_score_gemma":0.00067679846,"threshold_uncertainty_score":0.9995637},"labels":[],"label_agreement":null},{"id":"W1662686370","doi":"10.48550/arxiv.quant-ph/0202111","title":"Quantum statistical zero-knowledge","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Zero (linguistics); Zero-knowledge proof; Ground zero; Quantum; Computer science; Physics; Quantum mechanics; Computer security; Philosophy; Linguistics; Nuclear physics","score_opus":0.04097598606828099,"score_gpt":0.27914562260455716,"score_spread":0.23816963653627618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1662686370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28595603,0.00094173517,0.7062611,0.0008754361,0.0032886178,0.00023481579,0.00003720079,0.0006721116,0.001732984],"genre_scores_gemma":[0.95582557,0.000065334745,0.04195372,0.00030060566,0.00072268053,0.000025243577,0.000025384672,0.0000521212,0.0010293592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967132,0.00022464523,0.00054579444,0.0013682423,0.00039636352,0.00075173605],"domain_scores_gemma":[0.99726766,0.00035279754,0.00022746305,0.0017078303,0.00013953575,0.00030471515],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036269834,0.0005484543,0.0005896406,0.00019637034,0.00025570576,0.0002870429,0.0024374675,0.00036218116,0.000082220846],"category_scores_gemma":[0.00013933338,0.0004971554,0.00022082601,0.00030821166,0.00014678284,0.000096053525,0.0036579643,0.00164337,0.001239026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035594574,0.0028855337,0.10104886,0.0020622145,0.0008085302,0.0021161465,0.013862205,0.031173518,0.0005128342,0.22450595,0.123503886,0.49748474],"study_design_scores_gemma":[0.00029138543,0.0001178837,0.039418288,0.00021812921,0.000022510674,0.00004916966,0.0000054086245,0.9164028,0.00010925047,0.025538383,0.017002508,0.00082426],"about_ca_topic_score_codex":0.000053896016,"about_ca_topic_score_gemma":0.0000043920572,"teacher_disagreement_score":0.8852293,"about_ca_system_score_codex":0.000077573975,"about_ca_system_score_gemma":0.00017982778,"threshold_uncertainty_score":0.999748},"labels":[],"label_agreement":null},{"id":"W1663218918","doi":"10.1145/2698587","title":"Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Alice and Bob; Hamming distance; Communication complexity; Bounding overwatch; Upper and lower bounds; Mathematics; Quantum information science; Quantum; Discrete mathematics; Combinatorics; Computer science; Quantum entanglement; Quantum mechanics; Physics","score_opus":0.04861793686885723,"score_gpt":0.27317143251948756,"score_spread":0.22455349565063032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1663218918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057703864,0.00008686473,0.9390102,0.0023247825,0.00026660558,0.0002223642,0.0000082671295,0.00012299977,0.00025407097],"genre_scores_gemma":[0.9730549,0.0000065877744,0.02650168,0.00033982864,0.00001538772,0.000016288655,0.0000034770705,0.000011984398,0.000049864786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984652,0.00046477673,0.00030212084,0.00029415317,0.0003015385,0.00017223191],"domain_scores_gemma":[0.9973561,0.0013615048,0.00018341861,0.0008627623,0.00015090781,0.00008530149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093384966,0.00016597899,0.00017759165,0.000113758324,0.00041753176,0.0001242111,0.0008191528,0.000049789614,0.0000047313097],"category_scores_gemma":[0.00010023524,0.00012526115,0.000062469546,0.00032423908,0.0004314297,0.00013125196,0.000040348197,0.00029067215,0.000011126076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012649197,0.00045542506,0.000010180675,0.000046693363,0.000059692306,0.0000035485468,0.0071820645,0.2398942,0.000058555634,0.54650944,0.0001436114,0.20551011],"study_design_scores_gemma":[0.00029079363,0.0003224803,0.00023667257,0.000078177036,0.000008823664,0.000014409975,0.00011748991,0.5691168,0.00012895324,0.42927012,0.00029525117,0.00012007985],"about_ca_topic_score_codex":0.0000132941095,"about_ca_topic_score_gemma":0.000007894706,"teacher_disagreement_score":0.91535103,"about_ca_system_score_codex":0.000035394314,"about_ca_system_score_gemma":0.00006609286,"threshold_uncertainty_score":0.5108002},"labels":[],"label_agreement":null},{"id":"W1670210972","doi":"10.5555/2011827.2011829","title":"Connections between relative entropy of entanglement and geometric measure of entanglement","year":2004,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Multipartite entanglement; Squashed entanglement; Kullback–Leibler divergence; W state; Bipartite graph; Multipartite; Upper and lower bounds; Mathematics; Entanglement distillation; Entropy (arrow of time); Entanglement witness; Quantum discord; Measure (data warehouse); Quantum mechanics; Statistical physics; Physics; Combinatorics; Quantum; Statistics; Mathematical analysis; Computer science","score_opus":0.013079892170841798,"score_gpt":0.24334480686108073,"score_spread":0.23026491469023894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1670210972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37738684,0.00009043474,0.62176263,0.00041125133,0.000079456615,0.00015555734,0.000010710808,0.00003284548,0.00007026449],"genre_scores_gemma":[0.9767718,0.00002785298,0.023092916,0.000054261636,0.000017223674,0.0000042331503,0.000027905273,0.0000028421928,0.0000010144017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884194,0.000044520657,0.00053053943,0.00012989361,0.00032219972,0.0001309116],"domain_scores_gemma":[0.9991131,0.00011092291,0.00041446372,0.00011076933,0.00018521893,0.00006551799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003051086,0.00011575264,0.00019077041,0.00040569378,0.00012738192,0.000056137877,0.00011856717,0.00004341748,0.000001981155],"category_scores_gemma":[0.000040532108,0.00010575626,0.000040702012,0.00057908276,0.00005649339,0.00069743337,0.000099407975,0.00009389524,0.0000023096686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017544004,0.00010580673,0.0037442304,0.00017813579,0.00011405248,7.9013336e-7,0.010796907,0.031364486,0.00019665151,0.63206464,0.00004008241,0.32137665],"study_design_scores_gemma":[0.004766344,0.0017704967,0.10173537,0.00030494021,0.00007885246,0.000043789445,0.0014225655,0.7949619,0.0060109263,0.08728035,0.0011105947,0.0005138491],"about_ca_topic_score_codex":0.00006197182,"about_ca_topic_score_gemma":0.0000016050216,"teacher_disagreement_score":0.7635974,"about_ca_system_score_codex":0.0000404475,"about_ca_system_score_gemma":0.000052115513,"threshold_uncertainty_score":0.43126154},"labels":[],"label_agreement":null},{"id":"W1677920491","doi":"10.26421/qic8.3-4-1","title":"Accuracy threshold for postselected quantum computation","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Postselection; Mathematical proof; Quantum computer; Quantum error correction; Algorithm; Noise (video); Discrete mathematics; Computation; Mathematics; Code (set theory); Computer science; Quantum; Quantum mechanics; Quantum entanglement; Physics","score_opus":0.018135723265800315,"score_gpt":0.26221481266514446,"score_spread":0.24407908939934414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1677920491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27075076,0.00007630288,0.72710115,0.0007666433,0.00036009573,0.00041270768,0.0000069204157,0.0004000584,0.00012537059],"genre_scores_gemma":[0.95724857,0.00003398719,0.04162061,0.00079221575,0.00007945917,0.000025669868,0.00018087911,0.000011291702,0.0000073049864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836487,0.00005129359,0.0006025363,0.00028437126,0.0003568096,0.00034010623],"domain_scores_gemma":[0.9986113,0.00029051065,0.00037474034,0.00019050286,0.00040410444,0.00012886385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002915878,0.0002387716,0.00023881649,0.00031999644,0.00071183156,0.0003108804,0.00029818658,0.00010130119,0.0000018492053],"category_scores_gemma":[0.000091343034,0.00022709856,0.000084321044,0.00052998454,0.00006528666,0.001937723,0.00010553379,0.00017482077,0.000032596356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014816485,0.00016222103,0.0006196237,0.00020987583,0.000073053656,0.0000058866076,0.009025979,0.13766629,0.00020323362,0.24448939,0.0071749846,0.6002213],"study_design_scores_gemma":[0.0011337936,0.00033811008,0.009398575,0.000024353203,0.000006226505,0.00011756109,0.000057341178,0.97174466,0.00009561635,0.015081523,0.0017089499,0.00029327974],"about_ca_topic_score_codex":0.00001908708,"about_ca_topic_score_gemma":7.3723766e-7,"teacher_disagreement_score":0.8340784,"about_ca_system_score_codex":0.000043008054,"about_ca_system_score_gemma":0.00013031586,"threshold_uncertainty_score":0.926081},"labels":[],"label_agreement":null},{"id":"W1678454200","doi":"10.26421/qic6.2-3","title":"The computational power of the W and GHZ states","year":2006,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multipartite; Impossibility; State (computer science); Mathematical proof; Quantum entanglement; Context (archaeology); Quantum state; LOCC; Quantum computer; Cluster state; Mathematics; Power (physics); Symmetry (geometry); Quantum; Discrete mathematics; Computer science; Quantum mechanics; Physics; Algorithm; Law","score_opus":0.0038002727032816737,"score_gpt":0.2064399048298038,"score_spread":0.2026396321265221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1678454200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46442515,0.00013491485,0.5326807,0.0021975015,0.00019110882,0.00012080015,0.0000035799046,0.00004714578,0.00019909747],"genre_scores_gemma":[0.9937093,0.0000097931215,0.006001382,0.00024310971,0.000013753189,0.0000024965002,0.000009459208,0.0000022589777,0.000008420762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918294,0.000053953256,0.00031923412,0.000087518114,0.00024011568,0.0001162174],"domain_scores_gemma":[0.9992936,0.00022544488,0.0002195204,0.000114904,0.00012256413,0.000023963856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025123404,0.000086317435,0.00007711608,0.00005217751,0.00044305538,0.00026250267,0.00019478054,0.000026534772,5.034191e-7],"category_scores_gemma":[0.000016385919,0.000050215876,0.000028277589,0.00021418177,0.00011657818,0.00041619953,0.0001320047,0.00008504403,0.000002362028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008792096,0.000021963711,0.00087725313,0.000030955387,0.000012500901,2.315224e-7,0.0027626024,0.38519773,0.000011849977,0.46443617,0.0012913706,0.14534856],"study_design_scores_gemma":[0.00019104416,0.00003411878,0.051028207,0.000011557391,0.0000017846719,0.000016491496,0.00010498901,0.86190194,0.000022995264,0.08480712,0.0018190275,0.00006074023],"about_ca_topic_score_codex":0.000042824428,"about_ca_topic_score_gemma":0.000003105699,"teacher_disagreement_score":0.5292842,"about_ca_system_score_codex":0.000007957202,"about_ca_system_score_gemma":0.000033826058,"threshold_uncertainty_score":0.34076688},"labels":[],"label_agreement":null},{"id":"W1694870297","doi":"10.26421/qic15.7-8-9","title":"Solution to time-energy costs of quantum channels","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Hong Kong Polytechnic University; National Science Foundation","keywords":"Semidefinite programming; Channel (broadcasting); Energy (signal processing); Quantum; Quantum capacity; Mathematics; Energy cost; Upper and lower bounds; Amplitude damping channel; Class (philosophy); Quantum mechanics; Quantum operation; Physics; Computer science; Mathematical optimization; Mathematical analysis; Telecommunications; Open quantum system","score_opus":0.013891984745470591,"score_gpt":0.2420369850322335,"score_spread":0.2281450002867629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1694870297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0674832,0.000045819797,0.9301953,0.0010898743,0.00048741105,0.0001265453,0.0000036851252,0.00016376049,0.00040445232],"genre_scores_gemma":[0.9824988,0.000004507848,0.016762834,0.00061421527,0.0000548676,0.000007151624,0.000036936093,0.0000053487283,0.000015328642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874854,0.000073253395,0.00044266606,0.000164484,0.00036394925,0.00020709285],"domain_scores_gemma":[0.99900335,0.000061031576,0.00023075042,0.0001753891,0.00032892637,0.00020052404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000417323,0.00014286218,0.00018331526,0.00032142104,0.00010875058,0.0001787953,0.0002513764,0.000062385414,0.0000014510836],"category_scores_gemma":[0.0000614372,0.00013450847,0.00003758988,0.00051479664,0.00002989959,0.0010018781,0.00017198209,0.000074323834,0.00006808619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037791415,0.000053980555,0.000023127996,0.00003167864,0.000016723103,0.0000012745247,0.005523537,0.18398376,0.000157071,0.30706435,0.0054041,0.49770263],"study_design_scores_gemma":[0.00040875163,0.00031945886,0.00020569151,0.000040834224,0.0000029813762,0.000022577819,0.00008906466,0.98504895,0.0002370152,0.010622628,0.0028380745,0.00016397166],"about_ca_topic_score_codex":0.00011675268,"about_ca_topic_score_gemma":0.0000010642066,"teacher_disagreement_score":0.91501564,"about_ca_system_score_codex":0.000048978436,"about_ca_system_score_gemma":0.00008842732,"threshold_uncertainty_score":0.54850966},"labels":[],"label_agreement":null},{"id":"W1703581136","doi":"10.1007/s11128-011-0235-0","title":"Investigating the performance of an adiabatic quantum optimization processor","year":2011,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"University of California Berkeley","keywords":"Adiabatic process; Adiabatic quantum computation; Quantum computer; Qubit; Quadratic unconstrained binary optimization; Quantum annealing; Statistical physics; Quantum; Physics; Computer science; Computation; Quantum mechanics; Algorithm","score_opus":0.017925188947874527,"score_gpt":0.22615255130429782,"score_spread":0.20822736235642328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1703581136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5295935,0.000048432317,0.46927696,0.000112391426,0.00013734149,0.0001784252,0.0000012416441,0.00020567674,0.0004459885],"genre_scores_gemma":[0.8765975,0.0000047809026,0.12302148,0.0003012109,0.000035049772,0.00001746104,0.000009828458,0.000009361367,0.0000032732046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831975,0.0000698821,0.0006881829,0.00019090911,0.00042210106,0.00030918303],"domain_scores_gemma":[0.9983705,0.000045991404,0.000727214,0.0004101952,0.00035165608,0.000094386975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007292599,0.00019116452,0.00018237358,0.0001945976,0.0005368054,0.0002634424,0.0010057138,0.000069829715,0.0000074054324],"category_scores_gemma":[0.00012965163,0.00013467378,0.000041403593,0.00088411913,0.00013330155,0.0051753954,0.00014164299,0.00023422918,0.000010288593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016132679,0.00012223735,0.0008779205,0.0011206109,0.00002035442,8.9161483e-7,0.078372106,0.4746243,0.0001704243,0.026290804,0.00003091675,0.4183533],"study_design_scores_gemma":[0.00018406512,0.00019833414,0.00125318,0.0001853681,0.0000074470327,0.000028289836,0.00041110895,0.9935698,0.002272656,0.001650533,0.00004640542,0.00019281002],"about_ca_topic_score_codex":0.000021383305,"about_ca_topic_score_gemma":5.9166535e-7,"teacher_disagreement_score":0.5189455,"about_ca_system_score_codex":0.000019813822,"about_ca_system_score_gemma":0.00023574207,"threshold_uncertainty_score":0.5491838},"labels":[],"label_agreement":null},{"id":"W1704036930","doi":"10.1139/cjp-2013-0101","title":"Adiabatic quantum algorithms","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Adiabatic process; Physics; Adiabatic quantum computation; Bounded function; Quantum; Quantum computer; Algorithm; Quantum algorithm; Space (punctuation); Quantum mechanics; Theoretical physics; Computer science; Mathematics; Mathematical analysis","score_opus":0.010414055519160458,"score_gpt":0.2043374300165668,"score_spread":0.19392337449740632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1704036930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1821119,0.0004088615,0.8132096,0.0020591086,0.0016370575,0.00010097967,0.0000031203126,0.000025658783,0.00044371883],"genre_scores_gemma":[0.9611056,0.0000024005117,0.037763607,0.0005274716,0.00052853924,0.0000011277257,4.7554457e-7,0.000012561673,0.000058217498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900275,0.000044618057,0.0002637787,0.00013016857,0.00018727651,0.00037142815],"domain_scores_gemma":[0.9985433,0.00008148657,0.00018635589,0.00027163437,0.00024595798,0.00067126245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001524439,0.00012379518,0.00019184942,0.00013220652,0.00014844887,0.00027045907,0.0008959932,0.00003788161,0.000038168848],"category_scores_gemma":[0.00004859091,0.00010423437,0.000119936696,0.0003464468,0.00005768174,0.00042301515,0.00003016526,0.0002997623,0.000092878785],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.978976e-7,0.0000388729,0.00042909963,0.000022602877,0.00008290907,0.00025649415,0.0027230515,0.011721585,0.00026212898,0.15995839,0.02427424,0.80023],"study_design_scores_gemma":[0.00026933785,0.00019274194,0.0022389614,0.000075019576,0.000008907211,0.00024046068,0.00003607149,0.7074793,0.00026973832,0.2858853,0.0030538922,0.0002502773],"about_ca_topic_score_codex":0.0018953865,"about_ca_topic_score_gemma":0.00016691892,"teacher_disagreement_score":0.79997975,"about_ca_system_score_codex":0.000056648434,"about_ca_system_score_gemma":0.00085359026,"threshold_uncertainty_score":0.42505544},"labels":[],"label_agreement":null},{"id":"W1731114062","doi":"10.1103/physrevlett.115.070501","title":"Estimating Outcome Probabilities of Quantum Circuits Using Quasiprobabilities","year":2015,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":214,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Australian Research Council","keywords":"Estimator; Negativity effect; Statistical physics; Measure (data warehouse); Quantum; Computer science; Mathematics; Statistics; Applied mathematics; Physics; Quantum mechanics","score_opus":0.06257481915720077,"score_gpt":0.32168520532723377,"score_spread":0.259110386170033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1731114062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63764924,0.0019407495,0.35648313,0.0030384425,0.00036762617,0.00032740433,0.000002525794,0.00014502558,0.000045878234],"genre_scores_gemma":[0.896772,0.000012552587,0.100254185,0.002661664,0.0002618653,0.000015688618,0.0000013165431,0.000018131796,0.000002536422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799883,0.00020408935,0.00053294597,0.00041060077,0.00049821776,0.00035529147],"domain_scores_gemma":[0.998563,0.00026434677,0.00026286408,0.00064179144,0.0001238356,0.0001441771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006491546,0.00022925063,0.00061951287,0.00005291409,0.000074639465,0.000055625776,0.0007581666,0.000010963583,0.0000011465843],"category_scores_gemma":[0.00045452674,0.00018070209,0.00022015648,0.00040134607,0.00017133345,0.00026955898,0.00027648103,0.00020631029,0.00001070832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009365198,0.0011469435,0.005727713,0.026978062,0.00021040079,0.00006110505,0.019078659,0.5614455,0.010080365,0.24007504,0.0023299807,0.13285686],"study_design_scores_gemma":[0.00012262027,0.00007250049,0.00009602502,0.0012692477,0.000020525235,0.000018059714,0.000016599608,0.9841554,0.000091740556,0.01374045,0.00016556209,0.0002312287],"about_ca_topic_score_codex":0.000042439053,"about_ca_topic_score_gemma":2.3208227e-7,"teacher_disagreement_score":0.42270994,"about_ca_system_score_codex":0.00006206559,"about_ca_system_score_gemma":0.00008351784,"threshold_uncertainty_score":0.73688173},"labels":[],"label_agreement":null},{"id":"W1740742278","doi":"10.1002/9781118742631.ch08","title":"Few‐Qubit Magnetic Resonance Quantum Information Processors: Simulating Chemistry and Physics","year":2014,"lang":"en","type":"other","venue":"Advances in chemical physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum information processing; Quantum; Qubit; Electron paramagnetic resonance; Spin (aerodynamics); Physics; Quantum computer; Resonance (particle physics); Quantum simulator; Quantum chemistry; Chemistry; Nanotechnology; Quantum mechanics; Materials science; Molecule","score_opus":0.004074468237002294,"score_gpt":0.22848115383292134,"score_spread":0.22440668559591903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1740742278","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020835467,0.023655713,0.87735367,0.00024510673,0.0006598267,0.00076164573,0.00004790343,0.0012294264,0.09396317],"genre_scores_gemma":[0.2458527,0.005785962,0.7111799,0.0035510382,0.013213467,0.00035063946,0.000495159,0.0017326594,0.017838458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840826,0.000021513022,0.00033416296,0.0005109335,0.0003372183,0.00038789192],"domain_scores_gemma":[0.9989119,0.00015835004,0.00031879055,0.00048808657,0.000042530944,0.000080344216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008476096,0.00037683774,0.00041209176,0.000019635541,0.000049144528,0.00011209498,0.000689924,0.0001976229,0.000006083198],"category_scores_gemma":[0.00007359349,0.0003651816,0.000057788777,0.00038623734,0.00013748402,0.00046487767,0.0003642089,0.0005447447,0.00001682663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046170217,0.0000499519,0.000052524963,0.00080000743,0.000004284464,0.00000254116,0.00027829342,0.0044535124,0.00021394418,0.002281115,0.0013704794,0.9904887],"study_design_scores_gemma":[0.0004193718,0.000027369482,0.0000066947778,0.00082846405,0.000005217152,0.0000041981184,0.0000056400213,0.77089226,0.0012766148,0.039451372,0.18655206,0.00053072505],"about_ca_topic_score_codex":0.000010539133,"about_ca_topic_score_gemma":7.8092324e-7,"teacher_disagreement_score":0.989958,"about_ca_system_score_codex":0.000033368044,"about_ca_system_score_gemma":0.000041519997,"threshold_uncertainty_score":0.99988},"labels":[],"label_agreement":null},{"id":"W1741741009","doi":"10.1007/978-3-642-18073-6_8","title":"Simulating Sparse Hamiltonians with Star Decompositions","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Star (game theory); Astrophysics; Physics","score_opus":0.016218962655768065,"score_gpt":0.23186709502671327,"score_spread":0.2156481323709452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1741741009","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095592765,0.00023228646,0.9930693,0.000449438,0.00090134866,0.0004011434,0.000008788245,0.0003990166,0.0035827798],"genre_scores_gemma":[0.19522396,0.000012892202,0.80309343,0.0009797123,0.00042152763,0.0000062555846,0.0000055626588,0.000063414125,0.00019326076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954632,0.000046938425,0.0005744073,0.0019259698,0.0009861861,0.0010032991],"domain_scores_gemma":[0.9967765,0.00048405552,0.00037102817,0.0018003534,0.00027294486,0.00029508883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005865245,0.0007701975,0.0006536376,0.00091045763,0.00063903636,0.0006070103,0.0034677961,0.00028808782,0.000027542563],"category_scores_gemma":[0.00003150963,0.0006301088,0.00015833908,0.00077618606,0.0008081396,0.00046696907,0.0013975711,0.0013046274,0.00005070219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010100023,0.000060061888,0.000060224484,0.000037604645,0.000029457953,0.00038985253,0.0020290792,0.42707527,0.00006493488,0.01721233,0.000008489157,0.5530226],"study_design_scores_gemma":[0.00030571793,0.00040446882,0.00017644429,0.00066033803,0.000013293286,0.00025319392,1.4133755e-7,0.899168,0.0003422958,0.09697495,0.00081383524,0.0008873159],"about_ca_topic_score_codex":0.00006017954,"about_ca_topic_score_gemma":0.00012789186,"teacher_disagreement_score":0.5521353,"about_ca_system_score_codex":0.00020259415,"about_ca_system_score_gemma":0.00063103286,"threshold_uncertainty_score":0.999615},"labels":[],"label_agreement":null},{"id":"W1757785549","doi":"10.1007/s11128-015-1229-0","title":"Quantum computation with coherent spin states and the close Hadamard problem","year":2016,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Calgary","funders":"","keywords":"Quantum computer; Hadamard transform; Hilbert space; Parameterized complexity; Quantum algorithm; Unitary state; Spin (aerodynamics); Computation; Quantum operation; Unitary operator","score_opus":0.005942515381738166,"score_gpt":0.22375024196509075,"score_spread":0.21780772658335257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1757785549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13042976,0.00014336254,0.8624595,0.006045041,0.00009415042,0.00034279836,0.0000031080815,0.00026468863,0.00021763425],"genre_scores_gemma":[0.9656997,0.000034551682,0.03354048,0.000616948,0.000041858235,0.00003199986,0.000007723221,0.000010396382,0.000016396207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845064,0.000090731075,0.00047625866,0.00023277829,0.00042821278,0.00032136447],"domain_scores_gemma":[0.99883157,0.00019311656,0.00042675182,0.0002267301,0.00023727547,0.00008454684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066027953,0.00021407584,0.00020988983,0.00013122165,0.00049757236,0.0007845762,0.00039043414,0.000048660564,0.0000020567943],"category_scores_gemma":[0.000037771464,0.00009840079,0.000034605855,0.0003627068,0.00023665217,0.002276903,0.00016359294,0.00015285473,0.0000256192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095466974,0.000023414324,0.00017510484,0.00016779316,0.000018879835,0.0000019617623,0.006443759,0.0030873124,0.000038048987,0.13883673,0.00028797748,0.8508236],"study_design_scores_gemma":[0.0019019084,0.00014880834,0.0008103851,0.00033467865,0.000008231996,0.00006963824,0.00017510004,0.9529888,0.00013921766,0.040620085,0.0025743425,0.0002287843],"about_ca_topic_score_codex":0.000030452793,"about_ca_topic_score_gemma":0.0000034554528,"teacher_disagreement_score":0.9499015,"about_ca_system_score_codex":0.00004497212,"about_ca_system_score_gemma":0.00013011893,"threshold_uncertainty_score":0.7565686},"labels":[],"label_agreement":null},{"id":"W1763515295","doi":"10.1103/physreva.95.022309","title":"Classical simulation of quantum error correction in a Fibonacci anyon code","year":2017,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Army Research Office; Australian Research Council; European Research Council; Government of Canada","keywords":"Fibonacci number; Anyon; Code (set theory); Quantum; Computer science; Parallel computing; Physics; Quantum mechanics; Mathematics; Programming language; Discrete mathematics; Topological quantum computer","score_opus":0.028498467848639235,"score_gpt":0.38887200865991617,"score_spread":0.3603735408112769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763515295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6920295,0.03670198,0.25147775,0.013102226,0.0017021993,0.0032105152,0.000030673342,0.00039465327,0.0013505387],"genre_scores_gemma":[0.9877959,0.010023184,0.00080317765,0.00077993405,0.00045849296,0.00006828296,0.000008823468,0.000030121451,0.000032073498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964844,0.00043023514,0.0008191252,0.00091643917,0.0007993798,0.0005504304],"domain_scores_gemma":[0.9960921,0.0007826489,0.0008778268,0.0018091792,0.0002054822,0.0002328022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067171,0.0004506551,0.0015842336,0.00007650009,0.0002504425,0.00010770985,0.0016958605,0.000057659843,0.0000058880955],"category_scores_gemma":[0.0018817137,0.0003513022,0.00068582484,0.00060079456,0.00019503549,0.0005282967,0.00060936855,0.00071466184,0.00010246225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005293554,0.0034092432,0.0010417326,0.012712279,0.00008831293,0.00005643644,0.0004536739,0.011250857,0.0076207253,0.045867946,0.0045382893,0.91290754],"study_design_scores_gemma":[0.00029540862,0.00025915127,0.0060652234,0.012279559,0.00006828868,0.0000059285408,0.0000012815397,0.95369947,0.00089937117,0.018339895,0.0077029713,0.00038345892],"about_ca_topic_score_codex":0.00004368463,"about_ca_topic_score_gemma":0.0000133043195,"teacher_disagreement_score":0.9424486,"about_ca_system_score_codex":0.00007587934,"about_ca_system_score_gemma":0.00011337391,"threshold_uncertainty_score":0.9998939},"labels":[],"label_agreement":null},{"id":"W1765368959","doi":"10.1007/978-3-319-08494-7_10","title":"Templates for Positive and Negative Control Toffoli Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Toffoli gate; Template; Computer science; Cube (algebra); Reduction (mathematics); Set (abstract data type); Arithmetic; Quantum gate; Electronic circuit; Quantum; Mathematics; Quantum computer; Combinatorics; Physics; Programming language; Quantum mechanics","score_opus":0.007475433881132365,"score_gpt":0.2234471548471578,"score_spread":0.21597172096602543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765368959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007761173,0.0005917825,0.99513096,0.0016451166,0.0012905403,0.0007635143,0.000017256256,0.00015841695,0.0003248241],"genre_scores_gemma":[0.5061062,0.000035405505,0.4886045,0.003594425,0.0014131285,0.00002383604,0.000007196885,0.000060488772,0.00015480196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964867,0.00005817761,0.00046870505,0.0016828062,0.0004947733,0.0008087934],"domain_scores_gemma":[0.995196,0.0031445676,0.00033451273,0.00080839137,0.00029207952,0.00022447304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091813493,0.0006348301,0.0007596873,0.000484692,0.0004977304,0.0006672747,0.0018610564,0.0003456735,0.0000026312337],"category_scores_gemma":[0.00016649392,0.00053487753,0.0001591539,0.0003101343,0.00096643454,0.0002191135,0.0008175034,0.00076820527,0.000003981516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013624673,0.000009656859,0.000012600701,0.00002405384,0.000024681367,0.000020037935,0.00047866674,0.18805249,0.000014631184,0.033852473,0.000022790702,0.7774743],"study_design_scores_gemma":[0.0005547856,0.00036865272,0.00010449318,0.00031874585,0.000011845052,0.000075052885,8.289114e-8,0.81882095,0.00011618743,0.17847084,0.0006219546,0.00053640973],"about_ca_topic_score_codex":0.000023007498,"about_ca_topic_score_gemma":0.00002850667,"teacher_disagreement_score":0.7769379,"about_ca_system_score_codex":0.000103738894,"about_ca_system_score_gemma":0.00020531089,"threshold_uncertainty_score":0.99971026},"labels":[],"label_agreement":null},{"id":"W1779245055","doi":"10.4230/lipics.ccc.2017.24","title":"Accessible versus Holevo Information for a Binary Random Variable","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Army Research Office; Ministry of Education, India; National Research Foundation","keywords":"Fidelity; Mutual information; Probabilistic logic; Binary number; Mathematics; Random variable; Quantum information; Encoding (memory); Quantum; Upper and lower bounds; Information theory; Variable (mathematics); Discrete mathematics; Combinatorics; Computer science; Quantum mechanics; Physics; Statistics; Artificial intelligence","score_opus":0.027621514503212773,"score_gpt":0.2661126739681694,"score_spread":0.23849115946495664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1779245055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25390947,0.00018459045,0.73878044,0.000720471,0.0037027523,0.00061134045,0.000036550726,0.00043478626,0.0016196243],"genre_scores_gemma":[0.6520284,0.000029011595,0.34438193,0.00070561806,0.0014443343,0.00033605212,0.00046705196,0.000051779076,0.00055583194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981,0.0000650227,0.0005054971,0.00054778066,0.00029531564,0.0004863922],"domain_scores_gemma":[0.9980306,0.00031718268,0.000393572,0.00097456464,0.00018818889,0.00009586669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000481216,0.00035422575,0.00040991794,0.0002458152,0.00030236004,0.00050792174,0.0016585796,0.00029179614,0.0000071685267],"category_scores_gemma":[0.00011136508,0.0003226775,0.00021340074,0.00036108532,0.00004064891,0.0006498096,0.0016847441,0.0005811289,0.000056208486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090537686,0.00041841296,0.009498709,0.0016432386,0.00041373583,0.000033354798,0.0020033822,0.79072446,0.00029318564,0.0077847503,0.043575447,0.14270592],"study_design_scores_gemma":[0.004125964,0.0001699202,0.0084128715,0.00020488525,0.000038263333,0.0000053053736,0.000006614789,0.9499726,0.00026291038,0.0045456123,0.03168329,0.00057173],"about_ca_topic_score_codex":0.00021498387,"about_ca_topic_score_gemma":0.0000036770182,"teacher_disagreement_score":0.3981189,"about_ca_system_score_codex":0.0000687672,"about_ca_system_score_gemma":0.00031687756,"threshold_uncertainty_score":0.9999225},"labels":[],"label_agreement":null},{"id":"W1784285531","doi":"10.1103/physrevlett.107.040501","title":"Computational Difficulty of Computing the Density of States","year":2011,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"National Science Foundation","keywords":"Degeneracy (biology); Complexity class; Quantum computer; Quantum complexity theory; Physics; Class (philosophy); Quantum; Statistical physics; Quantum mechanics; Ground state; Computational complexity theory; Computer science; Algorithm; Bioinformatics","score_opus":0.01853490460789385,"score_gpt":0.2602632369004464,"score_spread":0.24172833229255253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1784285531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7105022,0.0003768967,0.28712326,0.0017587654,0.0000587442,0.000121751,0.0000019968395,0.000029802177,0.000026587239],"genre_scores_gemma":[0.9730819,0.000052563817,0.023908162,0.002910118,0.000039628772,0.0000010472559,0.0000020405964,0.0000041885314,3.568342e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902093,0.00011968695,0.00026240328,0.00018697362,0.00026272432,0.00014726848],"domain_scores_gemma":[0.9990633,0.00030032842,0.00022783334,0.0002967799,0.00007608417,0.000035678386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021972883,0.00010665321,0.00029355675,0.000018390145,0.000061652325,0.0000075148737,0.000618524,0.000004417131,0.0000018206053],"category_scores_gemma":[0.000027587355,0.00006373417,0.00015614482,0.00026300235,0.00013652317,0.000048809277,0.00022621233,0.00012840965,0.0000045447828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032751268,0.0027317326,0.011536971,0.00811066,0.0006842754,0.000057249938,0.0479635,0.31361368,0.021297248,0.15876569,0.010676318,0.42452994],"study_design_scores_gemma":[0.00011624913,0.00005796155,0.05083758,0.0007169585,0.000024527262,0.000009092853,0.000007065879,0.9428661,0.0012209377,0.003908602,0.00009641253,0.00013855056],"about_ca_topic_score_codex":0.00002715394,"about_ca_topic_score_gemma":2.3722865e-7,"teacher_disagreement_score":0.6292524,"about_ca_system_score_codex":0.0000057824686,"about_ca_system_score_gemma":0.000014046734,"threshold_uncertainty_score":0.25990042},"labels":[],"label_agreement":null},{"id":"W1790537050","doi":"10.1111/j.1467-9876.2012.01040.x","title":"Testing Quantum States for Purity","year":2012,"lang":"en","type":"article","venue":"Journal of the Royal Statistical Society Series C (Applied Statistics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Mathematics; Statistic; Poisson distribution; Statistics; Quantum state; Deviance (statistics); Quantum; Statistical physics; Quantum mechanics; Physics","score_opus":0.013699039208075536,"score_gpt":0.24177908614887977,"score_spread":0.22808004694080425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1790537050","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003934114,0.00012765775,0.9931209,0.00079792325,0.0012214009,0.00023365204,0.00040227998,0.000050466082,0.00011162638],"genre_scores_gemma":[0.20653382,0.000005758081,0.7923787,0.00039701763,0.0005791061,0.000008036651,0.0000063402817,0.000024446172,0.00006675568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997554,0.00010187891,0.0007286756,0.00023312491,0.0006314131,0.0007509006],"domain_scores_gemma":[0.99599284,0.002396754,0.0006102037,0.00033735926,0.0003398429,0.0003230185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001131418,0.00027658412,0.0004411588,0.000023625304,0.000661605,0.0002426346,0.0010533124,0.00009356459,0.000017096609],"category_scores_gemma":[0.000729182,0.00018303569,0.00020393857,0.00026256742,0.00027296075,0.00018312814,0.00038291383,0.00057577516,0.000005431706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008768545,0.00032203243,0.00064267527,0.00021003826,0.00022144115,0.000007259207,0.0026957598,0.011488068,0.0002777802,0.8519638,0.07111445,0.060969003],"study_design_scores_gemma":[0.0008382476,0.00047444156,0.015261158,0.000055623328,0.00011184524,0.00009280096,0.00029133065,0.7004144,0.00025238606,0.26484653,0.016892213,0.00046901728],"about_ca_topic_score_codex":0.000015363288,"about_ca_topic_score_gemma":0.0000013046006,"teacher_disagreement_score":0.68892634,"about_ca_system_score_codex":0.0001002037,"about_ca_system_score_gemma":0.00015985064,"threshold_uncertainty_score":0.74639785},"labels":[],"label_agreement":null},{"id":"W1809542849","doi":"10.1023/a:1019821008131","title":"Quantum Codes for Simplifying Design and Suppressing Decoherence in Superconducting Phase-Qubits","year":2002,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; University of Toronto","funders":"","keywords":"Qubit; Quantum decoherence; Quantum computer; Quantum mechanics; Physics; Superconducting quantum computing; Flux qubit; Universality (dynamical systems); Computer science; Topology (electrical circuits); Mathematics; Quantum; Combinatorics","score_opus":0.04550544070340176,"score_gpt":0.2892446087665367,"score_spread":0.24373916806313492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809542849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22020523,0.00050215813,0.77805203,0.00046147496,0.00015321343,0.00034866287,0.0000031461614,0.00021671016,0.000057366935],"genre_scores_gemma":[0.8313186,0.000021077269,0.16822708,0.0003210229,0.000048315265,0.00003893058,0.000008036716,0.000012778136,0.0000041626167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980256,0.00008220887,0.0007048467,0.00035012182,0.00027402455,0.0005632189],"domain_scores_gemma":[0.9987844,0.00040017796,0.00030128576,0.00023841727,0.00016251612,0.000113191185],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008996767,0.0002618336,0.00029465964,0.00036313635,0.000656252,0.0011273585,0.00048658194,0.00010730177,0.000005462481],"category_scores_gemma":[0.00029449878,0.00024655796,0.000045389057,0.0005723308,0.00007037693,0.0047086044,0.00014509803,0.00027605533,0.0000073644774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001752932,0.00008314689,0.00011460653,0.00048110183,0.000008409673,0.000004449488,0.02078749,0.02620578,0.0014344883,0.00447322,0.00018044145,0.9462093],"study_design_scores_gemma":[0.0011237094,0.00012926923,0.000049719765,0.00032870204,0.0000050515578,0.00007610311,0.00057070743,0.98955023,0.0017519052,0.005314734,0.00076561497,0.00033425924],"about_ca_topic_score_codex":0.000012654255,"about_ca_topic_score_gemma":0.0000012309491,"teacher_disagreement_score":0.96334445,"about_ca_system_score_codex":0.00004609052,"about_ca_system_score_gemma":0.000063411884,"threshold_uncertainty_score":0.9999987},"labels":[],"label_agreement":null},{"id":"W1814335797","doi":"10.26421/qic9.5-6-11","title":"On parallel composition of zero-knowledge proofs with black-box quantum","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Soundness; Black box; Quantum algorithm; Computer science; Quantum information; Quantum error correction; Mathematical proof; Quantum computer; Quantum; Mathematics; Theoretical computer science; Discrete mathematics; Algorithm; Quantum mechanics; Physics; Programming language; Geometry","score_opus":0.008054922050868881,"score_gpt":0.2395742102757454,"score_spread":0.23151928822487652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814335797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2759803,0.000029050972,0.72222507,0.00060726557,0.00009089849,0.00022569105,0.0000025360443,0.00015393349,0.0006852262],"genre_scores_gemma":[0.9792202,0.000008838536,0.020225085,0.0004642693,0.000022833525,0.000004277433,0.000044415785,0.0000049809487,0.000005107805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987151,0.00007084296,0.00046731695,0.00020805636,0.0003221896,0.00021649635],"domain_scores_gemma":[0.9990384,0.00010301295,0.00033773683,0.00021381775,0.00021520357,0.000091852875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002316972,0.00020360359,0.00022681495,0.0002885112,0.0001848055,0.00018239551,0.00023978586,0.00006947642,0.000001384697],"category_scores_gemma":[0.0000122463425,0.0001633647,0.000047268306,0.00042884288,0.000069385474,0.00090251834,0.00004283557,0.00016990727,0.00002877549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008931385,0.00020819469,0.00004280513,0.000089846624,0.000019022304,0.0000021866856,0.005385803,0.24636017,0.00010549071,0.5445863,0.00055462995,0.20255622],"study_design_scores_gemma":[0.00089725445,0.0012722476,0.0057867398,0.00012489413,0.000006464447,0.000028878752,0.000050231323,0.94932806,0.00020252538,0.041924633,0.00016580944,0.00021226112],"about_ca_topic_score_codex":0.0000058112787,"about_ca_topic_score_gemma":4.1120987e-7,"teacher_disagreement_score":0.7032399,"about_ca_system_score_codex":0.000025649364,"about_ca_system_score_gemma":0.00006230772,"threshold_uncertainty_score":0.6661819},"labels":[],"label_agreement":null},{"id":"W1819959283","doi":"10.2168/lmcs-11(2:10)2015","title":"Generators and relations for n-qubit Clifford operators","year":2015,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clifford algebra; Clifford analysis; Algebra over a field; Mathematics; Operator (biology); Presentation (obstetrics); Computer science; Pure mathematics; Dirac operator; Chemistry","score_opus":0.07838646274783868,"score_gpt":0.38487381166368845,"score_spread":0.3064873489158498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1819959283","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05336129,0.00013379658,0.9437238,0.0010839457,0.0011952181,0.0002496012,9.777249e-7,0.00013371896,0.00011765459],"genre_scores_gemma":[0.061017513,0.0000024681365,0.9379702,0.00079412956,0.0001782524,0.00002061251,3.225238e-7,0.0000058965084,0.00001061503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976856,0.00027683508,0.00033913035,0.0008698633,0.00032483978,0.0005037042],"domain_scores_gemma":[0.9982746,0.00064544403,0.000075060525,0.00047698308,0.00016731769,0.00036059797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004184337,0.00018133299,0.00025836998,0.00026015862,0.0003191087,0.00045068577,0.001313836,0.00008099837,0.0000010428392],"category_scores_gemma":[0.00049752166,0.00013712166,0.00004901918,0.0014953415,0.00039470644,0.0004387871,0.0009903471,0.00023686264,0.0000034007044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043258187,0.00006155273,0.0012570199,0.000005508764,0.0000029641128,0.000010105418,0.0009661687,0.031024816,0.00044672162,0.09094933,0.00015394788,0.87511754],"study_design_scores_gemma":[0.00033396875,0.0002495949,0.0024719157,0.000013711482,0.0000014314315,0.00003483442,0.000006089864,0.9224094,0.00058310054,0.07225288,0.0014422595,0.00020082302],"about_ca_topic_score_codex":0.000007781769,"about_ca_topic_score_gemma":0.0000015389384,"teacher_disagreement_score":0.8913846,"about_ca_system_score_codex":0.000062363055,"about_ca_system_score_gemma":0.00020277532,"threshold_uncertainty_score":0.55916595},"labels":[],"label_agreement":null},{"id":"W1828206716","doi":"10.1139/cjp-2015-0490","title":"Householder methods for quantum circuit design","year":2015,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Controlled NOT gate; Qubit; Quantum gate; Quantum circuit; Unitary state; Physics; Quantum computer; Topology (electrical circuits); Quantum; Factorization; Cascade; Tensor product; Complement (music); Algorithm; Quantum error correction; Quantum mechanics; Computer science; Pure mathematics; Mathematics; Combinatorics","score_opus":0.10935409372404849,"score_gpt":0.30969687624893216,"score_spread":0.2003427825248837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828206716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013679959,0.00040364172,0.9962931,0.00050936063,0.0012530645,0.00008773579,0.000002785489,0.000019022307,0.00006328256],"genre_scores_gemma":[0.18224372,0.0000013175766,0.8164338,0.0004536767,0.0008062146,0.0000017438084,4.0151974e-7,0.000020464642,0.0000387017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990115,0.00014362868,0.00023600564,0.00014037716,0.00013063719,0.00033781352],"domain_scores_gemma":[0.99823415,0.00020840741,0.00019405344,0.00024895248,0.00034010824,0.0007743179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010872397,0.000116690295,0.00021282674,0.00011499921,0.0001196046,0.00017013522,0.0008221643,0.000043660675,9.4831336e-7],"category_scores_gemma":[0.00016351092,0.000101615944,0.0001259038,0.0002745184,0.000042630298,0.00021418989,0.000021602556,0.00020395532,0.0000029280066],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005159831,0.000020188647,0.000044725537,0.000014172062,0.00006811396,0.000075075826,0.004094362,0.08428621,0.00027471417,0.09844704,0.019148761,0.79352146],"study_design_scores_gemma":[0.0005239373,0.0003782945,0.000063917,0.00004000674,0.000016877477,0.00018202743,0.00004081775,0.6183498,0.0015773899,0.35074922,0.027862288,0.00021540174],"about_ca_topic_score_codex":0.00023068055,"about_ca_topic_score_gemma":0.000040721847,"teacher_disagreement_score":0.79330605,"about_ca_system_score_codex":0.0001179898,"about_ca_system_score_gemma":0.0027148596,"threshold_uncertainty_score":0.48160443},"labels":[],"label_agreement":null},{"id":"W1828273628","doi":"10.5555/2012098.2012105","title":"Quantum universality by state distillation","year":2009,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Universality (dynamical systems); Upper and lower bounds; Mathematics; Quantum; Quantum computer; Statistical physics; Quantum mechanics; Topology (electrical circuits); Discrete mathematics; Physics; Combinatorics; Mathematical analysis","score_opus":0.005865002227142488,"score_gpt":0.21811567065623524,"score_spread":0.21225066842909276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828273628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11733246,0.00003093505,0.8769614,0.0030740504,0.00011716513,0.00004444714,0.0000022315962,0.00032208578,0.002115202],"genre_scores_gemma":[0.9835467,0.000003387185,0.015494848,0.0004871301,0.000022779806,1.3395831e-7,0.0000029231853,0.0000021693936,0.00043995076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929994,0.000035560508,0.000104084655,0.00023447677,0.00014708236,0.00017882447],"domain_scores_gemma":[0.99956816,0.000031300657,0.00003878049,0.00026621495,0.000026965634,0.00006855197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011717011,0.00008223165,0.0000766795,0.00003188101,0.000095466974,0.000092711794,0.0003412542,0.00001999634,0.0000065161903],"category_scores_gemma":[0.000007975333,0.000066681394,0.000031994976,0.00020843717,0.000014694097,0.000155627,0.000051663887,0.00007817762,0.000019508072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049183686,0.00008347908,0.00018801913,0.000003181713,0.0000072266025,0.000012598828,0.000616173,0.0038741007,0.0012103161,0.1572584,0.012243992,0.8244976],"study_design_scores_gemma":[0.000120704484,0.00008252507,0.006366268,0.0000036834622,7.833791e-7,0.0000043950063,0.000003810049,0.9566718,0.00039840332,0.028133716,0.008090682,0.00012328094],"about_ca_topic_score_codex":0.00003364457,"about_ca_topic_score_gemma":0.0000012653475,"teacher_disagreement_score":0.95279765,"about_ca_system_score_codex":0.000016647697,"about_ca_system_score_gemma":0.000017487302,"threshold_uncertainty_score":0.27191883},"labels":[],"label_agreement":null},{"id":"W1828782323","doi":"10.1103/physrevlett.112.010505","title":"Using Concatenated Quantum Codes for Universal Fault-Tolerant Quantum Gates","year":2014,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Computer science; Concatenation (mathematics); Qubit; Quantum computer; Concatenated error correction code; Fault tolerance; Algorithm; Quantum; Theoretical computer science; Block code; Mathematics; Quantum mechanics; Physics; Distributed computing; Arithmetic; Decoding methods","score_opus":0.024119089130849553,"score_gpt":0.2920399755091644,"score_spread":0.26792088637831485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828782323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24979228,0.0012251451,0.7339286,0.013976819,0.00035156368,0.00044924603,0.000007654036,0.00025217634,0.000016509093],"genre_scores_gemma":[0.9588435,0.0002648931,0.021222198,0.019147813,0.0004441598,0.000019479967,0.000017618278,0.000036733236,0.0000036014853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809366,0.00020971482,0.00030858547,0.000572857,0.0002900111,0.0005251407],"domain_scores_gemma":[0.9985408,0.00051641493,0.00019556591,0.00050762616,0.000086270986,0.00015331632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003817272,0.00029646044,0.00060344156,0.00005827623,0.00023002097,0.000111546564,0.0008665779,0.000018222343,0.0000018870643],"category_scores_gemma":[0.000105732455,0.00023108446,0.0002977313,0.00037396193,0.00011385188,0.00018608214,0.00018138379,0.00022549977,0.00002456517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069444075,0.00091549434,0.00014018753,0.006963029,0.0004780823,0.000088966844,0.0025655373,0.1686036,0.169878,0.50389767,0.022536736,0.12386322],"study_design_scores_gemma":[0.00033375082,0.00009564668,0.00004744228,0.00091228925,0.000044150573,0.0000123629625,0.000003684568,0.97907597,0.0004542398,0.00276897,0.015919259,0.00033225448],"about_ca_topic_score_codex":0.000041812018,"about_ca_topic_score_gemma":4.9365116e-7,"teacher_disagreement_score":0.81047237,"about_ca_system_score_codex":0.000041597777,"about_ca_system_score_gemma":0.00003052986,"threshold_uncertainty_score":0.94233507},"labels":[],"label_agreement":null},{"id":"W1829441069","doi":"10.1007/11785293_27","title":"Improved Algorithms for Quantum Identification of Boolean Oracles","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Oracle; Upper and lower bounds; Computer science; Set (abstract data type); Matching (statistics); Algorithm; Range (aeronautics); Identification (biology); Combinatorics; Constant (computer programming); Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.014754574944311446,"score_gpt":0.25277256280066396,"score_spread":0.2380179878563525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829441069","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026753385,0.00037753282,0.9956863,0.00059796945,0.001993367,0.000705938,0.000037928512,0.00019112034,0.00014229256],"genre_scores_gemma":[0.16787733,0.000022117618,0.82997656,0.0003641956,0.001073537,0.00002675757,0.00003508263,0.00008652959,0.00053789746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956946,0.00003307933,0.0010872715,0.0016842985,0.00079232914,0.00070844416],"domain_scores_gemma":[0.99641836,0.0005563958,0.000873129,0.0015333503,0.0004918564,0.00012691923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013026687,0.0005792603,0.0007059537,0.00091273617,0.0003009499,0.00042631596,0.0034189299,0.00033496832,0.0000024103435],"category_scores_gemma":[0.000108233726,0.00052974856,0.00027969148,0.0005962362,0.0006523044,0.00035252326,0.0008587568,0.0005821298,0.000004998249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008341833,0.00006225059,0.0000071756585,0.00013559987,0.00001782989,0.000011578802,0.00035180026,0.10066947,0.0026954075,0.016969875,0.00007063725,0.879],"study_design_scores_gemma":[0.00027286817,0.00018618692,0.00007842276,0.0002093742,0.000010616744,0.00002417818,1.0626213e-7,0.8502632,0.006817883,0.14095578,0.00068122434,0.0005002196],"about_ca_topic_score_codex":0.000047206828,"about_ca_topic_score_gemma":0.00002298611,"teacher_disagreement_score":0.8784998,"about_ca_system_score_codex":0.00014717586,"about_ca_system_score_gemma":0.0004604564,"threshold_uncertainty_score":0.9997154},"labels":[],"label_agreement":null},{"id":"W1834492313","doi":"10.1016/j.tcs.2009.03.040","title":"Hierarchy and equivalence of multi-letter quantum finite automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Equivalence (formal languages); Quantum finite automata; Mathematics; Regular language; Discrete mathematics; Nondeterministic finite automaton; Hierarchy; Automata theory; Computer science; Combinatorics; Algebra over a field; Automaton; Pure mathematics; Theoretical computer science; Law","score_opus":0.011783895480650222,"score_gpt":0.2564132395831067,"score_spread":0.24462934410245646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834492313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106273495,0.00006741329,0.8892044,0.0036015622,0.0003266468,0.000117736075,0.000001909582,0.00021790035,0.00018897043],"genre_scores_gemma":[0.688789,0.0000063530456,0.30976823,0.0013508165,0.00007736231,8.024688e-7,2.2985189e-7,0.000004172455,0.0000030427684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997356,0.0001166056,0.00036422748,0.00083201047,0.00068165024,0.00064951624],"domain_scores_gemma":[0.99814415,0.0003751686,0.00011061227,0.0009481859,0.00014001585,0.0002818803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012381318,0.00023413722,0.00029660267,0.0002613308,0.00033012117,0.00029657272,0.0024962225,0.000056351444,0.000006110791],"category_scores_gemma":[0.000119654695,0.00018276552,0.00006836485,0.001046733,0.002531114,0.0004606212,0.0011427432,0.0002850906,0.000011618467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004856325,0.000087052,0.00003036635,0.000010768681,0.0000024039607,0.000018498076,0.0005321742,0.00091929594,0.0014772259,0.8124335,0.000026891028,0.18445699],"study_design_scores_gemma":[0.00028976012,0.00043828133,0.004527914,0.00006557469,0.0000028001348,0.000053126445,0.0000011299804,0.8945235,0.0019211214,0.097899176,0.000058080976,0.00021953927],"about_ca_topic_score_codex":0.000002193306,"about_ca_topic_score_gemma":7.825209e-8,"teacher_disagreement_score":0.8936042,"about_ca_system_score_codex":0.00001728099,"about_ca_system_score_gemma":0.00008243007,"threshold_uncertainty_score":0.93259954},"labels":[],"label_agreement":null},{"id":"W1835176839","doi":"10.5555/2011804.2011812","title":"Complete characterization of mixing time for the continuous quantum walk on the hypercube with markovian decoherence model","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of British Columbia","funders":"","keywords":"Mixing (physics); Quantum walk; Quantum decoherence; Qubit; Hypercube; Statistical physics; Random walk; Mathematics; Markov process; Quantum; Degrees of freedom (physics and chemistry); Characterization (materials science); Quantum computer; Quantum mechanics; Physics; Discrete mathematics","score_opus":0.012013577616448296,"score_gpt":0.21855207732308773,"score_spread":0.20653849970663943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835176839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26628488,0.000011116127,0.7303936,0.002637731,0.000059640857,0.00043897238,0.000014847004,0.000066525936,0.000092723625],"genre_scores_gemma":[0.98937446,0.000008038878,0.008976133,0.0015184502,0.000027393611,0.000011572276,0.000071861,0.000004550206,0.000007513645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989504,0.00005526891,0.0003768093,0.0001579434,0.00027066894,0.00018890735],"domain_scores_gemma":[0.9988147,0.00035222896,0.00035345435,0.00023377882,0.00020480856,0.00004101349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003931579,0.0001621638,0.0001726953,0.000096748045,0.00038788488,0.00021233704,0.00035092252,0.000042684635,0.0000017086003],"category_scores_gemma":[0.000031754284,0.000091862275,0.00004721982,0.00025294907,0.000056627436,0.0005626411,0.000030666717,0.00012324018,0.000006681172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011781003,0.000049156573,0.000032736487,0.000043645625,0.000029878398,4.3040444e-7,0.0036491929,0.20744392,0.0015553549,0.19062337,0.000108899745,0.5963456],"study_design_scores_gemma":[0.00036302992,0.00039562432,0.007440489,0.000059075017,0.000009108496,0.000014139808,0.00006135128,0.98326373,0.00009215727,0.00798333,0.00018243055,0.00013553689],"about_ca_topic_score_codex":0.0000072013286,"about_ca_topic_score_gemma":6.035152e-7,"teacher_disagreement_score":0.7758198,"about_ca_system_score_codex":0.00001187539,"about_ca_system_score_gemma":0.000045180223,"threshold_uncertainty_score":0.37460348},"labels":[],"label_agreement":null},{"id":"W1837750740","doi":"10.1007/978-3-642-27737-5_428-3","title":"Quantum Computational Complexity","year":2013,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Complexity and Systems Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum; Physics; Quantum mechanics","score_opus":0.037653150629754516,"score_gpt":0.2519632736838539,"score_spread":0.21431012305409938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1837750740","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054996735,0.0024489905,0.17694177,0.0007921816,0.0034900263,0.0012089732,0.00013334496,0.00041848922,0.80906653],"genre_scores_gemma":[0.4492893,0.0010588315,0.3492366,0.000648488,0.0021909317,0.00006937741,0.00012354477,0.00021994996,0.197163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955546,0.000078521814,0.0009807909,0.0011985305,0.0015777281,0.0006097906],"domain_scores_gemma":[0.9968093,0.0003529518,0.0008103113,0.0010033501,0.0006251192,0.00039897434],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00113176,0.0005562222,0.0009505917,0.00050751655,0.0007060861,0.00046264523,0.002439551,0.00020936543,0.00006528695],"category_scores_gemma":[0.000068213754,0.00049538515,0.00016233358,0.00030252108,0.003564518,0.0005676733,0.0012565872,0.0005899141,0.00010666453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020516827,0.000023702725,0.00001408457,0.00014528286,0.000018646784,0.000008441251,0.00039633395,0.0010331114,0.0000081933995,0.9924752,0.0009491305,0.0049257856],"study_design_scores_gemma":[0.0001797012,0.00013705202,0.0011343068,0.0002888719,0.000008397574,0.00012300897,0.000013940207,0.5449509,0.0000019593215,0.41389993,0.038759347,0.00050256087],"about_ca_topic_score_codex":0.00024418024,"about_ca_topic_score_gemma":0.0000079236515,"teacher_disagreement_score":0.61190355,"about_ca_system_score_codex":0.00007489593,"about_ca_system_score_gemma":0.00057751045,"threshold_uncertainty_score":0.9997498},"labels":[],"label_agreement":null},{"id":"W1840291388","doi":"10.37236/4745","title":"Uniform Mixing and Association Schemes","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Mixing (physics); Diagonal; Discrete mathematics; Graph; Quantum mechanics; Geometry; Physics","score_opus":0.007948124513210116,"score_gpt":0.23997232220906423,"score_spread":0.2320241976958541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1840291388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.471703,0.020270552,0.48850638,0.013840806,0.0047010845,0.000241469,0.0000016021211,0.00008313497,0.0006519824],"genre_scores_gemma":[0.99708986,0.0016275931,0.0006747554,0.000062947336,0.00031090196,9.821829e-7,4.3705546e-7,0.000013464667,0.00021907635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981486,0.00014168191,0.0003920756,0.0001988501,0.0006008502,0.00051792274],"domain_scores_gemma":[0.9969051,0.00027884,0.0017864386,0.0006247128,0.00033217535,0.00007271771],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0026786502,0.00021419665,0.0003840866,0.00012159687,0.00041959924,0.0005624737,0.0023313935,0.00018834435,5.019044e-7],"category_scores_gemma":[0.00028130988,0.00014575625,0.00016221438,0.00010841737,0.00003711409,0.00017167801,0.0011860608,0.0026759156,0.000001140363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010824148,0.0000833664,0.0006920657,0.00007027683,0.000417717,0.000023189423,0.0011617567,0.0017121695,0.000035712845,0.9630305,0.00068199506,0.032080434],"study_design_scores_gemma":[0.00037442797,0.00019482635,0.0005383307,0.00015082514,0.00005178792,0.00016059523,0.000010544745,0.064939514,0.00020077093,0.9267949,0.006391822,0.00019169529],"about_ca_topic_score_codex":0.00000864444,"about_ca_topic_score_gemma":0.000001618408,"teacher_disagreement_score":0.52538687,"about_ca_system_score_codex":0.00047789305,"about_ca_system_score_gemma":0.0008587677,"threshold_uncertainty_score":0.99962497},"labels":[],"label_agreement":null},{"id":"W1848847180","doi":"10.1103/physrevx.5.031026","title":"Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly","year":2015,"lang":"en","type":"article","venue":"Physical Review X","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"Division of Materials Research; NIH Office of the Director; Intelligence Advanced Research Projects Activity; City University of New York; Eidgenössische Technische Hochschule Zürich; National Science Foundation; Office of the Director of National Intelligence; University of Texas at Austin","keywords":"Quantum annealing; Speedup; Simulated annealing; Quantum computer; Quantum; Spin (aerodynamics); Annealing (glass)","score_opus":0.026045289614152513,"score_gpt":0.3091685804826562,"score_spread":0.2831232908685037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848847180","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09106775,0.2310933,0.2696554,0.39195427,0.0021118806,0.0031991608,0.0000064491724,0.0004929089,0.010418863],"genre_scores_gemma":[0.97811013,0.004279213,0.0025266635,0.013835551,0.0011211926,0.000044064505,7.9984426e-7,0.000020040776,0.00006231975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814755,0.0004998988,0.00023298885,0.00035054024,0.0004548702,0.00031413094],"domain_scores_gemma":[0.99787825,0.0009004285,0.00014875409,0.0009279109,0.00006735192,0.00007730918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012605083,0.00020579532,0.0003550274,0.0000075243875,0.00036749407,0.00027102183,0.0015394991,0.000017141698,0.0000013308736],"category_scores_gemma":[0.00030649823,0.00007366888,0.00017804407,0.00046604505,0.00034000637,0.00016055912,0.0007197477,0.00043490247,0.00006455733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053487233,0.0000525838,0.000017795448,0.00011732934,0.000034969442,0.000005266549,0.0030382057,0.00016916056,0.000016181179,0.91159177,0.0031343345,0.08181706],"study_design_scores_gemma":[0.00041599112,0.00008183897,0.00027788177,0.0006408481,0.00005495343,0.000061829785,0.00006576132,0.5923751,0.000022553786,0.2589374,0.14686285,0.00020302909],"about_ca_topic_score_codex":0.00007751409,"about_ca_topic_score_gemma":0.000003334713,"teacher_disagreement_score":0.8870424,"about_ca_system_score_codex":0.000013451787,"about_ca_system_score_gemma":0.000066321605,"threshold_uncertainty_score":0.30041295},"labels":[],"label_agreement":null},{"id":"W1849694871","doi":"10.48550/arxiv.1507.04774","title":"Fast clique minor generation in Chimera qubit connectivity graphs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Quantum annealing; Combinatorics; Pairwise comparison; Clique graph; Ising model; Discrete mathematics; Mathematics; Graph; Quantum; Computer science; Quantum computer; Line graph; Physics; Graph power; Quantum mechanics","score_opus":0.05861744262915689,"score_gpt":0.19689676955982674,"score_spread":0.13827932693066985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849694871","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75826365,0.00006668261,0.23981106,0.0001612151,0.0006908393,0.00025926673,0.0000111104655,0.00018002535,0.0005561169],"genre_scores_gemma":[0.99568427,0.000031966913,0.0037026634,0.000112052,0.00017649162,0.0000013242537,0.000026507558,0.000017067961,0.00024766874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758756,0.0003401953,0.00023476384,0.0013099042,0.0001201888,0.0004073662],"domain_scores_gemma":[0.99829257,0.00007873614,0.00023460989,0.0010426426,0.00015899324,0.0001924758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005133302,0.00036501914,0.00040447226,0.00045031763,0.00013563682,0.00016246192,0.0013868373,0.00032312496,0.000006332601],"category_scores_gemma":[0.00004123718,0.00040813754,0.0001836208,0.0007593724,0.0000838274,0.00024806816,0.0016236753,0.00092964654,0.00002780024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012992893,0.00013226263,0.002290804,0.000031133957,0.00003566236,0.00028016558,0.00060084445,0.93695056,0.00008617532,0.055442505,0.00036186937,0.0037750336],"study_design_scores_gemma":[0.00046175957,0.0000632681,0.0027046176,0.00005116459,0.000013692458,0.000010052746,0.000017048747,0.95140904,0.00012105407,0.04453945,0.00016068536,0.00044818118],"about_ca_topic_score_codex":0.00063472654,"about_ca_topic_score_gemma":0.00050968624,"teacher_disagreement_score":0.23742059,"about_ca_system_score_codex":0.00019469814,"about_ca_system_score_gemma":0.00032647935,"threshold_uncertainty_score":0.99983704},"labels":[],"label_agreement":null},{"id":"W1850344377","doi":"10.26421/qic8.10-8","title":"On the iterative decoding of sparse quantum codes","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Belief propagation; Decoding methods; Algorithm; List decoding; Theoretical computer science; Sequential decoding; Quantum computer; Quantum error correction; Quantum; Concatenated error correction code; Block code; Quantum mechanics; Physics","score_opus":0.020854610964425476,"score_gpt":0.2456400102863635,"score_spread":0.22478539932193803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850344377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48342764,0.000020729229,0.5152891,0.00070023804,0.00012733,0.00010017859,0.0000025915292,0.000060679355,0.000271492],"genre_scores_gemma":[0.9928283,0.000027826818,0.006292456,0.0008048524,0.0000202641,0.0000053116496,0.000013328131,0.0000032890757,0.000004377067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989874,0.000088461085,0.00037398946,0.00012523144,0.0002775626,0.0001473635],"domain_scores_gemma":[0.9989748,0.00040666203,0.00026394363,0.00016812386,0.00013957985,0.000046918434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029385637,0.00012820662,0.00014600669,0.00015579938,0.00039472786,0.00011259632,0.00023919586,0.00003875963,0.0000035730952],"category_scores_gemma":[0.00007721315,0.00008772572,0.000045772587,0.0003102569,0.00008902773,0.00062096055,0.000080846534,0.00013947365,0.000022468068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019700981,0.00004121869,0.00010863816,0.000030155827,0.000018922363,0.0000026635114,0.01448653,0.064177655,0.000042109306,0.86791414,0.0012698339,0.051888417],"study_design_scores_gemma":[0.00023392748,0.0001679804,0.0023573604,0.000040368697,0.0000020371142,0.000045434284,0.00017503799,0.97522503,0.00027338925,0.021026859,0.00034398775,0.00010861312],"about_ca_topic_score_codex":0.000018608698,"about_ca_topic_score_gemma":6.007098e-7,"teacher_disagreement_score":0.91104734,"about_ca_system_score_codex":0.000013477763,"about_ca_system_score_gemma":0.000042219304,"threshold_uncertainty_score":0.3577351},"labels":[],"label_agreement":null},{"id":"W1850542807","doi":"10.1007/978-3-540-45198-3_25","title":"Continuous-Time Quantum Walks on the Symmetric Group","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum walk; Cayley graph; Limiting; Computer science; Quantum; Group (periodic table); Symmetric group; Random walk; Quantum algorithm; Discrete mathematics; Mathematics; Theoretical computer science; Graph; Quantum mechanics; Physics","score_opus":0.010787857966635636,"score_gpt":0.2142593286100372,"score_spread":0.20347147064340154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850542807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071779575,0.000507134,0.985878,0.0039286367,0.0026867297,0.00062047655,0.000007732601,0.0003182621,0.0053352336],"genre_scores_gemma":[0.37040386,0.00020890552,0.5685231,0.052836403,0.0040146313,0.00007275624,0.0000286658,0.00043173376,0.0034799266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941171,0.00015968319,0.0006967701,0.0021979962,0.0016350158,0.001193465],"domain_scores_gemma":[0.994395,0.0021794513,0.00044722017,0.0025190727,0.00020996113,0.0002492837],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017178307,0.0009192044,0.0008140448,0.0012826569,0.0007302893,0.001022777,0.006101293,0.00036767832,0.000038290797],"category_scores_gemma":[0.0002821587,0.0006226687,0.0003043263,0.0017615055,0.00086697546,0.0002531015,0.00142406,0.002030397,0.0002741012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008859942,0.00008727373,0.000017345414,0.000025586018,0.000031580137,0.00020177753,0.00047320966,0.0321669,0.00005325841,0.2121194,0.00052229204,0.7542925],"study_design_scores_gemma":[0.00023313367,0.0005862112,0.00012259267,0.00032791356,0.000009032306,0.00013465346,1.0642666e-7,0.8344774,0.00015755331,0.15438469,0.008703749,0.0008629356],"about_ca_topic_score_codex":0.000014037135,"about_ca_topic_score_gemma":0.000011632779,"teacher_disagreement_score":0.8023105,"about_ca_system_score_codex":0.00025740877,"about_ca_system_score_gemma":0.00027181822,"threshold_uncertainty_score":0.99962246},"labels":[],"label_agreement":null},{"id":"W186117384","doi":"10.1007/978-3-642-36315-3_12","title":"Design of an Online Testable Ternary Circuit from the Truth Table","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Toffoli gate; Truth table; Computer science; Adder; Ternary operation; Arithmetic; Logic gate; Algorithm; NAND gate; Theoretical computer science; Mathematics; Programming language; Quantum gate; Telecommunications; Physics","score_opus":0.030585175045077607,"score_gpt":0.22949520313013647,"score_spread":0.19891002808505887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186117384","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011604585,0.0006767808,0.99489766,0.00044206931,0.0018504898,0.0004721993,0.000038005506,0.00017046958,0.00029186162],"genre_scores_gemma":[0.05533297,0.000037084497,0.94180876,0.0013735682,0.0011545066,0.00000854205,0.000024414167,0.000063433596,0.00019674521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563986,0.00012169876,0.0006833277,0.0016654845,0.0011101734,0.00077944365],"domain_scores_gemma":[0.99394417,0.0026424397,0.00050198735,0.0024331408,0.00027615228,0.00020213277],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000908865,0.0006300791,0.00069192564,0.0003632554,0.00034615773,0.00061995036,0.0068618148,0.00029295764,0.00005278309],"category_scores_gemma":[0.00014870326,0.00043746523,0.0001171424,0.00071483495,0.0007566748,0.00062620314,0.001644058,0.0011283219,0.000026013704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036342833,0.000072920164,0.000017178987,0.000013320665,0.000016734488,0.000046107856,0.00079341675,0.35168996,0.00037234326,0.0022750455,0.000036247686,0.6446631],"study_design_scores_gemma":[0.00019933142,0.0002742562,0.00020843816,0.0003247175,0.000009272291,0.000050837087,3.364507e-7,0.83632314,0.000719046,0.16107842,0.00035449627,0.0004576895],"about_ca_topic_score_codex":0.00038665143,"about_ca_topic_score_gemma":0.000026349453,"teacher_disagreement_score":0.6442054,"about_ca_system_score_codex":0.000112207956,"about_ca_system_score_gemma":0.0007037222,"threshold_uncertainty_score":0.9998077},"labels":[],"label_agreement":null},{"id":"W1863205561","doi":"10.1088/1751-8113/48/41/415301","title":"Recursive simulation of quantum annealing","year":2015,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Engineering and Physical Sciences Research Council","keywords":"Adiabatic process; Quantum annealing; Unitary state; Quantum; Statistical physics; Figure of merit; Adiabatic quantum computation; Computer science; Simulated annealing; Exploit; Quantum phase estimation algorithm; Formalism (music); Quantum computer; Computer simulation; Algorithm; Quantum simulator; Applied mathematics; Physics; Mathematics; Quantum mechanics; Simulation","score_opus":0.018930065901114228,"score_gpt":0.26989142514731546,"score_spread":0.2509613592462012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863205561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27655515,0.00005104759,0.7227537,0.0003896983,0.00007127719,0.000027356216,5.0506316e-7,0.0000068409818,0.00014444992],"genre_scores_gemma":[0.94398427,0.0000022516135,0.055821992,0.000031443793,0.00015373256,1.7269251e-7,9.5305225e-8,0.000004681266,0.0000013724589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901944,0.0000744994,0.00036065473,0.00009225504,0.00032903574,0.00012409288],"domain_scores_gemma":[0.9987127,0.0005128615,0.0002249807,0.0001322237,0.00025591903,0.00016130555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063415087,0.00008601038,0.00027485567,0.00003823642,0.000027343372,0.000041378684,0.00024371069,0.000037070855,0.0000027365895],"category_scores_gemma":[0.00031862373,0.00005645254,0.00008403607,0.00013645893,0.00020669533,0.00012108877,0.00010875957,0.00017345934,0.00000200212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014570463,0.00008435488,0.000005283562,0.000025865884,0.000015208936,0.000008590598,0.0011968145,0.012097413,0.000041619685,0.9781841,0.000011284657,0.008314882],"study_design_scores_gemma":[0.00014884422,0.00017926015,0.0000047851327,0.0000622587,0.0000075840385,0.00003805415,0.000028870898,0.4885067,0.00031968206,0.5106624,0.0000071795985,0.000034419812],"about_ca_topic_score_codex":1.4708705e-7,"about_ca_topic_score_gemma":2.9648408e-9,"teacher_disagreement_score":0.6674291,"about_ca_system_score_codex":0.000007673015,"about_ca_system_score_gemma":0.00004585705,"threshold_uncertainty_score":0.23020677},"labels":[],"label_agreement":null},{"id":"W1870111070","doi":"10.1007/978-3-642-40084-1_20","title":"Quantum One-Time Programs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Theoretical computer science; Quantum; Security token; Computer security","score_opus":0.015593843567203888,"score_gpt":0.22748629728263156,"score_spread":0.21189245371542767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1870111070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038015618,0.00046624948,0.99017644,0.0015031756,0.001815732,0.00074728,0.0000031021364,0.0006469609,0.0042609186],"genre_scores_gemma":[0.04269759,0.000037431568,0.9515741,0.0018708006,0.0015617824,0.000030401305,0.00001578946,0.000120097066,0.0020920162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938926,0.000058260728,0.0007534085,0.0024212894,0.0015535329,0.0013209053],"domain_scores_gemma":[0.9961754,0.00039897993,0.0004214405,0.0022872256,0.00033435828,0.0003825661],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00091469265,0.00089055515,0.000888641,0.00094534433,0.00042631078,0.001470702,0.0058650672,0.00048619564,0.00008685541],"category_scores_gemma":[0.00006632331,0.0007858254,0.0002667931,0.0008989288,0.0009277073,0.0006086703,0.0026183506,0.0015343601,0.0008886925],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019572246,0.000061766565,0.000007565955,0.000036320453,0.000017519142,0.00007035727,0.00042207807,0.013799821,0.0001217356,0.022086704,0.00005168611,0.96332246],"study_design_scores_gemma":[0.0001867743,0.0002895447,0.0000453895,0.0005076622,0.000006806049,0.00009607388,4.0514088e-8,0.77946645,0.0002086867,0.21565592,0.00270966,0.00082698493],"about_ca_topic_score_codex":0.00004498239,"about_ca_topic_score_gemma":0.000011210505,"teacher_disagreement_score":0.9624955,"about_ca_system_score_codex":0.00023628646,"about_ca_system_score_gemma":0.0006012253,"threshold_uncertainty_score":0.99988925},"labels":[],"label_agreement":null},{"id":"W1872909421","doi":"10.1006/jcss.2000.1732","title":"Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity","year":2001,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":230,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Quantum walk; Unitary state; Computation; Quantum computer; Quantum algorithm; Mathematics; Quantum; Random walk; Discrete mathematics; Computer science; Algorithm; Quantum mechanics; Physics","score_opus":0.015609028292088054,"score_gpt":0.251137507748184,"score_spread":0.23552847945609595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872909421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55246323,0.0003408868,0.4463509,0.00031891747,0.00039582947,0.00004457348,7.419067e-7,0.000017991637,0.00006692601],"genre_scores_gemma":[0.97889346,0.000020101299,0.020889355,0.0000280093,0.00016239753,2.0943337e-7,6.617786e-8,0.0000024860108,0.0000038992785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848276,0.00023735585,0.0004765142,0.00022055228,0.00039907894,0.00018373769],"domain_scores_gemma":[0.9984362,0.0007507642,0.00038483087,0.00012748025,0.0001728449,0.00012789493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011031233,0.000119628414,0.00040275397,0.0002854738,0.00027711896,0.0002093313,0.0004232177,0.000043022545,6.636781e-7],"category_scores_gemma":[0.000025790727,0.00007891786,0.000085351356,0.0005708431,0.00024729315,0.00032759522,0.00013695048,0.000145151,1.8979149e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030534744,0.00078340777,0.057560585,0.0005790383,0.00045736745,0.0004191229,0.0135467695,0.20919348,0.003308885,0.22017656,0.00093820156,0.4927312],"study_design_scores_gemma":[0.00081252155,0.0004377072,0.014701537,0.00018252424,0.000010761466,0.0011132928,0.0000770867,0.9800364,0.000036482594,0.0023552661,0.00013481668,0.00010162641],"about_ca_topic_score_codex":0.000016829494,"about_ca_topic_score_gemma":0.000003960544,"teacher_disagreement_score":0.7708429,"about_ca_system_score_codex":0.000009862993,"about_ca_system_score_gemma":0.000074492986,"threshold_uncertainty_score":0.32181767},"labels":[],"label_agreement":null},{"id":"W1874981471","doi":"10.26421/qic6.2-1","title":"Quantum accuracy threshold for concatenated distance-3 code","year":2006,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":403,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Concatenation (mathematics); Upper and lower bounds; Discrete mathematics; Code (set theory); Quantum; Noise (video); Mathematics; Algorithm; Hilbert space; Computer science; Combinatorics; Quantum mechanics; Physics; Pure mathematics; Mathematical analysis","score_opus":0.012567929584098667,"score_gpt":0.25517935192091673,"score_spread":0.24261142233681807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1874981471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10114409,0.00010378481,0.89597017,0.0012313846,0.00041318755,0.00037723235,0.000024153536,0.00037641014,0.00035957107],"genre_scores_gemma":[0.98181814,0.000011058536,0.017287994,0.0005233953,0.00008830881,0.000030543106,0.00021344666,0.00000874257,0.000018362161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986357,0.00002955979,0.00054888363,0.00023408385,0.00025176787,0.00029998232],"domain_scores_gemma":[0.9989822,0.00022099898,0.0003196664,0.00019059861,0.00021284481,0.00007367159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028876192,0.0001965341,0.00019333561,0.0001754373,0.00038126152,0.00054529234,0.00029270395,0.0000783571,0.0000017787937],"category_scores_gemma":[0.000042839474,0.0001753513,0.00006704604,0.00033330417,0.00005290024,0.0014496406,0.000083986866,0.0001241022,0.000020306605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003041796,0.000047122274,0.00017823407,0.000095101546,0.000013325468,0.0000013821718,0.0008040556,0.05961084,0.00008519138,0.83558303,0.0040215277,0.09952975],"study_design_scores_gemma":[0.00083495636,0.000108735374,0.0024861144,0.000026085028,0.000005346509,0.000018894996,0.00005546558,0.91272616,0.0001354653,0.06937156,0.014001146,0.00023006542],"about_ca_topic_score_codex":0.00004465567,"about_ca_topic_score_gemma":0.000005832255,"teacher_disagreement_score":0.88067406,"about_ca_system_score_codex":0.000036471556,"about_ca_system_score_gemma":0.000055033823,"threshold_uncertainty_score":0.7150619},"labels":[],"label_agreement":null},{"id":"W1882168406","doi":"10.1109/tit.2012.2220520","title":"Minimal-Memory, Noncatastrophic, Polynomial-Depth Quantum Convolutional Encoders","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Convolutional code; Quantum convolutional code; Encoder; Quantum channel; Quantum algorithm; Quantum error correction; Quantum; Turbo code","score_opus":0.009126251279977191,"score_gpt":0.22136197484864575,"score_spread":0.21223572356866857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1882168406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01594413,0.00003804555,0.9789883,0.00043421134,0.0022638335,0.00017902441,0.000045437664,0.0003397031,0.0017672973],"genre_scores_gemma":[0.9848256,0.0000075261682,0.01392678,0.0009017388,0.00016221618,0.000028858793,0.000011144675,0.000010516366,0.00012560097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842584,0.00013482475,0.00041690507,0.0001679179,0.00037995251,0.00047458633],"domain_scores_gemma":[0.9988576,0.00023474095,0.00016732908,0.00044810708,0.00008431997,0.00020786116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006253736,0.00022198985,0.00016531431,0.00033448954,0.0004590473,0.00013759026,0.00053638814,0.00010252089,0.00008557082],"category_scores_gemma":[0.0000115968505,0.00020406817,0.00014845631,0.00033437915,0.00011733618,0.002123329,0.000007058839,0.00037716137,0.000747945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026664065,0.00058540003,0.00002611013,0.00008324341,0.00018080248,0.0000029665105,0.016713804,0.19676323,0.0007106328,0.09123698,0.0056140176,0.68781614],"study_design_scores_gemma":[0.0019057255,0.00038623286,0.0014206187,0.000078777615,0.000042657648,0.00023968752,0.0008668165,0.96019834,0.013984984,0.0033012875,0.016614003,0.0009608546],"about_ca_topic_score_codex":0.000013182226,"about_ca_topic_score_gemma":9.355689e-7,"teacher_disagreement_score":0.9688815,"about_ca_system_score_codex":0.000083816,"about_ca_system_score_gemma":0.00011085386,"threshold_uncertainty_score":0.96135694},"labels":[],"label_agreement":null},{"id":"W1885697441","doi":"10.1007/978-3-642-18073-6_5","title":"Local Equivalence of Surface Code States","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matroid; Counterexample; Code (set theory); Computer science; Equivalence (formal languages); Class (philosophy); Equivalence class (music); Conjecture; Connection (principal bundle); Binary number; Characterization (materials science); Surface (topology); Unitary state; Theoretical computer science; Discrete mathematics; Mathematics; Physics; Arithmetic; Programming language; Geometry","score_opus":0.019075802352047293,"score_gpt":0.24232157240689572,"score_spread":0.22324577005484844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885697441","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008072059,0.0008889368,0.99478716,0.00031073016,0.0014021258,0.0002774109,0.000019866202,0.00020211512,0.0013044497],"genre_scores_gemma":[0.4050078,0.00013161675,0.5936939,0.0005758347,0.00020459268,0.0000021653377,0.000006616007,0.00005727564,0.000320195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532014,0.000056209632,0.0007904803,0.0017519038,0.001177517,0.0009037456],"domain_scores_gemma":[0.9964217,0.0006138606,0.0005264268,0.0018421308,0.00035588816,0.00024002032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010620941,0.00067685987,0.0008129221,0.0005623349,0.00020794861,0.00020691685,0.0052584736,0.00033030298,0.000026848067],"category_scores_gemma":[0.00004961104,0.00059142086,0.00020534758,0.0007110467,0.0018068707,0.00036070228,0.002464224,0.001049421,0.00004418134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000783784,0.000044625816,0.000034134573,0.00009116168,0.000016477486,0.00009512756,0.0014709134,0.3814417,0.00014439366,0.017514102,0.000019842444,0.59911966],"study_design_scores_gemma":[0.00017603431,0.00028827804,0.00006901048,0.00054917985,0.0000069643106,0.000074699754,1.8443077e-7,0.78102833,0.0037628496,0.21282126,0.0006239565,0.0005992487],"about_ca_topic_score_codex":0.000075225944,"about_ca_topic_score_gemma":0.000045224304,"teacher_disagreement_score":0.5985204,"about_ca_system_score_codex":0.0001485376,"about_ca_system_score_gemma":0.0006303357,"threshold_uncertainty_score":0.9996537},"labels":[],"label_agreement":null},{"id":"W1886800124","doi":"10.1109/isit.1995.531106","title":"Quantum information theory","year":2002,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum information; Computer science; Quantum information science; Quantum field theory; Field (mathematics); Quantum; Quantum mechanics; Theoretical physics; Physics; Mathematics; Quantum entanglement; Pure mathematics","score_opus":0.008912419289361848,"score_gpt":0.1976189324816536,"score_spread":0.18870651319229176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886800124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064489455,0.0000460792,0.9652681,0.0013033309,0.0002641522,0.00003891491,2.827133e-7,0.00036143017,0.02626877],"genre_scores_gemma":[0.938114,0.0000061748688,0.05927928,0.0019004978,0.00006341599,0.0000021847547,6.722809e-7,0.0000028058944,0.00063098624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994965,0.000030499234,0.00011068854,0.00008987124,0.00012668257,0.00014575441],"domain_scores_gemma":[0.99958205,0.000056011602,0.000030969506,0.00026362977,0.000023895835,0.000043460674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015521793,0.00006161111,0.000051884814,0.000064725675,0.00008944896,0.00013560474,0.0004070864,0.000022682652,0.000114040755],"category_scores_gemma":[0.000022167067,0.00004552422,0.00003103055,0.00018683735,0.0000141882465,0.0005119329,0.000112029666,0.000076867225,0.0006459867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.6834363e-7,0.000009662776,0.000008615431,0.0000020556308,0.0000023006028,0.0000011428294,0.000686509,0.00045389883,0.0000070830347,0.61275935,0.0031337028,0.38293543],"study_design_scores_gemma":[0.0000804023,0.000026618442,0.00021498032,0.0000030469218,4.893703e-7,0.000016818629,0.000010547619,0.944613,0.00007925446,0.03043037,0.024448212,0.00007625667],"about_ca_topic_score_codex":0.000003176153,"about_ca_topic_score_gemma":1.3909556e-7,"teacher_disagreement_score":0.9441591,"about_ca_system_score_codex":0.0000055421797,"about_ca_system_score_gemma":0.000003892083,"threshold_uncertainty_score":0.83030677},"labels":[],"label_agreement":null},{"id":"W1890759571","doi":"10.1007/978-3-642-38616-9_6","title":"Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Lattice problem; Quantum algorithm; Quantum; Quantum computer; Cryptosystem; Time complexity; Computational complexity theory; Search algorithm","score_opus":0.027579807322433397,"score_gpt":0.25998263763789875,"score_spread":0.23240283031546535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1890759571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007974688,0.000651273,0.986369,0.0017794515,0.0014206048,0.00080182514,0.0000031244922,0.00016054304,0.00083945756],"genre_scores_gemma":[0.49290472,0.000026039881,0.5046575,0.0011931575,0.000932266,0.000014550006,0.000002556299,0.00007936019,0.00018982883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944747,0.00013201857,0.0007847295,0.0019141937,0.0013650501,0.0013292857],"domain_scores_gemma":[0.9965257,0.0010605323,0.0003039824,0.0016666376,0.00024654335,0.00019661791],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017643188,0.00074212294,0.00067529024,0.0009591835,0.00055585394,0.0016467992,0.00524942,0.00033648152,0.000029644692],"category_scores_gemma":[0.00006272434,0.00052169355,0.00016914756,0.0011432866,0.0008791963,0.00070631993,0.002847621,0.002084793,0.000057293953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035517835,0.00004756541,0.00021443758,0.00007497004,0.00001686052,0.00018115102,0.003707724,0.54993516,0.00034466063,0.011646252,0.000013063806,0.4338146],"study_design_scores_gemma":[0.0001688964,0.000116793126,0.00042201224,0.0007970025,0.0000058200217,0.00015959518,9.023839e-7,0.9578241,0.00019837214,0.03938589,0.00027733447,0.00064327323],"about_ca_topic_score_codex":0.0002726659,"about_ca_topic_score_gemma":0.00015204269,"teacher_disagreement_score":0.48493004,"about_ca_system_score_codex":0.00030513466,"about_ca_system_score_gemma":0.00070403196,"threshold_uncertainty_score":0.99972343},"labels":[],"label_agreement":null},{"id":"W1894861909","doi":"10.48550/arxiv.1411.6758","title":"Quantum factorization of 56153 with only 4 qubits","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Qubit; Factorization; Quantum computer; Quantum; Computation; Computer science; Class (philosophy); Theoretical computer science; Quantum mechanics; Algorithm; Physics; Artificial intelligence","score_opus":0.029584441800048808,"score_gpt":0.17218344711001196,"score_spread":0.14259900530996317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894861909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.372833,0.0000148327235,0.62622184,0.000056389017,0.00034396863,0.000113481525,0.0000068301356,0.00014696135,0.00026269772],"genre_scores_gemma":[0.9946764,0.000018320177,0.0049280333,0.000032063017,0.000091248156,1.92439e-7,0.000014452247,0.000018899866,0.00022039177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983025,0.00013845482,0.00020683548,0.00090877176,0.00014597629,0.00029745378],"domain_scores_gemma":[0.9980193,0.000111783185,0.00042129777,0.0011073927,0.00021220626,0.00012803935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017657109,0.00031205668,0.00039728943,0.00025062193,0.000112630434,0.000073650255,0.0015575913,0.00021203664,0.0000050095427],"category_scores_gemma":[0.000021591388,0.00029040797,0.00013882775,0.00054771965,0.00010508449,0.00014295208,0.0011066183,0.00049879006,0.000013553546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019930654,0.00007579321,0.0036585876,0.00012547374,0.00007118298,0.00005926962,0.00032068434,0.82483906,0.0000383121,0.16872038,0.000054056927,0.0020172773],"study_design_scores_gemma":[0.00032636916,0.00017526596,0.0036534346,0.0001981502,0.000032818014,0.000008836394,0.000012980073,0.97152776,0.00017239105,0.023215264,0.0003074406,0.00036929725],"about_ca_topic_score_codex":0.00014081904,"about_ca_topic_score_gemma":0.000024431298,"teacher_disagreement_score":0.6218434,"about_ca_system_score_codex":0.00006052567,"about_ca_system_score_gemma":0.00027785587,"threshold_uncertainty_score":0.9999548},"labels":[],"label_agreement":null},{"id":"W1904238065","doi":"10.1103/physreva.92.052323","title":"Searching for quantum speedup in quasistatic quantum annealers","year":2015,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada); Simon Fraser University","funders":"","keywords":"Speedup; Quantum annealing; Quasistatic process; Physics; Statistical physics; Quantum; Quantum Monte Carlo; Quantum algorithm; Quantum computer; Monte Carlo method; Qubit; Hamiltonian (control theory); Quantum mechanics; Computer science; Parallel computing; Mathematics; Mathematical optimization; Statistics","score_opus":0.04924061468170257,"score_gpt":0.35019094711625126,"score_spread":0.3009503324345487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1904238065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5390896,0.027104981,0.40626177,0.022507664,0.0010205273,0.0025476632,0.0000115788725,0.00051569205,0.0009404752],"genre_scores_gemma":[0.9723086,0.00047383964,0.024703497,0.0019955304,0.0003579489,0.00009377903,0.000006634334,0.00003176287,0.000028408142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981327,0.00019305464,0.00032224393,0.0004773875,0.00037848786,0.00049609906],"domain_scores_gemma":[0.99862033,0.0004463882,0.00010841152,0.00048521537,0.00008887484,0.00025078637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090862537,0.00020240074,0.0004920443,0.00008106752,0.00006994747,0.00008894183,0.000799028,0.000019575424,7.4421337e-7],"category_scores_gemma":[0.0005147083,0.00016086096,0.00018562734,0.00061366626,0.000047174166,0.00018906065,0.00020509044,0.00027043046,0.000045506273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003077598,0.0009351515,0.0001600597,0.004011868,0.00004650183,0.00007585374,0.0046698535,0.015226124,0.00025401302,0.5424642,0.006650952,0.42547467],"study_design_scores_gemma":[0.00032508755,0.00019941926,0.00019627868,0.001100323,0.000008195391,0.000008334619,0.000017536931,0.90250033,0.000024576078,0.08738891,0.008021756,0.00020924353],"about_ca_topic_score_codex":0.000059703194,"about_ca_topic_score_gemma":0.0000043535497,"teacher_disagreement_score":0.8872742,"about_ca_system_score_codex":0.000053545198,"about_ca_system_score_gemma":0.00015025937,"threshold_uncertainty_score":0.65597194},"labels":[],"label_agreement":null},{"id":"W1905513623","doi":"10.1109/vlsi-soc.2015.7314431","title":"Reversible circuit rewriting with simulated annealing","year":2015,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rewriting; Simulated annealing; Computer science; Electronic circuit; Quantum annealing; Annealing (glass); Quantum; Algorithm; Mathematical optimization; Computer engineering; Quantum computer; Mathematics; Programming language; Materials science; Electrical engineering; Engineering; Physics; Quantum mechanics","score_opus":0.02908101296719049,"score_gpt":0.23596995820183572,"score_spread":0.20688894523464524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1905513623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16782524,0.000073389885,0.816109,0.0008133584,0.00015512636,0.00008452361,3.8534844e-7,0.00063993497,0.014299067],"genre_scores_gemma":[0.8820838,5.075487e-7,0.11700187,0.00041757265,0.000093246126,4.5891727e-7,0.0000010419352,0.000008874234,0.00039264795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895614,0.000037762453,0.00013290686,0.0003235565,0.00025916623,0.00029044333],"domain_scores_gemma":[0.999226,0.00006523847,0.000051959534,0.00036119053,0.00012711468,0.00016849782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003283264,0.00011179216,0.000121033234,0.0000757225,0.00011982806,0.00016129306,0.0004919061,0.00003552684,0.000004412882],"category_scores_gemma":[0.000038930208,0.00008309977,0.000026325446,0.00050661596,0.000022254237,0.00020942965,0.00016768897,0.00014743807,0.000030445697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018887697,0.00008424451,0.003425729,0.000035362773,0.00005979851,0.00036297846,0.0045847273,0.8220569,0.0003823626,0.045737345,0.0038090209,0.11944266],"study_design_scores_gemma":[0.0004342786,0.0001291124,0.00011827638,0.000044290493,0.0000024492447,0.000076533805,0.000081542275,0.993591,0.00047317482,0.0028286555,0.0020408458,0.00017981138],"about_ca_topic_score_codex":0.00007518984,"about_ca_topic_score_gemma":0.00000338929,"teacher_disagreement_score":0.71425855,"about_ca_system_score_codex":0.00002364494,"about_ca_system_score_gemma":0.00008660555,"threshold_uncertainty_score":0.33887103},"labels":[],"label_agreement":null},{"id":"W1910560010","doi":"10.1016/j.ipl.2004.02.005","title":"Polynomial time quantum computation with advice","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University; University of Ottawa","funders":"","keywords":"Advice (programming); Computation; Quantum computer; Bounded function; Polynomial; Computer science; Quantum algorithm; Quantum; State (computer science); Discrete mathematics; Mathematics; Algorithm; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.0036287721442083438,"score_gpt":0.19755343976412654,"score_spread":0.1939246676199182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1910560010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14821163,0.0000099965455,0.8425127,0.008079848,0.00011599051,0.00009800891,0.0000010778874,0.0005920379,0.00037868356],"genre_scores_gemma":[0.8167487,2.8130347e-7,0.17602521,0.0070972503,0.00008868563,0.0000058908927,0.000019037972,0.000008400717,0.000006542054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989783,0.000016595168,0.0002701733,0.00015820419,0.0003278653,0.00024883696],"domain_scores_gemma":[0.9994465,0.000020656775,0.00021953518,0.00015430935,0.000092192065,0.00006676665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014555114,0.0001475876,0.00011388237,0.00017995012,0.00028202755,0.0005594577,0.0003656014,0.000036770576,0.0000014489835],"category_scores_gemma":[0.0000104761775,0.00012040939,0.000028780778,0.00045075692,0.00004865554,0.0025513647,0.00006344328,0.00016046087,0.00014657748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003242913,0.000034748522,0.000026920809,0.00008868105,0.000014986928,0.000010941073,0.007817151,0.73214924,0.0008834977,0.0003961406,0.0032739488,0.2552713],"study_design_scores_gemma":[0.0008801264,0.00010348428,0.00058324507,0.00011834587,0.000004330478,0.00011583947,0.000028416693,0.9943114,0.00044633585,0.00017839068,0.0029688673,0.0002612259],"about_ca_topic_score_codex":0.000019711273,"about_ca_topic_score_gemma":5.195529e-7,"teacher_disagreement_score":0.6685371,"about_ca_system_score_codex":0.00006157121,"about_ca_system_score_gemma":0.00013243439,"threshold_uncertainty_score":0.53948635},"labels":[],"label_agreement":null},{"id":"W1931446533","doi":"10.1139/p2012-108","title":"Asymptotic behavior of the global chirality distribution for quantum walks on <i>Z</i><sup>2</sup> subject to decoherence","year":2012,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Quantum decoherence; Quantum walk; Chirality (physics); Subject (documents); Quantum mechanics; Distribution (mathematics); Quantum; Mathematical physics; Statistical physics; Quantum algorithm; Fermion; Mathematical analysis","score_opus":0.01618016171203512,"score_gpt":0.24829814954334326,"score_spread":0.23211798783130813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931446533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82567626,0.000052664833,0.17259462,0.00055741484,0.00074987195,0.0001890606,0.00014775795,0.0000064926867,0.000025839578],"genre_scores_gemma":[0.996699,3.7090823e-7,0.002628294,0.00024380225,0.000411918,0.000003367161,0.0000024982528,0.0000064087885,0.000004363503],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99879885,0.00007840112,0.00029695616,0.00013814091,0.00024318571,0.00044446558],"domain_scores_gemma":[0.99861896,0.00007974588,0.00024146012,0.00035523967,0.00019752042,0.0005070963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037634748,0.0001395801,0.00020908212,0.000029644083,0.00020365044,0.00006657936,0.0009083388,0.000046399884,0.0000017468235],"category_scores_gemma":[0.00011411262,0.00010162515,0.0002084939,0.00042353114,0.00006076312,0.00016285472,0.000049788385,0.00019990093,0.0000029403009],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006482127,0.00056604284,0.17573868,0.00010989509,0.00014756159,0.00002514056,0.005055757,0.07286488,0.00032551534,0.35422018,0.006094847,0.3847867],"study_design_scores_gemma":[0.0019007934,0.0028769067,0.7114867,0.0008210544,0.00023755012,0.00038431393,0.00018045142,0.2047284,0.010518449,0.05403225,0.011591533,0.0012415863],"about_ca_topic_score_codex":0.0006382574,"about_ca_topic_score_gemma":0.0002882904,"teacher_disagreement_score":0.535748,"about_ca_system_score_codex":0.00021761737,"about_ca_system_score_gemma":0.00064225786,"threshold_uncertainty_score":0.41441533},"labels":[],"label_agreement":null},{"id":"W1944374408","doi":"10.1145/2699415","title":"Programming the quantum future","year":2015,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Quantum; Physics; Quantum mechanics","score_opus":0.046982952857665974,"score_gpt":0.29093363939391265,"score_spread":0.24395068653624669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944374408","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047625285,0.0072808387,0.019525541,0.9215522,0.0014355248,0.0005667107,0.0000035364271,0.00029763478,0.0017127536],"genre_scores_gemma":[0.5654654,0.000038515136,0.43397754,0.0003539645,0.00009937104,0.000013824163,0.0000010214275,0.0000063959237,0.000043981607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919623,0.00021695427,0.00015650778,0.00011066265,0.00018903971,0.00013057652],"domain_scores_gemma":[0.9685279,0.00021856703,0.00012793539,0.030968154,0.0001186631,0.000038753882],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0005522496,0.00007189685,0.000081356,0.000024623434,0.0003768839,0.00007455368,0.05423911,0.000028130095,3.1845371e-7],"category_scores_gemma":[0.0015837253,0.00003647263,0.00007656032,0.00047782005,0.00019781975,0.000074478914,0.030064553,0.00026736746,0.000007618406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045125416,0.00028011546,0.0012498657,0.000016299098,0.00006571617,5.5494394e-7,0.014859894,0.0023105834,0.00016676198,0.52757347,0.082648575,0.37082365],"study_design_scores_gemma":[0.00022754059,0.0000536817,0.0030628943,0.00004935961,0.00001360609,0.000034747132,0.0005855679,0.28337777,0.0002326676,0.34921637,0.3629919,0.00015390862],"about_ca_topic_score_codex":0.000035641086,"about_ca_topic_score_gemma":0.000013078329,"teacher_disagreement_score":0.9211982,"about_ca_system_score_codex":0.000014465375,"about_ca_system_score_gemma":0.000092787115,"threshold_uncertainty_score":0.9777801},"labels":[],"label_agreement":null},{"id":"W1953239862","doi":"10.5555/984720.984755","title":"Improved bounds for the approximate QFT","year":2004,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Logarithm; Quantum Fourier transform; Computation; Quantum computer; Quantum; Fourier transform; Algorithm; Computer science; Quantum algorithm; Mathematics; Quantum error correction; Quantum mechanics; Mathematical analysis; Physics","score_opus":0.010104611007178351,"score_gpt":0.23374833791693017,"score_spread":0.22364372690975182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953239862","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033429915,0.00008540352,0.98800564,0.0072512385,0.00040680537,0.00022163716,9.788496e-7,0.00024149948,0.00044379724],"genre_scores_gemma":[0.44531187,0.0000035902353,0.55236715,0.0015691071,0.0002338859,0.000036373407,8.283308e-7,0.000010640913,0.00046651994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993015,0.000007491468,0.000106881365,0.00023402217,0.00009406718,0.0002560359],"domain_scores_gemma":[0.9993526,0.00010928685,0.000034063574,0.00042758227,0.00003458233,0.00004192055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021339348,0.000092388065,0.000076273376,0.00002406285,0.00031039116,0.00023204937,0.0007976315,0.000026333104,0.0000023155476],"category_scores_gemma":[0.000018668901,0.000050316812,0.00007608986,0.00015636376,0.000035754932,0.00008094147,0.00017397176,0.000086067295,0.000005980354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073489373,0.000081859005,0.000006737002,0.000021692882,0.00003964844,0.000002994628,0.0012723125,0.020360524,0.0018544635,0.59714144,0.0008070117,0.37840396],"study_design_scores_gemma":[0.0003902768,0.000080450984,0.00006668637,0.0000044795706,0.0000026195212,0.000015814938,0.000011647593,0.9484496,0.0018692,0.041677836,0.007331241,0.00010011018],"about_ca_topic_score_codex":0.00004178113,"about_ca_topic_score_gemma":0.0000076630995,"teacher_disagreement_score":0.92808914,"about_ca_system_score_codex":0.0000134689035,"about_ca_system_score_gemma":0.000051947252,"threshold_uncertainty_score":0.23873094},"labels":[],"label_agreement":null},{"id":"W1953924046","doi":"10.1103/physrevlett.115.030501","title":"Qutrit Magic State Distillation Tight in Some Directions","year":2015,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Foundational Questions Institute","keywords":"MAGIC (telescope); Qutrit; Distillation; State (computer science); Associative property; Physics; Statistical physics; Computer science; Quantum mechanics; Qubit; Chemistry; Mathematics; Chromatography; Quantum","score_opus":0.01775012013018957,"score_gpt":0.27830133070999646,"score_spread":0.2605512105798069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953924046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6957343,0.024455568,0.15444188,0.12192434,0.0012608621,0.00094054494,0.000008631529,0.00060058164,0.0006332977],"genre_scores_gemma":[0.9667378,0.001886765,0.009611237,0.021008644,0.0006403283,0.00003217435,0.000009115654,0.000024355606,0.00004959129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894613,0.000118267235,0.00018217812,0.0002900498,0.00023920338,0.00022414615],"domain_scores_gemma":[0.99941075,0.00008344864,0.00006648899,0.00030188073,0.000025255493,0.000112201735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020277973,0.00012287866,0.00023271849,0.000055541746,0.00003567766,0.00005386183,0.00032484686,0.00000494783,0.0000010621898],"category_scores_gemma":[0.000047980928,0.00009750474,0.00008182319,0.0004973892,0.000029535066,0.00022967294,0.00011232024,0.00018058035,0.00011227216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014186488,0.0010053866,0.002256783,0.0015704072,0.00007123418,0.00022313044,0.0038262683,0.056500066,0.0032053315,0.0327799,0.04130136,0.8572459],"study_design_scores_gemma":[0.00041597834,0.00007017477,0.007398698,0.0011254704,0.000013798539,0.000016225718,0.0000014388526,0.88735384,0.000092693015,0.017859006,0.08521307,0.0004395897],"about_ca_topic_score_codex":0.00002921581,"about_ca_topic_score_gemma":0.0000025603397,"teacher_disagreement_score":0.85680634,"about_ca_system_score_codex":0.000039544568,"about_ca_system_score_gemma":0.000024262232,"threshold_uncertainty_score":0.39761278},"labels":[],"label_agreement":null},{"id":"W1958272588","doi":"10.1038/srep18628","title":"Determination and correction of persistent biases in quantum annealers","year":2016,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"NIH Office of the Director; Advanced Exploration Systems; Ames Research Center; Intelligence Advanced Research Projects Activity; Air Force Research Laboratory; Office of the Director of National Intelligence; National Aeronautics and Space Administration","keywords":"Quantum; Computer science; Physics; Quantum mechanics","score_opus":0.01659036922406422,"score_gpt":0.24012426285099822,"score_spread":0.223533893626934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1958272588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9904921,0.00009001778,0.0039467034,0.00023411088,0.005028676,0.00008185828,3.2539296e-7,0.00003957798,0.00008663107],"genre_scores_gemma":[0.9983637,0.0000031777781,0.0013385457,0.000006507337,0.00001571284,0.0000023498478,6.954292e-7,0.0000028596423,0.00026649443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988284,0.000041384792,0.00027165818,0.00044864943,0.00023898225,0.00017093764],"domain_scores_gemma":[0.9992206,0.0000992538,0.00018085729,0.00037161878,0.0000747447,0.000052918116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084681466,0.00006961061,0.00010249862,0.00024868426,0.000094801784,0.0000879147,0.00012374818,0.00002788086,0.0000028559894],"category_scores_gemma":[0.00022307117,0.000047193356,0.000058605023,0.00038931207,0.00013743837,0.00020420758,0.00009600839,0.000037334707,0.0000010556412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059500603,0.00011980918,0.014036237,0.000031001728,0.000009246406,0.00022761272,0.00237735,0.051689707,0.034054518,0.000066132605,0.0011942354,0.8961882],"study_design_scores_gemma":[0.00008146632,0.000056094847,0.0058230036,0.00014756918,0.0000020959642,0.0002100958,0.00003048513,0.9858851,0.006483443,0.0005609946,0.0006402967,0.00007936242],"about_ca_topic_score_codex":0.000024394061,"about_ca_topic_score_gemma":0.000013899035,"teacher_disagreement_score":0.9341954,"about_ca_system_score_codex":0.000025652515,"about_ca_system_score_gemma":0.00005181789,"threshold_uncertainty_score":0.19244891},"labels":[],"label_agreement":null},{"id":"W1959392488","doi":"10.26421/qic14.15-16-5","title":"Fault-Tolerant quantum computation with constant overhead","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; Canadian Institute for Advanced Research","funders":"Division of Mathematical Sciences; Institut Périmètre de physique théorique; Industry Canada; Government of Canada","keywords":"Qubit; Quantum computer; Fault tolerance; Computer science; Quantum error correction; Overhead (engineering); Constant (computer programming); Quantum; Quantum convolutional code; Mathematics; Topology (electrical circuits); Discrete mathematics; Quantum mechanics; Physics; Distributed computing; Combinatorics","score_opus":0.007549946387218678,"score_gpt":0.22724153338666003,"score_spread":0.21969158699944136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959392488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18380171,0.000036086512,0.8134151,0.0009453865,0.00029375666,0.00023447628,0.0000039670103,0.00038638123,0.0008831384],"genre_scores_gemma":[0.961852,0.000009371479,0.03700885,0.0009796746,0.00005668288,0.000010269426,0.00006685994,0.0000107566275,0.000005515944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812734,0.00013539554,0.0005773442,0.00031368033,0.0005053341,0.00034089477],"domain_scores_gemma":[0.9987474,0.00021634968,0.00038161356,0.00022783788,0.00026521887,0.00016159663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048322236,0.00027625353,0.00028065345,0.00029007246,0.000421424,0.00062178366,0.0002670421,0.00008712028,0.000002681766],"category_scores_gemma":[0.000036952133,0.00022483585,0.00005082754,0.00048132308,0.000099839766,0.0015510855,0.00010869145,0.00022692248,0.00005579958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004671067,0.00005648967,0.00018652235,0.00010982759,0.000028110348,0.0000032855878,0.003293371,0.21199866,0.00003653461,0.33543092,0.0004785151,0.4483311],"study_design_scores_gemma":[0.0011337146,0.0004392556,0.003056978,0.000088409266,0.000008647642,0.00012159226,0.00016705664,0.97653466,0.000037510898,0.015381193,0.002689659,0.00034134637],"about_ca_topic_score_codex":0.00004478499,"about_ca_topic_score_gemma":0.0000039594033,"teacher_disagreement_score":0.7780503,"about_ca_system_score_codex":0.000036201134,"about_ca_system_score_gemma":0.000084420644,"threshold_uncertainty_score":0.91685396},"labels":[],"label_agreement":null},{"id":"W1959691716","doi":"10.1016/j.jcss.2008.12.001","title":"An application of quantum finite automata to interactive proof systems","year":2008,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Computer science; Theoretical computer science; Quantum finite automata; Quantum; Automaton; Automata theory; Quantum mechanics; Physics","score_opus":0.014757690870303809,"score_gpt":0.26378779444359124,"score_spread":0.24903010357328742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959691716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30185208,0.00013236536,0.6970744,0.00012473787,0.0006281124,0.00011541391,0.0000011365252,0.000025653666,0.000046098958],"genre_scores_gemma":[0.9356843,0.0000035673636,0.06401634,0.000034842105,0.0002528878,0.000001941109,1.2509898e-7,0.0000034668944,0.0000024988756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982185,0.00017724601,0.00060519774,0.0002714928,0.0005445349,0.00018308048],"domain_scores_gemma":[0.9984898,0.00020632135,0.00058351405,0.0002656229,0.0002864085,0.00016833724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011264028,0.00012617989,0.00036384095,0.00034150435,0.00023581149,0.00017724797,0.0011150478,0.00003380922,1.18648806e-7],"category_scores_gemma":[0.000012016548,0.00008593767,0.00006326209,0.0005448707,0.000107824504,0.000572497,0.0001534429,0.00011755591,0.0000014187144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062463994,0.0004667057,0.0058999765,0.00047939894,0.000104519284,0.00016025166,0.020237964,0.73249745,0.0016571081,0.06737204,0.00061356125,0.17044854],"study_design_scores_gemma":[0.00017512008,0.0011936338,0.004030368,0.00025103652,0.0000036880172,0.0014382277,0.00015016645,0.9921768,0.00018315499,0.00012426871,0.00017006767,0.00010351187],"about_ca_topic_score_codex":0.000031119533,"about_ca_topic_score_gemma":4.6369217e-7,"teacher_disagreement_score":0.6338323,"about_ca_system_score_codex":0.000022251259,"about_ca_system_score_gemma":0.00011925487,"threshold_uncertainty_score":0.35044363},"labels":[],"label_agreement":null},{"id":"W1963604719","doi":"10.1016/j.tcs.2004.12.020","title":"Uniformity of quantum circuit families for error-free algorithms","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ottawa","keywords":"Algorithm; Computer science; Quantum; Quantum circuit; Quantum computer; Mathematics; Quantum error correction; Physics; Quantum mechanics","score_opus":0.014477741345417574,"score_gpt":0.2552957478506123,"score_spread":0.24081800650519475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963604719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054385636,0.000048811846,0.9418678,0.0017458667,0.0006462535,0.00028200046,0.000012433092,0.00025319465,0.00075798057],"genre_scores_gemma":[0.6109427,0.0000026308726,0.38852003,0.0002782951,0.00023519546,0.00000602272,7.267675e-7,0.000008634926,0.000005730257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968692,0.000075743,0.00050669484,0.0008736482,0.0008398724,0.0008348266],"domain_scores_gemma":[0.997123,0.0005191005,0.00016165226,0.0015449809,0.00036250713,0.0002887325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001872628,0.00027686174,0.00038643926,0.00030528448,0.00049897475,0.00023093268,0.0052178493,0.000078411234,0.000009713269],"category_scores_gemma":[0.00020295291,0.00022265915,0.0001768693,0.0012302926,0.0026736371,0.00055844424,0.0016842313,0.00024463536,0.0000143468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054231155,0.00007705299,0.000015360032,0.000016883865,0.0000054087377,0.0000017099102,0.00058351434,0.0031973014,0.00024827445,0.82694954,0.000069877366,0.16882968],"study_design_scores_gemma":[0.00035513405,0.0002926283,0.0003445131,0.00003006134,0.0000044583476,0.000031360145,0.0000066294283,0.7205299,0.003675006,0.27417505,0.00033412693,0.00022111821],"about_ca_topic_score_codex":0.000005585581,"about_ca_topic_score_gemma":9.841438e-7,"teacher_disagreement_score":0.7173326,"about_ca_system_score_codex":0.000056016386,"about_ca_system_score_gemma":0.00021827959,"threshold_uncertainty_score":0.9851127},"labels":[],"label_agreement":null},{"id":"W1964699768","doi":"10.1007/s00453-015-9985-x","title":"Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision","year":2015,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Collision; Computer science; Matrix multiplication; Graph; Logical matrix; Quantum; Multiplication (music); Theoretical computer science; Mathematics; Combinatorics; Physics; Quantum mechanics; Programming language","score_opus":0.04442195042262893,"score_gpt":0.287607876807903,"score_spread":0.2431859263852741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964699768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29379904,0.00014528846,0.70489645,0.00033919193,0.00041216053,0.00018411204,0.000010105407,0.00018171148,0.000031937656],"genre_scores_gemma":[0.60809857,0.0000016686699,0.39170045,0.00004410719,0.000120253826,0.0000030225833,0.0000063386433,0.000015356542,0.000010239653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979959,0.00013543607,0.0004742847,0.0005319243,0.00047765567,0.00038477193],"domain_scores_gemma":[0.9982582,0.0001053634,0.00035474935,0.0007778503,0.0002876122,0.00021622452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060372095,0.00022381824,0.00032221238,0.00022837696,0.00018143207,0.0001015821,0.00091303827,0.00010171123,0.0000011975355],"category_scores_gemma":[0.000096397096,0.00020736536,0.0001267398,0.0007043065,0.00017766801,0.0003000301,0.0004936351,0.00023388313,0.000009420565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014128479,0.0013441828,0.0014437938,0.00036220887,0.0002110838,0.00010549815,0.0081801545,0.12323351,0.08485395,0.20733102,0.0016349427,0.57115835],"study_design_scores_gemma":[0.0004963179,0.0001283242,0.00044190115,0.00003787014,0.000010318073,0.000050535793,0.00007095827,0.97549635,0.008354334,0.014447706,0.00022224258,0.00024316968],"about_ca_topic_score_codex":0.00082883355,"about_ca_topic_score_gemma":0.000007493631,"teacher_disagreement_score":0.8522628,"about_ca_system_score_codex":0.00007368008,"about_ca_system_score_gemma":0.00018172241,"threshold_uncertainty_score":0.8456114},"labels":[],"label_agreement":null},{"id":"W1966833372","doi":"10.1088/1367-2630/13/7/073011","title":"Elimination of perturbative crossings in adiabatic quantum optimization","year":2011,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Physics; Adiabatic process; Maxima and minima; Adiabatic quantum computation; Ising model; Quantum; Path (computing); Polynomial; Exponential growth; Exponential function; Order (exchange); Quantum computer; Quantum mechanics; PSPACE; Statistical physics; Computational complexity theory; Algorithm; Mathematical analysis; Mathematics","score_opus":0.02145576038322922,"score_gpt":0.23866387695061486,"score_spread":0.21720811656738565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966833372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1150078,0.00007599112,0.8843394,0.00014055854,0.00020966578,0.00003363133,3.0265306e-7,0.0000072181724,0.0001854631],"genre_scores_gemma":[0.7879562,0.000007620652,0.21186675,0.000036627334,0.00011307305,1.3967384e-7,2.312323e-7,0.000004941508,0.0000144456335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991997,0.00005003857,0.0003271938,0.00009250611,0.00021811386,0.00011244543],"domain_scores_gemma":[0.9990904,0.000069062764,0.00047553942,0.000119191136,0.00019265174,0.000053161344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020589682,0.00007978323,0.00017467063,0.000106888896,0.00003344659,0.00003226189,0.00035786812,0.000029482826,0.0000040910336],"category_scores_gemma":[0.000056032124,0.00006636115,0.00006863428,0.00036521367,0.000034080236,0.00039698483,0.000045827994,0.00016532012,7.4161983e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042004685,0.00040452674,0.0005543522,0.000043343087,0.000039236158,0.00002709205,0.054639112,0.44726944,0.0016205037,0.04638816,0.00027543682,0.4486968],"study_design_scores_gemma":[0.00044178547,0.00030995614,0.004160396,0.00013892977,0.0000067969836,0.000018566678,0.00005447998,0.96050316,0.005076744,0.029188994,0.000019158519,0.00008105516],"about_ca_topic_score_codex":0.000028839255,"about_ca_topic_score_gemma":8.3891996e-7,"teacher_disagreement_score":0.67294836,"about_ca_system_score_codex":0.000025026186,"about_ca_system_score_gemma":0.00015154816,"threshold_uncertainty_score":0.2706129},"labels":[],"label_agreement":null},{"id":"W1966907368","doi":"10.1038/nphys184","title":"When errors are intolerable","year":2005,"lang":"en","type":"article","venue":"Nature Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Physics; Quantum; Quantum computer; Algorithm; Quantum algorithm; Quantum mechanics; Statistical physics; Computer science","score_opus":0.007277857211399441,"score_gpt":0.23606309472352743,"score_spread":0.22878523751212798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966907368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075538225,0.0018871287,0.884283,0.027162641,0.0018255719,0.00025039417,0.000007777337,0.0011390538,0.0079062],"genre_scores_gemma":[0.8230148,0.000003429771,0.17261295,0.0027549092,0.0012285201,0.0000028253976,0.000002242484,0.00001321223,0.0003671403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893767,0.000030334599,0.000117730015,0.00034779598,0.0002759267,0.00029053996],"domain_scores_gemma":[0.9992055,0.000046223868,0.00008556421,0.0005122256,0.00007045156,0.000079994505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009754962,0.00015497449,0.00015343935,0.000034537563,0.00014716573,0.00011803573,0.000825982,0.0001359232,0.0000060994375],"category_scores_gemma":[0.000016252774,0.00012988802,0.00008281886,0.00027827194,0.000024485516,0.00026235028,0.00022582995,0.0008156185,0.00007875369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041683884,0.00019152908,0.0002864938,0.000024047204,0.000035641155,0.000020495945,0.0023609535,0.033472143,0.0004074575,0.09881752,0.033208154,0.8311714],"study_design_scores_gemma":[0.00024437826,0.000031751646,0.0007931512,0.000042438707,0.0000045700685,0.00001472633,0.000009851376,0.8075744,0.003481558,0.05245567,0.13504465,0.00030284477],"about_ca_topic_score_codex":0.000004947769,"about_ca_topic_score_gemma":0.00000488634,"teacher_disagreement_score":0.83086854,"about_ca_system_score_codex":0.000029551726,"about_ca_system_score_gemma":0.000034621527,"threshold_uncertainty_score":0.529668},"labels":[],"label_agreement":null},{"id":"W1967067160","doi":"10.1038/nature00801","title":"Interpretation of tomography and spectroscopy as dual forms of quantum computation","year":2002,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Secretaría de Ciencia y Técnica, Universidad de Buenos Aires","keywords":"Quantum tomography; Quantum computer; Tomography; Spectroscopy; Quantum state; Physics; Qubit; Quantum; Computation; Statistical physics; Wigner distribution function; Quantum mechanics; Computational physics; Algorithm; Computer science; Optics","score_opus":0.004749016387640701,"score_gpt":0.24021083340071772,"score_spread":0.23546181701307703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967067160","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75389206,0.0010652278,0.2436459,0.000494028,0.00022034648,0.00008758004,0.0000035066998,0.000050856237,0.0005404829],"genre_scores_gemma":[0.97044045,0.00001716478,0.02937371,0.00012804022,0.00002651832,7.397902e-7,0.0000021981682,0.0000046031323,0.0000066063044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992531,0.000027997934,0.00018386387,0.00019839354,0.00021899247,0.00011764628],"domain_scores_gemma":[0.9995158,0.00007706509,0.00014435408,0.00015011495,0.00007699579,0.000035671106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010481177,0.000092784445,0.00015339657,0.00016047564,0.00003985609,0.000027172335,0.00018240006,0.00020969051,0.0000037885952],"category_scores_gemma":[0.000027242182,0.00007485502,0.000058028203,0.00038238143,0.000052992105,0.00013730185,0.00007635023,0.0004918024,0.0000012888763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102659214,0.0006330049,0.003614565,0.000533295,0.00020283215,0.00003802526,0.021386169,0.012794433,0.034683306,0.35251412,0.0031069026,0.5703907],"study_design_scores_gemma":[0.00024389703,0.00030061844,0.0038359342,0.000060171315,0.000004967903,0.000028442539,0.00002267698,0.96420276,0.008125067,0.023030818,0.00005836126,0.00008626645],"about_ca_topic_score_codex":0.000005425741,"about_ca_topic_score_gemma":9.87175e-7,"teacher_disagreement_score":0.9514083,"about_ca_system_score_codex":0.0000050805543,"about_ca_system_score_gemma":0.000007884489,"threshold_uncertainty_score":0.3052499},"labels":[],"label_agreement":null},{"id":"W1969351134","doi":"10.1142/s0219749909005389","title":"COMMUNICATION IN XYZ ALL-TO-ALL QUANTUM NETWORKS WITH A MISSING LINK","year":2009,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Link (geometry); Unitary state; Qubit; Computer science; Topology (electrical circuits); Enhanced Data Rates for GSM Evolution; Operator (biology); Quantum; State (computer science); Graph; Physics; Mathematics; Quantum mechanics; Theoretical computer science; Combinatorics; Algorithm; Computer network; Telecommunications","score_opus":0.011893349812152476,"score_gpt":0.26894391079880253,"score_spread":0.2570505609866501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969351134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08391169,0.00010659412,0.8781679,0.036755655,0.00055347,0.00011846009,0.0000012624636,0.000046521858,0.000338398],"genre_scores_gemma":[0.94199544,0.00008274569,0.052455183,0.0052588833,0.00018622923,0.0000013324566,0.000012423229,0.0000052600676,0.000002512364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980303,0.00008633377,0.0008513373,0.00010753309,0.00068786164,0.00023662848],"domain_scores_gemma":[0.99819785,0.00012377508,0.0007076943,0.0002816365,0.0005624071,0.00012660655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081835076,0.00015806792,0.00020438488,0.0006536991,0.00006286907,0.00048537142,0.0014809273,0.00007142077,0.0000033330282],"category_scores_gemma":[0.00009931908,0.00012728435,0.00007682595,0.00036310375,0.000020587058,0.00218552,0.000113422175,0.00046684145,0.000011655866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014922538,0.000090335816,0.00014795605,0.0000049590853,0.00005507912,0.00003787938,0.0053441655,0.5165269,0.00006337234,0.02906908,0.00055630045,0.44795477],"study_design_scores_gemma":[0.0007907518,0.00039355297,0.007963444,0.00032600714,0.000005592292,0.00040136196,0.00006446985,0.9756151,0.000051820938,0.006968475,0.007252802,0.00016664369],"about_ca_topic_score_codex":0.000020696403,"about_ca_topic_score_gemma":0.0000038609587,"teacher_disagreement_score":0.8580837,"about_ca_system_score_codex":0.00013636917,"about_ca_system_score_gemma":0.000107958105,"threshold_uncertainty_score":0.5190505},"labels":[],"label_agreement":null},{"id":"W1969389934","doi":"10.1016/j.tcs.2014.11.030","title":"Interactive proofs with quantum finite automata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Quantum; Automaton; Bounded function; Probabilistic logic; Computer science; Theoretical computer science; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics; Artificial intelligence; Quantum mechanics","score_opus":0.0047482486649775306,"score_gpt":0.22477091848971115,"score_spread":0.22002266982473362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969389934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0439933,0.0000058051837,0.9501994,0.0018387304,0.00055710715,0.0001637861,7.728793e-7,0.0005885479,0.002652501],"genre_scores_gemma":[0.7377092,4.559474e-7,0.26145703,0.00065095484,0.00015985347,0.000005218688,4.81736e-7,0.000010266126,0.0000065191934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968782,0.00018434932,0.00026472262,0.001043084,0.0008585704,0.00077105046],"domain_scores_gemma":[0.9973853,0.00070451153,0.00011137278,0.0012398866,0.00021863599,0.00034029112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001435839,0.00028340955,0.000279367,0.00023890281,0.00056214666,0.0007610874,0.003286676,0.000047205656,0.000013554858],"category_scores_gemma":[0.00015397684,0.00018960473,0.00006204163,0.0013524037,0.0022005874,0.0006454622,0.0014311145,0.00039474288,0.00010749964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011454946,0.00006455323,0.000028246328,0.000006656611,0.0000048750358,0.000012672408,0.0005192208,0.004181126,0.000069359005,0.8656645,0.000022913497,0.12941444],"study_design_scores_gemma":[0.00030504528,0.0007599379,0.00084808754,0.00007368993,0.0000033785088,0.00008978916,0.0000024687065,0.8886421,0.0009900017,0.10763346,0.0003574572,0.00029461348],"about_ca_topic_score_codex":0.0000035931466,"about_ca_topic_score_gemma":4.3252052e-7,"teacher_disagreement_score":0.8844609,"about_ca_system_score_codex":0.000040776733,"about_ca_system_score_gemma":0.00013853636,"threshold_uncertainty_score":0.8108156},"labels":[],"label_agreement":null},{"id":"W1970803012","doi":"10.1145/2746539.2746613","title":"Quantum Information Complexity","year":2015,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum complexity theory; Quantum information; Bipartite graph; Computer science; Generalization; Theoretical computer science; Quantum; Quantum algorithm; Quantum capacity; Quantum information science; Quantum channel; Quantum network; Mathematics; Discrete mathematics; Quantum entanglement; Quantum mechanics; Physics","score_opus":0.03910773029662591,"score_gpt":0.253773896538988,"score_spread":0.21466616624236212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970803012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021018488,0.000011311805,0.96279925,0.0021722463,0.0004251087,0.000048395505,6.1725217e-7,0.0003949659,0.013129588],"genre_scores_gemma":[0.7699971,4.047862e-7,0.22864282,0.0012163974,0.00006647813,0.0000015794466,0.000003564126,0.0000021816281,0.000069458336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939394,0.000025610236,0.00012814626,0.0000953426,0.00020496185,0.00015198145],"domain_scores_gemma":[0.9994678,0.000018704592,0.000038918,0.00027261485,0.000082369384,0.00011959235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022476075,0.00006588451,0.00006901399,0.000058709764,0.00005991594,0.00016160695,0.00046018176,0.000022065684,0.000005258582],"category_scores_gemma":[0.000033415934,0.000050449282,0.000024790148,0.00020953869,0.000025741467,0.00060579664,0.00020820889,0.00007713711,0.0002850906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018849374,0.00001940866,0.00010987376,0.000003805116,0.000003789822,0.000002219929,0.0013293527,0.0024108822,0.0000052562796,0.89437217,0.012658474,0.08908291],"study_design_scores_gemma":[0.00016341146,0.000046450576,0.00078200514,0.000002358809,3.9106948e-7,0.000018934197,0.000026498043,0.9089706,0.000060048573,0.05780347,0.032044046,0.00008177542],"about_ca_topic_score_codex":0.00006004065,"about_ca_topic_score_gemma":0.0000020712437,"teacher_disagreement_score":0.9065597,"about_ca_system_score_codex":0.000014829976,"about_ca_system_score_gemma":0.000053561525,"threshold_uncertainty_score":0.3664358},"labels":[],"label_agreement":null},{"id":"W1971243765","doi":"10.1515/jmc-2013-0038","title":"Quantum computation of discrete logarithms in semigroups","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discrete logarithm; Mathematics; Discrete mathematics; Semigroup; Abelian group; Order (exchange); Quantum; Quantum algorithm; Constructive; Cryptosystem; Logarithm; Quantum computer; Pure mathematics; Combinatorics; Cryptography; Algorithm; Computer science; Public-key cryptography; Encryption; Quantum mechanics","score_opus":0.010417435029722071,"score_gpt":0.26236414663922075,"score_spread":0.25194671160949866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971243765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24213946,0.000041367297,0.75582886,0.0015934837,0.00018528411,0.00003601856,2.0002078e-7,0.000011096703,0.00016421101],"genre_scores_gemma":[0.7690515,0.000002064673,0.23081018,0.00006600348,0.00006344815,3.8976137e-7,1.2635664e-7,0.0000049095684,0.0000014053875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983557,0.00023293491,0.00078805303,0.00013714006,0.00027380497,0.00021238397],"domain_scores_gemma":[0.9986603,0.00046005356,0.00050072826,0.00018082923,0.000117372285,0.000080674006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010688775,0.00011307858,0.0005035441,0.00023223666,0.00002592483,0.000023438555,0.00054729875,0.00008656611,0.0000032504151],"category_scores_gemma":[0.00039439817,0.000081700964,0.00011638797,0.00024190199,0.000058055808,0.000116100695,0.00012824053,0.00032350505,0.000006669956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034689776,0.00038361605,0.0007261809,0.00022684153,0.000041768537,0.00007726727,0.0019043171,0.015762543,0.0010678238,0.94509786,0.00024450853,0.034432597],"study_design_scores_gemma":[0.00038324363,0.00032495058,0.0013333336,0.000115300005,0.0000050478775,0.00038144438,0.00003462205,0.61325645,0.00017854353,0.3838871,0.000035438024,0.000064488246],"about_ca_topic_score_codex":0.00000193127,"about_ca_topic_score_gemma":9.935962e-7,"teacher_disagreement_score":0.59749395,"about_ca_system_score_codex":0.000016523982,"about_ca_system_score_gemma":0.000038375205,"threshold_uncertainty_score":0.33316687},"labels":[],"label_agreement":null},{"id":"W1972659920","doi":"10.1142/s0129054103002059","title":"QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Turing machine; Quantum computer; Quantum Turing machine; Time hierarchy theorem; NSPACE; Polynomial; Bounded function; Super-recursive algorithm; Discrete mathematics; Computation; Quantum algorithm; Mathematics; Quantum; Computer science; Amplitude; Limit (mathematics); Algorithm; Universal Turing machine; Quantum error correction; Quantum mechanics; Mathematical analysis","score_opus":0.014772172591988519,"score_gpt":0.2881933680008781,"score_spread":0.27342119540888954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972659920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13809474,0.000029830468,0.8594268,0.00070890656,0.0014452299,0.000054473112,0.0000010388592,0.00002532132,0.00021363726],"genre_scores_gemma":[0.61524266,0.0000044614576,0.38461232,0.000059466132,0.00007409447,4.3045873e-7,5.3073654e-7,0.0000032180628,0.0000027959693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760455,0.0000791984,0.0005711682,0.0002521209,0.0012935355,0.00019941699],"domain_scores_gemma":[0.9961914,0.00024008763,0.00071438553,0.00026179862,0.0024792599,0.000113060254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007558363,0.00012734109,0.0001934597,0.0007870443,0.0001717125,0.0004548898,0.002088935,0.000024439856,0.000004287223],"category_scores_gemma":[0.0001582812,0.00009851309,0.00008098391,0.0011648595,0.00034835533,0.0011783919,0.00016191731,0.00017621869,0.0000030961578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042401447,0.0005539778,0.0021866264,0.000013109347,0.00018362197,0.000092010865,0.00158452,0.2805578,0.0040321024,0.5314194,0.00025839204,0.17907606],"study_design_scores_gemma":[0.0013727708,0.0009683377,0.026705785,0.000233612,0.000015466345,0.0017320563,0.000033992095,0.9196829,0.004282154,0.042463455,0.002187669,0.00032179896],"about_ca_topic_score_codex":0.000008477366,"about_ca_topic_score_gemma":0.0000011799373,"teacher_disagreement_score":0.6391251,"about_ca_system_score_codex":0.00008051082,"about_ca_system_score_gemma":0.00079362624,"threshold_uncertainty_score":0.4386513},"labels":[],"label_agreement":null},{"id":"W1972752828","doi":"10.1103/physreva.90.042315","title":"Fidelity threshold of the surface code beyond single-qubit error models","year":2014,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of British Columbia","funders":"Office of Naval Research; Conselho Nacional de Desenvolvimento Científico e Tecnológico; National Science Foundation","keywords":"Qubit; Fidelity; Noise (video); Code (set theory); Ising model; Coupling (piping); Statistical physics; Computer science; Quantum computer; Algorithm; Surface (topology); Error detection and correction; Toric code; Quantum; Physics; Mathematics; Quantum mechanics; Artificial intelligence; Engineering; Telecommunications","score_opus":0.02881138062066329,"score_gpt":0.28193141766338836,"score_spread":0.25312003704272507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972752828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37963632,0.012505939,0.58631206,0.013535517,0.00049319933,0.0008324435,0.000013510018,0.00023595012,0.0064350595],"genre_scores_gemma":[0.98910403,0.00011435657,0.008788705,0.001853199,0.00009848635,0.0000036377794,5.1784104e-7,0.000009131142,0.000027949705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998616,0.00015448166,0.0002670953,0.00034331746,0.00038140683,0.00023773393],"domain_scores_gemma":[0.9985039,0.00019617836,0.00016526814,0.0009757906,0.00008385929,0.000075009535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041242305,0.0001561479,0.0003963645,0.000008911902,0.00009132806,0.000032122793,0.0012022344,0.000019792333,0.0000017015876],"category_scores_gemma":[0.00009434288,0.00009213344,0.0002558516,0.00036880112,0.000083698586,0.0001137022,0.000502097,0.0002221153,0.000009105495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059244294,0.000942317,0.00011072959,0.002428133,0.00005907867,0.0000024147503,0.00095547084,0.21574153,0.007132505,0.51218605,0.004478857,0.25595698],"study_design_scores_gemma":[0.00006797727,0.000046475107,0.00010565037,0.00062977936,0.000013544504,0.000002528904,4.2946138e-7,0.8769889,0.00091409194,0.118594974,0.0025259159,0.00010975712],"about_ca_topic_score_codex":0.0000105066965,"about_ca_topic_score_gemma":0.0000018318907,"teacher_disagreement_score":0.6612474,"about_ca_system_score_codex":0.000012773103,"about_ca_system_score_gemma":0.000032722637,"threshold_uncertainty_score":0.37570927},"labels":[],"label_agreement":null},{"id":"W1972878144","doi":"10.1080/09500340308235203","title":"Combined error correction techniques for quantum computing architectures","year":2003,"lang":"en","type":"article","venue":"Journal of Modern Optics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoherence-free subspaces; Computer science; Dynamical decoupling; Quantum error correction; Quantum decoherence; Controllability; Quantum computer; Error detection and correction; Linear subspace; Coherence (philosophical gambling strategy); Quantum; Set (abstract data type); Theoretical computer science; Algorithm; Mathematics; Quantum mechanics; Physics; Applied mathematics","score_opus":0.016628771145791692,"score_gpt":0.267445943721538,"score_spread":0.2508171725757463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972878144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11447703,0.00015273785,0.8828887,0.00043596592,0.0016518696,0.00015003646,9.831328e-7,0.00009492877,0.00014775744],"genre_scores_gemma":[0.60676914,0.0000048849597,0.39285463,0.00013990457,0.0001846424,9.1390046e-7,3.0252798e-7,0.000014443488,0.000031130083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848133,0.00011001286,0.00054606784,0.00020830175,0.00033393604,0.0003203508],"domain_scores_gemma":[0.9983533,0.00037846828,0.00053793396,0.0002728208,0.00033759023,0.000119885706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008620135,0.00018951032,0.0003295751,0.00022848508,0.00021943088,0.00015533823,0.00061190303,0.00008793448,8.2369223e-7],"category_scores_gemma":[0.0002929815,0.00015382201,0.000217569,0.00020480748,0.00004047876,0.00009719024,0.00007661993,0.00043178076,6.32426e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012673269,0.0005236507,0.0003602078,0.00010400246,0.00018038103,0.00006791545,0.0041064853,0.39335433,0.0044707255,0.040123604,0.0024846552,0.5540973],"study_design_scores_gemma":[0.00045421135,0.00078650704,0.00013944335,0.00009746019,0.000015830617,0.00044463677,0.000020250145,0.9387711,0.005684864,0.052462496,0.00094202836,0.0001811716],"about_ca_topic_score_codex":0.0000015697193,"about_ca_topic_score_gemma":8.399846e-7,"teacher_disagreement_score":0.55391616,"about_ca_system_score_codex":0.00005148846,"about_ca_system_score_gemma":0.00013704572,"threshold_uncertainty_score":0.62726796},"labels":[],"label_agreement":null},{"id":"W1972886442","doi":"10.1142/s0217979202009998","title":"A QUANTUM PERCEPTRON","year":2002,"lang":"en","type":"article","venue":"International Journal of Modern Physics B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Hyperplane; Separable space; Perceptron; Quantum; Superposition principle; Computer science; Unitary state; Quantum algorithm; Quantum computer; Artificial intelligence; Mathematics; Artificial neural network; Physics; Quantum mechanics; Combinatorics; Mathematical analysis","score_opus":0.01883121382937741,"score_gpt":0.2496771086391568,"score_spread":0.23084589480977938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972886442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08994967,0.00022960494,0.9053124,0.0025848572,0.0012935196,0.000019495055,0.0000016427153,0.000028622413,0.0005801506],"genre_scores_gemma":[0.97795033,0.000030335235,0.020600876,0.0003260192,0.0010082921,3.319711e-7,3.3905263e-7,0.0000075917665,0.00007590821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988363,0.000032281107,0.00025921044,0.00012803465,0.0006077848,0.00013642405],"domain_scores_gemma":[0.99916387,0.00005387407,0.0002372989,0.00016355948,0.0003134959,0.0000679165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012250947,0.000096727286,0.00012859388,0.000082383405,0.000042323518,0.00014831561,0.001315506,0.000024785895,0.00001976678],"category_scores_gemma":[0.000018840738,0.000080019934,0.0001536893,0.00008518887,0.000024013803,0.00036756962,0.00015271596,0.00023606714,0.00003094624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008754243,0.00028307107,0.00018167488,0.0000029513071,0.00013166801,0.00014756234,0.0025633664,0.03542595,0.0023473743,0.0338299,0.0023633658,0.92271435],"study_design_scores_gemma":[0.00030004635,0.00007412988,0.0002906791,0.00003059401,0.0000033321887,0.0002065548,0.0000045232673,0.9097511,0.00026682028,0.08734907,0.0016366468,0.00008649912],"about_ca_topic_score_codex":0.0000022628037,"about_ca_topic_score_gemma":1.6943041e-7,"teacher_disagreement_score":0.92262787,"about_ca_system_score_codex":0.000040898758,"about_ca_system_score_gemma":0.000022219445,"threshold_uncertainty_score":0.3263118},"labels":[],"label_agreement":null},{"id":"W1973682419","doi":"10.1016/j.ic.2004.04.001","title":"The query complexity of order-finding","year":2004,"lang":"en","type":"article","venue":"Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bounded function; Permutation (music); Constant (computer programming); Order (exchange); Mathematics; Combinatorics; Exponential function; Probabilistic logic; Time complexity; Polynomial; Discrete mathematics; Computer science; Statistics","score_opus":0.019177646412394434,"score_gpt":0.25577197056809226,"score_spread":0.2365943241556978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973682419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13412724,0.000031482872,0.86374503,0.0013585889,0.00015113989,0.00006989025,7.642153e-7,0.00006307263,0.00045278153],"genre_scores_gemma":[0.939118,0.000009201936,0.06066627,0.00018281954,0.000014348284,0.0000015108296,0.0000046774353,0.0000012333238,0.0000018843386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944466,0.000019935424,0.00023229307,0.000058015412,0.00015118223,0.000093886796],"domain_scores_gemma":[0.999559,0.00006279893,0.00014890016,0.00009440036,0.000107454485,0.000027452063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020482781,0.000056974313,0.00006213435,0.000060639446,0.00027916583,0.00016729021,0.00016715929,0.000020633626,2.801212e-7],"category_scores_gemma":[0.000026313426,0.00004065846,0.000018719382,0.0002443521,0.0000754366,0.0005040687,0.000078882615,0.00006751547,0.0000057699112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036007507,0.000010063731,0.00005344177,0.000018850453,0.000005969725,2.462811e-7,0.0030216961,0.1143641,0.000018009525,0.391871,0.000036597943,0.4905964],"study_design_scores_gemma":[0.00035510454,0.000051327,0.007423207,0.000021584483,0.000001270307,0.000018960944,0.000119416836,0.9135114,0.00022325973,0.07713838,0.0010638341,0.00007228493],"about_ca_topic_score_codex":0.00003642106,"about_ca_topic_score_gemma":0.000004336514,"teacher_disagreement_score":0.8049908,"about_ca_system_score_codex":0.0000129686505,"about_ca_system_score_gemma":0.00004700535,"threshold_uncertainty_score":0.2147146},"labels":[],"label_agreement":null},{"id":"W1973829489","doi":"10.1103/physreva.83.052305","title":"Quantum error correction with degenerate codes for correlated noise","year":2011,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Degenerate energy levels; Quantum; Quantum error correction; Noise (video); Upper and lower bounds; Error detection and correction; Quantum noise; Probability of error; Quantum mechanics; Mathematics; Algorithm; Physics; Computer science; Quantum computer; Statistical physics; Discrete mathematics; Image (mathematics); Mathematical analysis","score_opus":0.028004309183636538,"score_gpt":0.27650230958823263,"score_spread":0.2484980004045961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973829489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10658708,0.003759931,0.8870284,0.0004458078,0.0007614752,0.0007334906,0.0000036081728,0.00034194,0.00033825953],"genre_scores_gemma":[0.9601467,0.00051888503,0.037635766,0.0011444216,0.00025033622,0.00013507885,0.000007509976,0.000029584324,0.00013170889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989576,0.000069736416,0.00017350687,0.00037700773,0.00015616084,0.0002660034],"domain_scores_gemma":[0.9991838,0.00010883539,0.00012296642,0.0003657833,0.000116085575,0.00010257847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016187443,0.00017726827,0.0003238786,0.00002845782,0.00012960332,0.000033630477,0.0003991426,0.000020481632,0.0000035418964],"category_scores_gemma":[0.000051632276,0.00011692264,0.00012345884,0.00036904495,0.000041496944,0.00011996841,0.00007528756,0.00015706976,0.00003371181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016101958,0.001632367,0.00042057762,0.002365442,0.00022904358,0.000052239488,0.0031109038,0.0032204227,0.0021458813,0.12626816,0.014535687,0.8458583],"study_design_scores_gemma":[0.00023649637,0.0004857494,0.00063806394,0.0009174257,0.000046673442,0.000029493176,0.000002512468,0.98839146,0.001597338,0.0043545286,0.003055679,0.00024456438],"about_ca_topic_score_codex":0.00002489742,"about_ca_topic_score_gemma":0.000004122648,"teacher_disagreement_score":0.9851711,"about_ca_system_score_codex":0.0000138537835,"about_ca_system_score_gemma":0.000049416307,"threshold_uncertainty_score":0.4767967},"labels":[],"label_agreement":null},{"id":"W1974100078","doi":"10.1109/mwscas.2010.5548653","title":"Lowering the Quantum Gate Cost of Reversible Circuits","year":2010,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Quantum circuit; Quantum gate; Realization (probability); Electronic circuit; Quantum computer; Quantum; Logic gate; Quantum Fourier transform; Binary number; Computer science; Square root; Quantum algorithm; Topology (electrical circuits); Physics; Quantum network; Algorithm; Electrical engineering; Arithmetic; Mathematics; Quantum mechanics; Engineering","score_opus":0.011299175309394473,"score_gpt":0.23106515307423475,"score_spread":0.21976597776484028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974100078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3346157,0.00003073273,0.6560659,0.0020425243,0.0013649018,0.0001496511,0.00000118282,0.00016650732,0.0055628996],"genre_scores_gemma":[0.991438,0.0000026132193,0.00802298,0.00021383377,0.00008108231,0.0000018249784,2.3635128e-7,0.0000053226227,0.00023411674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999222,0.000019360446,0.00015101879,0.00020800179,0.00018352453,0.0002160899],"domain_scores_gemma":[0.99909115,0.00013036201,0.00006895571,0.0006011113,0.000054003303,0.000054413445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034267677,0.00008831355,0.00010496312,0.00004647295,0.0001397846,0.000069121124,0.001032404,0.000035992416,0.000027886808],"category_scores_gemma":[0.000038501,0.00005429736,0.00006105597,0.00029931642,0.00006701671,0.00009746935,0.00028622083,0.00028009515,0.000025455058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037960908,0.00015279367,0.0009841652,0.00005915323,0.000051457177,0.0000322236,0.0027237318,0.013103164,0.0811581,0.40075797,0.0041237087,0.49684975],"study_design_scores_gemma":[0.00017649755,0.00004831095,0.0022679889,0.000021111216,0.0000031391714,0.000051538074,0.000019267474,0.9627705,0.018635487,0.006139174,0.009710997,0.0001559765],"about_ca_topic_score_codex":0.000051763716,"about_ca_topic_score_gemma":0.000016172644,"teacher_disagreement_score":0.94966733,"about_ca_system_score_codex":0.0000035357396,"about_ca_system_score_gemma":0.00004074066,"threshold_uncertainty_score":0.2214182},"labels":[],"label_agreement":null},{"id":"W1974241974","doi":"10.1109/isit.2012.6284203","title":"Quantum polar codes for arbitrary channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum capacity; Quantum channel; Amplitude damping channel; Quantum error correction; Quantum network; Quantum information; Qubit; Quantum; Classical capacity","score_opus":0.017458783693415605,"score_gpt":0.25292408307776465,"score_spread":0.23546529938434904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974241974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046881523,0.00043122686,0.9483386,0.0015331971,0.0013074098,0.00016144289,0.0000044402727,0.00035325982,0.0009888557],"genre_scores_gemma":[0.77329546,0.0000027790898,0.22469415,0.0010585432,0.000649038,0.0000118161815,0.0000029684732,0.00001091314,0.00027432723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989724,0.000029368211,0.00014050127,0.00022043209,0.00013639798,0.000500858],"domain_scores_gemma":[0.9992936,0.00015223847,0.00004129699,0.00032675453,0.0000323226,0.00015374464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003359923,0.00012762641,0.00013772286,0.00006896931,0.00016846631,0.00010172668,0.00054271676,0.0000476147,0.000009229252],"category_scores_gemma":[0.000023856313,0.00009775586,0.00009158104,0.00016697413,0.000022806315,0.0002999514,0.00015740747,0.00010193399,0.00003740126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054084553,0.00017064264,0.0006185926,0.000034908062,0.000031064617,0.000002322084,0.0014541745,0.00035105183,0.00072969473,0.93641055,0.006976945,0.053214632],"study_design_scores_gemma":[0.00023617892,0.00011097559,0.00088530534,0.000014217501,0.0000040256346,0.00003796919,0.000020587746,0.9281903,0.0035480966,0.027555814,0.039126374,0.0002701886],"about_ca_topic_score_codex":0.000019084468,"about_ca_topic_score_gemma":5.108023e-7,"teacher_disagreement_score":0.9278392,"about_ca_system_score_codex":0.000008540976,"about_ca_system_score_gemma":0.000024489387,"threshold_uncertainty_score":0.39863682},"labels":[],"label_agreement":null},{"id":"W1975313455","doi":"10.1142/s1230161208000043","title":"A Decoupling Approach to the Quantum Capacity","year":2008,"lang":"en","type":"article","venue":"Open Systems & Information Dynamics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":173,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Tensor product; Coherent information; Mathematics; Covariant transformation; Decoherence-free subspaces; Quantum information; Quantum; Quantum channel; Unitary state; Statistical physics; Discrete mathematics; Topology (electrical circuits); Pure mathematics; Quantum mechanics; Physics; Combinatorics","score_opus":0.023804701772349474,"score_gpt":0.22831127572590854,"score_spread":0.20450657395355906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975313455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04905967,0.000014093394,0.9375444,0.0005252361,0.00075245707,0.00078981475,0.000012842483,0.0001313131,0.01117017],"genre_scores_gemma":[0.9467823,0.000003475733,0.052284375,0.0005880969,0.00009228781,0.00007572173,0.000024464383,0.000008029012,0.0001412372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985957,0.000065409076,0.00046939257,0.00019395187,0.0003807386,0.00029481266],"domain_scores_gemma":[0.9987017,0.000060197428,0.00022087265,0.00074532855,0.00015862017,0.00011326095],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008309477,0.00015897003,0.00020200446,0.00011038382,0.0007733276,0.0011020855,0.002454523,0.000060945422,6.1777365e-7],"category_scores_gemma":[0.000045530196,0.00010911501,0.000052298143,0.00060580357,0.000030123043,0.0015531946,0.0007919849,0.00021749732,0.00016011416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004159939,0.000032594984,0.00016029096,0.00004224761,0.000020158162,0.0000013746911,0.012767925,0.744873,0.0000011012827,0.2278652,0.002378025,0.011853928],"study_design_scores_gemma":[0.00014388248,0.000027114593,0.00047821764,0.000027244074,0.0000016011961,0.00026569454,0.00036605838,0.98174495,0.000001599871,0.0001040524,0.016671583,0.00016801344],"about_ca_topic_score_codex":0.00052601926,"about_ca_topic_score_gemma":0.00001339287,"teacher_disagreement_score":0.89772266,"about_ca_system_score_codex":0.000104665174,"about_ca_system_score_gemma":0.000099867946,"threshold_uncertainty_score":0.99993485},"labels":[],"label_agreement":null},{"id":"W1975390844","doi":"10.1560/ijc_46_4_371","title":"Optimal Algorithmic Cooling of Spins","year":2006,"lang":"en","type":"article","venue":"Israel Journal of Chemistry","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Spins; Chemistry; Molecule; Entropy (arrow of time); Spin (aerodynamics); Statistical physics; Physics; Quantum mechanics; Thermodynamics; Condensed matter physics","score_opus":0.004771140615066087,"score_gpt":0.21549053115732877,"score_spread":0.21071939054226269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975390844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6646468,0.0005374436,0.33386847,0.00018042063,0.00015323321,0.000016881668,0.0000018462039,0.000019728292,0.00057517394],"genre_scores_gemma":[0.8237211,0.0000072000016,0.17553662,0.000032749544,0.00061913277,1.9271096e-7,6.4190164e-7,0.0000078801595,0.00007448848],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998782,0.000017387249,0.0005051763,0.00013925892,0.00034875917,0.0002074133],"domain_scores_gemma":[0.9989246,0.00005759046,0.00050407206,0.00023795814,0.00019982667,0.00007594256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028789465,0.00012396445,0.0002529905,0.000052817963,0.000049213868,0.000053279586,0.0008169291,0.00006471213,0.0000066761577],"category_scores_gemma":[0.000027557697,0.0001061704,0.00016954035,0.0002013436,0.00005576189,0.00012400014,0.00012097598,0.00030311706,0.0000014520724],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005826746,0.0005099142,0.00092022755,0.00027071856,0.00013617624,0.00068879203,0.00042141622,0.22047985,0.71179944,0.0009923725,0.0022500078,0.061472807],"study_design_scores_gemma":[0.0010536849,0.00013821782,0.0013958567,0.00024811167,0.000022822169,0.002442898,0.000047132908,0.3130189,0.6774157,0.0015676793,0.002340068,0.00030890215],"about_ca_topic_score_codex":0.000012990428,"about_ca_topic_score_gemma":1.2848878e-7,"teacher_disagreement_score":0.1590743,"about_ca_system_score_codex":0.00002337785,"about_ca_system_score_gemma":0.0001248888,"threshold_uncertainty_score":0.43295035},"labels":[],"label_agreement":null},{"id":"W1975650268","doi":"10.1109/tit.2013.2246815","title":"Degenerate Viterbi Decoding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Compute Canada","keywords":"Convolutional code; Sequential decoding; Algorithm; Soft output Viterbi algorithm; Decoding methods; List decoding; Computer science; Iterative Viterbi decoding; Viterbi decoder; Viterbi algorithm; Mathematics; Block code; Theoretical computer science; Concatenated error correction code","score_opus":0.006319225856570922,"score_gpt":0.2022957069418615,"score_spread":0.1959764810852906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975650268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02349885,0.0000069084617,0.9731034,0.00036658527,0.00080790545,0.00015098747,0.000003348086,0.00033209033,0.0017299276],"genre_scores_gemma":[0.9612114,0.0000052738365,0.036916513,0.0015827954,0.000035909237,0.000041569583,0.0000015045434,0.00000588434,0.0001991419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916387,0.00007044876,0.00025820168,0.00011991664,0.00017463263,0.00021295022],"domain_scores_gemma":[0.99930966,0.00012016634,0.000078769976,0.00032571587,0.00008066569,0.000085031716],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024941796,0.00012612049,0.000090249414,0.00022908169,0.00031634938,0.00034451907,0.0003879234,0.00005208058,0.00013176913],"category_scores_gemma":[0.0000041695694,0.0001073732,0.000074156866,0.00028466913,0.00002737761,0.0018173819,0.0000031769246,0.00019854643,0.0012464059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043556024,0.000023725306,6.361198e-7,0.0000096798085,0.0000148094605,4.1769746e-7,0.0015901382,0.10275204,0.0002809836,0.018143242,0.0002797462,0.8769002],"study_design_scores_gemma":[0.00025948556,0.000065657136,0.000050430965,0.000022898566,0.0000037799443,0.000025897654,0.000063076244,0.96252096,0.021987706,0.013491788,0.0013049683,0.00020337169],"about_ca_topic_score_codex":0.000009684975,"about_ca_topic_score_gemma":5.336554e-7,"teacher_disagreement_score":0.93771255,"about_ca_system_score_codex":0.000028007953,"about_ca_system_score_gemma":0.000027914315,"threshold_uncertainty_score":0.9995312},"labels":[],"label_agreement":null},{"id":"W1975768144","doi":"10.1103/physrevlett.111.130504","title":"Solovay-Kitaev Decomposition Strategy for Single-Qubit Channels","year":2013,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Controlled NOT gate; Qubit; Unitary state; Decomposition; Physics; Channel (broadcasting); Topology (electrical circuits); Computer science; Quantum computer; Quantum; Quantum gate; Algorithm; Quantum mechanics; Mathematics; Combinatorics; Biology; Telecommunications","score_opus":0.023661287641693386,"score_gpt":0.2937585774811178,"score_spread":0.2700972898394244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975768144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15640225,0.0026117724,0.7943479,0.044141207,0.00051969313,0.0014523753,0.0000038623057,0.00032148935,0.0001994847],"genre_scores_gemma":[0.9433311,0.00013244616,0.026424823,0.029031169,0.0008171573,0.00021413635,0.000013248381,0.0000246585,0.0000112441085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864626,0.000075616466,0.00023334158,0.000433383,0.0002069365,0.0004044411],"domain_scores_gemma":[0.9990906,0.00020628831,0.000112526446,0.00040434222,0.000065559274,0.00012066693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013544079,0.00020558461,0.0003473287,0.000037101927,0.00012236577,0.00019616874,0.0006091441,0.000011893736,0.0000076241263],"category_scores_gemma":[0.000024362966,0.00016286079,0.0002470804,0.00023416543,0.00004016251,0.00030305682,0.00011529823,0.00015018666,0.0001661394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004240383,0.000537553,0.000007413923,0.0018160739,0.000093283736,0.000015411302,0.00041612505,0.015976155,0.15785187,0.0128567405,0.03786706,0.7725581],"study_design_scores_gemma":[0.000278807,0.0002887546,0.000107040665,0.0009875756,0.00002876615,0.000028417902,0.0000016369733,0.9790694,0.0022683577,0.009562431,0.0069224653,0.00045634224],"about_ca_topic_score_codex":0.000009133182,"about_ca_topic_score_gemma":1.0701923e-7,"teacher_disagreement_score":0.9630932,"about_ca_system_score_codex":0.000026345228,"about_ca_system_score_gemma":0.000013154089,"threshold_uncertainty_score":0.664127},"labels":[],"label_agreement":null},{"id":"W1976093200","doi":"10.1103/physreva.90.032305","title":"Quantum subsystems: Exploring the complementarity of quantum privacy and error correction","year":2014,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Guelph; Perimeter Institute; University of Waterloo","funders":"","keywords":"Quantum error correction; Quantum; Quantum capacity; Complementarity (molecular biology); Computer science; Quantum network; Quantum cryptography; Error detection and correction; Quantum channel; Unitary state; Subspace topology; Quantum operation; Quantum information; Theoretical computer science; Mathematics; Quantum mechanics; Open quantum system; Physics; Algorithm; Law","score_opus":0.04725348362772954,"score_gpt":0.30325091399190324,"score_spread":0.2559974303641737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976093200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.758203,0.0034073505,0.23386362,0.002882889,0.0009479854,0.0004750551,0.0000015898056,0.000120074896,0.00009840323],"genre_scores_gemma":[0.9982308,0.000438052,0.00081066723,0.00029984815,0.00017954098,0.000029252205,0.000001036034,0.0000073141996,0.0000034782029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865973,0.00027546144,0.0002880859,0.00030029286,0.00026848793,0.00020795687],"domain_scores_gemma":[0.9987415,0.00042709062,0.00017788833,0.00052988064,0.000056509918,0.00006711255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006163667,0.00014511963,0.00037551322,0.000024537985,0.00015859876,0.000045215795,0.000548116,0.00000884397,0.0000012677151],"category_scores_gemma":[0.00015594705,0.00008963026,0.000109401415,0.00029065658,0.0000669936,0.00014582663,0.000328237,0.00019351362,0.0000072436856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008301348,0.0003612163,0.0010651024,0.0031498652,0.00006856217,0.0000023715959,0.003673556,0.00041869847,0.0008832429,0.44655845,0.0023277216,0.5414829],"study_design_scores_gemma":[0.00012201583,0.00015806223,0.005356064,0.00125458,0.000022409253,0.00001333075,0.000017114173,0.9699065,0.00022858697,0.009130916,0.013650281,0.00014013457],"about_ca_topic_score_codex":0.000117849064,"about_ca_topic_score_gemma":0.0000032282276,"teacher_disagreement_score":0.9694878,"about_ca_system_score_codex":0.000012435069,"about_ca_system_score_gemma":0.000016771903,"threshold_uncertainty_score":0.36550158},"labels":[],"label_agreement":null},{"id":"W1976250409","doi":"10.1023/b:ijtp.0000048590.80223.90","title":"Adiabatic Quantum Gates","year":2004,"lang":"en","type":"article","venue":"International Journal of Theoretical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Adiabatic process; Unitary transformation; Quantum gate; Physics; Quantum mechanics; Quantum logic; Unitary state; Theoretical physics; Quantum; Quantum computer; Mathematics; Algebra over a field; Pure mathematics","score_opus":0.006111630637159007,"score_gpt":0.24814259998187738,"score_spread":0.24203096934471838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976250409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09092156,0.00005957356,0.89911443,0.0077834725,0.0015525323,0.000025833266,0.0000016065412,0.000029198942,0.0005118178],"genre_scores_gemma":[0.95940065,0.000010632194,0.039260328,0.00051017536,0.000806922,3.1864636e-7,5.0270484e-7,0.0000071182053,0.0000033404708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988287,0.000037946604,0.00030191705,0.00011931164,0.00055740075,0.00015473469],"domain_scores_gemma":[0.99905175,0.0001632566,0.00019524436,0.00015559251,0.00033143745,0.00010269675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023851726,0.000102226426,0.0001495183,0.00006817644,0.000038969192,0.00014940619,0.0013951636,0.000029295907,0.0000122364145],"category_scores_gemma":[0.00013033416,0.000076386095,0.00016576768,0.00012405858,0.0001637893,0.00023104929,0.00017770028,0.00026210916,0.000025910129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009402212,0.00010192233,0.0000148668205,0.0000017743614,0.00005288471,0.000077937824,0.00025451987,0.016373489,0.0003217639,0.9619321,0.000049003327,0.020810321],"study_design_scores_gemma":[0.0004280332,0.00013681248,0.000104652136,0.000075612916,0.000006016398,0.00020677556,0.000007545639,0.0908762,0.0030083044,0.9048518,0.00021081211,0.0000874463],"about_ca_topic_score_codex":0.0000016264369,"about_ca_topic_score_gemma":4.9435975e-8,"teacher_disagreement_score":0.8684791,"about_ca_system_score_codex":0.000053703512,"about_ca_system_score_gemma":0.000098067256,"threshold_uncertainty_score":0.31149346},"labels":[],"label_agreement":null},{"id":"W1976944844","doi":"10.1088/1367-2630/17/4/043004","title":"Quantum circuit design for accurate simulation of qudit channels","year":2015,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures; National Science Foundation","keywords":"Physics; Quantum; Hilbert space; Quadratic equation; Quantum error correction; Logarithm; Quantum capacity; Quantum computer; Quantum circuit; Quantum algorithm; Electronic circuit; Dimension (graph theory); Norm (philosophy); Topology (electrical circuits); Quantum mechanics; Pure mathematics; Quantum network; Law; Mathematical analysis; Mathematics; Combinatorics","score_opus":0.09299656562377633,"score_gpt":0.3039697487901203,"score_spread":0.21097318316634395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976944844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015193567,0.00011133311,0.98344225,0.00023499128,0.0008904474,0.00009551234,0.0000011638622,0.00001729986,0.000013432171],"genre_scores_gemma":[0.9283561,0.0000024465853,0.070359126,0.00005758998,0.0011927593,3.9524264e-7,3.6138192e-7,0.000009407549,0.000021809932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900305,0.000058916747,0.00034252845,0.00011386886,0.00031749913,0.000164134],"domain_scores_gemma":[0.9983358,0.00030907613,0.0005740358,0.0001806338,0.00045721236,0.00014324916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050664746,0.00010286758,0.00023778217,0.00006051667,0.000042331358,0.000060617982,0.000530045,0.00003549795,5.574368e-7],"category_scores_gemma":[0.000115090916,0.00008402788,0.00012704932,0.00023608225,0.00001718307,0.00032446,0.000052709576,0.00013070246,0.0000018555588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001733161,0.00003012722,0.0000034156276,0.000008849187,0.00002076082,0.000002516648,0.0011509482,0.91409004,0.0004618467,0.005692288,0.001077588,0.0774443],"study_design_scores_gemma":[0.0006112695,0.0004892472,0.000014673059,0.000046814454,0.000010325742,0.000012470546,0.000012196633,0.8225582,0.0036750631,0.17184836,0.00064431934,0.00007703628],"about_ca_topic_score_codex":0.000004789551,"about_ca_topic_score_gemma":9.0062294e-8,"teacher_disagreement_score":0.9131625,"about_ca_system_score_codex":0.000031554257,"about_ca_system_score_gemma":0.00038622986,"threshold_uncertainty_score":0.34265578},"labels":[],"label_agreement":null},{"id":"W1977085333","doi":"10.1140/epjst/e2015-02344-2","title":"Quantum annealing: The fastest route to quantum computation?","year":2015,"lang":"en","type":"article","venue":"The European Physical Journal Special Topics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum annealing; Adiabatic process; Hamiltonian (control theory); Adiabatic quantum computation; Scaling; Quantum; Computation; Quantum phase transition; Quantum computer; Physics; Quantum phases; Statistical physics; Quantum mechanics; Computer science; Mathematics; Algorithm; Mathematical optimization; Geometry","score_opus":0.031069306391175125,"score_gpt":0.27368100724188776,"score_spread":0.24261170085071265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977085333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28776103,0.0001857958,0.47511148,0.09603997,0.012240509,0.00068925746,0.000011147925,0.00048406987,0.12747675],"genre_scores_gemma":[0.7392317,0.000008466774,0.007397167,0.0032456683,0.24944401,0.0000019322404,0.0000023683256,0.00006587614,0.00060281734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975315,0.0008287728,0.00032380942,0.0002746773,0.0006299079,0.00041134833],"domain_scores_gemma":[0.9986203,0.00019373452,0.00017931403,0.0004727476,0.00019516164,0.00033878346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011695258,0.00021193297,0.00021020428,0.00004841584,0.0006946793,0.000801849,0.0021097101,0.000017778846,0.0000012482471],"category_scores_gemma":[0.00013618398,0.00011155973,0.00015846721,0.0004817148,0.000097457225,0.00015931737,0.0006870796,0.0007310957,0.00025329573],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001523493,0.00011406418,0.000028431445,0.000002483307,0.000032484793,0.00015165951,0.011245573,0.06488913,0.0000377455,0.050003074,0.02752534,0.8459548],"study_design_scores_gemma":[0.00058124826,0.000542226,0.0045711226,0.000049953767,0.0000217272,0.00041789602,0.0003491168,0.53909063,0.000045468856,0.1358325,0.31808084,0.0004172432],"about_ca_topic_score_codex":0.000009217877,"about_ca_topic_score_gemma":0.0000020447303,"teacher_disagreement_score":0.84553754,"about_ca_system_score_codex":0.000052498064,"about_ca_system_score_gemma":0.00008679934,"threshold_uncertainty_score":0.77322483},"labels":[],"label_agreement":null},{"id":"W1977289494","doi":"10.1103/physrevlett.107.160501","title":"Demonstration of Sufficient Control for Two Rounds of Quantum Error Correction in a Solid State Ensemble Quantum Information Processor","year":2011,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Quantum error correction; Quantum computer; Qubit; Quantum information; Physics; Quantum algorithm; Quantum; Dynamical decoupling; Error detection and correction; Computer science; Decoupling (probability); Hamiltonian (control theory); Quantum mechanics; Algorithm; Mathematics","score_opus":0.018326986263211737,"score_gpt":0.2824946950460191,"score_spread":0.2641677087828074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977289494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37650403,0.00015686205,0.6221454,0.00048259436,0.00018094377,0.00048629392,0.000004409419,0.000025674464,0.000013748389],"genre_scores_gemma":[0.9964371,0.000046644247,0.0024864033,0.00093409186,0.000027335518,0.000056644334,0.000005229177,0.00000581735,7.6391063e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986733,0.00009066311,0.000568707,0.00019336757,0.00024357194,0.00023034187],"domain_scores_gemma":[0.99895054,0.00015035708,0.00046970154,0.00023100169,0.00015479677,0.000043615022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043959683,0.00014307737,0.00041122048,0.000104210594,0.000033829056,0.00001942911,0.00030226572,0.000010411523,5.0230796e-7],"category_scores_gemma":[0.00008584252,0.00011806422,0.00013884212,0.0004112306,0.000051181545,0.00042782119,0.000036505313,0.00012298409,0.000002772736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058793335,0.0036470734,0.0018835226,0.017908065,0.00023408595,0.000009188897,0.03568614,0.21707666,0.107465655,0.07510995,0.0028163858,0.53757536],"study_design_scores_gemma":[0.00051870797,0.00027557884,0.0010751544,0.0008194047,0.000018668354,0.0000034240957,0.00001497243,0.9918008,0.004194951,0.0010906408,0.00005938205,0.00012830381],"about_ca_topic_score_codex":0.000066644134,"about_ca_topic_score_gemma":0.0000068766462,"teacher_disagreement_score":0.7747241,"about_ca_system_score_codex":0.000026718857,"about_ca_system_score_gemma":0.000060119637,"threshold_uncertainty_score":0.48145193},"labels":[],"label_agreement":null},{"id":"W1979275900","doi":"10.1007/s10623-014-9934-8","title":"Quantum codes from nearly self-orthogonal quaternary linear codes","year":2014,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Quantum convolutional code; Quantum; Linear code; Orthogonality; Mathematics; Discrete mathematics; Code (set theory); Minimum distance; Error detection and correction; Expander code; Combinatorics; Physics; Block code; Quantum mechanics; Algorithm; Computer science; Decoding methods; Geometry; Set (abstract data type)","score_opus":0.012815740740361412,"score_gpt":0.22674125120547778,"score_spread":0.21392551046511638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979275900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41976717,0.0005712667,0.5783913,0.00033082254,0.00023896815,0.00011089286,0.000027409207,0.00043832065,0.00012384301],"genre_scores_gemma":[0.76453775,0.00017719048,0.23416409,0.0006958931,0.00034682697,0.000013542658,0.00002955432,0.000028975603,0.000006151616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973116,0.00032717397,0.00041264115,0.00088735076,0.00045519683,0.00060606404],"domain_scores_gemma":[0.99818885,0.00053066073,0.00017531085,0.0006879505,0.000106218016,0.00031101806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005505786,0.00042818912,0.0004867327,0.0002698873,0.0005156757,0.00051868,0.00093316176,0.00015782785,0.0000126048935],"category_scores_gemma":[0.00002451411,0.00036039486,0.00024341965,0.00057577476,0.00019232316,0.00026004427,0.00030249814,0.00036357343,0.000023387163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024462075,0.0014722083,0.105634354,0.00027196345,0.0013485382,0.00028763973,0.011125818,0.0094006425,0.013921975,0.57273823,0.0049230857,0.2786309],"study_design_scores_gemma":[0.000589339,0.00048920943,0.013567969,0.000080367165,0.00003786317,0.000037645063,0.000045036224,0.9276363,0.000656308,0.04747957,0.008778688,0.0006016611],"about_ca_topic_score_codex":0.0003260899,"about_ca_topic_score_gemma":0.000020422467,"teacher_disagreement_score":0.9182357,"about_ca_system_score_codex":0.000008227204,"about_ca_system_score_gemma":0.000042442392,"threshold_uncertainty_score":0.9998848},"labels":[],"label_agreement":null},{"id":"W1979398621","doi":"10.1088/1751-8113/45/5/059501","title":"Corrigendum: Distillability and PPT entanglement of low-rank quantum states","year":2012,"lang":"en","type":"erratum","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Rank (graph theory); Physics; Quantum mechanics; Quantum; Statistical physics; Mathematics; Combinatorics","score_opus":0.008887326209134351,"score_gpt":0.23460032933295935,"score_spread":0.225713003123825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979398621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12192304,0.00444865,0.8582329,0.0023856212,0.010669944,0.00054553826,0.00012182277,0.00006116522,0.0016112791],"genre_scores_gemma":[0.9682495,0.00052303873,0.02850405,0.0001271944,0.0021805998,0.000003954031,0.00001092437,0.000055026074,0.00034569335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976323,0.00016669864,0.0008782226,0.00027980763,0.0006692861,0.00037367584],"domain_scores_gemma":[0.99794257,0.0005140575,0.0006197691,0.00037298803,0.00021555724,0.0003350882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000949038,0.00033721465,0.0009606341,0.00006679333,0.000079572805,0.00011415649,0.00054222206,0.00017437834,0.00004125915],"category_scores_gemma":[0.00015578182,0.00021544051,0.00023092737,0.00014115802,0.00088683586,0.00011758805,0.0005077815,0.00087723794,0.0000027045319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018391887,0.00042771213,0.000014276941,0.00086786406,0.00009506768,0.000016774566,0.001037002,0.0000033258239,0.000018917164,0.9819964,0.0046336316,0.010870622],"study_design_scores_gemma":[0.00027552614,0.00038869926,0.00006882283,0.000712476,0.00009326009,0.00016148025,0.000041646737,0.12856095,0.0001167242,0.8683798,0.0009769583,0.00022368565],"about_ca_topic_score_codex":9.129774e-7,"about_ca_topic_score_gemma":7.199289e-8,"teacher_disagreement_score":0.8463265,"about_ca_system_score_codex":0.000023626028,"about_ca_system_score_gemma":0.00010181626,"threshold_uncertainty_score":0.87854093},"labels":[],"label_agreement":null},{"id":"W1979688176","doi":"10.1103/physreva.76.042309","title":"Entanglement of subspaces and error-correcting codes","year":2007,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Linear subspace; Quantum entanglement; Subspace topology; Degenerate energy levels; Measure (data warehouse); Bipartite graph; Decoherence-free subspaces; Mathematics; Code (set theory); Discrete mathematics; Qubit; Computer science; Theoretical computer science; Quantum; Pure mathematics; Quantum mechanics; Physics; Quantum channel; Set (abstract data type)","score_opus":0.014266393606920955,"score_gpt":0.3124605404331557,"score_spread":0.29819414682623474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979688176","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8389658,0.020423463,0.13850893,0.0010967666,0.00013866418,0.00020534582,7.9384955e-7,0.00007543238,0.0005848491],"genre_scores_gemma":[0.9873479,0.0005459261,0.011733461,0.00028203515,0.00007852536,0.000001811819,2.8791513e-7,0.0000036730225,0.0000063583316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999279,0.000033166456,0.00016222472,0.00018893633,0.00016926539,0.00016737323],"domain_scores_gemma":[0.999412,0.00021145254,0.000097036354,0.0001878798,0.000031072348,0.000060531594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042362078,0.00008478797,0.00022579508,0.000022870441,0.00004554939,0.000015589734,0.000220056,0.0000073312235,0.0000012843518],"category_scores_gemma":[0.000057608428,0.00006227429,0.00006088339,0.00022544783,0.000032701224,0.000051886353,0.00016363262,0.00008661909,0.0000024655144],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015064124,0.000101601916,0.0006957887,0.00068035384,0.000014991128,0.0000072908924,0.0009017646,0.000029794066,0.0011156342,0.0138862105,0.00013014977,0.9824349],"study_design_scores_gemma":[0.0016985768,0.0019981272,0.051133398,0.02209527,0.00026032986,0.00033833928,0.0004040449,0.69611585,0.10869072,0.07181976,0.04306234,0.0023832547],"about_ca_topic_score_codex":0.000013516913,"about_ca_topic_score_gemma":0.000003081497,"teacher_disagreement_score":0.98005164,"about_ca_system_score_codex":0.0000066250036,"about_ca_system_score_gemma":0.000010082937,"threshold_uncertainty_score":0.2539472},"labels":[],"label_agreement":null},{"id":"W1979892692","doi":"10.1007/s11128-012-0489-1","title":"Gaussian quantum computation with oracle-decision problems","year":2012,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum computer; Gaussian; Computation; Modulation (music); Quantum; Encoding (memory); Quantum information; Wave function; Oracle","score_opus":0.011429150303575736,"score_gpt":0.24461708993810047,"score_spread":0.23318793963452472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979892692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07849361,0.00023463304,0.9186034,0.00055084005,0.00040592017,0.0002516067,0.0000018911697,0.00059989846,0.00085815345],"genre_scores_gemma":[0.8860363,0.0000048435127,0.1133558,0.00042100425,0.000119296565,0.000016137186,0.0000226637,0.000016156526,0.00000782778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774665,0.000056064295,0.0006190088,0.0002382844,0.0007066661,0.00063330843],"domain_scores_gemma":[0.9985927,0.000091783,0.0005045175,0.00032332097,0.00026181788,0.0002258728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007211959,0.00028363604,0.00023690806,0.00034948217,0.0006110124,0.000847331,0.00053991174,0.00013947561,0.000006191048],"category_scores_gemma":[0.000050114704,0.0002114646,0.000053289263,0.0010232563,0.00006269869,0.0076426542,0.00016507567,0.00042604495,0.00013488554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023284401,0.000098104436,0.0007532285,0.0002224259,0.0000121480325,0.000001726592,0.009759308,0.030884312,0.000028875274,0.025454167,0.00029781592,0.9324646],"study_design_scores_gemma":[0.00050013553,0.00014376889,0.0033576654,0.00029307313,0.000007335605,0.00014243425,0.00021521463,0.98405147,0.00012176099,0.0044229217,0.006374028,0.00037019385],"about_ca_topic_score_codex":0.000014035313,"about_ca_topic_score_gemma":7.561589e-7,"teacher_disagreement_score":0.95316714,"about_ca_system_score_codex":0.00006416526,"about_ca_system_score_gemma":0.00014562576,"threshold_uncertainty_score":0.86232764},"labels":[],"label_agreement":null},{"id":"W1980107552","doi":"10.1103/physrevlett.103.170502","title":"Can Closed Timelike Curves or Nonlinear Quantum Mechanics Improve Quantum State Discrimination or Help Solve Hard Problems?","year":2009,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nonlinear system; Computation; Closed timelike curve; Computer science; Quantum computer; Quantum; State (computer science); Statistical physics; Applied mathematics; Physics; Algorithm; Quantum mechanics; Mathematics","score_opus":0.02028640244743215,"score_gpt":0.27909811398517087,"score_spread":0.25881171153773874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980107552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07103914,0.010272754,0.6580214,0.25470158,0.0013260073,0.0034209637,0.000118880744,0.0010787905,0.000020491836],"genre_scores_gemma":[0.44311848,0.052173566,0.11575712,0.38449177,0.0031531812,0.00036952904,0.00032385412,0.00030694393,0.00030554034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968202,0.00020968278,0.0006068157,0.0009024923,0.00072151463,0.0007392962],"domain_scores_gemma":[0.9981635,0.00022214143,0.0003782204,0.0008625658,0.0001289378,0.00024458754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000499019,0.0004892075,0.0007875642,0.0000825316,0.00020769789,0.00018362132,0.0011727466,0.00002525307,0.000008568666],"category_scores_gemma":[0.00017992819,0.00031420364,0.0003124327,0.0007257042,0.000051040388,0.00034966008,0.00022959175,0.0005196538,0.00006112965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011824976,0.0017207086,0.000003093387,0.010446567,0.00019702112,0.00031879905,0.0031832457,0.002921132,0.054074116,0.01570891,0.026820837,0.88448733],"study_design_scores_gemma":[0.00039251288,0.00074333727,0.00007699526,0.004770771,0.000073139796,0.00002414152,0.000004597506,0.9803147,0.0006263208,0.007644778,0.004712967,0.00061578886],"about_ca_topic_score_codex":0.000037729285,"about_ca_topic_score_gemma":0.000010243744,"teacher_disagreement_score":0.9773935,"about_ca_system_score_codex":0.000074115625,"about_ca_system_score_gemma":0.00013181749,"threshold_uncertainty_score":0.999931},"labels":[],"label_agreement":null},{"id":"W1980289135","doi":"10.1103/physrevb.82.024511","title":"Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor","year":2010,"lang":"en","type":"article","venue":"Physical Review B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":285,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Qubit; Flux qubit; Computer science; Phase qubit; Chip; Quantum computer; Adiabatic process; Quantum; Topology (electrical circuits); Superconducting quantum computing; Electronic engineering; Physics; Quantum mechanics; Electrical engineering; Engineering; Telecommunications","score_opus":0.017996404761083697,"score_gpt":0.2910263019999616,"score_spread":0.2730298972388779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980289135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99152464,0.00069921976,0.0071209716,0.0002382619,0.00007515532,0.00020437075,6.477529e-7,0.000037910748,0.000098835895],"genre_scores_gemma":[0.9345226,0.000027495968,0.06516586,0.0001694266,0.000085035055,0.000014488057,0.000005712371,0.000006910283,0.0000024615056],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991637,0.00007507277,0.00020564586,0.00025345985,0.0001678565,0.00013429],"domain_scores_gemma":[0.99947006,0.000048312017,0.00009506757,0.00026453118,0.00005210677,0.00006992433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002004533,0.00010202231,0.00020190857,0.000040924282,0.000040390416,0.000028447283,0.00037199826,0.000020182979,0.0000059405106],"category_scores_gemma":[0.000046059587,0.00008360162,0.00004178442,0.0004516803,0.000038591814,0.00036835662,0.00008994092,0.00021659046,0.0000036768477],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049656596,0.0010963922,0.0005452488,0.002195151,0.000008425104,0.000009770275,0.007796634,0.031072536,0.8884534,0.011596984,0.0000277267,0.05719272],"study_design_scores_gemma":[0.00013820913,0.000086400374,0.00017786882,0.00034261314,0.000003601247,0.000004053824,0.000013089277,0.8241281,0.17373379,0.001210585,0.00004152038,0.000120207966],"about_ca_topic_score_codex":0.000018077273,"about_ca_topic_score_gemma":0.0000018393584,"teacher_disagreement_score":0.79305553,"about_ca_system_score_codex":0.0000057884367,"about_ca_system_score_gemma":0.000046060602,"threshold_uncertainty_score":0.3409175},"labels":[],"label_agreement":null},{"id":"W1980903794","doi":"10.1088/1367-2630/16/5/053009","title":"Observation of quasiperiodic dynamics in a one-dimensional quantum walk of single photons in space","year":2014,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Physics; Quantum walk; Quasiperiodic function; Photon; Interferometry; Quantum; Quantum mechanics; Astronomical interferometer; Optics; Quantum computer; Condensed matter physics","score_opus":0.020008908297078062,"score_gpt":0.23145651468582848,"score_spread":0.21144760638875043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980903794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78526974,0.0000494398,0.21394812,0.0004885431,0.00016683814,0.00003787521,0.000001108526,0.0000045005154,0.000033861645],"genre_scores_gemma":[0.92868936,0.0000033205586,0.07116076,0.00004261188,0.000092625676,1.1083373e-7,8.476698e-7,0.0000057298316,0.0000046534356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987181,0.00009545159,0.0005205052,0.00012779157,0.00037893737,0.000159255],"domain_scores_gemma":[0.998833,0.00018391263,0.00057578774,0.00020562846,0.00014187119,0.000059773873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039999667,0.00010428178,0.0003441052,0.00015119521,0.00001987498,0.000018771818,0.00040946502,0.000046148787,0.0000012942567],"category_scores_gemma":[0.00007116831,0.000096159885,0.000098665056,0.000550153,0.000040145467,0.00019505466,0.00006896182,0.00026528916,5.0960404e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001010462,0.0015756169,0.024442798,0.00015197114,0.00004887428,0.000024276369,0.0044337125,0.4339141,0.08516398,0.129304,0.000091333604,0.32074827],"study_design_scores_gemma":[0.00073802954,0.0004280089,0.019161358,0.0003583093,0.0000048620054,0.000013439094,0.000027619248,0.9320066,0.008008155,0.03913604,0.000024201507,0.00009338682],"about_ca_topic_score_codex":0.00023175451,"about_ca_topic_score_gemma":0.00011060025,"teacher_disagreement_score":0.4980925,"about_ca_system_score_codex":0.000063400126,"about_ca_system_score_gemma":0.00019301471,"threshold_uncertainty_score":0.39212862},"labels":[],"label_agreement":null},{"id":"W1981783889","doi":"10.1103/physrevlett.109.050505","title":"Quantum Algorithm for Data Fitting","year":2012,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":535,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Quantum phase estimation algorithm; Quantum algorithm; Algorithm; Computer science; Quantum; Function (biology); Quantum computer; Quantum algorithm for linear systems of equations; Quantum state; Quantum error correction; Quantum process; Physics; Quantum mechanics; Quantum dynamics","score_opus":0.03921103619299199,"score_gpt":0.32086093442530306,"score_spread":0.28164989823231107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981783889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003902758,0.00824218,0.97436213,0.012425562,0.00051816175,0.0003464842,0.000014762298,0.00016516718,0.00002281341],"genre_scores_gemma":[0.078863025,0.00087855227,0.84833163,0.067182966,0.004496385,0.00008753913,0.00009282302,0.000055260924,0.000011815529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846274,0.00008195742,0.00022253997,0.00043586345,0.00024875914,0.0005481376],"domain_scores_gemma":[0.9981678,0.0003800536,0.0001181399,0.0011526106,0.000026067199,0.00015532835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063016656,0.00018266276,0.00032735858,0.00002602487,0.00013855351,0.00006624806,0.0016420028,0.000007961753,0.0000018672903],"category_scores_gemma":[0.000107615415,0.0001420306,0.0001422432,0.0002588638,0.000033336644,0.00048356885,0.00068522774,0.00017969671,0.000056076013],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.2902975e-7,0.0001010086,0.000018924864,0.00034210063,0.000022981863,0.0000017205535,0.00013544771,0.00003838114,0.00044255107,0.002839169,0.02053631,0.9755211],"study_design_scores_gemma":[0.000094356066,0.00001993317,0.000085850486,0.0003898424,0.000022493668,0.000010221911,7.9663255e-7,0.9194957,0.00005748909,0.0003658818,0.0792574,0.00020000855],"about_ca_topic_score_codex":0.0000051123975,"about_ca_topic_score_gemma":4.556545e-8,"teacher_disagreement_score":0.97532105,"about_ca_system_score_codex":0.000014529397,"about_ca_system_score_gemma":0.000015751897,"threshold_uncertainty_score":0.579184},"labels":[],"label_agreement":null},{"id":"W1982051925","doi":"10.2197/ipsjdc.1.415","title":"General Bounds for Quantum Biased Oracles","year":2005,"lang":"en","type":"article","venue":"IPSJ Digital Courier","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Oracle; Quantum; Quantum algorithm; Computer science; Upper and lower bounds; Bounded function; Quantum complexity theory; Discrete mathematics; Algorithm; Mathematics; Quantum mechanics; Physics","score_opus":0.013374660656837045,"score_gpt":0.2489365062233279,"score_spread":0.23556184556649087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982051925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38640562,0.0002672248,0.6046341,0.0046814196,0.00061073725,0.00025151845,0.00006803164,0.00051474787,0.0025666088],"genre_scores_gemma":[0.93028414,0.00000196605,0.066304505,0.00095440703,0.0009277127,0.000016315604,0.000019522635,0.000026540414,0.0014649165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998563,0.0000149382295,0.00024493464,0.00043544022,0.0002776608,0.00046402455],"domain_scores_gemma":[0.99904156,0.00013464445,0.000079747835,0.00046195675,0.00012754711,0.00015453904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015738266,0.00020010585,0.00018569262,0.00009280941,0.00022047733,0.0009573499,0.0007158749,0.000065426735,0.000006894364],"category_scores_gemma":[0.00008000281,0.00017066533,0.00013486427,0.00028233693,0.00006541214,0.00069926836,0.0001849122,0.00012738179,0.00006665066],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029770188,0.00025272748,0.00025644508,0.00002309888,0.000055788023,0.000024147637,0.0006692027,0.0057509355,0.00028578285,0.09637112,0.034024984,0.862256],"study_design_scores_gemma":[0.00036053205,0.000113314636,0.00027164537,0.000012335973,0.0000031626184,0.000026088652,0.0000049478163,0.65297693,0.00033620707,0.0099258395,0.33572572,0.00024326537],"about_ca_topic_score_codex":0.0000037739685,"about_ca_topic_score_gemma":0.0000028839559,"teacher_disagreement_score":0.86201274,"about_ca_system_score_codex":0.000030578456,"about_ca_system_score_gemma":0.00010889192,"threshold_uncertainty_score":0.92317474},"labels":[],"label_agreement":null},{"id":"W1982064684","doi":"10.1063/1.4892103","title":"Canonical form of three-fermion pure-states with six single particle states","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Unitary state; Invariant (physics); Qubit; Polynomial; Canonical form; Algebra over a field; Unitary group; Set (abstract data type)","score_opus":0.014540808055953706,"score_gpt":0.23238522971704456,"score_spread":0.21784442166109086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982064684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46268946,0.000014834341,0.536573,0.00058298686,0.00003622717,0.000033384564,5.282278e-7,0.00001350847,0.000056085406],"genre_scores_gemma":[0.9105923,0.0000019709194,0.089178026,0.000065767024,0.00014264234,5.844811e-7,3.09298e-7,0.000010872,0.000007509791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862057,0.000049274724,0.00047599224,0.0001273285,0.00048285394,0.00024395787],"domain_scores_gemma":[0.9984673,0.0005247293,0.00039860842,0.0002748591,0.00019907729,0.0001353884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044877015,0.00013400363,0.00037590566,0.00002621893,0.000054162778,0.000072512834,0.00048139243,0.000032441632,0.0000042356983],"category_scores_gemma":[0.00007505823,0.00008150652,0.000116877105,0.00020355845,0.00013618352,0.00022100282,0.00010750431,0.00022477991,0.0000056188046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017002868,0.0036918523,0.00092327176,0.0006940095,0.00031486357,0.0000716037,0.010050816,0.07902339,0.0075317463,0.6698504,0.0005804167,0.2270976],"study_design_scores_gemma":[0.0003060034,0.00077515905,0.00009476268,0.00014471107,0.000016464552,0.00005785192,0.000025815847,0.54266155,0.008012548,0.44777375,0.000046615565,0.00008479025],"about_ca_topic_score_codex":0.0000025625154,"about_ca_topic_score_gemma":0.000003151783,"teacher_disagreement_score":0.46363813,"about_ca_system_score_codex":0.000020631664,"about_ca_system_score_gemma":0.000056116893,"threshold_uncertainty_score":0.33237395},"labels":[],"label_agreement":null},{"id":"W1982397733","doi":"10.48550/arxiv.quant-ph/0011065","title":"Sharp Quantum vs. Classical Query Complexity Separations","year":2000,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Noncommutative geometry; Simple (philosophy); Quantum; Mathematics; Quantum algorithm; Bounded function; Polynomial; Quantum complexity theory; Quantum Fourier transform; Fourier transform; Algebraic number; Discrete mathematics; Pure mathematics; Quantum error correction; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.062217835494324664,"score_gpt":0.29425421886346453,"score_spread":0.23203638336913987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982397733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82325214,0.00029354982,0.16031446,0.010155505,0.0022153654,0.0004101359,0.00006273371,0.0010796376,0.0022164756],"genre_scores_gemma":[0.97210515,0.00004883261,0.02452583,0.0013673059,0.0010932822,0.00004475347,0.00008692419,0.00004664294,0.0006812758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631387,0.00027458568,0.0006578915,0.0014885947,0.0005296503,0.0007353981],"domain_scores_gemma":[0.9970732,0.00020751904,0.00027765348,0.002018498,0.000117278476,0.00030589427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034318268,0.000585831,0.00068771595,0.0002128238,0.00050069374,0.0004330911,0.0026257783,0.00042652592,0.00011601534],"category_scores_gemma":[0.000053180822,0.00054751046,0.00041126495,0.00040637658,0.0002726115,0.00019008349,0.0024287943,0.0019472631,0.0006820607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023944232,0.0043813786,0.124854185,0.0011980331,0.0014020699,0.0015596616,0.013378813,0.22876617,0.00086471735,0.33339423,0.15672514,0.13323614],"study_design_scores_gemma":[0.00025116204,0.00009857622,0.12610029,0.00017413907,0.000023699062,0.00004728818,0.000005385351,0.82366043,0.000074312426,0.025690392,0.023127034,0.0007473079],"about_ca_topic_score_codex":0.00017585911,"about_ca_topic_score_gemma":0.000041898136,"teacher_disagreement_score":0.59489423,"about_ca_system_score_codex":0.00009605196,"about_ca_system_score_gemma":0.00041779553,"threshold_uncertainty_score":0.9996976},"labels":[],"label_agreement":null},{"id":"W1982481617","doi":"10.1103/physreva.90.062317","title":"Permutation-invariant quantum codes","year":2014,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Ministry of Education - Singapore","keywords":"Physics; Hilbert space; Decoherence-free subspaces; Quantum error correction; Invariant (physics); Subspace topology; Quantum information; Quantum; Quantum mechanics; Discrete mathematics; Mathematics","score_opus":0.010846843394327985,"score_gpt":0.2772325837429466,"score_spread":0.2663857403486186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982481617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021803329,0.004427234,0.9623985,0.008994613,0.00021815977,0.00021821541,0.0000012694252,0.0003024323,0.0016362335],"genre_scores_gemma":[0.9806205,0.00067357224,0.013037561,0.0052050645,0.00040519517,0.000019422036,0.0000036159645,0.000011227804,0.00002385993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893576,0.00014415369,0.00016077928,0.0003101005,0.00023490757,0.0002142818],"domain_scores_gemma":[0.9990817,0.00025280192,0.00007338419,0.00044386345,0.00005030816,0.000097993056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028841314,0.00012786067,0.00027996502,0.000021007781,0.000100874495,0.00006826144,0.0005641595,0.000011664658,0.0000040490854],"category_scores_gemma":[0.00019418893,0.00009182962,0.00012825955,0.00027979474,0.000030789277,0.00009331905,0.00014623038,0.00014059135,0.00016617432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.8383245e-7,0.000109636174,0.000012078593,0.0004115809,0.000011883823,0.0000049015607,0.00027785773,0.0006562037,0.00025581897,0.77126586,0.0015867737,0.22540684],"study_design_scores_gemma":[0.00007037836,0.00006683572,0.0003267064,0.0004917763,0.000009954728,0.000011144196,7.026559e-7,0.90074587,0.000100674195,0.0745054,0.02352518,0.00014537343],"about_ca_topic_score_codex":0.000010231785,"about_ca_topic_score_gemma":3.6304039e-7,"teacher_disagreement_score":0.9588171,"about_ca_system_score_codex":0.000008649547,"about_ca_system_score_gemma":0.000024663266,"threshold_uncertainty_score":0.37447032},"labels":[],"label_agreement":null},{"id":"W1983061722","doi":"10.1109/mwscas.2013.6674673","title":"Testing reversible adder/subtractor for missing control points","year":2013,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Subtractor; Adder; Computer science; Fault coverage; Fault (geology); Automatic test pattern generation; Logic gate; Electronic circuit; Parallel computing; Algorithm; Arithmetic; Mathematics; Engineering; Electrical engineering; Telecommunications","score_opus":0.017986363048674806,"score_gpt":0.23155370090448912,"score_spread":0.21356733785581433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983061722","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023236929,0.000039701543,0.9695059,0.0044869944,0.0002917897,0.00036038394,0.0000017044823,0.00036253151,0.0017140581],"genre_scores_gemma":[0.40887815,1.2312299e-7,0.5894404,0.0012740588,0.00014863878,0.000012886424,5.8062113e-7,0.000008906552,0.00023622664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989149,0.00003079758,0.00019051274,0.00034117707,0.00014190201,0.00038071838],"domain_scores_gemma":[0.9986261,0.00069299334,0.00008091046,0.00031730297,0.0001552226,0.0001274475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022144392,0.00013299356,0.00015386225,0.000065500004,0.00024142064,0.00032412348,0.0005262451,0.000046123165,0.000038877268],"category_scores_gemma":[0.0002648725,0.00010566163,0.00007136925,0.00021852352,0.00002031265,0.00031938468,0.00009298898,0.00011197384,0.0000765287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043013883,0.00009254925,0.00096616213,0.00005418197,0.000037847203,0.000007248243,0.00047089052,0.0012227545,0.018158773,0.006831665,0.016321722,0.9558319],"study_design_scores_gemma":[0.00052886474,0.00009086288,0.0027839006,0.00003505957,0.000003705229,0.000020554347,0.0000123582095,0.9832625,0.0009815845,0.010015507,0.0020838443,0.00018128699],"about_ca_topic_score_codex":0.00007185185,"about_ca_topic_score_gemma":8.385135e-7,"teacher_disagreement_score":0.9820397,"about_ca_system_score_codex":0.000015229972,"about_ca_system_score_gemma":0.000053907464,"threshold_uncertainty_score":0.43087563},"labels":[],"label_agreement":null},{"id":"W1984021697","doi":"10.1103/revmodphys.87.307","title":"Quantum error correction for quantum memories","year":2015,"lang":"en","type":"article","venue":"Reviews of Modern Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1360,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Government of Canada","keywords":"Quantum error correction; Quantum convolutional code; Quantum computer; Quantum information; Quantum network; Quantum capacity; Physics; Quantum algorithm; Quantum technology; Error detection and correction; Qubit; Computer science; Quantum; Quantum mechanics; Computer engineering; Theoretical computer science; Open quantum system; Algorithm","score_opus":0.06872378524531718,"score_gpt":0.30733835576458546,"score_spread":0.23861457051926827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984021697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058954735,0.004854913,0.98651034,0.00029357188,0.0017745702,0.00044313443,0.0000051736356,0.00011494554,0.000107894375],"genre_scores_gemma":[0.7504778,0.0012122066,0.24522343,0.0005233336,0.0018786592,0.0001566685,0.000032435357,0.00008670001,0.0004088035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985892,0.00010343133,0.00042001522,0.00036181108,0.00025998594,0.0002655373],"domain_scores_gemma":[0.9985932,0.0001204243,0.0003389926,0.00062234735,0.00021413322,0.00011089763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061540207,0.00020203002,0.00051784236,0.000037216607,0.000091164315,0.000051958115,0.0006460114,0.000049261427,5.6357504e-7],"category_scores_gemma":[0.00015420845,0.00016276925,0.0002338893,0.00027525536,0.00004948499,0.0002467121,0.00016009744,0.00013369077,0.000014722585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012778084,0.00013717871,0.000025006286,0.0002469236,0.000020610469,8.106293e-7,0.001571835,0.01092434,0.0003347126,0.03352403,0.008933907,0.94426787],"study_design_scores_gemma":[0.00021910042,0.00017259317,0.000013720911,0.00010764547,0.000013347216,0.0000060773773,0.000011052157,0.837988,0.00094955665,0.133861,0.026489565,0.00016828637],"about_ca_topic_score_codex":0.000011417093,"about_ca_topic_score_gemma":0.0000023855985,"teacher_disagreement_score":0.9440996,"about_ca_system_score_codex":0.000028146424,"about_ca_system_score_gemma":0.00011158682,"threshold_uncertainty_score":0.6637538},"labels":[],"label_agreement":null},{"id":"W1984203445","doi":"10.1103/physreva.91.042315","title":"Reducing the quantum-computing overhead with complex gate distillation","year":2015,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; University of Sydney","keywords":"Overhead (engineering); Generalization; Computer science; Quantum computer; Scheme (mathematics); Set (abstract data type); Process (computing); Computer engineering; Fault tolerance; Parallel computing; Algorithm; Quantum; Theoretical computer science; Distributed computing; Mathematics","score_opus":0.03929068434105597,"score_gpt":0.3094552785799703,"score_spread":0.2701645942389143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984203445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26887262,0.007733395,0.7048309,0.014824076,0.00033678452,0.0007826713,0.0000020901923,0.0004960337,0.0021214145],"genre_scores_gemma":[0.98887116,0.00008137081,0.009551408,0.0011022376,0.00036475333,0.0000051700895,0.0000025974923,0.000012298832,0.000009016875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852717,0.00016454434,0.00021235911,0.00037495678,0.00042600496,0.000294991],"domain_scores_gemma":[0.9987947,0.00021879323,0.00016201203,0.00058343663,0.000104453786,0.00013660318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044823796,0.00018006061,0.00030779876,0.000019592771,0.00018989356,0.00012336978,0.00064316444,0.0000114169725,0.0000011026615],"category_scores_gemma":[0.00011579967,0.000095906405,0.00009247028,0.0005336319,0.00006842423,0.00012232384,0.00025386587,0.00023054285,0.00003853024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016883845,0.0002736819,0.00029230124,0.00079098874,0.000076846285,0.000037305643,0.004606577,0.08021992,0.000263184,0.1850542,0.0063786274,0.7219895],"study_design_scores_gemma":[0.00014519578,0.00011256814,0.0022212302,0.0009482052,0.000016304824,0.00003245741,0.0000071072095,0.981608,0.0000207292,0.0071703377,0.007544055,0.00017384192],"about_ca_topic_score_codex":0.00004263815,"about_ca_topic_score_gemma":0.0000010328029,"teacher_disagreement_score":0.90138805,"about_ca_system_score_codex":0.000030561907,"about_ca_system_score_gemma":0.000071403265,"threshold_uncertainty_score":0.39109495},"labels":[],"label_agreement":null},{"id":"W1984925593","doi":"10.1007/s10440-006-9043-4","title":"Error Correcting Codes, Block Designs, Perfect Secrecy and Finite Fields","year":2006,"lang":"en","type":"article","venue":"Acta Applicandae Mathematicae","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Alberta Health; University of Calgary","funders":"Los Alamos National Laboratory","keywords":"Alice and Bob; Secrecy; Shared secret; Key (lock); Mathematics; Cryptography; Key size; Information-theoretic security; Symmetric-key algorithm; Alice (programming language); Theoretical computer science; Computer science; Discrete mathematics; Public-key cryptography; Arithmetic; Computer security; Algorithm; Encryption","score_opus":0.013109748224552345,"score_gpt":0.23654879096386652,"score_spread":0.22343904273931417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984925593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37555635,0.00012399771,0.62016976,0.00082427706,0.000104584244,0.00032049936,0.000004811755,0.00035904662,0.0025367122],"genre_scores_gemma":[0.92466706,0.000004646918,0.07470957,0.000203911,0.00015773397,0.000033515043,0.000003469875,0.000020869174,0.0001991967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841255,0.00006640763,0.00032965376,0.0005087461,0.00025495773,0.00042769418],"domain_scores_gemma":[0.9982043,0.0009527048,0.0001414028,0.00054888515,0.000037674345,0.00011503979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044471762,0.0002597496,0.00033948183,0.000084473984,0.00030509685,0.00026389494,0.0005605111,0.00011342548,0.000016542515],"category_scores_gemma":[0.00006781696,0.00021490098,0.00006895148,0.0002947475,0.00007025791,0.00010053247,0.00031051214,0.00032097538,0.000021387568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088358596,0.0018777052,0.0025345676,0.0018167467,0.00038146946,0.0003268427,0.015719779,0.017965697,0.01925765,0.2590212,0.031891555,0.6491184],"study_design_scores_gemma":[0.0004333564,0.00013777937,0.00053127925,0.00010763964,0.000022665607,0.00034024785,0.000052677722,0.9534032,0.00161997,0.039057422,0.0038199306,0.00047387194],"about_ca_topic_score_codex":0.000087654524,"about_ca_topic_score_gemma":0.000018588324,"teacher_disagreement_score":0.93543744,"about_ca_system_score_codex":0.000018209501,"about_ca_system_score_gemma":0.000038363407,"threshold_uncertainty_score":0.87634075},"labels":[],"label_agreement":null},{"id":"W1985974350","doi":"10.1103/physreva.74.042304","title":"Quantum walk on a line with two entangled particles","year":2006,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Quantum entanglement; Quantum; Statistical physics; Random walk; Position (finance); Particle (ecology); Physics; Mathematics; Quantum mechanics; Quantum computer; Statistics","score_opus":0.013950066018777093,"score_gpt":0.28424305173039216,"score_spread":0.2702929857116151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985974350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81868577,0.0095818015,0.157365,0.011241665,0.00016428212,0.00067363464,0.00000367958,0.0005851973,0.0016989843],"genre_scores_gemma":[0.9908395,0.0001200168,0.007219314,0.0014457828,0.00033482653,0.000013066676,0.000002026723,0.000009195436,0.00001629646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882823,0.00007793161,0.0001659177,0.0003507035,0.0002972842,0.0002799509],"domain_scores_gemma":[0.99921954,0.00013509048,0.00008000763,0.00044942397,0.00003790306,0.000078018034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011672294,0.00016711984,0.00029189853,0.000022479267,0.000076699595,0.00005951245,0.0004015964,0.000008387171,0.0000038031344],"category_scores_gemma":[0.000020544812,0.00010252231,0.00010565364,0.00039261847,0.000036081627,0.00007172648,0.00007092104,0.00015703656,0.00009712003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018996607,0.0010479905,0.0002397172,0.00045717403,0.000033349923,0.00012960374,0.00012638055,0.010807473,0.00070330454,0.36951664,0.001261146,0.6156582],"study_design_scores_gemma":[0.00048094246,0.00061062607,0.0014057114,0.0015500025,0.000026099482,0.000025732617,7.752597e-7,0.93418264,0.0015246939,0.054755226,0.0051324763,0.00030508664],"about_ca_topic_score_codex":0.000044244447,"about_ca_topic_score_gemma":0.0000060504817,"teacher_disagreement_score":0.9233751,"about_ca_system_score_codex":0.000010938006,"about_ca_system_score_gemma":0.000025268582,"threshold_uncertainty_score":0.41807383},"labels":[],"label_agreement":null},{"id":"W1986015465","doi":"10.1038/nature10770","title":"Experimental demonstration of topological error correction","year":2012,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":216,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Qubit; Cluster state; Topology (electrical circuits); Quantum error correction; Word error rate; Error detection and correction; Topological order; Quantum computer; Computer science; Algorithm; Quantum; Mathematics; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.012434912953196585,"score_gpt":0.2820035776607599,"score_spread":0.2695686647075633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986015465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9019177,0.0011456169,0.091689356,0.00047466104,0.0031308525,0.00006688331,6.620036e-7,0.0001128576,0.0014614128],"genre_scores_gemma":[0.97870165,5.9806376e-7,0.02085214,0.00019075772,0.00020309334,0.0000014592952,0.0000012864684,0.0000022920972,0.00004670103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994733,0.00003532387,0.000089279565,0.00011453592,0.00014421406,0.00014336033],"domain_scores_gemma":[0.9997056,0.00003564028,0.000049358263,0.00013998733,0.000024030469,0.00004535859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113246766,0.00006343483,0.00007325376,0.00003553353,0.000059337897,0.000014864901,0.00019768745,0.00032128615,0.000011442235],"category_scores_gemma":[0.00001737643,0.0000484752,0.000040806965,0.00014687682,0.000026079832,0.00014816957,0.00006715826,0.00060367445,0.000004902047],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006167829,0.0021308195,0.04783286,0.000044035427,0.00007747348,0.000017515558,0.011077189,0.0032783388,0.20051594,0.41437024,0.019306576,0.30128732],"study_design_scores_gemma":[0.00046786136,0.0004276774,0.10997158,0.00003856823,0.0000074506743,0.00024901656,0.000255384,0.33004436,0.5526316,0.0009502441,0.0045745648,0.00038168867],"about_ca_topic_score_codex":0.0000034250056,"about_ca_topic_score_gemma":3.2973384e-7,"teacher_disagreement_score":0.41342,"about_ca_system_score_codex":0.000012868934,"about_ca_system_score_gemma":0.000012524283,"threshold_uncertainty_score":0.26226985},"labels":[],"label_agreement":null},{"id":"W1986172436","doi":"10.1103/physreva.78.052309","title":"Generic quantum walk using a coin-embedded shift operator","year":2008,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Quantum walk; Limiting; Quantum; Degree (music); Operator (biology); Unitary state; Computer science; Degrees of freedom (physics and chemistry); Mathematics; Statistical physics; Quantum algorithm; Quantum mechanics; Physics; Law","score_opus":0.03464905459780077,"score_gpt":0.2998610536367727,"score_spread":0.2652119990389719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986172436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7974263,0.020613901,0.17939846,0.0013277394,0.00032674737,0.0003842046,0.0000026579794,0.0002975762,0.00022241593],"genre_scores_gemma":[0.96169496,0.0015027219,0.03347391,0.002827883,0.0004606625,0.000009545819,0.0000017497733,0.000017934548,0.000010660423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836653,0.00014030936,0.00026243852,0.00048887485,0.00035164563,0.00039017474],"domain_scores_gemma":[0.9989324,0.000089033725,0.000100338184,0.0006429142,0.000054918746,0.00018035069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001476213,0.00023258296,0.000485779,0.00003754815,0.0002428215,0.000053670676,0.0007812973,0.000022633307,0.000009233238],"category_scores_gemma":[0.000061452934,0.0001752454,0.00022750944,0.00066684885,0.000067225184,0.0001655119,0.0002475832,0.00023910154,0.00010915619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023016104,0.0025749407,0.00075343414,0.0048951036,0.00034593785,0.0018860181,0.008440292,0.023216056,0.013436965,0.15902375,0.009178958,0.7762255],"study_design_scores_gemma":[0.00014978297,0.00007861093,0.0009141109,0.0005787427,0.000017137769,0.00013888147,8.6486284e-7,0.99022055,0.00030428256,0.0033426015,0.0039438787,0.00031057623],"about_ca_topic_score_codex":0.000027284674,"about_ca_topic_score_gemma":4.0194058e-7,"teacher_disagreement_score":0.9670045,"about_ca_system_score_codex":0.000021527154,"about_ca_system_score_gemma":0.00015046413,"threshold_uncertainty_score":0.71462995},"labels":[],"label_agreement":null},{"id":"W1986240479","doi":"10.1103/physreva.76.022304","title":"Measurement-based quantum computation with the toric code states","year":2007,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Planarity testing; Toric code; Planar; Quantum computer; Computation; Qubit; Computer science; Ising model; Planar graph; Code (set theory); Lattice (music); Quantum; Graph; Algorithm; Statistical physics; Theoretical computer science; Mathematics; Physics; Quantum mechanics; Combinatorics","score_opus":0.020580813824867466,"score_gpt":0.28780638456544777,"score_spread":0.2672255707405803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986240479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015029934,0.0055011325,0.9724088,0.0064342003,0.00008518366,0.000284517,7.065187e-7,0.00014196442,0.0001136064],"genre_scores_gemma":[0.9901375,0.000094143434,0.006734477,0.0028549554,0.0001529023,0.000010717563,0.000001771965,0.000010885677,0.000002658138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985192,0.000101638565,0.00016610158,0.00028356738,0.0006447065,0.00028480432],"domain_scores_gemma":[0.99907625,0.0002202595,0.00011861829,0.0003330326,0.00016892493,0.00008290494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090872997,0.00015216983,0.0002211647,0.000024883271,0.00015770248,0.00006927841,0.0004991934,0.000009746944,5.596692e-7],"category_scores_gemma":[0.00003887073,0.000079444195,0.00008610714,0.0005678991,0.00004808955,0.00007168959,0.00006388111,0.00018121488,0.000021132526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002672725,0.00059226115,0.000104793304,0.0012750992,0.00008007561,0.000045679386,0.0007800753,0.030189794,0.00054760464,0.037041083,0.0058408156,0.923476],"study_design_scores_gemma":[0.00024739795,0.00025571015,0.0016319702,0.001032098,0.00002974177,0.000006976699,0.000005950692,0.9793226,0.00041506518,0.0043129064,0.0125131495,0.00022641578],"about_ca_topic_score_codex":0.000012959462,"about_ca_topic_score_gemma":0.0000075688117,"teacher_disagreement_score":0.97510755,"about_ca_system_score_codex":0.00003867075,"about_ca_system_score_gemma":0.00006419884,"threshold_uncertainty_score":0.32396403},"labels":[],"label_agreement":null},{"id":"W1986990639","doi":"10.1063/1.4808235","title":"Birth and death processes and quantum spin chains","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Birth–death process; Spin (aerodynamics); Mathematics; Probability amplitude; Connection (principal bundle); Quantum walk; Quantum mechanics; Spin representation; Quantum; Orthogonal polynomials; Mathematical physics; Physics; Statistical physics; Combinatorics; Quantum operation; Quantum algorithm; Quantum dynamics; Fundamental representation; Population","score_opus":0.014659698559994985,"score_gpt":0.24489408857922257,"score_spread":0.23023439001922757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986990639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44989932,0.00019426654,0.54879075,0.00092552585,0.000034402507,0.00005341297,2.9323186e-7,0.000017098195,0.000084948464],"genre_scores_gemma":[0.89947796,0.00003342855,0.100112855,0.00014539062,0.00019416379,0.0000011103352,4.1273008e-8,0.0000079274405,0.000027136795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921495,0.000024754077,0.00025775496,0.000116764684,0.00022660768,0.00015918043],"domain_scores_gemma":[0.9991934,0.00021606749,0.00018387158,0.00012906789,0.00014093812,0.00013670734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018501533,0.00011006628,0.00023623023,0.000037851943,0.00007008584,0.00019199995,0.0002521656,0.000027549511,0.0000034398806],"category_scores_gemma":[0.00011250218,0.00007122096,0.000036641224,0.0001379846,0.000044763496,0.00030294317,0.00013747826,0.0001882941,0.0000069778825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063510606,0.00050063897,0.00043043977,0.0012199268,0.000088371526,0.000047948142,0.004638266,0.00037095227,0.0009280457,0.8146098,0.0005837106,0.17657551],"study_design_scores_gemma":[0.00017938917,0.00018196285,0.00083715597,0.0001521165,0.0000064861556,0.00024431225,0.000028308494,0.4136288,0.00020679702,0.58437955,0.00005925655,0.000095857715],"about_ca_topic_score_codex":0.0000012235466,"about_ca_topic_score_gemma":5.9108523e-8,"teacher_disagreement_score":0.44957864,"about_ca_system_score_codex":0.0000056132712,"about_ca_system_score_gemma":0.00004586967,"threshold_uncertainty_score":0.29043064},"labels":[],"label_agreement":null},{"id":"W1987091447","doi":"10.1145/1644015.1644034","title":"Quantum algorithms for Simon's problem over nonabelian groups","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Division of Computing and Communication Foundations; National Science Foundation","keywords":"Dihedral group; Mathematics; Quantum algorithm; Combinatorics; Coset; Tensor product; Discrete mathematics; Group (periodic table); Quantum; Pure mathematics; Quantum mechanics","score_opus":0.017404601045334984,"score_gpt":0.26689253997961065,"score_spread":0.24948793893427568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987091447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003789598,0.000121794015,0.9844785,0.007906245,0.0016526242,0.000883151,0.0000712549,0.00094957417,0.00014731276],"genre_scores_gemma":[0.18968092,0.00005317176,0.8061945,0.0026306177,0.0005528009,0.000150831,0.000019761988,0.0000721491,0.0006452798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963999,0.00009170116,0.0005899747,0.0012518142,0.00064677664,0.0010198443],"domain_scores_gemma":[0.9970974,0.00038643545,0.00017999514,0.0018010888,0.00017984271,0.00035524994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004793917,0.00057185517,0.00049255526,0.0004410957,0.00083449396,0.00037623334,0.0022377567,0.0002449581,0.000029702991],"category_scores_gemma":[0.000037229696,0.00052029185,0.00045075297,0.0010747245,0.00008643304,0.0005452799,0.00003737223,0.00065380835,0.000065040316],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027435462,0.000572627,0.000004703661,0.000022409164,0.000066110144,0.000025939002,0.00048027124,0.009670495,0.00028991283,0.004548865,0.0008143438,0.9834769],"study_design_scores_gemma":[0.0017439768,0.0017447243,0.00092297024,0.000087076565,0.000041045805,0.00005713437,0.000038065566,0.9073525,0.0022070697,0.06815592,0.016774857,0.00087465113],"about_ca_topic_score_codex":0.000042073985,"about_ca_topic_score_gemma":0.000008189783,"teacher_disagreement_score":0.98260224,"about_ca_system_score_codex":0.00010797263,"about_ca_system_score_gemma":0.00012396536,"threshold_uncertainty_score":0.99972486},"labels":[],"label_agreement":null},{"id":"W1987877912","doi":"10.1142/s0219749909005353","title":"LANDAU-ZENER TRANSITIONS IN THE PRESENCE OF SPIN ENVIRONMENT","year":2009,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Adiabatic process; Physics; Spins; Excited state; Zener diode; Adiabatic quantum computation; Quantum mechanics; Limit (mathematics); Spin (aerodynamics); Ground state; Upper and lower bounds; Quantum; Statistical physics; Condensed matter physics; Quantum computer; Mathematics; Thermodynamics","score_opus":0.007975130941810451,"score_gpt":0.24402470990651096,"score_spread":0.2360495789647005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987877912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.256723,0.00004555935,0.7288539,0.013629131,0.00037106193,0.00006402716,0.000004438172,0.0000068163868,0.00030213717],"genre_scores_gemma":[0.9924327,0.000027713568,0.0068806685,0.0005772894,0.0000758822,5.8173134e-7,0.0000027712792,8.818695e-7,0.0000015144461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987358,0.00005215259,0.00050518377,0.00004203343,0.0005814486,0.00008337846],"domain_scores_gemma":[0.9993292,0.00005724581,0.0003516403,0.00011689474,0.00012294263,0.000022077245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005476921,0.00006116698,0.00008957514,0.0002292717,0.000027619559,0.00008124631,0.0008940717,0.000024688237,0.0000054083935],"category_scores_gemma":[0.00004099083,0.000040244584,0.00007157338,0.00012038206,0.000020833504,0.00097235304,0.000024486562,0.00016299784,0.00000476962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008771239,0.00037639734,0.00032236188,0.000013626409,0.00005293806,0.000051745523,0.036826983,0.33556807,0.0010798132,0.20718633,0.0011341692,0.41729984],"study_design_scores_gemma":[0.0007362703,0.00035945067,0.03266858,0.00011552515,0.0000047669864,0.00037489418,0.0002664943,0.94125825,0.00061638386,0.01713449,0.0063661505,0.00009871868],"about_ca_topic_score_codex":0.0000055853798,"about_ca_topic_score_gemma":3.8112444e-7,"teacher_disagreement_score":0.7357097,"about_ca_system_score_codex":0.00002630023,"about_ca_system_score_gemma":0.00003963968,"threshold_uncertainty_score":0.16614226},"labels":[],"label_agreement":null},{"id":"W1988077786","doi":"10.1088/0305-4470/37/15/l01","title":"The adiabatic analogue of the Margolus–Levitin theorem","year":2004,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and General","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Defence Research and Development Canada","keywords":"Adiabatic process; Mathematics; Physics; Thermodynamics","score_opus":0.007086397912741982,"score_gpt":0.21476970869634024,"score_spread":0.20768331078359825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988077786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7178908,0.00023731707,0.27748612,0.0039543654,0.00018537784,0.00006496519,0.0000013121572,0.000006080342,0.00017370455],"genre_scores_gemma":[0.9638358,0.000015986803,0.035664503,0.00015407974,0.0002873769,6.182817e-7,5.3676875e-8,0.0000051342727,0.000036444555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991061,0.00006348637,0.00031780775,0.00007946012,0.00028249575,0.00015064087],"domain_scores_gemma":[0.9991626,0.00019837772,0.000268926,0.0002314783,0.000078145815,0.000060437767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042708952,0.00008986346,0.0001893667,0.000015648839,0.00016053556,0.000079655445,0.00060233095,0.000021557542,9.0449953e-7],"category_scores_gemma":[0.0000617293,0.000038395763,0.00015586679,0.00017353882,0.00014988477,0.0000684726,0.00017910385,0.00020011503,0.0000011477464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026054392,0.00006748811,0.000016054692,0.000023455394,0.000031810985,0.0000036334452,0.0006132875,0.0032488005,0.00057162915,0.9638782,0.00005091006,0.03149214],"study_design_scores_gemma":[0.00024782322,0.000097907294,0.0005997792,0.0001012531,0.000013739438,0.00012466393,0.000016816193,0.08497591,0.0019009811,0.91178113,0.00008250194,0.000057501627],"about_ca_topic_score_codex":0.0000016440075,"about_ca_topic_score_gemma":5.5180897e-7,"teacher_disagreement_score":0.24594504,"about_ca_system_score_codex":0.000009191261,"about_ca_system_score_gemma":0.0000661686,"threshold_uncertainty_score":0.15657337},"labels":[],"label_agreement":null},{"id":"W1988086028","doi":"10.1103/physreva.68.020301","title":"Quantum walk on the line as an interference phenomenon","year":2003,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":177,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Phenomenon; Analogy; Quantum walk; Interference (communication); Line (geometry); Quantum interference; Simple (philosophy); Quantum; Physics; Statistical physics; Theoretical physics; Quantum mechanics; Computer science; Telecommunications; Philosophy; Mathematics; Quantum computer; Epistemology; Geometry; Channel (broadcasting)","score_opus":0.02698631646120164,"score_gpt":0.3043409583942198,"score_spread":0.2773546419330182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988086028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68446034,0.018389985,0.23421809,0.030624269,0.0011273714,0.0016808609,0.0000048402867,0.0007345444,0.028759724],"genre_scores_gemma":[0.99219054,0.00058498385,0.0013639868,0.0056576426,0.0001496462,0.000012820663,7.78205e-7,0.000008063444,0.000031519536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986513,0.0002916688,0.00016745397,0.00038864434,0.00024027852,0.00026065373],"domain_scores_gemma":[0.9987111,0.0002661183,0.00007767767,0.00079143903,0.0000424478,0.000111189845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035888012,0.00017468698,0.00025331468,0.000018979836,0.00012736888,0.00008789987,0.00091562205,0.0000130858925,0.000025982174],"category_scores_gemma":[0.0002103009,0.00009571145,0.0001093303,0.0003483612,0.000041679123,0.00009355498,0.00009119212,0.00030322612,0.00027498274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014526099,0.00019125182,0.00000259209,0.00007804996,0.00000802682,0.0000057891684,0.00025166702,0.00012483001,0.000096655625,0.82747203,0.00017269369,0.17159498],"study_design_scores_gemma":[0.00016222903,0.0013423789,0.00016963882,0.0016991461,0.000019299032,0.000028643828,0.000009785377,0.5008259,0.0011012047,0.4650736,0.029131928,0.0004363032],"about_ca_topic_score_codex":0.0000082006545,"about_ca_topic_score_gemma":5.816195e-7,"teacher_disagreement_score":0.500701,"about_ca_system_score_codex":0.000011296994,"about_ca_system_score_gemma":0.00004243683,"threshold_uncertainty_score":0.39029998},"labels":[],"label_agreement":null},{"id":"W1988413534","doi":"10.1145/2629680","title":"Model-Checking Linear-Time Properties of Quantum Systems","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Australian Research Council; Chinese Academy of Sciences","keywords":"Automaton; Model checking; Linear subspace; Quantum finite automata; Hilbert space; Quantum; Computer science; Automata theory; Theoretical computer science; Mathematics; Discrete mathematics; Pure mathematics; Quantum mechanics","score_opus":0.03676618893922188,"score_gpt":0.24474361605426803,"score_spread":0.20797742711504616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988413534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03549769,0.000062143066,0.96277493,0.0009091283,0.00026820615,0.00014317514,0.000006176043,0.00023313003,0.00010540406],"genre_scores_gemma":[0.8209698,0.0000017459872,0.17871726,0.0001716374,0.0000458207,0.000010419084,0.0000029577564,0.000011046547,0.00006928275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849194,0.0001240305,0.00036139062,0.0003756584,0.00042008646,0.00022690684],"domain_scores_gemma":[0.9988487,0.00027715552,0.00013548323,0.0004830909,0.00018403745,0.000071567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030887217,0.00018275865,0.00025211327,0.00018420299,0.00025452432,0.00007229058,0.0007963335,0.00006998123,0.000004209006],"category_scores_gemma":[0.0000413392,0.00014836896,0.00011871487,0.00032141714,0.00007161524,0.00014897494,0.000029766801,0.00022173474,0.000046244877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007143996,0.0000972001,0.000002004622,0.000030946674,0.000020665924,8.236359e-7,0.0001980635,0.96469927,0.00054153975,0.023068102,0.000011274004,0.011322997],"study_design_scores_gemma":[0.0002231708,0.00016442151,0.000051189338,0.000089132955,0.00000771002,0.000024675031,0.0000067867804,0.96280783,0.00045181526,0.035950087,0.00005352276,0.00016962651],"about_ca_topic_score_codex":0.000017445085,"about_ca_topic_score_gemma":3.689753e-7,"teacher_disagreement_score":0.78547215,"about_ca_system_score_codex":0.000025725945,"about_ca_system_score_gemma":0.00007726079,"threshold_uncertainty_score":0.605031},"labels":[],"label_agreement":null},{"id":"W1988844614","doi":"10.1103/physreva.77.022328","title":"Finding flows in the one-way measurement model","year":2008,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Physics; Unitary state; Qubit; Embedding; Computation; Graph; Quantum entanglement; Quantum computer; Hilbert space; Discrete mathematics; Quantum; Quantum mechanics; Algorithm; Mathematics; Computer science","score_opus":0.08728476316572048,"score_gpt":0.2988679806331538,"score_spread":0.2115832174674333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988844614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2732388,0.026756719,0.67762077,0.017200878,0.00019136215,0.0011058917,0.0000013681555,0.00022328236,0.0036609122],"genre_scores_gemma":[0.9845786,0.001095857,0.011770417,0.0023923933,0.0001217691,0.00002967759,2.7597656e-7,0.000005473728,0.0000055158944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986401,0.00012572695,0.00016718048,0.00025880753,0.00057611405,0.00023206904],"domain_scores_gemma":[0.99934167,0.000076499484,0.000047413174,0.00045545373,0.00003596937,0.000042978547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056766404,0.00011391413,0.00022956982,0.00002387721,0.000121285484,0.00002692431,0.00083163194,0.000010142725,8.2851454e-7],"category_scores_gemma":[0.00007898711,0.000069212074,0.00011901261,0.00039684682,0.000019740972,0.00007991212,0.0001364137,0.0002367643,0.000032533015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005054455,0.0019364792,0.00011680147,0.0014331278,0.000053365653,0.00014517792,0.013045105,0.09185819,0.0019367604,0.1379563,0.0058042393,0.7457094],"study_design_scores_gemma":[0.00008117149,0.000027062762,0.00053073803,0.0006375376,0.000005062083,0.000013510598,9.26652e-7,0.98655885,0.0000453958,0.010637418,0.0013524975,0.000109835135],"about_ca_topic_score_codex":0.000006703641,"about_ca_topic_score_gemma":0.000001977652,"teacher_disagreement_score":0.89470065,"about_ca_system_score_codex":0.000027036076,"about_ca_system_score_gemma":0.000048314803,"threshold_uncertainty_score":0.28223863},"labels":[],"label_agreement":null},{"id":"W1989290514","doi":"10.2478/s11534-010-0023-y","title":"Fractional recurrence in discrete-time quantum walk","year":2010,"lang":"en","type":"article","venue":"Open Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Quantum walk; Quantum; Eigenvalues and eigenvectors; Quantum system; Quantum algorithm; Energy (signal processing); Quantum process; Amplitude; Quantum operation","score_opus":0.011295155470888841,"score_gpt":0.2728507578522197,"score_spread":0.26155560238133085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989290514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4893724,0.000032926193,0.48517323,0.0044726315,0.0030733119,0.0006684908,0.000025235988,0.00022956124,0.016952235],"genre_scores_gemma":[0.9321529,0.0000018797269,0.067012824,0.00023577288,0.00033216673,0.000008218584,0.000010269193,0.000009824321,0.0002361268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989401,0.000043886543,0.00015606644,0.00039352578,0.00021131836,0.00025507397],"domain_scores_gemma":[0.9991731,0.00011733314,0.00007929871,0.000517827,0.00003864695,0.000073787465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023991869,0.00013041211,0.00015913039,0.00003138484,0.00013225745,0.0003770631,0.0017150467,0.000045742323,0.000042642827],"category_scores_gemma":[0.000028289502,0.00011523114,0.00004389786,0.0003875983,0.00004272081,0.000589972,0.0005947441,0.0005320087,0.00020566021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000169977,0.0003029129,0.0016832299,0.000011549988,0.00001562629,0.00003698857,0.00075005705,0.0067156795,0.003202237,0.2989336,0.0018198057,0.68651134],"study_design_scores_gemma":[0.00020892502,0.000046669575,0.008103518,0.000024787607,0.000001060648,0.000010811537,0.0000027306571,0.8784362,0.0004335866,0.10838395,0.0041453373,0.00020241026],"about_ca_topic_score_codex":0.0001525613,"about_ca_topic_score_gemma":0.000026468037,"teacher_disagreement_score":0.87172055,"about_ca_system_score_codex":0.000008914959,"about_ca_system_score_gemma":0.00009992999,"threshold_uncertainty_score":0.46989894},"labels":[],"label_agreement":null},{"id":"W1989818994","doi":"10.1038/ncomms2920","title":"Thermally assisted quantum annealing of a 16-qubit problem","year":2013,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":234,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; D-Wave Systems (Canada)","funders":"","keywords":"Quantum annealing; Qubit; Quantum decoherence; Quantum computer; Quantum; Quantum mechanics; Coherence (philosophical gambling strategy); Computation; Flux qubit; Physics; Computer science; Statistical physics; Algorithm","score_opus":0.017419144055426383,"score_gpt":0.2706159173333374,"score_spread":0.253196773277911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989818994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32700813,0.0293554,0.47104296,0.11100329,0.0014076248,0.003278805,0.000049962568,0.0024753602,0.054378495],"genre_scores_gemma":[0.7777143,0.00003987021,0.2217502,0.00036764515,0.000025385481,0.000029566965,0.00001065167,0.000009985229,0.000052390107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998777,0.00018870794,0.00032897494,0.00023930155,0.00022865804,0.00023739644],"domain_scores_gemma":[0.99652934,0.0003486507,0.00021606365,0.0025001809,0.00032876566,0.00007699047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028047623,0.0001430765,0.0001918305,0.00012700996,0.0002924594,0.00012235726,0.0036082484,0.00017848493,0.000012560719],"category_scores_gemma":[0.00007311137,0.00011909459,0.000101565354,0.0006501065,0.00011072214,0.00022689413,0.0010152193,0.0008989471,0.00002756637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046858167,0.0006207649,0.0021345406,0.00007624033,0.00015500168,0.0000024337369,0.0030720504,0.0012588619,0.0140262,0.6619525,0.011082912,0.30561385],"study_design_scores_gemma":[0.00038106542,0.00010091074,0.03711894,0.000157059,0.000015296895,0.00004461731,0.00007243524,0.9193508,0.000846537,0.022077352,0.019459156,0.0003758091],"about_ca_topic_score_codex":0.00012618738,"about_ca_topic_score_gemma":0.00004164488,"teacher_disagreement_score":0.91809195,"about_ca_system_score_codex":0.000027703678,"about_ca_system_score_gemma":0.00008305017,"threshold_uncertainty_score":0.6705083},"labels":[],"label_agreement":null},{"id":"W1990843814","doi":"10.1109/cig.2010.5592866","title":"A renormalization group decoding algorithm for topological quantum codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Algorithm; Toric code; Block code; Quantum algorithm; Quantum computer; Qubit; Quantum error correction; Computer science; Quantum convolutional code; Mathematics; Decoding methods; Topology (electrical circuits); Linear code; Discrete mathematics; Theoretical computer science; Quantum; Physics; Quantum mechanics; Combinatorics","score_opus":0.012197018164283664,"score_gpt":0.2577715522968554,"score_spread":0.24557453413257171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990843814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028428227,0.000017931252,0.968786,0.00081858964,0.0010137925,0.0001681923,0.000003165625,0.00041026008,0.00035383872],"genre_scores_gemma":[0.19092071,0.0000037172406,0.80821395,0.00046872286,0.00027859674,0.000016481503,0.000009731607,0.000007879054,0.000080193066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891186,0.000030065137,0.0002023445,0.00037651815,0.00015009553,0.00032913464],"domain_scores_gemma":[0.99923444,0.00021444498,0.000065039225,0.00031954763,0.00006999163,0.00009655097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039559824,0.00013471526,0.00014828998,0.00007659709,0.00029148595,0.00019927848,0.00061579514,0.00009744849,0.00002141132],"category_scores_gemma":[0.000070604765,0.00010145917,0.000082812716,0.00021402202,0.00004992752,0.00017324345,0.00019142391,0.00019515595,0.000008511828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016942477,0.000053228996,0.00006598698,0.0000058439264,0.0000070250417,0.000004065983,0.0001757792,0.0001946058,0.0015069932,0.4863389,0.0005034419,0.51114243],"study_design_scores_gemma":[0.00022177352,0.00013103707,0.00027320284,0.0000049936575,0.0000025126608,0.000044203283,0.000011469739,0.9577006,0.00082477735,0.033579342,0.007041301,0.00016474901],"about_ca_topic_score_codex":0.000029482844,"about_ca_topic_score_gemma":0.000023105198,"teacher_disagreement_score":0.957506,"about_ca_system_score_codex":0.0000074654436,"about_ca_system_score_gemma":0.00001980763,"threshold_uncertainty_score":0.4137385},"labels":[],"label_agreement":null},{"id":"W1991075883","doi":"10.1007/s00453-007-0057-8","title":"Quantum Complexity of Testing Group Commutativity","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Theory of computation; Mathematics; Group testing; Commutative property; Randomized algorithm; Group (periodic table); Reduction (mathematics); Combinatorics; Discrete mathematics; Upper and lower bounds; Computational complexity theory; Quantization (signal processing); Quantum; Omega; Algorithm; Quantum mechanics","score_opus":0.04042840860709629,"score_gpt":0.2731064296135665,"score_spread":0.23267802100647023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991075883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16898641,0.000058638783,0.8287346,0.0004458098,0.00033119708,0.00011418387,0.000006234052,0.00023286145,0.0010901111],"genre_scores_gemma":[0.6205729,3.5253277e-7,0.37922916,0.00009665916,0.000081482875,0.000001001207,0.0000024432527,0.000008826706,0.0000071314344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981493,0.00010273483,0.00044813077,0.000404339,0.00038368927,0.000511839],"domain_scores_gemma":[0.9979823,0.00082874525,0.00023903846,0.00065717107,0.0001467166,0.00014602566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012159029,0.0002031609,0.00031632392,0.0001509045,0.000224606,0.000056059074,0.0010903066,0.00007095538,0.000005249989],"category_scores_gemma":[0.00015466264,0.00018598352,0.000100331774,0.00084874453,0.00030224983,0.00017253676,0.0005139828,0.00033496576,0.000012623745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011259427,0.00036439425,0.0013541754,0.000055660203,0.000045148226,0.00008875684,0.0009882002,0.00037117134,0.0064736563,0.20706353,0.00019486492,0.7829892],"study_design_scores_gemma":[0.00038197252,0.0003238248,0.030152801,0.00004533648,0.0000064902742,0.000102733786,0.00003326366,0.9038734,0.0054405746,0.05872289,0.00061054534,0.00030620804],"about_ca_topic_score_codex":0.00024817704,"about_ca_topic_score_gemma":0.000020435016,"teacher_disagreement_score":0.90350217,"about_ca_system_score_codex":0.000029159242,"about_ca_system_score_gemma":0.000043263182,"threshold_uncertainty_score":0.7584188},"labels":[],"label_agreement":null},{"id":"W1991714729","doi":"10.1109/cec.2012.6256419","title":"An algorithm to find quantum templates","year":2012,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Template; Computer science; Benchmark (surveying); Qubit; Electronic circuit; Algorithm; Quantum computer; Quantum algorithm; Quantum gate; Quantum; Identity (music); Quantum circuit; Theoretical computer science; Computer engineering; Quantum error correction; Physics; Quantum mechanics","score_opus":0.012453794179955442,"score_gpt":0.2640865020586996,"score_spread":0.25163270787874414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991714729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1555098,0.00006330358,0.84177995,0.00087713846,0.00069163216,0.00009265908,0.000001861432,0.0003955518,0.0005880835],"genre_scores_gemma":[0.506093,6.926171e-7,0.49239448,0.00093923457,0.00035345313,0.0000042056195,0.0000014089852,0.00000943199,0.00020408406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986696,0.000052934764,0.00016366341,0.00032016318,0.00022731368,0.000566279],"domain_scores_gemma":[0.99881935,0.00006809708,0.00003173003,0.0006124101,0.000038945145,0.0004294757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003428312,0.00015706263,0.00013980876,0.000116059506,0.00017175518,0.00017383652,0.00086699333,0.000049609334,0.00003511892],"category_scores_gemma":[0.000014383747,0.00012144648,0.00004713236,0.0003842816,0.000016292855,0.00046533238,0.00024114092,0.00013119374,0.00033941597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015210182,0.00021555796,0.00092126284,0.0000044763615,0.000012733039,0.000007279156,0.002432371,0.0012818534,0.0018990163,0.042452272,0.0031025107,0.94766915],"study_design_scores_gemma":[0.00011303647,0.00019668949,0.014341012,0.000008948076,0.0000020420357,0.00006165779,0.000032691063,0.9675531,0.0023948227,0.0021152764,0.012870569,0.00031015955],"about_ca_topic_score_codex":0.000056628876,"about_ca_topic_score_gemma":0.0000012871062,"teacher_disagreement_score":0.9662712,"about_ca_system_score_codex":0.00001382794,"about_ca_system_score_gemma":0.000022316613,"threshold_uncertainty_score":0.49524438},"labels":[],"label_agreement":null},{"id":"W1992938819","doi":"10.1007/s10623-015-0067-5","title":"Finding shortest lattice vectors faster using quantum search","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; Canadian Institute for Advanced Research","funders":"Engineering and Physical Sciences Research Council; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Lorentz Center; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Lattice problem; Quantum; Lattice (music); Computer science; Theoretical computer science; Algorithm; Physics; Quantum mechanics; Cryptography","score_opus":0.08119813990694018,"score_gpt":0.29312610930515437,"score_spread":0.21192796939821418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992938819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48270428,0.00033717853,0.5163347,0.00010399249,0.00018619515,0.00008330737,0.00000235549,0.00011402917,0.00013395514],"genre_scores_gemma":[0.85813856,0.000013244395,0.14153884,0.00016590973,0.000116535164,0.000002875301,0.0000019680906,0.000016759084,0.0000053287827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982642,0.00015400397,0.00022036236,0.00049635407,0.00036800228,0.0004970859],"domain_scores_gemma":[0.99898756,0.00015952776,0.000060618022,0.00037777555,0.0001048152,0.0003096933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005969118,0.00022979458,0.00023606184,0.00033786736,0.00030092316,0.00045323328,0.0004980864,0.00008004879,0.0000031682753],"category_scores_gemma":[0.0000200603,0.00019621196,0.00010092619,0.00088696677,0.000118913566,0.00025554997,0.00026198287,0.00024995414,0.000005728604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016501397,0.00096625264,0.14405744,0.00030500657,0.0007453085,0.0010749276,0.038889386,0.08090801,0.021749344,0.44614404,0.0028345091,0.26216078],"study_design_scores_gemma":[0.0003676402,0.00026191628,0.0028020882,0.00006702178,0.000018926106,0.00014548535,0.00026131538,0.98674583,0.0006188018,0.00742247,0.0008903948,0.00039811674],"about_ca_topic_score_codex":0.00007974431,"about_ca_topic_score_gemma":0.0000036428328,"teacher_disagreement_score":0.90583783,"about_ca_system_score_codex":0.000015084395,"about_ca_system_score_gemma":0.000069620204,"threshold_uncertainty_score":0.8001291},"labels":[],"label_agreement":null},{"id":"W1993274314","doi":"10.1103/physreva.70.012315","title":"Purity and state fidelity of quantum channels","year":2004,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hilbert space; Hermitian matrix; Subspace topology; Fidelity; SIC-POVM; Mathematics; Quantum state; Quantum channel; State (computer science); Class (philosophy); Product (mathematics); Quantum; Quantum mechanics; Physics; State space; Pure mathematics; Quantum operation; Discrete mathematics; Quantum information; Computer science; Quantum dynamics; Mathematical analysis; Algorithm; Telecommunications; Geometry","score_opus":0.01307688174504633,"score_gpt":0.2837679185042248,"score_spread":0.27069103675917844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993274314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7188778,0.016149977,0.2610349,0.0033291918,0.00013677364,0.0002796679,0.0000039979664,0.00009785331,0.000089854686],"genre_scores_gemma":[0.9927269,0.002022194,0.0046680574,0.00051105476,0.000059036898,0.000004852436,4.27546e-7,0.0000041839326,0.0000032912749],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999165,0.00005008662,0.00018266936,0.00025380185,0.00017896589,0.00016950534],"domain_scores_gemma":[0.999397,0.000063249674,0.00008851914,0.00031916422,0.000048085836,0.00008402112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018228148,0.000104560735,0.00030601156,0.000016764401,0.00004220461,0.000023658044,0.0003174108,0.000008934921,6.550933e-7],"category_scores_gemma":[0.00006507936,0.00007734883,0.00008624638,0.0002319634,0.0000554349,0.00009407249,0.00022738757,0.00012554626,0.000006926407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053194744,0.0006855106,0.000065083645,0.00401239,0.00004665658,0.000026645825,0.0015824306,0.0038613502,0.0017658174,0.3304362,0.0003135222,0.6571991],"study_design_scores_gemma":[0.0003716652,0.00027449662,0.0028194352,0.0023309595,0.000018588687,0.000022922639,0.0000016564185,0.20905122,0.0024438903,0.7797227,0.0026321127,0.00031034177],"about_ca_topic_score_codex":0.00004543483,"about_ca_topic_score_gemma":4.7422822e-7,"teacher_disagreement_score":0.6568887,"about_ca_system_score_codex":0.000008013337,"about_ca_system_score_gemma":0.00003430009,"threshold_uncertainty_score":0.31541938},"labels":[],"label_agreement":null},{"id":"W1993558303","doi":"10.1103/physrevlett.91.089801","title":"Comment on “Conservative Quantum Computing”","year":2003,"lang":"en","type":"letter","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Physics; Quantum; Theoretical physics; Quantum computer; Quantum mechanics; Computer science","score_opus":0.022600274950826484,"score_gpt":0.28267491904060826,"score_spread":0.26007464408978176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993558303","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002720591,0.0019580733,0.037036117,0.9585427,0.0009979208,0.0006662743,0.000013815111,0.0002829841,0.0002300742],"genre_scores_gemma":[0.00016659453,0.00045412304,0.004902779,0.99213547,0.0021680337,0.00003114484,0.000054735327,0.0000664918,0.000020644355],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952834,0.00089478045,0.0005833016,0.0013064687,0.0010047432,0.0009273059],"domain_scores_gemma":[0.9964682,0.0011358806,0.00052414223,0.0016469525,0.00008196326,0.00014290391],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0004153942,0.000850726,0.0013431407,0.00012524048,0.00024263609,0.00020054195,0.00220157,0.00008416278,0.000010489447],"category_scores_gemma":[0.00008991476,0.0006745262,0.00069704425,0.0006128621,0.00014381742,0.000097914686,0.00042363364,0.0033867343,0.00046005586],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.366888e-7,0.00007881874,0.0000011817211,0.0009163008,0.00006877501,0.00025297736,0.00008749932,0.00019901876,0.000009574862,0.0023741494,0.9913803,0.004630683],"study_design_scores_gemma":[0.00015799745,0.00014636618,0.000009653956,0.003908395,0.00004856827,0.000025079202,4.9369334e-7,0.07902857,0.000018044288,0.0010922772,0.91483444,0.0007301055],"about_ca_topic_score_codex":0.000016665392,"about_ca_topic_score_gemma":7.698184e-8,"teacher_disagreement_score":0.07882955,"about_ca_system_score_codex":0.0001301222,"about_ca_system_score_gemma":0.00007173941,"threshold_uncertainty_score":0.9995706},"labels":[],"label_agreement":null},{"id":"W1993936114","doi":"10.1023/b:ijtp.0000048589.20608.aa","title":"Unstructured Adiabatic Quantum Search","year":2004,"lang":"en","type":"article","venue":"International Journal of Theoretical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Defence Research and Development Canada","keywords":"Adiabatic quantum computation; Hamiltonian (control theory); Adiabatic process; Quantum; Quantum computer; Computation; Quantum algorithm; Computational complexity theory; Mathematics; Time complexity; Speedup; Statistical physics; Physics; Quantum mechanics; Discrete mathematics; Computer science; Algorithm; Mathematical optimization","score_opus":0.00732138700881618,"score_gpt":0.25943847825954747,"score_spread":0.2521170912507313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993936114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13885102,0.00003953928,0.8540334,0.00508997,0.001564594,0.000032357875,0.00000317358,0.000026825628,0.00035910192],"genre_scores_gemma":[0.9464304,0.000007350342,0.0522577,0.00041081724,0.00088123506,2.3504002e-7,6.220653e-7,0.000008544232,0.000003112829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984796,0.00006017659,0.00032646066,0.00014680925,0.0007910012,0.0001959751],"domain_scores_gemma":[0.9989426,0.0001486584,0.00015476525,0.00019304032,0.0004294333,0.00013151093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029396938,0.0001176065,0.00017182536,0.00009191509,0.00004990256,0.0001742262,0.0016711889,0.000039725255,0.000018503255],"category_scores_gemma":[0.000100135156,0.000088055196,0.00017969505,0.00017241845,0.00021803183,0.00022617579,0.0002261082,0.00039040655,0.000018272633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014677627,0.00006895413,0.000011426019,0.0000023538703,0.00006201038,0.00009234712,0.00038930494,0.0355908,0.00049489475,0.91758984,0.000023899824,0.0456595],"study_design_scores_gemma":[0.0005594431,0.00014648668,0.00019660457,0.00006587122,0.0000060862935,0.00030907782,0.000011499918,0.115672946,0.004249958,0.8785968,0.00008657513,0.000098660654],"about_ca_topic_score_codex":0.0000022567594,"about_ca_topic_score_gemma":7.1015826e-8,"teacher_disagreement_score":0.80757934,"about_ca_system_score_codex":0.000076611905,"about_ca_system_score_gemma":0.00016131782,"threshold_uncertainty_score":0.35907865},"labels":[],"label_agreement":null},{"id":"W1994265724","doi":"10.1016/j.vlsi.2010.08.002","title":"Debugging reversible circuits","year":2010,"lang":"en","type":"article","venue":"Integration","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Deutsche Forschungsgemeinschaft","keywords":"Debugging; Toffoli gate; Computer science; Reversible computing; Boolean satisfiability problem; Computer engineering; Logic gate; CMOS; Algorithmic program debugging; Computation; Electronic circuit; Algorithm; Electronic engineering; Quantum computer; Programming language; Engineering; Quantum; Electrical engineering; Quantum gate","score_opus":0.008933203390488462,"score_gpt":0.23146806597523079,"score_spread":0.2225348625847423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994265724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15428193,0.000014730012,0.8400084,0.001223241,0.0011575511,0.000048373095,3.6807518e-7,0.00027650458,0.0029889042],"genre_scores_gemma":[0.93644154,5.1202454e-7,0.062954545,0.00021552405,0.00015454367,0.0000020913014,0.0000017416683,0.0000037098732,0.00022579933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994699,0.000016194459,0.00008929664,0.00018190403,0.000116450195,0.00012629387],"domain_scores_gemma":[0.9995706,0.000039876537,0.000036274996,0.00026182385,0.000050910967,0.000040479987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015278069,0.000065774984,0.000053642827,0.000070086455,0.000112919886,0.00013476027,0.00030815005,0.00004118624,0.000013285028],"category_scores_gemma":[0.0000563095,0.000053856045,0.000032254193,0.00020219428,0.00001416427,0.00021026404,0.000054040018,0.00025298656,0.000056044886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.9349047e-7,0.000014895181,0.000106065076,0.0000020298917,0.0000031215327,0.0000048015227,0.0009780194,0.00016270799,0.05222284,0.045748107,0.00084405264,0.8999131],"study_design_scores_gemma":[0.00010116998,0.000032995893,0.002114528,0.000019034002,0.0000020207112,0.000047638383,0.000010562883,0.9550098,0.019362336,0.014802547,0.008358959,0.00013837482],"about_ca_topic_score_codex":0.00002934179,"about_ca_topic_score_gemma":0.00003887713,"teacher_disagreement_score":0.9548471,"about_ca_system_score_codex":0.000011536962,"about_ca_system_score_gemma":0.00005859575,"threshold_uncertainty_score":0.21961857},"labels":[],"label_agreement":null},{"id":"W1994917526","doi":"10.1103/physrevlett.102.180501","title":"Universal Computation by Quantum Walk","year":2009,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1035,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Adjacency matrix; Quantum walk; Quantum computer; Quantum algorithm; Computation; Quantum; Feynman diagram; Quantum network; Physics; Quantum mechanics; Computer science; Eigenvalues and eigenvectors; Algorithm","score_opus":0.008317511415490664,"score_gpt":0.26104185411411013,"score_spread":0.2527243426986195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994917526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11459399,0.0039441166,0.7996643,0.08076189,0.00021162751,0.00025833776,0.000003001436,0.00034240648,0.00022029584],"genre_scores_gemma":[0.94022804,0.00040142276,0.008815779,0.05035137,0.00017879461,0.0000013180769,0.000012037392,0.0000066934913,0.0000045327024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988874,0.00009207638,0.00015519832,0.0003396712,0.0002666168,0.0002590464],"domain_scores_gemma":[0.99944204,0.00008408377,0.000085154315,0.0002665882,0.000024310826,0.000097793396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105771025,0.00015815998,0.0002536719,0.000029259927,0.00008710687,0.000063038606,0.0005153637,0.000007149854,0.00000224206],"category_scores_gemma":[0.000013905928,0.00013134722,0.00013326095,0.0003487689,0.00002878547,0.00017971436,0.000048098194,0.00018665023,0.00006578038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031131797,0.00023760911,0.000016804355,0.00021875974,0.00002597054,0.000048037225,0.00031275995,0.008458144,0.008968471,0.015524573,0.09086428,0.8753215],"study_design_scores_gemma":[0.00015700584,0.00010937802,0.0007849333,0.00038552313,0.000012797545,0.000010058177,8.002726e-7,0.98609716,0.00010110003,0.0035937713,0.008499371,0.00024812072],"about_ca_topic_score_codex":0.000006899523,"about_ca_topic_score_gemma":6.4170095e-8,"teacher_disagreement_score":0.977639,"about_ca_system_score_codex":0.00002046023,"about_ca_system_score_gemma":0.000013438155,"threshold_uncertainty_score":0.53561836},"labels":[],"label_agreement":null},{"id":"W1995703916","doi":"10.1103/physrevlett.113.030501","title":"Tensor Networks and Quantum Error Correction","year":2014,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Decoding methods; Quantum error correction; Quantum; Error detection and correction; Equivalence (formal languages); Quantum convolutional code; Computer science; Quantum computer; Code (set theory); Tensor (intrinsic definition); Algorithm; Physics; Discrete mathematics; Mathematics; Quantum mechanics; Pure mathematics","score_opus":0.009583106663965446,"score_gpt":0.2537221614841419,"score_spread":0.24413905482017645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995703916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11207473,0.0024748698,0.8663757,0.017751515,0.00087465235,0.0001827361,2.2943271e-7,0.0002118591,0.00005373897],"genre_scores_gemma":[0.95515734,0.00075853895,0.0049686856,0.038285404,0.0007861187,0.000014552213,0.0000017432512,0.000015476637,0.000012120361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989977,0.00013515269,0.00013919635,0.00034013714,0.00015245967,0.00023537605],"domain_scores_gemma":[0.9992865,0.0002026503,0.000075278636,0.00032334946,0.000019272384,0.00009298697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021380822,0.00014124291,0.00026019695,0.000022993612,0.00010446508,0.00006358175,0.0002968437,0.000008153694,0.0000011175321],"category_scores_gemma":[0.00005990435,0.00010600412,0.00008805561,0.00021863157,0.000047744354,0.00009713889,0.00013194111,0.00021707577,0.00002226851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032899316,0.00010395208,0.0002095003,0.00052870734,0.000028670634,0.000009237578,0.00016349713,0.028436378,0.0011717145,0.010435909,0.033308048,0.9256011],"study_design_scores_gemma":[0.000067450055,0.000048048616,0.0016612605,0.00040394443,0.000010667083,0.000017672468,4.3314932e-7,0.98402125,0.000011316748,0.00038181824,0.01323302,0.00014311395],"about_ca_topic_score_codex":0.0000071933723,"about_ca_topic_score_gemma":3.8994781e-7,"teacher_disagreement_score":0.9555849,"about_ca_system_score_codex":0.000008560552,"about_ca_system_score_gemma":0.0000044949657,"threshold_uncertainty_score":0.43227226},"labels":[],"label_agreement":null},{"id":"W1996492723","doi":"10.1109/icqnm.2009.28","title":"Oblivious Transfer &amp;#x0E0; la Merkle","year":2009,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Oblivious transfer; Quantum computer; Computer science; Cryptography; Scheme (mathematics); Theoretical computer science; Commitment scheme; Quantum cryptography; Polynomial; Computation; Adversary; Quantum; Discrete mathematics; Mathematics; Quantum information; Computer security; Algorithm; Physics; Quantum mechanics","score_opus":0.009372086238962261,"score_gpt":0.23365020871716324,"score_spread":0.22427812247820098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996492723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060168825,0.00009717728,0.9167259,0.0036618682,0.00016620802,0.00006265707,5.4836426e-7,0.00051449117,0.018602373],"genre_scores_gemma":[0.8592737,0.0000070150095,0.13738766,0.0019370962,0.00009658773,0.0000011508774,8.9668663e-7,0.0000057788584,0.0012901619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989919,0.000056902187,0.0001414723,0.00031746112,0.00020580066,0.0002864801],"domain_scores_gemma":[0.99936026,0.000075794764,0.000011024605,0.00042385753,0.000027135658,0.00010193009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019253026,0.00013151448,0.00012810393,0.00007684446,0.00011019469,0.00016224982,0.0006583067,0.000054143944,0.000030911455],"category_scores_gemma":[0.000009904219,0.00010093425,0.00008201431,0.0003169592,0.000023178243,0.00012529297,0.000048936567,0.00017592355,0.00010403378],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032459454,0.00015799735,0.00003706862,0.000004458485,0.0000122455,0.000032092725,0.0014733316,0.00205087,0.0019607197,0.18192098,0.004185917,0.8081611],"study_design_scores_gemma":[0.0012663666,0.0005840515,0.0135404635,0.00006131631,0.000014688044,0.00051998446,0.000016869772,0.5260067,0.0036755402,0.088583186,0.36453447,0.0011963615],"about_ca_topic_score_codex":0.000015054381,"about_ca_topic_score_gemma":0.0000060479815,"teacher_disagreement_score":0.8069647,"about_ca_system_score_codex":0.0000075650933,"about_ca_system_score_gemma":0.00003123231,"threshold_uncertainty_score":0.41159794},"labels":[],"label_agreement":null},{"id":"W1997391728","doi":"10.1103/physrevlett.103.220502","title":"Sampling from the Thermal Quantum Gibbs State and Evaluating Partition Functions with a Quantum Computer","year":2009,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":219,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Quantum system; Physics; Quantum; Quantum algorithm; Quantum operation; Helmholtz free energy; Thermalisation; Quantum statistical mechanics; Gibbs state; Partition function (quantum field theory); Statistical physics; Quantum tomography; Quantum state; Quantum mechanics; Hilbert space; Open quantum system","score_opus":0.028692916752310484,"score_gpt":0.2958594455996296,"score_spread":0.2671665288473191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997391728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60134065,0.0012988724,0.3705112,0.026451789,0.00009110629,0.00021716589,0.0000032111716,0.00007972204,0.0000062880454],"genre_scores_gemma":[0.9449695,0.00019464463,0.019086441,0.035122927,0.0005831563,0.000018364164,0.000009553374,0.00001343362,0.0000019759311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984085,0.00023184632,0.00022642202,0.00046150456,0.0003529104,0.0003187908],"domain_scores_gemma":[0.9988211,0.00045707243,0.00014186327,0.0004500444,0.000043055014,0.00008690773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033444542,0.00021495741,0.00029159823,0.000019376661,0.0003209326,0.00019853374,0.00038999418,0.000007627534,0.0000036116494],"category_scores_gemma":[0.000021698954,0.00012333559,0.000095809526,0.00028144984,0.00007376633,0.00019965341,0.000108624314,0.0003119776,0.00003093336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025254161,0.00020951516,0.00037158834,0.00015412117,0.000107283304,0.000022894015,0.0023893607,0.05440231,0.011521367,0.004629097,0.002817713,0.9233495],"study_design_scores_gemma":[0.0002065734,0.00026254126,0.021916835,0.0009693204,0.000042345084,0.000010176969,0.0000031619738,0.9728089,0.000018727624,0.0025805575,0.00095922634,0.00022162902],"about_ca_topic_score_codex":0.000025687883,"about_ca_topic_score_gemma":0.0000010257086,"teacher_disagreement_score":0.9231279,"about_ca_system_score_codex":0.000015432968,"about_ca_system_score_gemma":0.000025005062,"threshold_uncertainty_score":0.5029479},"labels":[],"label_agreement":null},{"id":"W1997510390","doi":"10.1007/s11128-012-0480-x","title":"Adiabatic quantum optimization with qudits","year":2012,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; D-Wave Systems (Canada)","funders":"","keywords":"Qubit; Adiabatic process; Quantum computer; Physics; Quantum mechanics; Adiabatic quantum computation; Ground state; Quantum; Upper and lower bounds; Energy (signal processing); State (computer science); Statistical physics; Computer science; Mathematics; Algorithm","score_opus":0.00804093882284985,"score_gpt":0.21672777413413402,"score_spread":0.20868683531128418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997510390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024595397,0.00021384908,0.97250015,0.00048777447,0.00035678418,0.0001669327,0.000001582446,0.0004898568,0.001187667],"genre_scores_gemma":[0.86241376,0.000005364179,0.13683309,0.00055730157,0.00013101262,0.00001541253,0.00002031164,0.000011941914,0.000011804435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839145,0.000045280056,0.00042103676,0.00016177064,0.00045224687,0.00052823813],"domain_scores_gemma":[0.99888766,0.000051691764,0.00036239976,0.00031033478,0.00020791656,0.00018000093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043777496,0.0002168138,0.00017847402,0.00025538346,0.0004441196,0.00054410053,0.00046323374,0.00007278442,0.000012115928],"category_scores_gemma":[0.000061564955,0.00016789947,0.000037976894,0.0008111153,0.000046548266,0.0070649777,0.00010726939,0.00021009656,0.00008740763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002162213,0.00012527496,0.00097309594,0.00037082206,0.000026597492,0.0000022950564,0.015953839,0.5605837,0.000025374571,0.07071288,0.0005554114,0.35064906],"study_design_scores_gemma":[0.00029275112,0.00007812642,0.00067653944,0.00011866477,0.000007600906,0.00008139765,0.00015858428,0.9951273,0.00012422494,0.0004624553,0.0025884453,0.00028388968],"about_ca_topic_score_codex":0.0000071620548,"about_ca_topic_score_gemma":2.8027196e-7,"teacher_disagreement_score":0.8378184,"about_ca_system_score_codex":0.00004726092,"about_ca_system_score_gemma":0.00014160598,"threshold_uncertainty_score":0.68467414},"labels":[],"label_agreement":null},{"id":"W1997589253","doi":"10.1142/s0218126611007797","title":"A NOVEL REVERSIBLE ZS GATE AND ITS APPLICATION FOR OPTIMIZATION OF QUANTUM ADDER CIRCUITS","year":2011,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Adder; Carry (investment); Computer science; Carry-save adder; Arithmetic; Logic gate; Electronic circuit; Quantum; Quantum circuit; Toffoli gate; Quantum computer; Quantum gate; Mathematics; Algorithm; Quantum error correction; Physics; Quantum mechanics; Telecommunications","score_opus":0.026099152966127526,"score_gpt":0.22557831876645115,"score_spread":0.19947916580032363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997589253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03498552,0.0011468134,0.9627369,0.000084350235,0.00066791754,0.000304063,0.000005254425,0.000021331209,0.00004786183],"genre_scores_gemma":[0.98122805,0.000059698446,0.018468278,0.000050449344,0.00016516045,0.000004768752,8.5893055e-7,0.000012124557,0.000010585997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870956,0.00004881247,0.00057102845,0.0002441977,0.00023198531,0.00019440659],"domain_scores_gemma":[0.9984248,0.00011259699,0.0007775969,0.00016223309,0.0003847601,0.00013800147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057939906,0.00015136109,0.0003704833,0.00022332567,0.00010971767,0.00007510306,0.00035873853,0.00007621126,4.5381472e-7],"category_scores_gemma":[0.000021062235,0.00012935136,0.000082448896,0.00022823305,0.000031317275,0.00032660915,0.00008087912,0.000121115154,2.396295e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059060152,0.00066473155,0.00068606075,0.0022027579,0.0006436605,0.000030744224,0.01400263,0.5359747,0.019047437,0.15481193,0.0007725327,0.27110374],"study_design_scores_gemma":[0.00083379436,0.0003826737,0.00079206727,0.00029946092,0.000025695328,0.0004937438,0.00006466035,0.9960651,0.00025043043,0.00041818747,0.00022296057,0.00015126957],"about_ca_topic_score_codex":0.000018126697,"about_ca_topic_score_gemma":2.7809264e-7,"teacher_disagreement_score":0.9462426,"about_ca_system_score_codex":0.000016529813,"about_ca_system_score_gemma":0.00007076487,"threshold_uncertainty_score":0.5274795},"labels":[],"label_agreement":null},{"id":"W1998150469","doi":"10.1088/1367-2630/13/4/043005","title":"Clifford gates by code deformation","year":2011,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Physics; MAJORANA; Code (set theory); Twist; Planar; Deformation (meteorology); Topology (electrical circuits); Feature (linguistics); Theoretical physics; Computational science; Quantum mechanics; Programming language; Geometry; Computer science; Combinatorics; Computer graphics (images); Superconductivity","score_opus":0.020176519872952058,"score_gpt":0.23096401597578065,"score_spread":0.2107874961028286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998150469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08163785,0.00011828621,0.91707826,0.0002801707,0.00037496458,0.000022082339,9.53911e-7,0.000024688226,0.0004627517],"genre_scores_gemma":[0.8383628,0.000021628253,0.16066301,0.00030955832,0.00056916435,1.5369461e-7,7.0419435e-7,0.000008395812,0.00006456402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993393,0.000023758896,0.0002287984,0.00007006121,0.00020280242,0.00013532142],"domain_scores_gemma":[0.9993664,0.000025654836,0.0002841105,0.00013984375,0.00008586843,0.000098135904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014293283,0.00007723829,0.00011889251,0.000029576699,0.00005947114,0.000052250645,0.0005117544,0.000023568817,0.000004446569],"category_scores_gemma":[0.000009105615,0.000057904195,0.000079139536,0.00014677417,0.000016095279,0.00041426328,0.00006064238,0.00017788315,0.000011364692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012296261,0.000120572775,0.0003006825,0.000010574761,0.00003756803,0.00001488012,0.005027141,0.0013310354,0.0016198094,0.020440951,0.018490355,0.95259416],"study_design_scores_gemma":[0.0017727732,0.0013002751,0.0021810136,0.00019759976,0.00003815167,0.0005497306,0.00009483311,0.49077505,0.11031724,0.36277896,0.029438552,0.0005558388],"about_ca_topic_score_codex":0.000010075059,"about_ca_topic_score_gemma":4.4599074e-7,"teacher_disagreement_score":0.9520383,"about_ca_system_score_codex":0.000012755213,"about_ca_system_score_gemma":0.00006365136,"threshold_uncertainty_score":0.23612645},"labels":[],"label_agreement":null},{"id":"W1998609524","doi":"10.1103/physreva.86.042301","title":"Classical simulation of measurement-based quantum computation on higher-genus surface-code states","year":2012,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantum computer; Quantum entanglement; Code (set theory); Surface (topology); Computation; Embedding; Computer science; Algorithm; Quantum state; Theoretical computer science; Quantum; Statistical physics; Mathematics; Quantum mechanics; Physics; Geometry","score_opus":0.05259260568646276,"score_gpt":0.3269070098348041,"score_spread":0.2743144041483413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998609524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25404575,0.0057998793,0.7359411,0.0028752715,0.00047311326,0.0004878362,0.00000798656,0.00021547875,0.00015355262],"genre_scores_gemma":[0.99453807,0.00005280662,0.004609481,0.0006060448,0.00016653966,0.000005182413,0.000006433278,0.000012625955,0.0000028401362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981064,0.00025025575,0.0003138056,0.00027774525,0.00073568686,0.00031605977],"domain_scores_gemma":[0.9987121,0.00043934706,0.0002122463,0.00033315874,0.0001663851,0.00013672664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005319439,0.00018742516,0.00038662227,0.000033745193,0.0000707182,0.000027522467,0.00031542312,0.00002495647,0.000003102661],"category_scores_gemma":[0.00009563184,0.00014326737,0.0001700368,0.0003799349,0.000042060816,0.00014049967,0.00006827272,0.00017895592,0.00004475294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013371342,0.00094648375,0.00013161628,0.0008418739,0.000030078645,0.0000014247228,0.00018697011,0.8624494,0.00094520353,0.016851904,0.00054193765,0.11705974],"study_design_scores_gemma":[0.00020017795,0.00017723789,0.0019186744,0.00081696565,0.00002234746,3.5716178e-7,5.8491315e-7,0.98973364,0.0008557722,0.0025841505,0.0035266122,0.00016348588],"about_ca_topic_score_codex":0.0000054791326,"about_ca_topic_score_gemma":2.2518327e-7,"teacher_disagreement_score":0.7404923,"about_ca_system_score_codex":0.000050414805,"about_ca_system_score_gemma":0.000045472407,"threshold_uncertainty_score":0.5842274},"labels":[],"label_agreement":null},{"id":"W1999626800","doi":"10.1017/s0960129504004256","title":"Towards a quantum programming language","year":2004,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":496,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Programming language; First-generation programming language; Denotational semantics; Semantics (computer science); Operational semantics; Theoretical computer science; Syntax; Programming paradigm; Artificial intelligence","score_opus":0.010119749812430157,"score_gpt":0.26934013545514157,"score_spread":0.25922038564271144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999626800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18833652,0.000059844697,0.8098143,0.00075261935,0.00043441172,0.00018504592,5.241505e-7,0.00026440216,0.00015238288],"genre_scores_gemma":[0.5279873,4.1556862e-7,0.47170687,0.00020992615,0.00008304321,0.000005049809,2.0836598e-7,0.000006057556,0.0000011082107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971696,0.000038621933,0.0003859259,0.00079300057,0.000832325,0.00078048545],"domain_scores_gemma":[0.9987138,0.00008331693,0.00008921819,0.0008310096,0.000061980805,0.00022070746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007585157,0.00025310754,0.00028423048,0.00031019264,0.0002616221,0.0006750267,0.0027365307,0.000054318414,0.0000077549785],"category_scores_gemma":[0.00011323427,0.00019000898,0.00008162642,0.0016187886,0.00045912515,0.00041864504,0.0012045583,0.00033510482,0.00002257941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013370134,0.00007414447,0.00002748369,0.00003139837,0.0000024895448,0.00012960982,0.0037697232,0.015719423,0.0002452208,0.4870425,0.0000045599763,0.49295214],"study_design_scores_gemma":[0.00028397268,0.00006071707,0.0015124594,0.000068713234,0.0000010986186,0.00022170243,0.000014826989,0.59768957,0.0009587368,0.3989277,0.000042926826,0.00021756561],"about_ca_topic_score_codex":0.00003623028,"about_ca_topic_score_gemma":0.000003846274,"teacher_disagreement_score":0.58197016,"about_ca_system_score_codex":0.00012489446,"about_ca_system_score_gemma":0.00023574197,"threshold_uncertainty_score":0.77483416},"labels":[],"label_agreement":null},{"id":"W1999750154","doi":"10.1088/0305-4470/37/34/l01","title":"Adiabatic quantum oracles","year":2004,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and General","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adiabatic process; Physics; Quantum; Theoretical physics; Quantum mechanics; Computer science","score_opus":0.011006958795579055,"score_gpt":0.23603794483643023,"score_spread":0.22503098604085117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999750154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5033257,0.00009693928,0.495431,0.0009808594,0.00008669541,0.000020533847,3.2524116e-7,0.0000110883875,0.00004687396],"genre_scores_gemma":[0.7552368,0.00001035041,0.24410947,0.00019016139,0.00042837,4.4801791e-7,9.988002e-8,0.0000063018897,0.0000179855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921626,0.000021904498,0.00027249142,0.00010205852,0.00022948922,0.00015782494],"domain_scores_gemma":[0.9994633,0.0000607443,0.00015484435,0.00013261907,0.000065443164,0.00012301104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019429912,0.00009969186,0.0002230833,0.000037008303,0.00006929063,0.00010783568,0.00028711557,0.000025040317,0.000002194341],"category_scores_gemma":[0.000028102557,0.00006581301,0.00009573299,0.00013049519,0.000045791083,0.00016789473,0.00009554071,0.0001680799,0.0000074494174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020923965,0.00013698678,0.0000074644945,0.00003576943,0.000023715551,0.000035089102,0.0007235071,0.0042042774,0.0009704368,0.9549003,0.000052596577,0.038907718],"study_design_scores_gemma":[0.00030591045,0.0001676924,0.0001234993,0.000074272895,0.00000850494,0.00025593964,0.000008000709,0.19484435,0.00092980353,0.8031309,0.00006827959,0.00008281362],"about_ca_topic_score_codex":0.0000012660507,"about_ca_topic_score_gemma":9.140118e-8,"teacher_disagreement_score":0.25191113,"about_ca_system_score_codex":0.000010440371,"about_ca_system_score_gemma":0.00005385447,"threshold_uncertainty_score":0.26837766},"labels":[],"label_agreement":null},{"id":"W2001258215","doi":"10.1007/s10955-010-0047-0","title":"Dynamical Localization of Quantum Walks in Random Environments","year":2010,"lang":"en","type":"article","venue":"Journal of Statistical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Agence Nationale de la Recherche","keywords":"Quantum walk; Operator (biology); Mathematics; Degrees of freedom (physics and chemistry); Random walk; Anderson localization; Unitary operator; Position (finance); Statistical physics; Quantum; Quantum mechanics; Mathematical analysis; Physics; Quantum algorithm; Hilbert space","score_opus":0.005171821199573056,"score_gpt":0.23433177219949491,"score_spread":0.22915995099992187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001258215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06513279,0.000009319051,0.934358,0.00010483817,0.00032591715,0.000036233912,0.0000053750587,0.000004005921,0.000023498109],"genre_scores_gemma":[0.90714186,0.000004772533,0.09270046,0.000038522274,0.00010560812,2.465759e-7,0.0000013022542,0.000005400798,0.0000018075286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988818,0.00006521972,0.00043976298,0.0001128226,0.00035287437,0.00014751863],"domain_scores_gemma":[0.9991468,0.00033062464,0.0002461011,0.00015103778,0.000041075502,0.00008432057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002970652,0.0000867252,0.0002501358,0.00005301399,0.000027239881,0.000024916622,0.00033721133,0.000045058638,0.000006085079],"category_scores_gemma":[0.0001245733,0.00006824043,0.00005497945,0.00015696649,0.00009715541,0.00012374134,0.000074628704,0.0004379749,0.0000026728417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013775913,0.001076951,0.0020941307,0.000059027898,0.000050130096,0.00016404361,0.00092242024,0.14501007,0.011736113,0.51640266,0.00022614504,0.32212055],"study_design_scores_gemma":[0.0008005333,0.00012948671,0.0036505687,0.00002511211,0.0000056164768,0.0000222641,0.000003236137,0.87740964,0.0003828708,0.117401615,0.00010319497,0.000065834],"about_ca_topic_score_codex":0.0000065090494,"about_ca_topic_score_gemma":0.0000011624697,"teacher_disagreement_score":0.84200907,"about_ca_system_score_codex":0.000015329077,"about_ca_system_score_gemma":0.00005659953,"threshold_uncertainty_score":0.2782764},"labels":[],"label_agreement":null},{"id":"W2001527002","doi":"10.1016/j.tcs.2014.09.018","title":"Using quantum key distribution for cryptographic purposes: A survey","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":218,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Quantum key distribution; Computer science; Cryptography; Key (lock); Cryptographic primitive; Computer security; Key exchange; Quantum cryptography; Context (archaeology); Cipher; Key distribution; Key management; Cryptographic protocol; Public-key cryptography; Encryption; Quantum; Quantum information; Physics","score_opus":0.020723023151779523,"score_gpt":0.27366366658569335,"score_spread":0.2529406434339138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001527002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14300875,0.000015632748,0.8551579,0.00032789857,0.0009242425,0.00024714295,0.000013807053,0.00024628855,0.000058320406],"genre_scores_gemma":[0.710078,8.2508865e-7,0.2894843,0.00022902444,0.00018670267,0.0000053470326,0.0000058842757,0.000009288538,6.277794e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967854,0.00032346477,0.0003598892,0.0009980482,0.00064752216,0.000885645],"domain_scores_gemma":[0.99730015,0.00092702813,0.0001237787,0.00092928443,0.00038913378,0.0003306552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004488801,0.0002652716,0.00030660568,0.00018994785,0.0009621693,0.00076135097,0.0026228286,0.00007507625,0.0000028777051],"category_scores_gemma":[0.00046463593,0.00021564378,0.00013593966,0.0017987742,0.0018551373,0.00039148683,0.0008618384,0.00022414495,0.000009749255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009268281,0.00004885462,0.00012615797,0.000010143748,0.0000039778383,0.0000010099985,0.0001199354,0.0037439358,0.00026102227,0.97051156,0.00002477846,0.025139386],"study_design_scores_gemma":[0.00022646718,0.00028190692,0.0032908146,0.00003112502,0.000004030207,0.00002713002,8.9495336e-7,0.78916436,0.00045414863,0.20602895,0.00023350044,0.00025664837],"about_ca_topic_score_codex":0.00001939057,"about_ca_topic_score_gemma":0.0000015969609,"teacher_disagreement_score":0.7854204,"about_ca_system_score_codex":0.000048266742,"about_ca_system_score_gemma":0.0001362219,"threshold_uncertainty_score":0.8793698},"labels":[],"label_agreement":null},{"id":"W2001857026","doi":"10.26421/qic8.8-9-5","title":"Measuring 4-local qubit observables could probabilistically solve PSPACE","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Observable; Qubit; PSPACE; Operator (biology); Quantum; State (computer science); Probabilistic logic; Mathematics; Class (philosophy); Conjecture; Algorithm; Computer science; Discrete mathematics; Computational complexity theory; Quantum mechanics; Physics; Statistics","score_opus":0.031782315608792744,"score_gpt":0.23126836339907839,"score_spread":0.19948604779028564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001857026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13938898,0.000044586483,0.8586448,0.0007679965,0.00019448335,0.00018467182,0.0000021679725,0.00032087095,0.00045145038],"genre_scores_gemma":[0.9216784,0.000023874336,0.077611685,0.0005933937,0.000046710345,0.000010655348,0.000018163459,0.0000063614884,0.000010746491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861175,0.000049228383,0.0004293681,0.0002176602,0.00041764803,0.00027435116],"domain_scores_gemma":[0.9991792,0.00012292694,0.00017797964,0.0001593574,0.00022545322,0.00013510756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028767347,0.000181251,0.0001828519,0.00014794232,0.00048002513,0.00024329944,0.0002720438,0.000081009486,0.0000036392348],"category_scores_gemma":[0.000065042106,0.00016425468,0.00005121142,0.00033032845,0.00011290357,0.0013023597,0.00014746045,0.00019959708,0.00007199708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038012637,0.00010747477,0.00047100324,0.0001968566,0.00003583729,0.000018534209,0.011083726,0.29633588,0.00009557608,0.2840223,0.0017688154,0.405826],"study_design_scores_gemma":[0.00041063468,0.00011907196,0.007234639,0.00003565804,0.000003639818,0.00016299877,0.00010513154,0.9802457,0.00006876815,0.008803062,0.0025923504,0.00021834011],"about_ca_topic_score_codex":0.000044064007,"about_ca_topic_score_gemma":0.0000033068568,"teacher_disagreement_score":0.78228945,"about_ca_system_score_codex":0.000040555915,"about_ca_system_score_gemma":0.00011751069,"threshold_uncertainty_score":0.6698112},"labels":[],"label_agreement":null},{"id":"W2002086086","doi":"10.1109/mwscas.2011.6026310","title":"Reversible adder/subtractor with overflow detector","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Adder; Subtractor; Complement (music); Block (permutation group theory); Computer science; Computation; Arithmetic; Parallel computing; Carry-save adder; Algorithm; Mathematics; Latency (audio); Telecommunications","score_opus":0.016606834093622774,"score_gpt":0.1990427531206305,"score_spread":0.18243591902700773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002086086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18246832,0.00004920257,0.79538816,0.00021060274,0.00032462692,0.00013055812,0.0000014121531,0.00063121086,0.020795887],"genre_scores_gemma":[0.65162426,0.0000014473397,0.34749258,0.00028222927,0.00005941171,0.0000024193832,2.887326e-7,0.000008857002,0.0005284799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899054,0.000026125244,0.00011416054,0.00035970737,0.0002052993,0.00030415884],"domain_scores_gemma":[0.9992084,0.000042968306,0.000050969447,0.00052731717,0.000047110665,0.00012325516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010016828,0.00014424561,0.0001232935,0.0000757442,0.00011249185,0.0000691768,0.0006869588,0.000043114054,0.00017967657],"category_scores_gemma":[0.000009815807,0.000097209486,0.000047981328,0.0003144425,0.000034267094,0.00024057509,0.0001608855,0.00015719041,0.00010203691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025500575,0.0013930246,0.016878016,0.00016891873,0.00044944006,0.0015613042,0.019886356,0.0014236104,0.0072939293,0.14527345,0.022642508,0.78277445],"study_design_scores_gemma":[0.0025432291,0.0028057008,0.081272066,0.0001886703,0.000039630966,0.00088692096,0.0001485054,0.7964036,0.0777719,0.010976635,0.024736779,0.0022263492],"about_ca_topic_score_codex":0.000086084656,"about_ca_topic_score_gemma":0.000020556714,"teacher_disagreement_score":0.79498,"about_ca_system_score_codex":0.000012129978,"about_ca_system_score_gemma":0.000056304096,"threshold_uncertainty_score":0.39640877},"labels":[],"label_agreement":null},{"id":"W2002346262","doi":"10.1142/s0129626410000223","title":"ON THE IMPORTANCE OF BEING QUANTUM","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Champion; Tournament; Computer chess; Computer science; Quantum; Artificial intelligence; Center (category theory); Quantum computer; Natural (archaeology); Mathematics; Political science; Law; History; Quantum mechanics; Physics","score_opus":0.009436269288148325,"score_gpt":0.23207731980678123,"score_spread":0.2226410505186329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002346262","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73428965,0.000026605647,0.24423711,0.020673495,0.00025417708,0.000069142894,2.6686916e-7,0.00010131914,0.00034824634],"genre_scores_gemma":[0.9542525,6.43211e-7,0.04004621,0.0055697346,0.00010171695,0.0000060680195,4.1519857e-7,0.000010628425,0.000012093319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988707,0.00003618946,0.00021989478,0.00031141087,0.00028318493,0.00027863635],"domain_scores_gemma":[0.9990345,0.0002012866,0.00018054472,0.00050096406,0.00003617011,0.000046508976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037480783,0.00014251792,0.00013928558,0.000060609003,0.00025445342,0.00013331565,0.0010305402,0.00003745409,0.0000062634167],"category_scores_gemma":[0.00008531341,0.00009091594,0.00006486007,0.0002763155,0.00012339013,0.00012594915,0.00012565473,0.00045636456,0.000009972032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032731987,0.00025197328,0.0073097954,0.0002189436,0.00006067343,0.00008832802,0.009092038,0.028771933,0.16988072,0.6530202,0.008419123,0.12285352],"study_design_scores_gemma":[0.00023023582,0.000051106657,0.0037539864,0.00010101549,0.0000049154496,0.00003261543,0.000016903936,0.95252174,0.0020046593,0.04017971,0.000816019,0.00028708126],"about_ca_topic_score_codex":0.000005077383,"about_ca_topic_score_gemma":0.0000020002544,"teacher_disagreement_score":0.9237498,"about_ca_system_score_codex":0.000005682641,"about_ca_system_score_gemma":0.000038938484,"threshold_uncertainty_score":0.37074444},"labels":[],"label_agreement":null},{"id":"W2003956696","doi":"10.1007/s11128-007-0070-5","title":"Controllability and Universal Three-qubit Quantum Computation with Trapped Electron States","year":2008,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Quantum computer; Qubit; Controllability; Quantum algorithm; Quantum gate; Quantum error correction; Open quantum system; Quantum information; Quantum technology","score_opus":0.00734501829552111,"score_gpt":0.21246709754564483,"score_spread":0.2051220792501237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003956696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45759645,0.00009110195,0.5413097,0.00046393086,0.00004284339,0.000160933,0.0000020431166,0.00024390745,0.000089096895],"genre_scores_gemma":[0.9835797,0.000014720814,0.01608551,0.0002477975,0.000028480084,0.0000067510578,0.000024524956,0.000008857802,0.0000036877907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846876,0.00005310363,0.00041574365,0.00027463032,0.00040217658,0.000385566],"domain_scores_gemma":[0.99898744,0.00010040558,0.00032085608,0.00019251392,0.00027874918,0.00012004572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133655,0.00023142612,0.00025164837,0.0002025446,0.000701979,0.00033582223,0.00028389166,0.000069036025,0.0000015035254],"category_scores_gemma":[0.00002728866,0.0001854272,0.000034975514,0.0005610302,0.00016794892,0.0027584059,0.00007395305,0.0002501673,0.000008100834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070254353,0.00030361128,0.008180859,0.00090210437,0.00013190224,0.00005630995,0.04861137,0.183454,0.00044631815,0.061668493,0.0004667767,0.6950757],"study_design_scores_gemma":[0.0011192914,0.0003351765,0.0066157067,0.00005378263,0.0000074929935,0.00017516741,0.00017469587,0.9848034,0.00016856685,0.005873389,0.0004043953,0.0002689812],"about_ca_topic_score_codex":0.000049407186,"about_ca_topic_score_gemma":0.000007889325,"teacher_disagreement_score":0.80134934,"about_ca_system_score_codex":0.00005391342,"about_ca_system_score_gemma":0.0002651104,"threshold_uncertainty_score":0.7561502},"labels":[],"label_agreement":null},{"id":"W2004511163","doi":"10.1103/physrevlett.114.140502","title":"Experimental Quantum-Walk Revival with a Time-Dependent Coin","year":2015,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Canadian Institute for Advanced Research","funders":"State Key Laboratory of Precision Spectroscopy; East China Normal University; National Natural Science Foundation of China","keywords":"Quantum walk; Physics; Coin flipping; Photon; Interferometry; Quantum; Lattice (music); Quantum mechanics; Transverse plane; Statistical physics; Optics; Quantum algorithm; Mathematics; Statistics; Acoustics","score_opus":0.017423301688056485,"score_gpt":0.27423977224712837,"score_spread":0.25681647055907186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004511163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7154425,0.0280541,0.20834295,0.043982517,0.00059405674,0.0014694526,0.000007513169,0.00094710645,0.0011598151],"genre_scores_gemma":[0.9545277,0.00012857433,0.016963858,0.02770753,0.0005664277,0.00003530403,0.0000067735036,0.000034026758,0.000029826733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981182,0.0001722349,0.00021529949,0.00050746097,0.0006211528,0.00036560037],"domain_scores_gemma":[0.9988829,0.00007878225,0.000117865195,0.00061387353,0.00004442058,0.0002621883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027969357,0.00025498905,0.00044105476,0.00003357715,0.000071541224,0.00009694597,0.00077069434,0.000008504161,0.000008930123],"category_scores_gemma":[0.00002846958,0.00017534984,0.00013319746,0.0003109914,0.00007156745,0.00019402988,0.00020946155,0.0002372795,0.00041636833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003023244,0.0058646956,0.0006412065,0.0048692357,0.0009849914,0.0038166486,0.01366575,0.061624072,0.14612004,0.040819455,0.27469957,0.446592],"study_design_scores_gemma":[0.0013595232,0.00097379554,0.00019902817,0.0031387142,0.00006556905,0.0003297289,0.000016247614,0.96815187,0.003840625,0.00074516947,0.020026825,0.001152905],"about_ca_topic_score_codex":0.000016281047,"about_ca_topic_score_gemma":1.9108704e-7,"teacher_disagreement_score":0.9065278,"about_ca_system_score_codex":0.00004529275,"about_ca_system_score_gemma":0.000054546857,"threshold_uncertainty_score":0.7150559},"labels":[],"label_agreement":null},{"id":"W2004756728","doi":"10.1109/tit.2014.2313577","title":"Concatenated Quantum Codes Can Attain the Quantum Gilbert–Varshamov Bound","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Ministry of Education - Singapore","keywords":"Quantum convolutional code; Discrete mathematics; Mathematics; Quantum algorithm; Block code; Quantum; Combinatorics; Upper and lower bounds; Physics; Quantum mechanics; Quantum error correction; Algorithm; Decoding methods","score_opus":0.007184576919945558,"score_gpt":0.2138843273454455,"score_spread":0.20669975042549993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004756728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022586767,0.0000129731725,0.9713809,0.0030357428,0.0012750532,0.00024818323,0.00002976176,0.00044090033,0.0009897358],"genre_scores_gemma":[0.9945222,0.000011439983,0.001144581,0.0040494916,0.000062650724,0.000035033565,0.000013219038,0.000013375262,0.0001480149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804837,0.00042751047,0.0004912455,0.00022980456,0.00039881034,0.00040427077],"domain_scores_gemma":[0.99789846,0.00091046636,0.00021463484,0.0007337529,0.0001372177,0.00010547092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013302321,0.0002589934,0.00021294276,0.00024444578,0.00096604123,0.00045441225,0.00096266385,0.000108136956,0.000033684817],"category_scores_gemma":[0.000042333177,0.00017894339,0.00014906227,0.00054453727,0.00019381593,0.0007155567,0.0000088488905,0.0004997947,0.00017091818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006834033,0.00010872432,0.0000028833326,0.00004558343,0.00010495964,0.0000018168445,0.009362338,0.2620611,0.00013975606,0.5164032,0.0012360095,0.21046531],"study_design_scores_gemma":[0.0004707479,0.00016675508,0.00008430823,0.000036064655,0.000015528345,0.000041606458,0.00021403779,0.94500005,0.0025409302,0.037941,0.013211875,0.0002770717],"about_ca_topic_score_codex":0.000093600436,"about_ca_topic_score_gemma":0.000018853245,"teacher_disagreement_score":0.97193545,"about_ca_system_score_codex":0.00006211414,"about_ca_system_score_gemma":0.0000810606,"threshold_uncertainty_score":0.7430106},"labels":[],"label_agreement":null},{"id":"W2005144372","doi":"10.1103/physrevlett.102.190501","title":"Most Quantum States Are Too Entangled To Be Useful As Computational Resources","year":2009,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":291,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum entanglement; Speedup; Quantum computer; Cluster state; Quantum mechanics; Quantum; Quantum algorithm; Qubit; Computation; Physics; Quantum teleportation; Quantum state; Computer science; Quantum network; Algorithm; Parallel computing","score_opus":0.013629277241834799,"score_gpt":0.27596278896172743,"score_spread":0.2623335117198926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005144372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6734282,0.0015230479,0.059762474,0.26440692,0.000147567,0.00038636287,0.000010121814,0.00026686318,0.000068465284],"genre_scores_gemma":[0.5280637,0.00017631857,0.013824302,0.4574919,0.00037239518,0.000016511174,0.0000201722,0.000018751703,0.000015939613],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806356,0.00013552218,0.00028693525,0.0005524021,0.000559493,0.00040210175],"domain_scores_gemma":[0.99886197,0.00025075141,0.00014129624,0.0004454483,0.000076678676,0.00022384537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018192356,0.00025384055,0.00042450015,0.00006709104,0.00016102265,0.00017188553,0.0008656142,0.000010248913,0.0000062702675],"category_scores_gemma":[0.000085888525,0.0002055906,0.00015086182,0.000736426,0.000040641356,0.00015480166,0.00017497715,0.000229267,0.00014626386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046212448,0.0013915513,0.00036648422,0.0009608695,0.00017645092,0.0005195447,0.008904447,0.32326835,0.0048819133,0.042915408,0.35677642,0.25979233],"study_design_scores_gemma":[0.00042256658,0.0004885987,0.00905138,0.0018236685,0.000038306964,0.00005486236,0.000021164758,0.8389869,0.00017104132,0.01659143,0.13145804,0.0008920379],"about_ca_topic_score_codex":0.000011568448,"about_ca_topic_score_gemma":5.001895e-7,"teacher_disagreement_score":0.5157185,"about_ca_system_score_codex":0.00003617574,"about_ca_system_score_gemma":0.000025787915,"threshold_uncertainty_score":0.83837414},"labels":[],"label_agreement":null},{"id":"W2005225046","doi":"10.1063/1.3155783","title":"Quantum error correction on infinite-dimensional Hilbert spaces","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Hilbert space; Von Neumann architecture; Generalization; Subspace topology; Observable; SIC-POVM; Quantum; Von Neumann algebra","score_opus":0.017523498745153295,"score_gpt":0.26324971766007293,"score_spread":0.24572621891491964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005225046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2692527,0.000041527994,0.7226468,0.005477632,0.0013137102,0.00007918132,5.809882e-7,0.00007131212,0.0011165843],"genre_scores_gemma":[0.9397075,0.000002296644,0.058352355,0.0011205624,0.0007133198,3.2948415e-7,3.0934675e-7,0.000009443486,0.00009384976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863005,0.000062612715,0.00038952642,0.00014554797,0.00056993205,0.00020233597],"domain_scores_gemma":[0.99871576,0.0004459177,0.00033403526,0.00023772797,0.00014028966,0.00012626636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003398838,0.00015179602,0.0002955587,0.00007836274,0.000098484576,0.00011042271,0.00042410573,0.000049238854,0.0000079095935],"category_scores_gemma":[0.00015114446,0.00010446613,0.00017956155,0.00025010874,0.00003113602,0.0002061096,0.000049828475,0.00043350906,0.000051052604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096196156,0.0023111103,0.00001965641,0.000056360972,0.00009051363,0.0001568941,0.0018474009,0.10899555,0.0019458778,0.57841176,0.023022583,0.28304613],"study_design_scores_gemma":[0.00021593606,0.0007149413,0.00023111622,0.0001711153,0.000008484725,0.00018486865,0.00000961354,0.62156874,0.0007493685,0.37571716,0.00031777102,0.00011087235],"about_ca_topic_score_codex":4.106987e-7,"about_ca_topic_score_gemma":5.0557194e-8,"teacher_disagreement_score":0.67045486,"about_ca_system_score_codex":0.000028078799,"about_ca_system_score_gemma":0.000059302234,"threshold_uncertainty_score":0.42600054},"labels":[],"label_agreement":null},{"id":"W2006730392","doi":"10.1103/physrevlett.96.170501","title":"Benchmarking Quantum Control Methods on a 12-Qubit System","year":2006,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":204,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Qubit; Qutrit; Observable; Quantum decoherence; Physics; Quantum mechanics; Computer science; Quantum; Coherence (philosophical gambling strategy); Quantum computer; Quantum state; Hilbert space; Quantum error correction; Topology (electrical circuits); Mathematics","score_opus":0.011370742223683691,"score_gpt":0.28982184053535354,"score_spread":0.27845109831166986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006730392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014522835,0.0028742389,0.96931666,0.011286215,0.0005517295,0.0004573025,0.000002734975,0.00038786276,0.00060039974],"genre_scores_gemma":[0.8936491,0.00007560353,0.07634026,0.028172454,0.0016526753,0.00006680464,0.00000426654,0.00003179014,0.0000070539977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769485,0.00052335067,0.00034930892,0.00058389164,0.0003937703,0.00045482346],"domain_scores_gemma":[0.99841374,0.0006031267,0.00018956157,0.000667647,0.000028809782,0.00009712197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000655375,0.00027913286,0.0005890498,0.000061077175,0.00015973586,0.000114821305,0.0007823833,0.000013462129,0.0000020795121],"category_scores_gemma":[0.000032682576,0.00020876125,0.00032911412,0.0003477048,0.00004481057,0.000101801044,0.00012025804,0.000320812,0.000072748255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016401329,0.00047943898,0.000096827534,0.0038123073,0.00013843844,0.00024358444,0.00022434122,0.039455,0.018928677,0.3861849,0.023952052,0.52646804],"study_design_scores_gemma":[0.0002671147,0.00009438124,0.000527708,0.0022556344,0.00003491486,0.000024255516,7.159056e-7,0.9820043,0.0001482347,0.0008736127,0.013456634,0.00031248791],"about_ca_topic_score_codex":0.000034764547,"about_ca_topic_score_gemma":3.5331064e-7,"teacher_disagreement_score":0.9425493,"about_ca_system_score_codex":0.0000633757,"about_ca_system_score_gemma":0.000018446053,"threshold_uncertainty_score":0.8513037},"labels":[],"label_agreement":null},{"id":"W2006872837","doi":"10.1007/s00037-011-0016-2","title":"A Quantum Characterization Of NP","year":2011,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Complexity class; Class (philosophy); Quantum entanglement; Soundness; Completeness (order theory); Discrete mathematics; Quantum complexity theory; Characterization (materials science); Logarithm; Mathematics; Quantum; Context (archaeology); Combinatorics; Computer science; Quantum algorithm; Time complexity; Quantum mechanics; Physics","score_opus":0.06338483869152876,"score_gpt":0.25711491752253,"score_spread":0.19373007883100124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006872837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38094655,0.000007645748,0.6179493,0.00014739433,0.0001840749,0.00006942515,0.000009462823,0.00011550125,0.0005706361],"genre_scores_gemma":[0.83768255,5.020284e-7,0.1620511,0.00017518879,0.0000423606,0.0000027378471,0.000028386185,0.00000655338,0.000010613776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988316,0.00008690628,0.0003159213,0.0002954031,0.00028551187,0.00018464684],"domain_scores_gemma":[0.999173,0.0000652218,0.00019531413,0.00029380692,0.0001992048,0.00007346862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019583829,0.00013004134,0.00018852191,0.00012787661,0.00012328828,0.000031000392,0.0006555235,0.000036555237,0.000041036034],"category_scores_gemma":[0.000019357727,0.00012435648,0.00008072706,0.00038574307,0.00012801382,0.00019609334,0.00023759324,0.00011236464,0.000025512085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017262932,0.0002570722,0.0013578252,0.000035107365,0.00003108324,0.000008577894,0.0020486468,0.0028753497,0.0020098467,0.97837174,0.000070534436,0.012916937],"study_design_scores_gemma":[0.00015571502,0.000072561896,0.15516491,0.000011536589,0.000002134618,0.000023466207,0.0000021743942,0.6376622,0.0004536902,0.20621218,0.00012723845,0.00011224129],"about_ca_topic_score_codex":0.00002662429,"about_ca_topic_score_gemma":9.4963116e-7,"teacher_disagreement_score":0.7721596,"about_ca_system_score_codex":0.000013577658,"about_ca_system_score_gemma":0.000066604574,"threshold_uncertainty_score":0.507111},"labels":[],"label_agreement":null},{"id":"W2006893713","doi":"10.1142/s0217984901003093","title":"EFFICIENT ALGORITHM FOR INITIALIZING AMPLITUDE DISTRIBUTION OF A QUANTUM REGISTER","year":2001,"lang":"en","type":"article","venue":"Modern Physics Letters B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Initialization; Quantum algorithm; Quantum phase estimation algorithm; Quantum computer; Computer science; Algorithm; Quantum; Computation; Quantum error correction; Register (sociolinguistics); Physics; Quantum mechanics","score_opus":0.020245402576807285,"score_gpt":0.25065781517159663,"score_spread":0.23041241259478934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006893713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15969175,0.000033059954,0.83847404,0.001212794,0.0002583946,0.00018624046,0.000026466301,0.00010146101,0.000015800377],"genre_scores_gemma":[0.91896975,0.0000014545266,0.07981928,0.00078959024,0.00033865534,0.000021050962,0.000034363646,0.000018286875,0.0000075577664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986043,0.00004345318,0.00026973843,0.00041945593,0.0002837361,0.0003793281],"domain_scores_gemma":[0.99906886,0.00010945797,0.00017150913,0.0005016828,0.00008619872,0.0000622809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018908856,0.0001816383,0.00023709163,0.0000387047,0.0001557379,0.00009244239,0.00052753347,0.000039832372,3.5094754e-7],"category_scores_gemma":[0.000010565996,0.00017162385,0.0001729168,0.00025429047,0.000067379486,0.00007622749,0.0001735037,0.00013064341,0.000002763797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001510372,0.00026491762,0.000052481897,0.00005302331,0.000053858945,0.00002072218,0.0016085192,0.20423503,0.010607532,0.024473567,0.0006163682,0.7579989],"study_design_scores_gemma":[0.00040069726,0.00005185426,0.0002149945,0.000046060064,0.000009103114,0.000013835078,0.0000037400764,0.9870479,0.0011324786,0.010149259,0.0007287112,0.00020137246],"about_ca_topic_score_codex":0.000022272243,"about_ca_topic_score_gemma":2.0472835e-7,"teacher_disagreement_score":0.78281283,"about_ca_system_score_codex":0.00004093644,"about_ca_system_score_gemma":0.000024972984,"threshold_uncertainty_score":0.69986176},"labels":[],"label_agreement":null},{"id":"W2007025269","doi":"10.1117/12.583241","title":"Limitations of quantum process tomography","year":2005,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tomography; Process (computing); Computer science; Quantum process; Optical tomography; Quantum; Interferometry; Optics; Physics; Quantum mechanics","score_opus":0.016264905532567642,"score_gpt":0.23120987689269257,"score_spread":0.21494497136012491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007025269","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99082965,0.00014379415,0.0023781294,0.0047560297,0.00021776478,0.00035801434,0.000020831332,0.00013595863,0.0011598548],"genre_scores_gemma":[0.6837544,0.00005127494,0.31565344,0.000101187674,0.00031260808,0.0000543114,0.000002551479,0.0000300702,0.000040162773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976313,1.761518e-8,0.0007504772,0.00043400322,0.00078346865,0.00040071417],"domain_scores_gemma":[0.99717844,0.00025896516,0.00049940724,0.00009616023,0.0018439438,0.00012307502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005564135,0.00029253145,0.00039985083,0.00019062526,0.00010637081,0.000120743134,0.001959375,0.00014080876,0.0000025385873],"category_scores_gemma":[0.00045114345,0.00023990346,0.0006829564,0.0007690071,0.00022383605,0.0006685421,0.0002435789,0.00031994923,0.00000106411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024786808,0.00022691123,0.00020912042,0.00034715753,0.00028552098,6.3217165e-8,0.0009672235,0.0031529942,0.116671376,0.8724335,0.0011011638,0.004580221],"study_design_scores_gemma":[0.0008131709,0.00042310124,0.001147382,0.0003440037,0.000077484074,0.000022600265,0.00062740664,0.8794443,0.10508132,0.008092336,0.0035180552,0.0004088589],"about_ca_topic_score_codex":0.000004307435,"about_ca_topic_score_gemma":1.1978311e-7,"teacher_disagreement_score":0.8762913,"about_ca_system_score_codex":0.000051383457,"about_ca_system_score_gemma":0.00005127166,"threshold_uncertainty_score":0.9782979},"labels":[],"label_agreement":null},{"id":"W2007542733","doi":"10.1145/1219092.1219096","title":"The measurement calculus","year":2007,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":192,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Mitacs","keywords":"Quantum computer; Computer science; Theoretical computer science; Computation; Semantics (computer science); Operational semantics; Quantum information; Model of computation; Algebra over a field; Quantum; Algorithm; Programming language; Mathematics; Pure mathematics; Quantum mechanics","score_opus":0.019684467330251736,"score_gpt":0.24958123157068898,"score_spread":0.22989676424043726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007542733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30061078,0.002735866,0.5939498,0.09259576,0.008531728,0.0001497825,2.4171135e-7,0.000044733017,0.0013813301],"genre_scores_gemma":[0.9702111,0.000014372881,0.028383149,0.00072531204,0.0005904661,1.2435423e-7,3.4374654e-9,0.0000046210253,0.000070861366],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883515,0.000048081598,0.00023991951,0.000060664028,0.00063319056,0.00018299808],"domain_scores_gemma":[0.9984528,0.00016534099,0.00024241484,0.0009069949,0.00017671289,0.00005573079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00302167,0.000057173078,0.000072514056,0.000026676764,0.00030238074,0.000103894534,0.0042383717,0.000017432429,5.9450826e-7],"category_scores_gemma":[0.00069854833,0.000023060102,0.00013214479,0.0001844629,0.000032993365,0.000054359698,0.000766014,0.00027036172,0.000003311796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003957563,0.00008287586,0.0003670432,0.0000061810047,0.00011781541,0.00008019151,0.0019714355,0.005982604,0.0035412333,0.010190663,0.035592563,0.9420278],"study_design_scores_gemma":[0.0014820683,0.00058205356,0.079182446,0.000325368,0.000052914085,0.0023548563,0.00019702653,0.15409105,0.029221194,0.2255019,0.50654334,0.00046577805],"about_ca_topic_score_codex":0.0000032461137,"about_ca_topic_score_gemma":0.0000070633914,"teacher_disagreement_score":0.94156206,"about_ca_system_score_codex":0.000052766965,"about_ca_system_score_gemma":0.00007793046,"threshold_uncertainty_score":0.78760195},"labels":[],"label_agreement":null},{"id":"W2007579080","doi":"10.5539/cis.v4n3p125","title":"Grover Algorithm Applied to Four Qubits System","year":2011,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Qubit; Computer science; Hadamard transform; Algorithm; Focus (optics); Quantum gate; Context (archaeology); Quantum computer; Quantum; Quantum algorithm; Theoretical computer science; Quantum mechanics; Physics","score_opus":0.013372534318784862,"score_gpt":0.20149068004520973,"score_spread":0.18811814572642488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007579080","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013913969,0.0000053638064,0.97573847,0.000097439144,0.0008052106,0.00018346214,0.0000018108339,0.00028048508,0.008973768],"genre_scores_gemma":[0.49026388,0.0000011878641,0.50840235,0.0012418574,0.00007663885,0.000006391984,5.5164236e-7,0.0000024694784,0.0000046708537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856776,0.000013752935,0.00029537067,0.00030829315,0.00045845658,0.00035634442],"domain_scores_gemma":[0.9990164,0.000025482435,0.000096837175,0.0004197713,0.00017309634,0.00026838644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006084521,0.00014603417,0.00014266463,0.00039333626,0.00040271142,0.00053993455,0.0011390498,0.000032764077,0.0000020738328],"category_scores_gemma":[0.000009002767,0.00011950578,0.000027037708,0.001102674,0.00010932553,0.00336381,0.00084053766,0.00010371,0.00014950708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016311144,0.000007753175,0.000024152185,0.000016980035,0.0000024777971,0.0000018830654,0.005751811,0.00047578858,0.000027933953,0.09145601,0.00024377844,0.9019898],"study_design_scores_gemma":[0.00018299452,0.000092681075,0.01118438,0.000027476734,0.0000013027001,0.000095948104,0.00004916193,0.98347694,0.0003827269,0.00045755954,0.0038390257,0.0002097856],"about_ca_topic_score_codex":0.000013018019,"about_ca_topic_score_gemma":1.5163913e-7,"teacher_disagreement_score":0.9830012,"about_ca_system_score_codex":0.000035852732,"about_ca_system_score_gemma":0.000083526196,"threshold_uncertainty_score":0.5206601},"labels":[],"label_agreement":null},{"id":"W2008818484","doi":"10.1103/physrevlett.100.060503","title":"Thermally Assisted Adiabatic Quantum Computation","year":2008,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Adiabatic process; Adiabatic quantum computation; Computation; Scaling; Quantum computer; Quantum; Physics; Thermal; Ohmic contact; Statistical physics; A priori and a posteriori; Formalism (music); Quantum mechanics; Computer science; Mathematics; Algorithm; Thermodynamics","score_opus":0.02219589834565536,"score_gpt":0.27385121767234255,"score_spread":0.25165531932668717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008818484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55625206,0.0029183738,0.42089233,0.018774215,0.00027830387,0.00032379339,0.0000013496863,0.00035635452,0.00020321601],"genre_scores_gemma":[0.9596037,0.00040785212,0.013996848,0.025729327,0.00021963305,0.000015850532,0.000005434643,0.000015512895,0.000005825633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860007,0.0001644044,0.00023487813,0.00036365385,0.0003478756,0.00028912572],"domain_scores_gemma":[0.9991692,0.00019523199,0.00012562225,0.0003629003,0.000039854174,0.0001072136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014039081,0.00018344844,0.0003343548,0.000041257827,0.00017264289,0.00003928582,0.00057126087,0.000007778118,0.000003308095],"category_scores_gemma":[0.000038643004,0.00014334451,0.00019006223,0.00043714064,0.000070612325,0.00016304308,0.0001239546,0.0002112546,0.00015387674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011294447,0.0013498612,0.0005316794,0.002962074,0.00027739504,0.0008227832,0.003924644,0.04635717,0.040275104,0.021993062,0.060969967,0.820525],"study_design_scores_gemma":[0.00017268035,0.00006042039,0.012488493,0.00061701535,0.000016438804,0.00010939149,5.910873e-7,0.9831746,0.00005390939,0.00065086276,0.0023750097,0.00028054003],"about_ca_topic_score_codex":0.0000068195777,"about_ca_topic_score_gemma":1.3419117e-7,"teacher_disagreement_score":0.93681747,"about_ca_system_score_codex":0.000023063589,"about_ca_system_score_gemma":0.000033833803,"threshold_uncertainty_score":0.584542},"labels":[],"label_agreement":null},{"id":"W2009538436","doi":"10.1016/j.tcs.2008.12.046","title":"Parallelizing quantum circuits","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Engineering and Physical Sciences Research Council","keywords":"Rewriting; Computer science; Logarithm; Qubit; Electronic circuit; Polynomial; Quantum circuit; Quantum; Quantum computer; Constant (computer programming); Quantum algorithm; Algorithm; Translation (biology); Theoretical computer science; Mathematics; Quantum error correction; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.009636575686006338,"score_gpt":0.24534133830624205,"score_spread":0.2357047626202357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009538436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053939268,0.000056778175,0.93794644,0.0037717668,0.0007071348,0.00011357707,3.7479265e-7,0.0005709768,0.0028936737],"genre_scores_gemma":[0.8467134,0.0000029188973,0.15103543,0.001997127,0.00023977665,0.000001167706,2.8446755e-7,0.0000054310262,0.000004431004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969219,0.00009296808,0.00030865226,0.00094131066,0.0008306124,0.000904567],"domain_scores_gemma":[0.99819547,0.00016614776,0.00007477978,0.0010326912,0.00014535544,0.0003855341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012518443,0.0002447856,0.00024838044,0.00023748663,0.00068948214,0.0007272599,0.0035802566,0.000056051595,0.000013215638],"category_scores_gemma":[0.00007299381,0.00019590514,0.000097613774,0.0015210888,0.0011088668,0.00054493075,0.00065753126,0.0003328776,0.00009409816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.2597384e-7,0.000038411337,0.0000056818017,0.000001459553,0.0000012470529,0.000022480428,0.0002696155,0.0011259395,0.00056131155,0.755514,0.00004035947,0.24241856],"study_design_scores_gemma":[0.00012519209,0.00024838795,0.0014375504,0.000023246617,0.0000014321683,0.000091259855,0.0000014289471,0.688265,0.0007938901,0.30863032,0.00016518647,0.00021708308],"about_ca_topic_score_codex":0.0000013468267,"about_ca_topic_score_gemma":6.1809686e-8,"teacher_disagreement_score":0.7927742,"about_ca_system_score_codex":0.000042146537,"about_ca_system_score_gemma":0.00012773258,"threshold_uncertainty_score":0.798878},"labels":[],"label_agreement":null},{"id":"W2009773273","doi":"10.1103/physrevlett.95.250502","title":"Characterization of Complex Quantum Dynamics with a Scalable NMR Information Processor","year":2005,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Quantum decoherence; Scalability; Quantum computer; Computer science; Quantum; Computation; Quantum information; Dynamics (music); Quantum dynamics; Fidelity; Quantum information processing; Characterization (materials science); Statistical physics; Physics; Algorithm; Quantum mechanics","score_opus":0.00832754442713953,"score_gpt":0.23731122329683108,"score_spread":0.22898367886969154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009773273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4220935,0.00009982343,0.5610341,0.01627344,0.000025945483,0.00030831265,0.0000075472135,0.00009840192,0.000058917274],"genre_scores_gemma":[0.9723608,0.00014412793,0.014242288,0.013038341,0.00011548648,0.000020698722,0.000066425746,0.000009002364,0.0000028598313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990689,0.0000386537,0.0002554492,0.00016246819,0.00028757658,0.00018692047],"domain_scores_gemma":[0.99931324,0.000032210854,0.00024266029,0.00027699055,0.00008228682,0.00005261744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011146343,0.00013303958,0.00027092322,0.000046081324,0.000057687474,0.000053273605,0.00039645474,0.0000068625445,0.000002571668],"category_scores_gemma":[0.000014425338,0.000095968746,0.000060836268,0.00045242664,0.000043661872,0.0006933348,0.00007750145,0.00011352689,0.000028570968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029181605,0.00058750313,0.00025080476,0.0069874767,0.00010320106,0.000004512191,0.0022708979,0.022955019,0.05660867,0.056212723,0.0012835083,0.8527065],"study_design_scores_gemma":[0.00013482387,0.000058447786,0.0015148859,0.000685371,0.000013764499,0.0000072234125,0.0000010137858,0.99189776,0.00032905722,0.0000763639,0.0051432904,0.00013799236],"about_ca_topic_score_codex":0.0000040189952,"about_ca_topic_score_gemma":7.6876154e-7,"teacher_disagreement_score":0.96894276,"about_ca_system_score_codex":0.000025850877,"about_ca_system_score_gemma":0.00002631492,"threshold_uncertainty_score":0.3913492},"labels":[],"label_agreement":null},{"id":"W2010245486","doi":"10.1103/physrevlett.91.130602","title":"Quantum to Classical Transition for Random Walks","year":2003,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Quantum decoherence; Random walk; Heterogeneous random walk in one dimension; Limit (mathematics); Statistical physics; Position (finance); Physics; Quantum; Classical limit; Quadratic equation; Quantum mechanics; Variance (accounting); Mathematics; Quantum algorithm; Statistics; Mathematical analysis","score_opus":0.014023011007370672,"score_gpt":0.2750195781095247,"score_spread":0.260996567102154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010245486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026477037,0.00076691917,0.9122885,0.059428077,0.00024579448,0.0006281576,0.0000027936298,0.0001138358,0.000048926482],"genre_scores_gemma":[0.7548426,0.00024248319,0.08476136,0.15913835,0.00066903385,0.00028375394,0.000007987986,0.00004110365,0.000013344201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860513,0.000154577,0.00021517818,0.00043424193,0.00023710122,0.0003537804],"domain_scores_gemma":[0.9990714,0.00030587177,0.000049967515,0.00037268308,0.000035056644,0.0001649813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032183088,0.00017898633,0.0003863258,0.000036505608,0.000111592475,0.00006115636,0.00040527727,0.000009930484,0.0000026813807],"category_scores_gemma":[0.00011599051,0.00013849504,0.00029874177,0.0003000041,0.000027215892,0.00009700935,0.000032936096,0.00015593032,0.000054457214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009119351,0.0010472903,0.0000072203306,0.0033221906,0.00016464997,0.00005761848,0.0029593392,0.022211015,0.055923264,0.38447705,0.10682241,0.42291677],"study_design_scores_gemma":[0.0012951948,0.00026596195,0.0000614685,0.0011266608,0.000053519747,0.000024279181,0.0000023108223,0.7713526,0.0009992314,0.009129537,0.21512288,0.0005663536],"about_ca_topic_score_codex":0.0000013346613,"about_ca_topic_score_gemma":1.7422626e-7,"teacher_disagreement_score":0.8275271,"about_ca_system_score_codex":0.00002149602,"about_ca_system_score_gemma":0.000021369804,"threshold_uncertainty_score":0.5647664},"labels":[],"label_agreement":null},{"id":"W2010285959","doi":"10.1142/s0217979207043841","title":"CONTROL AND ERROR PREVENTION IN CONDENSED MATTER QUANTUM COMPUTING DEVICES","year":2007,"lang":"en","type":"article","venue":"International Journal of Modern Physics B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Qubit; Quantum computer; Computer science; Quantum error correction; Quantum decoherence; Scalability; Quantum; Noise (video); Quantum information; Encoding (memory); Theoretical computer science; Computer engineering; Topology (electrical circuits); Quantum mechanics; Physics; Mathematics; Artificial intelligence","score_opus":0.013206363832447368,"score_gpt":0.2858073635406156,"score_spread":0.2726009997081682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010285959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46169645,0.00007295526,0.53725135,0.00058612914,0.00032053582,0.000026457872,6.3146496e-7,0.0000066252987,0.000038882317],"genre_scores_gemma":[0.98520166,0.0000017420958,0.013959652,0.00046850144,0.00035283677,1.5625292e-7,5.7740044e-7,0.00000656928,0.000008292396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988287,0.00004939235,0.0004143907,0.00014764883,0.0003983711,0.0001614684],"domain_scores_gemma":[0.99907386,0.0001813492,0.0003754577,0.0000880433,0.00022571947,0.000055582776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006216504,0.000100466146,0.00016703331,0.00014322496,0.00003536171,0.00012431682,0.00052949076,0.000032369422,0.0000018391014],"category_scores_gemma":[0.000014780827,0.00008873079,0.00007301036,0.00008461795,0.000028666776,0.00030451675,0.00010492733,0.00023519344,0.0000032920113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023561373,0.0006265712,0.062924795,0.000038583792,0.00039381324,0.0005767119,0.005761723,0.08828099,0.010731329,0.028603816,0.0002238265,0.80160224],"study_design_scores_gemma":[0.0012777899,0.00006678421,0.052109748,0.00014208877,0.000005278045,0.00020120642,0.000018458608,0.8824146,0.00032797657,0.063260846,0.00006814795,0.000107112624],"about_ca_topic_score_codex":0.000009647335,"about_ca_topic_score_gemma":0.000006828429,"teacher_disagreement_score":0.80149513,"about_ca_system_score_codex":0.000037527785,"about_ca_system_score_gemma":0.000042690914,"threshold_uncertainty_score":0.36183366},"labels":[],"label_agreement":null},{"id":"W2010477552","doi":"10.1142/s0129626407003009","title":"PARALLELISM IN QUANTUM INFORMATION PROCESSING DEFEATS THE UNIVERSAL COMPUTER","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Parallelism (grammar); Quantum computer; Perspective (graphical); Information processing; Theoretical computer science; Quantum; Universal Turing machine; Parallel computing; Turing machine; Algorithm; Artificial intelligence; Computation","score_opus":0.00850951637500192,"score_gpt":0.22495644328008732,"score_spread":0.2164469269050854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010477552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15024169,0.00019563845,0.8405007,0.008142739,0.00025592567,0.00018471805,3.592323e-7,0.00025099525,0.00022722525],"genre_scores_gemma":[0.88358253,0.000004192146,0.10963598,0.0065208813,0.00022277501,0.000005849574,0.0000049783794,0.00001381634,0.00000900925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789166,0.00007809378,0.0004884999,0.00037826897,0.00045893327,0.00070452795],"domain_scores_gemma":[0.9990908,0.000117669086,0.00025910832,0.0003546879,0.000077973906,0.000099787496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000966819,0.00027061906,0.0002170316,0.00030013986,0.00047383262,0.0006463898,0.0011741929,0.0000855207,0.0000014774431],"category_scores_gemma":[0.000019528889,0.00019980433,0.000074075935,0.0008582677,0.00013411618,0.0014424032,0.00026276163,0.0005111596,0.00002786446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038077746,0.00006347482,0.0011403938,0.00012461316,0.000011992595,0.000091021604,0.014123747,0.23681223,0.00021628133,0.002508417,0.0010914023,0.74377835],"study_design_scores_gemma":[0.0005776952,0.000031539617,0.01167304,0.00013584956,0.000004303243,0.000070295144,0.000098405115,0.9820736,0.00002912931,0.00066241913,0.0043259487,0.00031777678],"about_ca_topic_score_codex":0.000054820957,"about_ca_topic_score_gemma":0.000012652051,"teacher_disagreement_score":0.7452614,"about_ca_system_score_codex":0.00008625721,"about_ca_system_score_gemma":0.00010424464,"threshold_uncertainty_score":0.8147784},"labels":[],"label_agreement":null},{"id":"W2010516078","doi":"10.1139/p07-192","title":"Symmetrization methods for characterization and benchmarking of quantum processes","year":2008,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symmetrization; Physics; Characterization (materials science); Quantum; Process (computing); Benchmarking; Quantum process; Quantum algorithm; Quantum information; Theoretical physics; Statistical physics; Applied mathematics; Quantum mechanics; Computer science; Quantum dynamics; Mathematics; Mathematical analysis","score_opus":0.021657864644508612,"score_gpt":0.26667622884786946,"score_spread":0.24501836420336084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010516078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12280878,0.00016830179,0.876603,0.00012535191,0.00023352036,0.000048796337,0.0000042126903,0.0000034396405,0.0000046095665],"genre_scores_gemma":[0.7664087,0.00002786271,0.23324794,0.00005251249,0.00024931607,5.8818966e-7,0.000003270505,0.000005996223,0.0000038044243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994849,0.000036348825,0.0002034237,0.00008483861,0.00006914644,0.00012134377],"domain_scores_gemma":[0.99903,0.00012488446,0.00028518503,0.00007717922,0.00035169692,0.00013107975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002220849,0.000063061234,0.0001462621,0.000099478435,0.00013541241,0.00003398766,0.00019796393,0.000024681207,4.1136047e-7],"category_scores_gemma":[0.00013520583,0.000057253827,0.000035236102,0.0004158773,0.000041477953,0.000222817,0.0000116446345,0.00006805588,4.8437105e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034756026,0.000016061833,0.0015082031,0.00013771458,0.000027278349,0.000007430648,0.0031592795,0.0017339236,0.0046360395,0.01577947,0.000032928856,0.9729582],"study_design_scores_gemma":[0.0004101787,0.0004057898,0.0097605465,0.00019558004,0.000018974915,0.00021078692,0.000019394187,0.95708466,0.018036423,0.010400872,0.0032615934,0.00019521487],"about_ca_topic_score_codex":0.00006318356,"about_ca_topic_score_gemma":0.000017228296,"teacher_disagreement_score":0.972763,"about_ca_system_score_codex":0.000015529366,"about_ca_system_score_gemma":0.0005594224,"threshold_uncertainty_score":0.23347433},"labels":[],"label_agreement":null},{"id":"W2011867118","doi":"10.1103/physrevlett.111.090505","title":"Universal Fault-Tolerant Quantum Computation with Only Transversal Gates and Error Correction","year":2013,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":246,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Toffoli gate; Transversal (combinatorics); Computer science; Computation; Universal set; Quantum computer; Hadamard transform; Quantum gate; Algorithm; Distillation; Fault tolerance; Quantum; Topology (electrical circuits); Mathematics; Physics; Set (abstract data type); Quantum mechanics; Distributed computing; Combinatorics","score_opus":0.008161193896018822,"score_gpt":0.2396112284001056,"score_spread":0.23145003450408677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011867118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65102196,0.0005486482,0.33130956,0.016350068,0.0002063715,0.000366196,9.20294e-7,0.00016624121,0.000030051375],"genre_scores_gemma":[0.9891102,0.00013921603,0.0060686814,0.004544965,0.00010163422,0.000010660268,0.0000050721073,0.0000136333765,0.0000059785425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884224,0.00010481176,0.0001577315,0.00039145202,0.0002494895,0.0002542657],"domain_scores_gemma":[0.99941117,0.00014343909,0.0000930417,0.00018681005,0.000051869178,0.00011364505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008093527,0.00019736894,0.00029312554,0.000044835273,0.0001281888,0.00011186149,0.00024303814,0.00001031536,0.000003476019],"category_scores_gemma":[0.000008127258,0.00014210939,0.00007554303,0.0002988591,0.00009053202,0.00035044766,0.00005279671,0.0002175314,0.000036483292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039979084,0.0005722421,0.00057446165,0.0018346,0.00022621898,0.0001079676,0.005852308,0.07905613,0.011110759,0.008123595,0.019638833,0.8728629],"study_design_scores_gemma":[0.00026519012,0.00016002906,0.0026793997,0.0006606619,0.000025500956,0.00005408753,0.000017629814,0.9948489,0.000043469343,0.00022482831,0.0007959535,0.0002243488],"about_ca_topic_score_codex":0.000108037595,"about_ca_topic_score_gemma":0.0000022555246,"teacher_disagreement_score":0.91579276,"about_ca_system_score_codex":0.000023216553,"about_ca_system_score_gemma":0.0000270359,"threshold_uncertainty_score":0.57950526},"labels":[],"label_agreement":null},{"id":"W2012700932","doi":"10.1103/physreva.85.022317","title":"Efficient decoding of topological color codes","year":2012,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Topology (electrical circuits); Computer science; Algorithm; Mathematics; Combinatorics","score_opus":0.021727259778480057,"score_gpt":0.31456784734543686,"score_spread":0.2928405875669568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012700932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8826797,0.016985085,0.09769843,0.0013931482,0.00021081396,0.00020608389,0.0000012142102,0.00009620718,0.0007293238],"genre_scores_gemma":[0.98157567,0.00019819995,0.017597858,0.00046559118,0.00014687076,0.0000068903473,2.5678668e-7,0.000003138115,0.000005496602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915445,0.00008337678,0.00016382057,0.00015643449,0.00018522875,0.00025671016],"domain_scores_gemma":[0.99929076,0.0002378681,0.00008232899,0.0002570522,0.00003142949,0.000100554746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002956428,0.0000936831,0.00029626684,0.000016547165,0.00004925334,0.00001066265,0.00038935014,0.000012971108,0.000005787804],"category_scores_gemma":[0.00012817376,0.00006117242,0.00013107137,0.0002484487,0.000050407674,0.000030602132,0.00023367556,0.000105632505,0.000029783041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039559777,0.0014743597,0.0012688333,0.0013955216,0.000040425617,0.0000063473167,0.0010467493,0.0030798884,0.003274226,0.68185884,0.00087948306,0.3056714],"study_design_scores_gemma":[0.00017848503,0.0002149287,0.0072587645,0.0012826193,0.000036217945,0.000028379014,0.0000051870406,0.9757189,0.0030017106,0.0051793903,0.006771038,0.00032435532],"about_ca_topic_score_codex":0.000002403975,"about_ca_topic_score_gemma":5.300102e-8,"teacher_disagreement_score":0.972639,"about_ca_system_score_codex":0.000009905457,"about_ca_system_score_gemma":0.000013348683,"threshold_uncertainty_score":0.24945387},"labels":[],"label_agreement":null},{"id":"W2013303566","doi":"10.1109/ised.2012.81","title":"Recent Developments on Mapping Reversible Circuits to Quantum Gate Libraries","year":2012,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Toffoli gate; Quantum circuit; Quantum gate; Electronic circuit; Benchmark (surveying); Computer science; Logic gate; Quantum; Controlled NOT gate; Quantum computer; Polarity (international relations); Electronic engineering; Algorithm; Computer engineering; Quantum error correction; Physics; Electrical engineering; Engineering; Quantum mechanics","score_opus":0.03277704203951341,"score_gpt":0.2388214343148048,"score_spread":0.20604439227529137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013303566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19702624,0.00036667797,0.76435983,0.008726053,0.0032284218,0.00037408434,0.000001937435,0.00090752536,0.025009248],"genre_scores_gemma":[0.69963264,0.000043784585,0.2893108,0.008218335,0.00035932366,0.000013059321,0.0000035289581,0.000026478121,0.0023920408],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998473,0.000054104104,0.00020489334,0.00034755692,0.00030541018,0.00061506685],"domain_scores_gemma":[0.99911845,0.000085147425,0.00005157867,0.00040765147,0.000041331492,0.00029583203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032027712,0.00017547139,0.00015342353,0.000191001,0.00024586957,0.00019816594,0.00072736276,0.000046172696,0.000034779703],"category_scores_gemma":[0.000053328567,0.00014505506,0.00003827957,0.00071077835,0.000014750943,0.00040806903,0.00049652613,0.00015441475,0.00052971276],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044279545,0.00015744418,0.0015845668,0.00002130805,0.00003551929,0.0000117816335,0.0064186277,0.0011919084,0.00048948976,0.13488132,0.023130605,0.832073],"study_design_scores_gemma":[0.00045559506,0.00019642679,0.033313695,0.0002278851,0.0000037428479,0.0000447689,0.00013755311,0.06887247,0.008725036,0.0054652425,0.8816047,0.00095288816],"about_ca_topic_score_codex":0.0000056446765,"about_ca_topic_score_gemma":3.9906277e-7,"teacher_disagreement_score":0.8584741,"about_ca_system_score_codex":0.00004239997,"about_ca_system_score_gemma":0.000071954826,"threshold_uncertainty_score":0.6808563},"labels":[],"label_agreement":null},{"id":"W2013483959","doi":"10.1088/1367-2630/15/9/093041","title":"Floating point representations in quantum circuit synthesis","year":2013,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Computation; Quantum computer; Quantum; Quantum circuit; Topology (electrical circuits); Construct (python library); Electronic circuit","score_opus":0.020066487341679068,"score_gpt":0.24979716338463534,"score_spread":0.22973067604295627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013483959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25719014,0.00007441298,0.7397191,0.0021556092,0.0003569238,0.000065819346,3.192278e-7,0.000024393514,0.0004132816],"genre_scores_gemma":[0.94023836,0.000006281993,0.059054017,0.00013329524,0.00053510274,8.1165314e-7,9.625663e-8,0.000008143766,0.000023910363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989385,0.000076135526,0.00037315165,0.0001391251,0.00027554977,0.0001975643],"domain_scores_gemma":[0.99891776,0.00031725154,0.00029193418,0.00024428405,0.0001183527,0.00011043698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002305348,0.00009464719,0.00019088184,0.000096064075,0.0000659092,0.00015147132,0.0005821221,0.000026087182,0.000014226072],"category_scores_gemma":[0.00014700386,0.00007947556,0.00010784217,0.00039008734,0.000017159387,0.0005210684,0.00009612315,0.00028902612,0.000023214681],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019122517,0.00013291139,0.0010718826,0.000014304808,0.000033433942,0.00004602115,0.0039276686,0.059226487,0.0073627187,0.029979335,0.0030547434,0.8951486],"study_design_scores_gemma":[0.0003827836,0.00009458024,0.009494698,0.00020613086,0.000008789934,0.00012588271,0.00016256137,0.7362633,0.0070973984,0.24582279,0.00014814301,0.00019298536],"about_ca_topic_score_codex":0.00017252075,"about_ca_topic_score_gemma":0.0000021416495,"teacher_disagreement_score":0.8949556,"about_ca_system_score_codex":0.000029416422,"about_ca_system_score_gemma":0.00012729422,"threshold_uncertainty_score":0.32409194},"labels":[],"label_agreement":null},{"id":"W2013557783","doi":"10.1007/s00220-008-0438-0","title":"On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers","year":2008,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Potts model; Partition function (quantum field theory); Exponential function; Discrete mathematics; Combinatorics; Partition (number theory); Quantum; Polynomial; Frequency partition of a graph; Graph; Ising model; Line graph; Quantum mechanics; Graph power","score_opus":0.06980303628868849,"score_gpt":0.2985053218965596,"score_spread":0.2287022856078711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013557783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4726669,0.00016600944,0.5221874,0.0029508532,0.000117524,0.00045388422,0.0000051871452,0.00003468565,0.0014175291],"genre_scores_gemma":[0.99385595,0.000019201929,0.005970634,0.0001054218,0.000010451664,0.000025391142,0.0000034345967,0.000005219263,0.000004274242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998347,0.00057881343,0.00034175633,0.00013231729,0.0004905155,0.00010959594],"domain_scores_gemma":[0.9966753,0.0012510634,0.00024304526,0.001669232,0.00014451164,0.000016846368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008696684,0.000094085306,0.00015464735,0.00003029423,0.00023408957,0.000015417314,0.0014905811,0.00003240442,0.0000038741446],"category_scores_gemma":[0.00020597744,0.00005673575,0.000076495504,0.0005611237,0.00032857741,0.00009680388,0.0003119163,0.00022873237,0.00000415037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031711338,0.0004927223,0.00007707442,0.000021629046,0.000014721231,4.3337696e-8,0.0017650424,0.015597865,0.00030508122,0.96491826,0.0005587578,0.016245617],"study_design_scores_gemma":[0.00010299178,0.000028559292,0.00088057097,0.00008898833,0.000006474605,8.757456e-7,0.000030171352,0.6000766,0.00040181886,0.3983167,0.00002685283,0.000039380462],"about_ca_topic_score_codex":0.0000070303176,"about_ca_topic_score_gemma":0.0000024225985,"teacher_disagreement_score":0.58447874,"about_ca_system_score_codex":0.00003590128,"about_ca_system_score_gemma":0.000062511695,"threshold_uncertainty_score":0.27698952},"labels":[],"label_agreement":null},{"id":"W2014440506","doi":"10.1088/1367-2630/4/1/401","title":"Comment on `Quantum optimization for combinatorial searches'","year":2002,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Physics; Quantum; Function (biology); State (computer science); Algorithm; Statistical physics; Quantum mechanics; Computer science","score_opus":0.030236278193640366,"score_gpt":0.25754521676790665,"score_spread":0.2273089385742663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014440506","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019926648,0.000058067722,0.98571134,0.0105929775,0.0014447607,0.00008756118,0.0000011783617,0.000021729338,0.000089718684],"genre_scores_gemma":[0.49201217,0.000058393183,0.4982412,0.0038467813,0.0057373224,0.0000021380818,0.0000021267072,0.000036426678,0.00006344992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990826,0.000049973598,0.0002274483,0.00011860536,0.00033856288,0.00018277584],"domain_scores_gemma":[0.999123,0.00019797978,0.00022444242,0.0001849612,0.00014790692,0.00012170675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022307687,0.00010172053,0.0001700706,0.0000403074,0.000113732196,0.00010510235,0.0005146284,0.00003226357,0.0000066165708],"category_scores_gemma":[0.00003757782,0.000083194136,0.00012905734,0.0001783496,0.000015443507,0.00015768713,0.00005865825,0.00022626763,0.0000045479915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025592652,0.00036804398,0.0000067955552,0.000013689915,0.000040902396,0.000008496862,0.00083130476,0.48095512,0.000059609112,0.20560141,0.058615573,0.25347346],"study_design_scores_gemma":[0.0011538563,0.00086547004,0.0000058422056,0.00004416264,0.000006233685,0.000011682942,0.0000046031164,0.9404874,0.0008980685,0.04425089,0.0121833235,0.00008847664],"about_ca_topic_score_codex":0.0000015990612,"about_ca_topic_score_gemma":2.4680006e-8,"teacher_disagreement_score":0.4900195,"about_ca_system_score_codex":0.000037146485,"about_ca_system_score_gemma":0.000042890828,"threshold_uncertainty_score":0.33925584},"labels":[],"label_agreement":null},{"id":"W2015031340","doi":"10.1103/physreva.72.022307","title":"Entanglement of zero-angular-momentum mixtures and black-hole entropy","year":2005,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum entanglement; Squashed entanglement; Multipartite entanglement; Quantum mechanics; Physics; Hilbert space; Mathematical physics; Quantum","score_opus":0.007803164801917152,"score_gpt":0.2693711674080004,"score_spread":0.2615680026060832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015031340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74304944,0.07877497,0.14896977,0.026237234,0.0002635538,0.0012206355,0.000012652979,0.00026087675,0.0012108837],"genre_scores_gemma":[0.9795095,0.0027603882,0.015679218,0.0017519413,0.00023603103,0.000011039957,0.0000019183767,0.000009029715,0.000040982854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989607,0.00006380935,0.00021440249,0.00028275032,0.00026696597,0.00021141744],"domain_scores_gemma":[0.99935454,0.000062819614,0.00010563249,0.0003493585,0.000033766762,0.00009390275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014539286,0.00013726513,0.0003100763,0.000026374193,0.00004149187,0.000028601733,0.00036854987,0.000011699513,0.0000080351165],"category_scores_gemma":[0.000024609177,0.000100773694,0.00011342164,0.00018406023,0.000059978192,0.000081740465,0.00026336187,0.00010743558,0.000020545232],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053294134,0.0008319049,0.00011668328,0.0015929221,0.00009511968,0.000013352054,0.0015859222,0.0010039177,0.011218315,0.13388103,0.0118919285,0.83776355],"study_design_scores_gemma":[0.001093594,0.00068219576,0.0014452325,0.003035795,0.00012706373,0.000017723196,0.000008966683,0.651361,0.03268818,0.03822536,0.27052206,0.0007928209],"about_ca_topic_score_codex":0.0000036933172,"about_ca_topic_score_gemma":3.3802104e-7,"teacher_disagreement_score":0.83697075,"about_ca_system_score_codex":0.000013984851,"about_ca_system_score_gemma":0.00001579358,"threshold_uncertainty_score":0.4109432},"labels":[],"label_agreement":null},{"id":"W2015425815","doi":"10.1103/physreva.85.032303","title":"Algorithmic approach to adiabatic quantum optimization","year":2012,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Maxima and minima; Hamiltonian (control theory); Adiabatic process; Degenerate energy levels; Adiabatic quantum computation; Qubit; Quantum; Eigenvalues and eigenvectors; Physics; Quantum phase estimation algorithm; Statistical physics; Quantum mechanics; Mathematics; Quantum computer; Mathematical optimization; Quantum error correction; Mathematical analysis","score_opus":0.016170864677439563,"score_gpt":0.27873707584626645,"score_spread":0.2625662111688269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015425815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019544535,0.0063979807,0.9885559,0.0009821943,0.00020316015,0.000402112,9.031153e-7,0.00016891545,0.0013343453],"genre_scores_gemma":[0.40061516,0.0006305806,0.59249556,0.004896296,0.0011536544,0.00013013351,0.0000077128225,0.000031238284,0.000039663748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987046,0.000107895925,0.00018685746,0.0003035108,0.00027725616,0.00041984578],"domain_scores_gemma":[0.99903905,0.00007975188,0.00006640335,0.00049123104,0.000043140957,0.0002804421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029411944,0.00016806992,0.00030768377,0.000046295587,0.000086676475,0.000053204993,0.000599788,0.000016523756,0.0000031408488],"category_scores_gemma":[0.00009707672,0.00012851885,0.00012283548,0.0006862592,0.000016281308,0.00023613762,0.0002315535,0.00015340217,0.00015614081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023721548,0.001763178,0.000060969975,0.0018108553,0.0000588686,0.0000028701513,0.002548736,0.13934606,0.0001542436,0.24644628,0.006343404,0.6014622],"study_design_scores_gemma":[0.000056602257,0.000042658023,0.00015868236,0.00030288403,0.000014282868,0.000012197686,0.0000015382716,0.9928434,0.000028522245,0.0010407296,0.0053036893,0.00019481174],"about_ca_topic_score_codex":0.0000039336614,"about_ca_topic_score_gemma":1.5358797e-8,"teacher_disagreement_score":0.8534973,"about_ca_system_score_codex":0.00002351003,"about_ca_system_score_gemma":0.000023863213,"threshold_uncertainty_score":0.5240847},"labels":[],"label_agreement":null},{"id":"W2015478570","doi":"10.1109/isit.2009.5205591","title":"The capacity of quantum channels with side information at the transmitter","year":2009,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Transmitter; Classical capacity; Quantum entanglement; Parallels; Quantum capacity; Quantum channel; Computer science; Quantum; Amplitude damping channel; Channel capacity; Superdense coding; Coding (social sciences); Upper and lower bounds; Topology (electrical circuits); Quantum network; Quantum mechanics; Physics; Computer network; Mathematics; Engineering; Channel (broadcasting); Combinatorics; Statistics","score_opus":0.010824514615467573,"score_gpt":0.20726354846581044,"score_spread":0.19643903385034286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015478570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11813049,0.000096717966,0.8664823,0.013003443,0.0005188174,0.00038639875,0.0000062979393,0.00012315756,0.001252384],"genre_scores_gemma":[0.98038733,0.000043741406,0.017694904,0.0014846356,0.00015315469,0.000020863785,0.000007566967,0.00000944368,0.00019837059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847364,0.00012450754,0.00037645962,0.00025751232,0.00047339464,0.00029450495],"domain_scores_gemma":[0.9982054,0.00022737157,0.00030783683,0.0010777229,0.00013279887,0.000048841852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006031431,0.00024570664,0.00022670938,0.000056910452,0.00038919513,0.0003258754,0.0016724718,0.00011241844,0.0000033939978],"category_scores_gemma":[0.000014047091,0.0001017157,0.0001373022,0.00017928355,0.00016161748,0.00016028658,0.00062183506,0.0005910645,0.000011604738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006145322,0.00007297601,0.00006105343,0.00021269677,0.00018983037,0.000005811884,0.018152872,0.44995746,0.00006651102,0.098276496,0.0043478613,0.42859498],"study_design_scores_gemma":[0.00016544772,0.000116883704,0.0014561677,0.00010500227,0.0000112209245,0.000035598816,0.000030516378,0.9653078,0.0014617674,0.023599163,0.007482002,0.0002284813],"about_ca_topic_score_codex":0.00017873797,"about_ca_topic_score_gemma":0.00005581495,"teacher_disagreement_score":0.8622568,"about_ca_system_score_codex":0.00002953263,"about_ca_system_score_gemma":0.00008932947,"threshold_uncertainty_score":0.41478458},"labels":[],"label_agreement":null},{"id":"W2015617570","doi":"10.1103/physrevlett.91.217904","title":"Magnetic Resonance Realization of Decoherence-Free Quantum Computation","year":2003,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum decoherence; Quantum computer; Quantum error correction; Qubit; Realization (probability); Physics; Quantum mechanics; Computer science; Decoherence-free subspaces; Quantum; Mathematics","score_opus":0.012975376172582095,"score_gpt":0.2668729909009201,"score_spread":0.253897614728338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015617570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07284595,0.021790193,0.90068924,0.0034666823,0.00025261543,0.00041101413,0.0000034974967,0.00013017177,0.000410606],"genre_scores_gemma":[0.93285763,0.0024111534,0.05472357,0.009804463,0.00012901319,0.000030482735,0.000007365579,0.000026122632,0.00001018855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866354,0.00021356498,0.0002828112,0.0003210607,0.0003115486,0.00020744617],"domain_scores_gemma":[0.99905103,0.00015961714,0.00015533187,0.00051188015,0.00006257778,0.000059577436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023302891,0.00014112842,0.00029338608,0.000039199847,0.000057416673,0.000027835207,0.0005613219,0.000008580316,0.000004003911],"category_scores_gemma":[0.00016707851,0.000119487515,0.00010754198,0.00056421437,0.000056297828,0.000114289905,0.000088331035,0.00011465626,0.000014555352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005061733,0.000382353,0.0004088146,0.0018885608,0.000019539966,0.000022173921,0.00074384053,0.014007662,0.0057350667,0.4366396,0.019241717,0.5209056],"study_design_scores_gemma":[0.00045728392,0.00022139096,0.0034919733,0.0021316253,0.000029512874,0.000020752852,0.0000022743798,0.9275983,0.00059877336,0.050152678,0.014886937,0.00040848466],"about_ca_topic_score_codex":0.000009692952,"about_ca_topic_score_gemma":5.511395e-7,"teacher_disagreement_score":0.91359067,"about_ca_system_score_codex":0.000015439997,"about_ca_system_score_gemma":0.000028786242,"threshold_uncertainty_score":0.48725593},"labels":[],"label_agreement":null},{"id":"W2015872312","doi":"10.1088/0953-2048/23/10/105014","title":"A scalable readout system for a superconducting adiabatic quantum optimization system","year":2010,"lang":"en","type":"article","venue":"Superconductor Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Qubit; Physics; Adiabatic process; Flux qubit; Quantum; Squid; Quantum computer; Topology (electrical circuits); Sensitivity (control systems); Superconductivity; Quantum mechanics; Electronic engineering; Electrical engineering; Engineering","score_opus":0.009845886116385396,"score_gpt":0.22830287117756215,"score_spread":0.21845698506117675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015872312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8943532,0.00011276054,0.10018484,0.0014678577,0.0020093184,0.00049023,0.0000063815182,0.0012230249,0.00015240147],"genre_scores_gemma":[0.7915427,0.0000018504668,0.20822696,0.000038422284,0.00010309785,0.000056101944,0.0000013260662,0.000015135981,0.000014372626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744046,0.00002803584,0.00036301455,0.0010199954,0.000375118,0.0007733871],"domain_scores_gemma":[0.9980681,0.00012021822,0.00009096631,0.0008983218,0.00063515396,0.00018723418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014013905,0.0002500891,0.0003432433,0.0008955625,0.0010728884,0.00043415063,0.0015924175,0.00023410839,0.0000025077118],"category_scores_gemma":[0.00052878144,0.00021031272,0.000046598907,0.002387123,0.0008711639,0.0011206082,0.00047102114,0.00042794898,0.000008844934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023879295,0.000036584534,0.00039058577,0.00024473248,0.00001331117,0.000015285863,0.0007247431,0.00028737573,0.3921761,0.58961684,0.000031796706,0.016460285],"study_design_scores_gemma":[0.00037866304,0.00017557581,0.000018174836,0.00010022965,0.000011839309,0.000750387,0.00215309,0.9604919,0.034099173,0.0009784967,0.0005120782,0.0003303981],"about_ca_topic_score_codex":0.000059596197,"about_ca_topic_score_gemma":0.000010426508,"teacher_disagreement_score":0.96020454,"about_ca_system_score_codex":0.00009090427,"about_ca_system_score_gemma":0.00044873552,"threshold_uncertainty_score":0.8576304},"labels":[],"label_agreement":null},{"id":"W2016124611","doi":"10.1088/1367-2630/14/11/113011","title":"Negative quasi-probability as a resource for quantum computation","year":2012,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":337,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum computer; Quantum; Quantum algorithm; Quantum information; Quantum operation; Computation; Quantum network; Quantum capacity; Quantum state","score_opus":0.026406451686014257,"score_gpt":0.281672929530877,"score_spread":0.2552664778448628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016124611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12890732,0.00012611182,0.8693786,0.0008626588,0.0004936658,0.00011204014,0.000001276031,0.000028504901,0.00008977209],"genre_scores_gemma":[0.74032825,0.0000015644283,0.2577247,0.00024478266,0.0016675624,8.454608e-7,7.1320324e-7,0.0000103038865,0.000021307307],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988053,0.00010456316,0.000337042,0.00014289656,0.00032065526,0.0002895301],"domain_scores_gemma":[0.99847394,0.00046316057,0.0004505884,0.00018773264,0.00021077933,0.00021379621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057547976,0.00013300234,0.00023942358,0.000046908426,0.00013126276,0.00008216773,0.0004649169,0.000041113268,0.0000012960896],"category_scores_gemma":[0.00014858457,0.00010771271,0.00019058448,0.00026079532,0.000035514797,0.00045033917,0.00009009448,0.00024997158,0.0000063066714],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008072225,0.00056255143,0.0003202329,0.00004996377,0.000086372806,0.0000039859,0.0105125345,0.033649415,0.000599553,0.11328809,0.006787081,0.8340595],"study_design_scores_gemma":[0.0010823052,0.00096655346,0.0012891259,0.00008128679,0.000025965628,0.00010835095,0.000091748414,0.45616385,0.003143431,0.53187525,0.0049437294,0.00022839276],"about_ca_topic_score_codex":0.000013534622,"about_ca_topic_score_gemma":3.8528555e-7,"teacher_disagreement_score":0.83383113,"about_ca_system_score_codex":0.000046482277,"about_ca_system_score_gemma":0.00017032339,"threshold_uncertainty_score":0.43923968},"labels":[],"label_agreement":null},{"id":"W2016655820","doi":"10.1007/s11128-007-0052-7","title":"A Characterization of Global Entanglement","year":2007,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; D-Wave Systems (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum entanglement; Measure (data warehouse); Qubit; Quantum mechanics; Squashed entanglement; Quantum computer; Cluster state; Observable; Physics; Multipartite entanglement; W state; Ground state; State (computer science); Quantum; Mathematics; Computer science; Algorithm","score_opus":0.0069024652132219115,"score_gpt":0.2413535242086588,"score_spread":0.2344510589954369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016655820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34951827,0.0000113768665,0.64952195,0.00013763561,0.00013995953,0.00006190981,0.0000027458161,0.00009430092,0.0005118442],"genre_scores_gemma":[0.9778844,0.0000012495175,0.021787783,0.00026988387,0.00003447378,0.0000014705073,0.000016360465,0.0000020427397,0.0000023032553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989272,0.000011235916,0.00046396133,0.00009380127,0.00030085436,0.00020298865],"domain_scores_gemma":[0.99927205,0.000012432379,0.00035055896,0.00015481196,0.00015808769,0.000052056883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045663427,0.00009099496,0.00009978949,0.00008126581,0.000116667885,0.0001325602,0.00031274898,0.000037856884,0.000003243827],"category_scores_gemma":[0.00002025233,0.00008172309,0.00003269593,0.000572376,0.000022117652,0.0015668945,0.00009287105,0.0000612495,0.00001182398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000968277,0.000034616452,0.0009193167,0.000119077224,0.0000052879236,0.0000012881653,0.002529289,0.0002367404,0.0037667505,0.06141187,0.000011958358,0.9309541],"study_design_scores_gemma":[0.00036026104,0.0000890793,0.028127922,0.000112454894,0.0000039047377,0.00003449836,0.00013600153,0.9530048,0.01166551,0.0029568737,0.0033084382,0.00020028683],"about_ca_topic_score_codex":0.000005337269,"about_ca_topic_score_gemma":7.806473e-7,"teacher_disagreement_score":0.952768,"about_ca_system_score_codex":0.00004835445,"about_ca_system_score_gemma":0.0000763496,"threshold_uncertainty_score":0.3332571},"labels":[],"label_agreement":null},{"id":"W2016786072","doi":"10.1103/physrevlett.105.200501","title":"Tensor Rank and Stochastic Entanglement Catalysis for Multipartite Pure States","year":2010,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Multipartite; Rank (graph theory); Generalization; Tensor (intrinsic definition); Quantum entanglement; Multipartite entanglement; Combinatorics; State (computer science); Bipartite graph; Mathematics; LOCC; Physics; Quantum mechanics; Pure mathematics; Squashed entanglement; Algorithm; Quantum; Mathematical analysis","score_opus":0.00859558228430386,"score_gpt":0.2679450050991942,"score_spread":0.2593494228148904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016786072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5296171,0.0017973231,0.43372092,0.03373022,0.00026041694,0.00073855545,0.000015605814,0.0001170915,0.0000028097825],"genre_scores_gemma":[0.9327609,0.00027990242,0.045088354,0.021113561,0.00051046006,0.00018633295,0.00002636667,0.000025466263,0.000008654384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989161,0.00003256372,0.00018131964,0.00039557036,0.00018616753,0.00028826724],"domain_scores_gemma":[0.99911386,0.00026693317,0.00008475287,0.00037825954,0.000037188263,0.00011903576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019057094,0.00016881178,0.00030452575,0.00003178268,0.000117824406,0.00008076306,0.0003722748,0.000007664161,0.0000026098642],"category_scores_gemma":[0.00006989296,0.00012384256,0.00014210782,0.00016380704,0.00006117081,0.00009769542,0.00014529475,0.00019092909,0.000012219601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018976276,0.0006905366,0.000282291,0.0034501995,0.0003396919,0.00003161267,0.0031386889,0.013640645,0.124851406,0.008985958,0.018007107,0.8265629],"study_design_scores_gemma":[0.0003887083,0.00006539288,0.0003429081,0.00032933083,0.00007819647,0.000011090151,0.0000026290047,0.98528564,0.00039957318,0.0010619399,0.011736602,0.00029800177],"about_ca_topic_score_codex":0.0000065571844,"about_ca_topic_score_gemma":0.0000023403388,"teacher_disagreement_score":0.971645,"about_ca_system_score_codex":0.0000074347226,"about_ca_system_score_gemma":0.00000929586,"threshold_uncertainty_score":0.5050153},"labels":[],"label_agreement":null},{"id":"W2017269195","doi":"10.1088/1742-6596/400/5/052038","title":"Method to produce an uniform magnetic field in a dilution refrigerator","year":2012,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Solenoid; Magnetic field; Electromagnetic coil; Dilution refrigerator; Helmholtz coil; Helmholtz free energy; Field (mathematics); Volume (thermodynamics); Superconductivity; Physics; Mechanics; Electrical engineering; Mechanical engineering; Refrigerator car; Materials science; Condensed matter physics; Thermodynamics; Engineering; Mathematics; Quantum mechanics","score_opus":0.018813740989276757,"score_gpt":0.28345769116241,"score_spread":0.26464395017313325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017269195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16847745,0.000059066228,0.8293374,0.0015761013,0.00032987903,0.00007030814,7.054262e-7,0.00001850722,0.00013059044],"genre_scores_gemma":[0.69908243,0.0000038539943,0.30029815,0.00019012165,0.00039123045,0.0000014136256,2.1500138e-7,0.0000043830673,0.000028176784],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99893576,0.00012430816,0.00028484073,0.00014126865,0.0002386326,0.00027520678],"domain_scores_gemma":[0.999168,0.000060793504,0.00016464858,0.0002445599,0.00019990702,0.00016210123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006279207,0.00012037047,0.0002092226,0.000099325625,0.00006409091,0.00013557794,0.0005107515,0.000036725556,0.0000057365896],"category_scores_gemma":[0.00004377757,0.00009547755,0.00004619272,0.0003802705,0.00001647662,0.0012335,0.00011722311,0.00027915853,0.0000042698643],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030408579,0.00015871869,0.0005112084,0.000016782908,0.000007499795,0.000009153245,0.007850004,0.000992467,0.015565175,0.06654688,0.00006958803,0.9082421],"study_design_scores_gemma":[0.0011689222,0.009204526,0.03172967,0.00061846717,0.000036930633,0.00068286544,0.0012608159,0.08396393,0.7134588,0.14507432,0.011504719,0.0012960795],"about_ca_topic_score_codex":0.000015299753,"about_ca_topic_score_gemma":0.000012033838,"teacher_disagreement_score":0.90694606,"about_ca_system_score_codex":0.000025845364,"about_ca_system_score_gemma":0.00013900158,"threshold_uncertainty_score":0.38934618},"labels":[],"label_agreement":null},{"id":"W2017477211","doi":"10.1103/physreva.85.042311","title":"Characterizing quantum gates via randomized benchmarking","year":2012,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":470,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Benchmarking; Protocol (science); Computer science; Scalability; Noise (video); Quantum; Algorithm; Theoretical computer science; Physics; Quantum mechanics; Artificial intelligence; Medicine","score_opus":0.012423496752400516,"score_gpt":0.27786987903941285,"score_spread":0.26544638228701234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017477211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1497614,0.116326146,0.7200103,0.008245097,0.0018984992,0.0014355788,0.0000016361965,0.0007009662,0.0016203776],"genre_scores_gemma":[0.9847496,0.004161617,0.007208085,0.0025555955,0.0012483567,0.000051072253,0.0000031052639,0.000014933651,0.0000076065476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837315,0.0002961588,0.0002945286,0.00028317305,0.0002704886,0.00048249142],"domain_scores_gemma":[0.9986777,0.0005167072,0.00017153434,0.00042188377,0.000036134024,0.0001760528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009547836,0.00020475336,0.00072527875,0.00003518303,0.000121758276,0.00006808991,0.00053206127,0.000018060142,0.000010143845],"category_scores_gemma":[0.00015206654,0.00014059848,0.00034813676,0.00032425133,0.000053295153,0.00032561345,0.00028305373,0.00022509269,0.000110730834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001495455,0.00053898216,0.00015461855,0.0016132306,0.00012337901,0.000011070048,0.0021354572,0.000022417918,0.005363117,0.25566205,0.000725015,0.73350114],"study_design_scores_gemma":[0.007969663,0.00007316667,0.0008428561,0.0034118856,0.00010932262,0.00006943029,0.0000020539342,0.9280054,0.0012761966,0.028904261,0.028562631,0.0007731467],"about_ca_topic_score_codex":0.000007233919,"about_ca_topic_score_gemma":3.4289027e-8,"teacher_disagreement_score":0.927983,"about_ca_system_score_codex":0.000014310776,"about_ca_system_score_gemma":0.00001572362,"threshold_uncertainty_score":0.57334393},"labels":[],"label_agreement":null},{"id":"W2017551061","doi":"10.1139/p08-016","title":"Decoherence in quantum walks and quantum computers","year":2008,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quantum decoherence; Physics; Open quantum system; Quantum error correction; Realization (probability); Quantum network; Quantum dissipation; Quantum mechanics; Quantum walk; Quantum; Quantum information processing; Coupling (piping); Quantum computer; Decoherence-free subspaces; Quantum information; Quantum technology; Statistical physics; Theoretical physics; Mathematics","score_opus":0.015296489355300695,"score_gpt":0.20999108465652555,"score_spread":0.19469459530122485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017551061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8407996,0.00045569023,0.15729153,0.0006631996,0.0006735324,0.000045514837,0.0000020007958,0.000010659054,0.00005826882],"genre_scores_gemma":[0.9877611,0.00002269982,0.011732595,0.00027712368,0.00019150933,3.154233e-7,2.881953e-7,0.00000809496,0.000006302157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896973,0.000059195267,0.00028769375,0.00017703809,0.00016247778,0.00034383291],"domain_scores_gemma":[0.9989886,0.00009720105,0.00016090079,0.0002009938,0.00009456949,0.00045769173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019589852,0.00013233208,0.00023717065,0.00018523482,0.00016498326,0.00008183897,0.0006180069,0.000043027027,0.00000179638],"category_scores_gemma":[0.000025509495,0.00012169644,0.00006351751,0.00037780183,0.00012475436,0.00026106,0.000045299428,0.00036894,0.0000035080222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019715315,0.00018826738,0.06409552,0.00009859469,0.00012852119,0.008203755,0.036473133,0.0821999,0.0005776258,0.18587688,0.009940316,0.61219776],"study_design_scores_gemma":[0.0006467394,0.00027513943,0.04509821,0.00018817004,0.0000046099008,0.0015780585,0.00006128967,0.92230034,0.00014440456,0.027168423,0.0022042142,0.00033040188],"about_ca_topic_score_codex":0.0018575015,"about_ca_topic_score_gemma":0.001192221,"teacher_disagreement_score":0.8401004,"about_ca_system_score_codex":0.00005754642,"about_ca_system_score_gemma":0.00081859995,"threshold_uncertainty_score":0.49626368},"labels":[],"label_agreement":null},{"id":"W2017809384","doi":"10.1093/comjnl/bxm116","title":"An Introduction to Reversible Latches","year":2008,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Power consumption; Power (physics); Electrical engineering; Engineering; Physics; Thermodynamics","score_opus":0.013343481578244863,"score_gpt":0.2281239872367485,"score_spread":0.21478050565850365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017809384","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20618586,0.00003465927,0.76532364,0.0265993,0.0016668483,0.000051345403,1.9840708e-7,0.0001063422,0.000031826265],"genre_scores_gemma":[0.44458845,0.000014570213,0.54089826,0.0029347043,0.011384914,0.0000011822721,5.839678e-7,0.000013571274,0.00016372833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882376,0.00016340714,0.00018823071,0.00026003786,0.0002806375,0.0002839095],"domain_scores_gemma":[0.9990136,0.000046211906,0.00007874766,0.0005751382,0.00009726717,0.0001890117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000557856,0.0001217766,0.00012562766,0.000115437906,0.00084312994,0.00024897917,0.0014393912,0.00002745419,0.000009133843],"category_scores_gemma":[0.000008605422,0.00007808129,0.00007055851,0.0003800273,0.000041995896,0.00032916243,0.00025607707,0.0004001696,0.000053952648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002607621,0.00018340966,0.0004007454,0.0000053204103,0.00006162028,0.00024505996,0.014366802,0.29989204,0.0011762149,0.008240815,0.20621124,0.46919066],"study_design_scores_gemma":[0.00028955174,0.0005471465,0.009262388,0.00001419864,0.000005212141,0.0103613725,0.00001882188,0.9172837,0.0006473574,0.0062505757,0.055046707,0.00027294806],"about_ca_topic_score_codex":0.0000042406487,"about_ca_topic_score_gemma":5.9321496e-7,"teacher_disagreement_score":0.6173917,"about_ca_system_score_codex":0.00002929622,"about_ca_system_score_gemma":0.00005959871,"threshold_uncertainty_score":0.6484759},"labels":[],"label_agreement":null},{"id":"W2018922278","doi":"10.1023/b:ijtp.0000048594.07696.e5","title":"Maximum Speed of Quantum Evolution","year":2004,"lang":"en","type":"article","venue":"International Journal of Theoretical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Defence Research and Development Canada","keywords":"Adiabatic process; Quantum; Computation; Physics; Quantum computer; State (computer science); Quantum state; Statistical physics; Quantum operation; Adiabatic quantum computation; Time evolution; Quantum mechanics; Mathematics; Open quantum system; Algorithm","score_opus":0.006825349518260212,"score_gpt":0.24892787556372242,"score_spread":0.2421025260454622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018922278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12798063,0.00003821522,0.86814445,0.0022922633,0.001141272,0.000023019345,0.0000024851624,0.000013963071,0.00036370454],"genre_scores_gemma":[0.9684868,0.000004843506,0.03084498,0.0001067386,0.0005482914,8.599928e-8,4.900355e-7,0.0000057663883,0.0000020466462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987063,0.00004034931,0.0003738105,0.00010962981,0.0006423765,0.0001275495],"domain_scores_gemma":[0.9988503,0.00010269615,0.00031551195,0.00015806149,0.00050246797,0.000070980655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002754721,0.00009156219,0.00016859874,0.00008437727,0.000025387442,0.000050729275,0.0011644494,0.000034402703,0.000007633971],"category_scores_gemma":[0.00010521071,0.0000713273,0.00018518712,0.0001472621,0.00020139279,0.00019857712,0.0001761891,0.00022379852,0.000007585331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025932748,0.00014578602,0.000033204193,0.000002917473,0.00005159317,0.000028929326,0.00017638208,0.03471804,0.0017137023,0.9536084,0.000022499094,0.009472593],"study_design_scores_gemma":[0.00047488327,0.00016291809,0.00023969686,0.00007802963,0.000006339884,0.00012232803,0.00000865144,0.14940175,0.0056900666,0.8437127,0.000037705628,0.00006492635],"about_ca_topic_score_codex":0.0000040912037,"about_ca_topic_score_gemma":3.883915e-8,"teacher_disagreement_score":0.84050614,"about_ca_system_score_codex":0.00007710038,"about_ca_system_score_gemma":0.00011487564,"threshold_uncertainty_score":0.2908643},"labels":[],"label_agreement":null},{"id":"W2018933144","doi":"10.1103/physreva.86.052319","title":"Almost perfect state transfer in quantum spin chains","year":2012,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Corollary; Kronecker delta; Transfer (computing); State (computer science); Quantum; Diophantine equation; Spin (aerodynamics); Excitation; Physics; Mathematics; Quantum mechanics; Pure mathematics; Computer science; Algorithm","score_opus":0.015229573649975974,"score_gpt":0.2958944558665388,"score_spread":0.2806648822165628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018933144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8670761,0.027161635,0.10116458,0.0030909057,0.0003357626,0.0004998197,0.0000033030205,0.00017786825,0.0004900055],"genre_scores_gemma":[0.9958613,0.0016268162,0.0009409557,0.0012937313,0.00022226108,0.000022311267,0.0000011772534,0.0000124999915,0.000018953948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985451,0.00016711974,0.0002242715,0.00029593933,0.0002443858,0.0005231811],"domain_scores_gemma":[0.99926615,0.000112602494,0.00002923455,0.00040703904,0.000020291314,0.00016467542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043498966,0.00018549593,0.00038082918,0.000044693155,0.0000536881,0.000033232278,0.0005080714,0.000015301857,0.0000057551897],"category_scores_gemma":[0.000044312896,0.00013758641,0.0001629861,0.0005442253,0.000030667008,0.00021316932,0.00011746309,0.00028893445,0.000115215276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068513073,0.0013882732,0.0012664243,0.0018245737,0.000034917415,0.000040919425,0.0053795543,0.00064094464,0.0017730984,0.14123496,0.0007100605,0.8456994],"study_design_scores_gemma":[0.0005518693,0.0003048666,0.020923393,0.00311827,0.00002597228,0.000046160218,0.000006039899,0.9356709,0.0011926253,0.0065725883,0.030733285,0.00085403427],"about_ca_topic_score_codex":0.000023432465,"about_ca_topic_score_gemma":0.0000020065058,"teacher_disagreement_score":0.9350299,"about_ca_system_score_codex":0.000023544802,"about_ca_system_score_gemma":0.000030651536,"threshold_uncertainty_score":0.5610611},"labels":[],"label_agreement":null},{"id":"W2019101955","doi":"10.1142/s0129183102002948","title":"A QUANTUM NEURAL NETWORK MODEL","year":2002,"lang":"en","type":"article","venue":"International Journal of Modern Physics C","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Artificial neural network; Unitary state; Quantum; Quantum gate; Artificial intelligence; Quantum phase estimation algorithm; Binary number; Quantum network; Quantum algorithm; Theoretical computer science; Quantum computer; Algorithm; Machine learning; Mathematics; Physics; Arithmetic; Quantum mechanics","score_opus":0.02376338506227396,"score_gpt":0.2492351424081328,"score_spread":0.22547175734585884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019101955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05280605,0.00030702475,0.94276685,0.0023887164,0.0012913343,0.000024093823,0.0000023367584,0.000035387453,0.00037823568],"genre_scores_gemma":[0.94944245,0.000021796292,0.048283786,0.00062146684,0.001555664,4.82555e-7,5.3007585e-7,0.000010364837,0.00006344857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862754,0.00003517174,0.00033065185,0.00015536504,0.00064556557,0.00020568988],"domain_scores_gemma":[0.9989972,0.00006787358,0.00032640187,0.00018924671,0.00033375676,0.00008549623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015772908,0.00012314503,0.00016181023,0.00005941796,0.000062963016,0.00017366893,0.0015055231,0.000030256786,0.0000051352336],"category_scores_gemma":[0.000016728907,0.00010373188,0.00018147993,0.00011615756,0.000025842462,0.0004072588,0.00021873167,0.00030923198,0.000010139764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046159153,0.00006967486,0.000038417915,9.574674e-7,0.000046429635,0.000046715373,0.00044315256,0.79146546,0.00013860816,0.018514631,0.0017708837,0.18746045],"study_design_scores_gemma":[0.0002476206,0.00004291421,0.000040784962,0.000025624282,0.0000036349454,0.00015458885,9.794716e-7,0.7949491,0.000048387265,0.20418634,0.00021287323,0.00008711925],"about_ca_topic_score_codex":0.0000015198002,"about_ca_topic_score_gemma":2.3797946e-7,"teacher_disagreement_score":0.8966364,"about_ca_system_score_codex":0.000032769305,"about_ca_system_score_gemma":0.000028120792,"threshold_uncertainty_score":0.42300633},"labels":[],"label_agreement":null},{"id":"W2020582875","doi":"10.1007/s00220-014-1990-4","title":"One-Shot Decoupling","year":2014,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"Engineering and Physical Sciences Research Council; CHIST-ERA; Natural Sciences and Engineering Research Council of Canada; University of Bristol; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Agence Nationale de la Recherche; National Science Foundation","keywords":"Decoupling (probability); Quantum entanglement; Correlation; Quantum; Mathematics; Statistical physics; Computer science; Quantum discord; Total correlation; Applied mathematics; Physics; Quantum mechanics; Geometry","score_opus":0.08052535266334204,"score_gpt":0.3285108011254938,"score_spread":0.24798544846215176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020582875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006959789,0.000050705657,0.9795784,0.001618093,0.000035654382,0.00008917974,3.268455e-7,0.00014604803,0.011521805],"genre_scores_gemma":[0.5488862,0.000007842324,0.45089507,0.00014912714,0.000033146658,0.000010495193,0.0000014299901,0.000006570857,0.000010112592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910563,0.00009860432,0.0002541516,0.00018814112,0.00015443732,0.00019903189],"domain_scores_gemma":[0.9966471,0.00080334995,0.000063763466,0.0023920478,0.00004053998,0.000053198226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045094208,0.0000957428,0.00017537,0.000044917,0.00015979438,0.00009754025,0.0023646515,0.00003743641,0.000002916589],"category_scores_gemma":[0.00015220694,0.000095742755,0.00005171386,0.00040535533,0.0001007441,0.0001270469,0.00096539716,0.00030271793,0.00009874064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.0697865e-7,0.00020677387,0.00003187654,0.000016836177,0.0000034530503,1.1448922e-7,0.0004968529,0.0020400197,0.000060031743,0.89632964,0.000016076146,0.10079809],"study_design_scores_gemma":[0.000059797254,0.00000844018,0.00013187852,0.00004602445,0.0000013448164,9.332856e-7,0.0000042685583,0.5521222,0.000060921328,0.44722775,0.00026938392,0.00006711254],"about_ca_topic_score_codex":0.0000020023172,"about_ca_topic_score_gemma":0.0000015618009,"teacher_disagreement_score":0.55008215,"about_ca_system_score_codex":0.000021093598,"about_ca_system_score_gemma":0.000019362338,"threshold_uncertainty_score":0.43941504},"labels":[],"label_agreement":null},{"id":"W2020893760","doi":"10.5555/2011383.2011386","title":"Characterization of universal two-qubit hamiltonian","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Hamiltonian (control theory); Unitary state; Mathematics; Universality (dynamical systems); Quantum mechanics; Mathematical physics; Physics; Quantum; Law","score_opus":0.011893865927385162,"score_gpt":0.21491937716466242,"score_spread":0.20302551123727725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020893760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4273746,0.0000038135163,0.57163405,0.00006441458,0.0001368782,0.000073389674,0.0000024686385,0.00008148065,0.00062892115],"genre_scores_gemma":[0.9791183,0.0000072004505,0.020660928,0.00015343925,0.000015939098,0.0000018034717,0.0000341345,0.0000030978917,0.0000051980883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992625,0.000038658054,0.00031110173,0.00010758608,0.00016036635,0.00011975811],"domain_scores_gemma":[0.99942064,0.000020242147,0.00025136833,0.00012505903,0.00012831432,0.000054374865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015422312,0.00009724232,0.00011243114,0.00020303462,0.00010133235,0.00006352077,0.00018143351,0.000036575024,0.0000054659495],"category_scores_gemma":[0.000008357361,0.000092562324,0.000029333542,0.00028115007,0.000038328144,0.0012817237,0.00008150727,0.00007230955,0.000015192315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032257638,0.00007078182,0.00068420806,0.000084407366,0.000025154146,0.000002333941,0.023486154,0.0022786104,0.0030659183,0.40203822,0.00002899412,0.568203],"study_design_scores_gemma":[0.0004098734,0.00011600478,0.030538177,0.00002159744,0.0000036603326,0.000015686963,0.00007950218,0.96279895,0.001357513,0.0041868784,0.00035488547,0.00011727207],"about_ca_topic_score_codex":0.000045129356,"about_ca_topic_score_gemma":0.0000011435054,"teacher_disagreement_score":0.9605203,"about_ca_system_score_codex":0.000011639736,"about_ca_system_score_gemma":0.000037767666,"threshold_uncertainty_score":0.37745818},"labels":[],"label_agreement":null},{"id":"W2020939132","doi":"10.1103/physrevlett.92.077903","title":"Three- and Four-Body Interactions in Spin-Based Quantum Computers","year":2004,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pairwise comparison; Spins; Qubit; Hamiltonian (control theory); Quantum computer; Computation; Physics; Computer science; Spin (aerodynamics); Statistical physics; Quantum; Point (geometry); Quantum mechanics; Theoretical computer science; Theoretical physics; Algorithm; Mathematics; Condensed matter physics; Artificial intelligence","score_opus":0.019686499377113753,"score_gpt":0.29301329829671136,"score_spread":0.2733267989195976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020939132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33889875,0.0009809207,0.6116025,0.047885932,0.00025597072,0.00024666855,0.0000010456683,0.00011412465,0.0000140993425],"genre_scores_gemma":[0.94986206,0.00012232843,0.02535707,0.024465024,0.00015928785,0.00001886335,0.0000021056107,0.000012940209,2.880036e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998732,0.00005736567,0.00023956923,0.00044695145,0.00021430539,0.0003098444],"domain_scores_gemma":[0.9991975,0.00018685608,0.000089528294,0.0003960648,0.00001890371,0.000111172296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001569086,0.00020075729,0.0003433566,0.00009081427,0.00008363486,0.00008483579,0.00047546145,0.000006523018,0.0000012704203],"category_scores_gemma":[0.000029478788,0.00016755758,0.00012872164,0.00045453932,0.00007201931,0.00016368195,0.00015789416,0.00033629013,0.000027705295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030320109,0.0021206595,0.0020688905,0.0046053226,0.00017550841,0.0010074113,0.0017755033,0.2886529,0.025114898,0.16645485,0.005921537,0.5020722],"study_design_scores_gemma":[0.00045217443,0.00006545554,0.006384193,0.002425163,0.000011192267,0.00002693673,7.3544817e-7,0.9844257,0.000091136644,0.004360625,0.0014817256,0.00027491938],"about_ca_topic_score_codex":0.00007907493,"about_ca_topic_score_gemma":0.00001417326,"teacher_disagreement_score":0.6957728,"about_ca_system_score_codex":0.000052221276,"about_ca_system_score_gemma":0.000035758017,"threshold_uncertainty_score":0.68327993},"labels":[],"label_agreement":null},{"id":"W2021290843","doi":"10.1109/mspec.2010.5372499","title":"Does not quantum compute","year":2010,"lang":"en","type":"article","venue":"IEEE Spectrum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Liberian dollar; Liquid helium; Quantum; Quantum computer; Helium; Physics; Computer science; Helium gas; Mechanical engineering; Quantum mechanics; Engineering; Engineering physics; Theoretical physics; Economics","score_opus":0.006817225463200146,"score_gpt":0.22458112347595918,"score_spread":0.21776389801275903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021290843","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5769235,0.000009192158,0.39504638,0.013273247,0.013005688,0.00013155093,0.000005819813,0.00079455506,0.0008100543],"genre_scores_gemma":[0.95193976,0.0000025155398,0.04572501,0.00078625645,0.0011859204,0.0000019980648,8.0997813e-7,0.000017098526,0.00034063146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836016,0.00003725037,0.0002245591,0.0005509133,0.00031327072,0.000513871],"domain_scores_gemma":[0.99872184,0.00010525047,0.00008958287,0.0008887373,0.000029045903,0.00016552629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025656435,0.00021310193,0.00020709564,0.000118195705,0.00024411081,0.0002744155,0.0013523803,0.00008871847,0.000023709368],"category_scores_gemma":[0.000016489197,0.00013063775,0.0001161416,0.0002990007,0.00008227961,0.00016843542,0.00022594957,0.0006374533,0.0002116741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017735507,0.00029821243,0.00074756483,0.0000408118,0.000074378586,0.00032228095,0.0014933606,0.0027496316,0.119613096,0.74152446,0.0047749504,0.12834351],"study_design_scores_gemma":[0.00027103716,0.00009920856,0.0028530643,0.000012344535,0.0000035634152,0.000087913,0.0000030488989,0.87697786,0.057914462,0.044930484,0.016476769,0.00037022287],"about_ca_topic_score_codex":0.000062849555,"about_ca_topic_score_gemma":0.00007040146,"teacher_disagreement_score":0.87422824,"about_ca_system_score_codex":0.0000113170445,"about_ca_system_score_gemma":0.00006082253,"threshold_uncertainty_score":0.5327253},"labels":[],"label_agreement":null},{"id":"W2022034486","doi":"10.1103/physrevlett.103.080502","title":"Quantum Adiabatic Brachistochrone","year":2009,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Geodesic; Adiabatic process; Manifold (fluid mechanics); Metric (unit); Physics; Computation; Adiabatic quantum computation; Curvature; Quantum entanglement; Quantum; Quantum mechanics; Quantum computer; Classical mechanics; Mathematical physics; Theoretical physics; Computer science; Topology (electrical circuits); Mathematics; Algorithm; Geometry; Combinatorics","score_opus":0.010122310057996327,"score_gpt":0.26618649351169327,"score_spread":0.2560641834536969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022034486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1579433,0.019579588,0.65135705,0.16860445,0.0004805451,0.0006258749,0.0000019009339,0.00071110704,0.00069617317],"genre_scores_gemma":[0.8398197,0.0005197144,0.018614091,0.14052162,0.00048896804,0.000010993876,0.0000031757268,0.000012743838,0.000008963647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873614,0.000070748254,0.0001986915,0.0003798447,0.00028580107,0.00032879246],"domain_scores_gemma":[0.99909186,0.000097428274,0.000089329515,0.00057743717,0.000018375038,0.00012555577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001498071,0.00018092134,0.00033541152,0.000037269365,0.00009857345,0.000057665977,0.0007663396,0.000006139597,0.000004798351],"category_scores_gemma":[0.000042913092,0.00014226802,0.00018588129,0.00037590807,0.00003555703,0.00015701436,0.00007688655,0.00023361364,0.00017730417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002740863,0.00045521636,0.0000102768445,0.0006768527,0.000035606947,0.00010833148,0.00055808923,0.002903763,0.017952496,0.10588436,0.041560955,0.8298513],"study_design_scores_gemma":[0.00022577858,0.00024029719,0.0025109106,0.0014974828,0.00003137255,0.00004212911,4.7707846e-7,0.96459204,0.0001223318,0.01104295,0.019170042,0.0005242192],"about_ca_topic_score_codex":0.0000028668687,"about_ca_topic_score_gemma":7.49779e-8,"teacher_disagreement_score":0.9616882,"about_ca_system_score_codex":0.000027492952,"about_ca_system_score_gemma":0.000019574862,"threshold_uncertainty_score":0.58015215},"labels":[],"label_agreement":null},{"id":"W2022069187","doi":"10.1139/p06-033","title":"Entanglement and adiabatic quantum computation","year":2006,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Physics; Adiabatic quantum computation; Adiabatic process; Quantum entanglement; Quantum computer; Computation; Hamiltonian (control theory); Quantum mechanics; Quantum; Quantum algorithm; Quantum discord; Statistical physics; Algorithm; Computer science","score_opus":0.007453502058103273,"score_gpt":0.20376621827575706,"score_spread":0.19631271621765378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022069187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37750864,0.0003859308,0.6205776,0.00084937835,0.00044047745,0.00004028839,0.0000028262039,0.000009201509,0.00018570996],"genre_scores_gemma":[0.98228645,0.000001454379,0.017254142,0.00012940295,0.00031319552,1.9536351e-7,0.0000010182067,0.0000048713096,0.0000092527835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993978,0.000029255169,0.00018781128,0.00008791102,0.000119700606,0.00017749416],"domain_scores_gemma":[0.9994571,0.00003749731,0.00014517315,0.000079806334,0.000083155275,0.0001972369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012468947,0.00007433443,0.00011049032,0.000084712985,0.00011434423,0.00013038956,0.0002039352,0.000016921176,0.0000013787759],"category_scores_gemma":[0.0000068283753,0.000067165725,0.00004129287,0.00015964733,0.000035679088,0.00014069676,0.000015039517,0.00011413576,0.0000021800336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021717099,0.000057669167,0.005103134,0.00004187355,0.000052355706,0.00034471188,0.0021549042,0.08401695,0.00042515833,0.38677463,0.0071804826,0.513846],"study_design_scores_gemma":[0.000488865,0.00023017648,0.015073249,0.00008668504,0.000014895741,0.00023173538,0.00003799963,0.8034758,0.00040778518,0.17603324,0.0036996587,0.00021992608],"about_ca_topic_score_codex":0.0011572198,"about_ca_topic_score_gemma":0.0006555323,"teacher_disagreement_score":0.7194588,"about_ca_system_score_codex":0.000044479773,"about_ca_system_score_gemma":0.0003087089,"threshold_uncertainty_score":0.27389386},"labels":[],"label_agreement":null},{"id":"W2023316152","doi":"","title":"Reflections for quantum query algorithms","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum algorithm; Query optimization; Algorithm; Boolean function; Computer science; Upper and lower bounds; Mathematics; Theoretical computer science; Discrete mathematics; Quantum; Data mining","score_opus":0.060156779970161396,"score_gpt":0.30788484025451635,"score_spread":0.24772806028435496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023316152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017174167,0.000038021604,0.98404515,0.0004755709,0.0008969735,0.00015550436,0.000002044095,0.0005502495,0.012119058],"genre_scores_gemma":[0.1108296,0.0000036969977,0.8874262,0.00054959115,0.00020630039,0.000033703993,0.000001386761,0.000013561395,0.00093594834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900436,0.000025624784,0.00018241517,0.0003598713,0.00011298603,0.0003147249],"domain_scores_gemma":[0.999265,0.000079713056,0.000050445316,0.0004346059,0.00007619144,0.00009400402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021483029,0.00012283023,0.00012668506,0.000110756286,0.00024571034,0.000066498826,0.00061184797,0.000051244228,0.000020301748],"category_scores_gemma":[0.00002573567,0.00009850816,0.00011130428,0.00028905578,0.000030434538,0.00016446601,0.00014211262,0.00010870762,0.00003966367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066354587,0.00016420985,0.00003878647,0.000014639456,0.00003336859,0.000011740944,0.002235125,0.000113235285,0.00039178037,0.8467577,0.0043778764,0.14585488],"study_design_scores_gemma":[0.00024550658,0.00027325214,0.000606839,0.000010320323,0.0000048698257,0.00006812014,0.000031653082,0.86559933,0.0025130608,0.111537784,0.018854678,0.0002546024],"about_ca_topic_score_codex":0.0000941921,"about_ca_topic_score_gemma":0.000012996519,"teacher_disagreement_score":0.8654861,"about_ca_system_score_codex":0.000013159777,"about_ca_system_score_gemma":0.00004764098,"threshold_uncertainty_score":0.4017046},"labels":[],"label_agreement":null},{"id":"W2023381398","doi":"10.1103/physrevlett.112.140504","title":"Asymptotically Optimal Topological Quantum Compiling","year":2014,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Anyon; Braid; Fibonacci number; Unitary state; Qubit; Topological quantum computer; Quantum computer; Quantum; Topology (electrical circuits); Quantum circuit; Computer science; Discrete mathematics; Mathematics; Algorithm; Physics; Quantum error correction; Combinatorics; Quantum mechanics","score_opus":0.012709898691707203,"score_gpt":0.27243897426232394,"score_spread":0.25972907557061675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023381398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2043196,0.0008117721,0.7578114,0.036063038,0.00025868302,0.00016955736,6.335306e-7,0.00029857454,0.00026669787],"genre_scores_gemma":[0.9014761,0.00015351153,0.049057376,0.04871646,0.00056540786,0.000011369147,0.0000023607702,0.000013967307,0.0000034395443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981263,0.00024891007,0.00027350037,0.0005312916,0.00036529274,0.000454683],"domain_scores_gemma":[0.99865663,0.00045762726,0.000090501235,0.0005823363,0.00003552664,0.00017739274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041881468,0.00022685381,0.00046582843,0.00003112862,0.00014294453,0.00009685691,0.0010303105,0.000013910855,0.000008367206],"category_scores_gemma":[0.00016797865,0.00016467975,0.0002434854,0.00028857996,0.00011582881,0.00011591765,0.0003564446,0.00037765974,0.00018118885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008419554,0.00057522097,0.00016835335,0.0011198284,0.00007814127,0.00007539174,0.00039366382,0.034759905,0.01025633,0.71963114,0.006878268,0.22605534],"study_design_scores_gemma":[0.00012379831,0.00011867447,0.0005702139,0.00045869278,0.00001407203,0.000022468139,5.408079e-7,0.9846434,0.00007614332,0.0030310345,0.010674489,0.00026646312],"about_ca_topic_score_codex":0.0000027658293,"about_ca_topic_score_gemma":7.275501e-8,"teacher_disagreement_score":0.9498835,"about_ca_system_score_codex":0.000017372102,"about_ca_system_score_gemma":0.000014345789,"threshold_uncertainty_score":0.6715445},"labels":[],"label_agreement":null},{"id":"W2023478619","doi":"10.1117/12.488754","title":"Quantum computers and decoherence: exorcising the demon from the machine","year":2003,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum decoherence; Qubit; Quantum computer; Quantum error correction; Decoherence-free subspaces; Computer science; Realization (probability); Quantum; Quantum mechanics; Dynamical decoupling; Physics; Mathematics","score_opus":0.009620102542296604,"score_gpt":0.21778838291470812,"score_spread":0.2081682803724115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023478619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9859018,0.00048977206,0.0051533147,0.007187085,0.00044771578,0.00037592286,0.000016140868,0.00008735496,0.00034090495],"genre_scores_gemma":[0.71522665,0.000100142155,0.28368938,0.0005175695,0.00034794104,0.000040494127,0.0000024689025,0.0000377395,0.000037640526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800545,8.242861e-8,0.0005123464,0.0004617643,0.00062988675,0.00039049276],"domain_scores_gemma":[0.99819046,0.0007032844,0.00032685458,0.00012178358,0.00055674044,0.00010088524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009655901,0.00030562966,0.00031364692,0.00004457677,0.0002980697,0.00039715532,0.001984237,0.00011421832,0.0000029364926],"category_scores_gemma":[0.00046483177,0.0001764186,0.0003647592,0.00036838706,0.00029316448,0.0003580298,0.00039436485,0.00046686127,7.785734e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018488727,0.000063817235,0.0007798185,0.00008065829,0.0002943778,1.9705827e-7,0.0010430667,0.00070391165,0.042262334,0.94842726,0.0024780033,0.0038480812],"study_design_scores_gemma":[0.000727632,0.00018880868,0.0029098566,0.0002813347,0.00007533941,0.000048593756,0.0006518089,0.959262,0.011874391,0.01900865,0.004619491,0.00035209555],"about_ca_topic_score_codex":0.000033371725,"about_ca_topic_score_gemma":3.6008365e-7,"teacher_disagreement_score":0.9585581,"about_ca_system_score_codex":0.00005199454,"about_ca_system_score_gemma":0.000034479115,"threshold_uncertainty_score":0.7194142},"labels":[],"label_agreement":null},{"id":"W2023934532","doi":"10.1088/1742-6596/400/5/052037","title":"3D magnetometer for a dilution refrigerator","year":2012,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Dilution refrigerator; Magnetometer; Magnetic field; Electrical engineering; Refrigerator car; Electronics; Saturation (graph theory); Materials science; Optoelectronics; Nuclear magnetic resonance; Physics; Engineering; Mechanical engineering","score_opus":0.02176486187300656,"score_gpt":0.2543413249385498,"score_spread":0.23257646306554322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023934532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052386872,0.00013801563,0.945803,0.00052056764,0.0009306448,0.00006370383,0.0000032980474,0.000024435278,0.00012944611],"genre_scores_gemma":[0.7842703,0.000009883835,0.21458319,0.00009507385,0.0009575965,0.0000022655815,6.052374e-7,0.000006148623,0.00007492692],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991269,0.000041114774,0.00025441367,0.00009654545,0.00021250123,0.00026849253],"domain_scores_gemma":[0.9990216,0.000070973314,0.00028629517,0.00017857818,0.00033402137,0.000108564214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031382733,0.00011644651,0.000201289,0.000056493656,0.00011269708,0.00015621146,0.00040957637,0.000035152825,0.00000540834],"category_scores_gemma":[0.000037762515,0.00008778149,0.00011208324,0.0001643965,0.000043683845,0.0011772774,0.000081010265,0.00016051719,0.000004291913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004023904,0.0001472276,0.00024340802,0.000046928686,0.00005245995,0.0000035128676,0.0036135276,0.00018949449,0.013138324,0.1850743,0.0006448258,0.79680574],"study_design_scores_gemma":[0.0030678809,0.0053743627,0.010893509,0.00056353805,0.00015613002,0.0009851988,0.00054564985,0.15079464,0.42050168,0.28317726,0.12209588,0.0018442583],"about_ca_topic_score_codex":8.9131254e-7,"about_ca_topic_score_gemma":2.6744038e-7,"teacher_disagreement_score":0.7949615,"about_ca_system_score_codex":0.000018756187,"about_ca_system_score_gemma":0.00010624749,"threshold_uncertainty_score":0.35796252},"labels":[],"label_agreement":null},{"id":"W2024801628","doi":"10.1103/physrevlett.110.230501","title":"Experimental Quantum Computing to Solve Systems of Linear Equations","year":2013,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":175,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Subroutine; Quantum computer; Computer science; Quantum algorithm; Speedup; Quantum sort; Quantum algorithm for linear systems of equations; Quantum; Quantum Turing machine; Quantum phase estimation algorithm; Linear equation; Algorithm; Theoretical computer science; Quantum process; Mathematics; Quantum error correction; Parallel computing; Quantum dynamics; Quantum mechanics; Physics","score_opus":0.020986555261743433,"score_gpt":0.2961761909976552,"score_spread":0.27518963573591176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024801628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30140236,0.0021279391,0.6901178,0.005428355,0.00027228278,0.0005245198,0.0000013234733,0.000096374366,0.000029088804],"genre_scores_gemma":[0.97090816,0.000015366608,0.022530815,0.006245016,0.00025553655,0.000030089903,0.000001863096,0.000011440659,0.0000017177022],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986611,0.00007239191,0.00033244916,0.00032986142,0.0003199429,0.00028424629],"domain_scores_gemma":[0.9989623,0.00024302723,0.00014069676,0.0004528237,0.00006493981,0.0001362536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016096776,0.00016314804,0.00038513553,0.000050182043,0.00009986644,0.0000633441,0.0006515181,0.0000073370124,0.0000039848414],"category_scores_gemma":[0.00005173672,0.0001302147,0.0001534478,0.0003975595,0.000035903977,0.00013861463,0.00029271003,0.00013854206,0.00020593814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003593236,0.0012011295,0.00007107463,0.0031108,0.00017900711,0.000021083406,0.007475872,0.23413149,0.5058483,0.15878107,0.026274279,0.0629023],"study_design_scores_gemma":[0.00007241107,0.00007766617,0.00010962349,0.0010254529,0.0000065395366,0.0000035990784,0.0000112446805,0.9965484,0.0013599077,0.0000761845,0.00053936493,0.00016958619],"about_ca_topic_score_codex":0.00009274961,"about_ca_topic_score_gemma":6.430348e-8,"teacher_disagreement_score":0.76241696,"about_ca_system_score_codex":0.00002311729,"about_ca_system_score_gemma":0.000016536553,"threshold_uncertainty_score":0.53100014},"labels":[],"label_agreement":null},{"id":"W2024824422","doi":"10.1063/1.3598408","title":"Adiabatic quantum simulators","year":2011,"lang":"en","type":"article","venue":"AIP Advances","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Adiabatic process; Hamiltonian (control theory); Diabatic; Quantum simulator; Quantum; Quantum computer; Ground state; Feynman diagram; Adiabatic quantum computation","score_opus":0.01499717716187273,"score_gpt":0.2338535562640706,"score_spread":0.21885637910219785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024824422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21205688,0.0024641594,0.77875125,0.00023277209,0.0014071093,0.00012923169,0.0000013614865,0.00057913637,0.0043781134],"genre_scores_gemma":[0.92644274,0.000031498937,0.07307357,0.00031424448,0.00008180516,0.0000036647261,3.8406787e-7,0.00000846722,0.00004362304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990268,0.000036359157,0.00015903942,0.0003214199,0.00016404591,0.00029235354],"domain_scores_gemma":[0.99929875,0.00009191253,0.00007071292,0.00041323685,0.000030521373,0.00009484125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011667693,0.0001308926,0.00013551704,0.00007313622,0.00012726935,0.00004195632,0.0007326558,0.000029469982,0.00001981471],"category_scores_gemma":[0.00003229989,0.0001048204,0.000058450267,0.00029135615,0.000051680676,0.0003752902,0.00014916835,0.000118372576,0.000091482085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098935125,0.00021343808,0.008198607,0.000053649797,0.000040794213,0.000107987675,0.006695055,0.007056249,0.00016332137,0.20422846,0.00034991233,0.77288264],"study_design_scores_gemma":[0.00022490171,0.0002454353,0.006376741,0.000041663836,0.0000051511233,0.000024045368,0.0000464508,0.8545672,0.000988817,0.11353988,0.023584262,0.00035545212],"about_ca_topic_score_codex":0.000016692926,"about_ca_topic_score_gemma":0.000003456198,"teacher_disagreement_score":0.84751093,"about_ca_system_score_codex":0.00000968122,"about_ca_system_score_gemma":0.000027511764,"threshold_uncertainty_score":0.4274452},"labels":[],"label_agreement":null},{"id":"W2024860775","doi":"10.1038/nature10012","title":"Quantum annealing with manufactured spins","year":2011,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1922,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; D-Wave Systems (Canada)","funders":"","keywords":"Quantum annealing; Spins; Simulated annealing; Quantum; Ground state; Physics; Condensed matter physics; Quantum computer; Annealing (glass); Quantum system; Quantum mechanics; Statistical physics; Computer science; Algorithm","score_opus":0.011567717509206378,"score_gpt":0.22468835140656673,"score_spread":0.21312063389736036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024860775","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5687775,0.0010654884,0.42022955,0.0015860656,0.0014359632,0.0002569942,0.000006257591,0.0009931509,0.0056490414],"genre_scores_gemma":[0.87931174,0.000003390844,0.119517155,0.0009403112,0.00013824791,0.0000023957116,0.0000020855891,0.000013690251,0.00007098839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987971,0.000033052944,0.00012148811,0.00042568037,0.00027770983,0.00034492777],"domain_scores_gemma":[0.999174,0.000026161646,0.00007426666,0.0005539128,0.00006224047,0.00010940485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001285375,0.00018709428,0.00015557997,0.000097229895,0.00016046598,0.00008111732,0.00089755014,0.00046823343,0.000016202122],"category_scores_gemma":[0.000013253614,0.00012596822,0.000057475147,0.00032699248,0.00003707608,0.00016365528,0.00015495298,0.0017862256,0.000022803764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024377383,0.00066612713,0.0067322324,0.00021401804,0.00039631405,0.0022487894,0.027896313,0.0057368483,0.0017769468,0.5247621,0.012925534,0.416401],"study_design_scores_gemma":[0.0019454795,0.0013081685,0.13313378,0.00031529073,0.000040159015,0.0008774893,0.00014041402,0.74157983,0.02974284,0.049502403,0.03949904,0.0019151071],"about_ca_topic_score_codex":0.000023133523,"about_ca_topic_score_gemma":0.000007862707,"teacher_disagreement_score":0.735843,"about_ca_system_score_codex":0.000013197976,"about_ca_system_score_gemma":0.00004471922,"threshold_uncertainty_score":0.7760361},"labels":[],"label_agreement":null},{"id":"W2025164650","doi":"10.1063/1.2203431","title":"GHZ extraction yield for multipartite stabilizer states","year":2006,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Multipartite; Qubit; Quantum entanglement; Multipartite entanglement; Stabilizer (aeronautics); Mathematics; Unitary state; Lattice (music); LOCC; Quantum state; State (computer science); Quantum mechanics; Formalism (music); Quantum; Physics; Combinatorics; Discrete mathematics; Law; Squashed entanglement; Algorithm; Political science","score_opus":0.01858943912014067,"score_gpt":0.2699958832858535,"score_spread":0.25140644416571284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025164650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10051539,0.000038433627,0.8983517,0.0006587307,0.00018760879,0.0000822344,0.0000015200885,0.000026527166,0.00013783087],"genre_scores_gemma":[0.5264565,0.0000026382043,0.4726083,0.00008363413,0.0007479631,0.0000025804543,5.9745213e-7,0.0000122284555,0.000085577594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899495,0.000022992155,0.0004110187,0.00011077599,0.00027290534,0.00018736183],"domain_scores_gemma":[0.99853474,0.0007614019,0.0002993233,0.00017444545,0.00017042381,0.000059638354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035992725,0.00010355219,0.00022169201,0.000033746903,0.00007234914,0.00010466853,0.0002968548,0.000033769193,0.0000060169277],"category_scores_gemma":[0.00009728866,0.00007362816,0.00017308432,0.000114841976,0.000029329341,0.0002606479,0.000043527558,0.00017721002,0.000009005339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010684294,0.0033499612,0.00013773853,0.00066439586,0.00016763053,0.00006393899,0.0025813456,0.29718,0.028326578,0.4394251,0.018568091,0.20942838],"study_design_scores_gemma":[0.00020113024,0.00011952752,0.00007092442,0.000059729184,0.000009660587,0.000032406,0.000010974962,0.5181716,0.0042905044,0.4761894,0.0007694506,0.00007467574],"about_ca_topic_score_codex":0.0000015447133,"about_ca_topic_score_gemma":2.6041525e-7,"teacher_disagreement_score":0.4259411,"about_ca_system_score_codex":0.00001964144,"about_ca_system_score_gemma":0.000031270763,"threshold_uncertainty_score":0.30024692},"labels":[],"label_agreement":null},{"id":"W2025175501","doi":"10.1142/s0219749910006198","title":"AN INTRODUCTION TO ONE-WAY QUANTUM COMPUTING IN DISTRIBUTED ARCHITECTURES","year":2010,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum computer; Probabilistic logic; Computation; Quantum; Quantum algorithm; Quantum network; Distributed algorithm; Quantum technology","score_opus":0.007324212455680802,"score_gpt":0.26199707879780554,"score_spread":0.2546728663421247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025175501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4903231,0.0000032762414,0.5012725,0.0056633702,0.0026099696,0.00006593422,0.0000065404824,0.000038164562,0.000017159238],"genre_scores_gemma":[0.9603676,0.00000167082,0.037614167,0.0004868965,0.0014947667,0.0000012557417,0.00002633815,0.0000066478005,6.512813e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997698,0.000083170504,0.0009629072,0.00017331976,0.0008209895,0.0002616014],"domain_scores_gemma":[0.9980574,0.000106616266,0.00062555436,0.00030325307,0.0007350476,0.00017211023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001126056,0.00016825042,0.00022217631,0.0009772505,0.00008851883,0.00048837904,0.0015753994,0.00008388971,0.000011339085],"category_scores_gemma":[0.000409628,0.0001511164,0.00009372576,0.00046080237,0.000034773995,0.0015495168,0.00016992533,0.0007501551,0.000018781748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019055004,0.0003436118,0.0016822714,0.000019761157,0.00007505648,0.000036091507,0.0074027353,0.46668017,0.010823961,0.16026661,0.0008885629,0.3515906],"study_design_scores_gemma":[0.00061279855,0.00030070398,0.03607161,0.00005182549,0.0000035520684,0.0004326126,0.00008107717,0.9452706,0.0017771769,0.009732878,0.005460522,0.00020462644],"about_ca_topic_score_codex":0.000039159924,"about_ca_topic_score_gemma":0.000018002896,"teacher_disagreement_score":0.47859043,"about_ca_system_score_codex":0.000084517,"about_ca_system_score_gemma":0.00010778411,"threshold_uncertainty_score":0.61623484},"labels":[],"label_agreement":null},{"id":"W2026401039","doi":"10.1103/physreva.72.042303","title":"Theory of initialization-free decoherence-free subspaces and subsystems","year":2005,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Alfred P. Sloan Foundation","keywords":"Initialization; Linear subspace; Quantum decoherence; Design for Six Sigma; Set (abstract data type); Computer science; Class (philosophy); Function (biology); Theoretical computer science; Mathematics; Algorithm; Quantum; Pure mathematics; Artificial intelligence; Engineering; Physics; Quantum mechanics","score_opus":0.015256586853462633,"score_gpt":0.27509508614889083,"score_spread":0.2598384992954282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026401039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29775637,0.16942231,0.5119751,0.012108121,0.0003978684,0.0012340915,0.000020997963,0.00042809444,0.0066570477],"genre_scores_gemma":[0.9827244,0.0028450438,0.013358341,0.0006918978,0.0003206494,0.000016713551,0.0000011483455,0.000010180079,0.00003161388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989718,0.00015703509,0.00021762252,0.00024909189,0.00022846746,0.00017594873],"domain_scores_gemma":[0.99869466,0.00029493307,0.00013280903,0.00073848106,0.00006507756,0.00007402946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037565132,0.000121593046,0.0003197879,0.000029972014,0.000059703594,0.000038028833,0.00091242214,0.000016182212,0.000004930558],"category_scores_gemma":[0.00028255375,0.000088846544,0.000076874785,0.00029914378,0.0000695531,0.00014462572,0.00045061935,0.00009171592,0.000007918777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002670381,0.00013577488,0.0001733693,0.0011810939,0.000027631371,0.0000031505517,0.0009082094,0.00017286239,0.00016439501,0.5464069,0.0016964441,0.44912747],"study_design_scores_gemma":[0.0011453037,0.00038511673,0.0038119913,0.0067116455,0.00010036012,0.0000681361,0.000025574724,0.3885908,0.0023244813,0.5697597,0.026262613,0.00081421284],"about_ca_topic_score_codex":0.000007506292,"about_ca_topic_score_gemma":0.0000047606136,"teacher_disagreement_score":0.68496805,"about_ca_system_score_codex":0.0000063972,"about_ca_system_score_gemma":0.00003139572,"threshold_uncertainty_score":0.3623057},"labels":[],"label_agreement":null},{"id":"W2027976388","doi":"10.1109/nano.2006.247801","title":"A Pedagogical Approach to Quantum Computing using Spin-1/2 particles","year":2006,"lang":"en","type":"article","venue":"2006 Sixth IEEE Conference on Nanotechnology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Superposition principle; Quantum entanglement; Spin (aerodynamics); Quantum computer; Computer science; Quantum; Physics; Quantum technology; Quantum mechanics; Open quantum system","score_opus":0.06953705543605745,"score_gpt":0.30788830818750684,"score_spread":0.2383512527514494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027976388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47887477,0.000033722863,0.5182624,0.0012274699,0.0002948138,0.00019490515,0.000003580138,0.0006256036,0.00048272274],"genre_scores_gemma":[0.87298375,0.0000019178403,0.12624519,0.00044468648,0.00020250902,0.000009930035,0.0000024938338,0.000023829489,0.00008570922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967482,0.00013308706,0.00054063526,0.0011261855,0.00041400615,0.0010378723],"domain_scores_gemma":[0.99842006,0.000101238365,0.00019124028,0.0009825572,0.00014408318,0.00016084738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033995457,0.00042160813,0.0005048153,0.00045769007,0.00039222502,0.00024249054,0.0016533956,0.00035609034,0.000005156295],"category_scores_gemma":[0.000059588736,0.00037199786,0.000117033625,0.0010816345,0.00020008443,0.00010841247,0.000444856,0.00062928774,0.000100837824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021706508,0.00050852675,0.0002048769,0.000023273857,0.000017340191,0.000067666646,0.00035017048,0.09839109,0.03408231,0.80821705,0.0006010355,0.057514925],"study_design_scores_gemma":[0.00048688502,0.00033878736,0.00032117503,0.000065222965,0.0000073380147,0.00013432073,0.000049946317,0.9627363,0.01405343,0.020125875,0.0011714657,0.0005092706],"about_ca_topic_score_codex":0.00020415297,"about_ca_topic_score_gemma":0.0000109857965,"teacher_disagreement_score":0.8643452,"about_ca_system_score_codex":0.00007592273,"about_ca_system_score_gemma":0.00015817732,"threshold_uncertainty_score":0.9998732},"labels":[],"label_agreement":null},{"id":"W2027980206","doi":"10.1088/1751-8113/41/6/065302","title":"Manifold algorithmic errors in quantum computers with static internal imperfections","year":2008,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Quantum decoherence; Controlled NOT gate; Qubit; Unitary state; Quantum error correction; Physics; Quantum computer; Quantum gate; Residual; Quantum; Quantum mechanics; Quantum circuit; Coupling (piping); Quantum Fourier transform; Statistical physics; Computer science; Algorithm; Engineering","score_opus":0.007314687423574553,"score_gpt":0.21927806034162808,"score_spread":0.21196337291805353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027980206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4805465,0.000017628337,0.51874876,0.00046681138,0.00007122442,0.000049282637,6.2283283e-7,0.00001413117,0.00008506058],"genre_scores_gemma":[0.909722,0.000013333176,0.09003017,0.00009242917,0.00012367086,0.0000013847699,1.4094653e-7,0.000010836095,0.000006042302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863344,0.00009643195,0.00043993272,0.00019086305,0.00036786904,0.00027143047],"domain_scores_gemma":[0.99896675,0.0004279703,0.00016555093,0.00017665153,0.000081681996,0.00018139684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033918943,0.00017634366,0.0003881406,0.00009460529,0.000113325994,0.00008689101,0.0003872368,0.00004110237,0.000009518677],"category_scores_gemma":[0.000039447197,0.00011090893,0.00009920833,0.0002605728,0.00035881024,0.00018541652,0.00014160365,0.00048288688,0.000004395752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021068263,0.0002714907,0.00006995177,0.000033031843,0.000033996974,0.00034450734,0.00135388,0.0007242322,0.00003718851,0.9933486,0.00003452245,0.0037275332],"study_design_scores_gemma":[0.00046670853,0.00044631495,0.00025288458,0.00017327108,0.0000094086645,0.0028283214,0.00003679636,0.5441872,0.00009674507,0.4513907,0.0000068364607,0.0001048316],"about_ca_topic_score_codex":0.0000028163156,"about_ca_topic_score_gemma":2.3591646e-7,"teacher_disagreement_score":0.54346293,"about_ca_system_score_codex":0.000023392098,"about_ca_system_score_gemma":0.000064106054,"threshold_uncertainty_score":0.4522735},"labels":[],"label_agreement":null},{"id":"W2029152786","doi":"10.1007/s11128-010-0175-0","title":"Nonlocal quantum information in bipartite quantum error correction","year":2010,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum error correction; Quantum computer; Quantum information; Quantum capacity; Quantum algorithm; Quantum; Qubit; Encoding (memory); Controlled NOT gate","score_opus":0.00822677762229415,"score_gpt":0.24274055960239413,"score_spread":0.23451378198009998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029152786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34215492,0.000029614866,0.65157557,0.0009458284,0.0036286572,0.00030534255,0.0000050415883,0.0006294269,0.00072557974],"genre_scores_gemma":[0.9894835,0.000006953966,0.009348973,0.00086775044,0.00016240195,0.000039433944,0.00006529013,0.00001463038,0.00001110148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691844,0.000078302415,0.0012695589,0.00030793878,0.00071874773,0.00070703035],"domain_scores_gemma":[0.99804765,0.00010933801,0.0007093109,0.0005490631,0.00038660588,0.00019806084],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010977365,0.00037686483,0.00033693897,0.00093456596,0.00055013486,0.0012951193,0.00090395974,0.00027199913,0.000023328776],"category_scores_gemma":[0.00034103487,0.00035120908,0.00010536697,0.0016037038,0.00011000469,0.012636335,0.00024536718,0.0011168021,0.00036558852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006517312,0.00014443195,0.0008962258,0.00037875547,0.000012713728,0.0000071188747,0.016377034,0.020730918,0.0010235917,0.047415316,0.0015632316,0.9113855],"study_design_scores_gemma":[0.0006290346,0.00010696071,0.0022849855,0.00014321505,0.0000048460524,0.00011684263,0.00053762743,0.9772956,0.001121916,0.0025206702,0.014773935,0.0004644156],"about_ca_topic_score_codex":0.00013317564,"about_ca_topic_score_gemma":0.000048182366,"teacher_disagreement_score":0.9565646,"about_ca_system_score_codex":0.00008571138,"about_ca_system_score_gemma":0.00038871073,"threshold_uncertainty_score":0.99989396},"labels":[],"label_agreement":null},{"id":"W2029253545","doi":"10.1103/physreva.74.020102","title":"Decoherence and quantum walks: Anomalous diffusion and ballistic tails","year":2006,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of British Columbia","funders":"","keywords":"Quantum decoherence; Quantum walk; Quantum particle; Physics; Density matrix; Quantum; Mean squared displacement; Statistical physics; Quantum Zeno effect; Quantum mechanics; Wave packet; Lattice (music); Quantum algorithm; Molecular dynamics","score_opus":0.006301622390417632,"score_gpt":0.24593444865800876,"score_spread":0.23963282626759114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029253545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88326037,0.046452653,0.06766748,0.0016673213,0.0000927329,0.00031100528,0.0000021197911,0.00015118062,0.00039513432],"genre_scores_gemma":[0.9922305,0.0021616484,0.004946037,0.00048045,0.00014124835,0.000009879113,0.0000012247878,0.000007285854,0.000021742735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896264,0.00007191989,0.0001672871,0.00039860813,0.00017065981,0.0002288611],"domain_scores_gemma":[0.99934787,0.00017811371,0.00007022563,0.0002802678,0.000028639022,0.000094865136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013660362,0.00015670506,0.0002924231,0.000021690237,0.000114845076,0.00010068921,0.00026523817,0.000016963662,0.0000017653521],"category_scores_gemma":[0.000052901134,0.00011399339,0.000049850638,0.00019879878,0.0000673911,0.000095998985,0.0002841493,0.00013066706,0.000011175789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029347968,0.0002962919,0.0012281315,0.0014788156,0.000011451141,0.000060432503,0.00019716544,0.000038948318,0.0016256955,0.20261264,0.00091198407,0.7915355],"study_design_scores_gemma":[0.00028341173,0.00021001167,0.041002776,0.0017648317,0.000032488544,0.000093846305,0.0000016248963,0.8152577,0.000054242253,0.13310702,0.0077612726,0.0004307545],"about_ca_topic_score_codex":0.00005615944,"about_ca_topic_score_gemma":0.0000025371232,"teacher_disagreement_score":0.81521875,"about_ca_system_score_codex":0.0000073697133,"about_ca_system_score_gemma":0.000016659164,"threshold_uncertainty_score":0.46485156},"labels":[],"label_agreement":null},{"id":"W2029415290","doi":"10.5555/1496770.1496780","title":"On the hitting times of quantum versus random walks","year":2009,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum walk; Hitting time; Random walk; Mathematics; Quantum; Quantum algorithm; Statistical physics; Markov chain; Discrete mathematics; Quantum mechanics; Physics; Statistics","score_opus":0.010634371952471982,"score_gpt":0.2439889803909162,"score_spread":0.23335460843844422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029415290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23862462,0.00092833105,0.5581671,0.10957881,0.008872228,0.0024877358,0.00007654342,0.0018812093,0.0793834],"genre_scores_gemma":[0.9908939,0.000028191735,0.0074728797,0.0010317868,0.0003294108,0.00001068259,0.0000053687563,0.000024230132,0.00020357495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732715,0.00024397045,0.00046926455,0.0006621137,0.0007213238,0.00057615124],"domain_scores_gemma":[0.99712056,0.0012452162,0.00026929748,0.0011470541,0.00008251102,0.00013533545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140412,0.00037233642,0.0004093251,0.00016207935,0.00036988457,0.00017662959,0.0015584332,0.00010498117,0.000024962697],"category_scores_gemma":[0.00013572653,0.0002323147,0.00028830656,0.000534148,0.00011611059,0.00014213365,0.0001861393,0.0004789664,0.000058237736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007206067,0.00039868455,0.000009446965,0.000027266422,0.00017803922,0.000075782045,0.002784885,0.03348484,0.0038327384,0.8006373,0.004290729,0.15355967],"study_design_scores_gemma":[0.0024148398,0.0020982346,0.00021983606,0.0001611406,0.000019831283,0.000012763446,0.0000442319,0.96365327,0.0065661776,0.023455488,0.0009452408,0.0004089509],"about_ca_topic_score_codex":0.000019411837,"about_ca_topic_score_gemma":4.3531372e-7,"teacher_disagreement_score":0.93016845,"about_ca_system_score_codex":0.000038101294,"about_ca_system_score_gemma":0.000063341045,"threshold_uncertainty_score":0.9473519},"labels":[],"label_agreement":null},{"id":"W2029495732","doi":"10.1007/s00037-014-0084-1","title":"On the Power of Non-adaptive Learning Graphs","year":2014,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Social Fund; Latvijas Universitate; National Science Foundation","keywords":"Certificate; Computer science; Bounded function; Theoretical computer science; Discrete mathematics; Mathematics; Graph; Upper and lower bounds; Combinatorics","score_opus":0.024800020624360965,"score_gpt":0.2534712184792243,"score_spread":0.22867119785486337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029495732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29855916,0.0000068629593,0.697609,0.00088718504,0.00014717734,0.00008278748,0.0000018281694,0.000072882496,0.0026331495],"genre_scores_gemma":[0.93525654,1.3064563e-7,0.06414158,0.0005399558,0.000031087773,0.0000029755279,0.0000036233773,0.0000071433165,0.000016974634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859154,0.00024624323,0.00022615494,0.00030834595,0.000426932,0.00020075189],"domain_scores_gemma":[0.99797875,0.001314307,0.0001658593,0.0003146254,0.0001685737,0.000057874364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005245308,0.00014651119,0.0001814212,0.00009670521,0.0003570009,0.0000615645,0.00078150706,0.000031186133,0.000021268903],"category_scores_gemma":[0.00012295802,0.00010287027,0.00011317205,0.00038167837,0.00020330344,0.00006385519,0.00024934256,0.0003218038,0.00003446905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058648975,0.000037704882,0.00008183995,0.0000028137292,0.00001241054,6.387501e-7,0.0003996088,0.29995802,0.000015659025,0.6953251,0.00026351507,0.0038968895],"study_design_scores_gemma":[0.000109854234,0.00019156918,0.019919153,0.00001608004,0.0000010908007,0.0000040341683,0.000007750827,0.59134007,0.000032497926,0.38818863,0.00011422844,0.00007505962],"about_ca_topic_score_codex":0.000013024163,"about_ca_topic_score_gemma":9.3544924e-7,"teacher_disagreement_score":0.63669735,"about_ca_system_score_codex":0.000013641215,"about_ca_system_score_gemma":0.000040312345,"threshold_uncertainty_score":0.41949278},"labels":[],"label_agreement":null},{"id":"W2029947519","doi":"10.1038/srep05703","title":"Hearing the Shape of the Ising Model with a Programmable Superconducting-Flux Annealer","year":2014,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"Army Research Office; Engineering and Physical Sciences Research Council; Defense Advanced Research Projects Agency","keywords":"Ising model; Quantum; Hamiltonian (control theory); Partition (number theory); Invariant (physics); Quantum annealing; Adiabatic process; Partition function (quantum field theory)","score_opus":0.023407647060770986,"score_gpt":0.23274145854307274,"score_spread":0.20933381148230176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029947519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90425694,0.000053135907,0.09142023,0.0011251213,0.0018408024,0.00026527923,1.8627966e-7,0.00010520375,0.0009331202],"genre_scores_gemma":[0.9691199,7.66522e-8,0.02988333,0.000072717805,0.000054138185,0.0000063224506,6.483867e-7,0.000010110553,0.00085275073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796045,0.000082370716,0.00032722476,0.0006479587,0.0006237128,0.00035829324],"domain_scores_gemma":[0.9977866,0.000055011133,0.00024947673,0.0016790227,0.00016772955,0.00006218098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002223071,0.0001361711,0.00015377255,0.00006177435,0.0008935031,0.00061629346,0.0008213773,0.00003211944,0.000003218761],"category_scores_gemma":[0.00009498948,0.00006453094,0.00009167585,0.00083965866,0.00037320296,0.00022562289,0.0004676836,0.00021953648,0.0000017424996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061885194,0.00018910754,0.0070662666,0.00010631984,0.000051927873,0.000053759628,0.012151648,0.7905602,0.028672818,0.005139409,0.004347195,0.15165518],"study_design_scores_gemma":[0.000054360247,0.000026867781,0.0003811471,0.0000762071,0.000004833531,0.0002967464,0.00003761303,0.9821851,0.0060948166,0.007635188,0.003099323,0.00010776396],"about_ca_topic_score_codex":0.000041827563,"about_ca_topic_score_gemma":0.000009790378,"teacher_disagreement_score":0.19162495,"about_ca_system_score_codex":0.00001330058,"about_ca_system_score_gemma":0.00020351209,"threshold_uncertainty_score":0.6872194},"labels":[],"label_agreement":null},{"id":"W2031056773","doi":"10.1007/s10994-012-5316-5","title":"Quantum speed-up for unsupervised learning","year":2012,"lang":"en","type":"article","venue":"Machine Learning","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":213,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Cluster analysis; Unsupervised learning; Initialization; Graph; Speedup; Quantum; Quantum machine learning; Theoretical computer science; Quantization (signal processing); Algorithm; Artificial intelligence; Quantum algorithm","score_opus":0.016506940666037247,"score_gpt":0.25622023387617643,"score_spread":0.23971329321013918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031056773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2756375,0.0009996658,0.7194963,0.00086460944,0.0012613751,0.00020957128,0.0000014038399,0.0008387761,0.0006908047],"genre_scores_gemma":[0.96233195,0.000008294269,0.03527698,0.00023312072,0.0006591195,0.0000074490663,0.000016104133,0.000040197152,0.0014267678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980759,0.00020858625,0.00025791366,0.00039536308,0.00026640802,0.0007958121],"domain_scores_gemma":[0.9989432,0.00035695152,0.00013195268,0.00030524548,0.000058558,0.00020405356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009488318,0.00024796702,0.0002599452,0.0001492463,0.0006705517,0.00018912325,0.00064355874,0.00007940943,0.000029171493],"category_scores_gemma":[0.00031701106,0.00021877607,0.00015973973,0.00034878153,0.000029584397,0.00031405236,0.00034185903,0.00067374384,0.00006895092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004948697,0.00020830243,0.09246003,0.00017669704,0.00011223953,0.0000134563315,0.013904688,0.2212991,0.005262007,0.044499494,0.0009265791,0.6210879],"study_design_scores_gemma":[0.00049592904,0.00017181225,0.002745099,0.00002515938,0.000007965884,0.00003455772,0.000047355752,0.9136071,0.00027294716,0.00046178533,0.081840076,0.00029017538],"about_ca_topic_score_codex":0.00005126415,"about_ca_topic_score_gemma":0.000001567702,"teacher_disagreement_score":0.692308,"about_ca_system_score_codex":0.000027352251,"about_ca_system_score_gemma":0.000027256108,"threshold_uncertainty_score":0.89214295},"labels":[],"label_agreement":null},{"id":"W203131757","doi":"10.26421/qic4.3-8","title":"Quantum solution to the hidden subgroup problem for Poly-Near-Hamiltonian groups","year":2004,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Centralizer and normalizer; Abelian group; Combinatorics; Mathematics; Torsion subgroup; Hamiltonian (control theory); Discrete mathematics; Elementary abelian group","score_opus":0.010272693092498425,"score_gpt":0.2373356775268577,"score_spread":0.22706298443435927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203131757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112077706,0.00008453132,0.8752583,0.010996809,0.00047902737,0.00074283325,0.000009826127,0.00027166243,0.00007929673],"genre_scores_gemma":[0.87730944,0.0000070143797,0.120621525,0.0018139827,0.00011016204,0.0000672622,0.000055013094,0.0000098438795,0.000005743695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846125,0.000051784104,0.0005005132,0.00026527786,0.0003431716,0.0003780185],"domain_scores_gemma":[0.9990736,0.000102763785,0.00022878313,0.00026346775,0.00019217152,0.00013919118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057354965,0.00021131261,0.0001733918,0.00017316251,0.00088068465,0.000829428,0.00044571192,0.00007963006,0.0000011082528],"category_scores_gemma":[0.00004301521,0.0001625657,0.00007879769,0.00052381825,0.00005255643,0.0011678142,0.0001714134,0.00016613469,0.00007012631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035382298,0.000050925144,0.00002764985,0.000083697996,0.00002110673,8.6031724e-7,0.013478267,0.06967326,0.000059169095,0.4199247,0.0010552703,0.4955897],"study_design_scores_gemma":[0.0007656727,0.00036022902,0.0034699757,0.000046971796,0.000007039717,0.00004187281,0.00020061493,0.9337915,0.00005290125,0.054453954,0.006568177,0.00024104788],"about_ca_topic_score_codex":0.0001307936,"about_ca_topic_score_gemma":0.000022553639,"teacher_disagreement_score":0.8641183,"about_ca_system_score_codex":0.000074698815,"about_ca_system_score_gemma":0.00012187102,"threshold_uncertainty_score":0.79981935},"labels":[],"label_agreement":null},{"id":"W2031883009","doi":"10.1049/iet-cdt.2013.0055","title":"Challenges and advances in Toffoli network optimisation","year":2013,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Template; Toffoli gate; Computer science; Heuristics; Matching (statistics); Combinatory logic; Computer engineering; Theoretical computer science; Algorithm; Quantum gate; Programming language; Mathematics; Quantum computer; Quantum","score_opus":0.009906054993092708,"score_gpt":0.2286296666313555,"score_spread":0.2187236116382628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031883009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03640666,0.013347097,0.92944694,0.0045390152,0.00048899377,0.0008171826,0.0000018385314,0.002167404,0.012784848],"genre_scores_gemma":[0.6821725,0.001528283,0.3157524,0.0002872985,0.00019016747,0.000037727514,0.000002635688,0.000014222618,0.000014763883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987409,0.00003511609,0.00023872122,0.00046864222,0.00016633874,0.00035024417],"domain_scores_gemma":[0.9992937,0.00016800374,0.000081698156,0.00032580184,0.00004393036,0.00008686813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013937672,0.00019997924,0.0002141319,0.000121609635,0.00006286578,0.00047533508,0.0005231158,0.00007097922,8.57625e-7],"category_scores_gemma":[0.000014067085,0.00017777724,0.000043877153,0.00020274158,0.00006386432,0.0016667036,0.00043045662,0.0001622461,0.000006791176],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.944445e-7,0.0000262089,0.000094375144,0.000013401266,0.0000032097007,0.0000064485685,0.00030341218,0.0006961225,0.000008827246,0.009280731,0.00041946064,0.9891468],"study_design_scores_gemma":[0.00035617588,0.0006152256,0.011075226,0.000554343,0.0000027988665,0.0001895262,0.000045567802,0.6607994,0.00061916775,0.28169206,0.04309858,0.0009519379],"about_ca_topic_score_codex":0.000009111312,"about_ca_topic_score_gemma":0.00000311034,"teacher_disagreement_score":0.9881949,"about_ca_system_score_codex":0.000021126083,"about_ca_system_score_gemma":0.0000137233965,"threshold_uncertainty_score":0.72495455},"labels":[],"label_agreement":null},{"id":"W2032897227","doi":"10.1016/j.tcs.2004.03.041","title":"Quantum computing without entanglement","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Quantum entanglement; Quantum; Quantum computer; Computer science; Theoretical computer science; Theoretical physics; Quantum mechanics; Mathematics; Physics","score_opus":0.008001504721208781,"score_gpt":0.25077498416295135,"score_spread":0.24277347944174257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032897227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1793654,0.000027253996,0.81601983,0.0020566485,0.0010442128,0.00016875338,7.657408e-7,0.00052304025,0.0007941047],"genre_scores_gemma":[0.6645251,0.0000012445792,0.33443487,0.00080895313,0.0002165147,0.0000016032404,4.642082e-7,0.000009610605,0.0000016307627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962432,0.000086966385,0.00041490945,0.0011096242,0.0010997078,0.0010456373],"domain_scores_gemma":[0.99805796,0.000133192,0.00011493308,0.0010799331,0.00017628618,0.00043767912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001569341,0.00031119896,0.00030166504,0.00026233832,0.00092468964,0.00073820335,0.0035566478,0.000054677577,0.000014055706],"category_scores_gemma":[0.000054686407,0.00024983042,0.00011265218,0.0014623404,0.0019550258,0.0004583652,0.002133815,0.00037462657,0.00012036977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027786043,0.000085139196,0.00005813959,0.0000056829185,0.0000048165016,0.00002924453,0.0008286314,0.0135054905,0.00044226923,0.93659604,0.000009128799,0.048432663],"study_design_scores_gemma":[0.00045433178,0.00026438382,0.0007067863,0.000063101885,0.00000317694,0.0001411866,0.000007104252,0.76211596,0.003167511,0.23265044,0.00011322285,0.0003128036],"about_ca_topic_score_codex":0.000010973892,"about_ca_topic_score_gemma":5.62029e-7,"teacher_disagreement_score":0.74861044,"about_ca_system_score_codex":0.00014579772,"about_ca_system_score_gemma":0.0002519785,"threshold_uncertainty_score":0.9999954},"labels":[],"label_agreement":null},{"id":"W2033210979","doi":"10.1093/ietfec/e91-a.12.3793","title":"DDMF: An Efficient Decision Diagram Structure for Design Verification of Quantum Circuits under a Practical Restriction","year":2008,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Quantum; Influence diagram; Electronic circuit; Quantum gate; Theoretical computer science; Quantum computer; Computer engineering; Algorithm; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.061115290802334195,"score_gpt":0.31983708388124715,"score_spread":0.25872179307891296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033210979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17791863,0.0004525035,0.82044226,0.0005973865,0.00013556369,0.00037638276,0.000015352152,0.00005509822,0.0000068395634],"genre_scores_gemma":[0.66034615,0.0005234714,0.33903822,0.000052326912,0.000010401217,0.000018191753,0.0000040315585,0.000006071942,0.0000011258189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981147,0.00024085483,0.00046976772,0.00048187491,0.00039540193,0.0002974133],"domain_scores_gemma":[0.9972999,0.0010800003,0.00030269343,0.0010281696,0.0001930109,0.000096215335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005937161,0.00018371586,0.0002492693,0.0003114617,0.0011364765,0.000105458195,0.0011965574,0.00008494646,0.0000018532126],"category_scores_gemma":[0.0000131420475,0.0001647652,0.00009179643,0.00085967506,0.0005002436,0.00035032225,0.00005214247,0.0002531661,4.5893157e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005443016,0.0015827784,0.000029046441,0.000026754431,0.00006533526,5.391851e-7,0.0015265467,0.54532784,0.004660364,0.14538977,0.00002819601,0.30130842],"study_design_scores_gemma":[0.00037944314,0.002281482,0.0007700729,0.000043620963,0.000018283918,0.00005757508,0.000060863647,0.9862065,0.003318436,0.006585723,0.000108655564,0.0001693853],"about_ca_topic_score_codex":0.00003110826,"about_ca_topic_score_gemma":0.00001250449,"teacher_disagreement_score":0.48242754,"about_ca_system_score_codex":0.000056083372,"about_ca_system_score_gemma":0.0003225105,"threshold_uncertainty_score":0.87409735},"labels":[],"label_agreement":null},{"id":"W2033290519","doi":"10.3389/fphy.2014.00056","title":"Discrete optimization using quantum annealing on sparse Ising models","year":2014,"lang":"en","type":"article","venue":"Frontiers in Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Quantum annealing; Ising model; Qubit; Computation; Computer science; Simulated annealing; Quantum computer; Quantum; Bounded function; Algorithm; Optimization problem; Theoretical computer science; Statistical physics; Mathematics; Quantum mechanics; Physics","score_opus":0.018315933497630003,"score_gpt":0.2351158856493094,"score_spread":0.2167999521516794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033290519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02518734,0.000045710727,0.9729297,0.000105055646,0.0012348195,0.00008656596,0.0000013734978,0.000112925285,0.0002965189],"genre_scores_gemma":[0.43555614,0.0000040997556,0.5640182,0.00014255337,0.00025491454,0.0000011309116,0.0000029811447,0.000015645994,0.0000043567975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870235,0.00010498681,0.00020590678,0.0004119949,0.0002388125,0.00033593067],"domain_scores_gemma":[0.99932235,0.000042357144,0.000111626236,0.0004287587,0.000032705204,0.00006217172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002444098,0.00017529927,0.00021899666,0.00010732213,0.00017099812,0.00014974637,0.00046628856,0.00005423781,2.3979123e-7],"category_scores_gemma":[0.000017391283,0.00017016286,0.000063668704,0.00044084384,0.000036886853,0.00037875382,0.00013594338,0.0002255167,0.0000012178052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036999943,0.000019641497,0.000101870144,0.0000073209812,0.0000050404606,0.0000021269052,0.00043891795,0.9443324,0.000013464539,0.0134665,0.000072340765,0.04153665],"study_design_scores_gemma":[0.00019967077,0.000039699255,0.000018035895,0.000098445234,0.0000033587735,0.0000016093298,0.000016974376,0.90122336,0.00014512627,0.098016165,0.00004149801,0.0001960497],"about_ca_topic_score_codex":0.00002059693,"about_ca_topic_score_gemma":2.5572692e-7,"teacher_disagreement_score":0.4103688,"about_ca_system_score_codex":0.00006105676,"about_ca_system_score_gemma":0.000028860697,"threshold_uncertainty_score":0.69390404},"labels":[],"label_agreement":null},{"id":"W2033296379","doi":"10.1142/s0217979204025543","title":"NON-EQUILIBRIUM STATISTICAL DISTRIBUTION, PROJECT GREEN FUNCTIONS AND STABILIZING QUANTUM COMPUTING FOR OPEN SYSTEM","year":2004,"lang":"en","type":"article","venue":"International Journal of Modern Physics B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Yangzhou University","keywords":"Quantum decoherence; Formalism (music); Liouville equation; Quantum; Boundary value problem; Nonlinear system; Master equation; Statistical physics; Distribution function; Physics; Open system (computing); Quantum mechanics; Computer science","score_opus":0.022758753944175147,"score_gpt":0.2968395088217865,"score_spread":0.27408075487761135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033296379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1230509,0.000043661377,0.87496614,0.00080737495,0.00077884964,0.00019167543,0.00010381946,0.000028072705,0.000029517076],"genre_scores_gemma":[0.94563615,0.0000013186501,0.053625964,0.000049104154,0.00064177223,0.0000031149712,0.00002361147,0.000011698943,0.0000072820944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866086,0.000032584525,0.00043612297,0.00025245972,0.000415678,0.00020228066],"domain_scores_gemma":[0.99858165,0.00018076638,0.00036552927,0.00015367966,0.00063415075,0.00008421044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041305556,0.00014088521,0.00023627136,0.00006255843,0.00015012581,0.0004806381,0.0011320626,0.000034022123,2.3546542e-7],"category_scores_gemma":[0.000039830044,0.00012192285,0.00008812833,0.00011572891,0.000049664402,0.0005211438,0.0005306438,0.00020485953,0.000001085506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024490146,0.00063960155,0.0014304605,0.00019833849,0.00066156074,0.00015176814,0.0043986817,0.25075364,0.0023228189,0.50017524,0.00081012456,0.23821288],"study_design_scores_gemma":[0.0012430162,0.00021386195,0.00077333837,0.00021602961,0.000016529848,0.00028608268,0.00008179878,0.9264245,0.00021655878,0.070234396,0.00015033015,0.00014354783],"about_ca_topic_score_codex":0.0000877863,"about_ca_topic_score_gemma":0.0000025364745,"teacher_disagreement_score":0.8225852,"about_ca_system_score_codex":0.00016265687,"about_ca_system_score_gemma":0.0002998839,"threshold_uncertainty_score":0.49718696},"labels":[],"label_agreement":null},{"id":"W2033826401","doi":"10.1016/j.cplett.2004.10.078","title":"Implementing Grover’s quantum search on a para-hydrogen based pure state NMR quantum computer","year":2004,"lang":"en","type":"article","venue":"Chemical Physics Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Engineering and Physical Sciences Research Council; Mitacs; Rhodes Scholarships","keywords":"Singlet state; State (computer science); Quantum computer; Quantum; One-way quantum computer; Qubit; Quantum chemical; Quantum mechanics; Quantum state; Physics; Spin (aerodynamics); Function (biology); Chemistry; Quantum error correction; Algorithm; Mathematics; Thermodynamics; Excited state; Molecule","score_opus":0.016463978287917572,"score_gpt":0.24851653906696805,"score_spread":0.23205256077905048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033826401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52350706,0.000007725833,0.4647501,0.011198886,0.00013492955,0.0001463913,0.000009665409,0.00022974578,0.00001551213],"genre_scores_gemma":[0.94419473,0.0000011519307,0.034329403,0.02083693,0.0005383157,0.000013111983,0.00003450402,0.000049528993,0.0000023357218],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655366,0.000080162135,0.00039832434,0.000978617,0.00075909216,0.0012301484],"domain_scores_gemma":[0.9984884,0.0001980072,0.00014443789,0.0008490426,0.00006181973,0.00025826436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032671055,0.0004326933,0.0003754295,0.00009034126,0.00029617947,0.00027273584,0.0012934932,0.00006425782,0.000003854877],"category_scores_gemma":[0.000010977645,0.00039972056,0.0002771456,0.00055487984,0.00013496137,0.00021485926,0.0005975518,0.0007376462,0.00008811118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044178927,0.0006089535,0.00011665091,0.000114967654,0.00013462409,0.00020190713,0.0013436914,0.36822838,0.5538473,0.027606351,0.005070699,0.042682298],"study_design_scores_gemma":[0.0013071556,0.00014692948,0.00008718574,0.00012359911,0.000008820823,0.000011638807,0.0000046872738,0.80351925,0.18107782,0.011222412,0.0018564983,0.0006340237],"about_ca_topic_score_codex":0.000042840475,"about_ca_topic_score_gemma":4.839393e-7,"teacher_disagreement_score":0.43529087,"about_ca_system_score_codex":0.00015175299,"about_ca_system_score_gemma":0.00010160209,"threshold_uncertainty_score":0.99984545},"labels":[],"label_agreement":null},{"id":"W2034218694","doi":"10.1080/03081080802677441","title":"Research problems on numerical ranges in quantum computing","year":2009,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Sherbrooke; University of Guelph; University of Waterloo","funders":"","keywords":"Range (aeronautics); Relevance (law); Computer science; Mathematics; Focus (optics); Scholarship; Rank (graph theory); Numerical analysis; Physics; Combinatorics; Engineering; Mathematical analysis; Optics","score_opus":0.031093498911989658,"score_gpt":0.3246782008556739,"score_spread":0.29358470194368425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034218694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92903554,0.000461745,0.06445344,0.0044717253,0.00026724997,0.00040677984,0.0000022538245,0.00031942903,0.0005818469],"genre_scores_gemma":[0.9675424,0.00003431527,0.031517677,0.00054778747,0.00028676278,0.0000025620882,0.0000028678603,0.000013322316,0.00005230688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976904,0.0002386694,0.00032593778,0.0006685657,0.00044332957,0.00063311186],"domain_scores_gemma":[0.99886125,0.00039471,0.000051552346,0.00043736136,0.00008464367,0.00017047269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010660753,0.00021173226,0.00028518468,0.00032321265,0.00024862814,0.00014724673,0.00056061405,0.000111855516,0.0000031823354],"category_scores_gemma":[0.000119795695,0.00017384699,0.00006131957,0.00076453,0.00007697361,0.000110162604,0.00021700021,0.00084101973,0.000044021872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008060194,0.00089259935,0.0010214791,0.000068320354,0.000019872248,0.00019234967,0.0060792165,0.055347886,0.0013802673,0.0363057,0.00042869235,0.898183],"study_design_scores_gemma":[0.00068837596,0.0004716014,0.01003856,0.00010524522,0.0000011665664,0.000022654776,0.000037135436,0.983202,0.00060576876,0.0025601068,0.0020605845,0.00020682739],"about_ca_topic_score_codex":0.000073845375,"about_ca_topic_score_gemma":0.0000043051373,"teacher_disagreement_score":0.92785406,"about_ca_system_score_codex":0.000022785065,"about_ca_system_score_gemma":0.00004322051,"threshold_uncertainty_score":0.70892745},"labels":[],"label_agreement":null},{"id":"W2035288980","doi":"10.1103/physrevlett.110.190502","title":"Asymptotically Optimal Approximation of Single Qubit Unitaries by Clifford and<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\"><mml:mi>T</mml:mi></mml:math>Circuits Using a Constant Number of Ancillary Qubits","year":2013,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Qubit; Upper and lower bounds; Unitary state; Sequence (biology); Algorithm; Quantum computer; Gate count; Discrete mathematics; Computer science; Mathematics; Quantum; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.015607386549846794,"score_gpt":0.24618419772169922,"score_spread":0.2305768111718524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035288980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95313907,0.0007201144,0.0448698,0.0009603018,0.000100793695,0.00008742246,0.000015846897,0.00004669673,0.000059952476],"genre_scores_gemma":[0.9741508,0.00017499067,0.023725335,0.0017633033,0.000113796676,0.00002388039,0.000019716226,0.000027396163,8.2372424e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982547,0.00008905103,0.00047403903,0.00037378963,0.0004650851,0.00034330133],"domain_scores_gemma":[0.9986544,0.00032822991,0.00040318092,0.00041776733,0.00007350501,0.0001228773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028382713,0.00021159924,0.00031075047,0.000030108125,0.00015044666,0.00011820919,0.00038487095,0.000056357683,0.0000025180525],"category_scores_gemma":[0.00016553908,0.00020384496,0.00020691234,0.00026705407,0.00034531028,0.00032449732,0.0003203673,0.00024080608,0.000034645873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005382824,0.00012453242,0.000011687928,0.0010050193,0.00005574215,0.000010216327,0.0003451959,0.0008139716,0.015049976,0.97600704,0.00009241481,0.006478792],"study_design_scores_gemma":[0.00016073836,0.00013064,0.00004381581,0.0014590597,0.000070069844,0.000078031604,0.000014819462,0.99527806,0.0018646419,0.0004846102,0.00022333197,0.00019217754],"about_ca_topic_score_codex":0.000054766824,"about_ca_topic_score_gemma":0.0000011077345,"teacher_disagreement_score":0.9944641,"about_ca_system_score_codex":0.000009023267,"about_ca_system_score_gemma":0.000077810895,"threshold_uncertainty_score":0.8312556},"labels":[],"label_agreement":null},{"id":"W2035452705","doi":"10.1142/s012962641000020x","title":"A QUANTUM CRYPTOGRAPHIC SOLUTION TO THE PROBLEM OF ACCESS CONTROL IN A HIERARCHY","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Hierarchy; Computer science; Access control; Cryptography; Collusion; Scheme (mathematics); Theoretical computer science; Computer security; Identity (music); Computer access control; Key (lock); Mathematics","score_opus":0.012077556865887523,"score_gpt":0.25034125917883915,"score_spread":0.23826370231295163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035452705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2969018,0.000060001516,0.66675115,0.03576716,0.00012605726,0.0002785977,8.027555e-7,0.00007815599,0.00003626716],"genre_scores_gemma":[0.8943051,0.0000011838983,0.10139857,0.0041349274,0.00009678451,0.00004949401,5.34829e-7,0.0000109931125,0.0000024073618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983808,0.00009667097,0.00033941874,0.0004176108,0.0003217352,0.00044377535],"domain_scores_gemma":[0.9991849,0.000101334444,0.00017074599,0.00039630284,0.000064054075,0.00008268298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006597742,0.00017469288,0.00021804101,0.00030330027,0.00020828797,0.00030010918,0.00164963,0.00005451669,0.0000016497155],"category_scores_gemma":[0.000027942095,0.00012197505,0.000074804775,0.0010881551,0.00012028782,0.0003219152,0.00023797574,0.0005206274,0.0000046119612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016025927,0.00048727618,0.015236047,0.00047738667,0.00006744778,0.00005756393,0.01572963,0.23701942,0.19793794,0.014513273,0.0033016328,0.5150121],"study_design_scores_gemma":[0.00065941346,0.00005671308,0.016510064,0.00012407033,0.0000053298127,0.000022416714,0.000008215277,0.9759807,0.00014793305,0.0043767253,0.0018686916,0.00023975082],"about_ca_topic_score_codex":0.00012973075,"about_ca_topic_score_gemma":0.00008221457,"teacher_disagreement_score":0.7389613,"about_ca_system_score_codex":0.000010864859,"about_ca_system_score_gemma":0.000079648846,"threshold_uncertainty_score":0.49739984},"labels":[],"label_agreement":null},{"id":"W2035569169","doi":"10.1109/isit.2010.5513648","title":"Multi-error-correcting amplitude damping codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"","keywords":"Amplitude; Luby transform code; Degenerate energy levels; Fountain code; Block code; Online codes; Quantum","score_opus":0.0193531739028368,"score_gpt":0.27642505927313626,"score_spread":0.25707188537029946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035569169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3089572,0.000011296524,0.6880513,0.0004038896,0.0012183433,0.000056875902,3.5672196e-7,0.0004970406,0.0008037437],"genre_scores_gemma":[0.5458858,2.3429142e-7,0.45355394,0.00026067835,0.00012186339,0.0000020338985,4.4462948e-7,0.000006379688,0.00016862863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881446,0.000031383537,0.00018539293,0.00042903665,0.0001756218,0.00036408845],"domain_scores_gemma":[0.9990543,0.00017183014,0.00006493285,0.00054259703,0.00005321873,0.00011312688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036471128,0.0001479495,0.00014224462,0.00008337013,0.00029076447,0.00028542196,0.0008866764,0.000062110754,0.00002191592],"category_scores_gemma":[0.00010806385,0.00011960771,0.00006904132,0.00025989418,0.000038726303,0.00017387234,0.0004007298,0.00047375067,0.000058444963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002953987,0.00022587615,0.007132563,0.000028576324,0.0000381058,0.0000495928,0.0043203337,0.0061883265,0.090094335,0.027864067,0.00054468913,0.8635106],"study_design_scores_gemma":[0.00017627947,0.000020652395,0.0057469294,0.000013519061,0.0000015138834,0.00009997291,0.00003166689,0.98698455,0.0040364717,0.00071463746,0.001956485,0.00021731187],"about_ca_topic_score_codex":0.00010570656,"about_ca_topic_score_gemma":0.0001081716,"teacher_disagreement_score":0.9807962,"about_ca_system_score_codex":0.0000071738286,"about_ca_system_score_gemma":0.000037264566,"threshold_uncertainty_score":0.48774606},"labels":[],"label_agreement":null},{"id":"W2036262054","doi":"10.1155/2010/365653","title":"Quantum Computing in Decoherence‐Free Subspace Constructed by Triangulation","year":2010,"lang":"en","type":"article","venue":"Advances in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Quantum decoherence; Linear subspace; Decoherence-free subspaces; Subspace topology; Formalism (music); Quantum operation; Quantum; Quantum mechanics; Mathematics; Open quantum system; Pure mathematics; Computer science; Physics; Mathematical analysis","score_opus":0.006406450223907538,"score_gpt":0.26254623476667277,"score_spread":0.25613978454276526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036262054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33504063,0.00009929714,0.6634383,0.00020436653,0.0002727967,0.00016447323,0.0000022626662,0.00010077767,0.0006770418],"genre_scores_gemma":[0.7889101,0.000005807468,0.21092847,0.0000521244,0.00007943049,0.0000047740714,0.0000026123055,0.000010702591,0.0000059630065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984587,0.00007315378,0.00041025784,0.0003991091,0.0002830949,0.00037567416],"domain_scores_gemma":[0.998468,0.00069838576,0.00014934703,0.0005725158,0.000039405728,0.00007237813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036548718,0.00019006903,0.00031577266,0.00006725251,0.00006984145,0.000088722365,0.00085536717,0.00007900125,0.000008552883],"category_scores_gemma":[0.00028124783,0.00017033021,0.000051038864,0.00068947644,0.00013510164,0.00044447798,0.00024852375,0.0005588146,0.0000152019775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006729877,0.0002796265,0.0016521228,0.00008890211,0.000004687286,0.00001544374,0.0012132652,0.0075178645,0.0024562709,0.79918593,0.00008279438,0.18749635],"study_design_scores_gemma":[0.00036705937,0.000017654607,0.0003572042,0.000055548495,9.030781e-7,0.0000064078795,0.000018031866,0.54547846,0.00043313106,0.45306107,0.000074226686,0.00013029344],"about_ca_topic_score_codex":0.000006934063,"about_ca_topic_score_gemma":0.000021317,"teacher_disagreement_score":0.5379606,"about_ca_system_score_codex":0.00002167841,"about_ca_system_score_gemma":0.000035725297,"threshold_uncertainty_score":0.6945864},"labels":[],"label_agreement":null},{"id":"W2036449859","doi":"10.1103/physreva.90.032310","title":"Evolutionary algorithms for hard quantum control","year":2014,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Calgary","funders":"Engineering and Physical Sciences Research Council; Macquarie University; Alberta Innovates - Technology Futures; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Quantum control; Greedy algorithm; Computer science; Algorithm; Qutrit; Quantum computer; Evolutionary algorithm; Quantum; Trap (plumbing); Control (management); Greedy randomized adaptive search procedure; Genetic algorithm; Qubit; Artificial intelligence; Physics; Machine learning","score_opus":0.0165994554248127,"score_gpt":0.2871237582114486,"score_spread":0.27052430278663586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036449859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001125166,0.006284109,0.9849503,0.0064930646,0.00029305613,0.00046786014,0.0000063288226,0.00019840876,0.00018170192],"genre_scores_gemma":[0.77085,0.00097537437,0.2091048,0.015482302,0.002996576,0.00039196952,0.000014405993,0.000052372437,0.00013218181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986444,0.00012155621,0.00021642588,0.0004312317,0.00024837698,0.00033802362],"domain_scores_gemma":[0.99866575,0.00049235485,0.000099389654,0.00051311514,0.000100848185,0.00012855728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003681785,0.00017423632,0.00041634627,0.000027090993,0.00014418518,0.000046491896,0.0006868254,0.000020308664,0.0000022378867],"category_scores_gemma":[0.00024658593,0.00013115621,0.000287172,0.00022404478,0.000039800045,0.0001148927,0.00010931458,0.00014639956,0.000070485796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004784072,0.00021537392,0.00001814793,0.0007474985,0.00003574081,0.000001978814,0.000063469415,0.0005828062,0.00024819502,0.38726977,0.011660473,0.59915173],"study_design_scores_gemma":[0.0002923435,0.00016023645,0.00044745975,0.00036115025,0.000018686851,0.0000074104646,2.2878176e-7,0.8363741,0.000021379901,0.068840176,0.09331366,0.00016319747],"about_ca_topic_score_codex":0.0000036628112,"about_ca_topic_score_gemma":7.823483e-8,"teacher_disagreement_score":0.8357913,"about_ca_system_score_codex":0.000017009655,"about_ca_system_score_gemma":0.000037743757,"threshold_uncertainty_score":0.53483945},"labels":[],"label_agreement":null},{"id":"W2037354050","doi":"10.1103/physrevlett.101.130504","title":"Quantum Simulations of Classical Annealing Processes","year":2008,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":177,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum annealing; Quantum; Simulated annealing; Quadratic equation; Quantum algorithm; Bounded function; Quantum walk; Quantum process; Statistical physics; Physics; Computer science; Quantum mechanics; Mathematics; Algorithm; Quantum dynamics; Mathematical analysis","score_opus":0.025460042154792296,"score_gpt":0.28962865701211055,"score_spread":0.26416861485731824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037354050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72120094,0.004307,0.25446394,0.019438915,0.00012598287,0.00023927404,0.0000051645675,0.00016998989,0.000048830898],"genre_scores_gemma":[0.9877055,0.0004979661,0.0069454797,0.00466467,0.00016797212,0.000004892135,0.0000025378984,0.000008264681,0.000002703213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989084,0.00006669594,0.00024235297,0.00027786675,0.0002927859,0.00021191264],"domain_scores_gemma":[0.99904364,0.00033585995,0.00012315251,0.00034744095,0.00007568008,0.00007424841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007555898,0.00013114326,0.00032503429,0.00003673636,0.00011665283,0.000013959261,0.0005006934,0.000007033889,0.0000020595367],"category_scores_gemma":[0.0001460908,0.00010127957,0.00012382514,0.0006168509,0.00009873912,0.00013977756,0.000118656615,0.00015903314,0.000013608667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026781458,0.003249271,0.0028247328,0.024310593,0.00039154745,0.0004079648,0.010063134,0.60452926,0.07587736,0.07510407,0.049805637,0.15340962],"study_design_scores_gemma":[0.000109806526,0.000051295032,0.0006065546,0.00093674124,0.00001401719,0.00002336552,6.758508e-7,0.9919967,0.00060628215,0.00089088234,0.0045744106,0.00018928442],"about_ca_topic_score_codex":0.0000035147302,"about_ca_topic_score_gemma":2.0038917e-7,"teacher_disagreement_score":0.3874674,"about_ca_system_score_codex":0.00000913036,"about_ca_system_score_gemma":0.000055123342,"threshold_uncertainty_score":0.4130061},"labels":[],"label_agreement":null},{"id":"W2037684769","doi":"10.1063/1.3075830","title":"On polynomial invariants of several qubits","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Quantum entanglement; Multipartite; Gröbner basis; Ideal (ethics); Connection (principal bundle); Polynomial; Multipartite entanglement","score_opus":0.011690463929672018,"score_gpt":0.24446881003785043,"score_spread":0.2327783461081784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037684769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19594435,0.000012754607,0.8016528,0.0010325724,0.00019038758,0.000037794787,7.585133e-7,0.000014224797,0.00111437],"genre_scores_gemma":[0.9056103,0.0000010442254,0.093756355,0.00032153827,0.0002886102,6.8573016e-8,6.572235e-8,0.000004209839,0.000017807406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998874,0.00004726313,0.00041182162,0.000095149626,0.00041478884,0.00015696682],"domain_scores_gemma":[0.99901265,0.00023284579,0.00034508322,0.00022234728,0.00009450067,0.00009256606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029807774,0.00010597417,0.00031071593,0.000051737254,0.00003612709,0.000040925406,0.00056554953,0.000036553447,0.0000051991888],"category_scores_gemma":[0.0001042327,0.000073937685,0.00015641865,0.00017495437,0.000027214883,0.00015121089,0.000055175078,0.00026338728,0.000011509733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007809665,0.0017478652,0.000004994445,0.000071625225,0.00007985073,0.000097898184,0.0023873476,0.02678889,0.0030718918,0.8114777,0.005755918,0.14843789],"study_design_scores_gemma":[0.0004810706,0.0008220596,0.00037879273,0.00019693727,0.000009487138,0.00011196166,0.000004628325,0.29446074,0.002520672,0.70087695,0.000030540083,0.00010616382],"about_ca_topic_score_codex":2.1731603e-7,"about_ca_topic_score_gemma":1.5631821e-8,"teacher_disagreement_score":0.70966595,"about_ca_system_score_codex":0.000014858453,"about_ca_system_score_gemma":0.00006408409,"threshold_uncertainty_score":0.3015091},"labels":[],"label_agreement":null},{"id":"W2038255135","doi":"10.1016/j.jcss.2007.06.016","title":"Lower bounds for predecessor searching in the cell probe model","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Upper and lower bounds; Computer science; Quantum; Query optimization; Mathematics; Theoretical computer science; Discrete mathematics; Information retrieval","score_opus":0.01952030531597196,"score_gpt":0.27433301713273067,"score_spread":0.2548127118167587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038255135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23461498,0.00025133038,0.7637489,0.0005007949,0.00045760095,0.00012872927,3.7767938e-7,0.000010895357,0.0002863804],"genre_scores_gemma":[0.7739232,0.0000019993677,0.2256756,0.00013673634,0.00024739883,8.97155e-7,2.9660947e-8,0.00000238995,0.0000116975225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983827,0.000098234144,0.00045862285,0.00021154231,0.00052690745,0.00032199855],"domain_scores_gemma":[0.99895227,0.00046995262,0.0002548271,0.00014637115,0.000100459096,0.00007613495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066472786,0.000108186636,0.00020618734,0.00023994995,0.0003497059,0.00062749966,0.0013031933,0.000032215088,7.5987174e-8],"category_scores_gemma":[0.000009447032,0.00005852637,0.00008696586,0.0003960332,0.00009161047,0.0003637416,0.0001320169,0.00019300189,2.2729334e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010536807,0.0005333217,0.0027647917,0.00076256396,0.00004203426,0.00029103542,0.059773788,0.5681447,0.000895001,0.096374966,0.0015026232,0.26880985],"study_design_scores_gemma":[0.0003024471,0.00045397092,0.0008467063,0.0001404802,0.000002695207,0.00036651437,0.00023482664,0.99477375,0.000069524525,0.002525191,0.00019922461,0.000084693806],"about_ca_topic_score_codex":0.0000047728877,"about_ca_topic_score_gemma":0.0000033446854,"teacher_disagreement_score":0.53930825,"about_ca_system_score_codex":0.00002519675,"about_ca_system_score_gemma":0.00017451683,"threshold_uncertainty_score":0.6050993},"labels":[],"label_agreement":null},{"id":"W2038713182","doi":"10.1103/physreva.67.062311","title":"Pattern recognition on a quantum computer","year":2003,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Speedup; Quantum Fourier transform; Quantum; Computer science; Simple (philosophy); Quantum computer; Fourier transform; Task (project management); Quantum algorithm; Algorithm; Quantum sort; Exponential function; Quantum phase estimation algorithm; Theoretical computer science; Mathematics; Quantum error correction; Parallel computing; Physics; Quantum mechanics; Engineering; Mathematical analysis","score_opus":0.022092811124148418,"score_gpt":0.2783849534225951,"score_spread":0.2562921422984467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038713182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0656752,0.002798338,0.92335945,0.0041298834,0.00070909,0.00051281875,0.0000035371709,0.00039446595,0.0024172268],"genre_scores_gemma":[0.9539759,0.0011061267,0.024821218,0.019307721,0.0006825719,0.00004934401,0.0000066261528,0.000029760637,0.000020742751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876195,0.0001925532,0.00016731813,0.0003867634,0.00024258855,0.00024884648],"domain_scores_gemma":[0.9992009,0.00015776083,0.000074462136,0.00042590394,0.00004276372,0.00009824062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002027141,0.00016159104,0.00026826543,0.000030645373,0.000076906304,0.00005803283,0.00035094298,0.0000156142,0.000010125323],"category_scores_gemma":[0.000052373372,0.00012024955,0.00015896207,0.00029015387,0.000018888391,0.000079676785,0.00007037206,0.00021175889,0.0005077578],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.6269662e-7,0.0001836955,0.0000074419067,0.00018598515,0.000008476748,0.000012866719,0.00006781279,0.000065837114,0.000017781833,0.014916914,0.0017797616,0.982753],"study_design_scores_gemma":[0.00040591497,0.00067733816,0.00061613624,0.0038382218,0.000025984176,0.0000656415,0.0000010108648,0.8391125,0.00053054385,0.08529845,0.0687846,0.0006436522],"about_ca_topic_score_codex":0.0000026295725,"about_ca_topic_score_gemma":1.393525e-7,"teacher_disagreement_score":0.9821093,"about_ca_system_score_codex":0.0000137336065,"about_ca_system_score_gemma":0.000021484828,"threshold_uncertainty_score":0.6526369},"labels":[],"label_agreement":null},{"id":"W2038726985","doi":"10.1103/physrevlett.90.087902","title":"Substituting a Qubit for an Arbitrarily Large Number of Classical Bits","year":2003,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Qubit; Quantum entanglement; Quantum; Simple (philosophy); Point (geometry); Task (project management); ENCODE; Computer science; Physics; Quantum computer; Computation; Topology (electrical circuits); Quantum mechanics; Mathematics; Algorithm; Combinatorics","score_opus":0.020598928530821774,"score_gpt":0.30908501180071873,"score_spread":0.28848608326989694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038726985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3650983,0.0013739812,0.6269061,0.004876445,0.0003126894,0.0006277556,0.000010028191,0.00015861352,0.00063607027],"genre_scores_gemma":[0.90292686,0.00008537643,0.08110176,0.015532668,0.00027611287,0.00004187698,0.0000051730435,0.000022296988,0.000007860438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998461,0.00014970757,0.00028868826,0.0004273708,0.00025949036,0.0004137373],"domain_scores_gemma":[0.99894667,0.000249148,0.00014357534,0.0004785231,0.00005185303,0.0001302597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040268348,0.00018441337,0.00043565204,0.000024936619,0.00010588451,0.000042527172,0.0005349633,0.000013771438,0.0000035328492],"category_scores_gemma":[0.00014876774,0.00014701686,0.00025988137,0.00035781533,0.00005712222,0.00017804222,0.0000700834,0.00020740183,0.000019503179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009771791,0.001151579,0.00048595917,0.0025657788,0.00009178703,0.000020069032,0.0007914538,0.00087902584,0.015192522,0.9212081,0.005664739,0.051939227],"study_design_scores_gemma":[0.0015004363,0.00031897938,0.000781494,0.002895773,0.00012006795,0.000089150875,0.0000065259546,0.81477416,0.003965497,0.017424047,0.15699576,0.0011281208],"about_ca_topic_score_codex":0.0000029724647,"about_ca_topic_score_gemma":6.2090254e-7,"teacher_disagreement_score":0.90378404,"about_ca_system_score_codex":0.000013979282,"about_ca_system_score_gemma":0.00004498717,"threshold_uncertainty_score":0.5995174},"labels":[],"label_agreement":null},{"id":"W2039034095","doi":"10.1103/physreva.89.052337","title":"Spatial search by continuous-time quantum walks on crystal lattices","year":2014,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Quantum walk; Quantum; Statistical physics; Physics; Computer science; Quantum mechanics; Quantum computer","score_opus":0.008669699826467637,"score_gpt":0.26807695553170124,"score_spread":0.2594072557052336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039034095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5118321,0.008979362,0.44583684,0.021185746,0.00073791423,0.0013721571,0.000025331772,0.0011156752,0.008914887],"genre_scores_gemma":[0.9946245,0.00022879905,0.001755318,0.0026698022,0.00055052136,0.000013991752,0.0000065194467,0.000020840436,0.000129691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980682,0.00029218095,0.00022208248,0.0005138402,0.0004931295,0.00041052955],"domain_scores_gemma":[0.9986517,0.00044542813,0.00009029638,0.0005848193,0.00005753476,0.00017023923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044614155,0.00021720925,0.0004746291,0.000029955767,0.00012967201,0.00012021423,0.000860382,0.000026561922,0.00001749696],"category_scores_gemma":[0.00013194629,0.00015873,0.00018277125,0.00022911643,0.000060000915,0.00009817338,0.0002653576,0.00033155186,0.00052748615],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011150801,0.00059207727,0.00002871113,0.0006453074,0.000037431142,0.000010731281,0.00029008114,0.00020776565,0.004349341,0.04513547,0.012894091,0.93579787],"study_design_scores_gemma":[0.0002200832,0.00071670476,0.00021370019,0.0009587352,0.000015298929,0.000006650796,7.040878e-7,0.9282212,0.00068582024,0.0053277104,0.06332197,0.00031138022],"about_ca_topic_score_codex":0.000037956797,"about_ca_topic_score_gemma":4.865245e-7,"teacher_disagreement_score":0.93548644,"about_ca_system_score_codex":0.000014956774,"about_ca_system_score_gemma":0.000027233293,"threshold_uncertainty_score":0.6779943},"labels":[],"label_agreement":null},{"id":"W2039510779","doi":"10.1007/s00145-008-9025-y","title":"New Binding-Concealing Trade-Offs for Quantum String Commitment","year":2008,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Deutscher Akademischer Austauschdienst","keywords":"Commitment scheme; Commit; String (physics); Alice (programming language); Cheating; Alice and Bob; Qubit; Protocol (science); Coin flipping; Computer science; Bit array; Scheme (mathematics); Discrete mathematics; Quantum; Mathematics; Cryptography; Physics; Computer security; Theoretical physics; Quantum mechanics; Statistics; Psychology; Social psychology","score_opus":0.027778373236847367,"score_gpt":0.27185279765684867,"score_spread":0.2440744244200013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039510779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27252713,0.00037205731,0.72195613,0.0038185844,0.0011987828,0.00007228641,8.624017e-7,0.000029039209,0.000025130452],"genre_scores_gemma":[0.62281215,0.00003605937,0.37619475,0.000281853,0.0006431406,9.539475e-7,4.2917287e-7,0.000010813121,0.000019877603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986308,0.000071192524,0.0005337073,0.00018459899,0.00022584786,0.00035383768],"domain_scores_gemma":[0.9987267,0.00035703517,0.0004611078,0.00020927614,0.00006707959,0.0001787899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003632178,0.00014456593,0.00039717794,0.00021276363,0.00023400433,0.00004159931,0.0007855546,0.00008220349,0.000005175806],"category_scores_gemma":[0.000065923414,0.00011690268,0.00020582504,0.00019236837,0.00004742002,0.00016243102,0.000090183974,0.00032552856,0.000002818439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027985888,0.00045510175,0.0056305234,0.000111085494,0.0005693825,0.0017166149,0.012095768,0.034456104,0.009527862,0.46456748,0.0486235,0.42196673],"study_design_scores_gemma":[0.009394759,0.0058360444,0.009472947,0.00034885408,0.00009703806,0.025160851,0.00020631196,0.68752825,0.015245892,0.113695644,0.13185862,0.0011547862],"about_ca_topic_score_codex":0.0000053014796,"about_ca_topic_score_gemma":9.852379e-7,"teacher_disagreement_score":0.6530722,"about_ca_system_score_codex":0.000042441723,"about_ca_system_score_gemma":0.0002531677,"threshold_uncertainty_score":0.4767153},"labels":[],"label_agreement":null},{"id":"W2040175558","doi":"10.1103/physreva.88.052307","title":"Optimization of Clifford circuits","year":2013,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Electronic circuit; Computer science; Permutation (music); Benchmarking; Quantum; Algorithm; Electrical engineering","score_opus":0.01216514216884078,"score_gpt":0.26597282750146,"score_spread":0.2538076853326192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040175558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017537823,0.0045846133,0.973439,0.0020733953,0.00010346122,0.00036602872,5.116269e-7,0.000104745384,0.0017904369],"genre_scores_gemma":[0.93838304,0.0013841438,0.05848364,0.0015134481,0.00016163895,0.000032603606,0.0000018316722,0.000009995853,0.000029679717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993731,0.000040009105,0.00015011433,0.00016244614,0.0001520011,0.00012235748],"domain_scores_gemma":[0.9994299,0.000063102474,0.000084587984,0.00029726155,0.00007351667,0.000051630348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073105955,0.00007291675,0.00020220394,0.000017079048,0.000026397347,0.000022617909,0.00038204016,0.000008623427,0.000013884379],"category_scores_gemma":[0.000051749157,0.000053016247,0.00008759286,0.00029019362,0.00001944592,0.00012745516,0.00010614882,0.00006896386,0.000050781047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.1736844e-7,0.00014294984,0.000027646089,0.0006501507,0.000011233223,8.501704e-7,0.00013344457,0.018675685,0.0003507624,0.026598977,0.0012677496,0.95214045],"study_design_scores_gemma":[0.00005171759,0.00004836781,0.00039353932,0.0005368591,0.000005635096,0.000002680314,3.7716012e-7,0.9892011,0.00021227062,0.00858159,0.0008809311,0.00008489313],"about_ca_topic_score_codex":0.00000778578,"about_ca_topic_score_gemma":3.0831913e-8,"teacher_disagreement_score":0.97052544,"about_ca_system_score_codex":0.0000044695207,"about_ca_system_score_gemma":0.00001607626,"threshold_uncertainty_score":0.21619397},"labels":[],"label_agreement":null},{"id":"W2041497060","doi":"10.1038/nature08121","title":"Demonstration of two-qubit algorithms with a superconducting quantum processor","year":2009,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1179,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; University of Waterloo","funders":"","keywords":"Quantum computer; Qubit; Computer science; Quantum logic; Quantum entanglement; Quantum error correction; One-way quantum computer; Quantum mechanics; Physics; Quantum; Topology (electrical circuits); Parallel computing; Electrical engineering; Engineering","score_opus":0.009038724894579348,"score_gpt":0.25863148537126546,"score_spread":0.2495927604766861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041497060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72785825,0.00084312644,0.26450315,0.0048741335,0.00032384534,0.00028098447,0.0000044887533,0.0003411412,0.0009708917],"genre_scores_gemma":[0.84587413,0.0000021571718,0.15349236,0.00044689784,0.00014489998,0.0000019130084,0.0000032648275,0.000006808676,0.000027544822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998689,0.000039652856,0.00020942552,0.00039557568,0.00038927043,0.00027706748],"domain_scores_gemma":[0.9992078,0.000053810836,0.00012384028,0.00035303851,0.00019044233,0.00007108214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022484265,0.00017438672,0.0002072316,0.00011329078,0.00010405102,0.000082523315,0.00058660185,0.00031471098,0.0000017316711],"category_scores_gemma":[0.000031784668,0.0001261027,0.00005426826,0.0006604931,0.000039990155,0.00034675133,0.000047032157,0.0013450487,0.0000020455284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069356676,0.0004775145,0.0007508725,0.00012470518,0.000078003206,0.00014008845,0.004886088,0.009896892,0.086890906,0.13873638,0.0006202977,0.75732887],"study_design_scores_gemma":[0.0011618572,0.0007682159,0.0023760211,0.00020574451,0.000018991921,0.00039910566,0.000097918135,0.90977514,0.06992315,0.01436173,0.0004104037,0.00050174457],"about_ca_topic_score_codex":0.000008693692,"about_ca_topic_score_gemma":0.0000030268861,"teacher_disagreement_score":0.8998782,"about_ca_system_score_codex":0.0000141789,"about_ca_system_score_gemma":0.000108093365,"threshold_uncertainty_score":0.5843642},"labels":[],"label_agreement":null},{"id":"W2042830710","doi":"10.1038/nphys134","title":"Is information the key?","year":2005,"lang":"en","type":"article","venue":"Nature Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Physics; Key (lock); Data science; Computer security; Computer science","score_opus":0.005222818898537494,"score_gpt":0.22883488846470298,"score_spread":0.2236120695661655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042830710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01817692,0.00036320434,0.93367475,0.040121216,0.0007556087,0.00015411082,0.000005444085,0.00031705364,0.00643168],"genre_scores_gemma":[0.9435196,0.0000046743376,0.042146493,0.013418368,0.00084236014,0.0000022600284,0.0000026149019,0.0000037453876,0.000059898608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942136,0.00001590699,0.00008755618,0.00010158199,0.00022828659,0.00014533549],"domain_scores_gemma":[0.99944955,0.000043721215,0.000053716503,0.0003685465,0.000057748977,0.000026725449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009059195,0.00008095072,0.000056254863,0.00001652298,0.00015658341,0.00015984668,0.0006465244,0.00006876648,0.0000024145777],"category_scores_gemma":[0.000010050205,0.000049194725,0.000053072014,0.00028117432,0.00001802147,0.0004986042,0.00014250955,0.0005081905,0.000116810654],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.1036575e-7,0.000014947236,0.000014236447,0.0000038273092,0.000007885631,2.9361786e-7,0.004351175,0.004883222,0.00002330066,0.10881366,0.013473792,0.86841285],"study_design_scores_gemma":[0.000083451174,0.0000111591835,0.00045972335,0.0000055456508,0.0000017745521,0.0000051393613,0.0000050697695,0.65836,0.001415818,0.011157533,0.32841274,0.000082028746],"about_ca_topic_score_codex":0.0000020332043,"about_ca_topic_score_gemma":4.3136552e-7,"teacher_disagreement_score":0.9253427,"about_ca_system_score_codex":0.000012309243,"about_ca_system_score_gemma":0.000024368564,"threshold_uncertainty_score":0.22078629},"labels":[],"label_agreement":null},{"id":"W2043137390","doi":"10.1103/physreva.80.032301","title":"Quantum repeaters with imperfect memories: Cost and scalability","year":2009,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Computer science; Scalability; Probabilistic logic; Fault tolerance; Coherence (philosophical gambling strategy); Quantum; Connection (principal bundle); Quantum memory; Imperfect; Node (physics); Topology (electrical circuits); Quantum network; Mathematics; Distributed computing; Quantum mechanics; Physics; Statistics; Combinatorics","score_opus":0.008867049439702812,"score_gpt":0.27020902413220654,"score_spread":0.26134197469250375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043137390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.898103,0.011559184,0.07322788,0.014819002,0.00012614546,0.0010030958,0.0000026655139,0.00044234924,0.0007166848],"genre_scores_gemma":[0.9922218,0.0007803588,0.004798689,0.002073483,0.00010169574,0.0000108095255,8.441968e-7,0.000005949899,0.000006396264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987669,0.00009684109,0.00015787844,0.00048126763,0.00022381169,0.0002732937],"domain_scores_gemma":[0.9990446,0.00012584765,0.00006713503,0.00056508865,0.00004828419,0.00014906126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027168714,0.00017792851,0.00036662145,0.000018662866,0.00010683732,0.000082304214,0.00035604573,0.000013685995,0.0000012673842],"category_scores_gemma":[0.0000794811,0.00010994936,0.00007786818,0.0003561245,0.00007774008,0.0001463667,0.0000987029,0.00018361512,0.000008589833],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012749473,0.00024397625,0.00023693836,0.0006161854,0.000021749554,0.00003500895,0.00055163086,0.00010422286,0.00037683433,0.032433067,0.0004909479,0.9648767],"study_design_scores_gemma":[0.00136541,0.0038648332,0.0431848,0.006801001,0.00015104764,0.00039830848,0.000014093751,0.8154576,0.0020975026,0.09904612,0.025836967,0.0017823385],"about_ca_topic_score_codex":0.0000055834935,"about_ca_topic_score_gemma":3.973844e-7,"teacher_disagreement_score":0.96309435,"about_ca_system_score_codex":0.000016492013,"about_ca_system_score_gemma":0.00003390868,"threshold_uncertainty_score":0.44836047},"labels":[],"label_agreement":null},{"id":"W2044141959","doi":"10.1016/s0304-3975(02)00138-x","title":"Two-way finite automata with quantum and classical states","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":183,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum finite automata; Deterministic finite automaton; Deterministic automaton; Probabilistic automaton; Nondeterministic finite automaton; ω-automaton; Finite-state machine; Discrete mathematics; Nested word; Quantum; Computer science; Mathematics; Automaton; Automata theory; Theoretical computer science; Algorithm; Quantum mechanics; Physics","score_opus":0.008223849374187228,"score_gpt":0.22078804490979856,"score_spread":0.21256419553561134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044141959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10490277,0.000060712406,0.8890579,0.0041736416,0.0002668186,0.00011777586,0.0000017611598,0.00043902287,0.0009796403],"genre_scores_gemma":[0.79255795,0.000009352331,0.20664898,0.00064654497,0.00011121416,0.0000029556995,4.102207e-7,0.000010083013,0.000012518134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705106,0.00011856953,0.00025532662,0.0010030771,0.00078287174,0.0007891004],"domain_scores_gemma":[0.9979078,0.00058679393,0.00007199502,0.0008778109,0.000115797644,0.00043981202],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00076842797,0.0002786182,0.00027188825,0.00019163605,0.0006171448,0.00085959054,0.0018913285,0.00004314579,0.000029412282],"category_scores_gemma":[0.000050908347,0.00018710607,0.000042270683,0.0011065155,0.0036215154,0.0004839256,0.0012935802,0.000356641,0.00006589821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050454532,0.000077914425,0.000052817293,0.0000072448975,0.000005055814,0.00005830138,0.0006919072,0.0037749854,0.00004107279,0.8962919,0.00007428336,0.09891947],"study_design_scores_gemma":[0.00044698067,0.00054766843,0.00063441857,0.0000468375,0.000004115108,0.00018866816,0.000004246122,0.93305033,0.00019676083,0.06434303,0.00023430679,0.00030263525],"about_ca_topic_score_codex":0.0000036400882,"about_ca_topic_score_gemma":5.6284784e-7,"teacher_disagreement_score":0.92927533,"about_ca_system_score_codex":0.000024586861,"about_ca_system_score_gemma":0.00003866113,"threshold_uncertainty_score":0.9990901},"labels":[],"label_agreement":null},{"id":"W2044760493","doi":"10.1103/physrevlett.106.050502","title":"Does Adiabatic Quantum Optimization Fail for NP-Complete Problems?","year":2011,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Adiabatic quantum computation; Adiabatic process; Maxima and minima; Hamiltonian (control theory); Quantum; Hamiltonian path; Path (computing); Quantum annealing; Perturbation (astronomy); Quantum computer; Physics; Mathematics; Quantum mechanics; Computer science; Mathematical optimization; Combinatorics; Mathematical analysis","score_opus":0.02657342808748909,"score_gpt":0.2537695913139035,"score_spread":0.2271961632264144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044760493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057600047,0.00073626044,0.98152965,0.010623684,0.0003385755,0.000754641,0.000006188758,0.0002025334,0.000048484377],"genre_scores_gemma":[0.34096822,0.0012327299,0.5938197,0.062208936,0.0010505164,0.00055584166,0.000037242102,0.0000960747,0.000030743606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985833,0.000092965936,0.00027612533,0.000469195,0.00021147788,0.00036694505],"domain_scores_gemma":[0.99901927,0.0001584016,0.0001611754,0.00050047116,0.000054718686,0.00010595338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022442748,0.00021230755,0.00036762538,0.00004387943,0.00012923633,0.000065088185,0.000746446,0.000010073855,0.000009031157],"category_scores_gemma":[0.00005966332,0.00012498948,0.00022266194,0.00028651103,0.000052556465,0.00022477197,0.00013282191,0.00013941438,0.00003311541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047008165,0.0019808337,0.00034017477,0.02648333,0.00066413276,0.000072187955,0.019248405,0.33112818,0.015104882,0.19907418,0.045649767,0.36020693],"study_design_scores_gemma":[0.00015496668,0.000090001005,0.00006997813,0.00068904605,0.000029651372,0.0000038271364,0.0000013385101,0.9871248,0.00006715489,0.0047150734,0.0067936797,0.00026045283],"about_ca_topic_score_codex":0.000010391121,"about_ca_topic_score_gemma":4.5171845e-7,"teacher_disagreement_score":0.6559967,"about_ca_system_score_codex":0.000017509381,"about_ca_system_score_gemma":0.000017845608,"threshold_uncertainty_score":0.5096923},"labels":[],"label_agreement":null},{"id":"W2045152465","doi":"10.1016/j.tcs.2014.09.014","title":"Secure identification and QKD in the bounded-quantum-storage model","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Strategic Research Council; Natural Sciences and Engineering Research Council of Canada; Sino-Danish Center; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Natural Science Foundation of China; National Research Foundation; Fonds Québécois de la Recherche sur la Nature et les Technologies; Danmarks Grundforskningsfond; National Science Foundation","keywords":"Bounded function; Identification (biology); Quantum cryptography; Quantum; Theoretical computer science; Computer science; Mathematics; Computer security; Discrete mathematics; Physics; Quantum mechanics; Quantum information; Biology","score_opus":0.006581475583667152,"score_gpt":0.23141508678499878,"score_spread":0.22483361120133163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045152465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19822599,0.000021539456,0.79752123,0.0033604486,0.00023061121,0.000116137875,5.3005584e-7,0.000088000525,0.000435503],"genre_scores_gemma":[0.9232588,0.0000031354111,0.07549823,0.0011236452,0.00010228884,0.000005044517,4.1278713e-7,0.000005455266,0.0000029830671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766564,0.00022668533,0.00027262824,0.00071310473,0.0006460723,0.000475884],"domain_scores_gemma":[0.9985038,0.00034274624,0.000071007846,0.00088119274,0.00007542194,0.00012582567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003548143,0.0001706992,0.00016168217,0.00017329642,0.0005346927,0.0009460345,0.0026293478,0.000048896767,0.0000015306631],"category_scores_gemma":[0.000100189616,0.000112367656,0.000038555634,0.0009653491,0.0016619145,0.0003963213,0.00072323385,0.00031884667,0.000012980906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014198351,0.000029749477,0.000012425228,0.0000054077677,6.836501e-7,0.0000031421143,0.0018515221,0.009584464,0.00015931066,0.95722884,0.000021466112,0.031101553],"study_design_scores_gemma":[0.00008717546,0.00005346101,0.0009855179,0.000012653216,0.0000011599222,0.000037022946,0.000004694127,0.6244893,0.00008080295,0.37408924,0.00005490523,0.000104037324],"about_ca_topic_score_codex":0.000003389066,"about_ca_topic_score_gemma":9.972255e-7,"teacher_disagreement_score":0.7250328,"about_ca_system_score_codex":0.00002489098,"about_ca_system_score_gemma":0.00006202996,"threshold_uncertainty_score":0.9122632},"labels":[],"label_agreement":null},{"id":"W2045522120","doi":"10.1109/tit.2013.2248031","title":"New Separations in Zero-Error Channel Capacity Through Projective Kochen–Specker Sets and Quantum Coloring","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Royal Society","keywords":"Chromatic scale; Projective test; Mathematics; Quantum entanglement; Quantum; Quantum channel; Zero (linguistics); Discrete mathematics; Graph; Channel (broadcasting); Exponential function; Graph coloring; Combinatorics; Pure mathematics; Computer science; Quantum mechanics; Physics; Mathematical analysis; Telecommunications","score_opus":0.018569233742588204,"score_gpt":0.2447287314144044,"score_spread":0.2261594976718162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045522120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077942915,0.000009990453,0.91930795,0.00047885536,0.00045019537,0.00049418036,0.000009626449,0.00019193384,0.001114332],"genre_scores_gemma":[0.9743896,0.000008957897,0.024934703,0.00044693195,0.000023236767,0.00009481447,0.0000022419797,0.0000076133338,0.00009189887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883425,0.00010784202,0.00035668616,0.00021378206,0.00020877826,0.0002786425],"domain_scores_gemma":[0.99924135,0.00017086249,0.00011681016,0.00028682844,0.00009012902,0.00009401328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002767519,0.0001905143,0.00016706444,0.00027660694,0.0003234652,0.00023831334,0.00026257374,0.00009624951,0.000027509006],"category_scores_gemma":[0.000011430029,0.00017269432,0.000057688096,0.00048892485,0.000059167418,0.0028486676,0.0000072996054,0.00037923647,0.00013485595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008730177,0.0002776632,0.00001825528,0.00009709529,0.00011841921,0.000003045661,0.15166059,0.35915753,0.00030563804,0.26104343,0.0013260394,0.22590499],"study_design_scores_gemma":[0.0007325381,0.00017098169,0.0009482208,0.000069965885,0.000008012338,0.000038739305,0.00075562194,0.83720076,0.0027075952,0.15672714,0.00031515272,0.0003252854],"about_ca_topic_score_codex":0.0003126472,"about_ca_topic_score_gemma":0.00002490724,"teacher_disagreement_score":0.8964467,"about_ca_system_score_codex":0.00007314252,"about_ca_system_score_gemma":0.00009111847,"threshold_uncertainty_score":0.704227},"labels":[],"label_agreement":null},{"id":"W2046332346","doi":"10.1103/physrevb.79.245122","title":"Toric-boson model: Toward a topological quantum memory at finite temperature","year":2009,"lang":"en","type":"article","venue":"Physical Review B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Engineering and Physical Sciences Research Council; Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Foundational Questions Institute","keywords":"Toric code; Topological order; Physics; Quantum; Topology (electrical circuits); Boson; Thermodynamic limit; Topological degeneracy; Limit (mathematics); Field (mathematics); Topological entropy in physics; Finite field; Quantum field theory; Theoretical physics; Quantum mechanics; Topological quantum number; Symmetry protected topological order; Mathematics; Pure mathematics; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.021452174286942818,"score_gpt":0.2936913473931872,"score_spread":0.2722391731062444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046332346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5589336,0.09041234,0.2337309,0.10462091,0.0015821655,0.0019085236,0.000025422092,0.0024675857,0.0063185426],"genre_scores_gemma":[0.9791792,0.0022566405,0.009383807,0.0084755,0.0005240909,0.000014070231,0.000005305667,0.000011966973,0.00014943868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806875,0.00012835827,0.00027804673,0.00063986244,0.0004231729,0.00046183713],"domain_scores_gemma":[0.99876183,0.00016710963,0.00010331077,0.00069132424,0.0000650924,0.00021130293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021790518,0.00029550664,0.00055906316,0.0000309386,0.00017716501,0.000080957565,0.0009744468,0.00006215938,0.000010573646],"category_scores_gemma":[0.00014640867,0.00020103315,0.00031831738,0.0004708965,0.000042284708,0.00015297235,0.00032903618,0.00044686056,0.000115313254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036630307,0.0015010388,0.000018036091,0.0012275887,0.00006390679,0.0002594187,0.0023584228,0.041861,0.011099749,0.44042626,0.02727291,0.47387505],"study_design_scores_gemma":[0.0001466178,0.0002826195,0.00011430325,0.0005081051,0.00001850959,0.000025020065,0.0000013230774,0.9323253,0.00071928505,0.06118039,0.0043231556,0.00035538862],"about_ca_topic_score_codex":0.0000025545721,"about_ca_topic_score_gemma":1.8829546e-7,"teacher_disagreement_score":0.8904643,"about_ca_system_score_codex":0.00005473952,"about_ca_system_score_gemma":0.00004541189,"threshold_uncertainty_score":0.8197894},"labels":[],"label_agreement":null},{"id":"W2046440776","doi":"10.1103/physrevlett.88.207902","title":"Creating Decoherence-Free Subspaces Using Strong and Fast Pulses","year":2002,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum decoherence; Decoherence-free subspaces; Quantum computer; Computation; Physics; Linear subspace; Scalability; Quantum; Quantum mechanics; Computer science; Quantum error correction; Statistical physics; Algorithm; Mathematics; Pure mathematics","score_opus":0.0266396085938247,"score_gpt":0.27589229853086195,"score_spread":0.24925268993703725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046440776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8742662,0.017471535,0.0959747,0.011328251,0.00013440651,0.00026809363,0.000002720376,0.00017730103,0.0003767749],"genre_scores_gemma":[0.94074255,0.0012898563,0.05124701,0.006289384,0.00039219827,0.000009268642,6.8523684e-7,0.00001798045,0.000011040706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988109,0.000086815075,0.0001698476,0.0003845524,0.00023655809,0.00031135554],"domain_scores_gemma":[0.9991473,0.00017357296,0.000102035854,0.00045379353,0.000019723551,0.00010356769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011318385,0.00017953575,0.0003012674,0.000032057982,0.00018106725,0.00015106927,0.0005899027,0.0000074132004,0.000008786398],"category_scores_gemma":[0.00007223254,0.00014137987,0.00008987716,0.00027390636,0.000070580354,0.00022800655,0.00033446692,0.00018488089,0.00001197601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016552953,0.00023456622,0.0016724186,0.0017427413,0.000093759416,0.00008938418,0.0026367356,0.0077980524,0.011763197,0.006433056,0.0048464932,0.96268797],"study_design_scores_gemma":[0.000115827854,0.00003266596,0.0004914067,0.0011543151,0.000020483356,0.000028198172,0.000004769844,0.9967315,0.0000919117,0.0003431879,0.00076116505,0.00022452345],"about_ca_topic_score_codex":0.000022387587,"about_ca_topic_score_gemma":0.0000011757095,"teacher_disagreement_score":0.9889335,"about_ca_system_score_codex":0.000015447562,"about_ca_system_score_gemma":0.000005512083,"threshold_uncertainty_score":0.5765304},"labels":[],"label_agreement":null},{"id":"W2046441464","doi":"10.1080/17445760500355678","title":"Quantum computation and quantum information","year":2005,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":302,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Quantum computer; Quantum information; Computer science; Theoretical computer science; Quantum cryptography; Quantum algorithm; Quantum network; Computation; Quantum information science; Quantum error correction; Quantum technology; Open quantum system; Cryptography; Quantum; Algorithm; Quantum mechanics; Physics; Quantum entanglement","score_opus":0.011094629478666957,"score_gpt":0.25628133272817283,"score_spread":0.24518670324950587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046441464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15975939,0.0008954766,0.83473784,0.0028880187,0.0015715533,0.00006771204,0.00002078564,0.00002628519,0.00003294313],"genre_scores_gemma":[0.9934755,0.00018147644,0.005824615,0.00008725247,0.00039033324,0.0000014606364,0.000028887483,0.000003387869,0.0000070664237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856794,0.000061359926,0.00064287864,0.00011256697,0.0004746742,0.00014056341],"domain_scores_gemma":[0.9987966,0.000057761164,0.0004957993,0.00007570688,0.00044861675,0.00012552123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003810427,0.00012382827,0.00018336516,0.00018794078,0.000084718515,0.00033038072,0.0003616444,0.000048154245,0.0000027934252],"category_scores_gemma":[0.000048506823,0.00010048162,0.000059987236,0.00010628985,0.000028457602,0.00088816026,0.0001167138,0.00014056353,0.000006343224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012683774,0.00018410543,0.0036372906,0.00006573625,0.0004092071,0.00005825284,0.0025481929,0.7329125,0.00025690853,0.14129935,0.015062131,0.10343949],"study_design_scores_gemma":[0.0007189023,0.00009153519,0.0035921696,0.00006117405,0.0000076275865,0.0004408451,0.00012128543,0.9681239,0.000006975606,0.0011239005,0.025594031,0.00011765961],"about_ca_topic_score_codex":0.000029591687,"about_ca_topic_score_gemma":0.0000014728313,"teacher_disagreement_score":0.83371615,"about_ca_system_score_codex":0.00003971544,"about_ca_system_score_gemma":0.000043289583,"threshold_uncertainty_score":0.40975216},"labels":[],"label_agreement":null},{"id":"W2046481556","doi":"10.1038/nature09770","title":"Quantum Metropolis sampling","year":2011,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":327,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Engineering and Physical Sciences Research Council","keywords":"Sampling (signal processing); Computer science; Computer vision","score_opus":0.024180017735751902,"score_gpt":0.2660974881597603,"score_spread":0.2419174704240084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046481556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10053362,0.0019526263,0.87941617,0.0014639521,0.002828229,0.0001393431,0.0000052712703,0.00091489515,0.012745904],"genre_scores_gemma":[0.7712137,0.0000055475525,0.22739533,0.0011175785,0.00018939502,0.0000015787037,0.0000010934721,0.00000970042,0.0000660605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989714,0.000033617194,0.00012429402,0.00034183988,0.00022570122,0.00030316168],"domain_scores_gemma":[0.99924654,0.00004864784,0.000055012883,0.0004981157,0.000059020018,0.000092683564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017071454,0.00013419958,0.00012911706,0.00011436015,0.00014404077,0.00006892278,0.0009858835,0.0004576927,0.00002652253],"category_scores_gemma":[0.000051696643,0.00010566472,0.00008181361,0.00042623506,0.000028425175,0.00014332075,0.00025185102,0.0016865673,0.000047067446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007740617,0.00010541202,0.0005680512,0.000019720257,0.00004177154,0.000065457185,0.0027838263,0.00009741742,0.0005646927,0.8665172,0.004527147,0.12470158],"study_design_scores_gemma":[0.00078505324,0.00036778246,0.02684326,0.00010628088,0.000022836453,0.00026784366,0.00015306377,0.628846,0.009811416,0.2414774,0.0900806,0.001238512],"about_ca_topic_score_codex":0.000027785103,"about_ca_topic_score_gemma":0.0000023813081,"teacher_disagreement_score":0.6706801,"about_ca_system_score_codex":0.000016536796,"about_ca_system_score_gemma":0.0000310491,"threshold_uncertainty_score":0.732739},"labels":[],"label_agreement":null},{"id":"W2048129589","doi":"10.1088/0305-4470/37/25/l01","title":"Adiabatic quantum gates and Boolean functions","year":2004,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and General","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Defence Research and Development Canada","keywords":"Adiabatic process; Boolean function; Quantum; Physics; Quantum mechanics; Computer science; Theoretical physics; Algorithm","score_opus":0.009244560790024555,"score_gpt":0.2218935466131604,"score_spread":0.21264898582313585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048129589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5839647,0.0001576729,0.41443032,0.00129743,0.00007869309,0.000023473822,6.894804e-7,0.000009219269,0.000037788595],"genre_scores_gemma":[0.8844055,0.000020261901,0.11494972,0.00017375028,0.000399072,6.7954284e-7,2.2086054e-7,0.0000066755215,0.00004414039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935025,0.000017192082,0.00022523686,0.00010678032,0.00016042808,0.00014012292],"domain_scores_gemma":[0.9995442,0.00005787428,0.00011355246,0.00010299023,0.000050529194,0.00013084697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015260973,0.000096014905,0.00019377991,0.00003723894,0.000100685415,0.00011793822,0.00014492725,0.000022887332,0.0000018211209],"category_scores_gemma":[0.000022228542,0.00006477298,0.000063547435,0.000102439306,0.000058020272,0.00015262913,0.00008665013,0.0001599521,0.000003820174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003677913,0.00017510125,0.000028583774,0.00006634542,0.000047853533,0.000027710857,0.0013430566,0.00352407,0.0013306706,0.94297725,0.00012241496,0.050353292],"study_design_scores_gemma":[0.0003466819,0.00022411709,0.0003124621,0.000078080644,0.000015194542,0.00034683518,0.000021621767,0.23657669,0.00034598933,0.7615391,0.00010320983,0.0000900328],"about_ca_topic_score_codex":0.0000016058736,"about_ca_topic_score_gemma":1.4066684e-7,"teacher_disagreement_score":0.30044076,"about_ca_system_score_codex":0.0000073994943,"about_ca_system_score_gemma":0.000034441196,"threshold_uncertainty_score":0.26413655},"labels":[],"label_agreement":null},{"id":"W2048450681","doi":"10.1109/icecs.2011.6122234","title":"Reversible implementation of square-root circuit","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Subtractor; Square root; Adder; Realization (probability); Root (linguistics); Computer science; Computation; Block (permutation group theory); Arithmetic; Logic gate; Square (algebra); Truth table; Quantum computer; Toffoli gate; Subtraction; Algorithm; Mathematics; Quantum gate; Quantum; Telecommunications","score_opus":0.02887281835760086,"score_gpt":0.25755245521986064,"score_spread":0.22867963686225978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048450681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23212054,0.000023575802,0.7565669,0.000107464235,0.0001983162,0.00008214584,0.0000011115995,0.00011628249,0.010783694],"genre_scores_gemma":[0.93393886,7.643858e-7,0.06589503,0.00006391535,0.000019460422,0.0000012420487,5.955179e-7,0.0000030067624,0.00007714492],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993972,0.000022019836,0.00014769858,0.00016636754,0.00012744634,0.00013922747],"domain_scores_gemma":[0.99956757,0.000018035375,0.000064753134,0.00027004632,0.000041798176,0.000037819627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013656759,0.000060146485,0.00007852003,0.00006987989,0.000043838798,0.000014524568,0.0003980889,0.000018391089,0.00016709612],"category_scores_gemma":[0.0000030458057,0.00005075642,0.00004253954,0.00022073068,0.000015981152,0.000120443256,0.00012129555,0.000045607678,0.000018554605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032699065,0.0001234579,0.01842445,0.0000502452,0.000054989967,0.000013260976,0.011788496,0.00009177124,0.0022893627,0.44295067,0.002209372,0.5220007],"study_design_scores_gemma":[0.0022582908,0.0015947841,0.38910267,0.00009255867,0.000033320503,0.00009555605,0.0013166532,0.13606149,0.2961966,0.1668654,0.0052870135,0.0010956832],"about_ca_topic_score_codex":0.00033123934,"about_ca_topic_score_gemma":0.000029571547,"teacher_disagreement_score":0.7018183,"about_ca_system_score_codex":0.0000070112073,"about_ca_system_score_gemma":0.00003234097,"threshold_uncertainty_score":0.20697866},"labels":[],"label_agreement":null},{"id":"W2048599967","doi":"10.1103/physrevlett.85.5452","title":"Experimental Realization of an Order-Finding Algorithm with an NMR Quantum Computer","year":2000,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum algorithm; Quantum Fourier transform; Quantum phase estimation algorithm; Initialization; Realization (probability); Quantum computer; Algorithm; Computer science; Quantum error correction; Quantum; Quantum mechanics; Physics; Mathematics","score_opus":0.012609655732768812,"score_gpt":0.28114889925176495,"score_spread":0.26853924351899616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048599967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50110656,0.00045313695,0.497183,0.00078881293,0.000060178463,0.00023615992,0.0000028743332,0.00013958254,0.000029722296],"genre_scores_gemma":[0.59588647,0.00025253822,0.38908646,0.013757517,0.00085333956,0.000032824464,0.00006436635,0.000059612405,0.000006847174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834585,0.00019348692,0.0002651117,0.0005114618,0.00039017972,0.00029388798],"domain_scores_gemma":[0.9990565,0.000045249588,0.00012702974,0.00058429455,0.0000444502,0.00014247562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016144359,0.0002264903,0.00039421485,0.000046543082,0.00011347692,0.000074813506,0.0006491835,0.000011887887,0.000017639866],"category_scores_gemma":[0.0000027300534,0.00017080895,0.000081843726,0.00052661827,0.00007859384,0.00046103835,0.00007014481,0.00015243444,0.00001348451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012047294,0.0007265078,0.000013540428,0.0002444754,0.000035161724,0.000040369447,0.0013409085,0.023033017,0.00340626,0.0039415183,0.000341097,0.9668651],"study_design_scores_gemma":[0.00023827673,0.00064954476,0.00021898163,0.0006009166,0.000013423661,0.00003338324,0.0000035579283,0.99582297,0.0009219496,0.0001715106,0.0010674383,0.00025805022],"about_ca_topic_score_codex":0.000035168126,"about_ca_topic_score_gemma":4.6789032e-7,"teacher_disagreement_score":0.97278994,"about_ca_system_score_codex":0.000021192302,"about_ca_system_score_gemma":0.00002394696,"threshold_uncertainty_score":0.6965387},"labels":[],"label_agreement":null},{"id":"W2050520617","doi":"10.2298/fuee1103385n","title":"A shared-cube approach to ESOP-based synthesis of reversible logic","year":2011,"lang":"en","type":"article","venue":"Facta universitatis - series Electronics and Energetics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toffoli gate; Reversible computing; Computer science; Logic gate; Cube (algebra); Function (biology); Quantum; Logic synthesis; Gate count; Quantum logic; Quantum computer; Theoretical computer science; Algorithm; Quantum gate; Mathematics; Embedded system; Physics; Quantum mechanics","score_opus":0.013315226930764354,"score_gpt":0.18786631679607588,"score_spread":0.17455108986531154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050520617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12848377,0.0008234835,0.85712737,0.0015005576,0.00020539094,0.00027386486,0.000063556974,0.00023839928,0.011283624],"genre_scores_gemma":[0.60732657,0.000081260376,0.3922501,0.00016752827,0.0000108365875,0.0000020837128,0.0000057870766,0.000011666664,0.00014413775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885625,0.000056679597,0.0001604145,0.00037600347,0.00017940377,0.00037126627],"domain_scores_gemma":[0.99922395,0.00007882224,0.0000951215,0.00036463584,0.00009640568,0.0001410459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012223638,0.00018404337,0.0002413074,0.00018160578,0.00017652084,0.00004464498,0.0006214933,0.0000755632,0.0000098516475],"category_scores_gemma":[0.000033905933,0.00017806899,0.000065018496,0.0004580215,0.00007206143,0.00019906776,0.00025238816,0.00013790643,0.0000020200118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016148355,0.00045905498,0.00041798115,0.00024476775,0.00021153227,0.000046201105,0.008967303,0.020691678,0.0025736843,0.9256768,0.0031178603,0.03743163],"study_design_scores_gemma":[0.0013599063,0.0043745907,0.0030864044,0.0002203419,0.00021218721,0.00009628409,0.0018726301,0.8451796,0.06512205,0.041857384,0.034496043,0.0021225878],"about_ca_topic_score_codex":0.00006005958,"about_ca_topic_score_gemma":0.000011237008,"teacher_disagreement_score":0.88381946,"about_ca_system_score_codex":0.000043116466,"about_ca_system_score_gemma":0.00012328735,"threshold_uncertainty_score":0.72614425},"labels":[],"label_agreement":null},{"id":"W2050628998","doi":"10.1088/0305-4470/38/40/011","title":"Evanescence in coined quantum walks","year":2005,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and General","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Université de Montréal","funders":"","keywords":"Quantum walk; Mathematical proof; Feynman diagram; Equivalence (formal languages); Extension (predicate logic); Quantum; Algebra over a field","score_opus":0.009854955602646914,"score_gpt":0.2417461673081965,"score_spread":0.2318912117055496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050628998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70083666,0.00012593486,0.29669216,0.0021414992,0.000077790886,0.000032136257,3.0116556e-7,0.000010013494,0.00008350053],"genre_scores_gemma":[0.83830774,0.000011659648,0.16095339,0.00020691204,0.00047678736,4.871794e-7,7.7376484e-8,0.000004745308,0.00003820022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911207,0.000035226585,0.00033194997,0.00011505395,0.00022953199,0.00017614366],"domain_scores_gemma":[0.99950767,0.00008194623,0.00013503553,0.00012735474,0.00005297042,0.00009504987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000295196,0.00009846762,0.00023283693,0.000049942802,0.00003733842,0.00007230764,0.0003017783,0.000027932294,0.0000035485036],"category_scores_gemma":[0.000026917913,0.00006776365,0.000068791924,0.00015735603,0.000035753867,0.0001918356,0.00009938251,0.00021613903,0.0000064160627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011212774,0.0003915109,0.00010785815,0.000059604838,0.000019000414,0.00006909836,0.0017644828,0.006806639,0.003424383,0.7420913,0.0002821177,0.24497281],"study_design_scores_gemma":[0.0003041307,0.00009368016,0.00041674144,0.000067791196,0.0000032327641,0.00018734069,0.0000055074456,0.7755144,0.00056099286,0.22255966,0.00020455258,0.0000819301],"about_ca_topic_score_codex":0.0000011279495,"about_ca_topic_score_gemma":4.654741e-7,"teacher_disagreement_score":0.7687078,"about_ca_system_score_codex":0.000012847176,"about_ca_system_score_gemma":0.000034954955,"threshold_uncertainty_score":0.27633214},"labels":[],"label_agreement":null},{"id":"W2051538634","doi":"10.1109/dft.2011.55","title":"Online Fault Detection in Reversible Logic","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toffoli gate; Computer science; Logic gate; Combinational logic; Electronic circuit; Fault detection and isolation; Cascade; Sequential logic; Fault (geology); Logic synthesis; Boolean circuit; Process (computing); Algorithm; Programming language; Artificial intelligence; Quantum gate; Engineering; Electrical engineering; Quantum computer","score_opus":0.02748385941140414,"score_gpt":0.2380602554915635,"score_spread":0.21057639608015938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051538634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22919554,0.000027217564,0.76511824,0.00032783503,0.00028634,0.0000614418,3.6429486e-7,0.00022335978,0.004759688],"genre_scores_gemma":[0.79705024,0.000003145191,0.20221926,0.0004652719,0.00003373783,9.781851e-7,3.611538e-7,0.00000288961,0.00022409233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993844,0.000029121671,0.00011109433,0.00022061852,0.00008409134,0.00017064213],"domain_scores_gemma":[0.999666,0.000018776282,0.000026938338,0.00023126151,0.000019314988,0.000037737344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011598144,0.0000695986,0.000073739975,0.000109160144,0.00004179972,0.000019878451,0.00036956053,0.0000371221,0.000022090244],"category_scores_gemma":[0.000013426757,0.000054950222,0.0000286215,0.00036794622,0.000012889422,0.00011191898,0.00014145477,0.0001321631,0.000034361685],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010637981,0.0005764712,0.0008714448,0.00001731825,0.000010313977,0.00011393552,0.002893993,0.0021146878,0.0020030537,0.0269998,0.0003047863,0.96408355],"study_design_scores_gemma":[0.00025749783,0.00015231899,0.014654605,0.000014297432,0.000001005011,0.000035639965,0.000036162557,0.955654,0.0060939416,0.022015948,0.0009192495,0.0001652899],"about_ca_topic_score_codex":0.00024597955,"about_ca_topic_score_gemma":0.00015254179,"teacher_disagreement_score":0.96391827,"about_ca_system_score_codex":0.000014457013,"about_ca_system_score_gemma":0.000013024477,"threshold_uncertainty_score":0.22408049},"labels":[],"label_agreement":null},{"id":"W2051576124","doi":"10.1063/1.1824213","title":"Universal collective rotation channels and quantum error correction","year":2005,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; University of Guelph","funders":"","keywords":"Class (philosophy); Rotation (mathematics); Quantum; Quantum error correction; Set (abstract data type); Noise (video); Channel (broadcasting); Point (geometry); Quantum channel","score_opus":0.014821452254425473,"score_gpt":0.24828393769892457,"score_spread":0.2334624854444991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051576124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16051802,0.00002718546,0.8379265,0.00087069115,0.00036648448,0.00005169734,2.5084958e-7,0.000021436854,0.00021772315],"genre_scores_gemma":[0.9235202,0.000004667199,0.07568656,0.0000841861,0.0005679556,5.0929793e-7,1.1880882e-7,0.0000071943086,0.00012857887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992595,0.00005157973,0.00022781058,0.00010078281,0.00023832859,0.0001220444],"domain_scores_gemma":[0.9992381,0.00022038576,0.00022907206,0.00009358325,0.00013916241,0.00007975017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023652708,0.00008886562,0.00018373168,0.00005770102,0.00009465793,0.000082052065,0.00018600181,0.000031906562,0.0000031224363],"category_scores_gemma":[0.000066352426,0.00006903528,0.00006610178,0.00021103233,0.000036826168,0.00033834795,0.000058610774,0.00021275607,0.000007587374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008577941,0.0011011141,0.000044843568,0.000134945,0.00018998548,0.000056773915,0.02418896,0.12574957,0.0017849479,0.27757,0.006254206,0.56283885],"study_design_scores_gemma":[0.000256277,0.0001945519,0.00008695967,0.000061718594,0.000010039591,0.00015059946,0.00008974134,0.84477895,0.0006711956,0.153508,0.00012116684,0.00007077448],"about_ca_topic_score_codex":5.6299854e-7,"about_ca_topic_score_gemma":1.7218713e-7,"teacher_disagreement_score":0.7630022,"about_ca_system_score_codex":0.00005536351,"about_ca_system_score_gemma":0.00006979387,"threshold_uncertainty_score":0.2815177},"labels":[],"label_agreement":null},{"id":"W2052146120","doi":"10.1103/physreva.70.052328","title":"Improved simulation of stabilizer circuits","year":2004,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1561,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Controlled NOT gate; Quantum computer; Electronic circuit; Computer science; Quantum gate; Qubit; Hadamard transform; Tensor product; Algorithm; Quantum circuit; Mathematics; Quantum; Quantum mechanics; Quantum error correction; Physics; Pure mathematics","score_opus":0.016093234430529842,"score_gpt":0.2979267940434285,"score_spread":0.28183355961289863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052146120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1552649,0.004744486,0.8381286,0.0010434176,0.000102697384,0.00033441957,0.0000012428214,0.00011321626,0.0002670004],"genre_scores_gemma":[0.9954216,0.00012803933,0.0040352093,0.00033486716,0.00006788932,0.0000043765,5.131873e-7,0.0000046596365,0.000002834065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993034,0.00003167029,0.0001668434,0.00020418507,0.00016078503,0.00013311689],"domain_scores_gemma":[0.99935734,0.00009622499,0.00008930068,0.00034433088,0.0000632687,0.00004955342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011387139,0.00008547416,0.0002267453,0.000016993428,0.000028701086,0.000013143855,0.000322882,0.000010195813,0.000001679392],"category_scores_gemma":[0.00009259548,0.000063927786,0.00011551484,0.0003010658,0.00002314501,0.00008943482,0.00009657494,0.00008770867,0.000009691198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011330874,0.0003906234,0.000011753756,0.0012456727,0.000019528785,0.0000030876295,0.00067137356,0.17186163,0.008312751,0.041645072,0.000015139404,0.7758222],"study_design_scores_gemma":[0.0002496111,0.00013660111,0.0003575299,0.0008935226,0.0000126209125,0.0000021370543,6.573699e-7,0.9516045,0.0023631332,0.0432284,0.001003052,0.00014823086],"about_ca_topic_score_codex":0.000005725765,"about_ca_topic_score_gemma":2.0496238e-7,"teacher_disagreement_score":0.84015673,"about_ca_system_score_codex":0.000013893294,"about_ca_system_score_gemma":0.0000422096,"threshold_uncertainty_score":0.26068994},"labels":[],"label_agreement":null},{"id":"W2052891002","doi":"10.1126/science.1113479","title":"Simulated Quantum Computation of Molecular Energies","year":2005,"lang":"en","type":"article","venue":"Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1439,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Quantum computer; Quantum algorithm; Quantum phase estimation algorithm; Quantum; Adiabatic process; Wave function; Algorithm; Quantum error correction; Function (biology); Computer science; Statistical physics; Quantum mechanics; Physics","score_opus":0.006795505306941121,"score_gpt":0.2514620021073077,"score_spread":0.24466649680036656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052891002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6225837,0.00012466178,0.37644848,0.00041424335,0.0001403059,0.00003653234,3.1386395e-7,0.000091166534,0.00016060281],"genre_scores_gemma":[0.92023224,0.0000017102114,0.07959527,0.00013463665,0.000024180976,3.5493161e-7,2.3243766e-7,0.0000031147574,0.000008284609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872607,0.000027275386,0.00018778996,0.0003335772,0.00046543867,0.00025984758],"domain_scores_gemma":[0.9993259,0.00004292917,0.00009405896,0.00031241073,0.00015176271,0.000072941606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041397862,0.00008798108,0.000107889486,0.00018772412,0.00014948222,0.00009462005,0.0010018448,0.000021734146,0.0000015453551],"category_scores_gemma":[0.000057234894,0.0000754779,0.000038685765,0.0012097998,0.00028050097,0.00035126548,0.0002721067,0.000076417266,0.000011653097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.937791e-7,0.000025281579,0.00003239725,0.0000039219826,0.0000017012725,0.0000029238513,0.00044242904,0.82268536,0.07570975,0.018499983,0.000009205523,0.08258626],"study_design_scores_gemma":[0.00009793271,0.000047201793,0.0011540818,0.000016479104,9.750606e-7,0.000007597482,0.000007298394,0.9139601,0.08057602,0.0038437808,0.00019863265,0.000089925656],"about_ca_topic_score_codex":0.000010829256,"about_ca_topic_score_gemma":5.6447857e-7,"teacher_disagreement_score":0.29764852,"about_ca_system_score_codex":0.000021119977,"about_ca_system_score_gemma":0.0001308481,"threshold_uncertainty_score":0.30778995},"labels":[],"label_agreement":null},{"id":"W2053939928","doi":"10.1103/physrevlett.92.060402","title":"Quantum Tensor Product Structures are Observable Induced","year":2004,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":361,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Observable; Tensor product; Quantum entanglement; Tensor product of Hilbert spaces; Quantum; Multipartite; Tensor (intrinsic definition); Theoretical physics; Algebraic number; Quantum state; Partition (number theory); Product (mathematics); Physics; Statistical physics; Computer science; Quantum mechanics; Pure mathematics; Mathematics; Tensor contraction; Combinatorics; Geometry; Mathematical analysis","score_opus":0.0258821280210665,"score_gpt":0.2759289280124199,"score_spread":0.25004679999135343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053939928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90832293,0.0042168926,0.01661661,0.06951765,0.00046142013,0.00047789654,0.0000026540595,0.00035302257,0.000030916424],"genre_scores_gemma":[0.9526669,0.00024962012,0.012680892,0.033730857,0.0006185168,0.000023674062,0.000002747281,0.00002322436,0.0000035837045],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815583,0.00008872006,0.00024818786,0.0006466592,0.0004070644,0.00045353879],"domain_scores_gemma":[0.9987339,0.00006196018,0.00017271076,0.0008409984,0.000053826654,0.00013659727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015531304,0.00027354318,0.000465877,0.000041457515,0.000155734,0.000108010994,0.0010211573,0.00001060508,0.000002716915],"category_scores_gemma":[0.00010492689,0.00019935038,0.00020635365,0.00055402477,0.000048092807,0.00021800624,0.00024029062,0.00038072094,0.0000796033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026457494,0.0016850756,0.00076377846,0.009268257,0.00043780642,0.00081675657,0.0034582326,0.09939779,0.32917354,0.21894751,0.032493137,0.30353165],"study_design_scores_gemma":[0.0051336726,0.0013685047,0.122416995,0.025019053,0.0004529648,0.00071230496,0.00004327111,0.43313938,0.053647976,0.25362942,0.0959578,0.0084786555],"about_ca_topic_score_codex":0.00003158824,"about_ca_topic_score_gemma":7.712541e-7,"teacher_disagreement_score":0.3337416,"about_ca_system_score_codex":0.0000436273,"about_ca_system_score_gemma":0.0000465438,"threshold_uncertainty_score":0.8129273},"labels":[],"label_agreement":null},{"id":"W2053987271","doi":"10.1103/physrevlett.106.170501","title":"Quantum Simulation of Time-Dependent Hamiltonians and the Convenient Illusion of Hilbert Space","year":2011,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":266,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Hilbert space; Quantum; Generalization; Exponential growth; Rigged Hilbert space; Physics; Space time; Manifold (fluid mechanics); POVM; Quantum mechanics; Mathematics; Pure mathematics; Mathematical physics; Quantum operation; Quantum dynamics; Mathematical analysis; Reproducing kernel Hilbert space","score_opus":0.012748722790686376,"score_gpt":0.24378068759765945,"score_spread":0.23103196480697308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053987271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68375844,0.004279148,0.3007887,0.010149224,0.00015675355,0.00064740685,0.0000031162751,0.000053955893,0.00016321917],"genre_scores_gemma":[0.9962922,0.00040703858,0.0015118794,0.0017435405,0.00003121584,0.000003596341,4.8142755e-7,0.0000059796334,0.0000041136673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990143,0.00016311677,0.00023877606,0.00020622759,0.0002496001,0.00012794348],"domain_scores_gemma":[0.9990372,0.00030344253,0.00020935698,0.0003694118,0.000041610423,0.00003895462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003324009,0.00011048818,0.00033749707,0.000023918636,0.000046131012,0.0000084165795,0.00035582346,0.0000072865555,0.000003704558],"category_scores_gemma":[0.000048179303,0.00006492716,0.00012105875,0.0001584256,0.0001764699,0.00006239416,0.00022068297,0.000103391154,0.000007846456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035792653,0.0021817929,0.00070317596,0.009001447,0.0005860115,0.000054782977,0.058300573,0.24224856,0.10145317,0.21023384,0.0020747755,0.37280396],"study_design_scores_gemma":[0.00029922463,0.000060713443,0.00057725783,0.00057442026,0.000028727396,0.00000334865,0.0000020449659,0.99594396,0.0006607473,0.0014728936,0.0002871382,0.00008951963],"about_ca_topic_score_codex":0.00004793556,"about_ca_topic_score_gemma":2.7492746e-7,"teacher_disagreement_score":0.7536954,"about_ca_system_score_codex":0.0000067095207,"about_ca_system_score_gemma":0.000010220812,"threshold_uncertainty_score":0.2647653},"labels":[],"label_agreement":null},{"id":"W2053993705","doi":"10.1088/1751-8113/44/44/445308","title":"Simulating quantum dynamics on a quantum computer","year":2011,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Smoothness; Quantum phase estimation algorithm; Quantum; Unitary state; Representation (politics); Quantum computer; Quantum algorithm; Constant (computer programming); Upper and lower bounds","score_opus":0.014190175080291682,"score_gpt":0.23202706026162753,"score_spread":0.21783688518133584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053993705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2577662,0.000012541527,0.7411223,0.0003285972,0.00016293522,0.000048523914,9.596872e-7,0.000028836708,0.0005291273],"genre_scores_gemma":[0.90167165,0.0000025232382,0.0978524,0.00018086821,0.0002759348,5.129837e-7,1.7239945e-7,0.000013132533,0.0000028312058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985274,0.00010296109,0.00049181277,0.00020929895,0.00038374995,0.0002847616],"domain_scores_gemma":[0.9985619,0.00061461073,0.0002341732,0.00026409174,0.00011316782,0.00021204539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005395216,0.00019682452,0.00040149433,0.0000651963,0.000103383885,0.00010665236,0.0005057332,0.00006593665,0.000018384544],"category_scores_gemma":[0.00008577682,0.00012766622,0.00017294986,0.00016213754,0.00029296655,0.00013512775,0.00023759228,0.00045584128,0.000014519964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002081833,0.00030779117,0.00001063002,0.000033217806,0.00003471104,0.000059050715,0.0010061619,0.0002035558,0.000010976758,0.9694688,0.000013040141,0.028831247],"study_design_scores_gemma":[0.00016542201,0.0004382985,0.000037294783,0.000100739366,0.000011212344,0.00012103716,0.000012736792,0.4985518,0.00006024018,0.5004145,0.0000035742903,0.000083172745],"about_ca_topic_score_codex":3.6722508e-7,"about_ca_topic_score_gemma":2.2073959e-8,"teacher_disagreement_score":0.64390546,"about_ca_system_score_codex":0.00001510356,"about_ca_system_score_gemma":0.000030104971,"threshold_uncertainty_score":0.5206077},"labels":[],"label_agreement":null},{"id":"W2054620262","doi":"10.1103/physrevlett.110.170503","title":"Classification of Topologically Protected Gates for Local Stabilizer Codes","year":2013,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Topology (electrical circuits); Quantum gate; Pauli exclusion principle; Constant (computer programming); Quantum computer; Mathematics; Computer science; Physics; Discrete mathematics; Quantum; Quantum mechanics; Combinatorics","score_opus":0.020434725713138178,"score_gpt":0.28002429684990016,"score_spread":0.25958957113676195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054620262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21036677,0.00069430046,0.7609122,0.026739145,0.000051146024,0.0011123103,0.0000023671048,0.00009858633,0.000023197841],"genre_scores_gemma":[0.9489787,0.00008150904,0.0461325,0.0044534937,0.00007922942,0.00025970233,0.0000041467174,0.000007708183,0.0000029633559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897975,0.00009485434,0.00024425812,0.00029680796,0.00017388487,0.00021045702],"domain_scores_gemma":[0.9990506,0.00029418085,0.00013920115,0.00034532027,0.00011220588,0.00005849696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015441114,0.0001251948,0.00030791215,0.000021672093,0.00005214909,0.000032388438,0.00048863335,0.000010969636,0.000008533324],"category_scores_gemma":[0.000107132335,0.00008390822,0.00014841383,0.00022298172,0.00012715285,0.00010731298,0.00008657577,0.00011054809,0.000020833104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009707312,0.00054277945,0.00015790723,0.0033977232,0.00006849933,0.0000016848812,0.0004101621,0.0025763677,0.30331966,0.0522761,0.0077242553,0.6295152],"study_design_scores_gemma":[0.0001847841,0.00019398458,0.0060473727,0.0005769598,0.000016323538,0.000002633557,0.0000043495897,0.9797088,0.0020541542,0.008721996,0.0022705656,0.00021808752],"about_ca_topic_score_codex":0.00001136256,"about_ca_topic_score_gemma":2.4040708e-7,"teacher_disagreement_score":0.97713244,"about_ca_system_score_codex":0.000014195131,"about_ca_system_score_gemma":0.00001647649,"threshold_uncertainty_score":0.3421678},"labels":[],"label_agreement":null},{"id":"W2056131613","doi":"10.1142/s0219749905000888","title":"PARAMAGNETIC MATERIALS AND PRACTICAL ALGORITHMIC COOLING FOR NMR QUANTUM COMPUTING","year":2004,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Ministry of Defense","keywords":"Quantum computer; Qubit; Thermalisation; Reset (finance); Computation; Computer science; Physics; Quantum; Quantum mechanics; Statistical physics; Algorithm","score_opus":0.014734641006346917,"score_gpt":0.29012281622960673,"score_spread":0.2753881752232598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056131613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27649355,0.000043917156,0.71862173,0.003196214,0.0014699227,0.00011893497,0.000008257718,0.00003323231,0.000014225872],"genre_scores_gemma":[0.83663094,0.00003217968,0.1623346,0.0005501748,0.00043320374,0.0000019194197,0.000009174661,0.0000066823363,0.0000011148971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981721,0.000047095426,0.00088933524,0.00012092584,0.0005429665,0.00022756492],"domain_scores_gemma":[0.9978684,0.00028039564,0.0008679502,0.0001262207,0.0007531955,0.00010384674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009789831,0.00015519717,0.0002311598,0.00033392519,0.00013584719,0.0006495821,0.0004907584,0.00007178877,0.0000031385043],"category_scores_gemma":[0.00039940944,0.00013352693,0.000085192725,0.00012193794,0.000049793784,0.0019285732,0.00016430403,0.00021324014,0.000008434823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003942483,0.00022735128,0.000056926798,0.00013743436,0.0002804125,0.0001347916,0.0072293994,0.11736037,0.0032276257,0.6998845,0.00056119094,0.17050579],"study_design_scores_gemma":[0.0020474028,0.00048140812,0.0009682674,0.00022469922,0.000016091384,0.0030240465,0.00013775993,0.94828093,0.002283428,0.039978154,0.0023422712,0.00021554525],"about_ca_topic_score_codex":0.00001723149,"about_ca_topic_score_gemma":3.4788368e-7,"teacher_disagreement_score":0.8309206,"about_ca_system_score_codex":0.00008305051,"about_ca_system_score_gemma":0.00019761431,"threshold_uncertainty_score":0.62639356},"labels":[],"label_agreement":null},{"id":"W2056727876","doi":"10.1088/1367-2630/16/5/053015","title":"Experimental realization of post-selected weak measurements on an NMR quantum processor","year":2014,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Physics; Weak measurement; Realization (probability); Eigenvalues and eigenvectors; Selection (genetic algorithm); Range (aeronautics); Context (archaeology); Quantum; Quantum information processing; Scheme (mathematics); Statistical physics; Theoretical physics; Quantum mechanics; Computer science; Artificial intelligence; Mathematical analysis; Statistics","score_opus":0.02229991873363846,"score_gpt":0.269043843434824,"score_spread":0.24674392470118556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056727876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4395762,0.00004446274,0.5598198,0.00013118677,0.000233561,0.000051413263,6.1782004e-7,0.000023996852,0.00011871159],"genre_scores_gemma":[0.98748964,0.0000013091592,0.011868384,0.00011091025,0.0005065322,2.9370747e-7,0.0000017043868,0.00001150323,0.000009734157],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986551,0.00011546154,0.00032718235,0.00015688255,0.0005851367,0.00016025903],"domain_scores_gemma":[0.99863166,0.000035325396,0.0004980046,0.00022269544,0.00048921595,0.0001230998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002725039,0.00012518802,0.00021207257,0.000074921336,0.00007198248,0.000057157282,0.0005635925,0.000034367073,0.0000020693487],"category_scores_gemma":[0.000058662627,0.00010073213,0.000068446774,0.0003517942,0.000019343637,0.00030309596,0.00004318084,0.00016241783,0.0000019229308],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018371077,0.0015720904,0.0004884908,0.000058562513,0.00010542755,0.0000048292877,0.005883763,0.05242397,0.5859011,0.047681555,0.0011773144,0.3045192],"study_design_scores_gemma":[0.0016357354,0.004976695,0.0032842404,0.00026090164,0.000019246818,0.000045767763,0.0000574859,0.43963245,0.53622496,0.013265236,0.0003212536,0.00027599774],"about_ca_topic_score_codex":0.000017551194,"about_ca_topic_score_gemma":0.0000010342353,"teacher_disagreement_score":0.54795146,"about_ca_system_score_codex":0.000027173426,"about_ca_system_score_gemma":0.00016593476,"threshold_uncertainty_score":0.41077372},"labels":[],"label_agreement":null},{"id":"W2057325594","doi":"10.1103/physreva.67.012308","title":"Effect of noise on geometric logic gates for quantum computation","year":2003,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Quantum logic; Noise (video); Computation; Computer science; Quantum computer; Logic gate; Quantum; Physics; Quantum mechanics; Algorithm; Artificial intelligence","score_opus":0.015358512369166785,"score_gpt":0.31978278564293233,"score_spread":0.30442427327376553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057325594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16987337,0.0105434945,0.81674445,0.00072318676,0.00029382267,0.0012271733,0.0000036677557,0.00013190601,0.00045893717],"genre_scores_gemma":[0.9920783,0.00027697443,0.0071356315,0.000396866,0.000058563142,0.00003777913,0.0000023557595,0.000008954765,0.0000045694687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988642,0.00022991387,0.00019953714,0.0002931559,0.00021195279,0.00020128468],"domain_scores_gemma":[0.9979527,0.0015300489,0.00013932228,0.00025386884,0.00006364337,0.00006042918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005572204,0.00015008601,0.00042439302,0.00008076695,0.000057559286,0.000021524322,0.00029185967,0.000015815926,0.0000010194278],"category_scores_gemma":[0.00065588666,0.000099424775,0.00022241806,0.00080245757,0.00002484896,0.000047238005,0.000041033487,0.000100433455,0.00001991868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016296286,0.0004243085,0.000036149955,0.0047332197,0.00003439725,0.000003670224,0.000069066475,0.008109464,0.00061473064,0.29227474,0.0009241551,0.6927598],"study_design_scores_gemma":[0.00071560976,0.0042071706,0.00028649688,0.0017699216,0.000060271293,0.000008824519,4.5485342e-7,0.913111,0.012155169,0.06382953,0.0035279326,0.00032767328],"about_ca_topic_score_codex":0.0000012922496,"about_ca_topic_score_gemma":2.1223395e-8,"teacher_disagreement_score":0.90500146,"about_ca_system_score_codex":0.000012219994,"about_ca_system_score_gemma":0.000018567222,"threshold_uncertainty_score":0.40544245},"labels":[],"label_agreement":null},{"id":"W2057979115","doi":"10.1063/1.4811386","title":"Product formulas for exponentials of commutators","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Commutator; Exponential function; Product (mathematics); Mathematics; Elementary function; Unitary state; Scaling; Applied mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.01687617110134906,"score_gpt":0.25527059276677394,"score_spread":0.23839442166542488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057979115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18360057,0.00003785834,0.8153534,0.00061358506,0.00013834372,0.00015821682,7.6640504e-7,0.000011170886,0.00008610514],"genre_scores_gemma":[0.6424851,0.0000012334814,0.3572381,0.000040802526,0.00021110538,0.0000025386864,1.3367166e-7,0.0000072384137,0.000013733134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998926,0.00003330793,0.00050609326,0.000087027736,0.00028680539,0.00016075282],"domain_scores_gemma":[0.9985229,0.00036803057,0.00046111338,0.0002660348,0.0003069672,0.00007499524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038578533,0.00009587783,0.00033422725,0.000040492127,0.000045953995,0.000058327365,0.000577334,0.00002147647,0.0000068035815],"category_scores_gemma":[0.00014250564,0.0000642621,0.00020401069,0.00012902095,0.000044847508,0.00027405669,0.000100147765,0.00012748303,0.000008196946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026040794,0.0019619188,0.0000506275,0.001223515,0.00032534392,0.000008311643,0.0053229164,0.006511256,0.03075704,0.5415848,0.009581803,0.40264645],"study_design_scores_gemma":[0.00030205678,0.000236325,0.000075145654,0.00012636058,0.000015391559,0.000044724708,0.000018077946,0.22314976,0.023417994,0.75239575,0.00013030131,0.00008813301],"about_ca_topic_score_codex":7.275588e-7,"about_ca_topic_score_gemma":1.4221191e-8,"teacher_disagreement_score":0.4588845,"about_ca_system_score_codex":0.000009311978,"about_ca_system_score_gemma":0.000042856536,"threshold_uncertainty_score":0.26205325},"labels":[],"label_agreement":null},{"id":"W2058586197","doi":"10.1016/j.laa.2015.03.024","title":"Perfect state transfer on distance-regular graphs and association schemes","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Transfer (computing); Association scheme; Representation (politics); Discrete mathematics; State (computer science); Simple (philosophy); Graph; Combinatorics; Algorithm; Computer science","score_opus":0.010498082920160403,"score_gpt":0.2296571553207347,"score_spread":0.21915907240057428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058586197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56127405,0.0008570669,0.43467608,0.002370602,0.00006209066,0.0003051169,0.00001892808,0.00019080484,0.00024524683],"genre_scores_gemma":[0.99275875,0.00010914161,0.0063727926,0.0002934232,0.000071541224,0.000047609057,0.000008685765,0.000010564892,0.00032749595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991625,0.00003401357,0.00012923026,0.00031432963,0.000187286,0.0001726385],"domain_scores_gemma":[0.99946576,0.00008356037,0.000033823384,0.0002048888,0.00007431221,0.00013766543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020229092,0.000113469214,0.0001159473,0.00005666161,0.00018061275,0.000101450154,0.00016982967,0.000045747118,0.0000010536781],"category_scores_gemma":[0.000016580567,0.00009602598,0.000028543465,0.00025304817,0.000022891887,0.00010959775,0.000049758837,0.0001364475,0.000013581021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014150265,0.0001871016,0.0013133305,0.000048701713,0.00007258126,0.0000025447846,0.002866712,0.00060302555,0.0011875847,0.7661684,0.0007747611,0.22676109],"study_design_scores_gemma":[0.0011491115,0.00031559585,0.0036122806,0.000040980645,0.000027732043,0.000013985198,0.000043626045,0.76336,0.0048934347,0.09055872,0.13545121,0.00053330726],"about_ca_topic_score_codex":0.000003888998,"about_ca_topic_score_gemma":0.000002347046,"teacher_disagreement_score":0.762757,"about_ca_system_score_codex":0.000016596676,"about_ca_system_score_gemma":0.000026245769,"threshold_uncertainty_score":0.39158258},"labels":[],"label_agreement":null},{"id":"W2060532199","doi":"10.1103/physrevlett.113.080501","title":"Fault-Tolerant Conversion between the Steane and Reed-Muller Quantum Codes","year":2014,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":164,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Universal set; Quantum computer; Quantum gate; Qubit; Computer science; Set (abstract data type); Discrete mathematics; Quantum; Topology (electrical circuits); Mathematics; Algorithm; Physics; Quantum mechanics; Combinatorics; Programming language","score_opus":0.01182512576285499,"score_gpt":0.25528112686226745,"score_spread":0.24345600109941246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060532199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68819094,0.0036287992,0.18229252,0.12498642,0.0002438397,0.000401142,0.0000033691745,0.00018350634,0.000069460126],"genre_scores_gemma":[0.9677895,0.0007278339,0.0017162047,0.029301984,0.00043588947,0.0000074134723,0.0000037701539,0.0000122172005,0.0000052044434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855065,0.0002754411,0.00019938407,0.0003869184,0.00030648918,0.0002811112],"domain_scores_gemma":[0.998662,0.0005698797,0.000107409556,0.00053019,0.000026339849,0.00010416809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046930864,0.0001876284,0.0003797951,0.000022137885,0.00020693908,0.00009231851,0.00068573776,0.000010625197,0.0000017986617],"category_scores_gemma":[0.000045519217,0.00010867183,0.000121055564,0.00020222267,0.00012910205,0.00009455249,0.00030820377,0.0002829818,0.000049708186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015416854,0.00026082454,0.0018499561,0.0038383566,0.00026382925,0.000041880357,0.003418288,0.0042733555,0.006575819,0.03688419,0.07803364,0.86454445],"study_design_scores_gemma":[0.0002454036,0.000101291145,0.00349563,0.00096457003,0.00004586961,0.000012160315,0.0000034139782,0.9027218,0.0001270796,0.0011688834,0.09082067,0.00029318617],"about_ca_topic_score_codex":0.000017751883,"about_ca_topic_score_gemma":1.9319573e-7,"teacher_disagreement_score":0.89844847,"about_ca_system_score_codex":0.000010007895,"about_ca_system_score_gemma":0.0000073416727,"threshold_uncertainty_score":0.44315088},"labels":[],"label_agreement":null},{"id":"W2060880530","doi":"10.1017/s0960129512000096","title":"The monoidal structure of Turing machines","year":2013,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Turing machine; Turing machine examples; Super-recursive algorithm; Universal Turing machine; Description number; NSPACE; Time hierarchy theorem; Computer science; Non-deterministic Turing machine; Probabilistic Turing machine; Von Neumann architecture; Theoretical computer science; Algebra over a field; Mathematics; Algorithm; Pure mathematics; Programming language; Computation","score_opus":0.0061075696467322894,"score_gpt":0.23146366952493824,"score_spread":0.22535609987820596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060880530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44361082,0.00007564276,0.5548607,0.00059813756,0.0005085487,0.0001984945,8.1778063e-7,0.00006463468,0.00008219433],"genre_scores_gemma":[0.72786057,0.000001161898,0.27194065,0.00009508685,0.00008977994,0.0000030335634,1.1682265e-7,0.000005610895,0.0000039860083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976498,0.000065578315,0.00047929832,0.0005247457,0.0007041133,0.00057647424],"domain_scores_gemma":[0.9982152,0.0004616315,0.00015121036,0.0009183826,0.00012216099,0.0001314272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040571758,0.00021919995,0.00025735435,0.0001683733,0.00039693603,0.00062610273,0.0034665663,0.00004657858,0.000018997602],"category_scores_gemma":[0.00012088866,0.000123083,0.00006985528,0.0009666963,0.0007063879,0.00040293866,0.0013286978,0.00031153968,0.000007149868],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020618193,0.000034910798,0.00067623594,0.000052836247,0.000007568266,0.00000747031,0.0013594987,0.024092428,0.004977403,0.23289889,0.00010333777,0.7357874],"study_design_scores_gemma":[0.00007833718,0.000020220288,0.009691469,0.000021042293,6.5555594e-7,0.000044742043,0.0000030429574,0.6118925,0.0021322505,0.3759976,0.000016642576,0.00010147674],"about_ca_topic_score_codex":0.000032683925,"about_ca_topic_score_gemma":0.000004517102,"teacher_disagreement_score":0.7356859,"about_ca_system_score_codex":0.000033882217,"about_ca_system_score_gemma":0.00007620271,"threshold_uncertainty_score":0.64418006},"labels":[],"label_agreement":null},{"id":"W2060887750","doi":"10.1142/s0219749908003839","title":"ALGEBRAIC FORMULATION OF QUANTUM ERROR CORRECTION","year":2008,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum error correction; Error detection and correction; Operator (biology); Quantum; Algebraic number; Quantum algorithm; Algebra over a field; Mathematics; Code (set theory); Quantum operation; Computer science; Algorithm; Pure mathematics; Quantum mechanics; Open quantum system; Physics; Mathematical analysis","score_opus":0.015169362460462753,"score_gpt":0.2553183505539913,"score_spread":0.24014898809352858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060887750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3726355,0.00003121421,0.62274337,0.0005548214,0.003787153,0.00005452225,0.0000028444006,0.000031436724,0.00015910939],"genre_scores_gemma":[0.99162817,0.000047489226,0.007847743,0.00018648624,0.00025811128,0.0000010859168,0.0000115414205,0.0000052878027,0.000014087092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997725,0.000053070096,0.0010412739,0.00008671906,0.00094048306,0.0001534622],"domain_scores_gemma":[0.9969944,0.00013015466,0.0013961543,0.00017292108,0.0012348221,0.00007155901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004851782,0.00013316299,0.00021067832,0.0006464963,0.000103763145,0.00007968437,0.0008541396,0.0000720551,0.000012172449],"category_scores_gemma":[0.0002292545,0.00011410892,0.00017846796,0.00030315833,0.000041537183,0.00308169,0.000105681356,0.0002459456,0.000021138265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048723703,0.000495598,0.005834809,0.00009083974,0.00045648127,0.000095877294,0.020657944,0.26985776,0.0023382267,0.25728157,0.01225172,0.43015194],"study_design_scores_gemma":[0.00065856404,0.0002732993,0.016652055,0.000088249035,0.000006188013,0.0012803074,0.00008834544,0.97054,0.0021639315,0.0051692296,0.002956692,0.00012316782],"about_ca_topic_score_codex":0.000028595086,"about_ca_topic_score_gemma":8.6653495e-7,"teacher_disagreement_score":0.7006822,"about_ca_system_score_codex":0.000088664834,"about_ca_system_score_gemma":0.0001822259,"threshold_uncertainty_score":0.4653227},"labels":[],"label_agreement":null},{"id":"W2061741118","doi":"10.1103/physrevlett.89.057904","title":"Polynomial-Time Simulation of Pairing Models on a Quantum Computer","year":2002,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pairing; Mesoscopic physics; Hamiltonian (control theory); Excited state; Quantum computer; Physics; Quantum mechanics; Quantum; Quantum simulator; Superconductivity; Mathematics","score_opus":0.024419139295293144,"score_gpt":0.259490913969837,"score_spread":0.23507177467454382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061741118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21736465,0.0015199177,0.7647344,0.015245404,0.00024038665,0.0004259547,0.000003122095,0.00026310878,0.00020306857],"genre_scores_gemma":[0.9811149,0.000111117144,0.0077836537,0.010654445,0.00030942747,0.000005066078,0.0000011711452,0.000014087677,0.000006097825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986851,0.000116938485,0.00027097063,0.0003608887,0.00031810818,0.00024799773],"domain_scores_gemma":[0.99895066,0.00031409526,0.0001477077,0.00048379746,0.000028943248,0.00007481657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001428715,0.0001796558,0.00039040652,0.000056379755,0.00006120148,0.000034321674,0.00050764304,0.00000970242,0.0000072081207],"category_scores_gemma":[0.000015629414,0.00014450849,0.00021636036,0.00029524343,0.000037765094,0.00017171506,0.00014207844,0.00017052365,0.00011710144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012735258,0.00011509436,0.0000014727684,0.00018424139,0.000013978327,0.0000048722322,0.00020668958,0.90985894,0.00094225333,0.00052002317,0.0057370905,0.08241405],"study_design_scores_gemma":[0.00011851023,0.000091166105,0.00003548359,0.0008706886,0.000009409736,0.00000205386,1.0180226e-7,0.9971416,0.000065484186,0.0002218133,0.001283933,0.00015973073],"about_ca_topic_score_codex":0.0000030539652,"about_ca_topic_score_gemma":1.9628375e-8,"teacher_disagreement_score":0.76375026,"about_ca_system_score_codex":0.0000189247,"about_ca_system_score_gemma":0.0000044505996,"threshold_uncertainty_score":0.58928853},"labels":[],"label_agreement":null},{"id":"W2061829583","doi":"10.1103/physreva.82.022304","title":"Local equivalence, surface-code states, and matroids","year":2010,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Conjecture; Matroid; Counterexample; Mathematics; Unitary state; Combinatorics; Equivalence (formal languages); Discrete mathematics; Law","score_opus":0.008573192636192693,"score_gpt":0.27689916683080057,"score_spread":0.26832597419460785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061829583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6858671,0.011940167,0.29572347,0.0050236243,0.0003429596,0.00030194886,0.000006997322,0.00029495818,0.0004988095],"genre_scores_gemma":[0.95667464,0.0037851129,0.03754708,0.0017161749,0.00019153219,0.000007143449,0.0000028457787,0.000015483123,0.000060016133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998926,0.000050056613,0.00015296062,0.00036687288,0.00022365013,0.0002804461],"domain_scores_gemma":[0.9991636,0.00013800393,0.000055216908,0.00044840653,0.000038365582,0.00015638833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023116935,0.00015022002,0.0002761406,0.000014517817,0.00008475178,0.00007571877,0.0005271315,0.000019078723,0.000005263065],"category_scores_gemma":[0.000034858695,0.00010897613,0.00008042014,0.00024258067,0.000111772395,0.00011918223,0.00034884454,0.00037062448,0.00007017616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024441765,0.00020340802,0.00016358256,0.0011598695,0.000021779764,0.00003250369,0.00031941937,0.0006498686,0.0042520105,0.117800765,0.0028330507,0.8725613],"study_design_scores_gemma":[0.00015115955,0.000112660615,0.0010540314,0.0005351634,0.000016121983,0.00005530031,0.0000016781327,0.90639746,0.0005112361,0.046134062,0.04472488,0.00030625204],"about_ca_topic_score_codex":0.000013256211,"about_ca_topic_score_gemma":0.0000028776474,"teacher_disagreement_score":0.9057476,"about_ca_system_score_codex":0.0000050736044,"about_ca_system_score_gemma":0.000031275562,"threshold_uncertainty_score":0.44439176},"labels":[],"label_agreement":null},{"id":"W2062250298","doi":"10.1103/physrevlett.98.120503","title":"Modeling an Adiabatic Quantum Computer via an Exact Map to a Gas of Particles","year":2007,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Physics; Adiabatic process; Hamiltonian (control theory); Lambda; Quantum mechanics; Controlled NOT gate; Scaling; Quantum; Exponent; Mathematical physics; Quantum computer; Statistical physics; Quantum gate; Mathematics; Geometry","score_opus":0.020130523776775176,"score_gpt":0.29239428672882345,"score_spread":0.2722637629520483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062250298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49045458,0.00028077306,0.50653285,0.0024319973,0.000086371845,0.00014484629,5.7223366e-7,0.000066751236,0.0000012400044],"genre_scores_gemma":[0.90151614,0.000029112136,0.08723367,0.010828323,0.0003670776,0.0000059083313,0.0000025350432,0.000017001279,2.5044707e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998102,0.00015019291,0.00040223842,0.0005004946,0.0003709266,0.00047414497],"domain_scores_gemma":[0.99865705,0.0001242332,0.000094428586,0.0007289125,0.000056062552,0.00033931556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006314056,0.00021555451,0.0004465237,0.000074167016,0.00007777641,0.00005753692,0.00083855976,0.000011039325,0.000001966994],"category_scores_gemma":[0.000014897595,0.00017514762,0.00015264652,0.000402225,0.000038362363,0.0002866671,0.00018355253,0.0001826244,0.000036251342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011215148,0.0005860847,0.000060391696,0.0008136213,0.00003791854,0.00004640579,0.002286043,0.22871405,0.026175346,0.0042556417,0.0002930957,0.7367202],"study_design_scores_gemma":[0.00009027901,0.0002641596,0.00024223233,0.00062559114,0.00001579089,0.000007680087,0.0000025492063,0.996278,0.00041893663,0.0016287712,0.00019771248,0.00022833578],"about_ca_topic_score_codex":0.00003820855,"about_ca_topic_score_gemma":0.0000037883358,"teacher_disagreement_score":0.76756394,"about_ca_system_score_codex":0.000020721205,"about_ca_system_score_gemma":0.000016950084,"threshold_uncertainty_score":0.71423125},"labels":[],"label_agreement":null},{"id":"W2062374336","doi":"10.1145/1147954.1147962","title":"Computing with highly mixed states","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Initialization; Qubit; Ideal (ethics); Quantum computer; Computer science; State (computer science); Quantum circuit; Quantum gate; Quantum; Topology (electrical circuits); Quantum mechanics; Physics; Algorithm; Mathematics; Quantum error correction; Combinatorics","score_opus":0.005547299973036692,"score_gpt":0.20454736170077156,"score_spread":0.19900006172773488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062374336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85026896,0.00016606567,0.13917795,0.009619415,0.0006207433,0.00003180942,3.754223e-7,0.000027173042,0.00008750463],"genre_scores_gemma":[0.8207186,0.0000015805228,0.17866497,0.00021399486,0.0003412379,5.6630626e-8,8.019811e-8,0.00000560474,0.000053895226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990869,0.00006941583,0.00024563057,0.00009852635,0.00032103612,0.00017846149],"domain_scores_gemma":[0.99865067,0.00016162187,0.00036517545,0.00067428825,0.000109810266,0.0000384477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003409562,0.00009000101,0.00014187013,0.000056382974,0.00015760947,0.00013462034,0.0027248564,0.000019145424,7.5911066e-7],"category_scores_gemma":[0.00006354008,0.000044072385,0.00008877856,0.00026646804,0.000037379505,0.000108165215,0.000652776,0.00025047155,0.0000022085762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004896257,0.00028046375,0.011812338,0.000036025576,0.0001469247,0.0002865374,0.0016477677,0.80672705,0.0030203245,0.008346925,0.05698063,0.110666044],"study_design_scores_gemma":[0.0016924505,0.00067990186,0.13399431,0.00044529364,0.000040444298,0.0028802715,0.000061003513,0.7045606,0.010421827,0.12868932,0.016088316,0.00044629342],"about_ca_topic_score_codex":0.000024514175,"about_ca_topic_score_gemma":0.000004712501,"teacher_disagreement_score":0.12218197,"about_ca_system_score_codex":0.000021493533,"about_ca_system_score_gemma":0.000064865206,"threshold_uncertainty_score":0.50635064},"labels":[],"label_agreement":null},{"id":"W2062794279","doi":"10.1103/physrevlett.104.050503","title":"Tradeoffs for Reliable Quantum Information Storage in 2D Systems","year":2010,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Qubit; Hilbert space; Bounded function; Quantum; Dimension (graph theory); Physics; Lattice (music); Quantum information; Locality; Code (set theory); Quantum mechanics; Discrete mathematics; Statistical physics; Mathematics; Computer science; Combinatorics; Mathematical analysis","score_opus":0.009734540041546379,"score_gpt":0.25369042564318933,"score_spread":0.24395588560164294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062794279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51574534,0.001980431,0.45047548,0.027274158,0.0023624005,0.0017302594,0.000010964563,0.00030187718,0.000119054035],"genre_scores_gemma":[0.9754217,0.00017877838,0.010986431,0.012761252,0.00046120276,0.00015752864,0.0000134928805,0.000014647579,0.000004938718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989403,0.00003977474,0.00029268468,0.00021826521,0.00021472119,0.00029426118],"domain_scores_gemma":[0.99920994,0.00015210926,0.00012653678,0.00040754693,0.000031165047,0.00007268017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003955691,0.00014348919,0.0003010585,0.00006272024,0.000067399844,0.000121970996,0.00056550367,0.000014355574,7.711992e-7],"category_scores_gemma":[0.000071452,0.00011428377,0.00011779318,0.0003256334,0.000025027317,0.00048495986,0.000069907335,0.0003316586,0.000036619625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025292116,0.00069857144,0.00023770193,0.0153407175,0.00007570894,0.00003833805,0.004436852,0.09060004,0.035776556,0.48584586,0.09804328,0.26888108],"study_design_scores_gemma":[0.00017584073,0.00003543467,0.0002593416,0.0005187635,0.0000053621,0.000007098137,0.0000017815373,0.92204475,0.000034588502,0.0006078458,0.076145716,0.00016348633],"about_ca_topic_score_codex":0.000027792184,"about_ca_topic_score_gemma":9.488464e-7,"teacher_disagreement_score":0.8314447,"about_ca_system_score_codex":0.00001890726,"about_ca_system_score_gemma":0.000025712941,"threshold_uncertainty_score":0.4660357},"labels":[],"label_agreement":null},{"id":"W2062884415","doi":"10.1007/s11128-013-0704-8","title":"Dualities and identities for entanglement-assisted quantum codes","year":2013,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Qubit; Upper and lower bounds; Quantum computer; Quantum; Hash function; Block code; Error detection and correction; Accumulator (cryptography); Quantum information","score_opus":0.013162162311362698,"score_gpt":0.2447043921567723,"score_spread":0.23154222984540962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062884415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1970018,0.00031273864,0.79963,0.0015111776,0.00033792396,0.00042225153,0.000012960892,0.00039204257,0.00037911037],"genre_scores_gemma":[0.9564715,0.000020936643,0.042142093,0.0010184966,0.00007747327,0.000115208204,0.00004642824,0.00001057901,0.000097306416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863183,0.000031686242,0.00050785294,0.00018870017,0.00028672453,0.00035320886],"domain_scores_gemma":[0.99902725,0.000114621835,0.00028798453,0.0001963809,0.0002846242,0.00008913601],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00033021788,0.00018733159,0.00019412549,0.00021032571,0.0005729801,0.001810577,0.00036339086,0.00005930288,0.000011454595],"category_scores_gemma":[0.00007372548,0.0001619206,0.000051323965,0.00022829381,0.00008063594,0.004291631,0.00016615045,0.00010517226,0.0000264142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011248049,0.000051734314,0.000232624,0.0012294955,0.000039209044,0.0000011379906,0.021650122,0.00055928295,0.0002998234,0.24919204,0.005617569,0.7211157],"study_design_scores_gemma":[0.00040633843,0.00008746389,0.0012516505,0.000106332736,0.0000065155486,0.000041522162,0.0018633959,0.94561166,0.00033183375,0.045190845,0.004850564,0.00025190838],"about_ca_topic_score_codex":0.000049126098,"about_ca_topic_score_gemma":0.0000013597023,"teacher_disagreement_score":0.9450523,"about_ca_system_score_codex":0.000028133405,"about_ca_system_score_gemma":0.00006992968,"threshold_uncertainty_score":0.9992256},"labels":[],"label_agreement":null},{"id":"W2063014559","doi":"10.1038/srep06857","title":"Experimental Optimal Single Qubit Purification in an NMR Quantum Information Processor","year":2014,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; University of Waterloo; State Key Laboratory of Low-Dimensional Quantum Physics; Tsinghua University; National Natural Science Foundation of China","keywords":"Qubit; Quantum decoherence; Symmetrization; Protocol (science); Noise (video); Computer science; Scheme (mathematics); Topology (electrical circuits); Quantum computer; Quantum; Quantum mechanics; Physics; Mathematics; Electrical engineering; Engineering","score_opus":0.011395541208649555,"score_gpt":0.2407626758584165,"score_spread":0.22936713464976696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063014559","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83261204,0.000028473478,0.16426195,0.00018286107,0.0022364063,0.00020184719,2.856975e-7,0.00018665855,0.00028948812],"genre_scores_gemma":[0.9781661,8.619486e-8,0.021605795,0.000053924152,0.000065366534,0.00002094898,0.000028643806,0.0000061222127,0.000053002215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979521,0.00007443933,0.0005251637,0.00060466706,0.00051612593,0.0003274826],"domain_scores_gemma":[0.99851805,0.000020401874,0.00030928338,0.00090132415,0.00013242027,0.00011853649],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014265764,0.00014096474,0.00014035462,0.00030276415,0.00028480924,0.0011997331,0.00047606757,0.000057493933,0.000006249778],"category_scores_gemma":[0.000093986404,0.0001282343,0.000042494503,0.0007011988,0.00009250753,0.001911213,0.00014314716,0.0001257018,0.000025452484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003737973,0.00242701,0.0042905407,0.00016993757,0.00001668629,0.00019430753,0.050664183,0.17645831,0.3114568,0.027381295,0.004031613,0.42287192],"study_design_scores_gemma":[0.0001306245,0.00013737049,0.0011533004,0.00002830804,0.000001065473,0.00012252103,0.00008923626,0.9335459,0.05326392,0.0033455284,0.0079729045,0.00020936206],"about_ca_topic_score_codex":0.000017207316,"about_ca_topic_score_gemma":0.0000047281383,"teacher_disagreement_score":0.7570875,"about_ca_system_score_codex":0.000052813564,"about_ca_system_score_gemma":0.00008974995,"threshold_uncertainty_score":0.9998371},"labels":[],"label_agreement":null},{"id":"W206344181","doi":"10.26421/qic13.5-6-10","title":"Perfect state transfer on signed graphs","year":2013,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Perfect graph theorem; Trivially perfect graph; Perfect graph; Mathematics; Combinatorics; Transfer (computing); Discrete mathematics; Induced subgraph; Distance-hereditary graph; State (computer science); Graph; Perfect power; Induced subgraph isomorphism problem; Line graph; Computer science; Algorithm; Pathwidth; Graph power; Vertex (graph theory); Voltage graph","score_opus":0.006731649378793569,"score_gpt":0.2116086545933717,"score_spread":0.20487700521457813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206344181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4177762,0.000011546127,0.58071226,0.00060089235,0.00015637164,0.0001872722,0.0000013946988,0.00018890837,0.0003651393],"genre_scores_gemma":[0.9938131,0.00000793812,0.0049138456,0.0011984035,0.000015818974,0.000016976679,0.000017407745,0.0000050509816,0.000011459577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898416,0.0000630708,0.00031621446,0.00016733838,0.00025717003,0.00021207643],"domain_scores_gemma":[0.99947417,0.000097158154,0.000066117675,0.00014929046,0.00011353825,0.000099716366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001737478,0.00015552729,0.0001272645,0.00023766355,0.00022213094,0.0005010898,0.00019360958,0.000042718446,0.0000113198475],"category_scores_gemma":[0.00001219653,0.00012935426,0.000048803762,0.00030282853,0.00003089447,0.0013901333,0.0000397352,0.00013906365,0.00022914323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009348316,0.000035464655,0.000039234797,0.00003708374,0.000013597825,9.325558e-7,0.0041884994,0.026425017,0.00011393556,0.087881185,0.0007137584,0.8805419],"study_design_scores_gemma":[0.00041573818,0.00028324267,0.0050881244,0.00002004113,0.0000018333584,0.000012546791,0.000051699142,0.9628431,0.00015266315,0.030472796,0.0004809815,0.00017723985],"about_ca_topic_score_codex":0.000042326647,"about_ca_topic_score_gemma":6.7229166e-7,"teacher_disagreement_score":0.93641806,"about_ca_system_score_codex":0.000013995952,"about_ca_system_score_gemma":0.000026400601,"threshold_uncertainty_score":0.5274914},"labels":[],"label_agreement":null},{"id":"W2063830984","doi":"10.1007/s10836-013-5399-3","title":"Online Testable Approaches in Reversible Logic","year":2013,"lang":"en","type":"article","venue":"Journal of Electronic Testing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Correctness; Computer science; Overhead (engineering); Mathematical proof; Logic synthesis; Electronic circuit; Logic gate; Computer engineering; Theoretical computer science; Reliability engineering; Computer architecture; Algorithm; Programming language; Engineering; Mathematics","score_opus":0.044122191953623165,"score_gpt":0.24023292485865586,"score_spread":0.1961107329050327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063830984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85319054,0.0015965123,0.14023615,0.003841574,0.00016942223,0.00014222894,2.6088813e-7,0.00007322965,0.00075009745],"genre_scores_gemma":[0.7854017,0.0000031969043,0.21419734,0.00018845516,0.00015135513,8.678607e-7,1.9804011e-7,0.0000069205275,0.000049978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986347,0.00006803414,0.0003990954,0.00016984587,0.00021260961,0.00051573984],"domain_scores_gemma":[0.998922,0.00036553168,0.0003307602,0.00018203665,0.0001256223,0.00007405061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006163321,0.00011764809,0.00021904723,0.00020670504,0.00007026366,0.00011087839,0.0007095075,0.000041197498,0.0000059337594],"category_scores_gemma":[0.00041700035,0.00009119983,0.000057947716,0.00077658414,0.000018993816,0.00040172832,0.00012929241,0.0006712554,0.0000057246502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008058412,0.0009547013,0.013010668,0.00006260322,0.000060167327,0.00017575928,0.00097032107,0.35084152,0.0042415336,0.01288959,0.001395335,0.6153897],"study_design_scores_gemma":[0.0003411443,0.00044189373,0.0064727943,0.00011348194,0.0000036371177,0.00061339623,0.000039599996,0.9594381,0.00015521872,0.032010946,0.00023513846,0.00013465468],"about_ca_topic_score_codex":0.000054526095,"about_ca_topic_score_gemma":0.000006692763,"teacher_disagreement_score":0.61525506,"about_ca_system_score_codex":0.00011157915,"about_ca_system_score_gemma":0.00030389216,"threshold_uncertainty_score":0.3719021},"labels":[],"label_agreement":null},{"id":"W2063885642","doi":"10.1103/physrevlett.103.120504","title":"Adiabatic Gate Teleportation","year":2009,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Teleportation; Adiabatic process; Physics; Quantum teleportation; Quantum mechanics; Quantum electrodynamics; Quantum computer; Quantum entanglement; Quantum; Quantum network; Quantum channel","score_opus":0.00913224370394946,"score_gpt":0.26831816868022845,"score_spread":0.259185924976279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063885642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51749593,0.0060221558,0.34670946,0.12771443,0.00034363245,0.0005387954,0.0000010274058,0.0005460082,0.00062857824],"genre_scores_gemma":[0.90612334,0.00034606477,0.0148894405,0.07836563,0.00025308577,0.0000068448826,0.0000029529515,0.0000061014625,0.0000065648146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990998,0.00005285928,0.00016288819,0.00025901105,0.00021553287,0.00020994211],"domain_scores_gemma":[0.99942595,0.000058789203,0.000085857224,0.00033466864,0.00001869948,0.00007601303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011891519,0.000117089774,0.00020798633,0.000025970461,0.000058488364,0.000049536422,0.00038981315,0.0000039516503,0.0000023517691],"category_scores_gemma":[0.000033880828,0.000090548485,0.00011676039,0.00030883396,0.000015573085,0.00013552635,0.00002972269,0.00013299937,0.000087966444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.774414e-7,0.0001474031,0.00001928972,0.00030797103,0.000016681815,0.00006414673,0.00038037752,0.0072664665,0.0074634915,0.013057936,0.0089404695,0.9623349],"study_design_scores_gemma":[0.0001663597,0.00014210829,0.0065828403,0.0012715118,0.0000283953,0.000029095061,6.104287e-7,0.97019666,0.00032389275,0.009814878,0.011029218,0.00041441186],"about_ca_topic_score_codex":0.0000015822467,"about_ca_topic_score_gemma":6.232519e-8,"teacher_disagreement_score":0.9629302,"about_ca_system_score_codex":0.000011807125,"about_ca_system_score_gemma":0.00001181768,"threshold_uncertainty_score":0.369246},"labels":[],"label_agreement":null},{"id":"W2064067957","doi":"10.1109/isit.2014.6874999","title":"Branching MERA codes: A natural extension of classical and quantum polar codes","year":2014,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Natural Sciences and Engineering Research Council of Canada; Institut de Ciències Fotòniques; Compute Canada","keywords":"Quantum convolutional code; Computer science; Decoding methods; List decoding; Berlekamp–Welch algorithm; Theoretical computer science; Algorithm; Linear code; Concatenated error correction code; Discrete mathematics; Mathematics; Block code","score_opus":0.007101051191386065,"score_gpt":0.22926569658646467,"score_spread":0.2221646453950786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064067957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5130933,0.00022659794,0.4848911,0.0012268595,0.00023469432,0.00004782449,8.5695643e-7,0.00011851087,0.00016027137],"genre_scores_gemma":[0.917363,0.000006488137,0.0821076,0.0003956522,0.000078549514,5.6432856e-7,9.4499023e-7,0.0000067427377,0.000040489467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881023,0.00011900972,0.00021873142,0.00037357872,0.00023774589,0.00024071234],"domain_scores_gemma":[0.9991045,0.00031001875,0.00008015575,0.00035626307,0.0000586248,0.000090442394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039244493,0.00014245989,0.00025713703,0.000083819345,0.00014556515,0.00009375176,0.00037284772,0.000052538366,0.0000022460565],"category_scores_gemma":[0.00009384175,0.00010109173,0.00006078559,0.0001741856,0.00009319857,0.00014156861,0.00028883977,0.00023727336,0.0000031324123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027172806,0.00015259729,0.0010644193,0.000107767235,0.000045982146,0.0000145192,0.002212536,0.0012424461,0.053718604,0.5042962,0.0009577998,0.43616],"study_design_scores_gemma":[0.0002555399,0.00012918584,0.0061294953,0.00005944957,0.000003854003,0.0000504391,0.000012900329,0.98261064,0.0015701317,0.0080572525,0.00097327103,0.00014780792],"about_ca_topic_score_codex":0.00007153202,"about_ca_topic_score_gemma":0.000010701098,"teacher_disagreement_score":0.98136824,"about_ca_system_score_codex":0.0000056452554,"about_ca_system_score_gemma":0.000019758289,"threshold_uncertainty_score":0.41224012},"labels":[],"label_agreement":null},{"id":"W2064337722","doi":"10.1103/physreva.74.042329","title":"Quantum error-correcting subsystems are unitarily recoverable subsystems","year":2006,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Unitary state; Noise (video); Dual (grammatical number); Algebraic number; Computer science; Identification (biology); Quantum; Algorithm; Quantum error correction; Algebraic operation; Control theory (sociology); Mathematics; Algebra over a field; Theoretical computer science; Pure mathematics; Quantum computer; Quantum mechanics; Artificial intelligence; Physics; Mathematical analysis","score_opus":0.015363670151141233,"score_gpt":0.2641442393861399,"score_spread":0.24878056923499867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064337722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74028313,0.07230473,0.17068204,0.00401047,0.0040909746,0.0016727824,0.000013252204,0.0016257127,0.0053169136],"genre_scores_gemma":[0.99648124,0.00023844189,0.0013510383,0.0005239553,0.001088061,0.000042049134,0.0000057761154,0.000030123549,0.00023933804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741524,0.00032969742,0.0005147598,0.00067058654,0.0004918985,0.00057782134],"domain_scores_gemma":[0.9981515,0.0003447204,0.00038341008,0.0008437155,0.00014320973,0.00013348424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006140786,0.00032571668,0.0007436854,0.00006690468,0.00027510003,0.00019678974,0.00095653126,0.000042830467,0.000003764861],"category_scores_gemma":[0.00012494228,0.00025813782,0.0003041541,0.00095271645,0.00003368373,0.00026315704,0.00022274588,0.00040766687,0.0001796472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032612,0.0031040984,0.012308124,0.029445002,0.00033985474,0.0007438939,0.0019885425,0.037481412,0.0038380132,0.3719428,0.09264267,0.446133],"study_design_scores_gemma":[0.0003378969,0.00016200266,0.0024013894,0.00817811,0.000046404966,0.00019958605,0.00003282196,0.9274346,0.00042922926,0.018929737,0.040981453,0.0008667557],"about_ca_topic_score_codex":0.0006867941,"about_ca_topic_score_gemma":0.000037739115,"teacher_disagreement_score":0.8899532,"about_ca_system_score_codex":0.000066897366,"about_ca_system_score_gemma":0.00006878368,"threshold_uncertainty_score":0.99998707},"labels":[],"label_agreement":null},{"id":"W2064517571","doi":"10.1103/physrevlett.112.190501","title":"Hamiltonian Learning and Certification Using Quantum Resources","year":2014,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":222,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Computer science; Quantum simulator; Quantum; Hamiltonian (control theory); Quantum computer; Ising model; Certification; Quantum algorithm; Statistical physics; Computational science; Theoretical computer science; Physics; Computer engineering; Quantum mechanics; Mathematics; Mathematical optimization","score_opus":0.01622352756735719,"score_gpt":0.2742619206735981,"score_spread":0.25803839310624094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064517571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.755837,0.0022340333,0.23058924,0.010968308,0.000078998906,0.00010771957,1.5947897e-7,0.00013716622,0.00004737482],"genre_scores_gemma":[0.98295635,0.00027638854,0.010736488,0.0057860455,0.00022576454,0.0000037589436,8.247564e-7,0.0000109597595,0.0000034422997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989161,0.00020571063,0.00014923446,0.00034008574,0.00018251219,0.00020638609],"domain_scores_gemma":[0.9994011,0.00015305946,0.00010058652,0.00024934817,0.000018231414,0.000077708966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002863329,0.00012541568,0.00021929856,0.00003334574,0.00018012589,0.000101093094,0.00028458764,0.0000067935403,8.2639843e-7],"category_scores_gemma":[0.0000797124,0.00010064216,0.00006620849,0.00021726263,0.000053582942,0.000104984225,0.0001389541,0.00020567926,0.000014107677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041317126,0.00012999163,0.0011411799,0.0018266555,0.0000479974,0.00001080128,0.0027949312,0.018621732,0.0975134,0.019490432,0.0008295852,0.8575892],"study_design_scores_gemma":[0.000050874827,0.000027758797,0.0012069042,0.000523373,0.000010876127,0.000009672049,0.0000013622133,0.9703697,0.000081562095,0.00059198646,0.026981382,0.00014456066],"about_ca_topic_score_codex":0.000011365389,"about_ca_topic_score_gemma":1.5896426e-7,"teacher_disagreement_score":0.95174795,"about_ca_system_score_codex":0.000011105627,"about_ca_system_score_gemma":0.000005090018,"threshold_uncertainty_score":0.41040683},"labels":[],"label_agreement":null},{"id":"W2064548777","doi":"10.1103/physreva.67.042308","title":"Tackling systematic errors in quantum logic gates with composite rotations","year":2003,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":252,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Quantum logic; Quantum computer; Quantum gate; Quantum error correction; Quantum; Computer science; Quantum network; Qubit; Computation; Context (archaeology); Logic gate; Quantum Fourier transform; Physics; Theoretical computer science; Algorithm; Quantum mechanics","score_opus":0.013683301435816305,"score_gpt":0.27942652558935777,"score_spread":0.26574322415354146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064548777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4652668,0.055558603,0.46813086,0.004935732,0.0003033776,0.0032831805,0.0000022811632,0.0005471282,0.001972048],"genre_scores_gemma":[0.97813743,0.0002557984,0.020772582,0.0007212134,0.000023518336,0.00006913268,0.0000010074831,0.0000107839105,0.000008510225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859923,0.00029228773,0.000284677,0.00032045736,0.00023907902,0.00026424587],"domain_scores_gemma":[0.99905825,0.00028962386,0.00013256072,0.00039209388,0.000049940463,0.00007755001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003173906,0.00016996423,0.0005014307,0.00005305522,0.000087200926,0.00006389883,0.0003891232,0.000012677912,0.0000015284803],"category_scores_gemma":[0.0001343479,0.0001086181,0.000090728805,0.0007642746,0.000031813262,0.00011439283,0.000052947657,0.00019831053,0.000042636064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033857702,0.0008086452,0.000540894,0.05538674,0.00007371988,0.00013638372,0.0018955615,0.044697497,0.00058519037,0.89251375,0.00008527881,0.0032729323],"study_design_scores_gemma":[0.00025042682,0.00014925661,0.00046632616,0.036031786,0.000042489115,0.0000710542,0.000015920983,0.92961705,0.00015127195,0.0327007,0.00014657658,0.00035716765],"about_ca_topic_score_codex":0.000007631972,"about_ca_topic_score_gemma":0.000002177179,"teacher_disagreement_score":0.8849195,"about_ca_system_score_codex":0.000021705971,"about_ca_system_score_gemma":0.000039630984,"threshold_uncertainty_score":0.44293177},"labels":[],"label_agreement":null},{"id":"W2064591252","doi":"10.1103/physreva.82.042304","title":"Universal quantum computation by discontinuous quantum walk","year":2010,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum walk; Quantum computer; Quantum algorithm; Quantum network; Qubit; Quantum error correction; Adjacency matrix; Mathematics; Quantum; Computer science; Discrete mathematics; Graph; Quantum mechanics; Physics","score_opus":0.006649356744580618,"score_gpt":0.2663318508694621,"score_spread":0.2596824941248815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064591252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4715979,0.0048060142,0.5117153,0.008593495,0.0012047504,0.00057168194,0.0000149122625,0.0005830487,0.00091288635],"genre_scores_gemma":[0.99264854,0.00031442678,0.005850102,0.0008529169,0.00027115294,0.0000055989,0.000014560136,0.000014572361,0.000028134633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984978,0.0001013328,0.00023377819,0.00048387976,0.00033263664,0.00035058643],"domain_scores_gemma":[0.9989612,0.00018691043,0.0001440547,0.00046590774,0.00007121918,0.00017067154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020891937,0.00022273026,0.00038824236,0.000035594556,0.00014155981,0.000111703484,0.00078732846,0.0000323049,0.000007988486],"category_scores_gemma":[0.000075779266,0.0001743129,0.00018817671,0.00041012993,0.00007662948,0.00023308682,0.00018948843,0.0005015431,0.00010900555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004891355,0.0005124029,0.00008869224,0.00053238176,0.000044947512,0.000043254917,0.00040738308,0.00031300067,0.0077978773,0.23698819,0.016102446,0.73716456],"study_design_scores_gemma":[0.00020527045,0.000120512384,0.00065663236,0.00033133704,0.000020838628,0.000023432221,0.0000032215178,0.94788677,0.00019193187,0.030299872,0.019933423,0.00032677583],"about_ca_topic_score_codex":0.000050545765,"about_ca_topic_score_gemma":0.0000031070829,"teacher_disagreement_score":0.9475737,"about_ca_system_score_codex":0.000010526094,"about_ca_system_score_gemma":0.000049948318,"threshold_uncertainty_score":0.71082735},"labels":[],"label_agreement":null},{"id":"W2064906820","doi":"10.1007/s00220-006-0150-x","title":"Efficient Quantum Algorithms for Simulating Sparse Hamiltonians","year":2006,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":689,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Sublinear function; Scaling; Bounded function; Hamiltonian (control theory); Quantum computer; Quantum algorithm; Quantum; Integer (computer science)","score_opus":0.04549101561219962,"score_gpt":0.3138557577566935,"score_spread":0.2683647421444939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064906820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014162202,0.00011675687,0.98246086,0.0011131717,0.000072777606,0.00039284912,0.0000064097894,0.00019674875,0.0014782258],"genre_scores_gemma":[0.50079274,0.000001518507,0.49899438,0.000053055137,0.00006366068,0.000047745652,0.000006873079,0.000013936913,0.000026124859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856794,0.00009520838,0.00046754806,0.00030307067,0.000207192,0.00035903708],"domain_scores_gemma":[0.9963426,0.0013573458,0.00012966969,0.00202955,0.000092059025,0.000048755803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046243184,0.00017743369,0.00026118345,0.00007163546,0.00032497532,0.00012921295,0.0019123175,0.000058705078,0.0000013429509],"category_scores_gemma":[0.00011126591,0.00016478739,0.000120135766,0.000540097,0.00014879019,0.0000621346,0.0006991625,0.00027373817,0.00002807625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.584301e-7,0.00046445697,0.00001674076,0.000031629697,0.0000043718915,7.45433e-7,0.00043257995,0.24432862,0.00007191172,0.73534244,0.00005396731,0.01925176],"study_design_scores_gemma":[0.00018693146,0.000016533286,0.00007678152,0.000056343575,0.0000034213253,0.0000023100902,0.0000144760625,0.6145571,0.000042070467,0.38465607,0.00026518604,0.0001228016],"about_ca_topic_score_codex":0.000015178111,"about_ca_topic_score_gemma":0.000003407514,"teacher_disagreement_score":0.48663053,"about_ca_system_score_codex":0.000053658394,"about_ca_system_score_gemma":0.000044759778,"threshold_uncertainty_score":0.6719835},"labels":[],"label_agreement":null},{"id":"W2065276051","doi":"10.1142/s0219749904000109","title":"EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS","year":2004,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; St. Jerome's University","funders":"","keywords":"Quantum Fourier transform; Quantum algorithm; Logarithm; Algorithm; Quantum phase estimation algorithm; Discrete Fourier transform (general); Quantum computer; Fourier transform; Discrete logarithm; Quantum; Quantum error correction; Mathematics; Computer science; Discrete mathematics; Quantum mechanics; Fourier analysis; Fractional Fourier transform; Physics; Mathematical analysis; Public-key cryptography","score_opus":0.007846436893072413,"score_gpt":0.24884562765241278,"score_spread":0.24099919075934037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065276051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10246704,0.00010692486,0.88921744,0.006058471,0.0018030012,0.000085397514,0.000010979779,0.00005023608,0.00020049486],"genre_scores_gemma":[0.9439074,0.00014762406,0.054907944,0.00065688445,0.00035372548,0.0000018986254,0.0000098337,0.000008548975,0.000006185893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785906,0.000031664724,0.00082046486,0.00013064606,0.0009168182,0.00024133422],"domain_scores_gemma":[0.998477,0.00007313521,0.0005808916,0.00017630271,0.0005370737,0.00015560824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006298085,0.00019122791,0.00022672395,0.00047209577,0.000120756624,0.00050157,0.00094122667,0.00008348185,0.000006816433],"category_scores_gemma":[0.000094825176,0.00014570986,0.000149264,0.00019824084,0.00007157288,0.0037722543,0.0001317722,0.00037171782,0.000017677625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118621756,0.00013241633,0.00016552789,0.000039602095,0.000275191,0.00015794951,0.009218772,0.04065785,0.00019800208,0.34236026,0.00030446943,0.60637134],"study_design_scores_gemma":[0.0025019958,0.0005138134,0.0032073874,0.0002095588,0.00001585191,0.0024859987,0.00021143178,0.89399505,0.00079260254,0.08534719,0.010395747,0.0003233697],"about_ca_topic_score_codex":0.000038746795,"about_ca_topic_score_gemma":0.0000014706185,"teacher_disagreement_score":0.8533372,"about_ca_system_score_codex":0.00010640617,"about_ca_system_score_gemma":0.00017027259,"threshold_uncertainty_score":0.59418756},"labels":[],"label_agreement":null},{"id":"W2065655172","doi":"10.1103/physrevlett.112.070501","title":"Self-Correcting Quantum Memories Beyond the Percolation Threshold","year":2014,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Percolation (cognitive psychology); Statistical physics; Physics; Percolation threshold; Dimension (graph theory); Gravitational singularity; Monte Carlo method; Quantum; Range (aeronautics); Critical dimension; Field (mathematics); Condensed matter physics; Quantum mechanics; Materials science; Mathematics; Combinatorics","score_opus":0.00887454255238636,"score_gpt":0.25046530609001694,"score_spread":0.24159076353763057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065655172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40142018,0.0043471935,0.46849945,0.1216806,0.0015857577,0.0007454733,9.594262e-7,0.00080857484,0.00091181544],"genre_scores_gemma":[0.95371157,0.00015080778,0.007536779,0.037685614,0.0008719706,0.00002270681,0.000001656061,0.000015335,0.0000035447458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860513,0.00018283239,0.00020587223,0.0003660956,0.0003423223,0.0002977185],"domain_scores_gemma":[0.99874556,0.00043336742,0.00012242493,0.0005984588,0.00003636078,0.00006381461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005626998,0.00018242598,0.00027023003,0.000023731545,0.00031923837,0.00015196446,0.0008240609,0.000008541711,0.0000017581766],"category_scores_gemma":[0.0000882612,0.000111077716,0.00017059543,0.00038742277,0.000048588434,0.00019450471,0.00021986103,0.00031876992,0.000056473058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005650046,0.00038790706,0.0006788782,0.0024798138,0.000156471,0.00001778893,0.009859332,0.013792875,0.0048950356,0.18704234,0.027502976,0.7531809],"study_design_scores_gemma":[0.00006545477,0.00003689294,0.00040933184,0.0002221335,0.00002264986,0.000016557558,0.0000039839197,0.9805848,0.00012916629,0.004555289,0.013769015,0.00018473706],"about_ca_topic_score_codex":0.00000447284,"about_ca_topic_score_gemma":5.7786343e-7,"teacher_disagreement_score":0.9667919,"about_ca_system_score_codex":0.000020441721,"about_ca_system_score_gemma":0.000012735263,"threshold_uncertainty_score":0.45296177},"labels":[],"label_agreement":null},{"id":"W2066040291","doi":"10.1142/s0129626410000193","title":"KEY DISTRIBUTION VERSUS KEY ENHANCEMENT IN QUANTUM CRYPTOGRAPHY","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Quantum cryptography; Quantum key distribution; Computer science; Cryptography; Key distribution; Key (lock); ID-based cryptography; Public-key cryptography; Theoretical computer science; Financial cryptography; Shared secret; Lattice-based cryptography; PKCS #1; Quantum information; Computer security; Quantum; Encryption; Quantum mechanics; Physics; Cryptosystem","score_opus":0.0100230100663497,"score_gpt":0.2420302842438384,"score_spread":0.2320072741774887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066040291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44721693,0.000077612814,0.54678637,0.004818402,0.0007667705,0.000091015594,0.0000012304049,0.0001420009,0.000099667064],"genre_scores_gemma":[0.9035467,0.000005065868,0.09546484,0.0007578902,0.0001698797,0.000022824044,0.000016183685,0.000012656827,0.000003950174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815863,0.00005234168,0.00030903498,0.0005679612,0.00035519278,0.000556814],"domain_scores_gemma":[0.9992283,0.000071431925,0.00014296852,0.0004048785,0.000044437715,0.00010799196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033952843,0.00023478808,0.00019736924,0.00015239183,0.00024792293,0.00033129082,0.000809902,0.000078034616,0.000006668208],"category_scores_gemma":[0.000042149382,0.00021678713,0.00008467706,0.00067740097,0.00010854355,0.0003305842,0.00017015092,0.0005806679,0.000026618773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047800053,0.0013250972,0.007176627,0.0004960378,0.00013038023,0.00033162924,0.01519349,0.057163112,0.19922149,0.06322556,0.01000906,0.6452495],"study_design_scores_gemma":[0.0016704416,0.00011885074,0.0071217655,0.00010906866,0.000007704083,0.000015828096,0.000022844699,0.97642887,0.0014196599,0.002306299,0.010172723,0.0006059251],"about_ca_topic_score_codex":0.000038465052,"about_ca_topic_score_gemma":0.000017809529,"teacher_disagreement_score":0.91926575,"about_ca_system_score_codex":0.000033094355,"about_ca_system_score_gemma":0.0000588453,"threshold_uncertainty_score":0.88403225},"labels":[],"label_agreement":null},{"id":"W2066124709","doi":"10.1142/s0219749910006332","title":"CAN QUANTUM MECHANICS HELP DISTRIBUTED COMPUTING?","year":2010,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Waterloo","funders":"","keywords":"Computer science; Focus (optics); Quantum information science; Quantum computer; Theoretical computer science; Computation; Quantum; Distributed computing; Quantum mechanics; Algorithm; Physics; Quantum entanglement","score_opus":0.0067752952753999856,"score_gpt":0.24142467848682314,"score_spread":0.23464938321142315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066124709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16167563,0.000012199772,0.82576126,0.0054711364,0.006847955,0.0000644221,0.000027458025,0.00007573192,0.00006421417],"genre_scores_gemma":[0.98302263,0.000010042288,0.015683731,0.0006782282,0.00056332455,6.295078e-7,0.000032536987,0.0000068842,0.000002004831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768865,0.00004677116,0.0009205938,0.00011802738,0.00097415573,0.0002517859],"domain_scores_gemma":[0.99712676,0.00013883956,0.0010466685,0.0002627016,0.0012698969,0.00015510796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082408707,0.00017838806,0.00021562813,0.00043034245,0.00013076542,0.0005222271,0.0018842503,0.00010231188,0.00001551737],"category_scores_gemma":[0.00033097676,0.00015070745,0.00017082547,0.00028447132,0.000032414424,0.0015172281,0.00027543755,0.00055204105,0.000029226458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005545876,0.00014355242,0.00025208326,0.000019194875,0.00016157166,0.00007203152,0.0027508538,0.025442485,0.0019559967,0.81342876,0.003095819,0.15262221],"study_design_scores_gemma":[0.00059122866,0.00013726612,0.0012191599,0.000049700557,0.0000064353853,0.0009225666,0.00007550775,0.9468704,0.00070541445,0.03645615,0.01278978,0.0001764066],"about_ca_topic_score_codex":0.000025857173,"about_ca_topic_score_gemma":0.00000451105,"teacher_disagreement_score":0.9214279,"about_ca_system_score_codex":0.000067835485,"about_ca_system_score_gemma":0.00021261658,"threshold_uncertainty_score":0.61456716},"labels":[],"label_agreement":null},{"id":"W2066568394","doi":"10.1103/physrevlett.109.110501","title":"Epistemic View of Quantum States and Communication Complexity of Quantum Channels","year":2012,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum channel; Quantum information science; Quantum capacity; Quantum information; Classical capacity; Qubit; Quantum; Computer science; Quantum teleportation; Communication complexity; No-teleportation theorem; Quantum network; Quantum state; Statistical physics; Quantum mechanics; Physics; Theoretical computer science; Quantum entanglement","score_opus":0.033577705320632596,"score_gpt":0.2963473025835232,"score_spread":0.2627695972628906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066568394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8066862,0.053850565,0.12184828,0.016990509,0.0001582364,0.00037671183,0.000009502032,0.00006245459,0.00001749985],"genre_scores_gemma":[0.98566055,0.007264028,0.004912244,0.002082852,0.00005589806,0.000008317937,0.000006799596,0.000008791831,5.1185026e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861914,0.00029721562,0.00038496827,0.00019800219,0.00023727947,0.00026340436],"domain_scores_gemma":[0.99856406,0.00031355413,0.0003219581,0.0006492735,0.00005395051,0.000097170465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052750565,0.00016110262,0.00055673876,0.000037235586,0.00006423475,0.000016283331,0.00062388997,0.000009650609,0.0000019779088],"category_scores_gemma":[0.00003902494,0.0001263121,0.00012711747,0.00028491556,0.00029841883,0.00019530724,0.00033684532,0.00017177372,0.000005902852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140079865,0.0011729852,0.0014308739,0.016902471,0.00018452779,0.0000025599727,0.0072420584,0.0015000458,0.02391077,0.81055945,0.0028634411,0.13421679],"study_design_scores_gemma":[0.00024394144,0.0001216491,0.0046854476,0.0048183226,0.00005385406,0.000018999654,0.000013574729,0.960997,0.0013892374,0.025001008,0.0023014965,0.00035548903],"about_ca_topic_score_codex":0.00005378442,"about_ca_topic_score_gemma":2.175676e-7,"teacher_disagreement_score":0.9594969,"about_ca_system_score_codex":0.00001127815,"about_ca_system_score_gemma":0.000010688135,"threshold_uncertainty_score":0.51508576},"labels":[],"label_agreement":null},{"id":"W2067739665","doi":"10.1103/physrevlett.96.050501","title":"Method to Find Quantum Noiseless Subsystems","year":2006,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo; University of Toronto","funders":"","keywords":"Linear subspace; Decoherence-free subspaces; Formalism (music); Quantum; Quantum decoherence; Computer science; Quantum error correction; Realization (probability); Hilbert space; Algebraic number; Algebraic structure; Quantum operation; Quantum computer; Algebra over a field; Quantum mechanics; Mathematics; Open quantum system; Pure mathematics; Physics; Mathematical analysis","score_opus":0.011336148461012092,"score_gpt":0.28955653737598547,"score_spread":0.27822038891497336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067739665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074513786,0.0019982173,0.8956505,0.026857086,0.00022372852,0.00037659143,0.0000027713802,0.00020407393,0.0001732414],"genre_scores_gemma":[0.6510861,0.000107379885,0.26991957,0.07626564,0.0023459867,0.00012205578,0.000009921355,0.000061502,0.00008183373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981053,0.00024011485,0.0002950444,0.0005487789,0.00038918224,0.0004215765],"domain_scores_gemma":[0.9988979,0.00023050507,0.00010293263,0.00059348764,0.000039880164,0.0001352869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041357192,0.000227663,0.0004729988,0.000056927518,0.00010309654,0.000108842105,0.000935088,0.000009673302,0.000002492728],"category_scores_gemma":[0.000016601778,0.00017690234,0.00021529738,0.0006792339,0.000020435085,0.00010715254,0.00021938824,0.00020398709,0.00022621843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008277977,0.0006718665,0.00020161257,0.0034751093,0.0000910324,0.00019642076,0.00081153226,0.06711396,0.12664397,0.19004141,0.16503376,0.44571105],"study_design_scores_gemma":[0.00022925141,0.00009611168,0.002902925,0.0019801618,0.00003416755,0.000046181904,0.0000014414379,0.8780684,0.0011659447,0.003376922,0.11134808,0.00075042143],"about_ca_topic_score_codex":0.00008810752,"about_ca_topic_score_gemma":0.0000010331044,"teacher_disagreement_score":0.81095445,"about_ca_system_score_codex":0.000029033868,"about_ca_system_score_gemma":0.000018989555,"threshold_uncertainty_score":0.7213868},"labels":[],"label_agreement":null},{"id":"W2069072468","doi":"10.1103/physrevlett.88.017905","title":"Reducing Constraints on Quantum Computer Design by Encoded Selective Recoupling","year":2001,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Qubit; Quantum logic; Computer science; Quantum computer; Quantum; Isotropy; Encoding (memory); Physics; Quantum error correction; Quantum mechanics; Quantum information; Quantum gate; Topology (electrical circuits); Theoretical computer science; Electrical engineering; Engineering","score_opus":0.020702976211630357,"score_gpt":0.27359499516839375,"score_spread":0.2528920189567634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069072468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050301462,0.00076464395,0.9358258,0.012009435,0.00032445826,0.00041150954,0.0000018893012,0.00025930017,0.00010148647],"genre_scores_gemma":[0.86153555,0.0012553011,0.085005164,0.051182754,0.0009088403,0.000045739533,0.0000080462,0.000048387687,0.000010234274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997785,0.00027532625,0.0003097328,0.0007360143,0.00037270843,0.0005212194],"domain_scores_gemma":[0.9985647,0.0005662603,0.0001661839,0.0004944709,0.00005044897,0.0001579244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047141142,0.00030605102,0.00048011736,0.000058226735,0.0001948769,0.000112373826,0.000738106,0.000017017437,0.000007895615],"category_scores_gemma":[0.000054447584,0.00025136466,0.00018943194,0.00056735735,0.000102491314,0.0001574541,0.00013082943,0.0004661491,0.00010712945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001740566,0.0004451295,0.000015049538,0.0002895297,0.00011040469,0.00013514966,0.00088874943,0.0808312,0.024292734,0.0024559144,0.086591184,0.80392754],"study_design_scores_gemma":[0.00020005317,0.00020420397,0.00004393413,0.0015729285,0.000016257049,0.000053843796,0.000001009217,0.9935635,0.0011386079,0.0006261849,0.0022091223,0.0003704108],"about_ca_topic_score_codex":0.000006629986,"about_ca_topic_score_gemma":4.5370733e-8,"teacher_disagreement_score":0.91273224,"about_ca_system_score_codex":0.00006649433,"about_ca_system_score_gemma":0.00003766966,"threshold_uncertainty_score":0.99999386},"labels":[],"label_agreement":null},{"id":"W2069076235","doi":"10.1016/j.jcta.2013.05.006","title":"Average mixing of continuous quantum walks","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Kempe Foundation","keywords":"Combinatorics; Adjacency matrix; Mathematics; Valency; Mixing (physics); Matrix (chemical analysis); Discrete mathematics; Quantum walk; Graph; Quantum; Quantum algorithm; Physics; Quantum mechanics","score_opus":0.004749944518514823,"score_gpt":0.2049384801558578,"score_spread":0.20018853563734298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069076235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85644317,0.0004997953,0.13005903,0.0009307958,0.010828242,0.00017773667,0.0000014557767,0.00006138489,0.0009983788],"genre_scores_gemma":[0.9909182,0.000018839264,0.008340282,0.0000702409,0.0005485971,0.000001300302,1.8206107e-7,0.000013113314,0.00008924826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981441,0.00029429598,0.0006926789,0.00015562872,0.0004325417,0.00028074294],"domain_scores_gemma":[0.9978633,0.0003974612,0.000767451,0.0003541721,0.00048220885,0.00013541308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011226215,0.00017673011,0.0004938563,0.00015848332,0.000117215495,0.00016482623,0.0010836154,0.000081962695,0.000050180028],"category_scores_gemma":[0.00025198367,0.00013490164,0.00022510462,0.00027717234,0.000115772884,0.00069211284,0.00024113378,0.0003813813,0.000007344259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106634034,0.00014989045,0.000077588105,0.000029956407,0.000090392256,0.000057988294,0.0018317231,0.0006380101,0.0048453757,0.96773773,0.00070079736,0.023733888],"study_design_scores_gemma":[0.0011411486,0.0012674663,0.00046807915,0.00014381538,0.00001215406,0.00036406002,0.00016963406,0.008099015,0.006333802,0.97774774,0.004036728,0.00021633277],"about_ca_topic_score_codex":0.000011157732,"about_ca_topic_score_gemma":1.0575222e-7,"teacher_disagreement_score":0.13447502,"about_ca_system_score_codex":0.000024180265,"about_ca_system_score_gemma":0.000111803,"threshold_uncertainty_score":0.5501129},"labels":[],"label_agreement":null},{"id":"W2069447786","doi":"10.1016/j.jsc.2015.03.002","title":"Ancilla-free synthesis of large reversible functions using binary decision diagrams","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Binary decision diagram; Mathematics; Binary number; Exponential function; Function (biology); Boolean function; Algorithm; Theoretical computer science; Discrete mathematics; Computer science; Arithmetic","score_opus":0.02452229376098022,"score_gpt":0.27775794801266673,"score_spread":0.25323565425168654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069447786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46922266,0.000209138,0.5296212,0.00020639382,0.00063207664,0.00003845409,0.0000024333303,0.000018360888,0.000049286344],"genre_scores_gemma":[0.8152104,0.000008542929,0.18450989,0.00003937173,0.00021645935,3.4214952e-7,5.83148e-7,0.000008145551,0.000006263949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832016,0.00012367949,0.0005732781,0.00016741164,0.00060912955,0.00020633946],"domain_scores_gemma":[0.9979191,0.00038604919,0.00062098296,0.00028874452,0.00061784056,0.00016732035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010748781,0.00012725183,0.00031928215,0.0004068875,0.000119691766,0.00006817338,0.0005959174,0.00006071164,0.0000023726006],"category_scores_gemma":[0.0004513258,0.00010702799,0.00015640396,0.0007373324,0.000029721321,0.00038266345,0.00026342785,0.00019118012,0.0000042590777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006889483,0.00032199317,0.002117548,0.000043147975,0.0000910815,0.00007044795,0.002413364,0.7261953,0.0013587889,0.00085127354,0.005458418,0.26100978],"study_design_scores_gemma":[0.0008030425,0.00029808297,0.005896478,0.00026772587,0.000034108834,0.00033595544,0.0001807316,0.98169905,0.00044740396,0.009470105,0.00042910338,0.00013819673],"about_ca_topic_score_codex":0.000017037892,"about_ca_topic_score_gemma":0.0000022594031,"teacher_disagreement_score":0.34598774,"about_ca_system_score_codex":0.00009041403,"about_ca_system_score_gemma":0.000255117,"threshold_uncertainty_score":0.43644747},"labels":[],"label_agreement":null},{"id":"W2070705130","doi":"10.1007/s11128-013-0686-6","title":"A quantum genetic algorithm with quantum crossover and mutation operations","year":2013,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Crossover; Quantum computer; Quantum; Quantum algorithm; Quantum sort; Speedup; Qubit; Context (archaeology)","score_opus":0.0056980096729207525,"score_gpt":0.21644943385569235,"score_spread":0.2107514241827716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070705130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23863307,0.0001798336,0.75946194,0.0007645014,0.00014736663,0.00035893134,0.000003965275,0.00032446376,0.00012591753],"genre_scores_gemma":[0.79031545,0.000013088793,0.20869356,0.00076141726,0.00007336948,0.00007616324,0.000024131286,0.0000176041,0.000025184174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979914,0.000055404496,0.00061246235,0.0003572492,0.0005039778,0.00047951078],"domain_scores_gemma":[0.998657,0.000059332076,0.00025222581,0.00036302907,0.00048213726,0.00018627863],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022528622,0.00030965614,0.00024297278,0.0002974581,0.00086257746,0.002548637,0.00044689997,0.000104977174,0.00002024784],"category_scores_gemma":[0.00004919755,0.00024402245,0.000041625237,0.0006905226,0.00013456722,0.005929062,0.00016354889,0.00028470266,0.00013773526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008424931,0.00005489163,0.00010201424,0.00016319178,0.000022602992,0.000009246984,0.008320626,0.0294622,0.00010412485,0.01963331,0.00024612376,0.94187325],"study_design_scores_gemma":[0.0006586844,0.00019525144,0.005014649,0.00011104949,0.00000960333,0.00028474905,0.0004650793,0.9860772,0.00012539735,0.00605191,0.0006164216,0.00039001214],"about_ca_topic_score_codex":0.00019829847,"about_ca_topic_score_gemma":0.0000040489904,"teacher_disagreement_score":0.956615,"about_ca_system_score_codex":0.000041558254,"about_ca_system_score_gemma":0.00022534611,"threshold_uncertainty_score":0.9984868},"labels":[],"label_agreement":null},{"id":"W2070717444","doi":"10.5555/2133036.2133079","title":"Faster quantum algorithm for evaluating game trees","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tensor product; Algorithm; Computer science; Preprocessor; Quantum algorithm; Tree (set theory); Quantum; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.05337381782319568,"score_gpt":0.2890922384491728,"score_spread":0.23571842062597714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070717444","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016373644,0.0000543793,0.9805441,0.00020305792,0.00055928936,0.0002326972,0.0000027255066,0.0003496337,0.0016804638],"genre_scores_gemma":[0.13653515,0.0000011009043,0.8622633,0.00040079877,0.00015064,0.000025751018,0.0000014883664,0.000015469428,0.0006062578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985718,0.00005342683,0.0002525194,0.00046765688,0.00023508437,0.00041950532],"domain_scores_gemma":[0.99908954,0.00014134879,0.00008512942,0.00047833862,0.000103338585,0.00010231026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004615483,0.00017671092,0.000181452,0.000095634925,0.0001370541,0.000109788474,0.00080869364,0.00005453131,0.000043350956],"category_scores_gemma":[0.00003335571,0.00013487265,0.00012565781,0.0002011497,0.00003428412,0.00019934076,0.00024498743,0.00011366279,0.000043194872],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025892307,0.000052011306,0.000028208755,0.000005544673,0.000015951922,0.00000390491,0.0017876741,0.00011255714,0.0001944898,0.016962258,0.00029103443,0.9805438],"study_design_scores_gemma":[0.00036955648,0.00039077864,0.00085533754,0.00001602318,0.000005645181,0.000022155371,0.000037382426,0.975484,0.0012162098,0.020434214,0.0009526636,0.00021603491],"about_ca_topic_score_codex":0.00003644424,"about_ca_topic_score_gemma":0.0000044554367,"teacher_disagreement_score":0.9803277,"about_ca_system_score_codex":0.000011899949,"about_ca_system_score_gemma":0.00004563869,"threshold_uncertainty_score":0.5499947},"labels":[],"label_agreement":null},{"id":"W2070767505","doi":"10.1016/s0304-3975(01)00375-9","title":"PSPACE has constant-round quantum interactive proof systems","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"PSPACE; Gas meter prover; Computer-assisted proof; Constant (computer programming); Computer science; Quantum computer; Proof complexity; Mathematics; Proof assistant; Quantum; Discrete mathematics; Theoretical computer science; Automated theorem proving; Algorithm; Mathematical proof; Computational complexity theory; Quantum mechanics; Programming language; Physics; Geometry","score_opus":0.012780086443295102,"score_gpt":0.24749018085049437,"score_spread":0.23471009440719928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070767505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035296977,0.00013194905,0.9550339,0.0010981808,0.0026642813,0.000346839,0.0000022109814,0.0003416,0.0050840783],"genre_scores_gemma":[0.892573,0.0000017823801,0.10693865,0.0003047325,0.00013537971,0.000009598166,3.8334812e-7,0.000014629514,0.00002185905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587196,0.00041095386,0.00043204534,0.0012393788,0.0010037842,0.0010418822],"domain_scores_gemma":[0.99720365,0.0006177502,0.00016593093,0.0012096874,0.00034484905,0.0004581199],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021256746,0.0003635714,0.00039774601,0.00028565744,0.0010025031,0.0020422202,0.0027111988,0.0000817457,0.000019088773],"category_scores_gemma":[0.00024767726,0.00028333426,0.00010834224,0.001637806,0.003873476,0.0007360587,0.00086411746,0.00051901944,0.00008398563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005555285,0.00009008433,0.000018342045,0.000011971595,0.000009212466,0.00004404676,0.0008837485,0.0025554646,0.00026714194,0.9889884,0.0000984191,0.0070276414],"study_design_scores_gemma":[0.00026984277,0.00030843538,0.00004358976,0.00008790318,0.000004633974,0.000341269,0.000034157925,0.8487307,0.0020969284,0.1463762,0.0013326952,0.0003736971],"about_ca_topic_score_codex":0.000009827033,"about_ca_topic_score_gemma":5.019737e-7,"teacher_disagreement_score":0.857276,"about_ca_system_score_codex":0.00011732477,"about_ca_system_score_gemma":0.00046163227,"threshold_uncertainty_score":0.99996185},"labels":[],"label_agreement":null},{"id":"W2071218622","doi":"10.1088/1367-2630/8/3/035","title":"Encoding a qubit into multilevel subspaces","year":2006,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Qubit; Quantum decoherence; Linear subspace; Fidelity; Computer science; Formalism (music); Flux qubit; Topology (electrical circuits); Theoretical computer science; Quantum; Quantum mechanics; Physics; Mathematics; Pure mathematics; Telecommunications","score_opus":0.01230667188525037,"score_gpt":0.24189897562769203,"score_spread":0.22959230374244166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071218622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115908116,0.00025894112,0.88216436,0.00086123927,0.00047592173,0.000025698017,1.8729318e-7,0.00003052114,0.0002750024],"genre_scores_gemma":[0.796353,0.000005137271,0.20174794,0.00008593044,0.0017059849,1.2407686e-7,1.6206232e-7,0.0000072474204,0.000094469404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990635,0.00003295421,0.00026309077,0.00012970371,0.00032282498,0.00018794162],"domain_scores_gemma":[0.9992292,0.00009261936,0.00029884413,0.00017822001,0.0001099988,0.000091154536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001659891,0.000114332295,0.00018389474,0.0000633697,0.00010339147,0.00013697978,0.0006350094,0.000029931361,0.0000020251887],"category_scores_gemma":[0.000016360915,0.00009062184,0.00012867639,0.00022435468,0.000022430619,0.00030475148,0.00010580816,0.00025465412,0.000007278778],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009029381,0.00015274466,0.00065127964,0.000020348225,0.000036281715,0.000101628044,0.00290457,0.079545975,0.015854945,0.043194085,0.00727878,0.8502503],"study_design_scores_gemma":[0.0012248633,0.0003027799,0.0034113624,0.00020537352,0.00001926679,0.00025087237,0.00003831272,0.6844269,0.031551283,0.27045077,0.007739227,0.00037896752],"about_ca_topic_score_codex":0.000117162184,"about_ca_topic_score_gemma":0.0000063765274,"teacher_disagreement_score":0.84987134,"about_ca_system_score_codex":0.000026855392,"about_ca_system_score_gemma":0.00013674865,"threshold_uncertainty_score":0.36954513},"labels":[],"label_agreement":null},{"id":"W2071422482","doi":"10.1103/physrevlett.95.250503","title":"Adiabatic Quantum Computation in Open Systems","year":2005,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":221,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Adiabatic process; Computation; Quantum computer; Quantum; Physics; Quantum mechanics; Computer science; Algorithm","score_opus":0.019587993607503244,"score_gpt":0.3044836481263628,"score_spread":0.28489565451885956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071422482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42493263,0.014031137,0.47483936,0.08265875,0.00068812893,0.0020136235,0.0000030745532,0.00029408836,0.00053922244],"genre_scores_gemma":[0.97139305,0.00024429004,0.011318789,0.01668153,0.00029343492,0.000047628157,0.0000037718078,0.000012351044,0.0000051453053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863505,0.00019199404,0.00028967578,0.00037434325,0.00023374004,0.00027517843],"domain_scores_gemma":[0.9992853,0.00016805086,0.00011251989,0.0003337825,0.000020300202,0.000080086276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035180373,0.00015065263,0.00037588342,0.000054216544,0.000056514404,0.00020830294,0.0010821044,0.000006882546,0.0000014522191],"category_scores_gemma":[0.000030083467,0.00012290095,0.00007665612,0.00047331836,0.000023560673,0.00034295334,0.000322302,0.0001961816,0.00013537056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035977712,0.000496809,0.00017090542,0.0016454824,0.000036352303,0.000056779696,0.0011823877,0.5242549,0.0013035731,0.035590827,0.017070366,0.418188],"study_design_scores_gemma":[0.00016762048,0.000025476756,0.000613756,0.0013143264,0.000005120669,0.000009245974,0.0000013783718,0.9910932,0.000007907029,0.00038318217,0.0062114666,0.00016727438],"about_ca_topic_score_codex":0.000048725204,"about_ca_topic_score_gemma":0.0000018301411,"teacher_disagreement_score":0.54646045,"about_ca_system_score_codex":0.000051148967,"about_ca_system_score_gemma":0.000024362354,"threshold_uncertainty_score":0.5011755},"labels":[],"label_agreement":null},{"id":"W2071427315","doi":"10.1142/s0129054103002023","title":"QUANTUM SOFTWARE REUSABILITY","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; National Science Foundation","keywords":"Computer science; Quantum circuit; Quantum Fourier transform; Quantum algorithm; Quantum phase estimation algorithm; Quantum network; Theoretical computer science; Quantum gate; Quantum; Quantum computer; Quantum error correction; Algorithm; Mathematics; Topology (electrical circuits); Quantum mechanics; Physics","score_opus":0.014623804691528124,"score_gpt":0.2890170193050417,"score_spread":0.27439321461351357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071427315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11902763,0.00004241578,0.8761456,0.00093757827,0.0036288558,0.000042367577,0.0000014743345,0.000024966923,0.00014907961],"genre_scores_gemma":[0.5398838,0.00000445934,0.45991394,0.000084679225,0.000105409374,3.2087e-7,2.1378318e-7,0.0000024568421,0.000004717941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758697,0.00008756949,0.0006480173,0.00026168508,0.0012116642,0.00020411324],"domain_scores_gemma":[0.99635535,0.00028047833,0.00059858465,0.00045241162,0.002189418,0.00012375505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017057863,0.00011474948,0.0001918658,0.00053801015,0.00016425198,0.00033187514,0.0034660206,0.000027691098,0.000014156613],"category_scores_gemma":[0.0007074609,0.00009706753,0.00014362686,0.00079056644,0.00040505442,0.0011926107,0.00032575298,0.00019546942,0.000006258638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016131906,0.00061380316,0.004296458,0.000014862098,0.000115356386,0.00005338537,0.0015795627,0.056674827,0.0023818773,0.47961456,0.00051489274,0.45412427],"study_design_scores_gemma":[0.001452939,0.0008457347,0.028719276,0.00027218772,0.000017688439,0.0021747842,0.000036269004,0.7191947,0.01290596,0.2145431,0.019288128,0.0005492243],"about_ca_topic_score_codex":0.0000057794164,"about_ca_topic_score_gemma":7.0861006e-7,"teacher_disagreement_score":0.6625199,"about_ca_system_score_codex":0.000092741095,"about_ca_system_score_gemma":0.0008004375,"threshold_uncertainty_score":0.6440786},"labels":[],"label_agreement":null},{"id":"W2072319707","doi":"10.1145/1284621.1284648","title":"Toward a world with quantum computers","year":2007,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum computer; Quantum; Physics; Quantum mechanics","score_opus":0.03616090230657024,"score_gpt":0.27645661848171954,"score_spread":0.2402957161751493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072319707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10262595,0.0012741741,0.70378023,0.18479605,0.00066290144,0.00048878073,0.0000039482857,0.00040859333,0.0059593404],"genre_scores_gemma":[0.5454231,0.000006600429,0.45426086,0.00025530314,0.000013590014,0.0000015536883,5.7108065e-7,0.0000045175675,0.00003392087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999162,0.00008237584,0.0002130703,0.00015926611,0.00019276755,0.00019050243],"domain_scores_gemma":[0.97502774,0.00056469114,0.00015762653,0.024114545,0.00008756096,0.00004783398],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00046982494,0.00009650322,0.00012438961,0.00011085791,0.00025870666,0.000045978322,0.03965179,0.000020777885,9.572796e-7],"category_scores_gemma":[0.00040589992,0.000060675502,0.000071968876,0.0008815284,0.00024027812,0.00008240382,0.020573424,0.0002489637,0.000005784819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036910602,0.0006929144,0.007713234,0.000067446694,0.0001990051,0.000007910547,0.009612949,0.0077084643,0.0011719503,0.7839343,0.030450443,0.15840447],"study_design_scores_gemma":[0.00095153274,0.00021078337,0.06682413,0.00046826288,0.00003436263,0.000114690396,0.00016675417,0.60893875,0.0037031905,0.27079564,0.0472101,0.00058180466],"about_ca_topic_score_codex":0.000047045225,"about_ca_topic_score_gemma":0.00006751196,"teacher_disagreement_score":0.60123026,"about_ca_system_score_codex":0.000021127877,"about_ca_system_score_gemma":0.00005532056,"threshold_uncertainty_score":0.987348},"labels":[],"label_agreement":null},{"id":"W2072381205","doi":"10.1007/s00220-008-0710-3","title":"The Power of Quantum Systems on a Line","year":2009,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":219,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum computer; Adiabatic quantum computation; Quantum; Quantum algorithm; Computer science; Quantum entanglement; Turing machine; Quantum state; Quantum system; Qubit; Quantum process; Physics; Quantum mechanics; Statistical physics; Theoretical physics; Computation; Algorithm; Quantum dynamics","score_opus":0.03895156383951269,"score_gpt":0.31363103184592306,"score_spread":0.27467946800641035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072381205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008145484,0.00045654198,0.97872496,0.0060629006,0.000093929186,0.0002459075,0.000001574531,0.000089734065,0.006178951],"genre_scores_gemma":[0.9710494,0.00003205479,0.028771207,0.00009474713,0.000017829645,0.000008041879,7.0199224e-7,0.0000044027083,0.00002158697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907404,0.00013656926,0.0003221745,0.00012071894,0.00019167142,0.0001548206],"domain_scores_gemma":[0.99620324,0.0011189135,0.00011129542,0.0024762843,0.00006009557,0.000030182431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043066847,0.0000905195,0.00016570311,0.00003078169,0.0001720769,0.00007361278,0.002302567,0.000029772309,3.558925e-7],"category_scores_gemma":[0.00012759221,0.000058784248,0.000056018507,0.00039579632,0.00012317214,0.000053266464,0.00029043463,0.00027122075,0.00001966821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010645367,0.00026493365,0.0000013385313,0.000006190287,0.0000033106633,2.8368532e-7,0.00056457333,0.00460457,0.000024986715,0.97737765,0.00006271096,0.017088393],"study_design_scores_gemma":[0.00005484269,0.00007332085,0.000058495672,0.00008017624,9.916838e-7,0.0000014991487,0.0000247748,0.60433346,0.000031709427,0.39506683,0.0002311629,0.00004271279],"about_ca_topic_score_codex":0.0000014746166,"about_ca_topic_score_gemma":1.9238708e-7,"teacher_disagreement_score":0.9629039,"about_ca_system_score_codex":0.000016511582,"about_ca_system_score_gemma":0.000024504125,"threshold_uncertainty_score":0.42787808},"labels":[],"label_agreement":null},{"id":"W2072557993","doi":"10.1103/physrevlett.89.047901","title":"Comprehensive Encoding and Decoupling Solution to Problems of Decoherence and Design in Solid-State Quantum Computing","year":2002,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum decoherence; Qubit; Decoupling (probability); Quantum computer; Dynamical decoupling; Computer science; Scalability; Encoding (memory); Quantum; Constraint (computer-aided design); Topology (electrical circuits); Theoretical computer science; Quantum mechanics; Physics; Mathematics; Control engineering; Electrical engineering; Engineering; Artificial intelligence","score_opus":0.03811184674363054,"score_gpt":0.2890734273061864,"score_spread":0.25096158056255585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072557993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5338869,0.004661516,0.45894018,0.002107462,0.000038940372,0.0003295799,4.1376214e-7,0.000031879365,0.000003135137],"genre_scores_gemma":[0.95855355,0.0013777952,0.037587915,0.0024330034,0.000031135816,0.000007579121,2.2873517e-7,0.000008416576,3.5038954e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998637,0.00012508777,0.00032318235,0.00042262962,0.00017792892,0.00031417445],"domain_scores_gemma":[0.99909174,0.00042963904,0.00013340198,0.00020346971,0.00003847846,0.00010327568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028512973,0.0001729214,0.0004181043,0.00008142658,0.000086776134,0.00005392985,0.00027021393,0.0000087409435,5.3063377e-7],"category_scores_gemma":[0.000050661998,0.0001526209,0.000044605556,0.00040261706,0.0000624774,0.00013107868,0.00027404752,0.00018213657,0.000003847091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006729476,0.00022222822,0.0011359057,0.0042202766,0.000043620206,0.00004374898,0.009498357,0.31837708,0.10408863,0.0010404997,0.00045496112,0.56086797],"study_design_scores_gemma":[0.00013754041,0.000077525554,0.0014914378,0.0027636457,0.0000057291923,0.0000139944605,0.0000031588024,0.9944392,0.00029150094,0.0005322238,0.00006940932,0.00017467012],"about_ca_topic_score_codex":0.000022177124,"about_ca_topic_score_gemma":0.000001222793,"teacher_disagreement_score":0.6760621,"about_ca_system_score_codex":0.000017956745,"about_ca_system_score_gemma":0.000006458771,"threshold_uncertainty_score":0.62236995},"labels":[],"label_agreement":null},{"id":"W2072699061","doi":"10.1007/s10714-011-1245-z","title":"Two-site quantum random walk","year":2011,"lang":"en","type":"article","venue":"General Relativity and Gravitation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Measure (data warehouse); Quantum walk; Quantum operation; Quantum process; Quantum probability; Quantum decoherence; Quantum dissipation; Quantum; Quantum algorithm; Open quantum system","score_opus":0.017854126361675573,"score_gpt":0.23741461834836747,"score_spread":0.2195604919866919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072699061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6099344,0.0001351365,0.3886779,0.00024047006,0.00024043233,0.00008192912,0.0000019316649,0.000084134386,0.00060365937],"genre_scores_gemma":[0.89372677,0.00001140859,0.10581785,0.00015345556,0.000074006355,0.000004848113,0.0000058779065,0.0000060183243,0.00019974464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990402,0.00014126758,0.00015547757,0.00030985073,0.00015172793,0.00020151286],"domain_scores_gemma":[0.9994867,0.00009762343,0.00007999559,0.00021244523,0.000040856266,0.000082375445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003523816,0.00012465027,0.00013918705,0.00008515051,0.00022079184,0.0000718389,0.00015791829,0.00005150268,0.0000036068834],"category_scores_gemma":[0.000037433238,0.00010568075,0.000052731506,0.00021187596,0.000048145434,0.0003133435,0.00009992703,0.00016573202,0.000022883321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006511582,0.000118906886,0.0044625467,0.00002335673,0.000038651346,0.00003560567,0.015381172,0.0015476694,0.005322064,0.6969735,0.0002594701,0.27577195],"study_design_scores_gemma":[0.0012199617,0.00015539647,0.054505974,0.000019884743,0.000010468868,0.0000328442,0.000013842278,0.65288556,0.00076747715,0.28967902,0.00046962828,0.0002399502],"about_ca_topic_score_codex":0.00015847078,"about_ca_topic_score_gemma":0.000020673458,"teacher_disagreement_score":0.65133786,"about_ca_system_score_codex":0.000008517261,"about_ca_system_score_gemma":0.000017836623,"threshold_uncertainty_score":0.4309536},"labels":[],"label_agreement":null},{"id":"W2073519501","doi":"10.1103/physreva.84.062302","title":"Single-qubit unitary gates by graph scattering","year":2011,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Unitary state; Bloch sphere; Qubit; Quantum walk; Mathematics; Quantum computer; Scattering; Quantum mechanics; Irrational number; Eigenvalues and eigenvectors; Computation; Discrete mathematics; Quantum; Physics; Algorithm; Geometry","score_opus":0.024646457687295207,"score_gpt":0.24971824685283675,"score_spread":0.22507178916554155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073519501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55473304,0.120240435,0.2962179,0.010292077,0.0010585645,0.0013404656,0.000014941065,0.0018905555,0.014212003],"genre_scores_gemma":[0.97287405,0.0013333245,0.02148791,0.004024172,0.00019525524,0.00002332005,0.000004051955,0.00002327141,0.000034642315],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896777,0.000069742884,0.00016705146,0.000337146,0.00017829501,0.00027998976],"domain_scores_gemma":[0.99926025,0.00006718129,0.000068393565,0.00045487736,0.00003274909,0.000116549185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012178217,0.00016298972,0.00026988075,0.000029501092,0.00008253351,0.000036867157,0.0007353285,0.000013539887,0.000009724974],"category_scores_gemma":[0.000026178282,0.00012479782,0.00014424195,0.00040230833,0.000053594504,0.00014684018,0.00027358023,0.0001674375,0.00008035006],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026968341,0.00075001805,0.00011747565,0.0010272763,0.000053301603,0.00003969373,0.0011197424,0.00001787353,0.0099589145,0.021840101,0.008399974,0.9566729],"study_design_scores_gemma":[0.0011853772,0.0021475405,0.003969905,0.01638713,0.00025526597,0.0002828392,0.000026026762,0.29803666,0.063371524,0.4235016,0.18671377,0.0041223387],"about_ca_topic_score_codex":0.000022740536,"about_ca_topic_score_gemma":2.994836e-7,"teacher_disagreement_score":0.9525506,"about_ca_system_score_codex":0.000008671441,"about_ca_system_score_gemma":0.0000115524135,"threshold_uncertainty_score":0.5089107},"labels":[],"label_agreement":null},{"id":"W2074152613","doi":"10.1103/physrevlett.92.177906","title":"Exponential Speedup with a Single Bit of Quantum Information: Measuring the Average Fidelity Decay","year":2004,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Speedup; Quantum decoherence; Fidelity; Quantum algorithm; Exponential decay; Exponential function; Algorithm; Quantum information; Physics; Computer science; Statistical physics; Quantum; Quantum mechanics; Mathematics; Parallel computing; Mathematical analysis","score_opus":0.014639779471023013,"score_gpt":0.2353653179359467,"score_spread":0.22072553846492368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074152613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37978482,0.00070069864,0.6042055,0.01477259,0.00011847864,0.00026608224,0.0000017200691,0.00007413833,0.00007600123],"genre_scores_gemma":[0.98823863,0.000067409725,0.0051866025,0.0063621094,0.0001290045,0.000008308368,0.0000017173064,0.0000058051646,3.9794713e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873567,0.000075826334,0.00028916192,0.0001913917,0.00047523837,0.00023272369],"domain_scores_gemma":[0.9990725,0.00008935948,0.00019884102,0.00051339105,0.00006369038,0.000062250314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027086367,0.00015599481,0.00027519462,0.000031973814,0.000116671516,0.00008243645,0.0006877556,0.00000681151,0.0000019233453],"category_scores_gemma":[0.000030086205,0.000089989764,0.00014622314,0.00041356517,0.00009081304,0.0003859234,0.00017087431,0.00020127861,0.00002480471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006731805,0.0012725702,0.0001281364,0.005390181,0.00035719827,0.00009212466,0.0124777,0.52806765,0.043165185,0.09868329,0.002166458,0.3081322],"study_design_scores_gemma":[0.003830377,0.0013317938,0.007408331,0.017842978,0.0002666285,0.0003797791,0.00005065745,0.87710196,0.044507448,0.01094801,0.033915877,0.0024161339],"about_ca_topic_score_codex":0.000034739744,"about_ca_topic_score_gemma":8.76058e-7,"teacher_disagreement_score":0.6084538,"about_ca_system_score_codex":0.000030978546,"about_ca_system_score_gemma":0.000042697702,"threshold_uncertainty_score":0.36696762},"labels":[],"label_agreement":null},{"id":"W2075236172","doi":"10.1088/1367-2630/17/2/022005","title":"Quantum bootstrapping via compressed quantum Hamiltonian learning","year":2015,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Industry Canada; Canada Excellence Research Chairs, Government of Canada","keywords":"Physics; Qubit; Ising model; Hamiltonian (control theory); Quantum; Bayesian inference; Bootstrapping (finance); Statistical physics; Quantum simulator; Bayesian probability; Algorithm; Computer science; Quantum computer; Quantum mechanics; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.028363410121441838,"score_gpt":0.2561967476539574,"score_spread":0.22783333753251556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075236172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076464854,0.00038147732,0.92081577,0.0008599436,0.0011165631,0.000047575402,3.2727155e-7,0.00008424377,0.000229239],"genre_scores_gemma":[0.9681352,0.000012840363,0.03013633,0.00017482559,0.0014670711,2.4197075e-7,8.0618395e-7,0.000020971089,0.000051707153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981133,0.00015079351,0.0004785235,0.0002280802,0.000650896,0.0003784237],"domain_scores_gemma":[0.9982627,0.00012407602,0.0005797503,0.00030864225,0.00029606055,0.00042874392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050082454,0.0002140539,0.00037774313,0.0001065371,0.0001581274,0.0002196932,0.0010621211,0.00006139068,0.000001963598],"category_scores_gemma":[0.00006290329,0.00018280483,0.00019610507,0.0004231308,0.00004630672,0.00057340454,0.00019787003,0.0008151254,0.000016843293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004788857,0.0002463475,0.00060051924,0.000035455214,0.00015725204,0.00025885156,0.0070072757,0.59402424,0.00950652,0.038083266,0.0055615534,0.34447086],"study_design_scores_gemma":[0.000968754,0.00051177404,0.00045628697,0.00012591339,0.000014724633,0.00025483087,0.0000730987,0.9403656,0.0014575548,0.04386385,0.011662475,0.00024510696],"about_ca_topic_score_codex":0.00003807732,"about_ca_topic_score_gemma":8.8338146e-7,"teacher_disagreement_score":0.89167035,"about_ca_system_score_codex":0.00004800446,"about_ca_system_score_gemma":0.00038979496,"threshold_uncertainty_score":0.7454564},"labels":[],"label_agreement":null},{"id":"W2075846738","doi":"10.1038/ncomms1166","title":"Experimental magic state distillation for fault-tolerant quantum computing","year":2011,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Industry Canada; Government of Ontario; Canadian Institute for Advanced Research","keywords":"Computer science; Quantum computer; MAGIC (telescope); Distillation; Fault tolerance; Quantum; State (computer science); Computational science; Distributed computing; Physics; Chemistry; Algorithm; Quantum mechanics; Chromatography","score_opus":0.033921107418251294,"score_gpt":0.3030597747880555,"score_spread":0.26913866736980424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075846738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08832794,0.003782508,0.9023816,0.001705202,0.0008355944,0.0005955708,0.000027447473,0.00055349304,0.0017906595],"genre_scores_gemma":[0.7330845,0.000010251544,0.26653552,0.0002519779,0.000043883494,0.000011542729,0.000024714016,0.00001360151,0.000023989278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987651,0.00011673964,0.00030232055,0.00034141276,0.0001758787,0.00029851915],"domain_scores_gemma":[0.99756485,0.00028337073,0.0001710171,0.0017366926,0.0001553392,0.00008871998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002875574,0.0001796685,0.00017531066,0.000109744215,0.0005837465,0.00011251317,0.0023166698,0.000118574884,0.00000349732],"category_scores_gemma":[0.000051003033,0.00016387775,0.00011252234,0.00032920195,0.00009905891,0.00018630568,0.0007821557,0.0005715223,0.000014426452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048494345,0.0011775576,0.0011052077,0.00004777611,0.00013198522,0.000007778138,0.030377164,0.004179945,0.0042962455,0.8350093,0.0033840393,0.12023454],"study_design_scores_gemma":[0.00031590727,0.00008547639,0.0037039828,0.000029043169,0.0000057974635,0.000017000504,0.00007331534,0.97906804,0.0016705453,0.006032677,0.008764796,0.00023340945],"about_ca_topic_score_codex":0.00002895672,"about_ca_topic_score_gemma":0.000015821619,"teacher_disagreement_score":0.9748881,"about_ca_system_score_codex":0.00004201874,"about_ca_system_score_gemma":0.000047634974,"threshold_uncertainty_score":0.66827404},"labels":[],"label_agreement":null},{"id":"W2076107177","doi":"10.1142/s0219749904000079","title":"ON OPTIMAL QUANTUM CODES","year":2004,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":296,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prime power; Mathematics; Quantum; Prime (order theory); Discrete mathematics; Minimum distance; Combinatorics; Physics; Quantum mechanics","score_opus":0.008447742123175223,"score_gpt":0.25246443670026786,"score_spread":0.24401669457709263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076107177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26629043,0.00002130675,0.72710127,0.0040769717,0.0021523202,0.0000412975,0.0000048007496,0.000044048767,0.0002675392],"genre_scores_gemma":[0.9745177,0.000025991392,0.023821978,0.0013497167,0.00026749558,9.721991e-7,0.00000776866,0.000004845297,0.0000035141982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981309,0.000029944507,0.0006608758,0.0000879731,0.000915296,0.00017500285],"domain_scores_gemma":[0.99836665,0.00010426407,0.0006382896,0.00016922706,0.0006281805,0.000093400966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046627177,0.0001367482,0.00016037938,0.00047056715,0.00008311469,0.0003638702,0.001268498,0.000054868287,0.000008525623],"category_scores_gemma":[0.00018768973,0.000108909786,0.00014371803,0.00017608485,0.0000341675,0.0019365037,0.000116651725,0.00030527977,0.000092745926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005895358,0.00007758876,0.00000920592,0.0000046268906,0.000055807726,0.000051081068,0.0016160599,0.4504788,0.000057138,0.5185623,0.00061752746,0.028410926],"study_design_scores_gemma":[0.0017190229,0.00072952517,0.0008470135,0.00021238717,0.0000062269246,0.0011552391,0.000114584116,0.8975151,0.0015504154,0.08811681,0.0078103365,0.00022333064],"about_ca_topic_score_codex":0.00001585982,"about_ca_topic_score_gemma":3.5384247e-7,"teacher_disagreement_score":0.7082273,"about_ca_system_score_codex":0.00013615843,"about_ca_system_score_gemma":0.00015940356,"threshold_uncertainty_score":0.4441212},"labels":[],"label_agreement":null},{"id":"W2076585714","doi":"10.1016/j.laa.2011.04.022","title":"Perfect state transfer in cubelike graphs","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Transfer (computing); Discrete mathematics; State (computer science); Trivially perfect graph; Graph; Code (set theory); Set (abstract data type); Algorithm; Chordal graph; Computer science; 1-planar graph","score_opus":0.014545572598634869,"score_gpt":0.22296745300852833,"score_spread":0.20842188040989346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076585714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5308571,0.0005071905,0.46681073,0.00033371084,0.000049653274,0.00033502877,0.0000071974628,0.00016039306,0.00093898666],"genre_scores_gemma":[0.9840864,0.00010769992,0.015397157,0.00022325697,0.000031577572,0.00006526492,0.0000025769993,0.000009379188,0.00007671009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919456,0.00002764828,0.00016553329,0.0003217529,0.00008644566,0.00020407437],"domain_scores_gemma":[0.9995643,0.00003960913,0.000016978443,0.00026555176,0.000029155997,0.000084437685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011732606,0.000109105196,0.00011010973,0.00011019718,0.000116508,0.000032231634,0.00033581388,0.00003597107,0.0000105180725],"category_scores_gemma":[0.0000029487212,0.00009420688,0.00003653424,0.00043211767,0.000029203413,0.000109246255,0.00007100105,0.00015787639,0.000032841792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009464884,0.00037078073,0.0014303838,0.000056674693,0.000030169467,0.000011780917,0.009918209,0.00019051609,0.0019922475,0.60949063,0.00007178646,0.37642735],"study_design_scores_gemma":[0.0008929117,0.00022638102,0.027794804,0.000043141004,0.000014110947,0.00005477289,0.000044273744,0.84634566,0.008576096,0.100763455,0.014571525,0.00067288347],"about_ca_topic_score_codex":0.000028170203,"about_ca_topic_score_gemma":0.000013573098,"teacher_disagreement_score":0.8461551,"about_ca_system_score_codex":0.0000040228465,"about_ca_system_score_gemma":0.000021034197,"threshold_uncertainty_score":0.3841645},"labels":[],"label_agreement":null},{"id":"W2078446413","doi":"10.1007/s00020-004-1345-1","title":"Noiseless Subsystems for Collective Rotation Channels in Quantum Information Theory","year":2005,"lang":"en","type":"article","venue":"Integral Equations and Operator Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; University of Guelph","funders":"Institut Périmètre de physique théorique","keywords":"Centralizer and normalizer; Mathematics; Rotation (mathematics); Class (philosophy); Operator algebra; Quantum channel; Operator (biology); Quantum; Algebra over a field; Pure mathematics; Channel (broadcasting); Set (abstract data type); Quantum information; Discrete mathematics; Quantum mechanics; Geometry; Computer science; Physics","score_opus":0.010237592408207149,"score_gpt":0.2425020617703821,"score_spread":0.23226446936217496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078446413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16721307,0.0001498047,0.8309655,0.0005362144,0.0003018721,0.00050542614,0.000014890068,0.00007332079,0.00023987032],"genre_scores_gemma":[0.98930657,0.0000051232278,0.00988103,0.0003639483,0.00013305228,0.00016545018,0.000015401409,0.000007870304,0.00012153426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988682,0.00022448007,0.0003335261,0.00021737543,0.00012938555,0.00022699662],"domain_scores_gemma":[0.9988535,0.00062609825,0.00008947038,0.0001855055,0.00018319068,0.00006221492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012218968,0.00014989336,0.0001723326,0.0002712277,0.0002780053,0.00031404762,0.0002750968,0.000072519004,0.0000052783034],"category_scores_gemma":[0.00025584913,0.00011978158,0.000050528877,0.00039939108,0.00004680607,0.00087731786,0.00005671094,0.00015267661,0.000012428237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003157775,0.00003202654,0.000017051176,0.000012720733,0.000010258391,3.3598909e-7,0.008201117,0.015720969,0.00006840228,0.83036214,0.00003313933,0.14551027],"study_design_scores_gemma":[0.000563429,0.000108660504,0.0001249103,0.000057011377,0.0000041029443,0.0000053148133,0.0008602529,0.8999531,0.00050265726,0.09693596,0.0007216032,0.00016300265],"about_ca_topic_score_codex":0.00002323308,"about_ca_topic_score_gemma":0.000026393898,"teacher_disagreement_score":0.8842321,"about_ca_system_score_codex":0.00008775493,"about_ca_system_score_gemma":0.00013419404,"threshold_uncertainty_score":0.48845512},"labels":[],"label_agreement":null},{"id":"W2078806583","doi":"10.1103/physreva.76.022316","title":"Symmetries and noise in quantum walk","year":2007,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Noise (video); Hadamard transform; Homogeneous space; Quantum; Quantum noise; Quantum algorithm; Physics; Statistical physics; Quantum mechanics; Computer science; Mathematics; Geometry","score_opus":0.010580401919733426,"score_gpt":0.2874356622427661,"score_spread":0.2768552603230327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078806583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8157787,0.06783828,0.108293205,0.005903944,0.00022175403,0.00041514312,0.0000010050089,0.00018192873,0.0013660538],"genre_scores_gemma":[0.9915209,0.0019301766,0.0048719468,0.0015606687,0.00010354991,0.0000020374946,3.6451985e-7,0.000004461146,0.000005936118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991317,0.000037887636,0.00016759368,0.00025888433,0.00016093435,0.0002430208],"domain_scores_gemma":[0.9993448,0.00024779848,0.00004441241,0.0002485214,0.00002760488,0.00008681373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000428933,0.00010602194,0.00024765765,0.000057997142,0.00003858198,0.00003581523,0.0002879888,0.000012594564,9.1863274e-7],"category_scores_gemma":[0.00014971201,0.00007908856,0.00005438663,0.0005895803,0.00003605685,0.000092038215,0.00013936567,0.00016509506,0.000015204721],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017372383,0.0000865207,0.0006014509,0.00042784013,0.0000044964463,0.000040350846,0.00023755076,0.000030998213,0.00011566551,0.07073566,0.00012594399,0.9275918],"study_design_scores_gemma":[0.0005350922,0.000288011,0.13464612,0.0037346203,0.000020174744,0.0000704473,0.000011034604,0.7264333,0.00076854776,0.1133316,0.019459585,0.0007014905],"about_ca_topic_score_codex":0.000024288405,"about_ca_topic_score_gemma":0.0000043123764,"teacher_disagreement_score":0.9268903,"about_ca_system_score_codex":0.000007999331,"about_ca_system_score_gemma":0.000015028651,"threshold_uncertainty_score":0.3225138},"labels":[],"label_agreement":null},{"id":"W2079099822","doi":"10.1103/physrevlett.109.080505","title":"Efficient Measurement of Quantum Gate Error by Interleaved Randomized Benchmarking","year":2012,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":436,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Controlled NOT gate; Computer science; Quantum gate; Quantum error correction; Quantum computer; Toffoli gate; Algorithm; Quantum circuit; Electronic engineering; Physics; Quantum mechanics; Quantum","score_opus":0.018157302002310232,"score_gpt":0.269060603061445,"score_spread":0.2509033010591348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079099822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24470243,0.037422005,0.70839566,0.0077669374,0.0007393414,0.00078057987,0.000002733711,0.00011733753,0.000072970455],"genre_scores_gemma":[0.99206966,0.00032590213,0.003111819,0.00423479,0.0002097632,0.000032677286,0.0000017901829,0.00001261667,9.937364e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760973,0.00045702455,0.0004633217,0.00031405943,0.00069948216,0.00045637888],"domain_scores_gemma":[0.99874,0.00027542262,0.00029786673,0.00046820412,0.00006775847,0.0001507214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017998945,0.00023320624,0.00082935876,0.000044776873,0.000065773376,0.00002791381,0.00061623595,0.000009397147,0.000005575389],"category_scores_gemma":[0.0001467522,0.00016314458,0.00043112272,0.00029704827,0.00010854764,0.00006721066,0.00022389628,0.0002094004,0.000023524779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021048195,0.0065777106,0.00020540123,0.014073438,0.0017189503,0.000031275325,0.015260444,0.04294795,0.26981533,0.069448814,0.089776665,0.48803923],"study_design_scores_gemma":[0.0045716045,0.000036365047,0.00005277743,0.001959632,0.00006653111,0.000004558085,0.0000018188351,0.9897025,0.0010786525,0.0001135298,0.002150115,0.00026190525],"about_ca_topic_score_codex":0.000011642644,"about_ca_topic_score_gemma":4.9796803e-8,"teacher_disagreement_score":0.9467546,"about_ca_system_score_codex":0.00004445653,"about_ca_system_score_gemma":0.00001626703,"threshold_uncertainty_score":0.6652843},"labels":[],"label_agreement":null},{"id":"W2079493085","doi":"10.1088/1367-2630/12/8/083027","title":"Matchgate quantum computing and non-local process analysis","year":2010,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum process; Quantum circuit; Quantum error correction; Quantum computer; Quantum gate; Swap (finance); Quantum; Uncorrelated; Quantum algorithm; Measure (data warehouse)","score_opus":0.006815333760706959,"score_gpt":0.2547008136462002,"score_spread":0.24788547988549323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079493085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4479571,0.000022344755,0.5514038,0.00029722517,0.0002619804,0.00001714825,2.8087152e-7,0.000014711876,0.000025377078],"genre_scores_gemma":[0.93812495,0.000002989194,0.06103414,0.00011190137,0.00070972234,6.700269e-8,2.6271948e-7,0.000007791745,0.000008173721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988772,0.000027678518,0.00032912663,0.00019655758,0.00033887793,0.0002305265],"domain_scores_gemma":[0.9988948,0.00009518463,0.00038851812,0.00023407026,0.00017706433,0.00021034466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003374802,0.00014392418,0.00033324264,0.0001291484,0.00013404609,0.00018566696,0.0006434547,0.00004851407,0.0000020115574],"category_scores_gemma":[0.00001656397,0.0001132119,0.00016129969,0.00078402186,0.00006118201,0.0002594742,0.00014439793,0.0006165302,0.0000023674738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012616731,0.00013046795,0.003200932,0.00004089234,0.00042572807,0.000078703066,0.004652617,0.12733993,0.0038325537,0.009405886,0.00028606088,0.8505936],"study_design_scores_gemma":[0.00033778537,0.00010531681,0.0055087297,0.000029243925,0.00008196021,0.000116453346,0.000036038404,0.97006965,0.0018630665,0.021603229,0.00010341316,0.00014510179],"about_ca_topic_score_codex":0.00002080278,"about_ca_topic_score_gemma":0.000004551047,"teacher_disagreement_score":0.8504485,"about_ca_system_score_codex":0.000006953321,"about_ca_system_score_gemma":0.00013898857,"threshold_uncertainty_score":0.46166474},"labels":[],"label_agreement":null},{"id":"W2080375724","doi":"10.1088/1742-6596/95/1/012020","title":"Optimization and thermodynamics of classical problems from a quantum perspective","year":2008,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum thermodynamics; Perspective (graphical); Quantum; Thermodynamics; Statistical physics; Theoretical physics; Physics; Quantum mechanics; Computer science; Artificial intelligence","score_opus":0.017041582069296346,"score_gpt":0.22332429018719094,"score_spread":0.2062827081178946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080375724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2173217,0.000105798565,0.7816416,0.0006657362,0.000112998336,0.00003651315,0.000003844879,0.000012434105,0.00009940169],"genre_scores_gemma":[0.925341,0.00013885369,0.074371785,0.000017402494,0.00011575944,4.0844455e-7,6.1073604e-7,0.000005543301,0.000008615663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918616,0.000057010016,0.00026123947,0.00014165454,0.00024130836,0.00011262858],"domain_scores_gemma":[0.99884295,0.000075552336,0.00038519315,0.0001482296,0.00049016345,0.000057896406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008413737,0.000111165224,0.00026077215,0.00004498785,0.00008924592,0.000053968346,0.00032665525,0.00003877943,0.0000022241811],"category_scores_gemma":[0.00002775811,0.00008590857,0.00006632537,0.00015859652,0.0001962796,0.0004718657,0.00010584297,0.00021601918,2.477012e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064521766,0.0003015783,0.0005638522,0.000033317647,0.00016851726,0.0000484318,0.03430999,0.19788793,0.009251461,0.70598876,0.000037429338,0.051344194],"study_design_scores_gemma":[0.00026076633,0.00038018645,0.0014839729,0.00008330506,0.00000983487,0.000099902674,0.0003361108,0.85827553,0.0030162323,0.13592918,0.000014453967,0.00011051104],"about_ca_topic_score_codex":0.000024225496,"about_ca_topic_score_gemma":0.0000020869527,"teacher_disagreement_score":0.7080193,"about_ca_system_score_codex":0.000018203425,"about_ca_system_score_gemma":0.00019385762,"threshold_uncertainty_score":0.350325},"labels":[],"label_agreement":null},{"id":"W2080644448","doi":"10.1109/isit.2013.6620245","title":"Short random circuits define good quantum error correcting codes","year":2013,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Qubit; Quantum error correction; Encoding (memory); Error detection and correction; Electronic circuit; ENCODE; Quantum computer; Quantum","score_opus":0.016647565535630567,"score_gpt":0.23900568458529695,"score_spread":0.22235811904966638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080644448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37376776,0.00010603157,0.6200906,0.00091523165,0.0008781374,0.00023494437,8.0252784e-7,0.00059596775,0.003410486],"genre_scores_gemma":[0.9732827,0.000003405952,0.025552297,0.00045781958,0.00017179438,0.000020962329,0.000002227192,0.000016879447,0.0004919057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981858,0.000094876625,0.0003328997,0.00053559337,0.0003163921,0.00053443847],"domain_scores_gemma":[0.99872065,0.00036241373,0.00006720757,0.00056008436,0.000116106254,0.00017352524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036716613,0.00023516976,0.00030297317,0.00011240723,0.0002876653,0.0003689831,0.0009058376,0.00007272114,0.00006781288],"category_scores_gemma":[0.0000889728,0.00017988667,0.00012113725,0.00041874225,0.000044815628,0.00030229628,0.00033220957,0.0002827297,0.00026369753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002979259,0.00011817764,0.003086107,0.00002680302,0.00004528894,0.000022895041,0.00083097874,0.0035750864,0.0015328614,0.016574554,0.003778631,0.97040564],"study_design_scores_gemma":[0.00052130234,0.000084526735,0.0077479435,0.000034486347,0.000005488153,0.0001678822,0.00006792486,0.9848788,0.0013816195,0.004149973,0.0006289342,0.0003311365],"about_ca_topic_score_codex":0.00023639835,"about_ca_topic_score_gemma":0.000021979144,"teacher_disagreement_score":0.9813037,"about_ca_system_score_codex":0.00002031661,"about_ca_system_score_gemma":0.000044759377,"threshold_uncertainty_score":0.73355657},"labels":[],"label_agreement":null},{"id":"W2080711848","doi":"10.1364/icqi.2001.pa39","title":"Empirical Determination of Bang-Bang Controls","year":2001,"lang":"en","type":"article","venue":"Optical Fiber Communication Conference and International Conference on Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum decoherence; Bang–bang control; Set (abstract data type); Computer science; Quantum computer; Big Bang (financial markets); Quantum; Algorithm; Mathematics; Physics; Optimal control; Quantum mechanics; Mathematical optimization; Finance","score_opus":0.04705630212697417,"score_gpt":0.31466114369037096,"score_spread":0.2676048415633968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080711848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1271925,0.00007822708,0.7593225,0.024147227,0.00036147964,0.00048015738,0.000026742488,0.00023033623,0.08816078],"genre_scores_gemma":[0.97784877,0.00033513783,0.020869851,0.00062784564,0.000032803262,0.000025483485,0.00008719089,0.0000058757128,0.0001670572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827343,0.00012417702,0.000669464,0.00023680646,0.000466792,0.00022931762],"domain_scores_gemma":[0.99779236,0.00031861925,0.00035287504,0.000620013,0.00079514086,0.00012098815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043605824,0.00021164588,0.00025616112,0.00027831784,0.00018035054,0.0004407828,0.0011485834,0.00013276194,0.00019572006],"category_scores_gemma":[0.00021772961,0.00018943944,0.000075016214,0.00023681847,0.0001772698,0.0017096236,0.00033533282,0.0003352527,0.00010544469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048285732,0.00007826984,0.0002065719,0.000012430483,0.000016478753,9.135073e-7,0.00083620666,0.000092424474,0.00021496491,0.6871469,0.00010724963,0.31123933],"study_design_scores_gemma":[0.0006363843,0.00024058853,0.0037344324,0.00014658096,0.000008056017,0.00003676674,0.00015406239,0.9563711,0.00031665192,0.02952916,0.008583886,0.0002422851],"about_ca_topic_score_codex":0.00002092337,"about_ca_topic_score_gemma":0.000004773225,"teacher_disagreement_score":0.95627874,"about_ca_system_score_codex":0.00004251738,"about_ca_system_score_gemma":0.000111916335,"threshold_uncertainty_score":0.7725116},"labels":[],"label_agreement":null},{"id":"W2081214899","doi":"10.1142/s1793830914500542","title":"A combinatorial approach to quantum error correcting codes","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Quantum algorithm; Quantum computer; Quantum; Quantum convolutional code; Quantum error correction; Error detection and correction; Sequence (biology); Graph","score_opus":0.014254556871088467,"score_gpt":0.25764662273326366,"score_spread":0.2433920658621752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081214899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005435371,0.000038732036,0.98979896,0.00048219645,0.00019602479,0.0005388721,0.000010044033,0.00027238418,0.0032274167],"genre_scores_gemma":[0.37455142,0.0000041240896,0.6244136,0.00020643321,0.00041829396,0.00029906025,0.000012777358,0.000030410183,0.00006384843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841744,0.000045670324,0.0003455649,0.0005553932,0.00028175433,0.00035417354],"domain_scores_gemma":[0.99861336,0.00025095936,0.00014137226,0.0006693195,0.0000873147,0.00023770062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050003454,0.00023655908,0.00031073528,0.000112810194,0.00049026276,0.00035624453,0.00070691766,0.00006900313,0.0000011763217],"category_scores_gemma":[0.00005263829,0.00020080246,0.00007156573,0.00050211186,0.00006348473,0.00009743735,0.00039052067,0.00019830551,0.000023158656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.8170234e-7,0.00016178541,0.000009667859,0.000071588765,0.000016294302,2.662711e-7,0.0015611356,0.000929149,0.00007814797,0.8893386,0.00011768991,0.10771491],"study_design_scores_gemma":[0.00019956204,0.000058610713,0.00005150462,0.000026927813,0.0000107540145,0.000035679714,0.00020454609,0.8789756,0.00010299824,0.11428891,0.0057828818,0.00026207024],"about_ca_topic_score_codex":0.00001865664,"about_ca_topic_score_gemma":9.013595e-7,"teacher_disagreement_score":0.8780464,"about_ca_system_score_codex":0.000015505375,"about_ca_system_score_gemma":0.000024356197,"threshold_uncertainty_score":0.81884867},"labels":[],"label_agreement":null},{"id":"W2082113083","doi":"10.1063/1.3449555","title":"Conjugate degradability and the quantum capacity of cloning channels","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum cloning; Classical capacity; Quantum capacity; Quantum channel; Conjugate; Quantum; Amplitude damping channel; Channel (broadcasting); Quantum operation; Cloning (programming); Channel capacity; Topology (electrical circuits); Physics; Mathematics; Quantum mechanics; Computer science; Quantum information; Telecommunications; Open quantum system; Mathematical analysis; Combinatorics","score_opus":0.015162650949931408,"score_gpt":0.23602267314517295,"score_spread":0.22086002219524153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082113083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6122653,0.000018658178,0.38648137,0.00090378977,0.00021561721,0.000047432404,4.674724e-7,0.0000074175637,0.000059939688],"genre_scores_gemma":[0.93270266,0.0000023528687,0.067030154,0.000057002166,0.00020030532,4.5166425e-7,2.4518775e-8,0.0000044221642,0.0000026469188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892396,0.00009744208,0.000424723,0.00010046944,0.00031081296,0.00014262009],"domain_scores_gemma":[0.9981259,0.00093793357,0.00040380025,0.0002867919,0.00016532153,0.00008022134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014558436,0.00010078038,0.0003586748,0.00002154007,0.00008719988,0.000070805625,0.00051719515,0.000038027534,0.0000021257886],"category_scores_gemma":[0.00037146738,0.000052567524,0.00014205703,0.00012557443,0.00038020016,0.00013768216,0.00015024276,0.0005614565,0.0000012314207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001826961,0.00015028776,0.000034671626,0.000105338404,0.000038319544,0.000003811905,0.0027615097,0.00039921064,0.003153078,0.98302996,0.000030612322,0.01027493],"study_design_scores_gemma":[0.00034591398,0.00005540873,0.00011157409,0.000046730987,0.000010636783,0.00010087251,0.000013873501,0.38401353,0.0025858702,0.61265117,0.000017723341,0.000046707377],"about_ca_topic_score_codex":0.0000029583498,"about_ca_topic_score_gemma":2.305388e-7,"teacher_disagreement_score":0.3836143,"about_ca_system_score_codex":0.0000041067865,"about_ca_system_score_gemma":0.00003668813,"threshold_uncertainty_score":0.24392802},"labels":[],"label_agreement":null},{"id":"W2082202615","doi":"10.1117/12.610925","title":"Robust dynamical decoupling: feedback-free error correction","year":2005,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Air Force Office of Scientific Research; Defense Advanced Research Projects Agency","keywords":"Dynamical decoupling; Decoupling (probability); Quantum decoherence; Computer science; Quantum error correction; Quantum; Error detection and correction; Dynamical systems theory; Control theory (sociology); Quantum computer; Physics; Algorithm; Quantum mechanics; Artificial intelligence; Control engineering; Control (management)","score_opus":0.011420021710305737,"score_gpt":0.22114399264132226,"score_spread":0.20972397093101652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082202615","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9832282,0.00008280374,0.006477174,0.0076089273,0.0008534428,0.00035952445,0.000013954028,0.0002555196,0.0011204465],"genre_scores_gemma":[0.2959437,0.000032713928,0.7022585,0.00022380947,0.0010879763,0.000064523156,0.0000049714636,0.00006071251,0.00032304876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973415,1.703503e-8,0.0007138518,0.00059323583,0.00082398776,0.0005273743],"domain_scores_gemma":[0.9978769,0.0001987442,0.00039410312,0.00014116903,0.0012164239,0.00017265363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006772351,0.00036478374,0.00040934546,0.00013955904,0.00016670628,0.00025326537,0.0026182593,0.00021391633,0.0000068028767],"category_scores_gemma":[0.000584124,0.0003043216,0.0006619208,0.0005100865,0.0001849257,0.00071057165,0.0005988049,0.00052741595,0.0000035105106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009215736,0.00042554876,0.0003789254,0.00035089673,0.00051349885,3.2766215e-7,0.00072122685,0.03852089,0.14178611,0.7874974,0.017445596,0.0122674005],"study_design_scores_gemma":[0.0007816572,0.00021963242,0.00076083234,0.0001908603,0.00004608602,0.000048192196,0.000189462,0.9749812,0.017825011,0.0015621212,0.0030558158,0.00033913337],"about_ca_topic_score_codex":0.000008838013,"about_ca_topic_score_gemma":4.7356517e-7,"teacher_disagreement_score":0.9364603,"about_ca_system_score_codex":0.00019769471,"about_ca_system_score_gemma":0.00004815765,"threshold_uncertainty_score":0.9999409},"labels":[],"label_agreement":null},{"id":"W2082404199","doi":"10.1103/physrevlett.102.130503","title":"Preparing Ground States of Quantum Many-Body Systems on a Quantum Computer","year":2009,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Quantum; Quantum computer; Ground state; Physics; Quantum system; Computer science; Quantum algorithm; Extension (predicate logic); State (computer science); Quantum mechanics; Statistical physics; Algorithm","score_opus":0.011716191444637501,"score_gpt":0.26957071044179937,"score_spread":0.2578545189971619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082404199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30041423,0.0026474835,0.68871754,0.0069073206,0.0005075454,0.0005004553,0.0000038230846,0.00023772272,0.000063858875],"genre_scores_gemma":[0.9865339,0.00045476534,0.0026082424,0.009944285,0.00042232012,0.000011564832,0.0000054151874,0.000016167276,0.0000033518331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977434,0.00020399224,0.0004793014,0.0005984717,0.00052651047,0.00044831433],"domain_scores_gemma":[0.99846685,0.00026772724,0.00028369218,0.00079964515,0.00005181736,0.00013027445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003296838,0.00030862793,0.00070250756,0.00008171316,0.000098992714,0.00012430774,0.0009612562,0.000015057022,7.955136e-7],"category_scores_gemma":[0.000019018502,0.0002363491,0.0002699885,0.0004184555,0.000058142494,0.0001793051,0.00016439673,0.00029920376,0.000041337626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002231633,0.0009772753,0.0000358199,0.0029713109,0.00013627925,0.00008526848,0.001059793,0.09289771,0.0060569225,0.7830168,0.017589325,0.09515115],"study_design_scores_gemma":[0.00015890661,0.0004020873,0.0010346307,0.002740167,0.000019869402,0.000017604249,0.00000151816,0.9908963,0.0000734361,0.0015886094,0.002794299,0.00027258316],"about_ca_topic_score_codex":0.000026610365,"about_ca_topic_score_gemma":3.4584875e-8,"teacher_disagreement_score":0.8979986,"about_ca_system_score_codex":0.000035926314,"about_ca_system_score_gemma":0.000019387577,"threshold_uncertainty_score":0.9638036},"labels":[],"label_agreement":null},{"id":"W2082570149","doi":"10.1016/j.disc.2006.03.068","title":"Linear transformations on codes","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Victoria","funders":"","keywords":"Hamming code; Linear code; Mathematics; Block code; Hamming distance; Discrete mathematics; Hamming weight; Expander code; Construct (python library); Hamming(7,4); Luby transform code; Reed–Muller code; Combinatorics; Algorithm; Decoding methods; Computer science","score_opus":0.009856434514622547,"score_gpt":0.2397584361478432,"score_spread":0.22990200163322067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082570149","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04044465,0.0000080872505,0.9480578,0.0018951709,0.00008860511,0.0001336726,0.000008699377,0.0002290827,0.009134238],"genre_scores_gemma":[0.43538427,7.679213e-7,0.56388104,0.00032140428,0.00011150755,0.000009133856,0.0000056950994,0.000011780908,0.00027440282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992064,0.000014763032,0.00020446669,0.00015774716,0.00021777398,0.00019885263],"domain_scores_gemma":[0.9994226,0.00008975298,0.00004050861,0.00036239135,0.000027077263,0.000057659505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012608609,0.00011485607,0.00012516796,0.00008638401,0.00013721279,0.000098837016,0.00044179554,0.000027623117,0.0000046065],"category_scores_gemma":[0.000015981064,0.00008763702,0.00006181312,0.00026287668,0.00001552469,0.00007090481,0.00005403852,0.0000935773,0.00016484917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015107872,0.00015848983,0.0000085290285,0.000057826408,0.000010624541,0.000008031854,0.0037220365,0.07612931,0.00036581763,0.9072099,0.0023308094,0.00999713],"study_design_scores_gemma":[0.000102322614,0.00007274266,0.00010915879,0.00005281961,0.0000031719737,0.000010313535,0.00002188134,0.9383397,0.0016345233,0.05612354,0.003375454,0.00015434275],"about_ca_topic_score_codex":0.0000063067105,"about_ca_topic_score_gemma":0.0000028585957,"teacher_disagreement_score":0.86221045,"about_ca_system_score_codex":0.000010430103,"about_ca_system_score_gemma":0.000013224048,"threshold_uncertainty_score":0.3573734},"labels":[],"label_agreement":null},{"id":"W2082671716","doi":"10.1007/s11128-010-0179-9","title":"Quantum convolutional coding with shared entanglement: general structure","year":2010,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Convolutional code; Quantum convolutional code; Quantum computer; Quantum; Quantum channel; Quantum information; Quantum entanglement; Quantum algorithm","score_opus":0.006719093501419308,"score_gpt":0.22250325542239902,"score_spread":0.2157841619209797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082671716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37274382,0.00003346128,0.62472576,0.00078491063,0.0006497251,0.00018850114,0.00002973559,0.00041601888,0.00042808763],"genre_scores_gemma":[0.91600937,0.0000012500335,0.08301546,0.00064570643,0.00020041513,0.000009547012,0.000090804475,0.000011623002,0.000015820013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813724,0.000027045675,0.00047798667,0.00028404317,0.0006097572,0.00046394928],"domain_scores_gemma":[0.99878806,0.000038092538,0.00037881988,0.0003480009,0.00029942108,0.00014761914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025721922,0.00026260337,0.0001958893,0.0002433322,0.0006808114,0.0010002687,0.0007336086,0.000108295164,0.000060656832],"category_scores_gemma":[0.000041073617,0.00020660019,0.000050331517,0.0005566775,0.000091884365,0.0033964235,0.00017648711,0.0005522773,0.000028671773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006252348,0.000089460475,0.0018253131,0.00039582115,0.000059060658,0.000018725896,0.010646829,0.013135566,0.0105517525,0.72208,0.0014434811,0.23969148],"study_design_scores_gemma":[0.00058344746,0.00007705397,0.002281084,0.00007232337,0.0000064111114,0.0001919215,0.000085567786,0.98287445,0.0011013407,0.0053498684,0.0070344587,0.00034207004],"about_ca_topic_score_codex":0.000015947186,"about_ca_topic_score_gemma":0.0000076095375,"teacher_disagreement_score":0.9697389,"about_ca_system_score_codex":0.000039097355,"about_ca_system_score_gemma":0.0002784914,"threshold_uncertainty_score":0.9645614},"labels":[],"label_agreement":null},{"id":"W2083496256","doi":"10.1103/physreva.85.062312","title":"Experimental implementation of a codeword-stabilized quantum code","year":2012,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Perimeter Institute; University of Waterloo","funders":"","keywords":"Quantum error correction; Qubit; Quantum convolutional code; Quantum computer; Code word; Physics; Quantum mechanics; Quantum; Quantum decoherence; Code (set theory); Computer science; Quantum network; Quantum information; Algorithm; Decoding methods","score_opus":0.02342062871385532,"score_gpt":0.3611905551516028,"score_spread":0.3377699264377475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083496256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9050793,0.02963277,0.0628885,0.0011890077,0.0002808466,0.0005748163,0.000007496007,0.00013294903,0.00021431694],"genre_scores_gemma":[0.9928657,0.00019323544,0.0063850805,0.0003877831,0.00012634219,0.000030029434,0.0000022727975,0.0000074587547,0.000002092354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890876,0.00010584556,0.00024303803,0.00018726604,0.0002531202,0.00030197378],"domain_scores_gemma":[0.9992886,0.00009515283,0.00013580114,0.00033846943,0.00003913839,0.000102805505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026888243,0.00012194795,0.00030513736,0.000022275324,0.000058590773,0.000014626507,0.00035777106,0.000010148937,0.00001994634],"category_scores_gemma":[0.0000238332,0.00009358136,0.00014651666,0.0002598275,0.000031498952,0.00018787656,0.00020867582,0.00008847381,0.000021748914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012574462,0.0022597208,0.0015015528,0.0019548344,0.00009728902,0.0000037378468,0.012451304,0.00006552281,0.07274719,0.5840239,0.002545523,0.32233688],"study_design_scores_gemma":[0.0037306664,0.0017849284,0.0147022065,0.0039471393,0.00021913914,0.00009024045,0.00076346204,0.42419654,0.45576066,0.023059702,0.06949548,0.0022498493],"about_ca_topic_score_codex":0.000025378447,"about_ca_topic_score_gemma":7.142992e-7,"teacher_disagreement_score":0.56096417,"about_ca_system_score_codex":0.000022552687,"about_ca_system_score_gemma":0.00003013625,"threshold_uncertainty_score":0.3816137},"labels":[],"label_agreement":null},{"id":"W2083523027","doi":"10.1007/s11128-007-0059-0","title":"Cooling Algorithms Based on the 3-bit Majority","year":2007,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum computer; Algorithm; Bit (key); Physics; Quantum; Quantum mechanics; Computer network","score_opus":0.012342466250289435,"score_gpt":0.24376437873262488,"score_spread":0.23142191248233546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083523027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018081952,0.00003469348,0.9758721,0.0020830329,0.0004130015,0.00016761456,0.0000018936039,0.00040856155,0.002937166],"genre_scores_gemma":[0.94851375,9.654077e-7,0.04694134,0.0043625524,0.00014769736,0.00000613398,0.0000071049685,0.000008442109,0.000012044438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819165,0.0000439179,0.0004972709,0.00020305974,0.0006061498,0.0004579584],"domain_scores_gemma":[0.9986562,0.0003041425,0.00030070578,0.00043615335,0.00020120198,0.00010157959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018969654,0.00019902998,0.0001410955,0.00023531793,0.0008287655,0.00071766693,0.00083992403,0.00008034905,0.000008863667],"category_scores_gemma":[0.00016220062,0.00013482824,0.00007124142,0.000825256,0.00006093095,0.0012769696,0.000116144096,0.00041572258,0.000089135494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026431397,0.000052740535,0.00007728146,0.00009006785,0.0000062972813,0.000007559486,0.002849458,0.029491473,0.000038512626,0.052114498,0.0004268482,0.9148188],"study_design_scores_gemma":[0.00022530944,0.000060396476,0.000888806,0.000098689954,0.0000025476252,0.000016304268,0.00012717275,0.9886793,0.00088027364,0.0026073235,0.0062134145,0.0002004767],"about_ca_topic_score_codex":0.000012093392,"about_ca_topic_score_gemma":8.3749126e-7,"teacher_disagreement_score":0.9591878,"about_ca_system_score_codex":0.000054473923,"about_ca_system_score_gemma":0.0001440722,"threshold_uncertainty_score":0.6920479},"labels":[],"label_agreement":null},{"id":"W2083633130","doi":"10.1007/s00037-013-0065-9","title":"Parallel Approximation of Min-Max Problems","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"PSPACE; Multiplicative function; Mathematical proof; Mathematics; Class (philosophy); Matrix (chemical analysis); Complexity class; Discrete mathematics; Combinatorics; Computational complexity theory; Time complexity; Computer science; Algorithm","score_opus":0.03443949735732771,"score_gpt":0.25069047393640637,"score_spread":0.21625097657907866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083633130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13629785,0.00006749187,0.860675,0.0011683296,0.00014765235,0.0003224495,0.0000045219044,0.00016322939,0.0011534787],"genre_scores_gemma":[0.57379204,4.456655e-7,0.4259753,0.0001246922,0.000039913295,0.000015113134,0.000020173346,0.0000055515425,0.00002675486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984828,0.00009475435,0.00040095468,0.0003541211,0.00042548275,0.00024185037],"domain_scores_gemma":[0.9988473,0.00018774455,0.00021769012,0.00033016253,0.00032334108,0.00009373003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020428866,0.00016090153,0.00022590446,0.00012109817,0.00015899105,0.00011619814,0.00072419335,0.000045007586,0.000044446995],"category_scores_gemma":[0.000032355183,0.00014584126,0.00009375947,0.00038606967,0.00014580702,0.00031058802,0.00027275758,0.00014726628,0.00009848872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027440572,0.00018457817,0.00049374223,0.00008190574,0.000028960705,0.0000012178399,0.00073366426,0.7263284,0.00022292214,0.24017036,0.0012842758,0.030467227],"study_design_scores_gemma":[0.00018582733,0.000045071272,0.025107058,0.000020544638,0.0000013901198,0.000010934834,0.0000042239258,0.6333899,0.000036753183,0.34096718,0.00012402397,0.000107068336],"about_ca_topic_score_codex":0.00010012219,"about_ca_topic_score_gemma":0.000002538481,"teacher_disagreement_score":0.43749422,"about_ca_system_score_codex":0.00002348434,"about_ca_system_score_gemma":0.00006852593,"threshold_uncertainty_score":0.59472334},"labels":[],"label_agreement":null},{"id":"W2085885211","doi":"10.1142/s0219749913500081","title":"QUANTUM PHASE ESTIMATION WITH AN ARBITRARY NUMBER OF QUBITS","year":2013,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Quantum Fourier transform; Quantum computer; Qubit; Quantum algorithm; Quantum error correction; Quantum circuit; Quantum phase estimation algorithm; Superconducting quantum computing; Discrete Fourier transform (general)","score_opus":0.008937413569882167,"score_gpt":0.2795961063050407,"score_spread":0.2706586927351586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085885211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49774474,0.000008102687,0.5007973,0.0006928033,0.00044675494,0.00006991476,0.000003897243,0.0000247987,0.00021168732],"genre_scores_gemma":[0.87107044,0.000007126977,0.12850998,0.00026243256,0.0001215624,0.0000026833725,0.000016981952,0.000005743637,0.000003054741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997957,0.000056469595,0.0008550516,0.00009264551,0.00088177726,0.00015706694],"domain_scores_gemma":[0.9971399,0.00008618073,0.0011427565,0.00020532773,0.0013116676,0.00011419942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038690248,0.00014458864,0.00020321104,0.00033848704,0.00005507689,0.00029158822,0.0009750943,0.000054626104,0.00004476446],"category_scores_gemma":[0.000066828085,0.00010725849,0.0000850457,0.00022601645,0.00004907414,0.006622505,0.00007420962,0.00023509466,0.000051403324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031584114,0.0007689915,0.000840023,0.00006817025,0.0002782486,0.000037480037,0.006674927,0.033509392,0.0006175257,0.27121383,0.0010025692,0.684673],"study_design_scores_gemma":[0.0012863663,0.0005875008,0.0021052496,0.00012689907,0.000007602802,0.0007567174,0.00010495513,0.97071695,0.0010569919,0.022719523,0.00039763757,0.00013361961],"about_ca_topic_score_codex":0.000058393456,"about_ca_topic_score_gemma":5.766013e-7,"teacher_disagreement_score":0.9372075,"about_ca_system_score_codex":0.000044769786,"about_ca_system_score_gemma":0.00016340129,"threshold_uncertainty_score":0.48011562},"labels":[],"label_agreement":null},{"id":"W2086236885","doi":"10.1103/physrevlett.110.220501","title":"Differential Evolution for Many-Particle Adaptive Quantum Metrology","year":2013,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures; Canadian Institute for Advanced Research; Western Canada Research Grid; Compute Canada; “la Caixa” Foundation","keywords":"Quantum metrology; Differential evolution; Metrology; Quantum; Computer science; Particle swarm optimization; Binary decision diagram; Decision tree; Statistical physics; Quantum computer; Physics; Algorithm; Mathematical optimization; Quantum mechanics; Artificial intelligence; Mathematics; Quantum simulator","score_opus":0.014171464716275813,"score_gpt":0.2604675812672501,"score_spread":0.2462961165509743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086236885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30126745,0.00076255586,0.682294,0.014959958,0.00018968168,0.00042353017,0.0000014607111,0.000094002164,0.0000073446645],"genre_scores_gemma":[0.9829957,0.00004487892,0.009089756,0.0073790425,0.00031442379,0.00015789372,0.0000020922735,0.000010984677,0.000005254219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987118,0.00011188831,0.00020158316,0.0003922876,0.00018488822,0.00039749942],"domain_scores_gemma":[0.99916863,0.00021250658,0.00009684546,0.00036529714,0.000054166263,0.00010254537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000893577,0.00016560894,0.00032706614,0.000027393455,0.000110245644,0.00005751073,0.000521134,0.000010584166,0.0000124186345],"category_scores_gemma":[0.00004308956,0.00012522773,0.00022123054,0.00021598798,0.000057260233,0.00019451244,0.00015825918,0.00014684346,0.00015397345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025471982,0.00075652514,0.00020368314,0.0010445201,0.00022884221,0.000013860339,0.00052197004,0.002906536,0.13542975,0.6538522,0.0353817,0.16963491],"study_design_scores_gemma":[0.00020042437,0.00015327545,0.0022648545,0.00012748005,0.000024050605,0.0000051392494,0.0000011981952,0.9862586,0.0003337557,0.0098825265,0.0005802156,0.00016844127],"about_ca_topic_score_codex":0.000021668435,"about_ca_topic_score_gemma":3.3828616e-7,"teacher_disagreement_score":0.9833521,"about_ca_system_score_codex":0.00003391409,"about_ca_system_score_gemma":0.000012901128,"threshold_uncertainty_score":0.51066387},"labels":[],"label_agreement":null},{"id":"W2086342673","doi":"10.1103/physreva.75.012331","title":"Using error correction to determine the noise model","year":2007,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; National Security Agency","keywords":"Quantum error correction; Error detection and correction; Qubit; Noise (video); Algorithm; Coherence (philosophical gambling strategy); Computer science; Quantum noise; Quantum computer; Quantum; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.05089928641881465,"score_gpt":0.34777536187769925,"score_spread":0.2968760754588846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086342673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080538064,0.0009402127,0.9164238,0.0012154583,0.0003252926,0.00021447461,2.5787236e-7,0.00007373586,0.0002686949],"genre_scores_gemma":[0.9307595,0.000059830058,0.06332339,0.005371496,0.00040786652,0.0000069761163,2.6919406e-7,0.000011120554,0.00005953178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999141,0.00003610496,0.00014865998,0.00023933689,0.00020132583,0.00023358985],"domain_scores_gemma":[0.9992612,0.00014606738,0.000054757576,0.00039811007,0.000043851807,0.00009602334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036654988,0.00010764559,0.00017049156,0.000024144429,0.00012939432,0.000038935807,0.00048182125,0.000007932966,6.835265e-7],"category_scores_gemma":[0.00009775197,0.000064650754,0.000108653505,0.000446072,0.000017491788,0.00006853429,0.00020578118,0.00015476027,0.000026229147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030383087,0.00009080999,0.000009589623,0.00010711647,0.0000066883626,0.000007824669,0.0004951257,0.071753114,0.0031861798,0.0027972008,0.001112986,0.9204303],"study_design_scores_gemma":[0.000029737635,0.000031057825,0.00012427835,0.0003868418,0.000009152235,0.000018093453,8.7672015e-7,0.99566096,0.00040624692,0.0016473915,0.0015908418,0.000094538904],"about_ca_topic_score_codex":0.000013697256,"about_ca_topic_score_gemma":0.0000028588286,"teacher_disagreement_score":0.9239078,"about_ca_system_score_codex":0.000022815584,"about_ca_system_score_gemma":0.000026729167,"threshold_uncertainty_score":0.26363814},"labels":[],"label_agreement":null},{"id":"W2087352629","doi":"10.1103/physrevlett.108.230506","title":"Adiabatic Quantum Algorithm for Search Engine Ranking","year":2012,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"PageRank; Computer science; Quantum algorithm; Algorithm; Quantum computer; Quantum; Theoretical computer science; Ranking (information retrieval); Adiabatic process; Information retrieval; Physics; Quantum mechanics","score_opus":0.019159505800119117,"score_gpt":0.29272179234852846,"score_spread":0.27356228654840936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087352629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022693768,0.008418892,0.95937186,0.008400654,0.00043446553,0.00049533934,0.0000041317503,0.00016264975,0.000018226856],"genre_scores_gemma":[0.49506837,0.0010203151,0.457845,0.041840427,0.0039000313,0.0002112258,0.000021108497,0.00007681284,0.00001670211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830586,0.000114941024,0.00022393177,0.0003285935,0.000335258,0.00069142634],"domain_scores_gemma":[0.99879396,0.0004386104,0.00006940024,0.00046005563,0.000039926632,0.00019802173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060012576,0.00021006106,0.00039264435,0.000054363965,0.00014019785,0.00006352955,0.0006746619,0.000009988402,0.000003717655],"category_scores_gemma":[0.000052483036,0.00016569413,0.00026480827,0.00038762478,0.000039396687,0.00026421077,0.00017473871,0.00023966798,0.00007004883],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.265845e-7,0.00013155752,0.000017403292,0.00068217074,0.000036313028,0.0000030913172,0.00046612736,0.0005957488,0.0011374344,0.0051214704,0.0026264542,0.9891815],"study_design_scores_gemma":[0.00018671194,0.000046331512,0.00016342926,0.0006121241,0.000027073416,0.00001290827,0.000001246768,0.9851146,0.0002719425,0.0004157906,0.012893791,0.0002540983],"about_ca_topic_score_codex":0.000004149339,"about_ca_topic_score_gemma":3.2488895e-8,"teacher_disagreement_score":0.9889274,"about_ca_system_score_codex":0.000030226696,"about_ca_system_score_gemma":0.000019668889,"threshold_uncertainty_score":0.67568105},"labels":[],"label_agreement":null},{"id":"W2089116445","doi":"10.1142/s0217979203018284","title":"QUANTUM ASSOCIATIVE MEMORY","year":2003,"lang":"en","type":"article","venue":"International Journal of Modern Physics B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Content-addressable memory; Quantum; Associative property; Quantum memory; Quantum computer; Quantum network; Quantum mechanics; Physics; Mathematics; Artificial intelligence; Artificial neural network; Pure mathematics","score_opus":0.013239674141009622,"score_gpt":0.25865008089533453,"score_spread":0.2454104067543249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089116445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061320186,0.0001554482,0.93409413,0.0008766988,0.0019147403,0.00002461419,0.000002445637,0.000021981505,0.001589768],"genre_scores_gemma":[0.97037786,0.000011098551,0.02870745,0.00033772548,0.00048844545,4.3143118e-7,4.504846e-7,0.000008087216,0.00006843672],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986612,0.000093371586,0.0002835094,0.00013389379,0.0006812763,0.00014672587],"domain_scores_gemma":[0.9986956,0.00013734707,0.0004105914,0.00014054282,0.00054848177,0.00006742089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035288584,0.00010452783,0.00015641663,0.000076210774,0.000051002906,0.00012951654,0.0010036031,0.000030870495,0.0000046841956],"category_scores_gemma":[0.000099413344,0.00008838303,0.00016241627,0.00010650047,0.000023490134,0.0003499772,0.00009189409,0.00027176313,0.0000100429015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002020304,0.00048083297,0.000552798,0.0000048361444,0.0005921871,0.00025872342,0.005124605,0.06464954,0.0029747533,0.4298277,0.0016702106,0.49384362],"study_design_scores_gemma":[0.0005332085,0.000075988675,0.00037834546,0.000038839506,0.0000064329497,0.00015867579,0.00001914845,0.46733642,0.003864051,0.5262526,0.0012004168,0.0001358234],"about_ca_topic_score_codex":0.0000022381876,"about_ca_topic_score_gemma":2.6267188e-7,"teacher_disagreement_score":0.9090577,"about_ca_system_score_codex":0.00007519522,"about_ca_system_score_gemma":0.00014434122,"threshold_uncertainty_score":0.36041552},"labels":[],"label_agreement":null},{"id":"W2090447085","doi":"10.1049/el:20031202","title":"Improved quantum cost for <i>n</i> -bit Toffoli gates","year":2003,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Toffoli gate; Quantum gate; Bit (key); Arithmetic; Quantum circuit; Realization (probability); Computer science; 4-bit; Logic gate; Quantum; Quantum computer; Mathematics; Electronic engineering; Algorithm; Quantum error correction; Quantum mechanics; Physics; Engineering; CMOS","score_opus":0.007024623797034774,"score_gpt":0.21983019166597526,"score_spread":0.21280556786894048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090447085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044272758,0.00077852927,0.9412055,0.012116148,0.00065611774,0.0005139822,0.0000038860294,0.00029786225,0.00015522445],"genre_scores_gemma":[0.8582588,0.000055219807,0.1239041,0.017003873,0.00036197744,0.000160474,0.000014507589,0.000077272765,0.00016376913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806386,0.000071589304,0.00023186383,0.00053469796,0.00017351384,0.00092450035],"domain_scores_gemma":[0.9989625,0.0002457799,0.000103226026,0.00052975764,0.000047870435,0.00011084272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038609767,0.00023628309,0.00021354908,0.00008540208,0.00026702945,0.0001998279,0.0007256156,0.00006166902,0.0000038074133],"category_scores_gemma":[0.00008192125,0.0002174394,0.00015168365,0.00030978103,0.000039228315,0.00014621452,0.00006872438,0.00029396074,0.000011515796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029018078,0.00017596346,0.00006928744,0.000060679777,0.0001359881,0.000020617532,0.0007005722,0.0064406977,0.22583093,0.68016905,0.025403464,0.060963746],"study_design_scores_gemma":[0.0009067641,0.00029817564,0.000018336112,0.000015348705,0.000012065514,0.00005931893,0.000005563426,0.6703165,0.05064516,0.013285041,0.26392063,0.00051704835],"about_ca_topic_score_codex":0.000006798106,"about_ca_topic_score_gemma":0.000005857096,"teacher_disagreement_score":0.8173014,"about_ca_system_score_codex":0.00009266732,"about_ca_system_score_gemma":0.00013263617,"threshold_uncertainty_score":0.88669217},"labels":[],"label_agreement":null},{"id":"W2091229691","doi":"10.1364/icqi.2001.pb28","title":"Quantum Networks for Generating Arbitrary Quantum States","year":2001,"lang":"en","type":"article","venue":"Optical Fiber Communication Conference and International Conference on Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum network; Quantum state; Quantum algorithm; Quantum; Quantum phase estimation algorithm; Computer science; Cluster state; Quantum error correction; Quantum operation; Quantum computer; Quantum mechanics; Physics; Open quantum system","score_opus":0.0379145597384494,"score_gpt":0.2870812705972695,"score_spread":0.2491667108588201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091229691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052035064,0.00015109206,0.92310476,0.014372288,0.00051522604,0.00052424066,0.000032619828,0.00029257435,0.008972157],"genre_scores_gemma":[0.96022063,0.0014241432,0.035591517,0.0017891742,0.00013304698,0.00011457822,0.00052979577,0.000016486458,0.00018063789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997769,0.00012462209,0.000822902,0.0004013808,0.00042928345,0.00045282155],"domain_scores_gemma":[0.9972718,0.00049447996,0.0003772236,0.0007734239,0.00088371924,0.00019936661],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006251344,0.00034999425,0.00031451022,0.00026058566,0.00056061166,0.0013788528,0.0015051586,0.00018155352,0.000121416364],"category_scores_gemma":[0.00018684595,0.00031731644,0.0001099972,0.0002534934,0.00017339668,0.00224358,0.0004338685,0.0005333351,0.00008076557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005725662,0.00006004207,0.00003239701,0.000013970616,0.000031884665,8.4250826e-7,0.00055275584,0.004110085,0.00004687295,0.8715007,0.0003810397,0.123212196],"study_design_scores_gemma":[0.0005978731,0.00026887123,0.00035395843,0.00014727828,0.000008974332,0.000033574437,0.00023857117,0.9164955,0.00004554755,0.067056775,0.014379442,0.00037363014],"about_ca_topic_score_codex":0.000037392296,"about_ca_topic_score_gemma":0.000006758598,"teacher_disagreement_score":0.9123854,"about_ca_system_score_codex":0.000057694986,"about_ca_system_score_gemma":0.00014329072,"threshold_uncertainty_score":0.9999279},"labels":[],"label_agreement":null},{"id":"W2094347113","doi":"10.1142/s0219749904000419","title":"ALGORITHMIC COOLING OF SPINS: A PRACTICABLE METHOD FOR INCREASING POLARIZATION","year":2004,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Ministry of Defense; Université de Montréal","keywords":"Spins; Quantum computer; Polarization (electrochemistry); Physics; Magnetic refrigeration; Quantum; Computational physics; Condensed matter physics; Computer science; Statistical physics; Magnetic field; Quantum mechanics; Chemistry; Magnetization","score_opus":0.011451620125170266,"score_gpt":0.299666663377506,"score_spread":0.28821504325233577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094347113","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04145569,0.000039530838,0.95585895,0.0014876756,0.00095047173,0.00012278944,0.00000881677,0.000023850154,0.000052250583],"genre_scores_gemma":[0.4418056,0.000009885855,0.5577772,0.00022038579,0.00017079436,0.0000014122165,0.000009558503,0.000004014259,0.0000011233897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983055,0.000058542682,0.0008482157,0.00007827218,0.0005688837,0.00014061361],"domain_scores_gemma":[0.996805,0.0002475162,0.0013654699,0.000121605786,0.0014040284,0.000056342833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014930541,0.0001037391,0.00018709971,0.00047873546,0.00007401961,0.00019393844,0.00068981637,0.000057619454,0.0000018114291],"category_scores_gemma":[0.00083130156,0.000091765476,0.00013083828,0.0002286974,0.000018829356,0.0028235363,0.000085597916,0.00017232764,0.0000026684882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036265,0.00019790081,0.00011352164,0.00008488373,0.00026167618,0.000011787767,0.0044113477,0.41149524,0.0074333507,0.28659463,0.000087181324,0.28894582],"study_design_scores_gemma":[0.0013580413,0.00026616882,0.0007002222,0.00018694585,0.000014592799,0.00072567124,0.000093007846,0.96268725,0.00640456,0.025630753,0.0018221599,0.00011061093],"about_ca_topic_score_codex":0.000079637925,"about_ca_topic_score_gemma":5.651489e-7,"teacher_disagreement_score":0.55119205,"about_ca_system_score_codex":0.00011189384,"about_ca_system_score_gemma":0.00027777324,"threshold_uncertainty_score":0.37420875},"labels":[],"label_agreement":null},{"id":"W2094693542","doi":"10.1063/1.4807079","title":"On infinite-dimensional state spaces","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique","keywords":"Mathematics; Hilbert space; Relation (database); Dimension (graph theory); Unitary state; Context (archaeology); Curse of dimensionality; Pure mathematics; Algebra over a field; Discrete mathematics; Computer science","score_opus":0.011402037051275751,"score_gpt":0.2347384909883763,"score_spread":0.22333645393710055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094693542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5061591,0.000016085005,0.4914805,0.0015170736,0.00017602212,0.000055390887,4.3927315e-7,0.000025167135,0.0005702228],"genre_scores_gemma":[0.7962933,0.0000015135412,0.20265783,0.0006687465,0.00026486052,0.000001081407,1.2664489e-7,0.000011796258,0.00010070743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988615,0.000045601464,0.00032446807,0.00010343852,0.00048264881,0.00018232234],"domain_scores_gemma":[0.99865174,0.0005870901,0.0002543328,0.00021309842,0.00016361744,0.00013012381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023135127,0.00011595788,0.00023030321,0.000051040723,0.00005749615,0.0001625764,0.00045306297,0.000023979408,0.000032438515],"category_scores_gemma":[0.00009939434,0.00007370657,0.00012244572,0.00015720485,0.000039593753,0.0002422422,0.00011296675,0.0003050523,0.0002452876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018735303,0.0013118064,0.000021331445,0.00011967378,0.00015262059,0.00010954132,0.0023533667,0.109097786,0.002054366,0.6683812,0.016969725,0.19940983],"study_design_scores_gemma":[0.00014606753,0.00019136938,0.00009043295,0.00008283572,0.000002755297,0.000048051053,0.0000035546848,0.34061897,0.0005079983,0.6581772,0.000059985498,0.000070782604],"about_ca_topic_score_codex":7.8817396e-7,"about_ca_topic_score_gemma":1.7663025e-8,"teacher_disagreement_score":0.29013422,"about_ca_system_score_codex":0.000013315688,"about_ca_system_score_gemma":0.000043987457,"threshold_uncertainty_score":0.3152758},"labels":[],"label_agreement":null},{"id":"W2094848842","doi":"10.1109/tit.2015.2422294","title":"Hardness of Decoding Quantum Stabilizer Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Lockheed Martin Corporation","keywords":"Decoding methods; List decoding; Sequential decoding; Berlekamp–Welch algorithm; Quantum convolutional code; Algorithm; Mathematics; Concatenated error correction code; Degeneracy (biology); Code (set theory); Computer science; Linear code; Discrete mathematics; Block code","score_opus":0.01790631183185298,"score_gpt":0.2424243118143725,"score_spread":0.2245179999825195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094848842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026075913,0.0000127086,0.97102433,0.00012019704,0.0011532863,0.000109696906,0.000013882058,0.0001738979,0.0013161049],"genre_scores_gemma":[0.9833508,0.0000036215547,0.016379723,0.00018756292,0.000016013939,0.000009610576,0.0000014941937,0.000005017555,0.000046163463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896884,0.00010866532,0.00035099284,0.00010900365,0.00029529975,0.00016719886],"domain_scores_gemma":[0.99905944,0.00016610416,0.00014150179,0.00035383846,0.000179133,0.00009997151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007538447,0.00011729959,0.00015129751,0.0002432497,0.00012801682,0.00008266221,0.0004052561,0.00005398369,0.000014123218],"category_scores_gemma":[0.000021637912,0.00010066675,0.00007912678,0.00033532706,0.00006236712,0.0010189508,0.000004214125,0.00016849945,0.00007090665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010391237,0.00014308866,0.000006910468,0.00006858875,0.00005124814,8.984035e-7,0.015333678,0.41008383,0.00014570047,0.16233025,0.0004287063,0.4113032],"study_design_scores_gemma":[0.000682395,0.00020031835,0.000039346633,0.00005821985,0.00000989368,0.000022372515,0.0006933925,0.9452866,0.021236327,0.029697873,0.0018508536,0.00022243183],"about_ca_topic_score_codex":0.000010002079,"about_ca_topic_score_gemma":0.0000011762708,"teacher_disagreement_score":0.95727485,"about_ca_system_score_codex":0.000036818517,"about_ca_system_score_gemma":0.00010236125,"threshold_uncertainty_score":0.41050708},"labels":[],"label_agreement":null},{"id":"W2095618864","doi":"10.1109/sfcs.1998.743485","title":"Quantum lower bounds by polynomials","year":2002,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Boolean function; Bounded function; Quantum algorithm; Discrete mathematics; Mathematics; Quantum; Polynomial; Black box; Quantum complexity theory; Function (biology); Extension (predicate logic); Quantum computer; Combinatorics; Computer science; Quantum mechanics; Physics","score_opus":0.01071458148919707,"score_gpt":0.2126669073982336,"score_spread":0.20195232590903653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095618864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11088574,0.0011097082,0.8458288,0.011500639,0.001977985,0.00014795878,0.0000050360204,0.0010764431,0.027467689],"genre_scores_gemma":[0.9640688,0.000017197219,0.026444208,0.002143015,0.00019326412,0.000003231881,9.120739e-7,0.000013205891,0.0071162246],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883175,0.00003826125,0.00018345736,0.00036927828,0.00021708716,0.00036015958],"domain_scores_gemma":[0.9992241,0.00007117783,0.00004702019,0.00051154644,0.000024364937,0.000121778095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013850594,0.00014405556,0.00014487036,0.000058868824,0.00016890191,0.0002631785,0.0008014396,0.000053217213,0.0002923036],"category_scores_gemma":[0.000016873293,0.000113582006,0.00007679274,0.00026754208,0.000040120736,0.00016976403,0.00020954943,0.0001390371,0.0004113433],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022429315,0.00029207973,0.00009724477,0.000007718532,0.000027731016,0.000043125074,0.0006438988,0.00030314596,0.002898076,0.05200842,0.7239691,0.21970719],"study_design_scores_gemma":[0.00018111296,0.000106789004,0.00006975913,0.0000062042923,0.0000014319307,0.00002948051,0.0000031808802,0.85377145,0.00077661674,0.0019035042,0.14293562,0.0002148481],"about_ca_topic_score_codex":0.00003365579,"about_ca_topic_score_gemma":0.0000011427096,"teacher_disagreement_score":0.8534683,"about_ca_system_score_codex":0.000014534241,"about_ca_system_score_gemma":0.0000092431965,"threshold_uncertainty_score":0.5287123},"labels":[],"label_agreement":null},{"id":"W2096501654","doi":"10.1109/ismvl.2002.1011080","title":"The role of super-fast transforms in speeding up quantum computations","year":2003,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum Fourier transform; Hadamard transform; Quantum computer; Quantum algorithm; Quantum phase estimation algorithm; Quantum; Algorithm; Fourier transform; Discrete Fourier transform (general); Computer science; Quantum error correction; Arithmetic; Mathematics; Fractional Fourier transform; Physics; Quantum mechanics; Fourier analysis; Mathematical analysis","score_opus":0.008185867632502532,"score_gpt":0.2267155488893831,"score_spread":0.21852968125688058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096501654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37361884,0.00036690393,0.61579525,0.00095583213,0.00050992356,0.00016921431,0.0000012739346,0.00010484661,0.008477923],"genre_scores_gemma":[0.9815709,0.000012768292,0.018274102,0.00004057559,0.000019227593,0.0000022415697,3.8914922e-7,0.0000055818764,0.00007424292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990088,0.000057184738,0.0002677537,0.00020004323,0.00019359688,0.00027263424],"domain_scores_gemma":[0.99940073,0.00023236245,0.000040138897,0.00023571789,0.000042755928,0.00004829128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039879713,0.000100776815,0.000127454,0.000087841654,0.0001820396,0.00008748697,0.00050731224,0.000031057803,0.0000051958023],"category_scores_gemma":[0.000029222165,0.00006269795,0.00006345051,0.00050921866,0.000055066794,0.00011988815,0.000044141707,0.00015669518,0.000006363479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017779557,0.000046362722,0.0008814696,0.0000053609406,0.000007943426,0.000002088578,0.0030234358,0.012528979,0.0007340312,0.8555208,0.000037100934,0.12721063],"study_design_scores_gemma":[0.00023222812,0.000050802737,0.0013086137,0.000018484618,0.0000012462408,0.000019381843,0.0005415583,0.92978144,0.004024096,0.06016998,0.003743895,0.000108256245],"about_ca_topic_score_codex":0.00006327826,"about_ca_topic_score_gemma":0.000045712164,"teacher_disagreement_score":0.9172525,"about_ca_system_score_codex":0.000012416046,"about_ca_system_score_gemma":0.000055273333,"threshold_uncertainty_score":0.2556748},"labels":[],"label_agreement":null},{"id":"W2096561527","doi":"10.1109/newcas.2006.250900","title":"A New Architecture of Adiabatic Reversible Logic Gates","year":2006,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Adiabatic circuit; Logic gate; Adiabatic process; Toffoli gate; Pass transistor logic; Reversible computing; CMOS; Electronic circuit; Computer science; Logic family; Electronic engineering; Logic synthesis; AND-OR-Invert; Reduction (mathematics); Pull-up resistor; Electrical engineering; Engineering; Mathematics; Physics; Digital electronics; Quantum gate; Quantum computer; Quantum mechanics","score_opus":0.00629074035625364,"score_gpt":0.2041227252411508,"score_spread":0.19783198488489717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096561527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01639359,0.0002232125,0.9719164,0.0029257918,0.00015111027,0.00008972893,8.664797e-7,0.00020121355,0.008098111],"genre_scores_gemma":[0.3045044,0.0000018164413,0.6924713,0.0003549267,0.0001483453,9.2628267e-7,0.0000015824645,0.0000070135707,0.002509665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990713,0.00003251971,0.0001965508,0.0002661799,0.00018889288,0.00024456347],"domain_scores_gemma":[0.9993317,0.00010411834,0.00007860404,0.00038404515,0.000031967662,0.00006953614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010215391,0.00012422177,0.00017005995,0.000120155084,0.00005669219,0.000048131107,0.00063508435,0.000042667074,0.00004587392],"category_scores_gemma":[0.000015146574,0.00009206755,0.00008626932,0.00045146066,0.000028116021,0.00006579693,0.00017403459,0.00012134278,0.00002267754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010175286,0.0001885067,0.001094562,0.00012252544,0.00004660463,0.000053998097,0.00097459764,0.12088513,0.008143057,0.49553522,0.052959587,0.31998602],"study_design_scores_gemma":[0.0007434194,0.00033481768,0.004250733,0.00010294054,0.000013241129,0.000108566215,0.000014418278,0.40343243,0.015959885,0.56092465,0.013615071,0.0004998341],"about_ca_topic_score_codex":0.0004436552,"about_ca_topic_score_gemma":0.000021606538,"teacher_disagreement_score":0.3194862,"about_ca_system_score_codex":0.000008516542,"about_ca_system_score_gemma":0.00007352928,"threshold_uncertainty_score":0.3754406},"labels":[],"label_agreement":null},{"id":"W2096685532","doi":"10.1007/s11128-012-0368-9","title":"Hitting time of quantum walks with perturbation","year":2012,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Hitting time; Quantum walk; Upper and lower bounds; Perturbation (astronomy); Random walk; Square root; Markov chain; Quantum; Mathematics; Physics; Quantum computer; Statistical physics; Quantum mechanics; Combinatorics; Mathematical analysis","score_opus":0.0067016119265247845,"score_gpt":0.21172614834466766,"score_spread":0.20502453641814286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096685532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19680291,0.00015523793,0.8008409,0.00031052402,0.0001554697,0.00012347347,0.0000016165217,0.0002580666,0.0013517564],"genre_scores_gemma":[0.9609899,0.0000018535919,0.038632978,0.00023246436,0.00008814525,0.0000059255876,0.000012827277,0.0000092209475,0.000026681199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847615,0.000042655724,0.0005055343,0.00013243394,0.00044828723,0.0003949491],"domain_scores_gemma":[0.9987602,0.00007547559,0.0005451929,0.0002692525,0.0002449557,0.00010489769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059546303,0.00017703258,0.00020035631,0.00022801195,0.00026829317,0.00020876857,0.00040710834,0.000069147536,0.0000088797215],"category_scores_gemma":[0.000076466604,0.00013489377,0.000045135974,0.0006017705,0.000051786596,0.0046245283,0.00010932947,0.000182706,0.000059395217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004770961,0.00018259304,0.0018992729,0.00078399124,0.000040487605,0.0000014800632,0.059984148,0.012718578,0.001148748,0.1219629,0.0003601216,0.80087],"study_design_scores_gemma":[0.00025123192,0.0000938844,0.001561194,0.00017064602,0.0000070152864,0.00005228273,0.00024384542,0.9936949,0.0013215743,0.0012028138,0.0011880909,0.0002125085],"about_ca_topic_score_codex":0.0000065482213,"about_ca_topic_score_gemma":6.2308764e-8,"teacher_disagreement_score":0.98097634,"about_ca_system_score_codex":0.000032874363,"about_ca_system_score_gemma":0.00011266502,"threshold_uncertainty_score":0.55008084},"labels":[],"label_agreement":null},{"id":"W2097174474","doi":"10.1103/physrevlett.114.090502","title":"Simulating Hamiltonian Dynamics with a Truncated Taylor Series","year":2015,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":771,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Canadian Institute for Advanced Research","funders":"Air Force Office of Scientific Research; Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Army Research Office; Industry Canada","keywords":"Hamiltonian (control theory); Taylor series; Unitary state; Series (stratigraphy); Computer science; Operator (biology); Applied mathematics; Algorithm; Quantum; Inverse; Statistical physics; Mathematical optimization; Physics; Mathematics; Mathematical analysis; Quantum mechanics","score_opus":0.01451993915736964,"score_gpt":0.25970733483883274,"score_spread":0.24518739568146308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097174474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45634976,0.0019430554,0.477295,0.06239806,0.00028456436,0.0005935578,0.0000054063,0.00070068677,0.0004298841],"genre_scores_gemma":[0.93140155,0.000041752093,0.051535606,0.016700732,0.0002502513,0.00001864131,0.000009392549,0.000027594888,0.000014460019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866503,0.000096099015,0.0001820264,0.00037663375,0.00035670243,0.00032352755],"domain_scores_gemma":[0.99907976,0.00008382406,0.00011227989,0.0004804376,0.000066794215,0.00017688709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018796584,0.00020808399,0.00034693538,0.00003129257,0.000089380585,0.00010472102,0.0005709667,0.000007751037,7.38739e-7],"category_scores_gemma":[0.000058494024,0.00014250813,0.00008811316,0.00053206045,0.000070369926,0.0002558014,0.00017850014,0.0002230108,0.000034117846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057334142,0.000560814,0.0010555651,0.002438948,0.00026227903,0.0005172155,0.0055382582,0.29374212,0.0020811872,0.036702488,0.005914437,0.65112936],"study_design_scores_gemma":[0.00020706945,0.00013295424,0.00017775877,0.00055833464,0.000016550248,0.000037550748,0.0000053338385,0.99512595,0.00002922153,0.0005816867,0.0028792156,0.00024835058],"about_ca_topic_score_codex":0.0000152915,"about_ca_topic_score_gemma":0.000004124116,"teacher_disagreement_score":0.7013838,"about_ca_system_score_codex":0.000053768796,"about_ca_system_score_gemma":0.000038550144,"threshold_uncertainty_score":0.58113134},"labels":[],"label_agreement":null},{"id":"W2097279164","doi":"10.1103/physrevlett.102.220401","title":"Consistency of the Adiabatic Theorem","year":2009,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Adiabatic process; Adiabatic quantum computation; Adiabatic theorem; Physics; Computation; Consistency (knowledge bases); Quantum mechanics; Quantum; Quantum computer; Theoretical physics; Mathematics; Discrete mathematics","score_opus":0.008996893960188672,"score_gpt":0.25108629954642026,"score_spread":0.24208940558623157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097279164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6332797,0.016626617,0.07312472,0.2725786,0.0006330385,0.0009719729,0.0000033943882,0.00023949031,0.002542453],"genre_scores_gemma":[0.9560356,0.0001404343,0.0026960042,0.04104435,0.0000750834,0.0000021066126,1.7714252e-7,0.0000029574908,0.000003284636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991902,0.000107612665,0.00016059868,0.00017618471,0.00021055511,0.000154856],"domain_scores_gemma":[0.9991696,0.00012017291,0.000103211845,0.00054848526,0.000020212465,0.000038319366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001365624,0.00009675457,0.00022590131,0.000012489999,0.00005889502,0.000016280797,0.00079333317,0.000003711868,0.0000017492698],"category_scores_gemma":[0.000058258578,0.00005327924,0.00020499215,0.00032668674,0.00007072547,0.00004898618,0.00008802893,0.00013225409,0.000011633545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001594996,0.00029694545,0.00010659588,0.0007289264,0.000039741335,0.000010733452,0.0008595327,0.0015418701,0.01842098,0.31619436,0.008170757,0.653628],"study_design_scores_gemma":[0.0007204487,0.00046487682,0.04576671,0.011495217,0.00019066875,0.000090040776,0.0000056041226,0.764975,0.0052541145,0.15077096,0.019070828,0.0011955252],"about_ca_topic_score_codex":0.0000013010158,"about_ca_topic_score_gemma":4.9525973e-8,"teacher_disagreement_score":0.7634331,"about_ca_system_score_codex":0.0000067787105,"about_ca_system_score_gemma":0.000018410112,"threshold_uncertainty_score":0.21726644},"labels":[],"label_agreement":null},{"id":"W2097981279","doi":"10.1088/1367-2630/18/2/023042","title":"Adiabatic and Hamiltonian computing on a 2D lattice with simple two-qubit interactions","year":2016,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministero dello Sviluppo Economico; Institut Périmètre de physique théorique; Industry Canada; European Commission; Government of Canada","keywords":"Hamiltonian (control theory); Adiabatic quantum computation; Adiabatic process; Quantum; Quantum computer; Computation; Planar; Perturbation (astronomy); Lattice (music)","score_opus":0.01295561570669595,"score_gpt":0.2573627116718805,"score_spread":0.24440709596518456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097981279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3759155,0.000026707568,0.62210125,0.0015551379,0.00018335694,0.00003458022,7.705173e-7,0.000023144587,0.00015956053],"genre_scores_gemma":[0.93355656,0.0000034453897,0.06543141,0.00028733947,0.00066206534,1.2501349e-7,8.93184e-8,0.000010051652,0.000048920247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991512,0.000050593913,0.00021020272,0.00015892791,0.00023483486,0.00019426609],"domain_scores_gemma":[0.99887383,0.00039398266,0.00027802467,0.0001984003,0.00009617933,0.00015957865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013939083,0.0001247627,0.0001866052,0.00006608584,0.00012816087,0.00010740286,0.00032063187,0.0000144201895,0.0000027256021],"category_scores_gemma":[0.000026570466,0.00007218732,0.000055909488,0.00019312305,0.00003918618,0.00028307943,0.000088772904,0.00023781117,0.0000069209996],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020607176,0.00007444921,0.0004741486,0.000008902623,0.000061577804,0.0000536331,0.0014140898,0.006601997,0.0013722642,0.009860584,0.0005412,0.97951657],"study_design_scores_gemma":[0.008604312,0.0045035793,0.018016187,0.0031050164,0.00014132305,0.003157323,0.0001461276,0.832835,0.0084919715,0.10611529,0.013755603,0.0011282238],"about_ca_topic_score_codex":0.00001238281,"about_ca_topic_score_gemma":0.00000573114,"teacher_disagreement_score":0.9783883,"about_ca_system_score_codex":0.00002860879,"about_ca_system_score_gemma":0.00010419354,"threshold_uncertainty_score":0.29437137},"labels":[],"label_agreement":null},{"id":"W2099019121","doi":"10.1109/iscas.2007.378651","title":"Asynchronous Adiabatic Logic","year":2007,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Asynchronous circuit; Asynchronous communication; Adiabatic circuit; Asynchronous system; Computer science; Clock domain crossing; Clock gating; Synchronous circuit; Logic gate; Clock signal; Electronic engineering; Logic synthesis; Electronic circuit; Logic family; Engineering; Electrical engineering; Computer network; Algorithm","score_opus":0.009215439586702902,"score_gpt":0.23774096687963642,"score_spread":0.22852552729293352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099019121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030132286,0.000074061296,0.9486821,0.0006209574,0.00031171652,0.00004898548,9.716098e-8,0.00034489293,0.019784853],"genre_scores_gemma":[0.65397745,8.5792215e-7,0.34481844,0.0009329279,0.00010005653,4.8022656e-7,2.4757327e-7,0.0000035775038,0.00016593555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991778,0.0000141096425,0.00013206911,0.00022545193,0.00014197707,0.00030855555],"domain_scores_gemma":[0.9994169,0.00011121667,0.000029969564,0.0003233251,0.000023175311,0.00009545466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003491704,0.00008549031,0.00008287526,0.00007488174,0.00009196925,0.00006948749,0.0005278884,0.00003195754,0.00003365871],"category_scores_gemma":[0.00001925277,0.000064159256,0.000041969837,0.00026488386,0.000022305794,0.00007588377,0.00014896183,0.00010403259,0.00012083182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010692104,0.000052763564,0.00025824807,0.000006448077,0.000008444126,0.00008737317,0.00036118863,0.0013172777,0.0002724653,0.34456915,0.00057129335,0.65249425],"study_design_scores_gemma":[0.00028635107,0.00021131418,0.011477799,0.000014394938,0.0000026420232,0.00016068267,0.000019513323,0.9200812,0.0021362207,0.059117988,0.006146036,0.00034586975],"about_ca_topic_score_codex":0.000012187729,"about_ca_topic_score_gemma":0.0000063537177,"teacher_disagreement_score":0.91876394,"about_ca_system_score_codex":0.000016162816,"about_ca_system_score_gemma":0.000024358133,"threshold_uncertainty_score":0.26163387},"labels":[],"label_agreement":null},{"id":"W2099170023","doi":"10.4086/toc.2009.v005a005","title":"","year":2009,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs; National Science Foundation","keywords":"Hamiltonian (control theory); Quantum algorithm; Quantum; Quantum computer; Point (geometry); Running time; Hamiltonian path","score_opus":0.009077966139590523,"score_gpt":0.23556527225177484,"score_spread":0.22648730611218432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099170023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49026546,0.00010753992,0.5081469,0.00069020176,0.00014381969,0.00008362542,2.3151217e-7,0.00036440426,0.00019786513],"genre_scores_gemma":[0.79898554,0.0000014383462,0.19999306,0.00086097815,0.00014501021,2.46037e-7,5.1044935e-7,0.0000075893054,0.000005632227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693644,0.00048435226,0.00072909147,0.00064107036,0.0004934127,0.00071561977],"domain_scores_gemma":[0.997225,0.0009207086,0.00044295366,0.0010776588,0.00015717366,0.00017649373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026446285,0.00031998137,0.0005285808,0.00027030654,0.00039477658,0.00013176826,0.0025978126,0.00007456071,0.0000010116635],"category_scores_gemma":[0.00015997383,0.00028628504,0.00022408551,0.0008931937,0.00012721152,0.0003470083,0.00049300224,0.00035689643,0.0000016408177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016698677,0.00010123216,0.000120476274,0.000009427778,0.0000137715215,0.000015461512,0.00570766,0.048856076,0.0043039112,0.42836177,0.0000042163233,0.51248926],"study_design_scores_gemma":[0.0005118769,0.00048332888,0.028595828,0.00011592727,0.000005358049,0.000096386124,0.00007299863,0.6068652,0.009866159,0.35308853,0.0000125572105,0.0002858646],"about_ca_topic_score_codex":0.000004341758,"about_ca_topic_score_gemma":1.7140532e-7,"teacher_disagreement_score":0.55800915,"about_ca_system_score_codex":0.000019193505,"about_ca_system_score_gemma":0.0000609067,"threshold_uncertainty_score":0.99995893},"labels":[],"label_agreement":null},{"id":"W2099641843","doi":"10.1142/s0129054103002011","title":"EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Quantum error correction; Quantum; Computer science; Error detection and correction; Theoretical computer science; Mathematics; Topology (electrical circuits); Quantum mechanics; Algorithm; Physics; Combinatorics","score_opus":0.020391253009062395,"score_gpt":0.30380964273272787,"score_spread":0.28341838972366545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099641843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26731783,0.000034647084,0.72588277,0.00060372177,0.00593651,0.000116613635,0.0000036867611,0.000022825163,0.000081402446],"genre_scores_gemma":[0.78670174,0.0000029177393,0.21290553,0.00010955896,0.00026176573,0.000002606653,7.3766876e-7,0.0000075085286,0.000007617675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704903,0.00007337891,0.00087406306,0.00039100376,0.0012504514,0.00036209443],"domain_scores_gemma":[0.99520314,0.0006001118,0.00096544257,0.00038237846,0.0026904189,0.00015849636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022570177,0.00018650803,0.00030591033,0.0008623585,0.0003680297,0.00050202577,0.0031079208,0.00004203771,0.00000533531],"category_scores_gemma":[0.0005727069,0.00016474524,0.00023457175,0.00089959137,0.0003224761,0.0005409116,0.00026361033,0.00023075331,0.000004652884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019607998,0.00056444947,0.0006343296,0.000032310494,0.00014113088,0.000027657708,0.002733308,0.5711983,0.006735516,0.21022145,0.00034000236,0.20735194],"study_design_scores_gemma":[0.00060457824,0.00029850352,0.0014781073,0.00015855768,0.000008969041,0.0005420659,0.000044698147,0.98089504,0.0051458715,0.0098892795,0.00075177616,0.00018257687],"about_ca_topic_score_codex":0.000009256491,"about_ca_topic_score_gemma":0.0000016867599,"teacher_disagreement_score":0.51938397,"about_ca_system_score_codex":0.00013071441,"about_ca_system_score_gemma":0.00092540827,"threshold_uncertainty_score":0.67181164},"labels":[],"label_agreement":null},{"id":"W2100827027","doi":"10.1007/s00037-005-0194-x","title":"Quantum Arthur–Merlin games","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":253,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Quantum pseudo-telepathy; Soundness; Quantum sort; Merlin (protein); Quantum; Discrete mathematics; Mathematics; Quantum computer; Quantum information; Quantum complexity theory; Computer science; Combinatorics; Quantum mechanics; Quantum error correction; Quantum network; Physics","score_opus":0.034762398109001,"score_gpt":0.2775044403854839,"score_spread":0.24274204227648288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100827027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20838526,0.00019799061,0.78324276,0.0061551346,0.00033636202,0.00012216045,0.0000090978565,0.00051318057,0.0010380428],"genre_scores_gemma":[0.70852524,0.0000013112602,0.28990433,0.0011351784,0.0003400962,0.00000473027,0.000019809106,0.00001068162,0.000058646772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998,0.00012326725,0.0003773466,0.00057233457,0.0005143672,0.00041264287],"domain_scores_gemma":[0.998861,0.00019817989,0.00013458569,0.00045806076,0.00017098828,0.0001772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030966653,0.00023831188,0.00024812296,0.00015335326,0.00037605668,0.00022878488,0.0010218045,0.000055652526,0.0000646075],"category_scores_gemma":[0.00004003304,0.00022691184,0.00014065678,0.0004383349,0.0001656769,0.0003219153,0.0003908779,0.0002910151,0.0003717035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055325045,0.00013856453,0.00014148743,0.000009485102,0.000021963946,0.000010046599,0.0004606189,0.37174314,0.00002702612,0.4916775,0.0021965741,0.13356806],"study_design_scores_gemma":[0.00027298697,0.000047694008,0.019240318,0.0000127096955,0.0000021761762,0.000060255086,0.0000041278677,0.75774246,0.000037781512,0.21433628,0.008020282,0.00022290887],"about_ca_topic_score_codex":0.000015838255,"about_ca_topic_score_gemma":0.0000091980955,"teacher_disagreement_score":0.50013995,"about_ca_system_score_codex":0.000052987558,"about_ca_system_score_gemma":0.0001200431,"threshold_uncertainty_score":0.9253196},"labels":[],"label_agreement":null},{"id":"W2101220699","doi":"10.1109/date.2005.249","title":"Quantum Circuit Simplification Using Templates","year":2005,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Victoria","funders":"","keywords":"Toffoli gate; Quantum circuit; Template; Quantum gate; Computer science; Controlled NOT gate; Heuristic; Quantum algorithm; Quantum; Logic gate; Quantum computer; Electronic circuit; Quantum Fourier transform; Algorithm; Theoretical computer science; Topology (electrical circuits); Arithmetic; Quantum error correction; Mathematics; Physics; Quantum mechanics; Programming language; Artificial intelligence","score_opus":0.03164678931683171,"score_gpt":0.25082539244800217,"score_spread":0.21917860313117046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101220699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25039285,0.00017505151,0.74838024,0.0004092233,0.00008939154,0.0001444348,0.0000012609386,0.0002876031,0.00011992649],"genre_scores_gemma":[0.91408235,0.000022320048,0.08556551,0.00017386019,0.00011033508,0.000003107575,0.0000028090772,0.000013067311,0.00002663889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988666,0.000120461635,0.00029567946,0.00034000105,0.00015419298,0.00022306154],"domain_scores_gemma":[0.99901307,0.0004258835,0.00011213681,0.00028371473,0.000103414306,0.00006179905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004484317,0.00013952774,0.00013065714,0.00017933683,0.00019865124,0.00021663011,0.00031786002,0.000044428358,0.0000035140433],"category_scores_gemma":[0.00023392512,0.00012880508,0.000016457117,0.0007025833,0.000035401874,0.00036561524,0.000065729684,0.00011752788,0.000024779822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006436567,0.00059954694,0.021113047,0.000111968446,0.000027776348,0.000058602127,0.009626687,0.24300183,0.030554766,0.10870182,0.00084498985,0.58535254],"study_design_scores_gemma":[0.00017653246,0.000044930475,0.040191364,0.00003516213,0.0000026467376,0.000068075686,0.000005054644,0.9546758,0.00060106744,0.0025920987,0.0014440345,0.00016326456],"about_ca_topic_score_codex":0.000018555278,"about_ca_topic_score_gemma":0.0000023120745,"teacher_disagreement_score":0.7116739,"about_ca_system_score_codex":0.000024065637,"about_ca_system_score_gemma":0.00006298482,"threshold_uncertainty_score":0.5252519},"labels":[],"label_agreement":null},{"id":"W2101278892","doi":"10.1145/1366110.1366168","title":"Pairwise decomposition of toffoli gates in a quantum circuit","year":2008,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Toffoli gate; Quantum gate; Quantum circuit; Logic gate; Controlled NOT gate; Computer science; Quantum Fourier transform; Quantum computer; Quantum algorithm; Gate count; Quantum error correction; Electronic circuit; Algorithm; Topology (electrical circuits); Quantum; Mathematics; Arithmetic; Physics; Quantum mechanics; Computer hardware; Combinatorics","score_opus":0.017225418234562598,"score_gpt":0.2396666239536708,"score_spread":0.2224412057191082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101278892","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7821549,0.00009756595,0.21605323,0.0004200451,0.000117329364,0.00006980323,6.137603e-7,0.00011071593,0.0009757635],"genre_scores_gemma":[0.9800754,0.000014309506,0.019708514,0.00012815735,0.00002806281,0.0000026680116,9.820893e-7,0.0000047235317,0.000037153895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990893,0.0000516082,0.00023707448,0.0002413206,0.00017182206,0.00020884913],"domain_scores_gemma":[0.9994432,0.00011665995,0.00006138876,0.0002912076,0.00003609642,0.000051485695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014669425,0.000097104385,0.00016257424,0.0001527647,0.000062133986,0.000016173752,0.00041547176,0.000037971866,0.000011071588],"category_scores_gemma":[0.00001792852,0.00008206069,0.000059574537,0.00040261296,0.000045058267,0.00012494414,0.000118802534,0.00010003406,0.000013222611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042641215,0.0018765755,0.049197957,0.00018984545,0.000072313574,0.00086999603,0.018495323,0.058394626,0.03216128,0.5721726,0.0029606037,0.26356626],"study_design_scores_gemma":[0.00032986898,0.00012535664,0.029311342,0.000043564338,0.0000010714882,0.00013100116,0.000012498224,0.9523623,0.0056178137,0.011673734,0.00023433221,0.00015712944],"about_ca_topic_score_codex":0.00014287033,"about_ca_topic_score_gemma":0.000010554303,"teacher_disagreement_score":0.8939677,"about_ca_system_score_codex":0.00001491778,"about_ca_system_score_gemma":0.000046002126,"threshold_uncertainty_score":0.33463377},"labels":[],"label_agreement":null},{"id":"W2102578765","doi":"10.1088/1751-8113/40/28/s07","title":"Optimal phase estimation in quantum networks","year":2007,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; St. Jerome's University","funders":"","keywords":"Estimation; Phase (matter); Quantum; Computer science; Statistical physics; Physics; Quantum mechanics; Engineering; Systems engineering","score_opus":0.007070581204836997,"score_gpt":0.26745498564973014,"score_spread":0.26038440444489314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102578765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39187407,0.000033409735,0.6076715,0.0002580162,0.000055957673,0.000029916955,1.3485517e-7,0.000008478234,0.000068519046],"genre_scores_gemma":[0.85666776,0.0000038289227,0.14313127,0.000053639626,0.00013659634,2.799171e-7,1.437884e-7,0.000005413613,0.0000010553501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885803,0.00004790107,0.0004659353,0.0001240773,0.00025646354,0.00024758067],"domain_scores_gemma":[0.9989636,0.000549805,0.00014554907,0.00013126538,0.000057850848,0.00015193819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012797873,0.0001133736,0.00026690302,0.00006897806,0.00004376245,0.0000849581,0.00027204174,0.000053663145,0.000006666337],"category_scores_gemma":[0.00011373669,0.00007770397,0.000079383484,0.00021881713,0.00019326844,0.00015083615,0.00010711956,0.00036113634,0.0000023764683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025722686,0.00029996294,0.0000046106834,0.000013875551,0.000008315505,0.000073166746,0.0003658692,0.008669288,0.000041751427,0.92855537,0.0000056804224,0.06193636],"study_design_scores_gemma":[0.00038622954,0.00017843847,0.000026827827,0.00005803794,0.0000044880826,0.00014979408,0.000010581617,0.5432246,0.00013533582,0.45577097,0.0000033809004,0.00005133904],"about_ca_topic_score_codex":1.5649428e-7,"about_ca_topic_score_gemma":2.774458e-8,"teacher_disagreement_score":0.5345553,"about_ca_system_score_codex":0.000012745946,"about_ca_system_score_gemma":0.000021943719,"threshold_uncertainty_score":0.3168676},"labels":[],"label_agreement":null},{"id":"W2102708856","doi":"10.1142/s0218126612500181","title":"DESIGN AND OPTIMIZATION OF SINGLE AND MULTIPLE-LOOP REVERSIBLE AND QUANTUM FEEDBACK CIRCUITS","year":2012,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Sequential logic; Electronic circuit; Computer science; Combinational logic; Logic gate; Logic synthesis; Quantum logic; Electronic engineering; Algorithm; Computer engineering; Arithmetic; Quantum; Quantum computer; Mathematics; Engineering; Electrical engineering; Physics","score_opus":0.024076327811302572,"score_gpt":0.21791952333210318,"score_spread":0.19384319552080062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102708856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29435837,0.0062290747,0.69857305,0.00009526507,0.00058778713,0.0001297961,8.943301e-7,0.000014821627,0.000010955698],"genre_scores_gemma":[0.97267264,0.00023927224,0.026842363,0.00004581239,0.00017865174,4.6870332e-7,2.770498e-7,0.000011664382,0.000008835944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998547,0.0001910219,0.00050570484,0.00022142507,0.00026298192,0.00027185713],"domain_scores_gemma":[0.998498,0.00037737287,0.0005498232,0.0001565308,0.00015460426,0.00026362468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000871703,0.00018653796,0.00044103674,0.00022664802,0.00014587528,0.00023047549,0.00020681783,0.00008286596,3.038087e-7],"category_scores_gemma":[0.000035552464,0.00015573592,0.00003906553,0.00019865842,0.00009360595,0.00057335093,0.00014598873,0.0001591209,1.4234551e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045451376,0.00051858614,0.019160409,0.0016610975,0.0005091282,0.00008119935,0.017414227,0.5928456,0.019429004,0.007338089,0.000953748,0.34004343],"study_design_scores_gemma":[0.0010567474,0.0005121536,0.0038845106,0.0005456783,0.00003164559,0.0019657314,0.00016152713,0.9911699,0.00018868563,0.000120879995,0.00014321317,0.0002192762],"about_ca_topic_score_codex":0.000015114131,"about_ca_topic_score_gemma":1.343504e-7,"teacher_disagreement_score":0.67831427,"about_ca_system_score_codex":0.000018168887,"about_ca_system_score_gemma":0.000035328503,"threshold_uncertainty_score":0.63507265},"labels":[],"label_agreement":null},{"id":"W2102740171","doi":"10.1088/1742-6596/306/1/012030","title":"Quantum discord in quantum computation","year":2011,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum discord; Quantum entanglement; Measure (data warehouse); Quantum; Quantum capacity; Quantum channel; Quantum information; Quantum process; Amplitude damping channel","score_opus":0.035849132417262376,"score_gpt":0.2519858227078173,"score_spread":0.2161366902905549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102740171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.300891,0.00004325465,0.6978139,0.00033394335,0.00056946353,0.000044916913,9.883357e-7,0.000025987816,0.0002765179],"genre_scores_gemma":[0.96621907,0.000023038905,0.03354575,0.00004799688,0.0001433292,8.5063624e-7,5.856065e-7,0.000008119966,0.000011232297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987055,0.00009968613,0.00047097108,0.00018099294,0.00029771196,0.0002451179],"domain_scores_gemma":[0.9989652,0.00005807927,0.00044230837,0.00019747159,0.00025252218,0.00008444018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028743746,0.00016247419,0.00030840427,0.00012746007,0.00007345006,0.00013015991,0.0007060839,0.000040153423,0.0000056785857],"category_scores_gemma":[0.000027517379,0.00013084606,0.00010092037,0.00036890674,0.00009116369,0.0010251345,0.00014440512,0.00035447828,0.000006360621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006153742,0.00027710677,0.0013723884,0.000035183362,0.000033927627,0.0001485874,0.013111986,0.0029414168,0.0014998894,0.64698994,0.00009453172,0.3334335],"study_design_scores_gemma":[0.0005478933,0.0008871812,0.018918093,0.00023730837,0.000009520536,0.00017944498,0.0005157936,0.36097834,0.012767923,0.60450244,0.00012644444,0.00032961444],"about_ca_topic_score_codex":0.0000344132,"about_ca_topic_score_gemma":0.000009801767,"teacher_disagreement_score":0.6653281,"about_ca_system_score_codex":0.00002207657,"about_ca_system_score_gemma":0.00019948957,"threshold_uncertainty_score":0.53357476},"labels":[],"label_agreement":null},{"id":"W2102864190","doi":"10.1038/nature10713","title":"Implementation of a Toffoli gate with superconducting circuits","year":2011,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":398,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Toffoli gate; Qubit; Quantum computer; Quantum gate; Quantum circuit; Quantum error correction; Controlled NOT gate; Computer science; Quantum mechanics; Physics; Topology (electrical circuits); Quantum; Mathematics","score_opus":0.018028376231047222,"score_gpt":0.26127005507200235,"score_spread":0.24324167884095513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102864190","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9703498,0.0001656486,0.028018417,0.00024432418,0.00021980633,0.000095559975,0.000002797803,0.00009329593,0.0008103422],"genre_scores_gemma":[0.9532321,0.0000015199497,0.046506163,0.00019040493,0.000048287817,0.0000018531022,0.0000013777304,0.0000061773094,0.000012100788],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992864,0.000026389696,0.0001171528,0.0002173515,0.00017964783,0.0001730258],"domain_scores_gemma":[0.99953276,0.00002517086,0.00007169646,0.00025100922,0.000079879435,0.00003949124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012512955,0.000089062196,0.00010279863,0.00006778868,0.00006047176,0.000021260637,0.0003770109,0.00015606808,0.000017107097],"category_scores_gemma":[0.0000081891385,0.000064837775,0.000031250347,0.00028718813,0.000021176944,0.00017681082,0.00007954,0.0005772208,0.0000022630018],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014113109,0.00012089101,0.007484754,0.00009791771,0.000108585074,0.000081139406,0.031970292,0.00020489885,0.028441243,0.048979037,0.00035873352,0.8821384],"study_design_scores_gemma":[0.0028652828,0.00130638,0.1136691,0.00025903282,0.000057878584,0.0005834781,0.0027308133,0.048061687,0.8122356,0.01384527,0.0031171816,0.0012682853],"about_ca_topic_score_codex":0.00008214968,"about_ca_topic_score_gemma":0.000016505857,"teacher_disagreement_score":0.8808701,"about_ca_system_score_codex":0.000007696278,"about_ca_system_score_gemma":0.000047538844,"threshold_uncertainty_score":0.26440078},"labels":[],"label_agreement":null},{"id":"W2103213553","doi":"10.37236/652","title":"Quantum Walks on Regular Graphs and Eigenvalues","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Spectrum (functional analysis); Stochastic matrix; Strongly regular graph; Matrix (chemical analysis); Quantum; Discrete mathematics; Random walk; Graph; Quantum algorithm; Pathwidth; Line graph; Quantum mechanics; Markov chain; Physics","score_opus":0.011295949816812496,"score_gpt":0.2079735669755661,"score_spread":0.1966776171587536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103213553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9016551,0.005185573,0.09024865,0.0012461295,0.0008998351,0.00009991737,2.2269195e-7,0.000063372754,0.00060120766],"genre_scores_gemma":[0.9989011,0.00049916154,0.0003476982,0.00015064063,0.00004560071,6.2162803e-7,5.9337562e-8,0.000011458192,0.000043618264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850786,0.00016674734,0.00029995854,0.00016141403,0.00038801334,0.0004760184],"domain_scores_gemma":[0.9989409,0.00014289473,0.00030054283,0.00040129773,0.00012222677,0.00009217073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011968799,0.00015867625,0.00022090894,0.00014397624,0.00022127302,0.00006364048,0.001136604,0.00005108974,0.0000019191273],"category_scores_gemma":[0.00004090658,0.000096754,0.00011049044,0.00037996942,0.00008052729,0.00013345489,0.00013536388,0.000751551,0.0000030119947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001750161,0.00007869662,0.000057294306,0.000003637874,0.000044480043,0.000017783817,0.0010346276,0.00003996841,0.000061772655,0.99191946,0.00014830945,0.006576442],"study_design_scores_gemma":[0.000377294,0.0015541391,0.0011304432,0.00003035834,0.000017790977,0.00040680228,0.000034315734,0.012455368,0.0012592445,0.98172694,0.0008803905,0.00012688119],"about_ca_topic_score_codex":0.00000648176,"about_ca_topic_score_gemma":5.3255513e-7,"teacher_disagreement_score":0.09724605,"about_ca_system_score_codex":0.000054198248,"about_ca_system_score_gemma":0.00016365969,"threshold_uncertainty_score":0.39455137},"labels":[],"label_agreement":null},{"id":"W2103230521","doi":"10.1109/pacrim.2011.6032956","title":"NCV realization of MCT gates with mixed controls","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Toffoli gate; Realization (probability); Controlled NOT gate; Quantum gate; Electronic circuit; NOR logic; Logic gate; Quantum circuit; Computer science; Arithmetic; Quantum computer; Quantum; Mathematics; Topology (electrical circuits); Algorithm; Logic synthesis; Electrical engineering; Engineering; Quantum error correction; Physics; Quantum mechanics","score_opus":0.013635415252422158,"score_gpt":0.1974306683712952,"score_spread":0.18379525311887304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103230521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0739298,0.00002307272,0.918133,0.00008732291,0.000075148026,0.000078331315,6.2386476e-7,0.00012485788,0.0075478437],"genre_scores_gemma":[0.881977,0.0000015969164,0.1178353,0.00007800643,0.000016910104,0.0000017576402,8.2309145e-7,0.0000041450044,0.00008443546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994227,0.000031806736,0.00012659443,0.000168455,0.00012351213,0.00012687437],"domain_scores_gemma":[0.99951106,0.00003945401,0.000073470415,0.00026744232,0.00007002496,0.000038526978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011169888,0.00007356317,0.0001149097,0.0000495416,0.000038033155,0.000020186231,0.00032119724,0.000022209986,0.000016176762],"category_scores_gemma":[0.000010022239,0.000046853962,0.000024581388,0.00019706141,0.000033991993,0.00008802657,0.00006312401,0.0000414933,0.0000043943483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003988117,0.0001885892,0.0048265946,0.000033294033,0.00006210605,0.000019608946,0.0034996227,0.0019362723,0.002029332,0.8972209,0.000656035,0.08948778],"study_design_scores_gemma":[0.0009815042,0.0007821134,0.032166965,0.00007255005,0.000011965084,0.00004376052,0.000057601777,0.9030453,0.0400663,0.021847079,0.00062327785,0.00030156758],"about_ca_topic_score_codex":0.000114800256,"about_ca_topic_score_gemma":0.000014412728,"teacher_disagreement_score":0.90110904,"about_ca_system_score_codex":0.0000030585322,"about_ca_system_score_gemma":0.00002535509,"threshold_uncertainty_score":0.19106492},"labels":[],"label_agreement":null},{"id":"W2103286274","doi":"10.1109/tit.2003.809569","title":"The inequalities of quantum information theory","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Von Neumann entropy; Combinatorics; Multipartite; Density matrix; Quantum relative entropy; Discrete mathematics; Subadditivity; Quantum state; Entropy (arrow of time); Monotonic function; Quantum; Quantum entanglement; Quantum discord; Quantum mechanics; Mathematical analysis; Physics","score_opus":0.007305151534862395,"score_gpt":0.2129751825237104,"score_spread":0.205670030988848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103286274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037872144,0.000029947505,0.99027324,0.00017324318,0.0010661846,0.00018022199,0.000016627186,0.00016650268,0.0043068263],"genre_scores_gemma":[0.99601996,0.00003240387,0.003242065,0.0005414985,0.000012692537,0.000027326834,0.0000027121177,0.00000501564,0.000116333526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832743,0.00039496255,0.00060542463,0.00008123009,0.0003552687,0.00023568227],"domain_scores_gemma":[0.99804366,0.0009221987,0.00028668644,0.0005144383,0.00017674766,0.000056268047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019541185,0.00015534235,0.00013506226,0.00024883545,0.00057646626,0.00021613113,0.00052098185,0.00007133654,0.000024831641],"category_scores_gemma":[0.000077331046,0.00010801219,0.00011888232,0.00040839455,0.00013116223,0.0021865233,0.0000037737464,0.0002628461,0.00011285721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027518514,0.0000167171,3.3913045e-7,0.000019613011,0.000020422904,7.032398e-8,0.004867578,0.032881908,0.00000639028,0.7906913,0.000060770064,0.17140736],"study_design_scores_gemma":[0.0010787474,0.00037946829,0.00007133206,0.00009458584,0.00002499187,0.00005196307,0.00493377,0.39472866,0.023933802,0.53342944,0.040759813,0.00051340525],"about_ca_topic_score_codex":0.000005030461,"about_ca_topic_score_gemma":5.765781e-7,"teacher_disagreement_score":0.99223274,"about_ca_system_score_codex":0.00003106345,"about_ca_system_score_gemma":0.00010646832,"threshold_uncertainty_score":0.44337708},"labels":[],"label_agreement":null},{"id":"W2103406724","doi":"10.1103/physrevlett.100.130503","title":"Effect of Local Minima on Adiabatic Quantum Optimization","year":2008,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Adiabatic process; Adiabatic quantum computation; Maxima and minima; Physics; Quantum; Hamiltonian (control theory); Quantum computer; Exponential growth; Computation; Quantum mechanics; Quantum algorithm; Statistical physics; Mathematics; Mathematical optimization; Algorithm; Mathematical analysis","score_opus":0.008461654635145165,"score_gpt":0.2570818649109064,"score_spread":0.24862021027576123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103406724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3659569,0.0012437364,0.6288549,0.0033690527,0.00014854837,0.0002813879,0.0000010909645,0.00008873335,0.00005569828],"genre_scores_gemma":[0.9881184,0.00040783317,0.005493027,0.005831603,0.000117845506,0.0000143933685,0.0000028620611,0.000012153867,0.0000018561963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987385,0.00024058732,0.00020927771,0.00029455867,0.00031038217,0.00020669072],"domain_scores_gemma":[0.99891675,0.0004666979,0.000117846925,0.00040344353,0.000021097,0.0000741756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019744244,0.00016761357,0.00040821868,0.000043872617,0.000068856214,0.000010014709,0.00044721033,0.000008248347,0.0000029802975],"category_scores_gemma":[0.000058239406,0.00011888764,0.00018898763,0.00035632832,0.00009856353,0.000076945566,0.000079591926,0.00015519332,0.000038423772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022813862,0.00029985714,0.000049352984,0.0026296466,0.000055302102,0.000087175744,0.0003993058,0.7678558,0.0015051281,0.0030651097,0.0056368653,0.2183936],"study_design_scores_gemma":[0.00017541784,0.00053700496,0.000102140584,0.0009434923,0.000015829612,0.000016108293,1.8182834e-7,0.9965115,0.0012735148,0.000029457222,0.00026081555,0.00013454183],"about_ca_topic_score_codex":0.000003534588,"about_ca_topic_score_gemma":2.0277602e-8,"teacher_disagreement_score":0.6233618,"about_ca_system_score_codex":0.000017267432,"about_ca_system_score_gemma":0.000015385924,"threshold_uncertainty_score":0.48480973},"labels":[],"label_agreement":null},{"id":"W2103473460","doi":"10.1137/110833026","title":"Quantum Query Complexity of Minor-Closed Graph Properties","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minor (academic); Mathematics; Combinatorics; Vertex (graph theory); Upper and lower bounds; Graph; Discrete mathematics; Quantum; Planar graph; Physics","score_opus":0.047918382395501294,"score_gpt":0.2581324715016704,"score_spread":0.21021408910616912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103473460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77885354,0.000806064,0.2171264,0.0006930563,0.0018618541,0.000105100706,0.0000011217093,0.00013757587,0.0004153164],"genre_scores_gemma":[0.95740885,0.000009074587,0.041316256,0.00032503653,0.0009040613,4.7819344e-7,5.581801e-7,0.000019593259,0.00001610776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727285,0.000335141,0.00068666344,0.00029288352,0.00063444185,0.00077801204],"domain_scores_gemma":[0.99828696,0.00020448047,0.0005647287,0.00045844613,0.00018051118,0.0003048899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013926025,0.0002899232,0.0004398166,0.00031788432,0.0005443991,0.00018634336,0.0011093005,0.000078146106,0.000007476374],"category_scores_gemma":[0.00009868744,0.00021846528,0.00026855833,0.0005096678,0.00019120623,0.00033371747,0.00037798478,0.0007690401,0.000021855807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020192176,0.0029379197,0.024178935,0.00055705226,0.0005788146,0.0002116088,0.026201986,0.075339176,0.020912986,0.33464053,0.0036422429,0.5105968],"study_design_scores_gemma":[0.0011060397,0.0007391336,0.035801042,0.0009199399,0.000022083363,0.0014119261,0.00020320209,0.93550867,0.008721785,0.013170146,0.0015991612,0.00079689216],"about_ca_topic_score_codex":0.00001838437,"about_ca_topic_score_gemma":6.3826224e-7,"teacher_disagreement_score":0.8601695,"about_ca_system_score_codex":0.000047848305,"about_ca_system_score_gemma":0.00009104712,"threshold_uncertainty_score":0.8908756},"labels":[],"label_agreement":null},{"id":"W2103532256","doi":"10.1109/isit.2007.4557324","title":"A class of quantum LDPC codes: construction and performances under iterative decoding","year":2007,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Low-density parity-check code; Computer science; Quantum convolutional code; Quantum; Binary erasure channel; Code (set theory); Raptor code; Decoding methods; Set (abstract data type); Algorithm; Theoretical computer science; Block code; Linear code; Channel (broadcasting); Channel capacity; Computer network; Physics; Error floor; Quantum mechanics","score_opus":0.011207717217074663,"score_gpt":0.25156181889032747,"score_spread":0.2403541016732528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103532256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43212333,0.000053148466,0.56668925,0.00014181586,0.00014175585,0.000032958542,4.051401e-7,0.000043187963,0.0007741375],"genre_scores_gemma":[0.8337945,0.000011073896,0.16602725,0.0001051756,0.00003835963,4.1283462e-7,3.543171e-7,0.0000026405198,0.000020260817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992463,0.000022389804,0.00020203223,0.00020823987,0.00013808337,0.00018295477],"domain_scores_gemma":[0.9994976,0.00016359483,0.00008729229,0.00013947436,0.000057739893,0.000054299206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034394034,0.00009283486,0.0001316631,0.000113052236,0.00012708927,0.0000675929,0.00017191003,0.000037491405,0.0000049101463],"category_scores_gemma":[0.000010342037,0.00007042529,0.000027705357,0.00022419104,0.00011718195,0.00019873811,0.00010607731,0.000102802966,0.0000015092952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014660708,0.00003577712,0.0042715287,0.0000423157,0.000032975917,0.00000620077,0.003285952,0.0025085285,0.0024866248,0.67586744,0.000060349103,0.31138766],"study_design_scores_gemma":[0.00021106904,0.00011893288,0.003943774,0.000039858503,0.000002679882,0.00008720852,0.00042708244,0.9807721,0.006911918,0.00714501,0.00022380914,0.00011657076],"about_ca_topic_score_codex":0.000017726199,"about_ca_topic_score_gemma":0.000011391232,"teacher_disagreement_score":0.97826356,"about_ca_system_score_codex":0.0000105833615,"about_ca_system_score_gemma":0.00002497719,"threshold_uncertainty_score":0.287186},"labels":[],"label_agreement":null},{"id":"W2103756595","doi":"","title":"Quantum Fanout is Powerful","year":2005,"lang":"en","type":"article","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum Fourier transform; Mathematics; Bounded function; Logarithm; Qubit; Constant (computer programming); Quantum algorithm; Discrete mathematics; Quantum; Quantum gate; Quantum circuit; Basis (linear algebra); Quantum computer; Polynomial; Quantum error correction; Computer science; Mathematical analysis; Quantum mechanics; Geometry; Physics","score_opus":0.04903077237976819,"score_gpt":0.3411908800885129,"score_spread":0.2921601077087447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103756595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09102085,0.00015388319,0.86504793,0.037145957,0.000742709,0.0014897691,0.0000324247,0.00010412601,0.0042623547],"genre_scores_gemma":[0.85300046,0.000076908575,0.14252874,0.0035947387,0.00062395027,0.00007345374,0.0000061753644,0.000015755257,0.00007982355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461484,0.00009997185,0.00068302423,0.00044428356,0.0031258923,0.0010319983],"domain_scores_gemma":[0.9966563,0.0014408883,0.0001953593,0.0007096437,0.0008137961,0.0001840385],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012078806,0.00026888345,0.00026724857,0.0005052025,0.0015739901,0.0017971471,0.0044424925,0.000086318956,0.000006836019],"category_scores_gemma":[0.0005815719,0.0001500772,0.00011112798,0.0016951519,0.001254114,0.0013824902,0.0010286467,0.00067645207,0.00004290914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016769196,0.00029848595,0.000032320208,0.00012856205,0.000028850347,0.000003063214,0.039755937,0.014146174,0.000029592557,0.8256015,0.008979359,0.11097934],"study_design_scores_gemma":[0.0004263731,0.00014943126,0.00017884056,0.00009022162,0.0000029648627,0.000103348706,0.00021490648,0.8484271,0.00006460022,0.11248168,0.037679415,0.00018106848],"about_ca_topic_score_codex":0.000015002772,"about_ca_topic_score_gemma":0.000016696937,"teacher_disagreement_score":0.83428097,"about_ca_system_score_codex":0.00019660106,"about_ca_system_score_gemma":0.00069175626,"threshold_uncertainty_score":0.9997258},"labels":[],"label_agreement":null},{"id":"W2105900640","doi":"10.1109/pacrim.2011.6032872","title":"A simple approach for designing online testable reversible circuits","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Testability; Computer science; Garbage; Simple (philosophy); Electronic circuit; Feature (linguistics); Computer engineering; Circuit extraction; Circuit design; Electronic engineering; Computer hardware; Embedded system; Reliability engineering; Equivalent circuit; Electrical engineering; Engineering; Programming language","score_opus":0.05233284595101597,"score_gpt":0.24564719720487624,"score_spread":0.19331435125386026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105900640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039129765,0.000044911878,0.9885848,0.00003419328,0.00007389978,0.0002251585,0.000004280152,0.00032383093,0.006795933],"genre_scores_gemma":[0.2049428,8.9258026e-7,0.7940953,0.00028350466,0.00007285175,0.000010299526,0.000009331759,0.000010541878,0.000574503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890697,0.000026560676,0.00015990596,0.00040147098,0.00012357628,0.00038151772],"domain_scores_gemma":[0.99929374,0.000087972556,0.000056403394,0.00039516692,0.000070009584,0.00009672725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026473257,0.00012974023,0.00014848595,0.000081983,0.00019309988,0.0000683665,0.0007182942,0.000046188903,0.000018121389],"category_scores_gemma":[0.000039708633,0.000107546264,0.00007155769,0.00033172275,0.000020082565,0.00018622793,0.0001868475,0.00010411521,0.000006811856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035539775,0.0030794262,0.004854311,0.00050145545,0.00024163819,0.000059655686,0.014232929,0.030546127,0.012361493,0.17240477,0.05487303,0.70680964],"study_design_scores_gemma":[0.00029641896,0.00015737717,0.00041740123,0.000007093661,0.000005034752,0.000017729792,0.00005841159,0.98537695,0.0036286365,0.007919145,0.0019128134,0.00020298736],"about_ca_topic_score_codex":0.000062128645,"about_ca_topic_score_gemma":0.0000021136661,"teacher_disagreement_score":0.9548308,"about_ca_system_score_codex":0.0000137834095,"about_ca_system_score_gemma":0.000055655106,"threshold_uncertainty_score":0.43856096},"labels":[],"label_agreement":null},{"id":"W2106385292","doi":"10.1109/pacrim.2011.6032905","title":"Ordering techniques for ESOP-based Toffoli cascade generation","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toffoli gate; Computer science; Cascade; Process (computing); Matching (statistics); Algorithm; Arithmetic; Parallel computing; Programming language; Quantum gate; Mathematics; Qubit","score_opus":0.03750185165310928,"score_gpt":0.25173006434390816,"score_spread":0.2142282126907989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106385292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013972494,0.00002428977,0.98357075,0.00033573323,0.00019244828,0.00017838101,8.068345e-7,0.00053876714,0.0011863195],"genre_scores_gemma":[0.31191677,6.1620665e-7,0.6873997,0.00043525983,0.0001399632,0.00002339165,0.0000014429784,0.0000067302767,0.00007611297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931127,0.000017116205,0.00012821518,0.00025959464,0.000088380126,0.00019544593],"domain_scores_gemma":[0.9995491,0.00003670918,0.000039092396,0.0002788431,0.00005013329,0.00004613635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016073289,0.00009736712,0.000085755695,0.00007302875,0.00013091369,0.00006669327,0.00036718484,0.000045088465,0.000009426305],"category_scores_gemma":[0.000018300154,0.00007837606,0.000053881427,0.00013166021,0.000014092338,0.000104765284,0.00007217408,0.000058819493,0.0000039452298],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000592701,0.00010015665,0.00007881784,0.000027007945,0.000013660854,0.00000864,0.0009523195,0.0012093115,0.013174317,0.059499606,0.002663023,0.9222672],"study_design_scores_gemma":[0.000083180814,0.000096167045,0.0000537354,0.000006212247,0.0000015041129,0.000005010523,0.000002118075,0.7814154,0.2135436,0.0014203744,0.0032628377,0.000109861],"about_ca_topic_score_codex":0.000062150284,"about_ca_topic_score_gemma":0.000013892325,"teacher_disagreement_score":0.92215735,"about_ca_system_score_codex":0.000011401576,"about_ca_system_score_gemma":0.00003622703,"threshold_uncertainty_score":0.3196083},"labels":[],"label_agreement":null},{"id":"W2106410065","doi":"10.1145/1403375.1403620","title":"Quantified synthesis of reversible logic","year":2008,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Logic gate; Logic synthesis; Programming language; Algorithm","score_opus":0.025140193304580307,"score_gpt":0.23022659445880775,"score_spread":0.20508640115422744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106410065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17324582,0.00009248402,0.80562586,0.0017030856,0.0002815806,0.00007508159,0.0000011224201,0.00027597183,0.018699016],"genre_scores_gemma":[0.78783625,0.00001182345,0.21135727,0.00019194433,0.000022517683,0.0000010720405,1.3161278e-7,0.0000030404692,0.0005759241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929893,0.000034691886,0.00014599746,0.00020756485,0.00015856586,0.00015427414],"domain_scores_gemma":[0.9993024,0.00017358974,0.000055738008,0.00038447123,0.00004083859,0.000042979744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013060201,0.00007380389,0.00014082254,0.00007619693,0.00009811356,0.00001113504,0.00055922405,0.000030724106,0.000021878148],"category_scores_gemma":[0.00005383156,0.00005587092,0.00006708402,0.0003022756,0.000052738986,0.00007414881,0.00015701696,0.00006348589,0.000036144444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026751593,0.00069270167,0.0034049037,0.00016011253,0.00013525397,0.00036786604,0.003222012,0.014166216,0.013621299,0.7062681,0.047626205,0.21030858],"study_design_scores_gemma":[0.0003133762,0.00017825728,0.007314808,0.000063492436,0.00000773404,0.00029680954,0.000031335352,0.8746682,0.098735295,0.012460619,0.0054923007,0.0004377967],"about_ca_topic_score_codex":0.000040714003,"about_ca_topic_score_gemma":8.200532e-7,"teacher_disagreement_score":0.86050195,"about_ca_system_score_codex":0.000004898297,"about_ca_system_score_gemma":0.0000358151,"threshold_uncertainty_score":0.22783501},"labels":[],"label_agreement":null},{"id":"W2106572562","doi":"10.1109/ismvl.2010.40","title":"Toffoli Gate Implementation Using the Billiard Ball Model","year":2010,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Toffoli gate; Ball (mathematics); Computer science; Cascade; Dynamical billiards; Logic gate; Arithmetic; Topology (electrical circuits); Mathematics; Algorithm; Quantum gate; Engineering; Combinatorics; Physics; Qubit; Geometry","score_opus":0.01972297750841638,"score_gpt":0.2951636227132198,"score_spread":0.2754406452048034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106572562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37167785,0.0000036199092,0.6261919,0.001374915,0.000275898,0.00006314744,7.745855e-7,0.000089583846,0.00032231346],"genre_scores_gemma":[0.7256745,7.263795e-7,0.27357936,0.000585084,0.00009242736,0.0000016485934,4.7677813e-7,0.0000048291695,0.00006097126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992391,0.000023685903,0.00012845303,0.00021742322,0.00017040515,0.00022096049],"domain_scores_gemma":[0.99941605,0.00004581555,0.000047045087,0.00040384757,0.000039379727,0.000047831556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024842378,0.00009006049,0.00006379746,0.000036679376,0.00023884865,0.00018388167,0.0006049869,0.000027311735,0.000020901227],"category_scores_gemma":[0.0000067424694,0.000051573334,0.00004656843,0.00016795163,0.000027740985,0.00013713725,0.00023806769,0.00018282169,0.000009670815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021427973,0.00004287657,0.0002981574,0.000006879873,0.00002427613,0.000006071546,0.0039775143,0.41045105,0.047196627,0.24398318,0.0011452619,0.29286596],"study_design_scores_gemma":[0.000093687864,0.000010713391,0.00018710978,0.0000015276502,0.0000023898801,0.00001650355,0.000016914066,0.9833969,0.002414751,0.012793022,0.0009777908,0.000088697525],"about_ca_topic_score_codex":0.00011059612,"about_ca_topic_score_gemma":0.000051535117,"teacher_disagreement_score":0.57294583,"about_ca_system_score_codex":0.0000068495633,"about_ca_system_score_gemma":0.00004679145,"threshold_uncertainty_score":0.21030995},"labels":[],"label_agreement":null},{"id":"W2107222991","doi":"10.1017/s089006040800019x","title":"Evolving blackbox quantum algorithms using genetic programming","year":2008,"lang":"en","type":"article","venue":"Artificial intelligence for engineering design analysis and manufacturing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Quantum sort; Quantum computer; Quantum algorithm; Quantum; Genetic programming; Theoretical computer science; Algorithm; Quantum complexity theory; Quantum network; Quantum mechanics; Artificial intelligence; Physics","score_opus":0.039899687528056206,"score_gpt":0.2562014924601071,"score_spread":0.2163018049320509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107222991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12658007,0.00029932897,0.8723502,0.00004269656,0.00020770932,0.00026702989,0.0000014516842,0.0002502579,0.0000012292226],"genre_scores_gemma":[0.53590375,0.000021813772,0.46391678,0.000012567176,0.000108749584,0.000013310874,0.0000014165212,0.000017166749,0.0000044399103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783164,0.000039454702,0.0005369618,0.0006918612,0.00026465414,0.00063544564],"domain_scores_gemma":[0.998901,0.00029165685,0.00013413589,0.00041268964,0.000075337775,0.00018518051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043118594,0.00032613266,0.0004266679,0.00061031035,0.00051075546,0.0003123012,0.00049659907,0.00009007257,0.0000044680646],"category_scores_gemma":[0.000067674,0.00031400146,0.00027466964,0.0006974811,0.000061840976,0.00026588654,0.00015981327,0.00019770916,0.0000031558532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003835902,0.000028744455,0.000031849988,0.000025411036,0.00022985406,0.000028486995,0.0006768118,0.86915785,0.001263618,0.0011232465,0.000002392369,0.12742792],"study_design_scores_gemma":[0.000027611555,0.00008307492,0.0003451516,0.00002507448,0.00013705634,0.000054600216,0.000031775675,0.94539213,0.051780857,0.0016279601,0.00011340159,0.0003813106],"about_ca_topic_score_codex":0.00009898795,"about_ca_topic_score_gemma":0.0000028450177,"teacher_disagreement_score":0.4093237,"about_ca_system_score_codex":0.000047055968,"about_ca_system_score_gemma":0.000037229696,"threshold_uncertainty_score":0.9999312},"labels":[],"label_agreement":null},{"id":"W2107544401","doi":"","title":"A Synthesis Method for MVL Reversible Logic","year":2004,"lang":"en","type":"article","venue":"International Symposium on Multiple-Valued Logic","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Victoria","funders":"","keywords":"Toffoli gate; Variable (mathematics); Algorithm; Computer science; Logic gate; Extension (predicate logic); Logic synthesis; Simple (philosophy); Function (biology); Heuristic; Cascade; Mathematics","score_opus":0.024797629873279596,"score_gpt":0.2984721228471878,"score_spread":0.2736744929739082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107544401","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005529284,0.00003371938,0.96808743,0.021839539,0.0017659246,0.00044663515,0.000041573923,0.00039039657,0.0018655002],"genre_scores_gemma":[0.32799113,0.000010460727,0.66770405,0.0034886291,0.00042137958,0.00011144791,0.000013536604,0.000023780764,0.0002355876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975915,0.00012510881,0.00039419348,0.00085942657,0.00056187215,0.0004679128],"domain_scores_gemma":[0.9974673,0.0014227815,0.00021239753,0.000534052,0.00022307254,0.00014041133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064588746,0.0003191405,0.0003015337,0.00021252455,0.00027679262,0.00022870401,0.0017834528,0.00014097999,0.000020477884],"category_scores_gemma":[0.00080252386,0.00026599359,0.00031070237,0.00027680382,0.00005065911,0.00020599405,0.0003091937,0.00026096724,0.00010262287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001541475,0.00058673805,0.00013184565,0.000036091107,0.00019043077,0.00006971883,0.0006642322,0.5179497,0.0131356735,0.4406232,0.00076694466,0.025691262],"study_design_scores_gemma":[0.0018225298,0.0004124476,0.00037033836,0.00013013624,0.000020867548,0.00009650357,0.000023361354,0.8983803,0.014059753,0.07600754,0.008170823,0.00050541625],"about_ca_topic_score_codex":0.00010624395,"about_ca_topic_score_gemma":0.0000074530913,"teacher_disagreement_score":0.38043058,"about_ca_system_score_codex":0.00024156424,"about_ca_system_score_gemma":0.00007603593,"threshold_uncertainty_score":0.9999792},"labels":[],"label_agreement":null},{"id":"W2107720564","doi":"10.1088/1367-2630/6/1/167","title":"On the quantum computational complexity of the Ising spin glass partition function and of knot invariants","year":2004,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Partition function (quantum field theory); Ising model; Spin glass; Connection (principal bundle); Quantum; Quantum computer; Quantum annealing; Computation; Potts model; Statistical mechanics","score_opus":0.03351419191975423,"score_gpt":0.2507688299056249,"score_spread":0.21725463798587064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107720564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49283066,0.0000214552,0.5049839,0.0018961801,0.00021206547,0.00003501129,0.0000015123455,0.000003043143,0.00001617477],"genre_scores_gemma":[0.9905971,0.0000018237085,0.009029888,0.0002010122,0.0001650628,9.5189826e-8,2.7928013e-7,0.000003443824,0.0000012542414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911624,0.00008235185,0.00027524505,0.000084701605,0.0003546326,0.00008684951],"domain_scores_gemma":[0.99903727,0.0001490178,0.00050078233,0.00014756693,0.0001299327,0.000035442834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026048356,0.000075730015,0.00014321649,0.000028024337,0.00012363783,0.000035927296,0.00030232212,0.000020601401,0.00000140378],"category_scores_gemma":[0.000035814748,0.00004322117,0.000083886625,0.0002286579,0.00012251957,0.00012800253,0.00008076969,0.00020864344,5.617904e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022374257,0.00010608496,0.00011222127,0.000013088024,0.00002896171,8.451841e-7,0.0007072411,0.27019173,0.0021008337,0.71034545,0.0001452834,0.016225865],"study_design_scores_gemma":[0.00047395503,0.00026345538,0.02358926,0.00017243218,0.000010607651,0.000021714679,0.000018760158,0.20398112,0.0025857068,0.7688261,0.00001337508,0.0000434952],"about_ca_topic_score_codex":0.000028124794,"about_ca_topic_score_gemma":0.0000024658773,"teacher_disagreement_score":0.4977665,"about_ca_system_score_codex":0.000018309926,"about_ca_system_score_gemma":0.00014479818,"threshold_uncertainty_score":0.17625083},"labels":[],"label_agreement":null},{"id":"W2108274236","doi":"10.5539/ijel.v2n5p154","title":"Ordinary Language Problem and Quantum Reality","year":2012,"lang":"en","type":"article","venue":"International Journal of English Linguistics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Perspective (graphical); Ordinary language philosophy; Speculation; Macro; Quantum; Epistemology; Habit; Computer science; Linguistics; Psychology; Philosophy; Artificial intelligence; Quantum mechanics; Social psychology; Physics","score_opus":0.01260585013149372,"score_gpt":0.2813044115734116,"score_spread":0.26869856144191784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108274236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45580834,0.0064446544,0.34756267,0.001320248,0.12394163,0.0002777601,0.000052686195,0.0003766515,0.064215384],"genre_scores_gemma":[0.91869926,0.000030423153,0.06791139,0.00013825341,0.013191275,2.8990218e-7,0.000001399661,0.000007046033,0.000020662163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998968,0.000051872335,0.0003258185,0.00009659308,0.00038153367,0.00017620593],"domain_scores_gemma":[0.99519575,0.0001866688,0.00026994088,0.00012769083,0.004082101,0.00013785929],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00064566924,0.000094216004,0.00013508573,0.0001195585,0.000043314685,0.0001188785,0.0006106623,0.000040531435,0.000004124225],"category_scores_gemma":[0.009769495,0.000077743236,0.0000581981,0.00008144784,0.0000355321,0.000123944,0.00023212306,0.00026848185,0.0000014149068],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010691518,0.0009279331,0.015748272,0.00008336935,0.000524513,0.00051803084,0.030026466,0.0032334125,0.00017935979,0.8008354,0.03157291,0.11624347],"study_design_scores_gemma":[0.0016820201,0.00045861735,0.011588845,0.0002989857,0.000052139836,0.0002830425,0.00051477685,0.07713409,0.00077492825,0.032946356,0.87364477,0.0006214345],"about_ca_topic_score_codex":0.000010271797,"about_ca_topic_score_gemma":5.132136e-7,"teacher_disagreement_score":0.84207183,"about_ca_system_score_codex":0.000031048596,"about_ca_system_score_gemma":0.000050003953,"threshold_uncertainty_score":0.99857163},"labels":[],"label_agreement":null},{"id":"W2108661017","doi":"10.5120/16281-5852","title":"Reversible Architecture of Computer Arithmetic","year":2014,"lang":"en","type":"article","venue":"International Journal of Computer Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Arithmetic; Architecture; Computer architecture; Mathematics; Visual arts; Art","score_opus":0.006647315282304355,"score_gpt":0.2433650674381937,"score_spread":0.23671775215588933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108661017","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054071005,0.00006505633,0.9900271,0.0029850767,0.0010324274,0.000111220856,0.000004590379,0.000045232548,0.00032218263],"genre_scores_gemma":[0.3141634,0.000010861901,0.6835999,0.0005743309,0.0016086161,0.000003882396,0.0000031012023,0.000010206796,0.00002572616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818355,0.00009804023,0.00065693574,0.0002446936,0.0006375726,0.00017922245],"domain_scores_gemma":[0.99772626,0.00032449386,0.000631259,0.00041243676,0.00078364025,0.00012188886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045345904,0.00016070362,0.00029116188,0.0004299687,0.00006932294,0.00013194862,0.002411174,0.000058420705,0.000008076237],"category_scores_gemma":[0.000011905047,0.0001380991,0.00023137008,0.0003352897,0.00007932727,0.00018357145,0.00039955744,0.0003197323,0.000013441247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011364169,0.00024029323,0.00022077192,0.000019455574,0.00017561276,0.000010263237,0.00044820344,0.0737449,0.00040409007,0.052256573,0.002180127,0.8702883],"study_design_scores_gemma":[0.0008631923,0.00034751877,0.0025764343,0.00013607056,0.000020700489,0.0007345194,0.0000035750018,0.8537729,0.0009407871,0.03642809,0.10393917,0.00023708073],"about_ca_topic_score_codex":0.000006198916,"about_ca_topic_score_gemma":7.943058e-7,"teacher_disagreement_score":0.87005126,"about_ca_system_score_codex":0.00003548237,"about_ca_system_score_gemma":0.00010194615,"threshold_uncertainty_score":0.5631518},"labels":[],"label_agreement":null},{"id":"W2109924867","doi":"10.1007/s00453-002-0976-3","title":"Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Binary tree; Binary search tree; Element (criminal law); Binary number; Oracle; Discrete mathematics; Quantum; Sorting; Quantum algorithm; Algorithm; Computer science; Arithmetic; Physics; Quantum mechanics","score_opus":0.02030524396563501,"score_gpt":0.23947494096838004,"score_spread":0.21916969700274502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109924867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2491688,0.0008443368,0.7431738,0.0035110118,0.00044521896,0.00031427108,0.000019831008,0.00036332666,0.0021594423],"genre_scores_gemma":[0.92298,0.000015464942,0.07660506,0.00011101992,0.00011273223,0.0000065900813,0.0000033316878,0.000015606585,0.00015020222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825704,0.00009789943,0.00039876677,0.0004414142,0.00037340724,0.00043146394],"domain_scores_gemma":[0.9989496,0.00017866018,0.00018738912,0.0004730669,0.00008194607,0.00012937946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000281266,0.00020442788,0.00029969413,0.00012778466,0.00024279431,0.000116025425,0.00067498407,0.00004557541,0.000046163175],"category_scores_gemma":[0.000052789346,0.00017854225,0.00006992476,0.00028707608,0.00019663136,0.00012968322,0.00051603274,0.00021907504,0.000009172274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006121905,0.00030250195,0.0007510797,0.00015618383,0.00009105747,0.000046854937,0.0051548677,0.0006112653,0.0005419407,0.26806673,0.0015792778,0.72269213],"study_design_scores_gemma":[0.0003740164,0.00017257457,0.0015668138,0.000042500855,0.0000065016443,0.000053279677,0.00006639417,0.97326356,0.00069474464,0.021166021,0.002359231,0.00023434668],"about_ca_topic_score_codex":0.000106121886,"about_ca_topic_score_gemma":0.0000062766962,"teacher_disagreement_score":0.9726523,"about_ca_system_score_codex":0.000014249295,"about_ca_system_score_gemma":0.000019108611,"threshold_uncertainty_score":0.72807413},"labels":[],"label_agreement":null},{"id":"W2110322033","doi":"10.1088/1367-2630/17/12/123010","title":"On the robustness of bucket brigade quantum RAM","year":2015,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Canadian Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"","keywords":"Quantum error correction; Robustness (evolution); Quantum; Oracle; Quantum memory; Error detection and correction; Quantum computer; Word error rate","score_opus":0.031101054353140183,"score_gpt":0.2545588529585201,"score_spread":0.22345779860537993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110322033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30964312,0.000093936855,0.6869236,0.0023131778,0.00083047035,0.000036621368,6.087303e-7,0.000012889023,0.00014558746],"genre_scores_gemma":[0.98182064,0.0000043960486,0.016678033,0.0002717951,0.0011710421,1.6631402e-7,1.4238871e-7,0.000009626932,0.000044158518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988594,0.000092452305,0.0002769627,0.00010372854,0.0005068067,0.00016061912],"domain_scores_gemma":[0.99868613,0.00023459955,0.0004059972,0.00032284457,0.00021142987,0.00013901139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047044866,0.00010755363,0.00021214545,0.000039813876,0.000051623345,0.00006256096,0.0010224464,0.000029671715,0.0000020313319],"category_scores_gemma":[0.000086000124,0.000062849635,0.00012922141,0.0002990771,0.000044882792,0.00013869097,0.00011641435,0.00034697118,0.000004282032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035080044,0.00019409151,0.000032516145,0.000011062506,0.00005966166,0.000023948314,0.0018941695,0.60254633,0.00040080785,0.17266665,0.03401447,0.1881212],"study_design_scores_gemma":[0.00085553346,0.0007814601,0.00022305652,0.00017241409,0.000015846343,0.00012943898,0.000067675435,0.77659595,0.005362521,0.21359365,0.0020389438,0.00016352271],"about_ca_topic_score_codex":0.000009549546,"about_ca_topic_score_gemma":3.5280206e-7,"teacher_disagreement_score":0.67217755,"about_ca_system_score_codex":0.000017688657,"about_ca_system_score_gemma":0.0002762822,"threshold_uncertainty_score":0.2562934},"labels":[],"label_agreement":null},{"id":"W2111867612","doi":"10.26421/qic11.3-4-10","title":"Global geometric entanglement in transverse-field XY spin chains: finite and infinite systems","year":2011,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantum entanglement; Quantum mechanics; Physics; Degenerate energy levels; Squashed entanglement; Ground state; Thermodynamic limit; Quantum phase transition; Quantum","score_opus":0.016886115270656542,"score_gpt":0.23924187443633485,"score_spread":0.22235575916567832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111867612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2746261,0.00016874693,0.72389215,0.00016067082,0.000286181,0.00020496975,0.0000050750104,0.000091997485,0.00056410104],"genre_scores_gemma":[0.9931545,0.00006484155,0.0063575706,0.00037473266,0.000019600418,0.00001025343,0.000013294486,0.0000028389195,0.0000023569876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988586,0.00005797307,0.00046109487,0.00017840129,0.00022628426,0.0002176579],"domain_scores_gemma":[0.9994685,0.00008588976,0.0001672102,0.00012207027,0.00006787399,0.00008843998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033456972,0.00014963717,0.00016047858,0.00042983273,0.00011229931,0.0002288671,0.00016697777,0.00006887741,0.000002904249],"category_scores_gemma":[0.000036077534,0.00014112699,0.000026597878,0.00083741633,0.000023662575,0.0009216426,0.00008587959,0.0001072262,0.000010031589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004070259,0.0000888478,0.0065895203,0.00021696262,0.000025282441,0.000012502455,0.014080282,0.037699986,0.000003235645,0.17370455,0.00014116331,0.767397],"study_design_scores_gemma":[0.00067943794,0.00025749573,0.027533874,0.000056436962,0.0000034844495,0.000028893059,0.0003981036,0.96821415,0.000010733431,0.0021161842,0.0005316522,0.00016952587],"about_ca_topic_score_codex":0.00030090896,"about_ca_topic_score_gemma":0.0000124646,"teacher_disagreement_score":0.9305142,"about_ca_system_score_codex":0.000034995304,"about_ca_system_score_gemma":0.00003245568,"threshold_uncertainty_score":0.5754992},"labels":[],"label_agreement":null},{"id":"W2113949234","doi":"10.1109/cec.2006.1688610","title":"A Decision Diagram Package for Reversible and Quantum Circuit Simulation","year":2006,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Influence diagram; Computer science; Representation (politics); Quantum circuit; Matrix multiplication; Circuit diagram; Quantum; Matrix representation; Quantum gate; Diagram; Theoretical computer science; Electronic circuit; Algorithm; Matrix (chemical analysis); Binary decision diagram; Computer engineering; Electronic engineering; Quantum computer; Quantum network; Quantum mechanics; Physics; Engineering; Decision tree; Artificial intelligence","score_opus":0.013326260430490185,"score_gpt":0.2482618497413888,"score_spread":0.2349355893108986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113949234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11063103,0.00007996906,0.8882727,0.00022402819,0.00018194577,0.00016539019,0.0000018521379,0.00015332001,0.00028975596],"genre_scores_gemma":[0.88930035,0.0000018976493,0.11028851,0.000112493726,0.000100684854,0.0000039062647,0.0000028806548,0.000006155622,0.00018315065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918014,0.000016682037,0.00015014027,0.00031283373,0.00013736074,0.00020281726],"domain_scores_gemma":[0.9991486,0.00045208185,0.000045666755,0.00025887662,0.000048022976,0.000046722973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001942889,0.00009767556,0.000107302985,0.00007859129,0.00017390263,0.00016189329,0.00022425436,0.000045056247,0.0000030091294],"category_scores_gemma":[0.00004484777,0.00007908595,0.00004879663,0.0001923105,0.000018098199,0.00015565223,0.00010505473,0.000055419598,0.0000060241214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007813755,0.00008911098,0.0009592299,0.00003005518,0.000007987115,0.0000061602864,0.00021960352,0.0704447,0.0007626456,0.23816103,0.0031092996,0.68620235],"study_design_scores_gemma":[0.00028770554,0.00007008687,0.0038755336,0.0000133569565,0.0000022360862,0.00000465099,0.000002380658,0.8555519,0.00019848865,0.13728628,0.0025997641,0.00010762959],"about_ca_topic_score_codex":0.000041559928,"about_ca_topic_score_gemma":0.000009581607,"teacher_disagreement_score":0.7851072,"about_ca_system_score_codex":0.000011261067,"about_ca_system_score_gemma":0.00001541599,"threshold_uncertainty_score":0.32250315},"labels":[],"label_agreement":null},{"id":"W2115164346","doi":"10.1109/icqnm.2009.21","title":"All Languages in NP Have Very Short Quantum Proofs","year":2009,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematical proof; Soundness; Quantum entanglement; Completeness (order theory); Complexity class; Class (philosophy); Quantum; Quantum complexity theory; Computer science; Discrete mathematics; Logarithm; Theoretical computer science; Mathematics; Quantum information; Time complexity; Quantum mechanics; Programming language; Physics; Artificial intelligence","score_opus":0.012586147890409672,"score_gpt":0.2687880434198737,"score_spread":0.25620189552946404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115164346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6975487,0.0004912641,0.26678556,0.014530832,0.00040200888,0.0003556246,0.0000015320318,0.00090883014,0.018975636],"genre_scores_gemma":[0.96562654,0.000004936175,0.031551138,0.002433462,0.000100121855,0.0000023626396,0.000001649335,0.0000054427205,0.000274336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998844,0.000043096396,0.00018453793,0.00036813557,0.00020673998,0.00035344448],"domain_scores_gemma":[0.9994244,0.0000493608,0.000022269118,0.0004083642,0.000019859684,0.00007573222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022947237,0.00014075464,0.0001557479,0.00013038232,0.00004360854,0.00011791792,0.0006434403,0.00005437871,0.000007443833],"category_scores_gemma":[0.00001905787,0.000110535475,0.000054078893,0.00021679532,0.00001692214,0.00015029215,0.00012484293,0.00020699328,0.00002185981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012733205,0.00043802202,0.0054014423,0.000018301518,0.000021274565,0.0006576,0.003604989,0.006676334,0.0018593234,0.095242254,0.007526684,0.87854105],"study_design_scores_gemma":[0.00022879934,0.00020006193,0.03559468,0.000030783594,0.0000020074178,0.000071169205,0.000044075983,0.94860494,0.0013913037,0.008831052,0.004680077,0.00032104272],"about_ca_topic_score_codex":0.000067219255,"about_ca_topic_score_gemma":0.000034441648,"teacher_disagreement_score":0.9419286,"about_ca_system_score_codex":0.000019688106,"about_ca_system_score_gemma":0.000029498759,"threshold_uncertainty_score":0.45075056},"labels":[],"label_agreement":null},{"id":"W2116385615","doi":"10.1145/1278349.1278355","title":"Techniques for the synthesis of reversible Toffoli networks","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of New Brunswick; University of Waterloo","funders":"","keywords":"Computer science; Toffoli gate; Template; Benchmark (surveying); Realization (probability); Algorithm; Complement (music); Sequence (biology); High-level synthesis; Field-programmable gate array; Quantum gate; Computer hardware; Programming language; Mathematics","score_opus":0.015136136277127111,"score_gpt":0.2484756168493447,"score_spread":0.23333948057221757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116385615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035502756,0.00039685055,0.9977594,0.00030447784,0.00023030587,0.00070989644,0.000002403852,0.00019790423,0.000043750017],"genre_scores_gemma":[0.9003886,0.00004099822,0.09935494,0.000019941244,0.000045322697,0.00007645299,4.1979195e-7,0.00001067913,0.00006266699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869746,0.00011702952,0.0004292982,0.00020784598,0.0002335122,0.00031485938],"domain_scores_gemma":[0.99542403,0.0034556398,0.0002769137,0.0006754262,0.00013809204,0.000029873221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018280983,0.00012559557,0.0002172297,0.00019447564,0.00018957436,0.000032455762,0.0008286936,0.00008989692,0.000002714026],"category_scores_gemma":[0.00008439454,0.00009344256,0.00013240777,0.0005136226,0.00004061679,0.00010954969,0.000007172667,0.00014277844,0.0000010677478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004476438,0.00009838114,0.0000016774236,0.00007733671,0.00013265539,3.663911e-7,0.0002383573,0.50728095,0.001715541,0.010180454,0.0002543822,0.47997513],"study_design_scores_gemma":[0.00011722524,0.00034054427,0.00003137878,0.00011955839,0.000030167388,0.0000162439,0.000034803466,0.9250978,0.07253963,0.0009676048,0.0006073298,0.00009769883],"about_ca_topic_score_codex":0.000036199897,"about_ca_topic_score_gemma":0.000003455079,"teacher_disagreement_score":0.90003353,"about_ca_system_score_codex":0.00007506376,"about_ca_system_score_gemma":0.00009404338,"threshold_uncertainty_score":0.3810477},"labels":[],"label_agreement":null},{"id":"W2116560510","doi":"10.4086/toc.2015.v011a003","title":"","year":2015,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Office of Naval Research; Industry Canada; Centre de Recherches Mathématiques; Canada Research Chairs; Government of Canada; McGill University; Institut Périmètre de physique théorique; Canadian Institute for Advanced Research","keywords":"LOCC; Quantum entanglement; Separable space; Separable state; Quantum complexity theory; Quantum state; Hilbert space; State (computer science); Class (philosophy)","score_opus":0.02375489289472492,"score_gpt":0.25114493347704003,"score_spread":0.2273900405823151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116560510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49054527,0.00013603576,0.5080619,0.0002789263,0.00033357815,0.00008063352,3.1786524e-7,0.00033094216,0.00023242978],"genre_scores_gemma":[0.7768318,5.133751e-7,0.22271495,0.00026302866,0.00016645165,6.937603e-7,6.1251023e-7,0.000013421803,0.000008541797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966281,0.0007341326,0.0007019128,0.0006031996,0.0006698263,0.0006628343],"domain_scores_gemma":[0.9967455,0.0010100605,0.00044860842,0.0010776324,0.00034343055,0.00037472433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005078183,0.00030118975,0.00051649427,0.0002542122,0.00022511318,0.00012914812,0.0026285553,0.00007299872,4.944966e-7],"category_scores_gemma":[0.00042433667,0.00026679458,0.00016486281,0.00089102396,0.00020776888,0.0003779797,0.0015139568,0.0003255919,0.000003522927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040975137,0.00012756312,0.0011075007,0.000026987052,0.000041541043,0.00003141678,0.026914066,0.2055632,0.00082519255,0.4797151,0.000027518041,0.28557894],"study_design_scores_gemma":[0.00090659497,0.0003236465,0.0029336205,0.0000899057,0.000005924475,0.00013006793,0.0004286836,0.73514736,0.004885744,0.2548149,0.000045058445,0.00028847216],"about_ca_topic_score_codex":0.00002157833,"about_ca_topic_score_gemma":6.4151124e-7,"teacher_disagreement_score":0.52958417,"about_ca_system_score_codex":0.00003419414,"about_ca_system_score_gemma":0.00017962694,"threshold_uncertainty_score":0.9999784},"labels":[],"label_agreement":null},{"id":"W2117075286","doi":"10.1109/cec.2006.1688609","title":"Analyzing Fault Models for Reversible Logic Circuits","year":2006,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Stuck-at fault; Fault model; Computer science; Fault (geology); Electronic circuit; Fault coverage; Automatic test pattern generation; Logic gate; Algorithm; Computer engineering; Fault detection and isolation; Engineering; Artificial intelligence; Electrical engineering","score_opus":0.020945880344450832,"score_gpt":0.2418436797612303,"score_spread":0.22089779941677948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117075286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034745443,0.00011886081,0.98778075,0.001239037,0.00017515376,0.00012565478,0.0000018229127,0.00028703726,0.0067971656],"genre_scores_gemma":[0.61683226,0.0000019427819,0.38095292,0.0004783557,0.00018376323,0.000006449056,0.000003597666,0.000008039993,0.0015326566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904394,0.000017510489,0.00015855968,0.0003520672,0.00012106658,0.00030686904],"domain_scores_gemma":[0.999434,0.00009108583,0.00005001707,0.0003122817,0.00006708284,0.000045531593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001830447,0.000110835754,0.00012859832,0.00009307325,0.0001822646,0.00013458267,0.0005479621,0.000043783726,0.000003820187],"category_scores_gemma":[0.000008715541,0.00009024252,0.000095857,0.00030858556,0.000015384683,0.0002073274,0.00012306815,0.00007611747,0.000010102324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.282181e-7,0.000037610054,0.00003628072,0.000014448332,0.00000788794,0.000004142768,0.00006503329,0.53559685,0.00034090673,0.40704677,0.0056560277,0.051193517],"study_design_scores_gemma":[0.00015366735,0.00003137307,0.000047890037,0.000007567452,0.0000023963096,0.0000075661123,0.0000026117043,0.79865795,0.00036752035,0.19925444,0.0013493067,0.00011772085],"about_ca_topic_score_codex":0.00007510321,"about_ca_topic_score_gemma":0.0000066741222,"teacher_disagreement_score":0.6133577,"about_ca_system_score_codex":0.000017538416,"about_ca_system_score_gemma":0.000028900644,"threshold_uncertainty_score":0.36799833},"labels":[],"label_agreement":null},{"id":"W2118518847","doi":"10.1038/srep00571","title":"Finding low-energy conformations of lattice protein models by quantum annealing","year":2012,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":387,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"Division of Chemistry; National Science Foundation","keywords":"Quantum annealing; Quantum; Protein structure prediction; Protein folding; Statistical physics; Simulated annealing; Lattice (music); Computer science; Energy landscape; Physics; Protein structure; Biological system; Algorithm; Quantum mechanics; Quantum computer; Thermodynamics; Biology","score_opus":0.016213528753418843,"score_gpt":0.23668851335715316,"score_spread":0.22047498460373433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118518847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38158926,0.0002988171,0.61385196,0.00013163191,0.0029836448,0.00013356484,0.0000028553648,0.00012791982,0.0008803473],"genre_scores_gemma":[0.98036027,7.719878e-7,0.019000014,0.000030465912,0.00006035746,0.000010177589,0.000016461878,0.00000874317,0.00051274156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979017,0.000057622623,0.0005824599,0.00040771108,0.0005578046,0.0004927416],"domain_scores_gemma":[0.9982833,0.000047435922,0.00047080062,0.0008648198,0.00016028153,0.00017333993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001609412,0.00014277412,0.00018838052,0.00019172716,0.0004422713,0.00030620533,0.00043053736,0.000057809146,0.000007340294],"category_scores_gemma":[0.00006390161,0.00012519579,0.00008638207,0.0007164707,0.00012161351,0.0010420298,0.00024905163,0.000121886296,0.0000049119526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009720427,0.0009390453,0.00087928574,0.00045762182,0.00012958971,0.00014152951,0.023712207,0.20423558,0.13773884,0.51630116,0.037004486,0.078450896],"study_design_scores_gemma":[0.00005820808,0.000015199142,0.000019816654,0.00008896759,0.000004057176,0.000107041684,0.000038706447,0.92833567,0.037241995,0.029014274,0.0048957923,0.00018029941],"about_ca_topic_score_codex":0.000050093033,"about_ca_topic_score_gemma":0.000001077249,"teacher_disagreement_score":0.72410005,"about_ca_system_score_codex":0.000022692473,"about_ca_system_score_gemma":0.00010303323,"threshold_uncertainty_score":0.51053363},"labels":[],"label_agreement":null},{"id":"W2119388976","doi":"10.1088/1367-2630/9/6/199","title":"Topological fault-tolerance in cluster state quantum computation","year":2007,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":629,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Physics; Cluster state; Quantum computer; Topology (electrical circuits); Overhead (engineering); Logarithm; Computation; Quantum circuit; Cluster (spacecraft); Electronic circuit; Fault tolerance; Equivalence (formal languages); Boundary (topology); Quantum; Quantum error correction; Algorithm; Quantum mechanics; Computer science; Discrete mathematics; Distributed computing; Mathematics; Combinatorics; Mathematical analysis","score_opus":0.015615175795883368,"score_gpt":0.2761413577396484,"score_spread":0.260526181943765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119388976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41429654,0.000063480984,0.584745,0.00044128374,0.0003669796,0.000027010781,1.8080853e-7,0.000012917457,0.00004660685],"genre_scores_gemma":[0.9165824,0.000007170774,0.08247891,0.00040119467,0.0005063651,7.2823845e-8,2.2325206e-7,0.000005605577,0.00001803215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987744,0.000060743034,0.000433878,0.00014748353,0.0003204396,0.00026304403],"domain_scores_gemma":[0.9991767,0.0001837374,0.00029727575,0.000121509605,0.00010356689,0.00011724816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057071325,0.00011262395,0.00021562313,0.00008642277,0.000049362123,0.00006882175,0.0004552471,0.00003844746,0.0000011305738],"category_scores_gemma":[0.000022682292,0.00008839141,0.00008860755,0.0003693728,0.000031292773,0.00025642585,0.00008737284,0.0004064203,0.000005386062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037397174,0.000115212606,0.00057082274,0.000007533459,0.000009479904,0.0001318792,0.0018842969,0.4394547,0.00050779106,0.005168602,0.00043654678,0.55167574],"study_design_scores_gemma":[0.0010713306,0.00030882846,0.013617522,0.0000790919,0.000002767157,0.00013491325,0.000025829107,0.8683478,0.0012946733,0.11439564,0.0005605719,0.00016102543],"about_ca_topic_score_codex":0.000017346627,"about_ca_topic_score_gemma":0.000006566805,"teacher_disagreement_score":0.5515147,"about_ca_system_score_codex":0.00003794494,"about_ca_system_score_gemma":0.00008624587,"threshold_uncertainty_score":0.3604497},"labels":[],"label_agreement":null},{"id":"W2120279343","doi":"10.1109/sfcs.2002.1181970","title":"Limits on the power of quantum statistical zero-knowledge","year":2003,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Zero-knowledge proof; Computer science; Quantum state; Discrete mathematics; Class (philosophy); Quantum computer; Quantum; Mathematics; Theoretical computer science; Algorithm; Quantum mechanics; Cryptography; Artificial intelligence; Physics","score_opus":0.01824714275324224,"score_gpt":0.2563820712395374,"score_spread":0.23813492848629514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120279343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046433803,0.00005052777,0.92279184,0.0008223875,0.00040054595,0.00008516645,0.000002165989,0.00007860532,0.029334962],"genre_scores_gemma":[0.97289866,0.0000015224086,0.026409704,0.00036840452,0.000013937394,0.0000019394456,2.2558235e-7,0.0000062785575,0.0002993226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898124,0.00016122035,0.00017794674,0.0002490342,0.00019909117,0.00023145457],"domain_scores_gemma":[0.9985419,0.00078194326,0.000046389723,0.0005072716,0.000057023954,0.00006550868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038134702,0.000114444105,0.0001297709,0.00004692638,0.0001050385,0.00004841006,0.0005527789,0.000034171735,0.00007164686],"category_scores_gemma":[0.00020308288,0.00006315965,0.00004984272,0.0002549671,0.000070935865,0.000033583376,0.00007332167,0.00017045459,0.00010254239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001357933,0.00008657265,0.000030597737,0.0000029732937,0.000006635412,0.000003344315,0.00040842025,0.00023980129,0.00007508676,0.98978966,0.004209498,0.005146069],"study_design_scores_gemma":[0.00038624674,0.000752007,0.003365484,0.000053610427,0.0000057131347,0.000038975904,0.00006551855,0.79279363,0.008989125,0.17065418,0.022534993,0.00036048953],"about_ca_topic_score_codex":0.0000039226793,"about_ca_topic_score_gemma":7.370562e-7,"teacher_disagreement_score":0.92646486,"about_ca_system_score_codex":0.000007500064,"about_ca_system_score_gemma":0.000057352572,"threshold_uncertainty_score":0.25755757},"labels":[],"label_agreement":null},{"id":"W2121087903","doi":"10.1017/s0960129506005251","title":"Quantum weakest preconditions","year":2006,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds Wetenschappelijk Onderzoek","keywords":"Predicate transformer semantics; Precondition; Predicate (mathematical logic); Computer science; Computation; Probabilistic logic; Semantics (computer science); Operational semantics; Theoretical computer science; Mathematics; Algebra over a field; Programming language; Pure mathematics; Artificial intelligence","score_opus":0.008472072875403596,"score_gpt":0.24173012044996373,"score_spread":0.23325804757456012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121087903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15005004,0.000032771863,0.8474394,0.00061074196,0.00058830954,0.00014990589,0.0000020337475,0.00023290794,0.0008938878],"genre_scores_gemma":[0.67011684,3.2319898e-7,0.32952437,0.00016054277,0.00017346365,0.0000063372263,8.93753e-7,0.000006577437,0.00001066336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997414,0.000053270152,0.0004468643,0.0007628089,0.00065262744,0.0006704167],"domain_scores_gemma":[0.9986381,0.00023743043,0.00009965865,0.0008142461,0.00007337819,0.00013719327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005564479,0.00023255825,0.00025489027,0.00034289106,0.00035947084,0.00062737777,0.002342669,0.000051778014,0.000029897514],"category_scores_gemma":[0.000048794143,0.00018359949,0.00007559157,0.0013816039,0.0005191836,0.00047759837,0.0007637249,0.00027838012,0.000043249114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.8163987e-7,0.00009491271,0.00035466667,0.000020355184,0.0000016766983,0.000040232106,0.00022598042,0.026097331,0.00030282565,0.9295174,0.0002706609,0.04307321],"study_design_scores_gemma":[0.000103955936,0.000020603773,0.013063417,0.000022413466,7.656649e-7,0.000111738365,0.000001179737,0.553871,0.00027030654,0.43229344,0.000096713,0.00014444505],"about_ca_topic_score_codex":0.000026161131,"about_ca_topic_score_gemma":0.000007292326,"teacher_disagreement_score":0.5277737,"about_ca_system_score_codex":0.00007027997,"about_ca_system_score_gemma":0.0001144274,"threshold_uncertainty_score":0.748697},"labels":[],"label_agreement":null},{"id":"W2121836691","doi":"10.1098/rspa.2009.0433","title":"Matchgate and space-bounded quantum computations are equivalent","year":2009,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"","keywords":"Quantum computer; Unitary state; Quantum; Class (philosophy); Quantum circuit; Computation; Quantum algorithm; Quantum operation; Logarithm","score_opus":0.00937754344067798,"score_gpt":0.2196507988412448,"score_spread":0.21027325540056682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121836691","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9487667,0.00006669332,0.04655342,0.004218393,0.000041272204,0.000094311385,7.8707905e-7,0.00010420355,0.00015422453],"genre_scores_gemma":[0.9498334,0.0000031494997,0.050019592,0.000070165894,0.000051082316,0.0000020152481,2.5854126e-8,0.000003406094,0.000017140954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904114,0.000003217547,0.00014418764,0.0002621228,0.000304596,0.000244764],"domain_scores_gemma":[0.9996055,0.00011416947,0.0000860951,0.00006591005,0.000041428935,0.00008692439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023990848,0.00013839106,0.0002119565,0.00001809719,0.00027822453,0.00021835048,0.00045247682,0.000029955581,3.4086787e-7],"category_scores_gemma":[0.00005284908,0.00008429962,0.0001074653,0.00032730325,0.00025567165,0.0001428108,0.00025664293,0.00015341163,6.7257463e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010837358,0.00013879703,0.00008016256,0.0002850014,0.000018738463,2.1220775e-7,0.00367337,0.012257217,0.0021899429,0.97949785,0.00013586727,0.0017217452],"study_design_scores_gemma":[0.00006482112,0.000068427726,0.0032813982,0.00013319898,0.000006842315,0.0000048870716,0.000072292096,0.7870567,0.00037210865,0.20883651,0.0000091274815,0.00009371666],"about_ca_topic_score_codex":0.0000017248132,"about_ca_topic_score_gemma":1.1671071e-8,"teacher_disagreement_score":0.77479947,"about_ca_system_score_codex":0.000008297906,"about_ca_system_score_gemma":0.0000095268115,"threshold_uncertainty_score":0.3437639},"labels":[],"label_agreement":null},{"id":"W2121981260","doi":"10.1090/conm/305/05215","title":"Quantum amplitude amplification and estimation","year":2002,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1436,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Université de Montréal","funders":"","keywords":"Superposition principle; Mathematics; Combinatorics; Inverse; Function (biology); Generalization; Quantum algorithm; Value (mathematics); Boolean function; Quadratic equation; Quantum; Discrete mathematics; Algorithm; Physics; Quantum mechanics; Mathematical analysis; Statistics; Geometry","score_opus":0.025095180594028425,"score_gpt":0.2628989889565328,"score_spread":0.23780380836250437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121981260","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012699341,0.0006332154,0.89691514,0.001272181,0.00009946689,0.00072767586,0.00002800529,0.0012802371,0.09891706],"genre_scores_gemma":[0.0076251733,0.00018315575,0.95027363,0.00052532635,0.00019780314,0.00010810902,0.00003191024,0.00050044025,0.040554453],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970033,0.000114312286,0.00078591064,0.0009225021,0.0006697194,0.00050421595],"domain_scores_gemma":[0.996448,0.00072152494,0.001056367,0.0014110048,0.000060850783,0.0003022962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005528827,0.0006917002,0.0011350543,0.00015299796,0.00018151372,0.00040002263,0.0010494106,0.00027611904,0.00024824828],"category_scores_gemma":[0.00022109189,0.00058231864,0.00033851425,0.00056059286,0.0006044246,0.00015424345,0.0004926304,0.00052333175,0.0003101649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012473464,0.0006469631,0.000007134103,0.0018895237,0.00029522766,0.000014231777,0.0044752853,0.000027246964,0.00003991802,0.4540255,0.5228226,0.015755057],"study_design_scores_gemma":[0.00019803188,0.000087699314,0.000006816519,0.00071604986,0.000031276682,0.000036749927,0.00021205557,0.87303674,0.000008496476,0.103271544,0.021695271,0.0006992532],"about_ca_topic_score_codex":0.00003016963,"about_ca_topic_score_gemma":3.6612113e-7,"teacher_disagreement_score":0.8730095,"about_ca_system_score_codex":0.000055232205,"about_ca_system_score_gemma":0.00007820247,"threshold_uncertainty_score":0.9996628},"labels":[],"label_agreement":null},{"id":"W2122271558","doi":"10.4086/toc.2010.v006a001","title":"","year":2010,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; European Social Fund; Latvijas Universitate; State Education Development Agency Republic of Latvia; Mitacs; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Extension (predicate logic); Mathematics; Product (mathematics); Adversary; Quantum; Discrete mathematics; Computer science; Quantum mechanics","score_opus":0.007055393626629365,"score_gpt":0.22917347887980083,"score_spread":0.22211808525317148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122271558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5139982,0.000019271944,0.48449624,0.0002623118,0.0006515784,0.000082942344,4.083239e-7,0.00033222605,0.00015680154],"genre_scores_gemma":[0.72551686,3.9101099e-7,0.2740263,0.00020829558,0.00022750985,7.3617247e-7,4.836789e-7,0.000013721054,0.0000056757067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971376,0.0003383186,0.00069041026,0.00066084444,0.0004788673,0.0006939791],"domain_scores_gemma":[0.9960885,0.0016647226,0.0004555213,0.0013851218,0.00019949135,0.0002066559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036118496,0.00031318763,0.00047228968,0.00026268145,0.00045427564,0.00014957675,0.0031453322,0.000110306864,0.0000035702685],"category_scores_gemma":[0.00032869092,0.0002777976,0.00021368041,0.0007502226,0.00031263925,0.0003283146,0.0013213091,0.0008975555,0.000002728866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012038226,0.000090920585,0.0009805249,0.000023172835,0.00002372435,0.000012887556,0.0062152715,0.011207742,0.057278156,0.59177226,0.0000032145535,0.3323801],"study_design_scores_gemma":[0.0005455764,0.00015187841,0.020554885,0.00005597787,0.000006118547,0.00018347934,0.00008016779,0.7296237,0.03361008,0.21479584,0.000049111542,0.00034321775],"about_ca_topic_score_codex":0.000015180743,"about_ca_topic_score_gemma":0.0000035647154,"teacher_disagreement_score":0.7184159,"about_ca_system_score_codex":0.0000067461247,"about_ca_system_score_gemma":0.00008644105,"threshold_uncertainty_score":0.9999674},"labels":[],"label_agreement":null},{"id":"W2122410845","doi":"10.1109/pacrim.2011.6032878","title":"On designing a ternary reversible circuit for online testability","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Testability; Ternary operation; Block (permutation group theory); Computer science; Logic synthesis; Design for testing; Logic optimization; Logic gate; Sequential logic; Construct (python library); Logic family; Computer engineering; Theoretical computer science; Algorithm; Arithmetic; Reliability engineering; Mathematics; Programming language; Engineering","score_opus":0.05552056640127584,"score_gpt":0.2488589623704655,"score_spread":0.19333839596918967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122410845","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06565691,0.000012538949,0.9310866,0.00017601947,0.00020678362,0.00018380479,0.0000038057283,0.00026818606,0.0024053394],"genre_scores_gemma":[0.33512858,4.6278532e-7,0.6640323,0.0005303836,0.00005720596,0.0000058404894,0.0000013837807,0.0000072001485,0.00023663978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905115,0.000033272547,0.00014767952,0.0003870546,0.000121390985,0.00025945457],"domain_scores_gemma":[0.9991018,0.00026394383,0.00004768195,0.00045918062,0.000048422975,0.000078955054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002646304,0.000114991664,0.000118692624,0.00006662686,0.00012524967,0.00003718908,0.00063306314,0.000037721737,0.00002408074],"category_scores_gemma":[0.00007768636,0.00009117574,0.00007699251,0.00017134001,0.000024783976,0.000105635685,0.00013931988,0.00011394557,0.000013192376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072720875,0.0017123277,0.0029007988,0.00012948418,0.00006794514,0.00006747364,0.0054257833,0.0013410228,0.003075106,0.2182264,0.0038342946,0.76314664],"study_design_scores_gemma":[0.000545072,0.0009105906,0.0060351267,0.000058877944,0.000005931329,0.000026742226,0.0000261534,0.80947393,0.005337401,0.17638491,0.00085701403,0.00033824163],"about_ca_topic_score_codex":0.000041437423,"about_ca_topic_score_gemma":0.0000037947075,"teacher_disagreement_score":0.8081329,"about_ca_system_score_codex":0.000019628684,"about_ca_system_score_gemma":0.00004172759,"threshold_uncertainty_score":0.37180385},"labels":[],"label_agreement":null},{"id":"W2122594504","doi":"10.1109/newcas.2006.250942","title":"Using Crosspoint Faults in Simplifying Toffoli Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Toffoli gate; Computer science; Redundancy (engineering); Electronic circuit; Benchmark (surveying); Logic gate; Reversible computing; Algorithm; Parallel computing; Computer engineering; Engineering; Electrical engineering; Quantum gate","score_opus":0.017440813692295547,"score_gpt":0.2631132679340829,"score_spread":0.24567245424178735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122594504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3046176,0.00007523909,0.6935648,0.00017438688,0.00020246957,0.000054391807,1.8442478e-7,0.000143905,0.0011670135],"genre_scores_gemma":[0.84803784,8.004735e-7,0.15148586,0.00021165228,0.00018755835,0.0000010063204,7.003032e-7,0.000007179979,0.00006742807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988172,0.000037276786,0.00024280483,0.0003459492,0.0001443289,0.00041242086],"domain_scores_gemma":[0.9994817,0.00008616156,0.000052586063,0.0003111688,0.000023449309,0.000044983488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021749217,0.00013140493,0.000141679,0.00010374495,0.00013347375,0.00015658213,0.0004441261,0.000057424153,0.0000048739325],"category_scores_gemma":[0.000009321475,0.00011145646,0.000052096777,0.0004760769,0.00002530021,0.000154908,0.00027344283,0.00018391028,0.0000054573875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001342399,0.00003114176,0.0019366118,0.0000032660794,0.000001521776,0.000040941646,0.00008032672,0.9590445,0.00021038247,0.01225368,0.00008229225,0.026314002],"study_design_scores_gemma":[0.0002061475,0.0000131962615,0.008127594,0.000024300121,6.658002e-7,0.00003440787,0.000004556355,0.98590153,0.00019846128,0.004873771,0.0004545551,0.00016081885],"about_ca_topic_score_codex":0.0007643149,"about_ca_topic_score_gemma":0.000102026206,"teacher_disagreement_score":0.5434202,"about_ca_system_score_codex":0.000037130274,"about_ca_system_score_gemma":0.000028203553,"threshold_uncertainty_score":0.45450625},"labels":[],"label_agreement":null},{"id":"W2122780600","doi":"10.1145/502090.502097","title":"Quantum lower bounds by polynomials","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":659,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Boolean function; Quantum algorithm; Mathematics; Bounded function; Discrete mathematics; Quantum; Polynomial; Quantum complexity theory; Extension (predicate logic); Function (biology); Combinatorics; Computer science; Quantum mechanics","score_opus":0.010425034580195384,"score_gpt":0.2404386584872687,"score_spread":0.2300136239070733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122780600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9143634,0.00095767074,0.041089933,0.039706938,0.003533971,0.000045970413,0.0000011189097,0.000029011664,0.0002719854],"genre_scores_gemma":[0.97957873,0.000052550033,0.017362416,0.0016835019,0.00070402125,2.5158485e-7,6.127608e-8,0.000009956258,0.0006085008],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895257,0.00008395904,0.0003010666,0.00011151875,0.0003358761,0.00021502558],"domain_scores_gemma":[0.9983372,0.0001254771,0.00033393776,0.0010450098,0.000073520976,0.00008484174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052233675,0.00009823159,0.00016776295,0.000055425866,0.00016337435,0.0001737505,0.0043819244,0.000038781494,0.000011956002],"category_scores_gemma":[0.00034879483,0.000055087683,0.00019173858,0.0002676714,0.000039632705,0.00017555205,0.00085200457,0.00030634302,0.000011557557],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007834798,0.000415811,0.0029344657,0.000011265081,0.00016563224,0.0002626215,0.0013588732,0.0039419164,0.022067724,0.0030204298,0.82448757,0.14125533],"study_design_scores_gemma":[0.0016383528,0.0009090273,0.010898804,0.00024613753,0.00004333776,0.005443011,0.00003791764,0.13095486,0.005583571,0.1344619,0.70919937,0.0005837017],"about_ca_topic_score_codex":0.000009425167,"about_ca_topic_score_gemma":6.9570325e-7,"teacher_disagreement_score":0.14067163,"about_ca_system_score_codex":0.000031361407,"about_ca_system_score_gemma":0.00008179367,"threshold_uncertainty_score":0.8142779},"labels":[],"label_agreement":null},{"id":"W2122844951","doi":"10.1103/physreva.83.050301","title":"No-go theorem for one-way quantum computing on naturally occurring two-level systems","year":2011,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Périmètre de physique théorique; National Natural Science Foundation of China; Industry Canada; University of Technology Sydney; Government of Canada; National Science Foundation","keywords":"Degenerate energy levels; Qubit; Ground state; Quantum computer; Hamiltonian (control theory); Physics; Quantum mechanics; One-way quantum computer; Frustration; Quantum; Theoretical physics; Mathematics; Quantum network; Condensed matter physics","score_opus":0.058278814625221005,"score_gpt":0.3076723379298965,"score_spread":0.2493935233046755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122844951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055550657,0.011311187,0.919648,0.0005169878,0.0027822705,0.0024064167,0.000024120834,0.0008710577,0.0068893083],"genre_scores_gemma":[0.9526851,0.00012687553,0.04403451,0.0020328043,0.000996168,0.00004399406,0.0000036288684,0.00003684023,0.00004007044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780035,0.00017360975,0.0004080654,0.0006716686,0.0003906597,0.00055563013],"domain_scores_gemma":[0.9981152,0.00054789503,0.00025569164,0.00072740595,0.0001899909,0.00016386082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006400132,0.0003207843,0.00064231537,0.00005418589,0.0002298212,0.00011868007,0.0012711864,0.00003314446,0.0000020315063],"category_scores_gemma":[0.00023001742,0.00023719184,0.0003290542,0.00032780756,0.00005031211,0.00014250913,0.00034661547,0.00039242266,0.0001622972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013728525,0.00034321856,0.000015851077,0.0018547676,0.000061469604,0.000010249282,0.0006293578,0.00060365343,0.00023251084,0.86182284,0.00048050348,0.13393185],"study_design_scores_gemma":[0.0003513456,0.00036322803,0.0002901572,0.0055011194,0.000031692754,0.000014823159,0.0000035575051,0.97164124,0.00020347214,0.01698322,0.0041672415,0.00044888482],"about_ca_topic_score_codex":0.00002742447,"about_ca_topic_score_gemma":4.8390336e-7,"teacher_disagreement_score":0.9710376,"about_ca_system_score_codex":0.000034495246,"about_ca_system_score_gemma":0.00004383721,"threshold_uncertainty_score":0.9672403},"labels":[],"label_agreement":null},{"id":"W2123018363","doi":"10.1109/ismvl.2010.58","title":"ESOP-Based Toffoli Network Generation with Transformations","year":2010,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Toffoli gate; Cascade; Computer science; Quantum gate; Algorithm; Logic gate; Set (abstract data type); Quantum circuit; Logic synthesis; Reduction (mathematics); Electronic circuit; Function (biology); Topology (electrical circuits); Arithmetic; Quantum; Mathematics; Quantum computer; Quantum error correction; Engineering; Electrical engineering; Combinatorics","score_opus":0.007201157429423261,"score_gpt":0.20408625043006712,"score_spread":0.19688509300064386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123018363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0576712,0.0000074452505,0.9364979,0.0023941207,0.00034486037,0.00008786313,5.666148e-7,0.00024980088,0.002746219],"genre_scores_gemma":[0.60293,2.555965e-7,0.39620915,0.00054310245,0.00025713298,0.000004859795,0.0000037882094,0.0000038084397,0.00004792771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993537,0.00001821284,0.00010858499,0.0001748714,0.00014789867,0.00019675215],"domain_scores_gemma":[0.9995162,0.00004060087,0.000028313241,0.00030501088,0.000043870026,0.00006599863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013410044,0.00008849196,0.000068945745,0.00003844378,0.00023103219,0.00015753029,0.00030390965,0.000036649777,0.000024408675],"category_scores_gemma":[0.000004035549,0.000060092818,0.000030021607,0.00027784004,0.000022800561,0.00016604461,0.000018513176,0.0001744798,0.000016922919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038607627,0.00007719443,0.00027758794,0.000007479458,0.000014427868,0.0000096356025,0.0005095761,0.57467955,0.0029344931,0.19793567,0.0037382483,0.21981226],"study_design_scores_gemma":[0.00018328549,0.000059719172,0.00032536554,0.0000035757043,0.0000020232449,0.000020966003,0.000001037531,0.990978,0.0018051461,0.00076766824,0.0057440954,0.000109107306],"about_ca_topic_score_codex":0.000012155704,"about_ca_topic_score_gemma":0.0001078198,"teacher_disagreement_score":0.54525876,"about_ca_system_score_codex":0.0000035431226,"about_ca_system_score_gemma":0.00006559034,"threshold_uncertainty_score":0.2450514},"labels":[],"label_agreement":null},{"id":"W2123063952","doi":"10.1109/vlsi.design.2009.40","title":"Reversible Logic Synthesis with Output Permutation","year":2009,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Permutation (music); Realization (probability); Computer science; Logic synthesis; Heuristic; Toffoli gate; Algorithm; Modulo; Function (biology); Boolean function; Logic gate; Mathematics; Discrete mathematics","score_opus":0.011632354422811955,"score_gpt":0.21978421486408228,"score_spread":0.20815186044127032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123063952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027118782,0.000027892023,0.95299107,0.008740481,0.00006158946,0.00006650726,2.779735e-7,0.0003429836,0.010650391],"genre_scores_gemma":[0.73336726,0.0000015796193,0.26466823,0.0013908115,0.00003749517,0.000001123332,3.3070233e-7,0.0000024769777,0.00053065974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992884,0.000027173104,0.00008233538,0.00025402894,0.00016776992,0.00018033413],"domain_scores_gemma":[0.99953914,0.00006539795,0.000035246994,0.0002684152,0.00003795557,0.000053867076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010614849,0.00009144723,0.00009209018,0.00006823432,0.000112997324,0.00010335621,0.00036315343,0.000026026084,0.0000102622635],"category_scores_gemma":[0.0000188247,0.000060121904,0.000030273599,0.00026915316,0.000014387304,0.00015092823,0.000035774232,0.00007544242,0.0000406321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010131593,0.000110584995,0.00012851541,0.00000868871,0.000015515283,0.000077740115,0.0008109325,0.018668845,0.00034119937,0.11114173,0.0029651641,0.8657209],"study_design_scores_gemma":[0.00023054244,0.00045310843,0.008379361,0.00004666829,0.000008503265,0.00012782551,0.000037792284,0.9635648,0.0026260507,0.021917494,0.0022745368,0.00033329552],"about_ca_topic_score_codex":0.000008211512,"about_ca_topic_score_gemma":0.0000010235315,"teacher_disagreement_score":0.944896,"about_ca_system_score_codex":0.000012884504,"about_ca_system_score_gemma":0.000027574679,"threshold_uncertainty_score":0.24517001},"labels":[],"label_agreement":null},{"id":"W2124269824","doi":"10.1007/11766247_37","title":"Machine Learning in a Quantum World","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":164,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Intuition; Computer science; Quantum; Artificial intelligence; Quantum machine learning; Quantum computer; Quantum mechanics; Cognitive science; Physics; Psychology","score_opus":0.010798071406027142,"score_gpt":0.22809096435578702,"score_spread":0.21729289294975987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124269824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029453522,0.0012753244,0.9898887,0.001214722,0.0014941738,0.00032082232,0.000003779485,0.00038010426,0.0051277964],"genre_scores_gemma":[0.46158397,0.000070027345,0.5303116,0.0022157354,0.0015049542,0.000016921125,0.00002625381,0.00015530571,0.0041152486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948175,0.00008539984,0.00079351495,0.0020630334,0.0011151683,0.0011253859],"domain_scores_gemma":[0.9974547,0.000642215,0.00036488523,0.0012352808,0.00012298621,0.00017990061],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012425826,0.0007688115,0.0007925756,0.0024907656,0.0003210283,0.00064802705,0.0036850024,0.0002846058,0.00001662485],"category_scores_gemma":[0.00008039361,0.0007023579,0.00019074025,0.0017729872,0.00050850486,0.00035819458,0.0018831496,0.0025717353,0.000043303055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034237216,0.000032534583,0.00030555847,0.000026556701,0.0000042307065,0.00029577693,0.00027554942,0.5739992,0.000022735097,0.010642395,0.000024190314,0.41436782],"study_design_scores_gemma":[0.00030785444,0.0001242348,0.00038183344,0.00050148985,0.0000030302338,0.00007874658,3.7887887e-8,0.8954051,0.00008384297,0.09659222,0.005794359,0.0007272252],"about_ca_topic_score_codex":0.00026898432,"about_ca_topic_score_gemma":0.0008204061,"teacher_disagreement_score":0.46128944,"about_ca_system_score_codex":0.0003290743,"about_ca_system_score_gemma":0.00048405043,"threshold_uncertainty_score":0.9997294},"labels":[],"label_agreement":null},{"id":"W2124651213","doi":"10.1007/978-3-540-31856-9_50","title":"Quantum Interactive Proofs with Competing Provers","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematical proof; Disjoint sets; Quantum; Quantum computer; Quantum algorithm; TRACE (psycholinguistics); Gas meter prover; Quantum information","score_opus":0.008653341012039715,"score_gpt":0.22946625398409354,"score_spread":0.22081291297205383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124651213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005860974,0.0002614765,0.99106985,0.0015749893,0.0012389984,0.00065945426,0.0000050856547,0.00041061765,0.004193442],"genre_scores_gemma":[0.23846383,0.000016587812,0.7580307,0.0016766983,0.0012987821,0.000016506629,0.000006688224,0.0000955632,0.00039465324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945751,0.00005903616,0.00062538235,0.0023032017,0.0013512091,0.0010860852],"domain_scores_gemma":[0.99662113,0.0006757811,0.0005584961,0.0015405868,0.0003373914,0.0002665858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008119574,0.0008895217,0.0007759804,0.00096270494,0.0004551697,0.0008953162,0.0038662592,0.00028503212,0.000016985932],"category_scores_gemma":[0.000075650925,0.00069747405,0.0001648955,0.00080328964,0.00085888384,0.0007394579,0.0017288614,0.0018990729,0.000046446512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001927073,0.000051173232,0.00003232197,0.000045252476,0.000027698758,0.00020252039,0.001902843,0.16150577,0.000051403997,0.011855327,0.000011680911,0.82429475],"study_design_scores_gemma":[0.00042650083,0.00051668606,0.00007041184,0.0011306677,0.000010370406,0.00033463654,6.720541e-7,0.96585023,0.0005612382,0.027076408,0.0030113456,0.0010108004],"about_ca_topic_score_codex":0.000025367408,"about_ca_topic_score_gemma":0.00007478565,"teacher_disagreement_score":0.8232839,"about_ca_system_score_codex":0.00042457163,"about_ca_system_score_gemma":0.00086951366,"threshold_uncertainty_score":0.99954766},"labels":[],"label_agreement":null},{"id":"W2125125126","doi":"10.1109/tcad.2007.911334","title":"Quantum Circuit Simplification and Level Compaction","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":257,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of New Brunswick; University of Waterloo","funders":"","keywords":"Toffoli gate; Quantum gate; Quantum circuit; Computer science; Quantum algorithm; Electronic circuit; Quantum computer; Heuristic; Quantum; Heuristics; Controlled NOT gate; Algorithm; Quantum Fourier transform; Quantum error correction; Theoretical computer science; Topology (electrical circuits); Mathematics; Physics; Quantum mechanics","score_opus":0.07469204808052234,"score_gpt":0.24353887815716968,"score_spread":0.16884683007664736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125125126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0757736,0.00024746652,0.9219114,0.0000736836,0.0011973561,0.00047477699,0.000032882133,0.00025765397,0.000031150736],"genre_scores_gemma":[0.9935659,0.00013953203,0.0060324324,0.00006683385,0.000085492975,0.000022849825,0.0000039958504,0.000025324156,0.00005761455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747354,0.0003671115,0.0006938385,0.0007015792,0.0004034561,0.00036049137],"domain_scores_gemma":[0.9982039,0.0004529375,0.00029824732,0.0005385417,0.0002958575,0.00021054456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048117625,0.00037325767,0.0005566324,0.00045806717,0.0005338866,0.0001948324,0.00041887639,0.00019098962,0.0000026541518],"category_scores_gemma":[0.0000074122263,0.00032149465,0.00009867267,0.0006220472,0.00017024916,0.00031993721,0.0000054546426,0.00044668597,0.000007179349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049679213,0.0006470884,0.00007604151,0.0002478238,0.0003256846,0.000068186935,0.004079896,0.49380887,0.030633237,0.010125541,0.00059679605,0.45934117],"study_design_scores_gemma":[0.0006411405,0.00067382684,0.00083476194,0.00023820417,0.00002042163,0.00092868163,0.00007571053,0.99247545,0.0032616297,0.00037962012,0.000120066376,0.00035046297],"about_ca_topic_score_codex":0.0003362738,"about_ca_topic_score_gemma":0.0000025041913,"teacher_disagreement_score":0.9177923,"about_ca_system_score_codex":0.000069177244,"about_ca_system_score_gemma":0.0001446602,"threshold_uncertainty_score":0.9999237},"labels":[],"label_agreement":null},{"id":"W2125182723","doi":"10.4204/eptcs.195.3","title":"Quantum Alternation: Prospects and Problems","year":2015,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Chinese Academy of Sciences","keywords":"Denotational semantics; Statement (logic); Quantum; Semantics (computer science); Computer science; Mathematics; Quantum algorithm; Programming language; Algebra over a field; Discrete mathematics; Theoretical computer science; Operational semantics; Pure mathematics; Quantum mechanics; Physics; Linguistics; Philosophy","score_opus":0.007612402115275471,"score_gpt":0.23058627530713172,"score_spread":0.22297387319185624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125182723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41489166,0.00034102093,0.57860756,0.0030305723,0.00044126707,0.00036455007,2.0932076e-7,0.00034558837,0.001977546],"genre_scores_gemma":[0.9576363,0.000012301285,0.041871235,0.00027958362,0.0001688923,0.00001505678,1.6934784e-7,0.0000102852855,0.0000061847036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680847,0.000023174409,0.0003024462,0.0010000714,0.0008036766,0.0010621734],"domain_scores_gemma":[0.9989719,0.000063089465,0.00009410515,0.00026580226,0.00026115542,0.0003439521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024598625,0.0002325048,0.00023021028,0.00033174007,0.00023160159,0.0007564992,0.001906934,0.000058647078,0.000001463691],"category_scores_gemma":[0.00015611545,0.00019253034,0.000029841769,0.0017547283,0.0011002494,0.0008486871,0.0011335772,0.0005038243,0.000009134086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043273653,0.000045055025,0.00037041114,0.0000106519,0.0000020786863,0.000005438448,0.001276558,0.00032111595,0.0001465785,0.9801153,0.000023675757,0.017678825],"study_design_scores_gemma":[0.00027984005,0.00035003264,0.00038187226,0.000035281562,9.285109e-7,0.00014302686,0.000006259727,0.5889209,0.000551502,0.40899593,0.0001684817,0.00016597057],"about_ca_topic_score_codex":0.0000051364154,"about_ca_topic_score_gemma":0.0000010274047,"teacher_disagreement_score":0.58859974,"about_ca_system_score_codex":0.0002143223,"about_ca_system_score_gemma":0.00035666933,"threshold_uncertainty_score":0.7851159},"labels":[],"label_agreement":null},{"id":"W2125457426","doi":"10.1007/s00220-015-2470-1","title":"Decoupling with Random Quantum Circuits","year":2015,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Decoupling (probability); Electronic circuit; Randomness; Unitary state; Qubit; Mathematics; Quantum; Quantum circuit; Topology (electrical circuits); Discrete mathematics; Computer science; Quantum mechanics; Quantum error correction; Physics; Combinatorics; Law","score_opus":0.06120226985530414,"score_gpt":0.30450905195292244,"score_spread":0.2433067820976183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125457426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012847078,0.00017380388,0.98150986,0.00088211097,0.000054941564,0.00017404054,6.221687e-7,0.00016301718,0.0041945283],"genre_scores_gemma":[0.7277481,0.000008179232,0.27205217,0.00009386195,0.00004285099,0.000025691857,0.0000025037482,0.000012240859,0.000014377753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989493,0.00010300846,0.00026270456,0.00020971334,0.0002465729,0.00022870836],"domain_scores_gemma":[0.9969283,0.000604353,0.00008283129,0.002104912,0.00017006151,0.00010955858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327623,0.00013247806,0.00022986556,0.00005276384,0.00012520689,0.00011715762,0.0020705115,0.000037277216,0.000001039419],"category_scores_gemma":[0.00023638294,0.000103745384,0.000040741623,0.0005950471,0.00014295954,0.0001940367,0.0006530772,0.00032795017,0.0000627718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037730022,0.0004336894,0.00014945923,0.000026653262,0.0000150668775,0.000003911833,0.0027891942,0.014434147,0.00001432125,0.9466095,0.00016157822,0.035358716],"study_design_scores_gemma":[0.0004591408,0.000025631938,0.000037367096,0.000071301205,0.000002963683,0.0000065533322,0.00004328717,0.63024837,0.000024918105,0.3687493,0.00023079226,0.00010039788],"about_ca_topic_score_codex":0.000004303005,"about_ca_topic_score_gemma":0.0000026518915,"teacher_disagreement_score":0.71490103,"about_ca_system_score_codex":0.00004030554,"about_ca_system_score_gemma":0.00009984896,"threshold_uncertainty_score":0.4230614},"labels":[],"label_agreement":null},{"id":"W2126323053","doi":"10.1016/j.jcss.2005.06.006","title":"Polynomial degree vs. quantum query complexity","year":2005,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Mathematics; Upper and lower bounds; Quantum complexity theory; Polynomial; Function (biology); Quantum; Degree of a polynomial; Combinatorics; Time complexity; Structural complexity theory; Discrete mathematics; Quantum algorithm; Computational complexity theory; Complexity class; Algorithm; Physics; Quantum mechanics","score_opus":0.03660138892514958,"score_gpt":0.2591070153224866,"score_spread":0.222505626397337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126323053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39870718,0.00082390447,0.59466165,0.0031240694,0.0019283111,0.000073813346,0.0000012160066,0.00007336736,0.00060650543],"genre_scores_gemma":[0.8208042,0.00000891589,0.17756444,0.00026137635,0.0013461763,3.0223208e-7,6.357315e-8,0.0000038377134,0.000010711198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789846,0.00018579724,0.0006450201,0.00030663557,0.0006194355,0.00034467023],"domain_scores_gemma":[0.9987722,0.00018926708,0.00046354003,0.0002178156,0.00014398135,0.00021319764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016809625,0.0001822158,0.00042096,0.00028767769,0.0004488853,0.0005830972,0.0013492113,0.00005137649,0.0000016666705],"category_scores_gemma":[0.000009937451,0.00012339973,0.0001438152,0.000386069,0.0002770592,0.00066164514,0.000315333,0.00023828637,0.000007281775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006252894,0.00026350844,0.0041507883,0.00019931118,0.000121425954,0.00024500495,0.0050475327,0.029163491,0.0003071801,0.0859139,0.024998039,0.8495273],"study_design_scores_gemma":[0.00042644577,0.00059509114,0.008733502,0.00018581495,0.0000068444297,0.0026464635,0.000070855385,0.98113745,0.00007778051,0.00029687697,0.0056267874,0.00019611153],"about_ca_topic_score_codex":0.000019371897,"about_ca_topic_score_gemma":0.0000046734745,"teacher_disagreement_score":0.9519739,"about_ca_system_score_codex":0.00004093014,"about_ca_system_score_gemma":0.00016978069,"threshold_uncertainty_score":0.56228197},"labels":[],"label_agreement":null},{"id":"W2126911753","doi":"10.1088/1367-2630/15/5/055023","title":"Self-correcting quantum computers","year":2013,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Physics; Quantum; Constructive; Social connectedness; Hamiltonian (control theory); Topology (electrical circuits); Theoretical physics; Quantum mechanics; Computer science","score_opus":0.010116411090630452,"score_gpt":0.22380281061304375,"score_spread":0.2136863995224133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126911753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10433423,0.00010702,0.8922913,0.0011556878,0.0018195368,0.00005616302,1.0701408e-7,0.00008317216,0.00015279293],"genre_scores_gemma":[0.5975732,0.000006852669,0.400202,0.00039629993,0.0017801218,2.9078006e-7,1.3049811e-7,0.000012649087,0.000028449025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988597,0.00005655439,0.00033381887,0.00015380558,0.0003352375,0.0002608776],"domain_scores_gemma":[0.998813,0.00017119163,0.0003899145,0.0002379054,0.00019293374,0.00019506513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018277264,0.00014027495,0.00023031166,0.00006571132,0.000108664455,0.0002490671,0.0008980458,0.00003418912,0.0000048625643],"category_scores_gemma":[0.000020427551,0.00011146323,0.00015994483,0.0003212514,0.00001519796,0.00053375866,0.00016570694,0.0003893328,0.000044460197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015686037,0.00009272396,0.0001779052,0.000014457641,0.000056386172,0.000023506245,0.0021912667,0.012230009,0.00045241363,0.0074746455,0.0115451645,0.96573997],"study_design_scores_gemma":[0.00046410997,0.00026458097,0.0007225186,0.00008549318,0.000010029479,0.00038359012,0.000035444613,0.95411134,0.001737155,0.039069105,0.0029186686,0.00019796833],"about_ca_topic_score_codex":0.0000291017,"about_ca_topic_score_gemma":2.1447752e-7,"teacher_disagreement_score":0.96554196,"about_ca_system_score_codex":0.000029841332,"about_ca_system_score_gemma":0.00015082351,"threshold_uncertainty_score":0.45453387},"labels":[],"label_agreement":null},{"id":"W2127365098","doi":"10.1016/j.laa.2004.11.010","title":"A quantum computing primer for operator theorists","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Perimeter Institute; University of Waterloo","funders":"","keywords":"Quantum computer; Quantum error correction; Quantum operation; Mathematics; Quantum information; Quantum algorithm; Operator (biology); Quantum; Quantum capacity; Quantum channel; Computation; Algebra over a field; Algorithm; Quantum network; Discrete mathematics; Pure mathematics; Open quantum system; Quantum mechanics; Physics","score_opus":0.010540983478061528,"score_gpt":0.2621782782388225,"score_spread":0.25163729476076097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127365098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09891407,0.00045683063,0.89772886,0.001999327,0.0000843261,0.000529317,0.000009626399,0.00020118881,0.0000764512],"genre_scores_gemma":[0.83710045,0.00001652096,0.16181968,0.0005651172,0.00035106207,0.00008000521,0.000009284566,0.000015258767,0.00004259267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903977,0.000014973644,0.00019514252,0.0004025321,0.000101973295,0.0002455844],"domain_scores_gemma":[0.99931,0.00011457876,0.00006280096,0.00031126212,0.00009107197,0.00011028971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015750263,0.0001357608,0.000140615,0.00005414405,0.00043358433,0.00011225443,0.00041619607,0.00005210763,0.0000014348135],"category_scores_gemma":[0.000018985696,0.00011508105,0.000053455504,0.00026919204,0.00003288656,0.00009766807,0.00016532138,0.000118430464,0.00002555606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018736916,0.000070479204,0.000011307161,0.000023977198,0.000014434799,5.777996e-7,0.0005395614,0.0012740231,0.0013305955,0.9578026,0.000047526035,0.03888307],"study_design_scores_gemma":[0.00074975553,0.00011805494,0.00031838057,0.000032036274,0.000011905299,0.00003437839,0.000024592624,0.8852464,0.0049013216,0.08032287,0.027920492,0.00031984455],"about_ca_topic_score_codex":0.0000060474376,"about_ca_topic_score_gemma":6.832766e-7,"teacher_disagreement_score":0.88397235,"about_ca_system_score_codex":0.000011760204,"about_ca_system_score_gemma":0.000064805485,"threshold_uncertainty_score":0.4692869},"labels":[],"label_agreement":null},{"id":"W2127608358","doi":"10.5555/1070432.1070590","title":"Coins make quantum walks faster","year":2005,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":259,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Random walk; Mathematics; Quantum; Discrete mathematics; Binary logarithm; Discrete time and continuous time; Quantum algorithm; Task (project management); Degrees of freedom (physics and chemistry); Spacetime; Space (punctuation); Running time; Computer science; Combinatorics; Algorithm; Statistics; Quantum mechanics; Physics","score_opus":0.009974880592601569,"score_gpt":0.22900614638554537,"score_spread":0.2190312657929438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127608358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081554666,0.000069608985,0.8942623,0.009791034,0.00042097238,0.00008002425,9.997747e-7,0.0005361331,0.013284263],"genre_scores_gemma":[0.8510843,0.0000028874347,0.14391221,0.0023432348,0.0003393152,0.0000024889014,8.1467675e-7,0.000009757794,0.0023049763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988758,0.000043517717,0.00017691414,0.0003460864,0.00021775563,0.00033990646],"domain_scores_gemma":[0.9992482,0.00006618351,0.00003912189,0.0005061437,0.000032876087,0.00010749277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017962164,0.00013646967,0.00012464426,0.00007576441,0.00015263484,0.0001624052,0.00072994514,0.000044058692,0.000058346057],"category_scores_gemma":[0.000011189619,0.00010339307,0.000071468596,0.00021270703,0.000027618793,0.00013430165,0.00029667642,0.00020967964,0.00039876506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002169265,0.00012477284,0.000114769166,0.000006771686,0.000015454902,0.000023231563,0.0010769569,0.00586664,0.00045833827,0.14062065,0.0053899707,0.8463003],"study_design_scores_gemma":[0.00017017468,0.00005811235,0.0007276089,0.000007730614,0.0000013236582,0.00005366325,0.00000922954,0.88156265,0.00051494455,0.0017627792,0.11496671,0.00016508174],"about_ca_topic_score_codex":0.000013081313,"about_ca_topic_score_gemma":0.000021137443,"teacher_disagreement_score":0.875696,"about_ca_system_score_codex":0.000015673246,"about_ca_system_score_gemma":0.000030743886,"threshold_uncertainty_score":0.5125451},"labels":[],"label_agreement":null},{"id":"W2129072643","doi":"10.5555/1266366.1266485","title":"Reversible circuit technology mapping from non-reversible specifications","year":2007,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Construct (python library); Embedding; Computer science; Permutation (music); Implementation; Reversible computing; Electronic circuit; Logic gate; Theoretical computer science; Computer engineering; Algorithm; Engineering; Electrical engineering; Programming language; Artificial intelligence","score_opus":0.029655319356340575,"score_gpt":0.2330331639399194,"score_spread":0.20337784458357883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129072643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041306276,0.00008353736,0.9357753,0.002725407,0.00046605934,0.00010971061,0.0000022115657,0.00052384165,0.019007655],"genre_scores_gemma":[0.50178534,0.000007758102,0.49611542,0.00038106367,0.00020051148,0.000002035004,0.0000041816033,0.000010027548,0.0014937085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860626,0.000012572191,0.0002476972,0.0005065001,0.00019858866,0.0004283512],"domain_scores_gemma":[0.99878174,0.00013454504,0.00008338656,0.00082266936,0.00007331925,0.000104353836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031340856,0.00014294183,0.00015918865,0.0004412934,0.0002719544,0.000091462294,0.0012151535,0.00011512617,0.00007450215],"category_scores_gemma":[0.000025983047,0.00013596028,0.0000678647,0.0014887406,0.000060795002,0.00016881694,0.0003661934,0.00026855365,0.0003226786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005527197,0.00031616897,0.0065146447,0.000025165542,0.00013429632,0.00021048369,0.003442541,0.0016911291,0.054665644,0.32356948,0.023077725,0.5863472],"study_design_scores_gemma":[0.001457468,0.0001788213,0.03662638,0.00018402039,0.000020750895,0.0001315798,0.001280473,0.44977498,0.052100364,0.19572331,0.26100907,0.0015127603],"about_ca_topic_score_codex":0.00010137883,"about_ca_topic_score_gemma":0.000016572832,"teacher_disagreement_score":0.58483446,"about_ca_system_score_codex":0.000049543665,"about_ca_system_score_gemma":0.000054982655,"threshold_uncertainty_score":0.55442995},"labels":[],"label_agreement":null},{"id":"W2129256373","doi":"10.1088/1367-2630/11/8/083032","title":"Architectural design for a topological cluster state quantum computer","year":2009,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum computer; Modular design; Cluster state; Qubit; Quantum information; Simple (philosophy); Topology (electrical circuits); Computation; Quantum; Block (permutation group theory)","score_opus":0.025945396696996192,"score_gpt":0.2672500015899299,"score_spread":0.2413046048929337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129256373","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041287802,0.00007017398,0.9532678,0.0045890277,0.00059433264,0.00013579868,0.0000010000875,0.00004363935,0.000010397352],"genre_scores_gemma":[0.3431957,0.0000031398347,0.6536336,0.0014994527,0.0016244195,3.899197e-7,3.3330633e-7,0.00000744964,0.00003550629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998662,0.00010654234,0.00038459912,0.00020724715,0.00029107393,0.00034854346],"domain_scores_gemma":[0.998814,0.00031998675,0.00031108176,0.00022302328,0.00014495231,0.000186963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035456367,0.0001810961,0.00031630704,0.00006721866,0.000111284724,0.00016199604,0.00082609593,0.000042054922,0.0000013560858],"category_scores_gemma":[0.000024436804,0.00012619291,0.0002503376,0.00018927988,0.00003340225,0.00020230215,0.00008138981,0.00033770697,0.0000032136086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068206915,0.00008030391,0.0000043517907,0.00000445974,0.00002390919,0.000022291273,0.0008211242,0.17998967,0.0003799799,0.009058189,0.0038559318,0.8056916],"study_design_scores_gemma":[0.0008835691,0.0019182073,0.00047639053,0.00003659656,0.00000830349,0.00026961803,0.0000021804728,0.7023495,0.0010562761,0.29184848,0.0009970448,0.00015383807],"about_ca_topic_score_codex":0.0000020097514,"about_ca_topic_score_gemma":1.9966242e-7,"teacher_disagreement_score":0.80553776,"about_ca_system_score_codex":0.000023874198,"about_ca_system_score_gemma":0.00013917069,"threshold_uncertainty_score":0.51459974},"labels":[],"label_agreement":null},{"id":"W2129547505","doi":"","title":"An Extension of the Deutsch-Jozsa Algorithm to Arbitrary Qudits","year":2007,"lang":"de","type":"article","venue":"University Library - University of Saskatchewan (University of Saskatchewan)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Extension (predicate logic); Algorithm; Computer science; Discrete mathematics; Algebra over a field; Mathematics; Theoretical computer science; Combinatorics; Pure mathematics","score_opus":0.006320633908556556,"score_gpt":0.17567202276789845,"score_spread":0.1693513888593419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129547505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8177243,0.0003508759,0.1759784,0.0023014017,0.0011260232,0.00083542505,0.00082000036,0.00030813515,0.00055545],"genre_scores_gemma":[0.821712,0.0001388925,0.17222328,0.00020777975,0.00018222624,6.7224963e-9,0.00006600919,0.000054634347,0.005415125],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9943358,0.0006880053,0.0006099428,0.0017327354,0.0013854431,0.0012480832],"domain_scores_gemma":[0.99383676,0.00045785028,0.001411259,0.002566637,0.000580457,0.0011470544],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008818755,0.00085411477,0.0014535722,0.0013363203,0.0014223488,0.00005834141,0.007038369,0.00077972293,0.00035667405],"category_scores_gemma":[0.00001842857,0.0010704375,0.0011323435,0.00390577,0.002045911,0.0028373615,0.004150072,0.0012291612,0.00006487681],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029055865,0.0033803177,0.0069358395,0.00091335207,0.0016871489,0.0028957585,0.77448696,0.006528494,0.012615313,0.0005824824,0.003359193,0.18370956],"study_design_scores_gemma":[0.0046857647,0.0020428349,0.044369206,0.0015334246,0.0009814634,0.000052166226,0.8814102,0.031067241,0.008913838,0.00076118595,0.022116238,0.00206645],"about_ca_topic_score_codex":0.01912063,"about_ca_topic_score_gemma":0.0040167775,"teacher_disagreement_score":0.18164311,"about_ca_system_score_codex":0.00023609943,"about_ca_system_score_gemma":0.0022462031,"threshold_uncertainty_score":0.9998777},"labels":[],"label_agreement":null},{"id":"W2130070545","doi":"10.1109/tcad.2004.836735","title":"Reversible Cascades With Minimal Garbage","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":214,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Victoria","funders":"","keywords":"Garbage; Heuristics; Benchmark (surveying); Computer science; Function (biology); Garbage collection; Parallel computing; Algorithm; Programming language","score_opus":0.02111487469034606,"score_gpt":0.21679834585296465,"score_spread":0.19568347116261858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130070545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042167243,0.0001987885,0.9559846,0.000101495134,0.00077228475,0.00043766433,0.000017940016,0.00024960787,0.000070391434],"genre_scores_gemma":[0.95063555,0.000027233442,0.049072064,0.00007654059,0.000064828244,0.000018893494,0.0000012943179,0.00002482327,0.00007877708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978495,0.00019784803,0.0005025555,0.0006464408,0.00040612163,0.00039753102],"domain_scores_gemma":[0.9986145,0.00023951913,0.00020685166,0.0005238839,0.00022812598,0.000187124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038350705,0.00036523188,0.0005094605,0.00037851714,0.0002827362,0.00025934618,0.0005710452,0.0001471424,0.000002955992],"category_scores_gemma":[0.0000029782323,0.00027019475,0.00010145176,0.0007433715,0.00012652627,0.00025932371,0.000004918604,0.00041714974,0.0000076864235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039773495,0.00027002662,0.0000054386987,0.0001043727,0.00017488824,0.00011552252,0.001262837,0.93499607,0.004832025,0.0020432372,0.0000923536,0.056063477],"study_design_scores_gemma":[0.0018197709,0.002808477,0.00005878082,0.0011264032,0.00004272702,0.00096439297,0.00016116665,0.9687393,0.023330858,0.00024322396,0.00015826164,0.00054666627],"about_ca_topic_score_codex":0.00036094815,"about_ca_topic_score_gemma":0.000006875265,"teacher_disagreement_score":0.9084683,"about_ca_system_score_codex":0.000082955645,"about_ca_system_score_gemma":0.00023917817,"threshold_uncertainty_score":0.999975},"labels":[],"label_agreement":null},{"id":"W2130358697","doi":"10.1109/mwscas.2005.1594096","title":"Adiabatic implementation of reversible logic","year":2005,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Adiabatic circuit; Logic gate; NAND gate; Reversible computing; Pass transistor logic; Electronic circuit; CMOS; AND-OR-Invert; Adiabatic process; Computer science; Logic family; Capacitor; Pull-up resistor; Electronic engineering; Quantum computer; Electrical engineering; Voltage; Logic synthesis; Quantum; Physics; Engineering; Digital electronics; Quantum mechanics","score_opus":0.011713275184771646,"score_gpt":0.27053814927638664,"score_spread":0.258824874091615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130358697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15352643,0.000066770874,0.83818686,0.004668145,0.00011203179,0.00009024498,8.429531e-7,0.000120112985,0.003228574],"genre_scores_gemma":[0.69881153,0.0000020393495,0.300544,0.00047143298,0.000037697195,7.534985e-7,5.2376396e-7,0.0000015681069,0.00013043157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995262,0.000016970336,0.00012222143,0.0001203903,0.0001021579,0.00011205345],"domain_scores_gemma":[0.99969167,0.000029026318,0.00004707457,0.00017970818,0.000024263492,0.000028249478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010748722,0.000046010206,0.00006403191,0.00005386255,0.00003436609,0.000018028913,0.0002705309,0.000012545516,0.00007954023],"category_scores_gemma":[0.0000036465033,0.000036728794,0.00002998018,0.0001759975,0.000010226543,0.000112739755,0.00008378474,0.00003549352,0.000027546621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.3258364e-7,0.00003809928,0.00053215615,0.000014342316,0.00001145651,0.0000015504088,0.00097649556,0.0053218184,0.0012772572,0.11779704,0.0035376626,0.8704915],"study_design_scores_gemma":[0.0005303427,0.00020194621,0.0062772264,0.000015178689,0.000005359489,0.000017222666,0.00012074619,0.9444667,0.026960742,0.012113104,0.009091996,0.0001994464],"about_ca_topic_score_codex":0.000035517223,"about_ca_topic_score_gemma":0.000011996072,"teacher_disagreement_score":0.93914485,"about_ca_system_score_codex":0.000009462996,"about_ca_system_score_gemma":0.000024742269,"threshold_uncertainty_score":0.14977567},"labels":[],"label_agreement":null},{"id":"W2130472873","doi":"10.1139/p07-084","title":"The dynamics of entanglement in the adiabatic search and Deutsch algorithms","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quantum entanglement; Adiabatic process; Formalism (music); Adiabatic quantum computation; Quantum computer; Squashed entanglement; Computation; Fidelity; Quantum algorithm","score_opus":0.010457350947176744,"score_gpt":0.23635698835549035,"score_spread":0.2258996374083136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130472873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61841285,0.00065583043,0.37768483,0.0026717742,0.00032294306,0.00010304793,0.000004746971,0.0000022976346,0.00014164115],"genre_scores_gemma":[0.9938225,0.000011983078,0.0058974056,0.00014487366,0.00011091734,2.3463032e-7,3.403234e-7,0.00000410465,0.000007631554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990823,0.00007368035,0.00025301593,0.00007564164,0.00023442214,0.00028088613],"domain_scores_gemma":[0.99911195,0.00034731283,0.00010025999,0.00018873691,0.00009453957,0.0001571856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001419791,0.00007055397,0.00010631611,0.00008322542,0.00016854444,0.00009871996,0.00073982857,0.000019694477,6.608869e-7],"category_scores_gemma":[0.000028885364,0.000041362724,0.00004612295,0.00035545797,0.00010855374,0.000072272094,0.00003363978,0.00029321027,3.5664806e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028350398,0.000023632503,0.0024389736,0.000013424222,0.000028403281,0.0001545212,0.007788763,0.004263081,0.000019986446,0.16605785,0.00014225689,0.8190663],"study_design_scores_gemma":[0.00054213376,0.00038108134,0.024461163,0.00012227449,0.000013795931,0.00030318124,0.0016661069,0.9150061,0.00032696407,0.05615079,0.0008443283,0.00018207598],"about_ca_topic_score_codex":0.0011136192,"about_ca_topic_score_gemma":0.012559073,"teacher_disagreement_score":0.910743,"about_ca_system_score_codex":0.00006871114,"about_ca_system_score_gemma":0.00039162894,"threshold_uncertainty_score":0.70082575},"labels":[],"label_agreement":null},{"id":"W2130552983","doi":"10.1109/ccc.2013.24","title":"Two-Message Quantum Interactive Proofs and the Quantum Separability Problem","year":2013,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dello Sviluppo Economico; Fonds Québécois de la Recherche sur la Nature et les Technologies; Office of Naval Research; Industry Canada; Canada Research Chairs; Institut Périmètre de physique théorique; Canadian Institute for Advanced Research","keywords":"Quantum; Mathematical proof; Quantum algorithm; Quantum state; Quantum circuit; State (computer science); Quantum operation; Quantum information; Quantum computer","score_opus":0.0065068624909172266,"score_gpt":0.23522468844062908,"score_spread":0.22871782594971185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130552983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5095221,0.0003194352,0.4496662,0.023243211,0.0005786817,0.0020373054,0.000002257978,0.0007111675,0.013919669],"genre_scores_gemma":[0.96947485,0.000004562871,0.029368825,0.0006900749,0.00007811909,0.000091535556,7.122343e-7,0.000011222809,0.00028007882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980559,0.00031813682,0.00032649047,0.0006128891,0.00026915473,0.00041746753],"domain_scores_gemma":[0.9982536,0.00063476927,0.00013098885,0.000725766,0.0001290693,0.00012584035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007335131,0.00024079575,0.00028586757,0.00005987143,0.0003105473,0.0005638285,0.00090160687,0.000047443977,0.000042453565],"category_scores_gemma":[0.000073001625,0.00012803088,0.00009717291,0.0002992924,0.0003083021,0.00052442274,0.000760098,0.00040368715,0.00008372763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048833546,0.00018118472,0.00046497895,0.000051611038,0.0000719531,0.000008432711,0.006256069,0.00082045665,0.00022029613,0.8596582,0.0019538917,0.13026409],"study_design_scores_gemma":[0.00075902406,0.000073874995,0.0020201714,0.000022319708,0.000004178519,0.000044159973,0.00009608385,0.77373624,0.00016802913,0.2224504,0.00045107995,0.00017444332],"about_ca_topic_score_codex":0.0007013399,"about_ca_topic_score_gemma":0.000019246498,"teacher_disagreement_score":0.7729158,"about_ca_system_score_codex":0.000022488577,"about_ca_system_score_gemma":0.000052040596,"threshold_uncertainty_score":0.5437011},"labels":[],"label_agreement":null},{"id":"W2130753923","doi":"10.1109/ismvl.2008.43","title":"RevLib: An Online Resource for Reversible Functions and Reversible Circuits","year":2008,"lang":"en","type":"article","venue":"Proceedings/Proceedings - International Symposium on Multiple-Valued Logic","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":497,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Resource (disambiguation); Electronic circuit; Set (abstract data type); Logic gate; Theoretical computer science; Computer engineering; Distributed computing; Computer architecture; Algorithm; Electrical engineering; Computer network; Engineering; Programming language","score_opus":0.04121908588327169,"score_gpt":0.26219762762667925,"score_spread":0.22097854174340756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130753923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9566867,0.0001477936,0.015830452,0.010261344,0.00152325,0.0014362463,0.00013509762,0.0015661457,0.012412997],"genre_scores_gemma":[0.9285624,0.000095892145,0.06460031,0.0022223324,0.001583569,0.000121034056,0.0000946291,0.00009075053,0.002629059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960447,0.000014419,0.0006481357,0.0016343284,0.0008900669,0.0007683732],"domain_scores_gemma":[0.9975913,0.00025986004,0.00045937236,0.0002471708,0.0010317037,0.00041055414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067084696,0.0005667546,0.0004752467,0.0004976041,0.0011501875,0.0004780664,0.001715025,0.00025971016,0.0000129753425],"category_scores_gemma":[0.00073864363,0.00053787325,0.0002225919,0.00072237715,0.00020100272,0.0013015169,0.0005263051,0.0006174512,0.000021806494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016378431,0.0071698534,0.094859205,0.0014484496,0.0014096415,0.000120714016,0.026090845,0.0092957225,0.24350683,0.42965105,0.13323486,0.05157499],"study_design_scores_gemma":[0.004730248,0.0024578448,0.009362539,0.00041762166,0.000078560566,0.0010964945,0.0010097641,0.9036392,0.0042734873,0.005627443,0.06568717,0.0016196019],"about_ca_topic_score_codex":0.000029496443,"about_ca_topic_score_gemma":0.0000020028206,"teacher_disagreement_score":0.8943435,"about_ca_system_score_codex":0.00021875635,"about_ca_system_score_gemma":0.00006733297,"threshold_uncertainty_score":0.9997073},"labels":[],"label_agreement":null},{"id":"W2131552237","doi":"10.1016/j.disc.2011.06.032","title":"State transfer on graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":223,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Adjacency matrix; Vertex (graph theory); Combinatorics; Discrete mathematics; Regular graph; Graph; Transfer (computing); Line graph; Computer science; Graph power","score_opus":0.022213408380759768,"score_gpt":0.22897733315431235,"score_spread":0.20676392477355257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131552237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17281918,0.000017016862,0.81531394,0.00012201391,0.00018039155,0.000120036544,0.0000046760483,0.00026211265,0.011160613],"genre_scores_gemma":[0.780779,0.000005889433,0.21870744,0.00025721765,0.000021480697,0.0000068748054,0.0000010878247,0.000020342422,0.00020066756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990257,0.000026779497,0.00020441393,0.0002472022,0.00022968615,0.00026622874],"domain_scores_gemma":[0.9992485,0.00005788781,0.000032921696,0.00054854003,0.000024189647,0.000087945904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016700597,0.00015871944,0.0001594215,0.000083978994,0.000094154784,0.000065576074,0.00066710415,0.000031143467,0.000020886462],"category_scores_gemma":[0.000011538057,0.00011552734,0.00009940146,0.000214638,0.000040579136,0.00008323543,0.00007962099,0.00014869368,0.00009155998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005998491,0.00024075677,0.00003493129,0.00008034311,0.000045213244,0.000055071712,0.03187805,0.0003263836,0.00017826288,0.93098843,0.00021715052,0.035949435],"study_design_scores_gemma":[0.00031676944,0.00031943346,0.00056090736,0.00011174977,0.00000994139,0.000032299216,0.00007906613,0.43482837,0.0059344405,0.5569083,0.00048206717,0.0004166277],"about_ca_topic_score_codex":0.0000052618275,"about_ca_topic_score_gemma":0.0000011918694,"teacher_disagreement_score":0.6079598,"about_ca_system_score_codex":0.000006025432,"about_ca_system_score_gemma":0.000013959215,"threshold_uncertainty_score":0.47110686},"labels":[],"label_agreement":null},{"id":"W2131684748","doi":"10.1007/978-3-642-38616-9_2","title":"Quantum Algorithms for the Subset-Sum Problem","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Lorentz Center","keywords":"Computer science; Heuristic; Exponent; Algorithm; Quantum algorithm; Quantum walk; Quantum; Theoretical computer science; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.01990679447945905,"score_gpt":0.24691054623585224,"score_spread":0.22700375175639317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131684748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031437245,0.001325453,0.9877238,0.004790974,0.0034534715,0.0015693796,0.000015164234,0.0003278359,0.0007624615],"genre_scores_gemma":[0.012188106,0.00008856483,0.98166776,0.0026611993,0.0020228894,0.00011837913,0.000010339316,0.000104897605,0.0011378762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945288,0.000047016107,0.00076342985,0.0021484138,0.0012054921,0.0013068487],"domain_scores_gemma":[0.9946604,0.0019441366,0.0004603414,0.0022463286,0.00044351228,0.0002453244],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015067238,0.0008666953,0.0007220367,0.0005960922,0.00093008915,0.0014033534,0.00697921,0.0004037537,0.000025696043],"category_scores_gemma":[0.000096941294,0.0005798707,0.0003429504,0.00072372635,0.00096988113,0.00046476262,0.0019687165,0.0013442287,0.00009167104],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032362316,0.000024640896,0.000003677549,0.000049416267,0.000024687493,0.000019280771,0.00058219535,0.06267,0.000029395816,0.046615582,0.00030190992,0.889676],"study_design_scores_gemma":[0.00023723976,0.00020343195,0.000034272467,0.00021502847,0.000011137882,0.000080458194,1.828228e-7,0.7442448,0.00015178775,0.24221276,0.0120017985,0.0006071057],"about_ca_topic_score_codex":0.00006490992,"about_ca_topic_score_gemma":0.000033314864,"teacher_disagreement_score":0.8890689,"about_ca_system_score_codex":0.00019560412,"about_ca_system_score_gemma":0.00064734294,"threshold_uncertainty_score":0.99966526},"labels":[],"label_agreement":null},{"id":"W2132658615","doi":"10.1109/ccc.2004.19","title":"Multiparty quantum coin flipping","year":2004,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Coin flipping; Constant (computer programming); Upper and lower bounds; Quantum; Fraction (chemistry); Computer science; Channel (broadcasting); Mathematics; Quantum channel; Classical capacity; Discrete mathematics; Topology (electrical circuits); Combinatorics; Quantum information; Computer network; Quantum mechanics; Physics; Statistics","score_opus":0.011114979794782869,"score_gpt":0.23073561701419223,"score_spread":0.21962063721940936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132658615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13752456,0.000050440984,0.85749,0.0024149253,0.00041150377,0.0000660355,3.872507e-7,0.0005096766,0.0015324935],"genre_scores_gemma":[0.7771772,0.0000020702853,0.22188374,0.00072921533,0.0000935379,0.000002110149,5.573377e-7,0.000006280681,0.00010526199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989893,0.00002194713,0.0001580978,0.00033119763,0.000188877,0.00031061753],"domain_scores_gemma":[0.99936473,0.00004488559,0.00003918064,0.00041844446,0.00003221071,0.000100574296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016054456,0.000120729426,0.00011797708,0.000068878675,0.00016752852,0.00012925953,0.0006275823,0.000037966933,0.000010720565],"category_scores_gemma":[0.000024374085,0.00009424563,0.00006412875,0.00028838968,0.000029828328,0.00016242363,0.0002414483,0.00015032552,0.00014474847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031821282,0.00017041115,0.00016708506,0.000018197978,0.000023788643,0.0001080141,0.0022030352,0.10314465,0.0033255296,0.7706608,0.00076976523,0.1194055],"study_design_scores_gemma":[0.0005571157,0.000075601565,0.0012933082,0.000031201715,0.0000014655462,0.0000744624,0.000019166444,0.9570086,0.003367436,0.032203067,0.005118249,0.00025034032],"about_ca_topic_score_codex":0.000094799885,"about_ca_topic_score_gemma":0.000009391776,"teacher_disagreement_score":0.85386395,"about_ca_system_score_codex":0.00002421945,"about_ca_system_score_gemma":0.00005765061,"threshold_uncertainty_score":0.38432252},"labels":[],"label_agreement":null},{"id":"W2132833274","doi":"10.1109/ismvl.2009.19","title":"Equivalence Checking of Reversible Circuits","year":2009,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Universität Bremen; Deutscher Akademischer Austauschdienst","keywords":"Formal equivalence checking; Electronic circuit; Equivalence (formal languages); Computer science; Boolean function; Boolean satisfiability problem; Logical equivalence; Boolean circuit; Logic gate; Adder; Sequential logic; Algorithm; Arithmetic; Theoretical computer science; Mathematics; Formal verification; Discrete mathematics; Electrical engineering; Engineering","score_opus":0.016220988039241064,"score_gpt":0.24575044816829664,"score_spread":0.22952946012905556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132833274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06426086,0.000118306845,0.9183967,0.001120688,0.00016184004,0.000051265102,2.8400007e-7,0.0001794606,0.015710555],"genre_scores_gemma":[0.92762554,0.0000043761966,0.07172881,0.00035863832,0.00003689103,1.7386049e-7,1.3703001e-7,0.0000017516714,0.0002437095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927205,0.000017261811,0.00013825294,0.00020774172,0.00017816694,0.00018653077],"domain_scores_gemma":[0.9994767,0.00003572156,0.00005792986,0.00034114422,0.000041558014,0.00004694583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016898649,0.00007129382,0.00010732024,0.00006616237,0.000054369943,0.000032268126,0.00066351885,0.000025579388,0.00001101486],"category_scores_gemma":[0.000020424759,0.00005986241,0.000049421436,0.00034859744,0.00001707099,0.00013455031,0.00010008277,0.000080798374,0.000009689309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.384138e-7,0.00007025651,0.0002042408,0.000017908236,0.0000065634986,0.000014865879,0.00076627417,0.003875373,0.013588114,0.12006945,0.00074223906,0.86064386],"study_design_scores_gemma":[0.00033705262,0.0003496072,0.010749161,0.00013255111,0.000004028819,0.00005540895,0.000017889519,0.90241665,0.047221266,0.03698105,0.0014140031,0.00032133114],"about_ca_topic_score_codex":0.0000066732173,"about_ca_topic_score_gemma":2.1511622e-7,"teacher_disagreement_score":0.8985413,"about_ca_system_score_codex":0.000007336433,"about_ca_system_score_gemma":0.000028742921,"threshold_uncertainty_score":0.24411182},"labels":[],"label_agreement":null},{"id":"W2133163108","doi":"10.1145/2629537","title":"An Algorithm for Quantum Template Matching","year":2014,"lang":"en","type":"article","venue":"ACM Journal on Emerging Technologies in Computing Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"University of Victoria","keywords":"Template; Heuristics; Electronic circuit; Computer science; Algorithm; Matching (statistics); Quantum gate; Quantum circuit; Quantum; Template matching; Minification; Quantum computer; Theoretical computer science; Mathematics; Quantum network; Engineering; Artificial intelligence","score_opus":0.017055117560863822,"score_gpt":0.2881021204279315,"score_spread":0.2710470028670677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133163108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13223553,0.00028077458,0.8601023,0.0018503469,0.0034517953,0.00026200863,0.0000016290087,0.0017823866,0.00003321135],"genre_scores_gemma":[0.6437971,0.000014256429,0.35567668,0.00008458932,0.00038131347,0.000007481076,0.000001086366,0.000032005493,0.00000548432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656093,0.0002978935,0.00093320315,0.00076210196,0.0005044715,0.0009413904],"domain_scores_gemma":[0.9964787,0.0010505047,0.0006240388,0.0015952727,0.00014715694,0.000104324645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003423045,0.00040291648,0.0005911418,0.00088502135,0.0008161874,0.0007704858,0.0048110774,0.00024121255,3.041518e-7],"category_scores_gemma":[0.0006352241,0.00034199675,0.00015917709,0.00075845135,0.00007542555,0.00033930337,0.0007906175,0.0011862386,0.0000063830907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043774203,0.00007733083,0.00018748676,0.00003873446,0.000025230887,0.000041842424,0.0005110358,0.21076547,0.00020303286,0.027230466,0.0003143274,0.7606007],"study_design_scores_gemma":[0.00057786447,0.0005927847,0.00009664121,0.0006312926,0.0000041563303,0.00052132626,0.00043516242,0.94085497,0.00016921479,0.052226212,0.0034703552,0.00042000285],"about_ca_topic_score_codex":0.000029187951,"about_ca_topic_score_gemma":0.0000012100134,"teacher_disagreement_score":0.76018065,"about_ca_system_score_codex":0.0001472231,"about_ca_system_score_gemma":0.000050916078,"threshold_uncertainty_score":0.9999032},"labels":[],"label_agreement":null},{"id":"W2134039451","doi":"10.1142/s0219749914500208","title":"Quantum codes over rings","year":2014,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Linear code; Block code; Quantum convolutional code; Mathematics; Discrete mathematics; Luby transform code; Quantum; Quantum mechanics; Physics; Algorithm; Decoding methods","score_opus":0.006799543727083315,"score_gpt":0.24412699078773942,"score_spread":0.23732744706065612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134039451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20784526,0.000022297017,0.78682613,0.0021643334,0.0024808915,0.00003385243,0.00000269948,0.000049064554,0.0005754795],"genre_scores_gemma":[0.98509467,0.000023437924,0.01304873,0.0013472381,0.00046540063,8.0171924e-7,0.0000063385796,0.0000049894975,0.000008380203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981205,0.00005883544,0.0007100454,0.00008590229,0.00085045444,0.00017429465],"domain_scores_gemma":[0.99811417,0.00015648453,0.00078443467,0.00018280717,0.00066889735,0.00009320069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084106653,0.00012944135,0.00017647553,0.0004135287,0.00007712311,0.00042593147,0.0013448676,0.000054506385,0.000014482037],"category_scores_gemma":[0.00026573928,0.00010463186,0.00013772395,0.00016226732,0.000033380977,0.0023949086,0.00017285896,0.00025956248,0.00005335688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067322,0.000093095005,0.000670852,0.000023972776,0.00014353027,0.000018519257,0.0034536072,0.039374717,0.00045314155,0.68032527,0.0057526445,0.26962334],"study_design_scores_gemma":[0.00056342495,0.00015697311,0.0045541152,0.00007426284,0.000004258138,0.00029112474,0.000029761866,0.92191637,0.00042510056,0.021495027,0.05036181,0.0001277634],"about_ca_topic_score_codex":0.000021356236,"about_ca_topic_score_gemma":5.621114e-7,"teacher_disagreement_score":0.88254166,"about_ca_system_score_codex":0.000061746185,"about_ca_system_score_gemma":0.00006547634,"threshold_uncertainty_score":0.42667633},"labels":[],"label_agreement":null},{"id":"W2134210354","doi":"10.1103/physreva.80.052312","title":"High-threshold universal quantum computation on the surface code","year":2009,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":492,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Australian Research Council; Army Research Office; Australian Government; National Security Agency","keywords":"Quantum computer; Qubit; Computer science; Quantum error correction; Computation; Formalism (music); Lattice (music); Quantum; Error detection and correction; Code (set theory); Algorithm; Theoretical computer science; Quantum mechanics; Physics","score_opus":0.01819343942477886,"score_gpt":0.2807981523005523,"score_spread":0.2626047128757734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134210354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6304525,0.0042186338,0.25275612,0.109265745,0.00046752937,0.0008175694,0.0000059923345,0.0005743603,0.0014415736],"genre_scores_gemma":[0.9906095,0.000327525,0.0028566401,0.0060367445,0.00014318012,0.0000013928209,0.0000020555424,0.0000061019186,0.000016816683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883777,0.00012233708,0.00015158013,0.0003287314,0.00032650275,0.00023310806],"domain_scores_gemma":[0.9990846,0.0002777987,0.00009075444,0.00042631038,0.00004717775,0.00007339159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023246759,0.00016049814,0.00025649843,0.000016223628,0.00015923193,0.00007381273,0.00068964006,0.00001541946,0.0000024915932],"category_scores_gemma":[0.00003823673,0.00009679334,0.0001281252,0.00042147827,0.000035709705,0.000089042995,0.00008904404,0.0002682945,0.00010075125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033377241,0.00019086304,0.0000022883694,0.00005211238,0.000010527683,0.000013837218,0.00015834109,0.025751738,0.00027651875,0.89728737,0.0057611573,0.07049191],"study_design_scores_gemma":[0.00012120899,0.00026645017,0.000531973,0.0005915168,0.000011439046,0.0000048717648,0.0000019339357,0.90827566,0.00021504548,0.08662964,0.0031765245,0.00017371344],"about_ca_topic_score_codex":0.000006261474,"about_ca_topic_score_gemma":2.5529175e-7,"teacher_disagreement_score":0.88252395,"about_ca_system_score_codex":0.000022977763,"about_ca_system_score_gemma":0.000029959861,"threshold_uncertainty_score":0.39471176},"labels":[],"label_agreement":null},{"id":"W2135701916","doi":"10.1109/ismvl.2012.57","title":"A New Approach to Online Testing of TGFSOP-based Ternary Toffoli Circuits","year":2012,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toffoli gate; Computer science; Electronic circuit; Cascade; Ternary operation; Logic gate; Algorithm; Computer engineering; Electronic engineering; Electrical engineering; Programming language; Quantum gate; Engineering; Qubit","score_opus":0.04172537334347478,"score_gpt":0.2608049882289233,"score_spread":0.2190796148854485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135701916","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058461193,0.000055556575,0.93449473,0.00044100915,0.000221606,0.00012155781,0.0000022571496,0.00020881988,0.00599327],"genre_scores_gemma":[0.4268301,7.1067625e-8,0.5722175,0.0005042987,0.00023406709,0.0000012379153,0.0000013118951,0.0000070507094,0.00020433217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987748,0.00003951316,0.0002304848,0.0002919939,0.00026152568,0.00040166773],"domain_scores_gemma":[0.99888176,0.00019584369,0.00007654396,0.00049843773,0.00005204244,0.0002953453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024221164,0.00014456655,0.00018549127,0.00012988226,0.000059085334,0.000041341744,0.00079053163,0.00004102315,0.000009021157],"category_scores_gemma":[0.000111499154,0.000115852956,0.000059510454,0.00065687014,0.000013266646,0.0001295845,0.00028125645,0.00012607238,0.000023440307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023278828,0.00053766347,0.006747506,0.000047320456,0.000016008398,0.0000033567335,0.0010735388,0.03689076,0.0022724553,0.0055668163,0.002234296,0.944608],"study_design_scores_gemma":[0.00024811536,0.00009481507,0.009872958,0.000045219145,0.0000042610304,0.000033436878,0.000011379653,0.9854084,0.0020981154,0.0003008233,0.0016693572,0.0002130692],"about_ca_topic_score_codex":0.00015574576,"about_ca_topic_score_gemma":0.0000011053486,"teacher_disagreement_score":0.9485177,"about_ca_system_score_codex":0.000014662507,"about_ca_system_score_gemma":0.00010698784,"threshold_uncertainty_score":0.47243464},"labels":[],"label_agreement":null},{"id":"W2136462002","doi":"10.1006/jcss.1999.1672","title":"Reversible Space Equals Deterministic Space","year":2000,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Turing machine; Conjecture; Space (punctuation); Turing; Bounded function; Computation; Mathematics; Stochastic game; Computer science; Discrete mathematics; Mathematical economics; Algorithm; Mathematical analysis","score_opus":0.013491403880278757,"score_gpt":0.2427616204778011,"score_spread":0.22927021659752234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136462002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36172464,0.0008736497,0.6305808,0.0017722428,0.0014500851,0.00009708885,9.809255e-7,0.0000745285,0.003425971],"genre_scores_gemma":[0.8562546,0.000028046237,0.1429849,0.00012164267,0.00044561984,2.765934e-7,3.3309902e-8,0.0000038396006,0.0001610544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982874,0.0001650704,0.0004387543,0.00027916956,0.00053326937,0.00029633628],"domain_scores_gemma":[0.998999,0.00024326758,0.00028652983,0.00020747755,0.00008041117,0.00018332365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013621096,0.00015184013,0.00034156063,0.00020018639,0.00036032347,0.00054826925,0.0010353654,0.00004120739,0.0000074470418],"category_scores_gemma":[0.000009255071,0.00010393889,0.00010374064,0.00047436875,0.00014179738,0.0004417524,0.00013557568,0.00016099098,0.00001224275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036758487,0.00016223296,0.0016237115,0.0003533705,0.000103863866,0.00097224803,0.0066935667,0.07395825,0.00033321668,0.09073325,0.0069672815,0.81806225],"study_design_scores_gemma":[0.00039627615,0.0009116124,0.0014505221,0.00046981536,0.000011890669,0.00394037,0.00011207024,0.98495257,0.00009875183,0.0012009775,0.006220679,0.00023446471],"about_ca_topic_score_codex":0.00000816932,"about_ca_topic_score_gemma":3.5982444e-7,"teacher_disagreement_score":0.9109943,"about_ca_system_score_codex":0.000021100679,"about_ca_system_score_gemma":0.00012217404,"threshold_uncertainty_score":0.5286973},"labels":[],"label_agreement":null},{"id":"W2136789229","doi":"10.1063/1.4927100","title":"Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Qubit; Quantum; Physics; Quantum mechanics; Mathematics; Algebra over a field; Pure mathematics","score_opus":0.029987607525005337,"score_gpt":0.26203887271016213,"score_spread":0.23205126518515679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136789229","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5311701,0.000060415245,0.4673115,0.00045164287,0.00022460167,0.00006356155,0.0000027170984,0.000030279947,0.0006851401],"genre_scores_gemma":[0.88205636,0.0000033382955,0.11761932,0.00007263132,0.00021500193,7.022647e-7,1.5717261e-7,0.000015935952,0.000016564698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983287,0.000099429475,0.00060248066,0.00013097751,0.0006078532,0.00023056878],"domain_scores_gemma":[0.9979384,0.00072315516,0.00057264697,0.00034400416,0.00022460203,0.00019719337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006489565,0.00016594683,0.00050011126,0.00007424227,0.000046696186,0.00008828422,0.0007123586,0.00005365861,0.0000059642452],"category_scores_gemma":[0.00043151111,0.00011745988,0.00020726044,0.00025273865,0.000103728285,0.00029521697,0.00019246929,0.0002571991,0.000014148251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002804619,0.005591681,0.00043080832,0.0013355736,0.00095392903,0.00043543766,0.01591048,0.058213748,0.010695314,0.55145156,0.008957276,0.34574375],"study_design_scores_gemma":[0.00042930047,0.0003641088,0.00014883865,0.00042083775,0.000049052243,0.00018365106,0.00006124165,0.3194919,0.009084653,0.66928405,0.00028384855,0.00019849325],"about_ca_topic_score_codex":0.0000015591584,"about_ca_topic_score_gemma":1.4371551e-7,"teacher_disagreement_score":0.3508862,"about_ca_system_score_codex":0.000043024025,"about_ca_system_score_gemma":0.00011669586,"threshold_uncertainty_score":0.4789875},"labels":[],"label_agreement":null},{"id":"W2137335992","doi":"10.1088/1367-2630/12/7/075026","title":"Classical Ising model test for quantum circuits","year":2010,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ising model; Electronic circuit; Quadratic growth; Partition function (quantum field theory); Pauli exclusion principle; Quantum; Planar; Graph; Quantum gate","score_opus":0.022286203702301485,"score_gpt":0.26514718259508746,"score_spread":0.24286097889278596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137335992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05831984,0.000025353742,0.93879837,0.0017901408,0.00090061367,0.00004855851,0.0000019362856,0.000029036451,0.000086128486],"genre_scores_gemma":[0.7657386,0.0000017698023,0.23169559,0.00024188927,0.0022445417,3.2705196e-7,2.6232937e-7,0.0000136939,0.00006332213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900424,0.000012254772,0.00028433264,0.00016153448,0.0002896122,0.00024804377],"domain_scores_gemma":[0.9987851,0.00030266098,0.00027828827,0.0002518952,0.00019495082,0.00018711074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023967896,0.00012429201,0.00021261738,0.000048440234,0.0001269366,0.00015486755,0.0007695812,0.000057592435,8.471147e-7],"category_scores_gemma":[0.00012611102,0.000099870056,0.00018891568,0.00017114586,0.00003260382,0.00028531434,0.00008434146,0.00056928775,0.0000028567915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004563314,0.00018659927,0.000053988315,0.000014892088,0.000022059694,0.000012028888,0.0007236646,0.043408245,0.063646905,0.111781955,0.005878604,0.7742665],"study_design_scores_gemma":[0.00039288565,0.0001649505,0.00007214817,0.00002768134,0.000008371794,0.00008292891,0.0000026007258,0.831968,0.0034743345,0.16214578,0.0015547468,0.00010555331],"about_ca_topic_score_codex":0.0000013319496,"about_ca_topic_score_gemma":9.093837e-7,"teacher_disagreement_score":0.7885598,"about_ca_system_score_codex":0.0000124684575,"about_ca_system_score_gemma":0.0003313365,"threshold_uncertainty_score":0.40725824},"labels":[],"label_agreement":null},{"id":"W2137628640","doi":"10.1139/p07-181","title":"Can a quantum computer simulate quantum field theory – efficiently?","year":2008,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Quantum field theory; Theoretical physics; Field (mathematics); Open quantum system; Quantum; Point (geometry); Quantum simulator; Quantum computer; Quantum mechanics; Quantum information science; Statistical physics; Pure mathematics; Quantum entanglement","score_opus":0.011299239800246814,"score_gpt":0.2089577260982959,"score_spread":0.1976584862980491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137628640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34031165,0.0002139098,0.65542567,0.002046271,0.0017990542,0.00006712023,0.0000062345384,0.0000309135,0.00009914933],"genre_scores_gemma":[0.9898459,0.0000062630684,0.0075534764,0.0016564103,0.00087849254,3.4997373e-7,8.452813e-7,0.000017038761,0.000041241125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998476,0.00012836038,0.0003668825,0.00023151097,0.00028119297,0.0005160144],"domain_scores_gemma":[0.9980307,0.00027423608,0.00025588507,0.00040647245,0.00022329106,0.0008093993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000325281,0.00020281212,0.00030754143,0.0001900206,0.00040118923,0.000119681994,0.0011016016,0.000068585265,0.000012142064],"category_scores_gemma":[0.000062947955,0.00017454984,0.00021742268,0.00043763698,0.000114923285,0.00016507837,0.00006542164,0.00050452864,0.000013268896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002658311,0.00015157905,0.0013889946,0.000043070286,0.00020256778,0.003934762,0.014742505,0.34155917,0.00017692587,0.38507527,0.017342128,0.23535646],"study_design_scores_gemma":[0.0004868702,0.0005166776,0.0010549175,0.00010173774,0.000012872236,0.0007925081,0.000025294563,0.93849224,0.00045744283,0.052748494,0.0049746362,0.00033628455],"about_ca_topic_score_codex":0.0006144025,"about_ca_topic_score_gemma":0.00020953605,"teacher_disagreement_score":0.6495342,"about_ca_system_score_codex":0.00006834918,"about_ca_system_score_gemma":0.0014273976,"threshold_uncertainty_score":0.7117936},"labels":[],"label_agreement":null},{"id":"W2137637395","doi":"10.1007/978-3-540-28629-5_65","title":"An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Argument (complex analysis); Oracle; Quantum complexity theory; Generalization; Quantum algorithm; Quantum computer; Computational complexity theory; Theoretical computer science; Computer science; Quantum; Complexity class; Mathematics; Time complexity; Computation; Discrete mathematics; Algorithm; Quantum mechanics","score_opus":0.02209990278930636,"score_gpt":0.27215878532121346,"score_spread":0.2500588825319071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137637395","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073196134,0.000103156824,0.99136394,0.0014204084,0.0040127602,0.0013947356,0.000054309512,0.0004437406,0.00047498863],"genre_scores_gemma":[0.3719106,0.000009331778,0.6247749,0.0019916797,0.0010782465,0.00003511236,0.000057278376,0.00008840634,0.000054455384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931264,0.000094074174,0.0009226887,0.0029680054,0.0016109191,0.0012778967],"domain_scores_gemma":[0.9960231,0.00072792865,0.00061156746,0.0016903183,0.00052060734,0.00042644195],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012262431,0.001121714,0.001004783,0.0011647008,0.00089398434,0.0010658343,0.0036714613,0.0004695075,0.0000123841355],"category_scores_gemma":[0.00006034951,0.0010407115,0.00035766282,0.0006818586,0.0013667839,0.0006085478,0.00072660425,0.0013087554,0.000030015197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048080794,0.00021986596,0.0000023184223,0.00005518103,0.000026972066,0.00008705191,0.00085279474,0.53320205,0.000072357245,0.112210035,0.000020487072,0.3532028],"study_design_scores_gemma":[0.0006758486,0.0014802946,0.00010098472,0.00043835535,0.0000093245335,0.000037573704,3.3364068e-7,0.62844086,0.00019908846,0.367431,0.00039767614,0.000788632],"about_ca_topic_score_codex":0.00009227874,"about_ca_topic_score_gemma":0.000069190755,"teacher_disagreement_score":0.37117863,"about_ca_system_score_codex":0.0010798709,"about_ca_system_score_gemma":0.0014576225,"threshold_uncertainty_score":0.99997115},"labels":[],"label_agreement":null},{"id":"W2138262447","doi":"10.1145/2090236.2090261","title":"Quantum rejection sampling","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office","keywords":"Quantum algorithm; Quantum state; Quantum sort; Quantum; Mathematics; Quantum phase estimation algorithm; Quantum operation; Computer science; Algorithm; Quantum error correction; Open quantum system; Quantum mechanics; Physics","score_opus":0.034972683660303185,"score_gpt":0.27952133776567334,"score_spread":0.24454865410537016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138262447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018519672,0.00043572957,0.97140735,0.000861698,0.0051317103,0.00015151942,0.0000019342594,0.00096829754,0.0025220711],"genre_scores_gemma":[0.5692663,0.000023640006,0.42876583,0.00030147043,0.001310918,0.000013395534,0.000010374925,0.000024856143,0.00028317186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998275,0.00007405584,0.00028020507,0.0006386527,0.00029091584,0.00044117137],"domain_scores_gemma":[0.99849623,0.0000897853,0.00016452775,0.0010475747,0.00006699647,0.00013489414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043327542,0.00027780302,0.00026123048,0.00015802967,0.0001679361,0.0003393056,0.0012021743,0.00024192342,0.000020117295],"category_scores_gemma":[0.000027692438,0.00023532382,0.00016790612,0.00018771939,0.000022837985,0.00012168966,0.0026015623,0.0008865207,0.00009529621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057260345,0.00023831775,0.00040026518,0.00030502566,0.00013165486,0.00001552587,0.002798646,0.09634972,0.0005371909,0.3009326,0.003548573,0.59473675],"study_design_scores_gemma":[0.000067650486,0.000019105953,0.0012363979,0.00008847489,0.000007938702,0.000036061017,0.0000061666638,0.9463859,0.00020252014,0.044886082,0.0066608596,0.00040284122],"about_ca_topic_score_codex":0.00012778395,"about_ca_topic_score_gemma":0.0000030564572,"teacher_disagreement_score":0.8500362,"about_ca_system_score_codex":0.00004859975,"about_ca_system_score_gemma":0.00009228188,"threshold_uncertainty_score":0.9596227},"labels":[],"label_agreement":null},{"id":"W2138295001","doi":"10.1109/ccece.2009.5090115","title":"On using FPGAS to accelerate the emulation of quantum computing","year":2009,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum computer; Emulation; Computer science; Field-programmable gate array; Qubit; Quantum entanglement; Computation; Quantum; Computer architecture; Hardware emulation; Embedded system; Computer engineering; Computational science; Algorithm; Physics","score_opus":0.025189803882019742,"score_gpt":0.2863535167016717,"score_spread":0.26116371281965195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138295001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46095204,0.0000059420927,0.53709793,0.0014446337,0.00011819825,0.00007104073,1.4290104e-7,0.000059776656,0.00025026585],"genre_scores_gemma":[0.94021946,2.1758183e-7,0.05794036,0.0017481532,0.00007539775,1.3886664e-7,2.2985759e-7,0.000003724764,0.00001229672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990454,0.000059667003,0.00021326679,0.00024144253,0.00022881843,0.00021144406],"domain_scores_gemma":[0.9992781,0.00014245836,0.00008363264,0.0003857473,0.000059161954,0.000050898867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028452076,0.000107613196,0.00012741216,0.00008984606,0.00019845116,0.000106564454,0.00058557076,0.000025957452,0.0000030778756],"category_scores_gemma":[0.000030896605,0.00006754306,0.000051462197,0.00048015674,0.000013200537,0.00007229138,0.00012159813,0.00011668669,0.000007994646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000365425,0.000030295185,0.000019488125,0.000002071238,0.0000033873944,0.0000016971671,0.00085498614,0.81031525,0.0024993287,0.10579942,0.00012410193,0.080346316],"study_design_scores_gemma":[0.00008737071,0.00017486376,0.003864378,0.00003831488,0.0000014886531,0.000006813297,0.000008544196,0.9826994,0.0025408305,0.010424175,0.00006252733,0.000091305505],"about_ca_topic_score_codex":0.000028477438,"about_ca_topic_score_gemma":7.9247786e-7,"teacher_disagreement_score":0.47926745,"about_ca_system_score_codex":0.000015789594,"about_ca_system_score_gemma":0.000023468081,"threshold_uncertainty_score":0.27543262},"labels":[],"label_agreement":null},{"id":"W2138674143","doi":"10.1109/tit.2011.2165149","title":"High Performance Single-Error-Correcting Quantum Codes for Amplitude Damping","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Dimension (graph theory); Code word; Decoding methods; Block code; Amplitude; Algorithm; Construct (python library); Quantum; Block (permutation group theory); Computer science; Discrete mathematics; Mathematics; Combinatorics; Physics; Quantum mechanics","score_opus":0.02439391026629164,"score_gpt":0.23118838118950652,"score_spread":0.20679447092321487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138674143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1191284,0.000005863389,0.8779785,0.000058473575,0.0017160431,0.00025073544,0.000013976227,0.00044260718,0.00040538138],"genre_scores_gemma":[0.9349479,0.0000038058263,0.06441501,0.00047239175,0.000047443526,0.00005704287,0.00000524638,0.000012047838,0.000039132763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987149,0.00006842954,0.00044344546,0.00021108572,0.00021142946,0.00035067392],"domain_scores_gemma":[0.9988544,0.0003095705,0.00020824086,0.00041104236,0.00013520631,0.00008153774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066593423,0.00020612252,0.00018124288,0.00029133615,0.0006449084,0.00016545916,0.0005419032,0.000083250095,0.000021977197],"category_scores_gemma":[0.00001819075,0.0001890576,0.000114774426,0.0003144133,0.000057198777,0.0014768888,0.0000057790703,0.00026622796,0.00006652146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013560949,0.00014932598,0.000004757376,0.000103815255,0.000053586966,5.759043e-7,0.016031852,0.15205377,0.00016231455,0.034573194,0.0000422157,0.796689],"study_design_scores_gemma":[0.0005875478,0.00047755922,0.00016371685,0.00012397175,0.000017530116,0.000047644153,0.00048727004,0.9392555,0.046710376,0.011246652,0.00049515866,0.0003871215],"about_ca_topic_score_codex":0.000021644053,"about_ca_topic_score_gemma":0.0000018372432,"teacher_disagreement_score":0.8158195,"about_ca_system_score_codex":0.000056684792,"about_ca_system_score_gemma":0.000043803935,"threshold_uncertainty_score":0.77095455},"labels":[],"label_agreement":null},{"id":"W2139158984","doi":"10.1142/s0219749908004377","title":"MIXING OF QUANTUM WALKS ON GENERALIZED HYPERCUBES","year":2008,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Security Agency; National Science Foundation","keywords":"Hamming graph; Hypercube; Quantum walk; Combinatorics; Mixing (physics); Mathematics; Circulant matrix; Hamming distance; Adjacency matrix; Hamming code; Discrete mathematics; Quantum; Graph isomorphism; Quantum algorithm; Graph; Line graph; Physics; Quantum mechanics; Algorithm","score_opus":0.01689808476108753,"score_gpt":0.25092777442631164,"score_spread":0.2340296896652241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139158984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6184023,0.0000520403,0.37808508,0.0012082868,0.0018402997,0.00004657477,0.0000052073283,0.000028162764,0.0003320294],"genre_scores_gemma":[0.9837563,0.00009529401,0.015320147,0.0005320893,0.0002752563,8.727144e-7,0.000005810604,0.0000056173767,0.0000086053105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977159,0.00006315773,0.0009504401,0.000091296104,0.0010125991,0.00016663193],"domain_scores_gemma":[0.9978099,0.00014673357,0.00092846714,0.00019535531,0.0008407794,0.00007878922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046579685,0.00014390156,0.00024342422,0.00058043184,0.000096835865,0.00009092211,0.0011408733,0.00006133506,0.000011737853],"category_scores_gemma":[0.00018402144,0.00011505738,0.00019326419,0.0002067255,0.00005496565,0.0015029274,0.000118856726,0.00026203084,0.000024371922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052099454,0.0005337991,0.0015667955,0.00007231441,0.00052044936,0.00026478415,0.017658822,0.23414193,0.0053069573,0.5289838,0.007014073,0.20341529],"study_design_scores_gemma":[0.0010786279,0.00040033335,0.0050424645,0.00016390486,0.0000062455565,0.0012916239,0.0000670124,0.9760913,0.004532269,0.0057070176,0.005448512,0.00017066734],"about_ca_topic_score_codex":0.000024397175,"about_ca_topic_score_gemma":2.3623639e-7,"teacher_disagreement_score":0.7419494,"about_ca_system_score_codex":0.000066291475,"about_ca_system_score_gemma":0.00014464365,"threshold_uncertainty_score":0.4691904},"labels":[],"label_agreement":null},{"id":"W2139322641","doi":"10.1007/s00453-002-0978-1","title":"Sharp Quantum versus Classical Query Complexity Separations","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Simple (philosophy); Noncommutative geometry; Quantum complexity theory; Mathematics; Quantum algorithm; Quantum; Theory of computation; Bounded function; Polynomial; Fourier transform; Quantum Fourier transform; Discrete mathematics; Algorithm; Quantum error correction; Pure mathematics; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.05649716913227652,"score_gpt":0.2721984185858378,"score_spread":0.21570124945356128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139322641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025142314,0.0003804601,0.9344962,0.02595292,0.0033934382,0.00032416882,0.000034645873,0.0014016862,0.008874169],"genre_scores_gemma":[0.80964404,0.000014195045,0.18784331,0.0007408838,0.00086985365,0.000024263025,0.000013791224,0.000033844804,0.0008158162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788475,0.00011961202,0.00033368904,0.0006572817,0.0004246703,0.0005799702],"domain_scores_gemma":[0.99844146,0.00029409715,0.00010096493,0.0008364773,0.000084224914,0.00024276187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016551369,0.00026573602,0.00027618767,0.00013113268,0.00045349557,0.0002708313,0.0011682361,0.00011222285,0.00014843738],"category_scores_gemma":[0.00006166148,0.00024548423,0.00016845053,0.0005913538,0.00018350089,0.00030166176,0.00040762674,0.0004454217,0.0005749934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021886352,0.0006507663,0.000033517557,0.000019882853,0.00013089344,0.00016509485,0.0014935677,0.0015708569,0.00022707756,0.5991063,0.06604583,0.33053428],"study_design_scores_gemma":[0.0006287274,0.00017988637,0.00048027225,0.000010302266,0.00000840562,0.000048824517,0.000010109026,0.9448655,0.000103575025,0.00758643,0.045760714,0.00031722727],"about_ca_topic_score_codex":0.0000319437,"about_ca_topic_score_gemma":0.0000124687285,"teacher_disagreement_score":0.94329464,"about_ca_system_score_codex":0.00005565028,"about_ca_system_score_gemma":0.00003835446,"threshold_uncertainty_score":0.99999976},"labels":[],"label_agreement":null},{"id":"W2141213105","doi":"10.1080/03081087.2015.1033381","title":"Perfect state transfer in products and covers of graphs","year":2015,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adjacency matrix; Tensor product; Quantum walk; Operator (biology); Graph; Adjacency list; Degree matrix; Graph energy; Tensor (intrinsic definition)","score_opus":0.014778872125337341,"score_gpt":0.23679795571255763,"score_spread":0.22201908358722028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141213105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9870753,0.00053365657,0.011705787,0.00029969774,0.00012761525,0.00015481983,0.0000060381385,0.000048982518,0.000048103273],"genre_scores_gemma":[0.9775457,0.000060559178,0.022225846,0.00007839255,0.000033887503,0.0000018921406,0.0000019412623,0.000009033426,0.000042785043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903065,0.00006126198,0.00020422216,0.00034397785,0.00015704632,0.00020286329],"domain_scores_gemma":[0.99950624,0.00006067008,0.000025314725,0.00021835318,0.00006922665,0.00012019676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034418787,0.00013284359,0.00020884299,0.0001227192,0.000032596174,0.000031529198,0.00016827366,0.000041384956,6.393329e-7],"category_scores_gemma":[0.00006417924,0.000108700486,0.000027262786,0.00029377587,0.000093515235,0.00012367585,0.00009963461,0.00016014936,0.0000016630079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005565024,0.0011775044,0.049836725,0.00089001865,0.00020200193,0.00027140122,0.0837906,0.024282908,0.024019359,0.017629057,0.00044573913,0.7968982],"study_design_scores_gemma":[0.0018342705,0.00032503676,0.0076843034,0.00005040291,0.00000646872,0.000035386045,0.0000684223,0.97382176,0.013243943,0.0014738343,0.0012173123,0.00023885124],"about_ca_topic_score_codex":0.000115566974,"about_ca_topic_score_gemma":0.000015942564,"teacher_disagreement_score":0.9495389,"about_ca_system_score_codex":0.0000048831566,"about_ca_system_score_gemma":0.000057465797,"threshold_uncertainty_score":0.4432677},"labels":[],"label_agreement":null},{"id":"W2141465802","doi":"10.1103/physrevlett.106.110501","title":"Quantum Codes Give Counterexamples to the Unique Preimage Conjecture of the<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\"><mml:mi>N</mml:mi></mml:math>-Representability Problem","year":2011,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Perimeter Institute; University of Waterloo","funders":"National Science Foundation","keywords":"Counterexample; Conjecture; Quantum; Physics; Discrete mathematics; Theoretical physics; Quantum mechanics; Computer science; Mathematics","score_opus":0.02089426283540328,"score_gpt":0.25625470143885526,"score_spread":0.235360438603452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141465802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9703237,0.00053487206,0.021902017,0.006567524,0.00023946357,0.00021326084,0.000041690768,0.000082413375,0.00009508858],"genre_scores_gemma":[0.9876439,0.00018676053,0.0055226535,0.0062562414,0.00022090886,0.00012242049,0.000011696413,0.000032418306,0.000002995833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978606,0.00025636866,0.0004141296,0.0005562247,0.00050857035,0.000404076],"domain_scores_gemma":[0.9977517,0.00046277785,0.0003647979,0.0012505772,0.000053444026,0.00011671576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057674584,0.00026126546,0.0002797324,0.000022852946,0.0002598384,0.00011365766,0.001513722,0.000049669758,0.000003901362],"category_scores_gemma":[0.00017634206,0.000179067,0.00042964125,0.00032644492,0.00033971394,0.00016273318,0.0009148337,0.00046179906,0.000075177275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014051787,0.000110503584,0.000012886662,0.0007479212,0.000067144036,0.000013453295,0.0019758213,0.00087172975,0.0015754619,0.99248785,0.0006020077,0.0015211472],"study_design_scores_gemma":[0.000128626,0.00017859033,0.000524124,0.001455288,0.00009280774,0.000052063482,0.0000354617,0.9862144,0.005245443,0.0020901503,0.0037283553,0.00025470238],"about_ca_topic_score_codex":0.00029387564,"about_ca_topic_score_gemma":0.0000242398,"teacher_disagreement_score":0.9903977,"about_ca_system_score_codex":0.000009517027,"about_ca_system_score_gemma":0.000094288014,"threshold_uncertainty_score":0.73021406},"labels":[],"label_agreement":null},{"id":"W2143531065","doi":"10.1103/physrevlett.98.090501","title":"Optimal Quantum Circuits for General Phase Estimation","year":2007,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Phase (matter); Measure (data warehouse); State (computer science); Rotation (mathematics); Simple (philosophy); Quantum; Quantum circuit; Polynomial; Quantum phase estimation algorithm; Electronic circuit; Amplitude; Physics; Applied mathematics; Quantum algorithm; Mathematics; Computer science; Quantum mechanics; Algorithm; Quantum error correction; Mathematical analysis; Geometry","score_opus":0.020236872089271524,"score_gpt":0.32669266989679474,"score_spread":0.3064557978075232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143531065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22320999,0.0008943004,0.77005327,0.0052019153,0.00019840615,0.00031025882,0.0000024763192,0.00011417984,0.000015222267],"genre_scores_gemma":[0.65037113,0.00014734198,0.3153273,0.032715615,0.0013103274,0.00005682391,0.000027196085,0.000034399338,0.000009874482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867857,0.00003805045,0.00025720772,0.00037732837,0.0002496968,0.00039917446],"domain_scores_gemma":[0.99919,0.00017413075,0.000114998584,0.0003574069,0.00004138985,0.00012210074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004683694,0.00017191865,0.00028551224,0.000045064622,0.00012028983,0.00006399425,0.00051061966,0.00000937398,0.0000014329916],"category_scores_gemma":[0.00006902948,0.0001423887,0.00020704215,0.0002852018,0.000035283567,0.00016717591,0.00008062151,0.00014269572,0.000025467773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005525174,0.00030235332,0.0000028909408,0.00064516475,0.000022219187,0.00002340141,0.0002747668,0.01863497,0.016810957,0.027811464,0.0058910144,0.92957526],"study_design_scores_gemma":[0.00037179803,0.000114436836,0.00007437232,0.00027698214,0.000017310038,0.000012967936,3.9007497e-7,0.99094915,0.0006314697,0.0009365234,0.0064170803,0.00019754231],"about_ca_topic_score_codex":0.000002486431,"about_ca_topic_score_gemma":9.477912e-8,"teacher_disagreement_score":0.9723142,"about_ca_system_score_codex":0.000026925993,"about_ca_system_score_gemma":0.000019071922,"threshold_uncertainty_score":0.58064425},"labels":[],"label_agreement":null},{"id":"W2144105074","doi":"10.1088/1367-2630/17/1/013042","title":"Accelerated randomized benchmarking","year":2015,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Industry Canada; Canada Excellence Research Chairs, Government of Canada; National Science Foundation","keywords":"Benchmarking; Physics; Task (project management); Quantum; Homogeneous space; Computer engineering; Computer science; Systems engineering; Quantum mechanics","score_opus":0.03340380963628503,"score_gpt":0.26789953594970656,"score_spread":0.23449572631342153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144105074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035180233,0.00039429218,0.9619088,0.0007570737,0.0011224145,0.000050694238,1.3652426e-7,0.000029228959,0.00055709976],"genre_scores_gemma":[0.76820344,0.000031586926,0.22769304,0.00040366533,0.0035629452,3.4167113e-7,4.695656e-7,0.000012450801,0.0000920837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989042,0.0001269955,0.00032620697,0.00010449761,0.0003762702,0.00016177743],"domain_scores_gemma":[0.9988305,0.00015435231,0.0003698858,0.00017143614,0.00025751814,0.00021631646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007437207,0.000103633334,0.00035736113,0.000053841024,0.000045607245,0.00015209678,0.0006256033,0.000028123157,0.0000026448176],"category_scores_gemma":[0.00008776995,0.00007341728,0.00016793299,0.00030716753,0.000027494476,0.00030538876,0.00011017186,0.0002594412,0.0000062921417],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001235292,0.00010618401,0.00004517871,0.0000071586937,0.00014004023,0.00009976383,0.004033245,0.05296508,0.00048511487,0.03196871,0.0194677,0.88944656],"study_design_scores_gemma":[0.061444912,0.00026237947,0.00004229064,0.000096510885,0.000029385488,0.0002311376,0.000019201925,0.7737222,0.002645877,0.15639684,0.0048863282,0.00022293486],"about_ca_topic_score_codex":0.00001116043,"about_ca_topic_score_gemma":1.6458233e-7,"teacher_disagreement_score":0.8892236,"about_ca_system_score_codex":0.000023204242,"about_ca_system_score_gemma":0.0003301382,"threshold_uncertainty_score":0.29938698},"labels":[],"label_agreement":null},{"id":"W2144456193","doi":"10.26421/qic9.9-10-7","title":"Eigenpath traversal by phase randomization","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Mathematics; Quantum walk; Quantum algorithm; Unitary matrix; Hamiltonian (control theory); Quantum computer; Qubit; Quantum decoherence; Eigenvalues and eigenvectors; Markov chain; Applied mathematics; Discrete mathematics; Quantum; Mathematical optimization; Quantum mechanics; Unitary state; Physics","score_opus":0.0054725096693274645,"score_gpt":0.2429029828329795,"score_spread":0.23743047316365204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144456193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103610374,0.00006718706,0.89413327,0.0012772242,0.00017094248,0.0001704239,0.000004550852,0.00023958356,0.0003264663],"genre_scores_gemma":[0.98626167,0.00002448821,0.012314952,0.0012396268,0.000034175162,0.000002869523,0.00011157276,0.000002758461,0.000007906979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904555,0.000053061038,0.00034945732,0.00014812849,0.00023092034,0.00017287895],"domain_scores_gemma":[0.99948996,0.000046239897,0.00017335649,0.00011583381,0.00008599464,0.0000885842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000247191,0.00013316663,0.00013880664,0.00014743257,0.00021901377,0.00035593886,0.00016920328,0.00005410541,0.0000030481344],"category_scores_gemma":[0.000023023907,0.000121518024,0.000038065184,0.0002855685,0.000019130126,0.0013940145,0.000025923253,0.000101838516,0.000022273218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043242842,0.00006366074,0.000003880114,0.000009178306,0.000005246661,7.944965e-7,0.002118717,0.009532016,0.00017803472,0.03783245,0.0021537752,0.948059],"study_design_scores_gemma":[0.0033730685,0.00028589086,0.00027160763,0.000010634867,0.0000037892032,0.000020493646,0.000038571307,0.98340595,0.00021956558,0.0097936895,0.0024196163,0.00015715102],"about_ca_topic_score_codex":0.000005117106,"about_ca_topic_score_gemma":1.1772864e-7,"teacher_disagreement_score":0.9738739,"about_ca_system_score_codex":0.000017543513,"about_ca_system_score_gemma":0.000031114312,"threshold_uncertainty_score":0.49553612},"labels":[],"label_agreement":null},{"id":"W2145121981","doi":"10.1109/isit.2008.4594998","title":"Quantum serial turbo-codes","year":2008,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Turbo code; Serial concatenated convolutional codes; Quantum convolutional code; Convolutional code; Concatenated error correction code; Computer science; Block code; Algorithm; Linear code; Theoretical computer science; Low-density parity-check code; BCJR algorithm; Decoding methods","score_opus":0.014145955674888865,"score_gpt":0.22333401233037933,"score_spread":0.20918805665549048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145121981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5894168,0.000065236934,0.4029795,0.001255641,0.0010139003,0.00006979174,8.2191116e-7,0.00067521527,0.004523114],"genre_scores_gemma":[0.8968353,0.0000075831204,0.10181496,0.00046115296,0.00030434172,0.0000019593642,8.068129e-7,0.000006813798,0.0005670625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990334,0.000036523783,0.00014299076,0.00030631243,0.00020437918,0.00027639826],"domain_scores_gemma":[0.9993793,0.00005623696,0.000034385124,0.00040584384,0.00003362296,0.000090617614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010442408,0.00011879791,0.000130821,0.000059390197,0.0002402011,0.00006483912,0.0006826833,0.00004147572,0.00003267443],"category_scores_gemma":[0.000017739461,0.0000899008,0.00006600261,0.00024161971,0.00005022697,0.00014589482,0.00023289952,0.00012554994,0.00012208681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041761148,0.00054070656,0.0023631218,0.000042287153,0.00011150839,0.0010194362,0.009222323,0.020458477,0.009136712,0.60007375,0.056558028,0.3004319],"study_design_scores_gemma":[0.00027244486,0.00011600027,0.003238069,0.000008127826,0.0000014362315,0.00040522,0.00000783775,0.9731898,0.0051077837,0.009148463,0.0082241595,0.00028069603],"about_ca_topic_score_codex":0.000050009075,"about_ca_topic_score_gemma":0.0000026852354,"teacher_disagreement_score":0.9527313,"about_ca_system_score_codex":0.00000866742,"about_ca_system_score_gemma":0.00005362178,"threshold_uncertainty_score":0.36660483},"labels":[],"label_agreement":null},{"id":"W2145882191","doi":"10.1109/ismvl.2011.38","title":"Rev-Map: A Direct Gateway from Classical Irreversible Network to Reversible Network","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Toffoli gate; Computer science; Gate count; Logic gate; Reversible computing; Electronic circuit; Scheme (mathematics); Topology (electrical circuits); Order (exchange); Default gateway; Algorithm; Theoretical computer science; Mathematics; Quantum gate; Quantum computer; Quantum; Computer network; Computer hardware; Physics; Electrical engineering; Engineering; Quantum mechanics","score_opus":0.01919759204533716,"score_gpt":0.21263903108412605,"score_spread":0.19344143903878888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145882191","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008991121,0.0005498105,0.91322935,0.0042395024,0.004307716,0.00046672265,0.000006700852,0.0013712937,0.06683776],"genre_scores_gemma":[0.07975902,0.000012854102,0.9083212,0.004322421,0.0019672143,0.000013280002,0.0000063218376,0.000033812066,0.0055638975],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973401,0.00016182607,0.00033289197,0.0008901835,0.00033994002,0.00093506003],"domain_scores_gemma":[0.998114,0.00025091087,0.00009536932,0.001043801,0.000066779976,0.00042916278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004516032,0.00030217163,0.0003908592,0.000076772725,0.00035999797,0.00016398125,0.0015663184,0.00012805904,0.00028486855],"category_scores_gemma":[0.0000308793,0.00025443238,0.00017439967,0.001065672,0.00004721662,0.00022716916,0.0010667557,0.00033764867,0.00075133843],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000557898,0.00015491256,0.0023334431,0.000014064559,0.00012239473,0.00015076781,0.0018632737,0.02626001,0.00006589948,0.024870282,0.9014439,0.042665258],"study_design_scores_gemma":[0.00068760564,0.00055878196,0.006966009,0.00033047106,0.00003955443,0.000020994547,0.000030845476,0.4195294,0.00062719034,0.055975143,0.5139932,0.0012408021],"about_ca_topic_score_codex":0.00041132994,"about_ca_topic_score_gemma":0.00009037443,"teacher_disagreement_score":0.39326942,"about_ca_system_score_codex":0.000047253074,"about_ca_system_score_gemma":0.00008373566,"threshold_uncertainty_score":0.99999076},"labels":[],"label_agreement":null},{"id":"W2145928944","doi":"10.1038/nature13460","title":"Contextuality supplies the ‘magic’ for quantum computation","year":2014,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":626,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Kochen–Specker theorem; Quantum computer; Computer science; Quantum; Quantum algorithm; Quantum network; Theoretical physics; Theoretical computer science; MAGIC (telescope); Quantum information; Open quantum system; Quantum mechanics; Physics","score_opus":0.009466171760587392,"score_gpt":0.2697859807060201,"score_spread":0.2603198089454327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145928944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024432508,0.00024955606,0.9569937,0.016476303,0.000945963,0.0002477096,0.000007875627,0.00019947426,0.00044689496],"genre_scores_gemma":[0.9655009,0.0000013217359,0.030412195,0.0036327941,0.00034630945,0.000008217647,0.000009622571,0.00000817908,0.000080459635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989872,0.00010169954,0.00014938686,0.00030666846,0.00022039776,0.00023462516],"domain_scores_gemma":[0.9987263,0.0006665844,0.00008552798,0.00035780703,0.00011968598,0.000044103163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006002502,0.00012783853,0.00013964302,0.00003573484,0.00029546814,0.00018516499,0.00074949156,0.00028813566,0.0000015887476],"category_scores_gemma":[0.00015481492,0.00007818477,0.00009131688,0.00018390955,0.000057355366,0.00008740456,0.00013248512,0.0009136164,0.000010497506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011392501,0.000038997103,0.000080089594,0.000031610518,0.000019646113,8.922622e-7,0.0011080602,0.0039260387,0.00017903151,0.7772833,0.024953287,0.19236767],"study_design_scores_gemma":[0.0002710383,0.00006981481,0.0020327787,0.000010223114,0.000003692411,0.0000096350705,0.000019147583,0.8380452,0.00021225866,0.09169424,0.067514,0.00011800748],"about_ca_topic_score_codex":0.000007247429,"about_ca_topic_score_gemma":0.0000054090683,"teacher_disagreement_score":0.9410684,"about_ca_system_score_codex":0.000011286577,"about_ca_system_score_gemma":0.00002521749,"threshold_uncertainty_score":0.39692596},"labels":[],"label_agreement":null},{"id":"W2147184732","doi":"10.17169/refubium-11923","title":"Locality and complexity in simulations of complex quantum systems","year":2015,"lang":"en","type":"dissertation","venue":"Universitätsbibliothek der FU Berlin Hochschulschriftenstelle u. Dokumentenserver","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Studienstiftung des Deutschen Volkes; Institut Périmètre de physique théorique; Bundesministerium für Bildung und Forschung; Institut de Ciències Fotòniques; Foundational Questions Institute","keywords":"Undecidable problem; Locality; Quantum; Mathematics; Quantum state; Discrete mathematics; Theoretical physics; Pure mathematics; Quantum mechanics; Mathematical physics; Physics; Decidability","score_opus":0.048538574362022566,"score_gpt":0.28125454844334513,"score_spread":0.23271597408132255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147184732","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95857954,0.008550399,0.021534242,0.00046091623,0.0023027607,0.0019964436,0.00046276403,0.00042071223,0.005692232],"genre_scores_gemma":[0.98986083,0.00033764742,0.007767964,0.00015808396,0.00010535699,0.0000047246576,0.0006817236,0.0000759251,0.00100777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953418,0.0005082666,0.0010918652,0.0012856021,0.0010206659,0.0007518295],"domain_scores_gemma":[0.996138,0.0003980436,0.00079392915,0.0013073733,0.0009818542,0.00038083852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007485509,0.0007616402,0.0013101916,0.0032431618,0.00029401615,0.000333009,0.0015113056,0.0005290911,0.00006542386],"category_scores_gemma":[0.000085376036,0.00078021904,0.00023619959,0.003447762,0.00029263532,0.00086295744,0.0005683472,0.0008540406,0.000018339944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003087749,0.006077222,0.019512726,0.014410992,0.00443215,0.0034737643,0.048649978,0.34753105,0.0042873183,0.43710563,0.075528845,0.03590257],"study_design_scores_gemma":[0.002343682,0.0002441366,0.008869285,0.0007201368,0.00012534394,0.00007585124,0.0015433297,0.9756678,0.000064308566,0.0036105823,0.0057381396,0.0009974265],"about_ca_topic_score_codex":0.0027928073,"about_ca_topic_score_gemma":0.0012624683,"teacher_disagreement_score":0.6281367,"about_ca_system_score_codex":0.00014743433,"about_ca_system_score_gemma":0.000434856,"threshold_uncertainty_score":0.99946487},"labels":[],"label_agreement":null},{"id":"W2147198170","doi":"10.5555/1874620.1874931","title":"Debugging of Toffoli networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Toffoli gate; Debugging; Algorithmic program debugging; Computer science; Reversible computing; Boolean satisfiability problem; Background debug mode interface; Programming language; Logic gate; Parallel computing; Algorithm; Computer engineering; Theoretical computer science; Quantum computer; Quantum; Quantum gate","score_opus":0.00568152527599272,"score_gpt":0.21634329048689255,"score_spread":0.21066176521089983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147198170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014102533,0.00012690872,0.9789016,0.0012160938,0.0001303987,0.00002841486,5.801329e-8,0.00019132478,0.0053026523],"genre_scores_gemma":[0.8736066,0.0000028052718,0.12571521,0.00053735555,0.000060870832,1.6360148e-7,1.5410407e-7,0.0000015211887,0.00007528814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994686,0.00001531752,0.00011497511,0.00014423527,0.00009631842,0.00016054249],"domain_scores_gemma":[0.99959844,0.00004745258,0.00003686575,0.00025523355,0.000021974327,0.000040025912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010284145,0.000060235,0.00008982656,0.000041237075,0.000042975073,0.000031074163,0.0004166871,0.00002288926,0.000005307459],"category_scores_gemma":[0.000008741689,0.00004600682,0.00004212647,0.00021656185,0.000010378168,0.00006599274,0.000068137866,0.00006942099,0.0000027920523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.246793e-7,0.000027238657,0.000058054207,0.000001429035,0.000003932588,0.0000053703893,0.00013456344,0.056517,0.00017962464,0.0837766,0.0007138319,0.85858154],"study_design_scores_gemma":[0.00006457264,0.00006412817,0.0024765613,0.000010433331,9.0301256e-7,0.000010291131,0.0000012538309,0.9894925,0.0005653858,0.0065988805,0.00065025775,0.000064870255],"about_ca_topic_score_codex":0.00000605059,"about_ca_topic_score_gemma":5.350707e-7,"teacher_disagreement_score":0.9329755,"about_ca_system_score_codex":0.0000033531594,"about_ca_system_score_gemma":0.000013257507,"threshold_uncertainty_score":0.18761036},"labels":[],"label_agreement":null},{"id":"W2147435884","doi":"10.1145/1273496.1273497","title":"Quantum clustering algorithms","year":2007,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Cluster analysis; Speedup; Algorithm; Computer science; Quantization (signal processing); Quantum algorithm; Quantum; Theoretical computer science; Artificial intelligence; Physics; Quantum mechanics; Parallel computing","score_opus":0.013305995396289657,"score_gpt":0.2528552320066469,"score_spread":0.23954923661035724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147435884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019887859,0.00005418202,0.9725616,0.00050998694,0.00076637376,0.00005781466,2.1557773e-7,0.00055958796,0.0056023574],"genre_scores_gemma":[0.59099615,0.0000020083721,0.4077485,0.0006302355,0.00023999462,8.2791433e-7,4.820529e-7,0.000009368354,0.00037243814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878025,0.000017139379,0.00020661957,0.00033101081,0.0002302868,0.00043468195],"domain_scores_gemma":[0.99925315,0.00010750409,0.000043216725,0.00042699825,0.00003708909,0.00013203055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006138897,0.00012613453,0.00011362084,0.00011637028,0.00014555913,0.00012441578,0.0007269433,0.000046237496,0.000013570016],"category_scores_gemma":[0.00001643559,0.00010187505,0.000061883955,0.00035990693,0.000024743138,0.00015151975,0.00037071836,0.00015430884,0.00007847404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004327852,0.00006946872,0.00029893976,0.000012620512,0.000017462613,0.00016557483,0.000863732,0.002597005,0.0011645538,0.0976528,0.00090359244,0.89624995],"study_design_scores_gemma":[0.00014722448,0.00005407175,0.0028837179,0.000009413601,9.1708995e-7,0.00009283025,0.000015647462,0.98748076,0.0014434691,0.0029619213,0.0047322693,0.00017777272],"about_ca_topic_score_codex":0.000036283676,"about_ca_topic_score_gemma":0.000011282883,"teacher_disagreement_score":0.9848837,"about_ca_system_score_codex":0.000018021196,"about_ca_system_score_gemma":0.00002005034,"threshold_uncertainty_score":0.4154344},"labels":[],"label_agreement":null},{"id":"W2147548586","doi":"10.26421/qic9.3-4-3","title":"Efficient quantum algorithm for identifying hidden polynomials","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Mathematics; Coset; Combinatorics; Degree (music); Constant (computer programming); Polynomial; Generalization; Finite field; Discrete mathematics; Quantum algorithm; Random variate; Quantum; Random variable; Computer science","score_opus":0.016411135504754152,"score_gpt":0.27458653261753213,"score_spread":0.258175397112778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147548586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06817984,0.000111796915,0.9290255,0.0012127977,0.0005764131,0.00039524498,0.000009005507,0.00037499468,0.00011446531],"genre_scores_gemma":[0.7851275,0.000008311485,0.21355954,0.0010981392,0.00012624341,0.000014030227,0.000050399012,0.0000065612558,0.0000092335895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985014,0.000048174188,0.00055910065,0.00025529243,0.0003085319,0.0003274811],"domain_scores_gemma":[0.99906975,0.0001336648,0.00029680497,0.00019537233,0.00018308651,0.000121330355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049852935,0.00020245192,0.00021818365,0.000303467,0.00043258214,0.0006431393,0.0003082331,0.00008083702,0.0000015364849],"category_scores_gemma":[0.000038956197,0.00018965114,0.00008833584,0.00034296094,0.0000284538,0.0006625458,0.00007570106,0.00012562997,0.000026897982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006013526,0.000029091632,0.000002102597,0.00002082286,0.0000075975736,7.297478e-7,0.0015469267,0.016626071,0.000058876958,0.05654964,0.00040494718,0.92474717],"study_design_scores_gemma":[0.00070637546,0.00022929128,0.0015456179,0.000036810467,0.000006830845,0.000035102803,0.00012281057,0.9732528,0.00012236889,0.02265263,0.0010442697,0.0002451042],"about_ca_topic_score_codex":0.000012447325,"about_ca_topic_score_gemma":2.4284583e-7,"teacher_disagreement_score":0.9566267,"about_ca_system_score_codex":0.00004246254,"about_ca_system_score_gemma":0.0000611726,"threshold_uncertainty_score":0.7733749},"labels":[],"label_agreement":null},{"id":"W2147590609","doi":"10.1103/physrevlett.104.050504","title":"Fast Decoders for Topological Quantum Codes","year":2010,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":250,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Context (archaeology); Topology (electrical circuits); Quantum; Computer science; Space (punctuation); Algorithm; Renormalization; Energy (signal processing); Discrete mathematics; Mathematics; Physics; Combinatorics; Quantum mechanics","score_opus":0.015264144292423962,"score_gpt":0.2955993417184665,"score_spread":0.28033519742604257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147590609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30226555,0.00077939156,0.63141376,0.06395977,0.000747093,0.00048479595,0.000006401565,0.00026887364,0.00007435079],"genre_scores_gemma":[0.81717116,0.0003483065,0.10707394,0.074251935,0.0009996695,0.00010932209,0.000010826981,0.000024988858,0.000009859637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987269,0.00005507697,0.0001967916,0.00044054806,0.0002011451,0.00037955813],"domain_scores_gemma":[0.9988802,0.0003860059,0.000085034306,0.0004819495,0.00003720009,0.00012957994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025108247,0.00018627003,0.0003533406,0.000026382831,0.00014612572,0.00007965054,0.0008764768,0.000015281708,0.0000062812733],"category_scores_gemma":[0.0001347178,0.00013247399,0.00026649382,0.00019386566,0.000112440815,0.00010087207,0.00016533952,0.00034674804,0.000041428273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014447312,0.0006294501,0.00014220506,0.0016876009,0.00010499915,0.000044700584,0.0007993924,0.0027343351,0.075553186,0.41515937,0.050126854,0.45300347],"study_design_scores_gemma":[0.0002274957,0.000116690666,0.0003656454,0.00025751855,0.000023411265,0.000025628648,0.0000023022737,0.9319535,0.00046356692,0.013179932,0.053000756,0.00038356258],"about_ca_topic_score_codex":0.000005556646,"about_ca_topic_score_gemma":0.0000015914337,"teacher_disagreement_score":0.9292191,"about_ca_system_score_codex":0.000007907656,"about_ca_system_score_gemma":0.000017629678,"threshold_uncertainty_score":0.5402132},"labels":[],"label_agreement":null},{"id":"W2147651330","doi":"10.1016/j.physleta.2012.08.028","title":"Quantum computation with programmable connections between gates","year":2012,"lang":"en","type":"article","venue":"Physics Letters A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computation; Quantum computer; Computer science; Unitary state; Quantum; Quantum circuit; Theoretical computer science; State (computer science); Topology (electrical circuits); Quantum error correction; Computer engineering; Algorithm; Mathematics; Quantum mechanics; Physics","score_opus":0.01685358168060599,"score_gpt":0.24107376213253437,"score_spread":0.22422018045192837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147651330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33882543,0.000020719652,0.6584304,0.0022105796,0.00013893265,0.000102343125,0.0000012976509,0.00021978622,0.000050498387],"genre_scores_gemma":[0.92852426,3.928925e-7,0.07028333,0.00052358746,0.0006267585,0.000013114726,0.000009604447,0.000014037876,0.0000048946445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989616,0.00005117217,0.000121123994,0.00023189279,0.00020849031,0.0004256733],"domain_scores_gemma":[0.99941754,0.00011955676,0.00008779212,0.00023365226,0.00003389574,0.00010753526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013209555,0.00014804567,0.00014900332,0.00004286832,0.00023740987,0.00015735878,0.00027062988,0.00002107483,7.2714533e-7],"category_scores_gemma":[0.0000037521704,0.00011929615,0.00004969294,0.00042326792,0.000053195046,0.00040381725,0.00009187162,0.00017377695,0.000029175017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019564344,0.00091421086,0.109238505,0.00016093471,0.00048754946,0.000026121459,0.011769686,0.11844508,0.010422872,0.21642995,0.0063625053,0.52572304],"study_design_scores_gemma":[0.0009197925,0.0003128711,0.025151456,0.00009730736,0.000056345365,0.00005263498,0.00004721626,0.9505511,0.00488356,0.010693799,0.006300906,0.0009330477],"about_ca_topic_score_codex":0.00003528902,"about_ca_topic_score_gemma":4.984714e-7,"teacher_disagreement_score":0.832106,"about_ca_system_score_codex":0.000021033962,"about_ca_system_score_gemma":0.000016831209,"threshold_uncertainty_score":0.4864756},"labels":[],"label_agreement":null},{"id":"W2148083502","doi":"10.1146/annurev-conmatphys-020911-125041","title":"Quantum Computation by Local Measurement","year":2011,"lang":"en","type":"article","venue":"Annual Review of Condensed Matter Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantum computer; Quantum entanglement; Quantum algorithm; Quantum information; Computation; Quantum; Quantum network; Quantum technology; Open quantum system","score_opus":0.021859982646289085,"score_gpt":0.24875000882671838,"score_spread":0.2268900261804293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148083502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011233696,0.007339095,0.98915815,0.000632665,0.00021761977,0.00022064571,0.000014107034,0.00007271786,0.0012216233],"genre_scores_gemma":[0.96758187,0.0007211765,0.021783413,0.009718176,0.000091560614,0.000016106067,0.000015184432,0.0000307595,0.0000417407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836665,0.00012719826,0.000409136,0.00031116165,0.0005479679,0.00023787712],"domain_scores_gemma":[0.99881953,0.000041258478,0.0002562959,0.00040198505,0.00040263942,0.00007826923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042085943,0.00018876504,0.00036024954,0.000025638856,0.000054616306,0.00001884498,0.0005511516,0.00003243886,0.000026669186],"category_scores_gemma":[0.000013247067,0.00016004493,0.0001371289,0.00024520437,0.00008416565,0.00020069427,0.00015750239,0.00014545482,0.00013424452],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015413745,0.0007172746,0.00011198886,0.0076875756,0.0001866923,0.000022199254,0.004424596,0.00018128949,0.0014703451,0.022961786,0.26082727,0.70139354],"study_design_scores_gemma":[0.004681495,0.0031032371,0.006836605,0.04652989,0.00053100527,0.00025037056,0.00043675938,0.49360785,0.07170073,0.2692823,0.09758886,0.005450905],"about_ca_topic_score_codex":0.000027360824,"about_ca_topic_score_gemma":2.6214235e-7,"teacher_disagreement_score":0.96737474,"about_ca_system_score_codex":0.000021023974,"about_ca_system_score_gemma":0.00006592043,"threshold_uncertainty_score":0.6526443},"labels":[],"label_agreement":null},{"id":"W2148541058","doi":"10.1109/pacrim.2009.5291282","title":"Generating Toffoli networks from ESOP expressions","year":2009,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Toffoli gate; Computer science; Benchmark (surveying); Heuristic; Set (abstract data type); Algorithm; Cascade; Quantum gate; Theoretical computer science; Quantum; Qubit; Artificial intelligence","score_opus":0.008812621163523908,"score_gpt":0.22811273891432063,"score_spread":0.21930011775079672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148541058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06218235,0.00025148565,0.93354535,0.0015882909,0.00035045453,0.000045630997,6.4229897e-7,0.00039180563,0.001643989],"genre_scores_gemma":[0.5976064,0.000003885416,0.39967263,0.002074331,0.0004803657,0.0000010179405,0.0000023221967,0.000003645633,0.00015538877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902385,0.00004515052,0.00015987619,0.00034426252,0.00014881417,0.00027802185],"domain_scores_gemma":[0.99925077,0.000114648625,0.000044223463,0.00046004422,0.000022798977,0.000107529355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008847823,0.0001221254,0.00011836368,0.00003502601,0.00023867137,0.0002088311,0.00062859233,0.00005308456,0.000029291687],"category_scores_gemma":[0.000019248266,0.0000913345,0.000057465055,0.00019446226,0.000010537601,0.00012932411,0.00017134174,0.00017543988,0.000016229973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.5007067e-7,0.000046139296,0.000052313648,3.8420578e-7,0.0000065753097,0.00002366822,0.00040074994,0.3185431,0.0034539518,0.011115018,0.004513563,0.66184354],"study_design_scores_gemma":[0.00010304737,0.00003685928,0.00095866516,0.00001653535,0.0000013040952,0.0000050897975,0.000004593728,0.99208254,0.0006050273,0.0046867616,0.0013608077,0.0001387954],"about_ca_topic_score_codex":0.00003532278,"about_ca_topic_score_gemma":0.0000023893544,"teacher_disagreement_score":0.6735394,"about_ca_system_score_codex":0.000007429824,"about_ca_system_score_gemma":0.000018420038,"threshold_uncertainty_score":0.37245128},"labels":[],"label_agreement":null},{"id":"W2149071737","doi":"10.5555/942808.943941","title":"Simplification of Toffoli networks via templates","year":2003,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Toffoli gate; Template; Computer science; Transformation (genetics); Function (biology); Logic gate; Algorithm; Arithmetic; Topology (electrical circuits); Quantum gate; Mathematics; Programming language; Combinatorics","score_opus":0.007926842676705171,"score_gpt":0.2177303218128314,"score_spread":0.2098034791361262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149071737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021304794,0.000090783076,0.9752903,0.00018055369,0.00017659421,0.00005002442,1.387088e-7,0.000097121425,0.0028097103],"genre_scores_gemma":[0.89950997,0.0000036657639,0.10028385,0.00009763079,0.000023625222,0.0000012057986,5.252709e-7,0.0000033968786,0.00007612841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993827,0.000040573952,0.00015323702,0.00017896711,0.00009656098,0.00014797947],"domain_scores_gemma":[0.99942964,0.000102377664,0.000061013114,0.0003253766,0.000040958068,0.000040636995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001755283,0.000069558264,0.00009115972,0.000041221767,0.000057148725,0.000029345103,0.00030163198,0.000033961867,0.000012314125],"category_scores_gemma":[0.000022076594,0.000054241707,0.00003726412,0.00026288014,0.000019510922,0.000067626606,0.000046028053,0.000064524735,0.000007758856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018900872,0.000110554945,0.001202705,0.000014372455,0.000023015358,0.0000036312551,0.00035635827,0.13647756,0.0023088723,0.5418483,0.0010815391,0.31657118],"study_design_scores_gemma":[0.00007747953,0.000037128917,0.0010044004,0.000005532306,0.0000013207773,0.000016303295,0.0000036959575,0.9813624,0.0047933343,0.009935246,0.0026778977,0.0000852482],"about_ca_topic_score_codex":0.000012924493,"about_ca_topic_score_gemma":0.0000011144709,"teacher_disagreement_score":0.8782052,"about_ca_system_score_codex":0.0000046167834,"about_ca_system_score_gemma":0.000015102025,"threshold_uncertainty_score":0.22119126},"labels":[],"label_agreement":null},{"id":"W2151051217","doi":"10.1139/cjp-2013-0083","title":"Bounds on the quantity of entanglement in parallel quantum computing of a single ensemble quantum computer","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Quantum entanglement; Physics; Quantum computer; Quantum; Mode (computer interface); Statistical physics; Quantum mechanics; Computer science","score_opus":0.020074171234905278,"score_gpt":0.21989675040627404,"score_spread":0.19982257917136875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151051217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.783569,0.00009385417,0.21444936,0.0010899701,0.0005899114,0.00013397596,0.0000037806055,0.0000056780145,0.0000645098],"genre_scores_gemma":[0.9870014,0.000002403541,0.012498907,0.00028170395,0.0001987982,7.1040944e-7,6.9600276e-7,0.000011489471,0.000003866398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818814,0.000171968,0.0006877245,0.00018726233,0.00035314783,0.00041173995],"domain_scores_gemma":[0.9981464,0.00031054395,0.00064361095,0.00039424238,0.00027909907,0.00022609436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005442309,0.00017986435,0.00040509665,0.00020451042,0.00012552246,0.000115062074,0.0010322697,0.000047836613,0.000009417582],"category_scores_gemma":[0.000038714916,0.00013265396,0.0001813274,0.0005001083,0.00014264173,0.00018081588,0.00008693903,0.00036570002,0.0000056202944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023956567,0.00079833245,0.012768228,0.00017500363,0.00022948018,0.00015776893,0.014563352,0.20069069,0.007098374,0.6235401,0.007558226,0.13239646],"study_design_scores_gemma":[0.00065920467,0.0010937694,0.014881959,0.00056481065,0.000011445007,0.00004788263,0.00021645403,0.9429587,0.002875325,0.035964426,0.0004578927,0.00026809503],"about_ca_topic_score_codex":0.004693971,"about_ca_topic_score_gemma":0.0011836165,"teacher_disagreement_score":0.742268,"about_ca_system_score_codex":0.0001000263,"about_ca_system_score_gemma":0.0005106624,"threshold_uncertainty_score":0.70959115},"labels":[],"label_agreement":null},{"id":"W2151552318","doi":"10.1142/s0217979212300022","title":"MEASUREMENT-BASED QUANTUM COMPUTING WITH VALENCE-BOND-SOLIDS","year":2012,"lang":"en","type":"article","venue":"International Journal of Modern Physics B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Cluster state; Quantum computer; Valence bond theory; Quantum state; Physics; Quantum; Resource (disambiguation); Quantum information; Spins; Quantum technology; Valence (chemistry); Computer science; Theoretical physics; Quantum mechanics; Open quantum system; Condensed matter physics; Molecule","score_opus":0.02494597895283977,"score_gpt":0.25945867421140434,"score_spread":0.23451269525856458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151552318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090333566,0.00030211484,0.907074,0.00084286014,0.001246836,0.000038778013,0.000002022588,0.000039066595,0.00012075246],"genre_scores_gemma":[0.938124,0.0000028482918,0.060165863,0.00036617168,0.0013225279,4.775854e-7,8.4897476e-7,0.000014162517,0.000003085025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975444,0.000060679497,0.0003579349,0.0001617754,0.0015645742,0.0003106334],"domain_scores_gemma":[0.9981617,0.00007436582,0.00048666153,0.00021470568,0.0009117797,0.00015078412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006619191,0.00017139499,0.0002040244,0.00012119749,0.00008760968,0.00016883321,0.0012853189,0.000032546362,0.0000017546712],"category_scores_gemma":[0.000029429535,0.00013078179,0.00014270344,0.00015712954,0.000045605448,0.0005588073,0.00014283312,0.00032931607,0.0000065199647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001267847,0.001168095,0.00958233,0.00003496245,0.00060012715,0.00013006802,0.0032250993,0.35091734,0.005225555,0.041048072,0.0007636481,0.58717793],"study_design_scores_gemma":[0.0008638601,0.00016577225,0.002213137,0.00030053948,0.000016710525,0.00022196332,0.0000109870925,0.98081064,0.0040495023,0.010687491,0.0004431971,0.0002162042],"about_ca_topic_score_codex":0.0000053675813,"about_ca_topic_score_gemma":4.1947123e-7,"teacher_disagreement_score":0.8477904,"about_ca_system_score_codex":0.000110068904,"about_ca_system_score_gemma":0.00019717333,"threshold_uncertainty_score":0.5333127},"labels":[],"label_agreement":null},{"id":"W2152574661","doi":"10.1109/ismvl.2012.64","title":"Optimizing the Mapping of Reversible Circuits to Four-Valued Quantum Gate Circuits","year":2012,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toffoli gate; Electronic circuit; Quantum gate; Quantum; Computer science; Logic gate; Quantum circuit; Quantum computer; Reversible computing; Electronic engineering; Mathematics; Algorithm; Electrical engineering; Engineering; Quantum network; Physics; Quantum mechanics","score_opus":0.0379452581774427,"score_gpt":0.24774922962973656,"score_spread":0.20980397145229385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152574661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10190421,0.00023184826,0.8915108,0.0016893778,0.00084289775,0.0002380413,0.0000013044561,0.00018827371,0.0033932633],"genre_scores_gemma":[0.9305326,0.000003949825,0.06802767,0.00090197247,0.00021266939,0.000005670082,4.4644855e-7,0.000014241679,0.00030080887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981477,0.00012778063,0.0003270865,0.00033591304,0.00039774767,0.00066373457],"domain_scores_gemma":[0.9985822,0.00019976916,0.00013683675,0.00077456,0.00009533827,0.00021128604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010459246,0.0001905918,0.00024482343,0.0001725613,0.00027974584,0.00010364426,0.0013109684,0.000054848264,0.000016722066],"category_scores_gemma":[0.00008627386,0.00013168699,0.00012245862,0.00092031545,0.000042299995,0.00029205548,0.000573689,0.00021928192,0.00006616669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065348813,0.00038820927,0.0020898806,0.00025232314,0.00026732197,0.000033251807,0.06290488,0.132631,0.032908108,0.31029904,0.011048849,0.44717062],"study_design_scores_gemma":[0.00037285988,0.00011736648,0.0048385016,0.00018595425,0.000014017767,0.00010413551,0.00034341,0.97887915,0.0058830404,0.0021374195,0.006621848,0.00050229585],"about_ca_topic_score_codex":0.000049619353,"about_ca_topic_score_gemma":0.000001203949,"teacher_disagreement_score":0.84624815,"about_ca_system_score_codex":0.000029205163,"about_ca_system_score_gemma":0.000053534724,"threshold_uncertainty_score":0.53700393},"labels":[],"label_agreement":null},{"id":"W2152747729","doi":"10.1109/tc.2011.144","title":"A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Google (Canada)","funders":"","keywords":"Toffoli gate; Computer science; Reversible computing; Benchmark (surveying); Electronic circuit; Heuristics; Function (biology); Algorithm; Quantum computer; Quantum gate; Quantum","score_opus":0.02843785834086029,"score_gpt":0.21876276367784542,"score_spread":0.19032490533698512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152747729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3701888,0.000012354089,0.62900335,0.000038543247,0.00040964337,0.00014532998,0.0000036616318,0.00011061808,0.00008766903],"genre_scores_gemma":[0.9701143,0.0000067397314,0.029756645,0.0000624812,0.000021119757,0.000011738873,6.882019e-8,0.000012497156,0.000014427069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987722,0.000108791,0.00024509215,0.00045363992,0.0001729904,0.00024730165],"domain_scores_gemma":[0.9989436,0.0002974187,0.0000873402,0.0005129413,0.000048263,0.00011039586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016979317,0.0002086845,0.00027350895,0.00025220882,0.00020276403,0.00004767416,0.0006061679,0.00005215587,0.000008000492],"category_scores_gemma":[0.000002581925,0.00017618289,0.0000963902,0.00038880593,0.00006182439,0.0001648836,0.000013683865,0.00020243088,0.0000053735675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028750299,0.0018172493,0.000053236334,0.00003409913,0.00026873618,0.000050496084,0.036119,0.07183989,0.00038089085,0.00018805904,0.00009552218,0.8891241],"study_design_scores_gemma":[0.0014817341,0.0027578727,0.001944056,0.00023228594,0.00006920856,0.0001914268,0.0014266692,0.9477973,0.042998396,0.00028506643,0.00009375124,0.0007222288],"about_ca_topic_score_codex":0.000098093056,"about_ca_topic_score_gemma":0.000009687823,"teacher_disagreement_score":0.88840187,"about_ca_system_score_codex":0.000017341275,"about_ca_system_score_gemma":0.000031147665,"threshold_uncertainty_score":0.718453},"labels":[],"label_agreement":null},{"id":"W2152767987","doi":"10.1088/1367-2630/16/1/013023","title":"An optimal dissipative encoder for the toric code","year":2014,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Physics; Toric code; Dissipative system; Encoder; Unitary state; Lattice (music); Code (set theory); Qubit; Quantum; Pure mathematics; Quantum computer; Statistical physics; Quantum mechanics; Computer science; Mathematics","score_opus":0.015971121562170298,"score_gpt":0.2751478282607343,"score_spread":0.259176706698564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152767987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01217779,0.00008308295,0.9858287,0.0011756112,0.0006147572,0.000051555264,0.0000012362228,0.000015257592,0.000052000458],"genre_scores_gemma":[0.7278716,0.000005155544,0.26867223,0.0002813009,0.0031169164,8.487686e-7,2.939446e-7,0.0000098292885,0.000041865314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927783,0.000053647807,0.0001754878,0.000113360795,0.00022040843,0.00015928377],"domain_scores_gemma":[0.99893683,0.00034212647,0.00022848207,0.00025062694,0.00013632856,0.000105612235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003108492,0.0000914607,0.000140927,0.000019552494,0.00015823815,0.000120654724,0.0008779396,0.000021084043,0.0000012402915],"category_scores_gemma":[0.00003512277,0.000053056116,0.000114279545,0.00013415086,0.000024230652,0.00024338298,0.00005323645,0.00018911004,0.0000013668752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013164182,0.000052298772,0.000016396443,0.0000032688133,0.000025802245,0.0000011810902,0.0020041806,0.15089494,0.00030657763,0.017527845,0.0016919372,0.82746243],"study_design_scores_gemma":[0.00035693793,0.0005511823,0.00038908917,0.000017654913,0.000013812293,0.00002049767,0.000022484854,0.96241575,0.0020250173,0.025863476,0.008238568,0.00008552038],"about_ca_topic_score_codex":0.0000035338976,"about_ca_topic_score_gemma":7.422019e-7,"teacher_disagreement_score":0.8273769,"about_ca_system_score_codex":0.000013362717,"about_ca_system_score_gemma":0.00008999068,"threshold_uncertainty_score":0.21635656},"labels":[],"label_agreement":null},{"id":"W2153370832","doi":"10.1063/1.1499763","title":"Quantum operations that cannot be implemented using a small mixed environment","year":2002,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Counterexample; Unitary state; Unitary transformation; Transformation (genetics); Quantum; State (computer science); Quantum operation; Quantum state; Mathematics; Quantum system; Pure mathematics; Quantum process; Algebra over a field; Theoretical physics; Discrete mathematics; Quantum mechanics; Open quantum system; Physics; Algorithm; Quantum dynamics","score_opus":0.07320638103672758,"score_gpt":0.26375935417573965,"score_spread":0.19055297313901207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153370832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20261076,0.000053875843,0.7957018,0.0013545322,0.00013154875,0.00006945331,0.0000025920467,0.000017372746,0.000058075122],"genre_scores_gemma":[0.6543673,0.000011701158,0.34506944,0.00024462023,0.00025883337,0.0000011844506,4.389042e-7,0.000014662483,0.000031790096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986358,0.00007967052,0.0004415653,0.00015074502,0.0004320029,0.00026019523],"domain_scores_gemma":[0.99914753,0.00013811672,0.00021290967,0.00030261418,0.000056337245,0.0001424758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030210894,0.0001544402,0.00028699043,0.000053398035,0.00016042686,0.00014202793,0.00054279465,0.000034232344,0.00005081773],"category_scores_gemma":[0.000033164833,0.0001151859,0.0001671361,0.00014201395,0.000044420412,0.00019015475,0.00018418867,0.0002723387,0.00001629051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001643726,0.004215582,0.00009646805,0.0002783205,0.0006132309,0.0003819166,0.014344065,0.39049676,0.016747985,0.4561358,0.0044349506,0.112238474],"study_design_scores_gemma":[0.00029825044,0.00012528448,0.000029208342,0.000064334585,0.000024898041,0.00018347759,0.000045787398,0.9631877,0.0010910339,0.034389902,0.00042641815,0.00013373018],"about_ca_topic_score_codex":0.0000034673994,"about_ca_topic_score_gemma":5.1672447e-7,"teacher_disagreement_score":0.5726909,"about_ca_system_score_codex":0.00005569845,"about_ca_system_score_gemma":0.000029423763,"threshold_uncertainty_score":0.46971446},"labels":[],"label_agreement":null},{"id":"W2153507519","doi":"10.1142/s1230161208000225","title":"Entropy of a Quantum Error Correction Code","year":2008,"lang":"en","type":"article","venue":"Open Systems & Information Dynamics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Quantum relative entropy; Joint quantum entropy; Mathematics; Conditional quantum entropy; Generalized relative entropy; Decoherence-free subspaces; Entropy (arrow of time); Residual entropy; Quantum information; Statistical physics; Quantum; Quantum discord; Discrete mathematics; Quantum channel; Quantum mechanics; Maximum entropy thermodynamics; Physics; Quantum entanglement; Configuration entropy","score_opus":0.014622136694864282,"score_gpt":0.24355246882438417,"score_spread":0.22893033212951988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153507519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07395878,0.000020455402,0.9197098,0.00014999423,0.0026113826,0.00047133712,0.000024197281,0.00012614136,0.0029279087],"genre_scores_gemma":[0.9903557,0.000011591599,0.00907653,0.00007796797,0.00004421355,0.000019046103,0.00004804246,0.0000066345274,0.0003602906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998638,0.00007493337,0.0006082949,0.00014302228,0.00033467697,0.00020109134],"domain_scores_gemma":[0.99868155,0.000057403187,0.0005066996,0.00046393977,0.00022168522,0.00006873902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036686176,0.00013433542,0.0002509354,0.00015588637,0.00024689437,0.0002713737,0.0011112959,0.000070767375,0.0000029874059],"category_scores_gemma":[0.000040100582,0.00011946699,0.000058080142,0.00042738326,0.000041015486,0.0017895978,0.00036875292,0.00014489681,0.000059302318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043583514,0.00012460398,0.0017687357,0.00022215188,0.00007123153,0.000011269895,0.011413862,0.4764132,0.000045472592,0.4459248,0.008681022,0.055280093],"study_design_scores_gemma":[0.0003266592,0.000087283304,0.00081244303,0.00006772914,0.000002472757,0.00025987497,0.00030272608,0.9909423,0.000025070087,0.00014128572,0.006890037,0.00014214621],"about_ca_topic_score_codex":0.00046856765,"about_ca_topic_score_gemma":0.000016916803,"teacher_disagreement_score":0.9163969,"about_ca_system_score_codex":0.0000921502,"about_ca_system_score_gemma":0.00013894308,"threshold_uncertainty_score":0.48717225},"labels":[],"label_agreement":null},{"id":"W2154773309","doi":"10.1016/j.jcss.2004.03.005","title":"One-dimensional quantum walks with absorbing boundaries","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Eigenfunction; Curse of dimensionality; Quantum walk; Statistical physics; Random walk; Domain (mathematical analysis); Mathematics; Absorption (acoustics); Space (punctuation); Function (biology); Simple (philosophy); Unitary state; Quantum; Applied mathematics; Mathematical analysis; Computer science; Physics; Quantum mechanics; Eigenvalues and eigenvectors; Quantum algorithm; Optics","score_opus":0.0123920140745925,"score_gpt":0.22286031182502164,"score_spread":0.21046829775042913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154773309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45611462,0.00048073038,0.54141206,0.0010042143,0.00078877126,0.000043888595,3.217702e-7,0.000038412065,0.00011701151],"genre_scores_gemma":[0.8018856,0.0000025805841,0.19770883,0.000121917525,0.000274609,3.0310704e-7,4.8424415e-8,0.0000036162517,0.000002479807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981972,0.00006966474,0.0004219416,0.00027143167,0.0007599254,0.00027985277],"domain_scores_gemma":[0.9990494,0.00010549164,0.0003566728,0.00015548365,0.00018134275,0.00015155945],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001031647,0.00014818492,0.00032534418,0.0002297934,0.00076761766,0.0011506311,0.0007438137,0.00003569265,5.3496547e-7],"category_scores_gemma":[0.0000057889756,0.00009378856,0.000070688766,0.0003997592,0.00037962542,0.00056655786,0.00018052344,0.00019877676,0.0000020810985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060260354,0.0002425577,0.0013141407,0.00024964704,0.00018810858,0.0006044081,0.00853633,0.31498924,0.00046082193,0.56367916,0.00028818264,0.10938716],"study_design_scores_gemma":[0.0018014099,0.0033188085,0.009131154,0.0020579211,0.000026481108,0.009868058,0.00035420663,0.958191,0.00035399286,0.013474559,0.0009020501,0.0005204056],"about_ca_topic_score_codex":0.000024106692,"about_ca_topic_score_gemma":0.00000285374,"teacher_disagreement_score":0.6432017,"about_ca_system_score_codex":0.000035455465,"about_ca_system_score_gemma":0.00043322993,"threshold_uncertainty_score":0.9998863},"labels":[],"label_agreement":null},{"id":"W2154892332","doi":"10.1109/isit.2012.6284654","title":"Classical codes for quantum broadcast channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Quantum channel; Quantum; Quantum capacity; Quantum network; Classical capacity; Theoretical computer science; Topology (electrical circuits); Quantum information; Mathematics; Physics; Quantum mechanics","score_opus":0.022409873799934237,"score_gpt":0.2675462097018733,"score_spread":0.2451363359019391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154892332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02151809,0.00017026503,0.9731778,0.002516332,0.0014113841,0.00014716951,0.000002482466,0.0003081395,0.0007483212],"genre_scores_gemma":[0.8525648,0.0000020726297,0.1453191,0.0005827496,0.0008605465,0.000015945,0.000001967406,0.00001047521,0.00064231805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988851,0.000031542146,0.00014957052,0.00024346846,0.00015633261,0.00053399],"domain_scores_gemma":[0.9992211,0.00019925651,0.00004091686,0.00031611026,0.0000410234,0.00018163619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002980718,0.00013092149,0.00015116722,0.000057583446,0.00016538156,0.00012315963,0.00052497105,0.000054720258,0.000010276989],"category_scores_gemma":[0.000035695535,0.00009713,0.000096283096,0.00016332079,0.000035035937,0.00022728583,0.00019908918,0.00010595798,0.00005331349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007073641,0.00021698671,0.00023730904,0.000024642248,0.000023928049,0.0000019865226,0.0012136487,0.0009650616,0.0005618213,0.7578878,0.015951814,0.22290796],"study_design_scores_gemma":[0.00021055405,0.000097644326,0.00034868036,0.000009062937,0.0000027861834,0.00002929016,0.000013997093,0.90602773,0.0012795521,0.006154141,0.085643455,0.00018309176],"about_ca_topic_score_codex":0.000005844271,"about_ca_topic_score_gemma":4.3300534e-7,"teacher_disagreement_score":0.9050627,"about_ca_system_score_codex":0.0000119571505,"about_ca_system_score_gemma":0.000022133443,"threshold_uncertainty_score":0.39608467},"labels":[],"label_agreement":null},{"id":"W2155191599","doi":"10.1103/physreva.89.022309","title":"Simulating Anderson localization via a quantum walk on a one-dimensional lattice of superconducting qubits","year":2014,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Qubit; Superconducting quantum computing; Superconductivity; Physics; Condensed matter physics; Delocalized electron; Quantum mechanics; Lattice (music); Flux qubit; Quantum computer; Quantum","score_opus":0.024194642136471017,"score_gpt":0.2887624392565599,"score_spread":0.26456779712008893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155191599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43881753,0.0013521613,0.5577498,0.0012856864,0.00015415113,0.00028386194,8.16849e-7,0.0001349923,0.00022102255],"genre_scores_gemma":[0.98943484,0.00003002457,0.009031743,0.0013053702,0.00018021034,0.0000026733005,0.000002630764,0.000010324525,0.0000021624405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984631,0.00022266155,0.00029296882,0.00038225387,0.0004046449,0.00023439547],"domain_scores_gemma":[0.9986565,0.0006135148,0.00016312611,0.00037723046,0.0001059455,0.00008369059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041753036,0.00016434811,0.00040605004,0.00004320436,0.00011640453,0.000027204576,0.00031779075,0.00002440274,0.000004173624],"category_scores_gemma":[0.00036828208,0.00013187199,0.0001325849,0.00041297576,0.000034318222,0.00013934531,0.000112400725,0.00019892477,0.000020603049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109816665,0.0006754944,0.00020915552,0.0028539363,0.000059193004,0.000005129629,0.0011518821,0.13225412,0.004907678,0.09236684,0.00009236816,0.7654132],"study_design_scores_gemma":[0.00015372969,0.00019417799,0.00020034217,0.0021656635,0.000017802824,0.0000043088617,0.0000019460288,0.98329675,0.00075393444,0.012885951,0.00017334291,0.00015207512],"about_ca_topic_score_codex":0.00002978701,"about_ca_topic_score_gemma":0.0000010024631,"teacher_disagreement_score":0.8510426,"about_ca_system_score_codex":0.000012372052,"about_ca_system_score_gemma":0.000023998618,"threshold_uncertainty_score":0.53775835},"labels":[],"label_agreement":null},{"id":"W2156313614","doi":"10.1109/sct.1992.215388","title":"The quantum challenge to structural complexity theory","year":2003,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Oracle; Turing machine; Probabilistic logic; Computer science; Time hierarchy theorem; Theoretical computer science; Turing; Construct (python library); Quantum Turing machine; Set (abstract data type); Quantum; Quantum computer; Cryptography; Universal Turing machine; Discrete mathematics; Algorithm; Mathematics; Artificial intelligence; Programming language; Quantum error correction; Quantum mechanics; Physics","score_opus":0.022398984670825836,"score_gpt":0.25847593826821913,"score_spread":0.23607695359739328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156313614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08420366,0.0003373979,0.88845074,0.008520704,0.0013516353,0.0002414445,0.0000012844635,0.0004088349,0.016484315],"genre_scores_gemma":[0.9448322,0.0000042268616,0.053843457,0.0008121992,0.00007183147,0.000004653912,2.2650164e-7,0.000007890631,0.00042330465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986536,0.0002357648,0.00016069188,0.0003254878,0.00022757179,0.00039691632],"domain_scores_gemma":[0.99879795,0.000314321,0.00003654384,0.00067002414,0.000047322676,0.00013386262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063739653,0.00014120652,0.00011331488,0.00003625463,0.00064628664,0.00022744434,0.0010361646,0.000029142331,0.000024229872],"category_scores_gemma":[0.000097533906,0.00007853461,0.00006416378,0.0002528338,0.000082605795,0.00007316594,0.00023803885,0.00017350145,0.00007348284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018479506,0.0000060819493,0.000009892676,0.0000012548247,0.0000060316684,0.0000027123003,0.00043500232,0.0002686129,0.000014337847,0.95603544,0.00031568977,0.042903107],"study_design_scores_gemma":[0.0001284375,0.00010768436,0.0012544958,0.0000052812093,0.0000012988042,0.000034657158,0.000074314536,0.23594478,0.00021569555,0.7315475,0.030487314,0.00019854766],"about_ca_topic_score_codex":0.000011470377,"about_ca_topic_score_gemma":0.000018598483,"teacher_disagreement_score":0.86062855,"about_ca_system_score_codex":0.000014943654,"about_ca_system_score_gemma":0.000036353496,"threshold_uncertainty_score":0.497078},"labels":[],"label_agreement":null},{"id":"W2156355982","doi":"10.1109/csae.2011.5952845","title":"Efficient approach to design low power reversible logic blocks for Field Programmable Gate Arrays","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Logic gate; Computer science; Macrocell array; Logic synthesis; Programmable logic array; Programmable Array Logic; Power (physics); Programmable logic device; Simple programmable logic device; Field (mathematics); Electronic engineering; Logic family; Computer hardware; Engineering; Algorithm; Mathematics; Physics","score_opus":0.03344676519775975,"score_gpt":0.23122109927859463,"score_spread":0.1977743340808349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156355982","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003112419,0.000021904938,0.98465216,0.000463954,0.00030423055,0.00087024586,7.6467654e-7,0.0003353923,0.010238902],"genre_scores_gemma":[0.14671597,3.0370668e-7,0.8509228,0.0013463757,0.000041040654,0.00006118662,5.697373e-7,0.000010730217,0.00090100005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839455,0.000042779204,0.00019983486,0.00059580134,0.00019475404,0.0005722804],"domain_scores_gemma":[0.99898225,0.000114145085,0.000057047622,0.00056660484,0.0000928168,0.0001871109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004928314,0.00019361557,0.00019081883,0.00011256259,0.00020384545,0.00011802405,0.0009353446,0.000076556724,0.000022908516],"category_scores_gemma":[0.000047390156,0.00014597892,0.00010988528,0.00042785163,0.000020015083,0.00004212341,0.00026544023,0.00013534365,0.00003291555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001847037,0.0021755134,0.000037127233,0.00014161904,0.00010946508,0.00003250581,0.013628986,0.7597162,0.0009773511,0.09467456,0.037768673,0.090553306],"study_design_scores_gemma":[0.0002828259,0.00076154893,0.000013632869,0.000022040496,0.0000049866294,0.00001715088,0.000042319607,0.98571426,0.006690675,0.004664252,0.001510325,0.00027596983],"about_ca_topic_score_codex":0.000027765236,"about_ca_topic_score_gemma":5.228796e-7,"teacher_disagreement_score":0.22599807,"about_ca_system_score_codex":0.000017510789,"about_ca_system_score_gemma":0.000050971055,"threshold_uncertainty_score":0.59528476},"labels":[],"label_agreement":null},{"id":"W2157209735","doi":"10.1145/1412700.1412717","title":"Can quantum mechanics help distributed computing?","year":2008,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Focus (optics); Quantum information science; Quantum computer; Theoretical computer science; Computation; Quantum; Algorithm; Quantum mechanics; Physics; Quantum entanglement","score_opus":0.018880003593253408,"score_gpt":0.2381378307352617,"score_spread":0.2192578271420083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157209735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28192228,0.00013158274,0.70979995,0.006138036,0.0009930431,0.00018029631,0.000019912291,0.0007282325,0.00008664132],"genre_scores_gemma":[0.9623569,0.000026584243,0.035914663,0.0012779533,0.00032747048,0.0000029179425,0.000025031113,0.000025512389,0.00004296257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977151,0.000119359065,0.00037903947,0.0006630799,0.0004445304,0.0006788737],"domain_scores_gemma":[0.99758613,0.00031277363,0.00017989862,0.0015612041,0.00009477981,0.00026518723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021454954,0.00031504245,0.00035101298,0.0001160563,0.000553062,0.00013209095,0.0024048032,0.00011453902,0.000010725096],"category_scores_gemma":[0.00026477248,0.0002782002,0.00016406081,0.000729657,0.00005199876,0.00014632622,0.0011152196,0.00032375354,0.00007213004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007820101,0.0015609295,0.008845721,0.00017024031,0.00045988295,0.0036142922,0.019507375,0.06556434,0.011139355,0.24372797,0.12481074,0.5205209],"study_design_scores_gemma":[0.00055664225,0.0002340048,0.0026849436,0.000040432682,0.000008019204,0.00046594287,0.000042727013,0.95314026,0.0013328269,0.027197298,0.01372137,0.00057556323],"about_ca_topic_score_codex":0.00027619695,"about_ca_topic_score_gemma":0.000024967165,"teacher_disagreement_score":0.88757586,"about_ca_system_score_codex":0.0000579758,"about_ca_system_score_gemma":0.00016546776,"threshold_uncertainty_score":0.99996704},"labels":[],"label_agreement":null},{"id":"W2158368387","doi":"10.1109/isit.2011.6034165","title":"Entanglement boosts quantum turbo codes","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Turbo code; Convolutional code; Computer science; Serial concatenated convolutional codes; Quantum entanglement; Qubit; Algorithm; Theoretical computer science; Turbo equalizer; Encoder; Concatenated error correction code; Quantum; Physics; Block code; Decoding methods; Quantum mechanics","score_opus":0.022572010019600304,"score_gpt":0.2264586579894923,"score_spread":0.203886647969892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158368387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16330399,0.0001764842,0.7988933,0.0008487515,0.0010735875,0.0001933292,0.000002256275,0.00086053053,0.034647785],"genre_scores_gemma":[0.8583348,0.000004353952,0.1406517,0.00062818616,0.00006510595,0.000004103926,8.262209e-7,0.0000068560353,0.00030408383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895066,0.000038601498,0.0001710144,0.00032718363,0.00020439323,0.00030813942],"domain_scores_gemma":[0.9993171,0.000032911976,0.000047524398,0.00046353886,0.00003360496,0.00010532216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017660255,0.00013131915,0.000118565295,0.00006804621,0.00011164024,0.000070123824,0.0007795557,0.00003152522,0.00015645639],"category_scores_gemma":[0.000008223955,0.000098368,0.0000626989,0.0001793197,0.000030503674,0.00012407597,0.00033738764,0.00010588642,0.00013266817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008649386,0.000333004,0.0015645295,0.000018640409,0.000055970555,0.00012823532,0.006756197,0.000112256195,0.0008455956,0.66234696,0.006840102,0.32098985],"study_design_scores_gemma":[0.00047417075,0.00047919093,0.011324507,0.00004207783,0.000008604585,0.000105950065,0.000105445746,0.8805753,0.030129643,0.061106075,0.014986559,0.00066247594],"about_ca_topic_score_codex":0.0001004431,"about_ca_topic_score_gemma":0.000009072062,"teacher_disagreement_score":0.88046306,"about_ca_system_score_codex":0.000014347171,"about_ca_system_score_gemma":0.000026109572,"threshold_uncertainty_score":0.40113306},"labels":[],"label_agreement":null},{"id":"W2159803357","doi":"10.1109/ismvl.2012.43","title":"Optimal Quantum Circuits of Three Qubits","year":2012,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Realization (probability); Heuristic; Electronic circuit; Qubit; Computer science; Template; Quantum; Matching (statistics); Quantum gate; Quantum circuit; Algorithm; Function (biology); Quantum computer; Topology (electrical circuits); Mathematics; Quantum error correction; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.01989111598013838,"score_gpt":0.23952278469983057,"score_spread":0.2196316687196922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159803357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35634166,0.00019775436,0.6406071,0.00022038685,0.0004261606,0.000049004335,6.833096e-7,0.00012724307,0.0020299777],"genre_scores_gemma":[0.923682,0.0000014398923,0.075992785,0.00009974954,0.00015114855,0.0000014602302,4.1483673e-7,0.000006408942,0.00006462571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989794,0.000028018738,0.00019151818,0.0001867146,0.00023554084,0.00037882416],"domain_scores_gemma":[0.9992458,0.00008250764,0.00007267833,0.0004269338,0.00004651708,0.00012556059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029138048,0.00011253541,0.00015500822,0.00007485001,0.00006534787,0.00003136187,0.00065822277,0.00004375657,0.000023701245],"category_scores_gemma":[0.000022017419,0.000087150176,0.0000720186,0.0002832311,0.000036403195,0.00023601047,0.00027041943,0.00011439226,0.000048679285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026244804,0.00035207192,0.010237455,0.000047129455,0.00005099493,0.00000683867,0.002316516,0.006889658,0.0036689804,0.6824881,0.0016318638,0.2923078],"study_design_scores_gemma":[0.00023890106,0.00012154051,0.032868393,0.00002488498,0.0000050447234,0.00006046004,0.0000158346,0.95545995,0.0060672346,0.002898807,0.0019754316,0.0002634964],"about_ca_topic_score_codex":0.000028224702,"about_ca_topic_score_gemma":0.0000018884418,"teacher_disagreement_score":0.9485703,"about_ca_system_score_codex":0.000007346939,"about_ca_system_score_gemma":0.000029900064,"threshold_uncertainty_score":0.3553881},"labels":[],"label_agreement":null},{"id":"W2159862444","doi":"10.1109/sfcs.2000.892140","title":"Fast parallel circuits for the quantum Fourier transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":157,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Upper and lower bounds; Binary logarithm; Mathematics; Log-log plot; Bounded function; Quantum Fourier transform; Circuit complexity; Polynomial; Fourier transform; Combinatorics; Omega; Constant (computer programming); Discrete mathematics; Quantum computer; Electronic circuit; Quantum; Physics; Mathematical analysis; Quantum mechanics; Quantum gate; Computer science","score_opus":0.023529212379354496,"score_gpt":0.23009554840661184,"score_spread":0.20656633602725735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159862444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007546039,0.0003247902,0.97831583,0.016054427,0.0004469147,0.0003110302,0.0000025217687,0.00022379549,0.003566099],"genre_scores_gemma":[0.8284865,0.00006856753,0.16163695,0.003179295,0.0005844973,0.000092629925,0.0000014614229,0.00003148829,0.005918608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890405,0.000018934168,0.00017510253,0.00030722134,0.00021248906,0.00038218574],"domain_scores_gemma":[0.9990509,0.00030067164,0.000036710142,0.0004934922,0.000041874042,0.00007633999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021072148,0.00014313018,0.00012495863,0.000040278945,0.00037922143,0.00017728335,0.0009979896,0.000044509354,0.000054108692],"category_scores_gemma":[0.00001643504,0.00008259255,0.0001431664,0.00021775179,0.000043436266,0.00012956445,0.00006404461,0.00014062019,0.00004926702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.224615e-7,0.00004012659,0.0000058401783,0.000007700365,0.000020817433,0.0000028483353,0.0011585533,0.0039967457,0.000016611095,0.088806435,0.0077191168,0.8982243],"study_design_scores_gemma":[0.00030787548,0.00008364907,0.00011057611,0.000005944775,0.0000047770486,0.000026173184,0.000020580052,0.9381272,0.000052068466,0.010086883,0.05103168,0.00014254847],"about_ca_topic_score_codex":0.000012077435,"about_ca_topic_score_gemma":0.000007031758,"teacher_disagreement_score":0.9341305,"about_ca_system_score_codex":0.000009085444,"about_ca_system_score_gemma":0.000011996749,"threshold_uncertainty_score":0.33680266},"labels":[],"label_agreement":null},{"id":"W2161027938","doi":"10.1126/science.1229957","title":"Universal Computation by Multiparticle Quantum Walk","year":2013,"lang":"en","type":"article","venue":"Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":462,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Quantum computer; Quantum algorithm; Quantum; Physics; Quantum process; Random walk; Statistical physics; Quantum mechanics; Quantum dynamics; Mathematics","score_opus":0.006411721936112148,"score_gpt":0.22430744527063423,"score_spread":0.2178957233345221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161027938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57961744,0.000036239377,0.41828683,0.0012262075,0.00029726292,0.000093017065,6.733143e-7,0.00016822829,0.0002740876],"genre_scores_gemma":[0.95164716,0.0000011082905,0.048031196,0.00023978563,0.00002411363,0.000001673665,5.797786e-7,0.0000029945395,0.00005138583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985901,0.000031978325,0.00012818746,0.00042820728,0.00041183145,0.00040970335],"domain_scores_gemma":[0.9992894,0.00006383592,0.000055464374,0.00029091546,0.0001258264,0.00017457422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028911195,0.00009714711,0.00008086049,0.000095795,0.00037417622,0.00040529453,0.001055463,0.000021154572,0.000016267191],"category_scores_gemma":[0.000041814492,0.0000823347,0.000026917933,0.0009676372,0.00028849283,0.0009410629,0.00022745824,0.000104470564,0.00026131226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022317265,0.00015721584,0.0022304994,0.000010745569,0.0000072562607,0.000013069647,0.0028092288,0.03274566,0.11859842,0.018249817,0.00538821,0.8197876],"study_design_scores_gemma":[0.00013859037,0.00005339928,0.014052994,0.000005899683,6.067921e-7,0.000008528444,0.00003540979,0.9758905,0.0041915476,0.0050980267,0.000399993,0.00012448977],"about_ca_topic_score_codex":0.00016462979,"about_ca_topic_score_gemma":0.0000015665605,"teacher_disagreement_score":0.94314486,"about_ca_system_score_codex":0.000030069054,"about_ca_system_score_gemma":0.000092402945,"threshold_uncertainty_score":0.39082643},"labels":[],"label_agreement":null},{"id":"W2161495039","doi":"10.13001/1081-3810.1563","title":"When can perfect state transfer occur?","year":2012,"lang":"en","type":"preprint","venue":"Electronic Journal of Linear Algebra","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Valency; Combinatorics; Adjacency matrix; Spectral radius; Mathematics; Transfer (computing); State (computer science); Discrete mathematics; Graph; Eigenvalues and eigenvectors; Physics; Computer science; Algorithm; Quantum mechanics","score_opus":0.010034022107578323,"score_gpt":0.23605967423593877,"score_spread":0.22602565212836045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161495039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3777509,0.008321949,0.609058,0.0027609998,0.0017154203,0.00020137982,0.000012114913,0.000101601836,0.00007761798],"genre_scores_gemma":[0.98038507,0.00048115588,0.016661158,0.00037457424,0.0018703078,0.0000031940253,0.0000059613217,0.00005824365,0.00016032564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961461,0.00034464552,0.0009047913,0.00047443225,0.00077066896,0.0013593605],"domain_scores_gemma":[0.9980003,0.00015672679,0.00047098575,0.0007589215,0.00028260445,0.0003304385],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001795611,0.0005058394,0.00078967644,0.00035004792,0.00016250223,0.00022187525,0.002458966,0.00023539126,0.000033445158],"category_scores_gemma":[0.000044997996,0.00040861525,0.0006175171,0.00022745163,0.00006214046,0.00020110508,0.00059418293,0.0042263656,0.000018851137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038979194,0.0016790273,0.0011496186,0.0010077653,0.0049005384,0.00082618755,0.056051467,0.12242328,0.0029396855,0.06564934,0.0060155736,0.73696774],"study_design_scores_gemma":[0.0049305297,0.004356159,0.0020702495,0.0017236705,0.0006811872,0.0057679643,0.000080168036,0.48855877,0.0144858705,0.40695557,0.066080116,0.0043097525],"about_ca_topic_score_codex":0.000046664707,"about_ca_topic_score_gemma":0.000025231866,"teacher_disagreement_score":0.73265797,"about_ca_system_score_codex":0.0002899687,"about_ca_system_score_gemma":0.0020622618,"threshold_uncertainty_score":0.99983656},"labels":[],"label_agreement":null},{"id":"W2161982050","doi":"10.1109/pacrim.2007.4313212","title":"ESOP-based Toffoli Gate Cascade Generation","year":2007,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Toffoli gate; Cascade; Computer science; Logic gate; Metric (unit); Heuristic; Algorithm; Quantum gate; Arithmetic; Parallel computing; Qubit; Mathematics; Artificial intelligence; Engineering; Quantum","score_opus":0.015498121006900298,"score_gpt":0.24830261107100723,"score_spread":0.23280449006410694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161982050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11920009,0.000042793665,0.8768281,0.0012034776,0.00039695227,0.000056676337,3.12098e-7,0.00026908488,0.0020025398],"genre_scores_gemma":[0.75056016,5.9920933e-7,0.24736863,0.0014689298,0.00031560802,9.431956e-7,0.000002047216,0.000005657184,0.00027743587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990531,0.00002437153,0.00016060409,0.00027746995,0.00019904702,0.0002853727],"domain_scores_gemma":[0.9994229,0.00007476617,0.000040156436,0.00032948467,0.00003861776,0.00009407502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040613944,0.000101582635,0.00008160316,0.00009192688,0.00013875325,0.000111955495,0.00037484,0.000045897075,0.000015915599],"category_scores_gemma":[0.000017521928,0.00008050396,0.000050082,0.00026987088,0.000017903263,0.00009168657,0.00007680712,0.00010542674,0.00004859706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005846648,0.00012220336,0.00026134422,0.000011985212,0.000016074677,0.00014356792,0.0006099926,0.093134135,0.017314285,0.07215138,0.0052057877,0.8110234],"study_design_scores_gemma":[0.00016092721,0.00004319526,0.0008366484,0.000003881947,0.0000011529281,0.000015425461,0.000002094827,0.95426416,0.03839446,0.0005113083,0.0056414553,0.00012531005],"about_ca_topic_score_codex":0.000041216685,"about_ca_topic_score_gemma":0.000030202027,"teacher_disagreement_score":0.86113,"about_ca_system_score_codex":0.000018953971,"about_ca_system_score_gemma":0.000039110328,"threshold_uncertainty_score":0.3282856},"labels":[],"label_agreement":null},{"id":"W2163733821","doi":"10.1103/physreva.72.062317","title":"Experimental implementation of a discrete-time quantum random walk on an NMR quantum-information processor","year":2005,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":288,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Quantum; Computer science; Random walk; Quantum information processing; Quantum computer; Mathematics; Physics; Quantum mechanics; Statistics","score_opus":0.009489225218598603,"score_gpt":0.32216454686688695,"score_spread":0.3126753216482883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163733821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9347597,0.0028045462,0.057128593,0.0033061283,0.00010579254,0.0013138651,0.000017910155,0.00026012433,0.00030338272],"genre_scores_gemma":[0.9957894,0.000106076935,0.0030110301,0.00083660707,0.00016808648,0.000054715765,0.000021985397,0.000008845066,0.0000032502542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984898,0.00012135477,0.00042986975,0.00026738105,0.0004416057,0.00025001442],"domain_scores_gemma":[0.9990788,0.00008384228,0.00027132468,0.0003893095,0.00006985496,0.00010685465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028842702,0.00019462024,0.0003967035,0.000057283676,0.000095172356,0.00006930064,0.00050465873,0.000017763665,0.000020622909],"category_scores_gemma":[0.000031329993,0.00014316269,0.00015879379,0.00029743617,0.000032061867,0.00090239925,0.00010662292,0.00012542676,0.00010653848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010249243,0.0010310796,0.000011744682,0.0010469722,0.00005235323,0.000002399924,0.0067780665,0.0021585706,0.008625488,0.08892027,0.0010192648,0.8902513],"study_design_scores_gemma":[0.0011982624,0.0010543561,0.00021696191,0.00066835264,0.000021497088,0.000007000654,0.000050209404,0.9693761,0.021549765,0.0020375897,0.0035293696,0.00029056903],"about_ca_topic_score_codex":0.000017601902,"about_ca_topic_score_gemma":6.1215434e-7,"teacher_disagreement_score":0.9672175,"about_ca_system_score_codex":0.00003408101,"about_ca_system_score_gemma":0.000052525156,"threshold_uncertainty_score":0.58380055},"labels":[],"label_agreement":null},{"id":"W2163815507","doi":"10.1098/rsta.2011.0494","title":"Key ideas in quantum error correction","year":2012,"lang":"en","type":"article","venue":"Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantum error correction; Computer science; Quantum computer; Quantum algorithm; Quantum; Quantum information; Quantum capacity; Quantum network; Error detection and correction; Theoretical computer science; Algorithm; Quantum mechanics; Physics","score_opus":0.015909119043278703,"score_gpt":0.2384315508358385,"score_spread":0.2225224317925598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163815507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4501008,0.00007897922,0.5457972,0.0033721325,0.00036594106,0.000092675065,0.0000011429674,0.000077714474,0.000113388254],"genre_scores_gemma":[0.9869097,0.0000021573012,0.01291026,0.000039487484,0.000115938055,0.000007421897,4.976562e-8,0.00000491291,0.000010110596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989734,0.000032156368,0.00018856971,0.00019678155,0.00030685365,0.00030218842],"domain_scores_gemma":[0.99934113,0.00033317244,0.000038996437,0.00016791148,0.000014285194,0.000104494466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034514393,0.00013011465,0.00020351978,0.000028276072,0.00019112651,0.000038416372,0.00042762628,0.000050997136,0.0000028237478],"category_scores_gemma":[0.00005032408,0.00008162887,0.00019934034,0.0005424926,0.00027070806,0.00018620296,0.000060701397,0.0003292686,0.0000025504403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003694079,0.000895306,0.00014737756,0.00023144252,0.0000374196,3.578052e-7,0.0052105905,0.5689925,0.0006632376,0.41901496,0.000023308703,0.004779828],"study_design_scores_gemma":[0.00007369606,0.00004357796,0.001384037,0.00006627107,0.0000075446,0.0000057884213,0.000024476569,0.89358413,0.00020386396,0.10449906,0.00000993403,0.00009763998],"about_ca_topic_score_codex":0.000010424062,"about_ca_topic_score_gemma":1.6174431e-7,"teacher_disagreement_score":0.53680885,"about_ca_system_score_codex":0.000015842243,"about_ca_system_score_gemma":0.000014625974,"threshold_uncertainty_score":0.33287287},"labels":[],"label_agreement":null},{"id":"W2164396666","doi":"10.1109/pacrim.2007.4313211","title":"Improved Implementation of a Reed-Muller Spectra Based Reversible Synthesis Algorithm","year":2007,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Toffoli gate; Benchmark (surveying); Computer science; Algorithm; Logic gate; High-level synthesis; Reversible computing; Logic synthesis; Parallel computing; Field-programmable gate array; Embedded system; Quantum gate; Quantum computer","score_opus":0.00856759322229172,"score_gpt":0.2546782899852704,"score_spread":0.2461106967629787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164396666","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017018108,0.000021297492,0.98086345,0.0006329036,0.00019531499,0.00015614077,0.000004176287,0.00015716338,0.0009514169],"genre_scores_gemma":[0.30660257,0.0000013053798,0.6930407,0.00020222897,0.00006831432,0.000002588359,0.0000013502462,0.000008090987,0.00007281187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868447,0.00003723955,0.00032931336,0.00033940678,0.00025890986,0.00035065768],"domain_scores_gemma":[0.9989897,0.00025397475,0.00014027495,0.00043921894,0.00008558616,0.00009125202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007545749,0.00013885266,0.00017691629,0.00020390919,0.00009340193,0.000046011588,0.0005203594,0.00004824052,0.00011165471],"category_scores_gemma":[0.000021941469,0.00011890729,0.0001047377,0.000509425,0.000031430573,0.00012972935,0.00011895817,0.00010646594,0.000007734438],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071271793,0.000074623924,0.00020189116,0.000022157918,0.000027618626,0.000014138964,0.000295147,0.00017664568,0.012005499,0.002305718,0.00053057104,0.9843389],"study_design_scores_gemma":[0.00041119015,0.00015043456,0.0032386882,0.000020245056,0.000008948416,0.000009270928,0.00012684021,0.72745556,0.2672726,0.00045600225,0.00065713277,0.00019311756],"about_ca_topic_score_codex":0.0003479702,"about_ca_topic_score_gemma":0.00005212954,"teacher_disagreement_score":0.98414576,"about_ca_system_score_codex":0.000034942346,"about_ca_system_score_gemma":0.00008631114,"threshold_uncertainty_score":0.48488984},"labels":[],"label_agreement":null},{"id":"W2164790530","doi":"10.1016/j.aop.2007.10.001","title":"Quantum Graphical Models and Belief Propagation","year":2007,"lang":"en","type":"article","venue":"Annals of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Factor graph; Graphical model; Belief propagation; Quantum probability; Quantum algorithm; Bayesian network; Quantum error correction; Quantum phase estimation algorithm; Generalization; Quantum process","score_opus":0.038530898892773606,"score_gpt":0.2905968121309278,"score_spread":0.2520659132381542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164790530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3097658,0.000107471176,0.6891704,0.0006612285,0.00005578869,0.000045863784,9.001569e-7,0.00004368586,0.00014886833],"genre_scores_gemma":[0.9865659,0.000023453016,0.0130152255,0.00027798285,0.00010553858,6.0412407e-7,0.0000010460909,0.0000050390286,0.0000052101914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992304,0.000018808732,0.00015946632,0.00019709556,0.00019935559,0.00019489763],"domain_scores_gemma":[0.99946564,0.000062754945,0.000081981394,0.00021872058,0.0001062919,0.000064588385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003383575,0.00008488065,0.000117411844,0.00004495639,0.00006867487,0.000029792212,0.00023130701,0.00003424096,1.9151733e-7],"category_scores_gemma":[0.0000093385715,0.00007275094,0.000048799062,0.00027692041,0.00006179667,0.00020403275,0.000117113734,0.000106350875,0.0000010469597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044476747,0.000080082995,0.000061089486,0.000020437104,0.000010801763,0.000003511717,0.0006312316,0.0033402464,0.0011819121,0.7100015,0.00010207362,0.28456262],"study_design_scores_gemma":[0.00006322514,0.00009392622,0.0011978847,0.000017906354,0.0000012887303,0.0000029000803,0.000004551666,0.62928575,0.011206094,0.35797116,0.000078721394,0.000076574936],"about_ca_topic_score_codex":0.000012332205,"about_ca_topic_score_gemma":7.3363543e-7,"teacher_disagreement_score":0.67680013,"about_ca_system_score_codex":0.0000012640228,"about_ca_system_score_gemma":0.000016727383,"threshold_uncertainty_score":0.29666972},"labels":[],"label_agreement":null},{"id":"W2164928349","doi":"10.4230/lipics.tqc.2013.270","title":"The Quantum Entropy Cone of Stabiliser States","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre for Quantum Technologies; Grantová Agentura České Republiky; National Science Foundation; National University of Singapore; National Research Foundation; European Commission; Banff International Research Station for Mathematical Innovation and Discovery; Leverhulme Trust","keywords":"Stabiliser; Von Neumann entropy; Subadditivity; Inequality; Mathematics; Quantum relative entropy; Entropy (arrow of time); Monotonic function; Pure mathematics; Quantum; Discrete mathematics; Mathematical analysis; Physics; Quantum mechanics; Quantum discord; Quantum entanglement","score_opus":0.01021544677544756,"score_gpt":0.23883279442805475,"score_spread":0.2286173476526072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164928349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.518744,0.0006764008,0.46781605,0.002008724,0.005403313,0.003263494,0.0011547393,0.00048367144,0.0004495967],"genre_scores_gemma":[0.88057786,0.00076533284,0.11456083,0.0011622738,0.00069277204,0.0005533889,0.0009874095,0.00017304074,0.0005270924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504817,0.0001312633,0.002136161,0.00056459307,0.000940747,0.0011790443],"domain_scores_gemma":[0.99402076,0.000811943,0.0016478762,0.0024223595,0.0008219196,0.00027514694],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011444696,0.00078705885,0.0009733996,0.00025695245,0.00060260465,0.0012388111,0.004289738,0.0004329991,0.000017892244],"category_scores_gemma":[0.00017089483,0.0005320687,0.0006169918,0.00029232036,0.00039254775,0.00059942907,0.0039810548,0.0014388436,0.00007279557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050679396,0.0024572995,0.0041252943,0.012890012,0.003827256,0.000030028172,0.12757072,0.10515206,0.00035069685,0.44228035,0.093169406,0.20764007],"study_design_scores_gemma":[0.0011499783,0.0002648043,0.0002798108,0.00038084114,0.0000385214,0.000021243008,0.0006772132,0.9246588,0.00063332106,0.031707257,0.039511714,0.00067650265],"about_ca_topic_score_codex":0.00009465601,"about_ca_topic_score_gemma":0.000013075174,"teacher_disagreement_score":0.8195067,"about_ca_system_score_codex":0.00011384365,"about_ca_system_score_gemma":0.00029033615,"threshold_uncertainty_score":0.999798},"labels":[],"label_agreement":null},{"id":"W2165985653","doi":"10.26421/qic15.1-2-10","title":"Efficient Clifford+T approximation of single-qubit operators","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity","keywords":"Mathematics; Combinatorics; Sequence (biology); Binary logarithm; Operator (biology); Constant (computer programming); Product (mathematics); Log-log plot; Polynomial; Upper and lower bounds; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.018330658686241803,"score_gpt":0.24170004629605893,"score_spread":0.22336938760981712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165985653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3891773,0.000030946834,0.60971415,0.00021677055,0.00022115775,0.00012078936,0.0000016075654,0.000097252596,0.000420042],"genre_scores_gemma":[0.9603011,0.0000014439989,0.03947201,0.00016726955,0.000025241321,0.0000044167987,0.000022262382,0.0000036609333,0.000002597855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988554,0.000056229128,0.00046328217,0.00013248483,0.00034407832,0.00014848894],"domain_scores_gemma":[0.9991409,0.000048363847,0.0002684244,0.00014910281,0.00028345108,0.00010971043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042437357,0.000120080695,0.00015111972,0.00022326001,0.00009572604,0.00018181477,0.00018829512,0.000052644653,7.796885e-7],"category_scores_gemma":[0.000060280745,0.000106094965,0.0000338366,0.0004068672,0.000041637235,0.00052992854,0.00010338518,0.0000798063,0.000018006629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017153036,0.0000871109,0.00009908888,0.000071296454,0.0000108682325,5.9457744e-7,0.008878926,0.56110466,0.00014786587,0.10064713,0.0002598991,0.32867542],"study_design_scores_gemma":[0.00053569145,0.00020614323,0.0005115544,0.00002643092,0.0000031506033,0.000019152307,0.0002979499,0.993515,0.00039056104,0.0038687154,0.00049822166,0.0001274429],"about_ca_topic_score_codex":0.000015379248,"about_ca_topic_score_gemma":3.7435046e-7,"teacher_disagreement_score":0.5711238,"about_ca_system_score_codex":0.000031307543,"about_ca_system_score_gemma":0.00007033011,"threshold_uncertainty_score":0.4326427},"labels":[],"label_agreement":null},{"id":"W2167662730","doi":"10.48550/arxiv.quant-ph/0211011","title":"The Impossibility of Pseudo-Telepathy Without Quantum Entanglement","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Quantum entanglement; Impossibility; String (physics); Alice and Bob; Quantum; Task (project management); Computer science; Alice (programming language); Quantum pseudo-telepathy; Telepathy; Mathematics; Discrete mathematics; Theoretical physics; Physics; Quantum information science; Quantum mechanics; Engineering","score_opus":0.029208966148314888,"score_gpt":0.2653866253562042,"score_spread":0.23617765920788933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167662730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.957876,0.0010079537,0.036573436,0.00140606,0.002114236,0.0005000612,0.000020293472,0.00024217182,0.0002597424],"genre_scores_gemma":[0.99031574,0.00017149623,0.008767774,0.00014432984,0.00032322822,0.000033178865,0.0000056496033,0.000028293412,0.0002102868],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648315,0.00029602234,0.0008488201,0.0010933933,0.0006456913,0.0006329327],"domain_scores_gemma":[0.9959833,0.0002842054,0.00065489655,0.0027326131,0.0001886236,0.00015633609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010667238,0.00046870808,0.0005529264,0.00009542058,0.0004008502,0.00019966345,0.0031047224,0.00021741693,0.000018229155],"category_scores_gemma":[0.0001084985,0.00031887437,0.0003832104,0.00028802245,0.00024004806,0.00008250043,0.0034900962,0.0010565232,0.00004513115],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000614606,0.0011844484,0.79778117,0.000750287,0.00062241673,0.00012314331,0.009997492,0.0083527705,0.0017397249,0.010639098,0.0027879896,0.16596],"study_design_scores_gemma":[0.0005144821,0.000282624,0.16371359,0.00029201127,0.000040910894,0.000032906846,0.000066127686,0.81468815,0.002520123,0.013429754,0.0036471046,0.0007722334],"about_ca_topic_score_codex":0.00015701867,"about_ca_topic_score_gemma":0.000022768583,"teacher_disagreement_score":0.8063354,"about_ca_system_score_codex":0.00009319121,"about_ca_system_score_gemma":0.00017119109,"threshold_uncertainty_score":0.9999263},"labels":[],"label_agreement":null},{"id":"W2167737470","doi":"10.1142/s0219749906002006","title":"DISCRETE TIME QUANTUM WALK ON A LINE WITH TWO PARTICLES","year":2006,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Quantum entanglement; Separable space; Statistical physics; Line (geometry); State (computer science); Discrete time and continuous time; Quantum; Point (geometry); Degrees of freedom (physics and chemistry); Physics; Computer science; Quantum mechanics; Mathematics; Quantum computer; Algorithm; Mathematical analysis; Statistics","score_opus":0.007107631333922469,"score_gpt":0.24543788159188898,"score_spread":0.2383302502579665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167737470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38077173,0.00002428397,0.61389136,0.00399968,0.00063284265,0.00006739488,0.000008303012,0.000058663405,0.00054577005],"genre_scores_gemma":[0.985264,0.0000048682377,0.013785927,0.00046122435,0.00044721438,0.0000010061742,0.000014068225,0.000005605795,0.00001608396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980804,0.000047999987,0.00066452695,0.000100752295,0.0009086735,0.00019767476],"domain_scores_gemma":[0.99835306,0.000119903416,0.0007183975,0.00017852623,0.00055701094,0.00007312027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040322964,0.00015480601,0.00017333194,0.00034929544,0.000081094404,0.00039039744,0.00083785603,0.000034330686,0.0000146390785],"category_scores_gemma":[0.000050173192,0.00010644869,0.000101198326,0.00020342565,0.000040187493,0.0017135774,0.00006673641,0.0002402576,0.000100832985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046709875,0.0001831348,0.0005190489,0.000012875813,0.00014317918,0.00012919762,0.0009424033,0.6518651,0.00039035812,0.19685669,0.001580258,0.14691064],"study_design_scores_gemma":[0.001107194,0.0007486244,0.0028844525,0.00013120328,0.000007235983,0.00044655026,0.00001820997,0.9751395,0.0012155962,0.015620033,0.0025291333,0.00015224582],"about_ca_topic_score_codex":0.00004394146,"about_ca_topic_score_gemma":0.000003354911,"teacher_disagreement_score":0.6044923,"about_ca_system_score_codex":0.00005532741,"about_ca_system_score_gemma":0.000093702765,"threshold_uncertainty_score":0.43408516},"labels":[],"label_agreement":null},{"id":"W2168431435","doi":"10.1016/j.tcs.2009.08.031","title":"Theory of one-tape linear-time Turing machines","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Time hierarchy theorem; Turing machine; Probabilistic Turing machine; Non-deterministic Turing machine; DTIME; NSPACE; Super-recursive algorithm; Computer science; Nondeterministic algorithm; Time complexity; Universal Turing machine; NP; Description number; Theoretical computer science; PSPACE; Complexity class; Algorithm; Computational complexity theory; Computation","score_opus":0.007599579880102563,"score_gpt":0.23473991430566515,"score_spread":0.22714033442556258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168431435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13028891,0.00004959446,0.86567825,0.0011379513,0.00031112286,0.00010871369,0.0000011021721,0.00027868216,0.0021456892],"genre_scores_gemma":[0.6878503,0.0000014735474,0.3114457,0.00049432693,0.00018997861,5.7225157e-7,3.162231e-7,0.0000052747687,0.000012031472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731386,0.00016748914,0.00037917812,0.00074063556,0.00077585917,0.00062295597],"domain_scores_gemma":[0.9980854,0.00038288135,0.0001201856,0.0009899217,0.00017293534,0.00024869715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019548412,0.00023394742,0.00033557278,0.0002479138,0.00034389898,0.00019843224,0.003227566,0.000057205994,0.000034490196],"category_scores_gemma":[0.00011527127,0.00018259199,0.00011747001,0.0012205463,0.0015756272,0.00036103613,0.0008812558,0.00029577984,0.000050361665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007636224,0.00008128109,0.000007732903,0.000004846202,0.0000034721604,0.000006597757,0.00033678283,0.0018518532,0.003313643,0.7334092,0.000006153233,0.26097077],"study_design_scores_gemma":[0.00012775183,0.00029252388,0.0015316501,0.000047983398,0.0000033717442,0.00003176261,7.441423e-7,0.6660359,0.007536235,0.32420403,0.00001558677,0.00017247316],"about_ca_topic_score_codex":0.0000011095801,"about_ca_topic_score_gemma":3.436932e-8,"teacher_disagreement_score":0.66418403,"about_ca_system_score_codex":0.000022256878,"about_ca_system_score_gemma":0.000099621844,"threshold_uncertainty_score":0.7445885},"labels":[],"label_agreement":null},{"id":"W2168814002","doi":"10.4086/toc.2011.v007a002","title":"","year":2011,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Industry Canada; Mitacs; Government of Canada","keywords":"Permutation (music); Mathematics; Reduction (mathematics); Combinatorics; Discrete mathematics; Quantum","score_opus":0.023316422373446794,"score_gpt":0.22486341839625787,"score_spread":0.20154699602281106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168814002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49188843,0.00006582377,0.5067546,0.00003635975,0.00022491014,0.00008158597,2.945853e-7,0.00032662612,0.0006213798],"genre_scores_gemma":[0.69207764,9.832673e-7,0.3076641,0.00016887826,0.00006984307,7.3656065e-7,2.5769518e-7,0.000012711197,0.000004881927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698555,0.0005563237,0.0007328911,0.00063673663,0.00039873781,0.0006897404],"domain_scores_gemma":[0.9972757,0.00073723623,0.000488305,0.0011511523,0.00016855451,0.00017903316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002793173,0.00031247325,0.00048723214,0.00027020855,0.0003420535,0.00005494975,0.002935171,0.000075154516,0.0000049727464],"category_scores_gemma":[0.00012886172,0.00027730843,0.00021633225,0.0007581153,0.00025103675,0.00034988474,0.0013425977,0.0003282753,0.0000031407608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035386765,0.00017121466,0.0016152846,0.000034514316,0.000049712125,0.000030928637,0.047798153,0.0041538705,0.0015177361,0.6457277,0.0000024604049,0.29886305],"study_design_scores_gemma":[0.0006127246,0.00040093606,0.046008922,0.00014492427,0.000010749598,0.00013667729,0.00032461327,0.5474607,0.03115196,0.37332612,0.0000078473195,0.00041384678],"about_ca_topic_score_codex":0.000036238187,"about_ca_topic_score_gemma":7.5942677e-7,"teacher_disagreement_score":0.54330677,"about_ca_system_score_codex":0.000014086105,"about_ca_system_score_gemma":0.00006158232,"threshold_uncertainty_score":0.99996793},"labels":[],"label_agreement":null},{"id":"W2168875157","doi":"10.1063/1.4939783","title":"Protected gates for topological quantum field theories","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institute for Quantum Information and Matter, California Institute of Technology; Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; Natural Sciences and Engineering Research Council of Canada; European Commission; Army Research Office; Technische Universität München; Gordon and Betty Moore Foundation; National Science Foundation","keywords":"Topological quantum computer; Locality; Mathematics; Anyon; Topology (electrical circuits); Quantum gate; Quantum computer; Physics; Quantum; Quantum mechanics; Combinatorics","score_opus":0.01631743618890839,"score_gpt":0.26484142044081765,"score_spread":0.24852398425190927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168875157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03173571,0.000025268815,0.96037406,0.0074124276,0.00018022516,0.00011695608,0.0000011417702,0.000038699574,0.000115505645],"genre_scores_gemma":[0.75499266,0.000003988752,0.24411693,0.00027053044,0.0005483254,0.0000054970897,5.5512956e-8,0.00000863973,0.000053362306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904674,0.000050810224,0.00034578406,0.00012036708,0.00023003154,0.00020628775],"domain_scores_gemma":[0.9976136,0.0016672913,0.00023767471,0.0002051837,0.00017489643,0.000101324185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003978352,0.00011138856,0.0002683795,0.000027434136,0.00007670974,0.00006251183,0.0005650076,0.000052658743,0.000015070773],"category_scores_gemma":[0.0009659252,0.000052374846,0.0001816755,0.000104330735,0.00006612894,0.00016514686,0.000102000944,0.00014244432,0.00000826807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020883848,0.000115783805,0.000004821789,0.000036036687,0.000022934126,0.000006839003,0.00020119801,0.000023615761,0.0021638365,0.94524163,0.00034328233,0.05181912],"study_design_scores_gemma":[0.00032238907,0.00061954255,0.000018481513,0.00014387268,0.000007514983,0.00006411058,0.000009771924,0.0336801,0.009041001,0.95569646,0.00030463346,0.000092121394],"about_ca_topic_score_codex":1.3623938e-7,"about_ca_topic_score_gemma":2.104936e-8,"teacher_disagreement_score":0.72325695,"about_ca_system_score_codex":0.000011913563,"about_ca_system_score_gemma":0.000050244587,"threshold_uncertainty_score":0.21357843},"labels":[],"label_agreement":null},{"id":"W2169081722","doi":"10.1207/s15516709cog0000_59","title":"Is the Brain a Quantum Computer?","year":2006,"lang":"en","type":"article","venue":"Cognitive Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Francis Crick Institute","keywords":"Computer science; Quantum; Cognitive science; Neuroscience; Psychology; Physics; Quantum mechanics","score_opus":0.012572659270447735,"score_gpt":0.257944763613778,"score_spread":0.24537210434333026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169081722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16417743,0.00009632097,0.82052433,0.011937266,0.0006352827,0.00018472853,0.000005135404,0.00020936562,0.002230139],"genre_scores_gemma":[0.9811393,0.0000010641734,0.013161268,0.005203947,0.00030821018,0.000006834701,7.6360686e-7,0.00000641468,0.00017219345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978345,0.00007842317,0.0001910873,0.00070357363,0.00063804083,0.0005543894],"domain_scores_gemma":[0.99855983,0.000517786,0.00009566618,0.0004668252,0.00026790687,0.00009197622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009631255,0.00016766842,0.00012561656,0.00014776232,0.0010135559,0.00062467175,0.0020312779,0.00002795409,0.0000082069655],"category_scores_gemma":[0.00010303878,0.00010867817,0.000079333855,0.0018121918,0.0010243763,0.00038107907,0.00075028016,0.00022254085,0.00012222567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075772205,0.00021945726,0.0012867986,0.00001540983,0.000015959233,0.000088743094,0.00393204,0.001288426,0.0040167375,0.32564995,0.019318668,0.6441603],"study_design_scores_gemma":[0.00022117028,0.000098206954,0.033744205,0.000048206017,0.0000028213196,0.00007326108,0.000033226428,0.93294626,0.0028745136,0.026639327,0.0030960746,0.00022273998],"about_ca_topic_score_codex":0.000057457277,"about_ca_topic_score_gemma":0.0000033993579,"teacher_disagreement_score":0.9316578,"about_ca_system_score_codex":0.000024873923,"about_ca_system_score_gemma":0.0002021434,"threshold_uncertainty_score":0.77955556},"labels":[],"label_agreement":null},{"id":"W2169147494","doi":"10.1088/1367-2630/14/1/013024","title":"Improved error-scaling for adiabatic quantum evolutions","year":2012,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Adiabatic process; Physics; Quadratic growth; Scaling; Quadratic equation; Qubit; Statistical physics; Quantum; Mathematical proof; Adiabatic quantum computation; Quantum mechanics; Reduction (mathematics); Quantum computer; Algorithm; Computer science; Mathematics","score_opus":0.023444336614647517,"score_gpt":0.27122633472349067,"score_spread":0.24778199810884316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169147494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037903637,0.0005347562,0.9594278,0.0006349886,0.001367408,0.00007421767,0.0000017237048,0.000027812366,0.000027654007],"genre_scores_gemma":[0.75414246,0.000003644543,0.24305065,0.00013206128,0.0026227245,8.598777e-7,4.3019753e-7,0.000011155857,0.000036021454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903345,0.00003298071,0.0002965323,0.000099648205,0.00019138082,0.00034600165],"domain_scores_gemma":[0.9989244,0.00017700801,0.000314575,0.00020920091,0.00014117219,0.00023367463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032447508,0.00011491556,0.00019954468,0.000055040957,0.00014575612,0.0000650567,0.00051554537,0.000035768033,0.000001611773],"category_scores_gemma":[0.00006481751,0.000093136456,0.00020801662,0.00022118365,0.000019765828,0.0004436447,0.000073779556,0.00023100238,0.0000037623574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027797803,0.0005116219,0.00044324077,0.00007925433,0.00019864964,0.0000044490544,0.0067105885,0.03444856,0.012168616,0.14660388,0.009929696,0.7888737],"study_design_scores_gemma":[0.0005663653,0.00020918426,0.00055770203,0.00006124033,0.000029694047,0.00006637813,0.000031470456,0.9584026,0.0014186054,0.035182912,0.0033163135,0.0001575712],"about_ca_topic_score_codex":0.0000070175684,"about_ca_topic_score_gemma":3.6133846e-7,"teacher_disagreement_score":0.923954,"about_ca_system_score_codex":0.000034633704,"about_ca_system_score_gemma":0.0001723895,"threshold_uncertainty_score":0.37979946},"labels":[],"label_agreement":null},{"id":"W2172327981","doi":"10.1109/pacrim.2015.7334819","title":"Line reduction in reversible circuits using KFDDs","year":2015,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reduction (mathematics); Node (physics); Qubit; Computer science; Electronic circuit; Quantum computer; Topology (electrical circuits); Line (geometry); Reversible computing; Dissipation; Algorithm; Quantum; Mathematics; Electrical engineering; Physics; Quantum mechanics; Engineering; Combinatorics","score_opus":0.0513653367716979,"score_gpt":0.276675821729582,"score_spread":0.22531048495788408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172327981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39007473,0.00007652443,0.6060465,0.0007486442,0.00070691056,0.000060994567,1.631783e-7,0.0001463287,0.0021392351],"genre_scores_gemma":[0.87030584,0.0000013433049,0.12910832,0.0000965769,0.00017055208,5.4571245e-7,4.8954536e-7,0.00000462146,0.00031173916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992498,0.000040580315,0.00012980147,0.00023626121,0.00015776437,0.00018578592],"domain_scores_gemma":[0.99957514,0.000012266847,0.00003385043,0.00024668925,0.000048450405,0.00008362768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032306567,0.00007230395,0.00008948026,0.00013494414,0.000044659668,0.000060995393,0.000302361,0.000036795605,0.0000031299992],"category_scores_gemma":[0.00002530429,0.00006395925,0.000022488966,0.0005602779,0.000015533149,0.00020392898,0.00014332663,0.00011971517,0.000015870542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075898943,0.00026500976,0.0011307431,0.000029205927,0.000017450157,0.00011279695,0.0062572183,0.5232139,0.010122961,0.023875717,0.0038131569,0.43115425],"study_design_scores_gemma":[0.00024689842,0.00004938491,0.00016498026,0.000021336356,9.111749e-7,0.000098105505,0.000038890845,0.9919092,0.0015276318,0.005140725,0.0006970655,0.000104885075],"about_ca_topic_score_codex":0.00015506637,"about_ca_topic_score_gemma":0.000005046602,"teacher_disagreement_score":0.4802311,"about_ca_system_score_codex":0.000053188895,"about_ca_system_score_gemma":0.000090000554,"threshold_uncertainty_score":0.26081824},"labels":[],"label_agreement":null},{"id":"W2183090941","doi":"","title":"Algorithm for Quantum Simulation","year":2009,"lang":"en","type":"article","venue":"Arab Journal of Basic and Applied Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Oracle; Adiabatic quantum computation; Hamiltonian (control theory); Computer science; Quantum; Algorithm; Mathematics; Theoretical computer science; Quantum computer; Applied mathematics; Statistical physics; Mathematical optimization; Physics; Quantum mechanics","score_opus":0.016746812731431564,"score_gpt":0.26676470008007747,"score_spread":0.2500178873486459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183090941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10764469,0.00022749962,0.8905075,0.0011724913,0.0001815518,0.00006847762,5.176949e-7,0.000017055883,0.00018017215],"genre_scores_gemma":[0.74938256,0.000008463941,0.25007704,0.00036968157,0.00015500606,3.7359095e-7,7.505175e-8,0.0000014176209,0.0000054071375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990829,0.00001631978,0.0002562624,0.0001853279,0.00026382727,0.00019535665],"domain_scores_gemma":[0.99932396,0.00022838685,0.00021890811,0.000083785235,0.00006440086,0.00008057251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085911126,0.000089595305,0.00016242507,0.000120105266,0.00032610924,0.00018106251,0.00045270062,0.00002692306,7.744632e-7],"category_scores_gemma":[0.000019614961,0.000062015075,0.000055267414,0.00027553964,0.00009783747,0.000228985,0.0000311247,0.00010276622,6.904754e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034557702,0.000024385066,0.00000774833,0.0000017936908,0.0000034794145,0.000001719183,0.00028918963,0.030046795,0.0004063412,0.029307073,0.000055944638,0.93985206],"study_design_scores_gemma":[0.0003020903,0.00046727087,0.00075613963,0.000017746721,0.00000422959,0.000044122145,0.000048699927,0.90099555,0.00055847643,0.09603702,0.00067888043,0.00008977248],"about_ca_topic_score_codex":3.9016402e-7,"about_ca_topic_score_gemma":6.606946e-8,"teacher_disagreement_score":0.9397623,"about_ca_system_score_codex":0.0000061164346,"about_ca_system_score_gemma":0.0000607367,"threshold_uncertainty_score":0.2528901},"labels":[],"label_agreement":null},{"id":"W2184665873","doi":"10.1007/978-3-319-24318-4_9","title":"Constructing SAT Filters with a Quantum Annealer","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; Constraint satisfaction problem; Context (archaeology); Filter (signal processing); Constraint satisfaction; Flexibility (engineering); Bloom filter; Algorithm; Constraint (computer-aided design); Set (abstract data type); Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.019629166364344086,"score_gpt":0.2389272044149647,"score_spread":0.21929803805062062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184665873","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077154464,0.00051365566,0.9913925,0.00112943,0.0018726452,0.00037103746,0.000010281426,0.00037483155,0.003564067],"genre_scores_gemma":[0.18202604,0.000008290063,0.81536627,0.0011904076,0.0009317822,0.0000077254845,0.0000136966855,0.000087924265,0.0003678524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946477,0.000056203913,0.00058537786,0.0020956,0.0015302779,0.0010848396],"domain_scores_gemma":[0.9965534,0.00046407417,0.00044326554,0.0017082131,0.0004336178,0.00039740308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010622381,0.00082731305,0.00078725425,0.0009202385,0.00035023718,0.00081156124,0.0036879848,0.0003241359,0.000016844966],"category_scores_gemma":[0.00008581063,0.00064952904,0.00013745477,0.00089175085,0.0012930855,0.00049969775,0.0016548961,0.001426958,0.00005429639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015464479,0.000025404599,0.00016430809,0.000056138117,0.00002486105,0.0004561046,0.0012198454,0.123603046,0.000018130264,0.02753614,0.000084615116,0.8467959],"study_design_scores_gemma":[0.00048363578,0.00040454522,0.000031975596,0.00057633384,0.0000101548885,0.0006985292,9.599078e-7,0.9149971,0.00012139628,0.08019399,0.0015363916,0.0009450024],"about_ca_topic_score_codex":0.000033908873,"about_ca_topic_score_gemma":0.00006772178,"teacher_disagreement_score":0.84585094,"about_ca_system_score_codex":0.0003975479,"about_ca_system_score_gemma":0.0011227627,"threshold_uncertainty_score":0.9995956},"labels":[],"label_agreement":null},{"id":"W2186949523","doi":"10.1063/1.4935433","title":"Algorithms for SU(<i>n</i>) boson realizations and D-functions","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Canadian Institute for Advanced Research; University of Calgary","funders":"","keywords":"Boson; Factorization; Construct (python library); Basis (linear algebra); Matrix (chemical analysis); Standard basis; Algebra over a field","score_opus":0.041800611397121754,"score_gpt":0.28694672054017345,"score_spread":0.24514610914305168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186949523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061784037,0.00007356036,0.9917501,0.0013677204,0.0002363332,0.00007760931,0.0000030799113,0.000027241196,0.00028593195],"genre_scores_gemma":[0.07029069,0.0000076663855,0.92845,0.00019140066,0.0008830447,0.0000041670687,0.0000013237963,0.000017596522,0.00015414684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991828,0.000030591913,0.00029233252,0.000104282175,0.00024840795,0.00014158238],"domain_scores_gemma":[0.99888206,0.0002820242,0.00019034362,0.00016729013,0.00029253517,0.00018576438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004346106,0.00008964432,0.00020492144,0.000041682124,0.00008702038,0.0001251953,0.0002570231,0.000033721346,7.5626843e-7],"category_scores_gemma":[0.00022254912,0.000065771565,0.00008597053,0.00017688995,0.000040155785,0.00021261218,0.000079389014,0.00013802902,0.0000039268034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018348097,0.0006207184,0.000050599392,0.00013725046,0.000110341745,0.00001674441,0.0035436265,0.013044379,0.0002118878,0.78863674,0.018250918,0.17535843],"study_design_scores_gemma":[0.00032563196,0.00019826803,0.000010120722,0.000038621856,0.000016019361,0.000116303396,0.00003864762,0.509409,0.00011812058,0.48747137,0.0021909175,0.00006693956],"about_ca_topic_score_codex":5.751414e-7,"about_ca_topic_score_gemma":6.010228e-8,"teacher_disagreement_score":0.49636465,"about_ca_system_score_codex":0.000017752789,"about_ca_system_score_gemma":0.000080807054,"threshold_uncertainty_score":0.26820865},"labels":[],"label_agreement":null},{"id":"W2187345578","doi":"","title":"QBoost: Large Scale Classifier Training with Adiabatic Quantum Optimization.","year":2012,"lang":"en","type":"article","venue":"Asian Conference on Machine Learning","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Boosting (machine learning); Computer science; Classifier (UML); Optimization problem; Quantum; Binary number; Adiabatic process; Artificial intelligence; Machine learning; Binary classification; Quantum computer; Algorithm; Mathematical optimization; Mathematics; Support vector machine; Physics","score_opus":0.020714410835956237,"score_gpt":0.24313440044441673,"score_spread":0.2224199896084605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187345578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018897124,0.00010435632,0.9611607,0.00264102,0.00029299097,0.00016662815,0.0000036534507,0.00046049536,0.016273027],"genre_scores_gemma":[0.90604216,0.0000061212745,0.09287961,0.00037909698,0.00018527782,0.000010684312,0.00001627682,0.000032798693,0.00044794573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776137,0.00025838576,0.00025380906,0.0004846645,0.00039700474,0.00084476516],"domain_scores_gemma":[0.9988805,0.00011993373,0.00018471132,0.0004419298,0.00007421758,0.00029871578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052989624,0.00031000297,0.00030109572,0.00019100179,0.0005390395,0.00029201325,0.0006211895,0.0000897426,0.00013790252],"category_scores_gemma":[0.0000770916,0.00024437407,0.000069090915,0.000454922,0.000059723683,0.00042568933,0.00016341731,0.0008740062,0.000084941545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004393175,0.00038409754,0.021457495,0.000060103826,0.00010246091,0.000053291533,0.040990375,0.3603008,0.00010133693,0.17906033,0.00013183914,0.39731395],"study_design_scores_gemma":[0.00048723893,0.0002914848,0.0030752462,0.0001221589,0.000010021262,0.000059425598,0.000502088,0.9922229,0.000018106197,0.00024760855,0.002600272,0.00036344604],"about_ca_topic_score_codex":0.000012461418,"about_ca_topic_score_gemma":0.0000092444925,"teacher_disagreement_score":0.88714504,"about_ca_system_score_codex":0.000028767106,"about_ca_system_score_gemma":0.0001148962,"threshold_uncertainty_score":0.9965285},"labels":[],"label_agreement":null},{"id":"W2192515608","doi":"10.1103/physreva.96.062336","title":"Multiqubit Clifford groups are unitary 3-designs","year":2017,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Deutsche Forschungsgemeinschaft; Government of Canada","keywords":"Unitary group; Unitary state; Clifford algebra; Dimension (graph theory); Pure mathematics; Mathematics; Group (periodic table); Algebra over a field; Special unitary group; Quantum computer; Quantum; Quantum mechanics; Physics; Mathematical physics","score_opus":0.03343235252658291,"score_gpt":0.3680474721133176,"score_spread":0.33461511958673473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2192515608","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44270894,0.24290413,0.23340179,0.06209024,0.0021352048,0.0069510518,0.00010667583,0.0019765089,0.007725475],"genre_scores_gemma":[0.8904549,0.086933784,0.008343367,0.011468339,0.0022943586,0.00025809646,0.00002234307,0.00010440794,0.00012043371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534595,0.0005027316,0.00074677967,0.0013837157,0.001028984,0.0009918455],"domain_scores_gemma":[0.99381506,0.00060136116,0.0009683499,0.0037500185,0.00026429928,0.00060092617],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00076071447,0.0007765557,0.0020415985,0.000057496487,0.0009124991,0.00034641605,0.004433564,0.000060332604,0.000013206148],"category_scores_gemma":[0.0014288935,0.00057229504,0.0012219017,0.00054491137,0.00031166765,0.00075029786,0.0015887625,0.0010548467,0.00081220997],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016346416,0.0025671776,0.0005470092,0.015710331,0.00022828342,0.00028991175,0.00033308013,0.00007513954,0.004096907,0.104003675,0.018188333,0.8539438],"study_design_scores_gemma":[0.0015658737,0.0011874448,0.017519912,0.08565501,0.00086311053,0.000121459525,0.000010189059,0.43947056,0.003880411,0.25085324,0.19475177,0.004121016],"about_ca_topic_score_codex":0.000035329194,"about_ca_topic_score_gemma":0.000004417492,"teacher_disagreement_score":0.8498228,"about_ca_system_score_codex":0.00006646274,"about_ca_system_score_gemma":0.000108618435,"threshold_uncertainty_score":0.9999658},"labels":[],"label_agreement":null},{"id":"W2193371463","doi":"10.1109/ccc.2007.27","title":"Quantum versus Classical Proofs and Advice","year":2007,"lang":"en","type":"article","venue":"Proceedings - IEEE Conference on Computational Complexity/Proceedings","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Advice (programming); Computer science; Quantum; Theoretical computer science; Calculus (dental); Mathematics; Programming language; Quantum mechanics; Physics; Medicine","score_opus":0.05652196306594242,"score_gpt":0.29642468636707164,"score_spread":0.23990272330112922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2193371463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86783135,0.00007168751,0.08893543,0.008597839,0.0014967411,0.00084201805,0.000016678749,0.002006955,0.03020133],"genre_scores_gemma":[0.9019228,0.000007883635,0.096503355,0.00075074745,0.00061892206,0.000025622816,0.000008855427,0.00005116635,0.00011060926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99480814,0.000010971331,0.00085864775,0.0016897785,0.0014260549,0.0012064081],"domain_scores_gemma":[0.9965894,0.00041405566,0.00051864673,0.0001702521,0.0016458855,0.00066171907],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011668367,0.0007516723,0.0006545091,0.0006185535,0.0008958766,0.001382213,0.0015673612,0.0002580606,0.0000225795],"category_scores_gemma":[0.00020215845,0.00072934746,0.0001652171,0.0012451299,0.0005750308,0.0010486126,0.0005605293,0.0010832398,0.00007754733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030806052,0.00022398999,0.00043909665,0.00013161928,0.00005984244,0.000011901162,0.0015742253,0.00015231027,0.00096466346,0.98000985,0.0028083972,0.013316025],"study_design_scores_gemma":[0.001827877,0.0010987667,0.010105153,0.00021643634,0.000023564942,0.00017230706,0.00032230417,0.8023232,0.00064939464,0.18011053,0.0022227631,0.00092768826],"about_ca_topic_score_codex":0.000018466255,"about_ca_topic_score_gemma":0.0000049891146,"teacher_disagreement_score":0.80217093,"about_ca_system_score_codex":0.00016472356,"about_ca_system_score_gemma":0.00017712434,"threshold_uncertainty_score":0.9996545},"labels":[],"label_agreement":null},{"id":"W2195967161","doi":"10.1109/ccc.2009.26","title":"Parallel Approximation of Non-interactive Zero-sum Quantum Games","year":2009,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum; Zero (linguistics); Simple (philosophy); Zero-sum game; Computer science; Class (philosophy); Quantum pseudo-telepathy; Polynomial; State (computer science); Combinatorial game theory; Point (geometry); Space (punctuation); Game theory; Mathematics; Quantum computer; Repeated game; Mathematical economics; Quantum mechanics; Quantum network; Algorithm; Physics; Mathematical analysis; Artificial intelligence","score_opus":0.008533772257750833,"score_gpt":0.24664122018922474,"score_spread":0.2381074479314739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2195967161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06926609,0.000031961597,0.92515916,0.0011881727,0.000176502,0.000113884336,6.3765344e-7,0.00013377103,0.0039298562],"genre_scores_gemma":[0.77771443,0.0000035954438,0.22185288,0.00026016944,0.000035615987,0.0000016127342,0.0000012889495,0.000003311979,0.00012707146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900657,0.000035861798,0.00024068436,0.0002895482,0.00021568994,0.00021162326],"domain_scores_gemma":[0.9992805,0.000073824405,0.0001349299,0.0003776012,0.00007617326,0.00005693259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001497991,0.00012952142,0.00018694447,0.00010311087,0.000059977927,0.00006521266,0.00053429604,0.000041920535,0.000005780964],"category_scores_gemma":[0.000021247424,0.000100517165,0.000084340325,0.00025421166,0.000024872557,0.00024951345,0.00009035256,0.00013213578,0.000018152154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004547679,0.00062080973,0.00018626143,0.00004726328,0.000055909655,0.000020055215,0.0063356343,0.036636952,0.012344512,0.21371831,0.00461899,0.7253698],"study_design_scores_gemma":[0.00022605865,0.00024483094,0.004664029,0.000040409563,0.000002326888,0.000011985867,0.000021565651,0.9590158,0.004448553,0.030978724,0.00021401943,0.00013168246],"about_ca_topic_score_codex":0.000022293672,"about_ca_topic_score_gemma":6.8769305e-7,"teacher_disagreement_score":0.92237884,"about_ca_system_score_codex":0.000012209193,"about_ca_system_score_gemma":0.000029664194,"threshold_uncertainty_score":0.40989712},"labels":[],"label_agreement":null},{"id":"W2201569971","doi":"10.1140/epjd/e2016-60682-y","title":"Small codes for magic state distillation","year":2016,"lang":"en","type":"article","venue":"The European Physical Journal D","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Foundational Questions Institute","keywords":"Distillation; MAGIC (telescope); Transversality; State (computer science); Construct (python library); Code (set theory)","score_opus":0.018444470945449057,"score_gpt":0.23443619736177926,"score_spread":0.2159917264163302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201569971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1731694,0.000020197596,0.82136065,0.0031514477,0.00023078822,0.000063935855,0.0000042043507,0.0000650591,0.0019343367],"genre_scores_gemma":[0.99046355,0.000007235236,0.0073081586,0.00014075288,0.0016878122,3.9594593e-7,2.328453e-7,0.000015340154,0.0003765042],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909097,0.00028465563,0.00013137712,0.00014729997,0.00013253358,0.00021314165],"domain_scores_gemma":[0.99919814,0.00032076004,0.000108018,0.00023219151,0.0000611486,0.000079720114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005313818,0.0000948228,0.00009184668,0.00002225346,0.00023051887,0.00018073608,0.00072542584,0.0000045438574,4.952711e-7],"category_scores_gemma":[0.000044183853,0.00004031328,0.00010417207,0.00008195663,0.000052748823,0.00009107345,0.00015712144,0.0001254944,0.00005633139],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008053461,0.000025134304,0.0000069496095,0.000002260433,0.000012039162,0.0000115833645,0.00045837293,0.0009812122,0.0033144502,0.0039768154,0.0007780766,0.99042505],"study_design_scores_gemma":[0.0013289155,0.00052779185,0.017325778,0.00018376413,0.000022396533,0.00033041977,0.000014509024,0.307375,0.001716746,0.64988077,0.02083745,0.00045643566],"about_ca_topic_score_codex":4.770417e-7,"about_ca_topic_score_gemma":1.9350449e-7,"teacher_disagreement_score":0.9899686,"about_ca_system_score_codex":0.000012293879,"about_ca_system_score_gemma":0.00001377079,"threshold_uncertainty_score":0.1772988},"labels":[],"label_agreement":null},{"id":"W2212184943","doi":"10.1088/1367-2630/17/12/123013","title":"Near-optimal quantum tomography: estimators and bounds","year":2015,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Division of Physics; Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Ministerium für Wissenschaft, Forschung und Kunst Baden-Württemberg; Deutsche Forschungsgemeinschaft","keywords":"Physics; Estimator; Quantum tomography; Quantum; Quantum state; Bayesian probability; Statistical physics; Ideal (ethics); Applied mathematics; Fidelity; Upper and lower bounds; Figure of merit; Tomography; Quantum mechanics; Algorithm; Mathematical analysis; Statistics; Computer science; Mathematics; Optics","score_opus":0.017049998618006705,"score_gpt":0.2498901131111838,"score_spread":0.2328401144931771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212184943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4415514,0.00045944162,0.55673563,0.00063198444,0.00051035546,0.000022054499,4.1172066e-7,0.000028666973,0.000060086673],"genre_scores_gemma":[0.73262876,0.000006601401,0.26654264,0.00014903313,0.0006461997,1.19089925e-7,1.8557718e-7,0.000009807427,0.000016622153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900514,0.000039080405,0.00023769253,0.00014304233,0.00036749494,0.00020756382],"domain_scores_gemma":[0.99902105,0.00005515582,0.00022894968,0.00019484137,0.00014682864,0.0003531564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027233045,0.0001289608,0.00021422688,0.000057600602,0.00009806715,0.00030317146,0.00047757488,0.000034778794,7.1727777e-7],"category_scores_gemma":[0.000029517138,0.00010230457,0.000098573546,0.00032189552,0.000071880524,0.00036929947,0.0001431608,0.0002861474,0.000003346569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051950414,0.00022010089,0.0046333824,0.000027556305,0.00015459748,0.00023925258,0.008360711,0.109381855,0.00036505758,0.05876962,0.018237408,0.7995585],"study_design_scores_gemma":[0.0009524892,0.000743011,0.0015181398,0.0000675632,0.000019618867,0.0005350034,0.00004179623,0.9141448,0.00045110442,0.0740444,0.0072592464,0.00022280664],"about_ca_topic_score_codex":0.000019058543,"about_ca_topic_score_gemma":4.0250382e-7,"teacher_disagreement_score":0.80476296,"about_ca_system_score_codex":0.000014642107,"about_ca_system_score_gemma":0.0003255538,"threshold_uncertainty_score":0.41718593},"labels":[],"label_agreement":null},{"id":"W2212310758","doi":"10.1103/physreva.93.052320","title":"Degeneracy, degree, and heavy tails in quantum annealing","year":2016,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; D-Wave Systems (Canada)","funders":"","keywords":"Quantum annealing; Simulated annealing; Annealing (glass); Quantum; Degeneracy (biology); Hamiltonian (control theory); Qubit; Statistical physics; Physics; Benchmarking; Hamming distance; Quantum mechanics; Mathematics; Computer science; Algorithm; Quantum computer; Mathematical optimization","score_opus":0.021498035482946376,"score_gpt":0.33664497727117865,"score_spread":0.31514694178823227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212310758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6951433,0.21270353,0.07048069,0.019134514,0.00028592304,0.0015027167,0.000017714741,0.0003280476,0.00040358515],"genre_scores_gemma":[0.86000854,0.1304224,0.003922665,0.0047486406,0.0006800802,0.00013669295,0.0000040509008,0.00004907673,0.000027871449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610454,0.0005034442,0.00072501024,0.0011816936,0.00064853125,0.00083677826],"domain_scores_gemma":[0.99711305,0.0009244815,0.00030012347,0.0011185821,0.00012550951,0.0004182421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007817658,0.0005476137,0.001504813,0.00008113337,0.000143596,0.00008961411,0.00115348,0.000041989748,0.0000060875795],"category_scores_gemma":[0.0007438295,0.00033116984,0.00045601782,0.0010856679,0.00016562322,0.00045814813,0.00068169815,0.00046349844,0.0001912009],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009048263,0.00045183848,0.0002719637,0.0036256805,0.000029290515,0.00005200677,0.0001212763,0.000020621652,0.008275218,0.04962911,0.0016310294,0.9358829],"study_design_scores_gemma":[0.0019764572,0.0011492398,0.007239007,0.11695469,0.0002979596,0.0001663094,0.0000051912525,0.534666,0.01602829,0.23292655,0.08523808,0.0033522502],"about_ca_topic_score_codex":0.000028141998,"about_ca_topic_score_gemma":0.0000044933913,"teacher_disagreement_score":0.93253064,"about_ca_system_score_codex":0.000063111016,"about_ca_system_score_gemma":0.0000990404,"threshold_uncertainty_score":0.99991405},"labels":[],"label_agreement":null},{"id":"W2216943393","doi":"10.1007/978-1-84882-409-6_15","title":"The Future of Parallel Computation","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Parallelism (grammar); Unconventional computing; Task parallelism; Quantum computer; Computation; Field (mathematics); Scope (computer science); Parallel processing; Class (philosophy); Process (computing); Data parallelism; Theoretical computer science; Massively parallel; Parallel computing; Distributed computing; Quantum; Artificial intelligence; Algorithm; Mathematics; Programming language","score_opus":0.008541902923211721,"score_gpt":0.22192604676622385,"score_spread":0.21338414384301213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216943393","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000060146044,0.002989964,0.5467594,0.0043322234,0.0008679883,0.00019400426,0.000002361038,0.00019818931,0.44464982],"genre_scores_gemma":[0.0017649105,0.0008999798,0.34553793,0.0010630739,0.0018765212,0.000002550084,0.000018922772,0.00005019934,0.6487859],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988804,0.000017199953,0.0003000431,0.0002998215,0.00033051154,0.00017202632],"domain_scores_gemma":[0.9989837,0.00013414731,0.0002509796,0.00048147998,0.0001016388,0.00004809556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016709499,0.00021541085,0.00023085595,0.00006316931,0.0001770481,0.00009689589,0.0009239548,0.00015054426,0.0000063585935],"category_scores_gemma":[0.0000023419288,0.0001291543,0.00015772422,0.000041413965,0.00005952311,0.000041663763,0.00017448977,0.0003201931,0.000022650696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010263412,0.0000027394335,8.109974e-8,0.0000036103434,0.000010328743,0.0000027974838,0.000035313085,0.0013490702,4.9097395e-7,0.47799692,0.0024165772,0.518181],"study_design_scores_gemma":[0.000108532804,0.00011071863,0.000042178897,0.000049702667,0.000006279093,0.000021481954,0.0000024617154,0.21569861,0.00000413521,0.3850764,0.39867678,0.00020270469],"about_ca_topic_score_codex":0.0000021603546,"about_ca_topic_score_gemma":0.0000058878245,"teacher_disagreement_score":0.51797837,"about_ca_system_score_codex":0.000012481428,"about_ca_system_score_gemma":0.000062685875,"threshold_uncertainty_score":0.526676},"labels":[],"label_agreement":null},{"id":"W2220261014","doi":"","title":"Making Hard Problems Harder","year":2006,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Randomness; Boolean function; Mathematics; Combinatorics; Advice (programming); Function (biology); Discrete mathematics; String (physics); Space (punctuation); Exponential function; Computer science; Statistics; Mathematical analysis","score_opus":0.03360477641972189,"score_gpt":0.27194757508390716,"score_spread":0.23834279866418526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220261014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0717002,0.00023718347,0.9155627,0.005078232,0.0005076333,0.00048247966,0.0000141155715,0.0008463853,0.005571111],"genre_scores_gemma":[0.9258376,0.0000010871321,0.07231485,0.0009933059,0.0003527694,0.000027779288,0.000043972967,0.00002707754,0.00040158434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967229,0.00017910358,0.00047025146,0.0008582953,0.00082576653,0.00094371324],"domain_scores_gemma":[0.9987049,0.00028443366,0.000210858,0.00051410025,0.00019966956,0.000086006934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046304215,0.00036104763,0.00033151542,0.00024349078,0.00065113825,0.00037830073,0.001081758,0.00008010868,0.000054313943],"category_scores_gemma":[0.000022371456,0.00035517808,0.00018822325,0.00082075887,0.00012830424,0.00020026803,0.00029691093,0.00056148955,0.00013828087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013504079,0.00017025408,0.00011902618,0.0000125796805,0.000023682389,0.000008736723,0.000060412196,0.41747752,0.000059973147,0.5749088,0.0032267247,0.0039188303],"study_design_scores_gemma":[0.0004630379,0.00022425732,0.0128183905,0.000029156286,0.0000040064,0.0000545285,0.0000016678412,0.6186252,0.000041846175,0.35360512,0.013822528,0.00031025344],"about_ca_topic_score_codex":0.00006317925,"about_ca_topic_score_gemma":0.0000661796,"teacher_disagreement_score":0.85413736,"about_ca_system_score_codex":0.0002993174,"about_ca_system_score_gemma":0.00040528143,"threshold_uncertainty_score":0.99989},"labels":[],"label_agreement":null},{"id":"W2233795418","doi":"10.1142/s0219749916500453","title":"Convex decomposition of dimension-altering quantum channels","year":2016,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Qutrit; Quantum channel; Qubit; Dimension (graph theory); Channel (broadcasting); Quantum; Convex combination; Extreme point; Quantum capacity; Topology (electrical circuits); Convex optimization; Computer science; Mathematics; Regular polygon; Quantum operation; Physics; Quantum mechanics; Quantum information; Pure mathematics; Combinatorics; Quantum dynamics; Telecommunications; Geometry","score_opus":0.009176143793323165,"score_gpt":0.26306654969552434,"score_spread":0.2538904059022012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233795418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3432239,0.00002821473,0.6518694,0.002133857,0.0026213543,0.000042750482,0.0000054817046,0.000024026704,0.000051035837],"genre_scores_gemma":[0.99097335,0.00003778346,0.008519843,0.000214012,0.00024205388,9.824174e-7,0.00000286356,0.000004779244,0.0000043089626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980581,0.000052156793,0.00091650255,0.00008686339,0.00072767417,0.00015870496],"domain_scores_gemma":[0.9974873,0.00018436967,0.0011103492,0.00016951667,0.0009685031,0.00007996784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055793405,0.00012404694,0.00020873484,0.0004863304,0.0000510494,0.00011809715,0.0009000456,0.00005224521,0.0000151559],"category_scores_gemma":[0.00013132615,0.0000826531,0.00014191636,0.00014636849,0.00004400529,0.0024627617,0.00017276967,0.000120386976,0.000025027497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033878256,0.00024816536,0.0010067514,0.00007670094,0.00038689934,0.000069427944,0.0051212246,0.023088573,0.05363554,0.302521,0.0017612802,0.61174566],"study_design_scores_gemma":[0.0017732786,0.00055867224,0.0035650153,0.0008159057,0.000011519102,0.00088651996,0.0000640495,0.9337757,0.032672714,0.021431832,0.0041838507,0.00026091587],"about_ca_topic_score_codex":0.000008656428,"about_ca_topic_score_gemma":1.6576766e-7,"teacher_disagreement_score":0.91068715,"about_ca_system_score_codex":0.00007425662,"about_ca_system_score_gemma":0.00008720772,"threshold_uncertainty_score":0.33704957},"labels":[],"label_agreement":null},{"id":"W2234450295","doi":"10.1103/physrevx.8.021050","title":"Quantum Boltzmann Machine","year":2018,"lang":"en","type":"article","venue":"Physical Review X","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":344,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; Simon Fraser University; D-Wave Systems (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum; Boltzmann machine; Quantum algorithm; Restricted Boltzmann machine; Boltzmann constant; Open quantum system; Quantum computer; Quantum network","score_opus":0.013742084188025444,"score_gpt":0.2965658911077709,"score_spread":0.2828238069197454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234450295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09306271,0.06172701,0.79648614,0.028816184,0.0019858985,0.0008974124,0.000010669527,0.0015084659,0.015505517],"genre_scores_gemma":[0.97966236,0.0010993276,0.011875059,0.0060611134,0.0011945848,0.000011000535,0.0000020990133,0.000015100844,0.00007936021],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891657,0.000070808725,0.0001572144,0.0003490019,0.00023781513,0.0002685943],"domain_scores_gemma":[0.9990843,0.00007503591,0.000065850654,0.0006012044,0.0000630602,0.00011056934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018495035,0.00014363641,0.00026831953,0.000022996886,0.000120904195,0.00005027675,0.00080267456,0.000012097973,0.000016764772],"category_scores_gemma":[0.0000686751,0.00010107601,0.00013465773,0.00039122233,0.00007021673,0.00010538871,0.00030926778,0.00016202191,0.0007334386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021565334,0.00024996547,0.000029558827,0.00045382176,0.000025598867,0.000019109082,0.0003037673,0.00001601518,0.0005930762,0.46079624,0.0076951575,0.52981555],"study_design_scores_gemma":[0.00010329127,0.00023060731,0.000398507,0.00069952867,0.000012837988,0.000022369104,3.4998604e-7,0.7928676,0.00049898576,0.082662396,0.12225293,0.00025060438],"about_ca_topic_score_codex":0.000009343816,"about_ca_topic_score_gemma":7.904222e-7,"teacher_disagreement_score":0.88659966,"about_ca_system_score_codex":0.000008648086,"about_ca_system_score_gemma":0.00002364466,"threshold_uncertainty_score":0.9427114},"labels":[],"label_agreement":null},{"id":"W2236799098","doi":"10.1007/bfb0109312","title":"Das Zwei-Nucleonen-Problem","year":2007,"lang":"de","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"WiLAN (Canada)","funders":"","keywords":"Art","score_opus":0.025311620305709225,"score_gpt":0.2671887399997865,"score_spread":0.24187711969407727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236799098","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011442953,0.0018175814,0.38161767,0.0013949727,0.0031147054,0.00047301943,0.000021661708,0.0007653523,0.6106806],"genre_scores_gemma":[0.0046525993,0.0006660226,0.58097166,0.004932858,0.005339766,0.000006003255,0.000069216425,0.00033327338,0.40302858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939191,0.000058858706,0.001214861,0.0021018006,0.0012887298,0.0014166455],"domain_scores_gemma":[0.9959975,0.0003572155,0.00058291125,0.0021080752,0.00030058107,0.00065374287],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010206384,0.0012721006,0.0010380477,0.000633712,0.00064588763,0.0007111977,0.002927102,0.0009051165,0.0018345566],"category_scores_gemma":[0.000020096164,0.0011275335,0.00067703583,0.00026612953,0.00037012572,0.00019695137,0.0019400129,0.0019821853,0.008211025],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014141159,0.00003810337,0.000006678394,0.000068864916,0.00014896353,0.00040580565,0.0003248518,0.0006520884,0.00001480646,0.5879634,0.0023821795,0.4079801],"study_design_scores_gemma":[0.00048554616,0.0003797653,0.00006769168,0.00057364436,0.00007786093,0.0002456897,0.000006802328,0.23214857,0.00008744052,0.058992766,0.70525944,0.001674788],"about_ca_topic_score_codex":0.00013505157,"about_ca_topic_score_gemma":0.000034468023,"teacher_disagreement_score":0.7028773,"about_ca_system_score_codex":0.00010465277,"about_ca_system_score_gemma":0.0002161485,"threshold_uncertainty_score":0.9991175},"labels":[],"label_agreement":null},{"id":"W2237131797","doi":"10.1109/tit.2016.2616125","title":"New One Shot Quantum Protocols With Application to Communication Complexity","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Alice and Bob; Quantum entanglement; Randomness; No-teleportation theorem; Communication complexity; Quantum information science; Quantum cryptography; Quantum information; Quantum; Quantum state","score_opus":0.02807333754258406,"score_gpt":0.2720108777424362,"score_spread":0.24393754019985214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237131797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083134096,0.0000015585239,0.9916629,0.003025251,0.0000691762,0.003273863,0.0000139094855,0.00040787645,0.0007141148],"genre_scores_gemma":[0.82353663,0.0000027622493,0.17302698,0.0011562816,0.00003491464,0.002060058,0.0000047253875,0.000013552902,0.00016411739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878734,0.00012308788,0.0003412962,0.00019361528,0.00033495898,0.00021967402],"domain_scores_gemma":[0.99838465,0.00019710498,0.00015834863,0.0009570292,0.00013979455,0.0001630731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044627814,0.00016353994,0.00014494912,0.00023842468,0.00034497998,0.00015465305,0.00078476925,0.000058986454,0.00004235699],"category_scores_gemma":[0.0000072024445,0.00011253935,0.000050940183,0.00047302892,0.000062854575,0.0011565827,0.000008343441,0.00016889867,0.00040072206],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014112954,0.00007722656,0.0000016583027,0.000015587379,0.000020740401,1.0379531e-7,0.001553064,0.013994732,0.00047413245,0.19434611,0.0001837022,0.7891918],"study_design_scores_gemma":[0.0067443266,0.0029584952,0.0021409553,0.0015894008,0.00005436593,0.00010634533,0.00031352934,0.49780482,0.1070987,0.32558897,0.053431954,0.0021681276],"about_ca_topic_score_codex":0.000027698898,"about_ca_topic_score_gemma":0.000012457995,"teacher_disagreement_score":0.82270527,"about_ca_system_score_codex":0.00007774784,"about_ca_system_score_gemma":0.00010174984,"threshold_uncertainty_score":0.5150605},"labels":[],"label_agreement":null},{"id":"W2246882827","doi":"10.1063/1.1499208","title":"Qubits as parafermions","year":2002,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Qubit; Quantum decoherence; Quantum mechanics; Physics; Computer science; Quantum","score_opus":0.02339698899915641,"score_gpt":0.25243084017845224,"score_spread":0.22903385117929584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246882827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07636658,0.0001425524,0.9148576,0.003146577,0.00026709138,0.000049878243,3.047683e-7,0.000049330592,0.005120053],"genre_scores_gemma":[0.8818728,0.000012818989,0.1169574,0.00038528838,0.0005156795,5.3859713e-7,4.7235293e-8,0.000010219832,0.00024525716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896586,0.000041644387,0.00033531402,0.00009718614,0.00038039513,0.0001795741],"domain_scores_gemma":[0.9990608,0.00024367294,0.00021289132,0.00025065607,0.00009768585,0.00013427132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002023435,0.00010111488,0.000232713,0.000037323854,0.00007320573,0.00008603653,0.00061002595,0.00003137933,0.00004517207],"category_scores_gemma":[0.00010709398,0.00007050665,0.00016297732,0.00021496482,0.0000356269,0.00019824316,0.00010245946,0.0002825583,0.00024228699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000235398,0.00070489733,0.0000071694426,0.00004747525,0.00005730881,0.00014488472,0.0020765653,0.003148985,0.0002451069,0.8726904,0.0042826836,0.11659222],"study_design_scores_gemma":[0.00017488487,0.00014074065,0.000022157561,0.00007509192,0.000008842348,0.00042860425,0.0000075716657,0.34916398,0.00038156455,0.6488307,0.00067514036,0.000090684014],"about_ca_topic_score_codex":1.9013157e-7,"about_ca_topic_score_gemma":1.4244806e-8,"teacher_disagreement_score":0.80550617,"about_ca_system_score_codex":0.000012681408,"about_ca_system_score_gemma":0.000018951543,"threshold_uncertainty_score":0.31141898},"labels":[],"label_agreement":null},{"id":"W2248297545","doi":"10.26421/qic18.3-4-2","title":"Adversary lower bounds for the collision and the set equality problems","year":2018,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Army Research Office; National Research Foundation Singapore; National Research Foundation","keywords":"Adversary; Alphabet; Omega; Set (abstract data type); Collision; Upper and lower bounds; Combinatorics; Computer science; Mathematics; Discrete mathematics; Theoretical computer science; Computer security; Programming language; Philosophy; Linguistics","score_opus":0.020944528188935847,"score_gpt":0.27566354963437767,"score_spread":0.25471902144544184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248297545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03795454,0.00043836777,0.95323193,0.005328575,0.0014333681,0.0012997523,0.0000350169,0.0001466171,0.00013180521],"genre_scores_gemma":[0.98315173,0.00022430293,0.014142992,0.0018651463,0.0002705423,0.00014585696,0.00016002073,0.000011868595,0.000027560445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998373,0.00016828404,0.00058098714,0.00029601838,0.0003550265,0.00022668445],"domain_scores_gemma":[0.9978641,0.00080908946,0.0005526071,0.00040650414,0.00030590247,0.00006179807],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00182555,0.00025482575,0.00025960978,0.00010796761,0.00090085267,0.0013051511,0.0005542709,0.00015864415,0.0000012781483],"category_scores_gemma":[0.00009448698,0.00014457451,0.00010773428,0.00018379925,0.00029902847,0.00055683823,0.0009136441,0.00035983312,0.000008759678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003949037,0.00005900398,0.000044848748,0.0011816394,0.0002065978,6.555887e-7,0.03463787,0.34367278,0.0000018079252,0.22525617,0.012464722,0.382079],"study_design_scores_gemma":[0.00096904876,0.00012736092,0.0005894269,0.00009924023,0.000023454799,0.000014972519,0.00014779648,0.910661,0.000003241553,0.07607584,0.011097759,0.0001908614],"about_ca_topic_score_codex":0.000089133675,"about_ca_topic_score_gemma":0.0000039414194,"teacher_disagreement_score":0.94519717,"about_ca_system_score_codex":0.000028910677,"about_ca_system_score_gemma":0.00012355525,"threshold_uncertainty_score":0.9997316},"labels":[],"label_agreement":null},{"id":"W2252841394","doi":"10.48550/arxiv.1409.3208","title":"Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Elitenetzwerk Bayern; Natural Sciences and Engineering Research Council of Canada","keywords":"Centralizer and normalizer; Automorphism; Mathematics; Abelian group; Discrete mathematics; Combinatorics; Group (periodic table); Quadratic equation; Physics; Quantum mechanics","score_opus":0.035174283868301966,"score_gpt":0.1817335688406811,"score_spread":0.14655928497237913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252841394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3535665,0.000163113,0.6440007,0.000108194625,0.0010062306,0.0004229089,0.000029169167,0.00024449982,0.00045865818],"genre_scores_gemma":[0.9962478,0.000018848312,0.0027008662,0.00019902938,0.00024221602,0.000002678902,0.000018667732,0.000026019885,0.000543871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779,0.00017473065,0.00024678503,0.0012133882,0.000117531046,0.00045759778],"domain_scores_gemma":[0.99783546,0.00050679204,0.00028949248,0.00094728917,0.00020577495,0.0002151925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005023678,0.000395464,0.00045929448,0.00026137076,0.0002972683,0.00024138662,0.0012386931,0.00030356238,0.0000033762894],"category_scores_gemma":[0.00005091733,0.00039269347,0.00019837856,0.0002632329,0.00013753609,0.00014034202,0.001826043,0.00051098,0.000017941515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011721311,0.000038450624,0.00035388058,0.00021038728,0.00008747048,0.00006193852,0.00020537448,0.7490207,0.000016069598,0.24767153,0.00033861183,0.0019838894],"study_design_scores_gemma":[0.0005727734,0.00008983359,0.00039021776,0.00019029215,0.00004330341,0.000032856147,0.0000107413425,0.9627881,0.00001535792,0.033161204,0.0022300966,0.0004752185],"about_ca_topic_score_codex":0.000072134826,"about_ca_topic_score_gemma":0.000005026798,"teacher_disagreement_score":0.6426813,"about_ca_system_score_codex":0.000057442398,"about_ca_system_score_gemma":0.00013007945,"threshold_uncertainty_score":0.9998525},"labels":[],"label_agreement":null},{"id":"W2253909748","doi":"10.1038/ncomms10327","title":"Computational multiqubit tunnelling in programmable quantum annealers","year":2016,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":241,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; D-Wave Systems (Canada)","funders":"Air Force Research Laboratory; Intelligence Advanced Research Projects Activity; NIH Office of the Director; Office of the Director of National Intelligence","keywords":"Quantum tunnelling; Qubit; Physics; Quantum; Quantum mechanics; Quantum computer; Quantum annealing; Statistical physics","score_opus":0.018482511952336106,"score_gpt":0.2871501849528571,"score_spread":0.26866767300052097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253909748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11966539,0.0061452906,0.7896132,0.07975777,0.00087928085,0.0008651946,0.000027114811,0.0011699444,0.0018768128],"genre_scores_gemma":[0.76772034,0.00007294922,0.23181954,0.00027659736,0.00003008307,0.000021926484,0.000008568757,0.0000097384145,0.00004027423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986551,0.00016828203,0.00028729203,0.00033655853,0.00022798954,0.00032482005],"domain_scores_gemma":[0.9974566,0.0007260154,0.0001040287,0.0014905982,0.00013706897,0.00008570691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040353235,0.00014739476,0.00015395337,0.00020495972,0.00026970726,0.00010031971,0.002531304,0.00016428674,0.0000034589857],"category_scores_gemma":[0.000121990146,0.000107888554,0.00006964751,0.0007053549,0.00012263322,0.00026315884,0.0006485329,0.00066401705,0.00003489828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001313215,0.00069331785,0.010421931,0.000022174087,0.00005156757,0.00002042148,0.0019476337,0.0820565,0.00079880474,0.539672,0.0024006711,0.36190182],"study_design_scores_gemma":[0.00041728356,0.000028367742,0.0057913396,0.00008929559,0.0000019095435,0.0000151714685,0.000018284649,0.9645581,0.00005052588,0.011781538,0.017061982,0.00018619366],"about_ca_topic_score_codex":0.00001937727,"about_ca_topic_score_gemma":0.000079735306,"teacher_disagreement_score":0.8825016,"about_ca_system_score_codex":0.000062721716,"about_ca_system_score_gemma":0.00009046304,"threshold_uncertainty_score":0.47038347},"labels":[],"label_agreement":null},{"id":"W2255850906","doi":"10.1016/j.laa.2016.05.018","title":"Laplacian state transfer in coronas","year":2016,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Security Agency; National Science Foundation","keywords":"Laplace operator; Vertex (graph theory); Graph; Mathematics; Combinatorics; Laplacian matrix; Transfer (computing); Product (mathematics); Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.011335717376847767,"score_gpt":0.24632515052449594,"score_spread":0.23498943314764817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255850906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07633578,0.0010508976,0.91709447,0.0035948087,0.0002218337,0.0007316182,0.00009732442,0.00022626283,0.00064698415],"genre_scores_gemma":[0.980239,0.00055262534,0.017000014,0.0005712891,0.0005128064,0.0003781877,0.000039139566,0.00003974973,0.0006672035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985244,0.00004714566,0.00030138745,0.0006798117,0.00015866249,0.00028854562],"domain_scores_gemma":[0.99910194,0.000101015816,0.000052436106,0.00056721485,0.000054111148,0.00012330704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015762469,0.00023232798,0.00024920862,0.00014356166,0.00011576187,0.000108245404,0.00072940753,0.00014339128,0.0000076212773],"category_scores_gemma":[0.0000058002647,0.00018706724,0.000064591826,0.00020370564,0.000041580905,0.00007477245,0.00054537563,0.00045494284,0.000050343806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011314468,0.0002725861,0.00032082794,0.0003042426,0.000073864845,0.000019603309,0.003010389,0.0018513389,0.0008006999,0.35507774,0.00032227903,0.6379351],"study_design_scores_gemma":[0.00079445296,0.000070392314,0.0040440704,0.00029387043,0.000016735405,0.000026343645,0.000009860838,0.7222496,0.0013465333,0.1989498,0.07125414,0.0009441656],"about_ca_topic_score_codex":0.000012526933,"about_ca_topic_score_gemma":0.000017731902,"teacher_disagreement_score":0.9039032,"about_ca_system_score_codex":0.000019833704,"about_ca_system_score_gemma":0.00010064714,"threshold_uncertainty_score":0.76283807},"labels":[],"label_agreement":null},{"id":"W2258023100","doi":"10.26421/qic14.9-10-4","title":"Quantum circuits for simple periodic functions","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Toffoli gate; Simple (philosophy); Period (music); Electronic circuit; Conjecture; Function (biology); Periodic function; Quantum; Mathematics; Computer science; Quantum computer; Quantum gate; Discrete mathematics; Topology (electrical circuits); Algorithm; Arithmetic; Combinatorics; Quantum mechanics; Mathematical analysis; Physics","score_opus":0.012034239459380553,"score_gpt":0.24111109293560545,"score_spread":0.2290768534762249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258023100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08818256,0.000027067128,0.90956604,0.000834944,0.0004928184,0.00025220952,0.000008390399,0.00031550648,0.00032043803],"genre_scores_gemma":[0.9892113,0.000004189595,0.009643716,0.00086890114,0.00010679181,0.000030230658,0.0001140781,0.000007187472,0.000013586044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886906,0.00005515464,0.00039685244,0.00021028201,0.00021307773,0.000255592],"domain_scores_gemma":[0.9991053,0.00020142876,0.0001996328,0.00019794563,0.00018704547,0.00010870191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040879787,0.00016018521,0.00016515274,0.00021505155,0.0005469249,0.00048719658,0.00022439109,0.000067174944,0.0000032547389],"category_scores_gemma":[0.0000928661,0.0001500925,0.0000676991,0.00028971917,0.00003910884,0.001077795,0.00007648781,0.000111768524,0.000051156374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005757071,0.000024129375,0.00007881445,0.0000746531,0.000011548925,1.423045e-7,0.0017501406,0.025412956,0.000037156624,0.22951235,0.0019761196,0.7411162],"study_design_scores_gemma":[0.000550482,0.0002275983,0.0024079268,0.000013208558,0.0000056867193,0.000020769723,0.000103393126,0.9313843,0.000018912882,0.029807068,0.03527001,0.00019059183],"about_ca_topic_score_codex":0.000015017726,"about_ca_topic_score_gemma":0.0000015841218,"teacher_disagreement_score":0.9059714,"about_ca_system_score_codex":0.000020407868,"about_ca_system_score_gemma":0.00005002254,"threshold_uncertainty_score":0.6120594},"labels":[],"label_agreement":null},{"id":"W2258815095","doi":"10.37236/5982","title":"Quantum Walks on Generalized Quadrangles","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Conjecture; Mathematics; Intersection (aeronautics); Spectrum (functional analysis); Combinatorics; Matrix (chemical analysis); Order (exchange); Quantum; Random walk; Stochastic matrix; Line (geometry); Discrete mathematics; Pure mathematics; Quantum algorithm; Physics; Quantum mechanics; Geometry","score_opus":0.014372640308647162,"score_gpt":0.2607498908650877,"score_spread":0.24637725055644055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258815095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42038393,0.021305379,0.5220007,0.020256624,0.014224938,0.0005159998,0.000005249027,0.00019882749,0.0011083876],"genre_scores_gemma":[0.9969055,0.0015154016,0.0003786288,0.00022077294,0.0007238757,0.0000038063536,0.0000013678563,0.000038075745,0.00021256994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647576,0.00044932208,0.0007253686,0.00040590105,0.0010309156,0.0009127209],"domain_scores_gemma":[0.99519515,0.0003537359,0.001963298,0.001952237,0.000390203,0.00014538232],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024016427,0.00046646287,0.0007714268,0.00025384268,0.0005899215,0.00062300643,0.007066326,0.00026404296,0.0000027801786],"category_scores_gemma":[0.0002018052,0.00029427712,0.00057069544,0.00018545825,0.000112944406,0.00012988754,0.0012943171,0.004255802,0.000011396668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003818783,0.00016185784,0.000009672042,0.000029840774,0.00021466165,0.0000642119,0.00052721926,0.00972901,0.00003171313,0.9778924,0.001565815,0.009735409],"study_design_scores_gemma":[0.0007284114,0.0007337761,0.0001184259,0.00022451201,0.000053625772,0.0002688573,0.0000073791416,0.09876815,0.0002774381,0.89105695,0.0074339854,0.00032849947],"about_ca_topic_score_codex":0.000027168106,"about_ca_topic_score_gemma":0.0000029358573,"teacher_disagreement_score":0.5765216,"about_ca_system_score_codex":0.00035734946,"about_ca_system_score_gemma":0.0015267449,"threshold_uncertainty_score":0.99995095},"labels":[],"label_agreement":null},{"id":"W2259367099","doi":"10.26421/qic16.11-12-6","title":"Solving constrained quadratic binary problems via quantum adiabatic evolution","year":2016,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mitacs","keywords":"Adiabatic process; Quadratic unconstrained binary optimization; Mathematical optimization; Quadratic programming; Mathematics; Quantum; Quadratic equation; Binary number; A priori and a posteriori; Applied mathematics; Computer science; Quantum computer; Quantum mechanics; Physics","score_opus":0.010566661977210564,"score_gpt":0.23181869628770999,"score_spread":0.22125203431049942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259367099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068649545,0.00038641857,0.92582047,0.0016684093,0.0016294243,0.0008027771,0.000023237715,0.00071280816,0.00030692256],"genre_scores_gemma":[0.9832743,0.000043143496,0.015937882,0.00030697085,0.00016427792,0.00006474045,0.00017557705,0.000021652342,0.00001148781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681616,0.00023755676,0.0012164249,0.00057928846,0.0006183897,0.0005322004],"domain_scores_gemma":[0.9976068,0.00026591078,0.0010165717,0.0005287414,0.00036137935,0.00022059538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007441215,0.00054425205,0.00052160287,0.0006960503,0.00049750274,0.000900455,0.0006591757,0.0003520968,0.000007189014],"category_scores_gemma":[0.000094763534,0.0004655349,0.00016127026,0.00039576963,0.00015237875,0.0016993441,0.0008262686,0.0006258785,0.00008606111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030447507,0.00014555088,0.00017809455,0.002291454,0.00016218165,0.000012356643,0.010009942,0.32004756,0.00032047572,0.23279084,0.00097434025,0.43303674],"study_design_scores_gemma":[0.0005494933,0.00018469131,0.0011503942,0.000663216,0.000020180794,0.00006423869,0.000075720636,0.83208096,0.000013336585,0.1644606,0.0002095296,0.0005276319],"about_ca_topic_score_codex":0.00007144937,"about_ca_topic_score_gemma":0.0000031192112,"teacher_disagreement_score":0.91462475,"about_ca_system_score_codex":0.00019014829,"about_ca_system_score_gemma":0.00040499246,"threshold_uncertainty_score":0.99977964},"labels":[],"label_agreement":null},{"id":"W2261490368","doi":"10.1109/tit.2018.2865701","title":"Energy, Latency, and Reliability Tradeoffs in Coding Circuits","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Omega; Scaling; Energy (signal processing); Combinatorics; Probability of error; Mathematics; Computation; Block (permutation group theory); Discrete mathematics; Physics; Algorithm; Quantum mechanics; Statistics; Geometry","score_opus":0.009392919158752048,"score_gpt":0.22056353697268588,"score_spread":0.21117061781393384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261490368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009351601,0.000035595076,0.98651606,0.0004330897,0.0015565549,0.00019485828,0.000031957752,0.0002651089,0.0016151731],"genre_scores_gemma":[0.98991066,0.000102947284,0.009175423,0.0006654606,0.000056091005,0.000039711904,0.000006743284,0.000009970067,0.00003300075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826163,0.00024258574,0.00057100086,0.0003615116,0.0002901352,0.00027316247],"domain_scores_gemma":[0.9986057,0.0003309363,0.0002018056,0.000652514,0.000114068025,0.00009495746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010747155,0.0002709681,0.0002598806,0.0004940661,0.00021757025,0.00026706333,0.0006029858,0.00027814644,0.000013228715],"category_scores_gemma":[0.000019367802,0.0002586758,0.00010602574,0.00029717688,0.00012854782,0.00079147634,0.000026368798,0.00074558286,0.00002063837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028611159,0.000103906365,0.0000032851096,0.00016249015,0.000028943601,0.0000034461286,0.008788212,0.1649702,0.000008412569,0.020764064,0.000078661,0.8050598],"study_design_scores_gemma":[0.0004358225,0.000115254,0.00020192089,0.00031213491,0.000014202789,0.00003805575,0.00009397693,0.9040337,0.0012234383,0.09180091,0.0012867902,0.00044376962],"about_ca_topic_score_codex":0.00006297382,"about_ca_topic_score_gemma":0.0000048832258,"teacher_disagreement_score":0.98055905,"about_ca_system_score_codex":0.000100057805,"about_ca_system_score_gemma":0.00012907523,"threshold_uncertainty_score":0.9999865},"labels":[],"label_agreement":null},{"id":"W2267486489","doi":"10.1103/physreva.93.062332","title":"Efficient classical simulation of matchgate circuits with generalized inputs and measurements","year":2016,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Industry Canada; Ontario Ministry of Research, Innovation and Science; Government of Canada","keywords":"Electronic circuit; Computer science; Electrical engineering; Engineering","score_opus":0.025735185826584017,"score_gpt":0.3279153577807925,"score_spread":0.3021801719542085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267486489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6610657,0.019483404,0.3123881,0.0051994077,0.00010559535,0.0013539057,0.000011312132,0.0001717776,0.00022079489],"genre_scores_gemma":[0.99166936,0.004888641,0.0018614435,0.0012723473,0.00020487428,0.000055697565,0.0000023206596,0.000029516501,0.000015800557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965862,0.0004111088,0.0005899904,0.000844761,0.0010766755,0.0004912346],"domain_scores_gemma":[0.997584,0.0005148393,0.00043696116,0.0008709224,0.00028473142,0.00030856163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005258382,0.00043541222,0.0012861354,0.0000518224,0.00010307663,0.000039823582,0.00067832036,0.000031528944,0.0000038272033],"category_scores_gemma":[0.00035539738,0.00023470995,0.00033028758,0.00073260226,0.00019354481,0.00013637946,0.0003338712,0.00022450852,0.000051487554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031204672,0.0017645766,0.00035965312,0.009421626,0.00021206633,0.000020564512,0.00027765278,0.006390164,0.08640059,0.017513908,0.0004986258,0.87710935],"study_design_scores_gemma":[0.0018050438,0.00081972906,0.0022407642,0.04392761,0.00040714443,0.000024164072,5.8358756e-7,0.9148978,0.013743351,0.015211506,0.0057810005,0.0011413142],"about_ca_topic_score_codex":0.000003299778,"about_ca_topic_score_gemma":4.2500554e-7,"teacher_disagreement_score":0.90850765,"about_ca_system_score_codex":0.000048614813,"about_ca_system_score_gemma":0.00008064326,"threshold_uncertainty_score":0.9571194},"labels":[],"label_agreement":null},{"id":"W2268604949","doi":"10.1103/physreva.94.052325","title":"Noise tailoring for scalable quantum computation via randomized compiling","year":2016,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":558,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Scalability; Computation; Computer science; Noise (video); Quantum computer; Randomized controlled trial; Quantum; Algorithm; Physics; Artificial intelligence; Medicine; Quantum mechanics","score_opus":0.016572568320699515,"score_gpt":0.3364970790150388,"score_spread":0.31992451069433925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268604949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026000012,0.028850416,0.93468827,0.006626337,0.00039376438,0.0028805826,0.0000130777935,0.00037285566,0.0001746872],"genre_scores_gemma":[0.91985625,0.03961477,0.032825477,0.004640964,0.0018087501,0.0010451901,0.000029026096,0.00011702289,0.000062576015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995366,0.0006992663,0.0010496345,0.0012032659,0.00080548075,0.0008763556],"domain_scores_gemma":[0.99385935,0.0037621032,0.0006344382,0.000973023,0.00038247905,0.0003886084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016484724,0.0006407538,0.0027365917,0.00007819251,0.000306853,0.00011578839,0.0012669041,0.000042844775,0.000006116928],"category_scores_gemma":[0.0015049219,0.0003838442,0.0015462056,0.00086268445,0.00022537404,0.00049520965,0.00046571612,0.00035449446,0.00030052516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047990124,0.0011375236,0.000013297635,0.011814319,0.00021099686,0.000012608139,0.00016716855,0.000601278,0.025911352,0.106109194,0.0029493107,0.85059303],"study_design_scores_gemma":[0.009762574,0.00019612315,0.000019023402,0.018341301,0.0002533227,0.000009461802,6.248435e-7,0.8232277,0.0027399652,0.13758858,0.0071865064,0.0006748276],"about_ca_topic_score_codex":0.000010675355,"about_ca_topic_score_gemma":4.1793513e-7,"teacher_disagreement_score":0.9018628,"about_ca_system_score_codex":0.00008796397,"about_ca_system_score_gemma":0.000098302364,"threshold_uncertainty_score":0.99986136},"labels":[],"label_agreement":null},{"id":"W2268989311","doi":"10.1103/physreva.92.062309","title":"Reducing the overhead for quantum computation when noise is biased","year":2015,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Army Research Office; Australian Research Council","keywords":"Quantum computer; Gadget; Qubit; Computer science; Quantum error correction; Noise (video); Computation; MAGIC (telescope); Quantum; Algorithm; Topology (electrical circuits); Physics; Quantum mechanics; Engineering; Electrical engineering; Artificial intelligence","score_opus":0.05346745862319183,"score_gpt":0.3348981548878685,"score_spread":0.28143069626467665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268989311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028356377,0.009486842,0.92906237,0.031221641,0.00046399052,0.0009345959,0.000006337208,0.0001997814,0.00026804837],"genre_scores_gemma":[0.9055526,0.00038789932,0.075727515,0.016654171,0.0013877945,0.00014828051,0.000013066539,0.000041613406,0.00008701576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987892,0.00011109567,0.00021031486,0.00034286702,0.00030141522,0.00024512075],"domain_scores_gemma":[0.99881995,0.0003710883,0.00012626265,0.00042784,0.00013479912,0.000120043995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049803813,0.00014583759,0.00027741044,0.00002117082,0.00013342062,0.00010174622,0.0005960132,0.0000149749385,9.260322e-7],"category_scores_gemma":[0.00022044012,0.00008891516,0.00017872588,0.00026858505,0.00003599504,0.00012367827,0.0001583712,0.00014273937,0.00003702116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012477513,0.00030238827,0.000011548021,0.0009195506,0.000049421364,0.000004692776,0.006041313,0.005936868,0.00032039805,0.051897235,0.12654679,0.80795735],"study_design_scores_gemma":[0.00020074839,0.0001146146,0.00005042333,0.0005751557,0.000018564295,0.000005768435,0.0000048173806,0.9017793,0.00012989168,0.076171234,0.020818809,0.00013071176],"about_ca_topic_score_codex":0.000027441427,"about_ca_topic_score_gemma":2.9453693e-7,"teacher_disagreement_score":0.8958424,"about_ca_system_score_codex":0.000025117495,"about_ca_system_score_gemma":0.00008980073,"threshold_uncertainty_score":0.3625855},"labels":[],"label_agreement":null},{"id":"W2271464947","doi":"","title":"Topological Quantum Computation and Protected Gates","year":2015,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Quantum Information and Matter, California Institute of Technology; Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; Natural Sciences and Engineering Research Council of Canada; European Commission; Army Research Office; Technische Universität München; Gordon and Betty Moore Foundation; National Science Foundation","keywords":"Topological quantum computer; Quantum computer; Topology (electrical circuits); Anyon; Quantum algorithm; Topological degeneracy; Topological order; Quantum gate; Mathematics; Theoretical physics; Symmetry protected topological order; Quantum; Physics; Quantum mechanics","score_opus":0.012120792515368321,"score_gpt":0.21964000631440503,"score_spread":0.2075192137990367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2271464947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936505,0.00019283165,0.004200493,0.0010755083,0.00031056127,0.00025924243,0.000006795696,0.00018835286,0.00011569625],"genre_scores_gemma":[0.7411991,0.000110672765,0.18915613,0.000053822936,0.00016089222,0.000001397352,0.00046125878,0.000050686427,0.068806045],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879295,0.000102140846,0.000117590804,0.0004640422,0.00029041254,0.00023284902],"domain_scores_gemma":[0.99914277,0.000048318103,0.00022882203,0.000228063,0.00022986143,0.00012219767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001762761,0.0002164633,0.00035041233,0.00022631299,0.00020360916,0.000060240443,0.0005313724,0.00024442215,0.000008282729],"category_scores_gemma":[0.000020915017,0.00021497654,0.00007607673,0.00026610144,0.000093736955,0.00016079622,0.00018462188,0.00030285586,0.000012303213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050970126,0.0005520941,0.00051244395,0.0016213625,0.0004477023,0.0005799989,0.59208673,0.0062259436,0.007933223,0.023371048,0.006281589,0.35987818],"study_design_scores_gemma":[0.0014395957,0.0009954496,0.012478984,0.00043394227,0.00008473185,0.00004828581,0.034329355,0.9112047,0.00054684206,0.03689227,0.00057766336,0.00096819823],"about_ca_topic_score_codex":0.0049953335,"about_ca_topic_score_gemma":0.0016008258,"teacher_disagreement_score":0.90497875,"about_ca_system_score_codex":0.000029263401,"about_ca_system_score_gemma":0.00009297893,"threshold_uncertainty_score":0.87664884},"labels":[],"label_agreement":null},{"id":"W2272691542","doi":"10.1103/physrevapplied.6.054005","title":"Designing High-Fidelity Single-Shot Three-Qubit Gates: A Machine-Learning Approach","year":2016,"lang":"en","type":"article","venue":"Physical Review Applied","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Calgary","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Mitacs; Gordon and Betty Moore Foundation; University of Calgary; National Science Foundation","keywords":"Scheme (mathematics); Series (stratigraphy); Quantum; Fidelity; Yield (engineering); Quantum computer","score_opus":0.029186681845665495,"score_gpt":0.25938789794694506,"score_spread":0.23020121610127955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272691542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009686616,0.0032132245,0.9819546,0.0010659446,0.0000818113,0.0005816448,0.0000028781947,0.0005609843,0.0028523149],"genre_scores_gemma":[0.90455437,0.00030301654,0.0938283,0.0008447189,0.0003229612,0.00008801052,0.0000059174895,0.000033090237,0.00001964119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975133,0.00015474531,0.0003969568,0.0008777065,0.00048010712,0.0005771792],"domain_scores_gemma":[0.9983086,0.00043818806,0.00023209321,0.00074634404,0.00006311137,0.00021165928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006050315,0.00036306906,0.000664301,0.00004930196,0.00023352818,0.000113081085,0.0010748785,0.0000433505,0.0000103039365],"category_scores_gemma":[0.0001260167,0.00022119157,0.0002080635,0.0005505621,0.00008792667,0.00014431935,0.00050877215,0.000394922,0.00014889054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012812609,0.000479031,0.00006410922,0.00082853634,0.000059951282,0.000009872353,0.00021968142,0.0010197456,0.07486585,0.10912699,0.0002213096,0.8130921],"study_design_scores_gemma":[0.0017342579,0.0004799489,0.00053716777,0.004102764,0.00014440583,0.00004774865,0.0000064413484,0.83841383,0.017881913,0.11908658,0.015506489,0.0020584448],"about_ca_topic_score_codex":0.000014706729,"about_ca_topic_score_gemma":7.328802e-7,"teacher_disagreement_score":0.8948677,"about_ca_system_score_codex":0.00005004404,"about_ca_system_score_gemma":0.000042066622,"threshold_uncertainty_score":0.90199304},"labels":[],"label_agreement":null},{"id":"W2285025258","doi":"10.1109/iscas.2016.7539041","title":"An extension of transformation-based reversible and quantum circuit synthesis","year":2016,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of New Brunswick","funders":"","keywords":"Extension (predicate logic); Transformation (genetics); Computer science; Quantum; Physics; Programming language; Quantum mechanics","score_opus":0.013564144976774665,"score_gpt":0.2224565184527992,"score_spread":0.20889237347602455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285025258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2574246,0.000017691898,0.7410058,0.0011585992,0.000050976247,0.000047016165,0.0000020948428,0.000083717096,0.00020957393],"genre_scores_gemma":[0.9772006,0.0000058080313,0.022651235,0.00011071624,0.000012961001,0.0000015268454,2.0910039e-7,0.0000038839758,0.000013044129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929816,0.000048921243,0.00015411201,0.0002146096,0.00014893967,0.00013527204],"domain_scores_gemma":[0.99923813,0.0002478876,0.00004841556,0.00034238838,0.000052467145,0.00007072958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024496537,0.000078681755,0.0001172133,0.00009630784,0.00007197728,0.000027189664,0.00027907733,0.000033467844,0.0000165976],"category_scores_gemma":[0.000029048297,0.00004689288,0.000034210712,0.00014308916,0.000043140382,0.0002499858,0.000021962693,0.000030958785,0.0000044150993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010000195,0.00010216678,0.00039729715,0.00005692218,0.000010178483,0.0000045069173,0.0006749329,0.0006124662,0.07143359,0.090001896,0.00011048553,0.8365856],"study_design_scores_gemma":[0.00029699033,0.00016165443,0.004220346,0.00012666153,0.000005092278,0.000010289422,0.000018678327,0.927104,0.060307268,0.00736596,0.00023020392,0.00015284923],"about_ca_topic_score_codex":0.00002483863,"about_ca_topic_score_gemma":0.0000020306468,"teacher_disagreement_score":0.92649156,"about_ca_system_score_codex":0.000006551169,"about_ca_system_score_gemma":0.000035049186,"threshold_uncertainty_score":0.1912236},"labels":[],"label_agreement":null},{"id":"W2285050772","doi":"10.48550/arxiv.1204.0891","title":"Efficient quantum communication under collective noise","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universität Innsbruck; Austrian Science Fund; European Commission","keywords":"Noise (video); Quantum; Computer science; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.039090589512197585,"score_gpt":0.18601453346641095,"score_spread":0.14692394395421338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285050772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5405328,0.00007961881,0.45752206,0.0001366953,0.00017071,0.0000791952,0.0000010393547,0.00014367289,0.001334183],"genre_scores_gemma":[0.9963168,0.000008362819,0.0030086897,0.00014908427,0.00004375505,3.3623616e-7,0.0000014512204,0.000008525937,0.00046303184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989562,0.0001677807,0.0001027242,0.00032231596,0.00007479862,0.00037616136],"domain_scores_gemma":[0.9987527,0.00017221514,0.00009030643,0.0007415917,0.000077572295,0.00016561705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000274961,0.00014105247,0.00012935503,0.00013510161,0.0003829999,0.000051238265,0.000869987,0.000062117164,0.000011257682],"category_scores_gemma":[0.000017790997,0.00014344545,0.00008169793,0.000915041,0.000086453896,0.0001692114,0.00045958176,0.00020703227,0.00010569633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008387773,0.00016770897,0.0011848971,0.000003880855,0.000021233334,0.0000068797135,0.0009851246,0.62070704,0.00007630417,0.37611187,0.0001825012,0.0005441761],"study_design_scores_gemma":[0.00030670103,0.00003590385,0.009194901,0.000014412181,0.0000106494645,0.00000956261,0.00011085768,0.9808981,0.000106272666,0.008801966,0.00031888523,0.00019181249],"about_ca_topic_score_codex":0.000041502088,"about_ca_topic_score_gemma":0.0000035819744,"teacher_disagreement_score":0.45578396,"about_ca_system_score_codex":0.00014704386,"about_ca_system_score_gemma":0.00007125528,"threshold_uncertainty_score":0.58495355},"labels":[],"label_agreement":null},{"id":"W2288143239","doi":"10.1515/phys-2019-0087","title":"Quantum Phase Estimation Algorithm for Finding Polynomial Roots","year":2019,"lang":"en","type":"article","venue":"Open Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Electronics and Computer Technology Center; Mahidol University","keywords":"Quantum phase estimation algorithm; Quantum algorithm; Eigenvalues and eigenvectors; Polynomial; Quantum; Quantum computer; Construct (python library); Matrix (chemical analysis); Degree (music)","score_opus":0.02173195568732949,"score_gpt":0.31155115826986834,"score_spread":0.28981920258253885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288143239","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037737824,0.000012328266,0.9597845,0.0002721907,0.00088825094,0.00065133825,0.000018815706,0.00008809078,0.00054662843],"genre_scores_gemma":[0.35202715,7.679044e-7,0.6468457,0.00023333625,0.00041100231,0.000032566328,0.000036595415,0.000024510095,0.00038838154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988672,0.00003124114,0.00018348287,0.00043303746,0.00017399527,0.00031103587],"domain_scores_gemma":[0.9991278,0.00012966996,0.0001320362,0.00048647594,0.000052262913,0.00007173622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023936716,0.00015947975,0.00021933763,0.00003463951,0.00021253712,0.0005803131,0.0012855369,0.00004344522,0.0000066658736],"category_scores_gemma":[0.000010010736,0.00014847901,0.000084841464,0.0002451242,0.000015392545,0.00062265154,0.000520711,0.0001268172,0.000095730546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062173226,0.000114222654,0.000006723093,0.000010443767,0.000013356141,0.000001516478,0.00024171907,0.007496691,0.00063096476,0.011915744,0.0011752101,0.9783872],"study_design_scores_gemma":[0.001487605,0.00024924224,0.000044233653,0.000034882527,0.000005088885,0.0000049682003,0.0000071470636,0.9811459,0.0021766801,0.01101656,0.0036064798,0.00022119477],"about_ca_topic_score_codex":0.000029235161,"about_ca_topic_score_gemma":4.6035896e-7,"teacher_disagreement_score":0.978166,"about_ca_system_score_codex":0.000030302057,"about_ca_system_score_gemma":0.000092677066,"threshold_uncertainty_score":0.60547984},"labels":[],"label_agreement":null},{"id":"W2289263748","doi":"10.1103/physreva.93.022323","title":"Stacked codes: Universal fault-tolerant quantum computation in a two-dimensional layout","year":2016,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Code (set theory); MAGIC (telescope); Universal set; Transversal (combinatorics); Topology (electrical circuits); Algorithm; Mathematics; Set (abstract data type); Physics; Quantum mechanics; Combinatorics","score_opus":0.014131926992403027,"score_gpt":0.34178489974674325,"score_spread":0.32765297275434024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289263748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7750129,0.0265448,0.18052903,0.014447141,0.00043825034,0.0020870212,0.000052138763,0.0005021317,0.00038655786],"genre_scores_gemma":[0.98634,0.0058065956,0.003869146,0.0034009544,0.00041793223,0.00007068181,0.000020943751,0.00004677035,0.000026961063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539304,0.0007545777,0.0008023774,0.0011937621,0.0010463077,0.00080995186],"domain_scores_gemma":[0.9969194,0.0011537827,0.0004107502,0.0008958214,0.00024345507,0.00037680304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006835685,0.00059784134,0.0016087032,0.000109412955,0.00014904329,0.00006834576,0.0011899485,0.000035726363,0.000012381733],"category_scores_gemma":[0.00038765126,0.00037837404,0.0006409205,0.0012728068,0.00019371511,0.00045627926,0.0005622385,0.0005322528,0.0004848676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079491045,0.0040616537,0.00031609315,0.0075298934,0.000211037,0.00037813128,0.0009392611,0.0077093444,0.024925606,0.17430457,0.007633645,0.77191126],"study_design_scores_gemma":[0.0013309607,0.0003133451,0.0006908578,0.025910959,0.00010174479,0.000030233334,0.000003228847,0.914284,0.0006343361,0.04987281,0.0059405747,0.00088694453],"about_ca_topic_score_codex":0.00005017235,"about_ca_topic_score_gemma":0.0000072456323,"teacher_disagreement_score":0.90657467,"about_ca_system_score_codex":0.00012938357,"about_ca_system_score_gemma":0.00020267964,"threshold_uncertainty_score":0.99986684},"labels":[],"label_agreement":null},{"id":"W2293839160","doi":"10.48660/14110183","title":"Interactive Quantum Information Theory","year":2014,"lang":"en","type":"dissertation","venue":"Open MIND","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Theoretical physics; Physics","score_opus":0.010144040581283513,"score_gpt":0.2816470216355064,"score_spread":0.27150298105422294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293839160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30702516,0.00012834425,0.46181107,0.00027455046,0.006587121,0.0014193134,0.000044248947,0.000043815777,0.22266635],"genre_scores_gemma":[0.85614157,0.000011690702,0.12784085,0.00034624242,0.0005339555,0.0000678292,0.0021065397,0.00005441026,0.012896918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874777,0.00013762043,0.0003205658,0.00034072957,0.00023496292,0.00021834148],"domain_scores_gemma":[0.9986845,0.00017038675,0.00039656466,0.00053659314,0.00014081833,0.000071088725],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005305603,0.00024567122,0.0002787831,0.00018245363,0.00015405803,0.0011921547,0.0021512646,0.00015718084,0.00026418437],"category_scores_gemma":[0.000084131454,0.00019887762,0.00011067991,0.00020376343,0.000013527256,0.0010338548,0.00034504113,0.00041754422,0.0011906223],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003656572,0.000018836985,0.0000016620306,0.000011429567,0.0000350383,0.000002730911,0.0059074536,0.0003732385,0.000013191029,0.003444276,0.00049262895,0.98966295],"study_design_scores_gemma":[0.00073549716,0.0004312138,0.001702698,0.0006712511,0.000043478656,0.00003639272,0.0008864,0.76213986,0.0020842275,0.028701726,0.20143344,0.0011338587],"about_ca_topic_score_codex":0.00004069664,"about_ca_topic_score_gemma":0.000019969433,"teacher_disagreement_score":0.9885291,"about_ca_system_score_codex":0.0000386148,"about_ca_system_score_gemma":0.00019696543,"threshold_uncertainty_score":0.99984473},"labels":[],"label_agreement":null},{"id":"W2293881964","doi":"10.5555/982792.982868","title":"Quantum computing","year":2004,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Computer science; Quantum computer; Quantum; Physics; Quantum mechanics","score_opus":0.009554623655394454,"score_gpt":0.245890453918573,"score_spread":0.23633583026317856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293881964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05285592,0.0001782748,0.9282051,0.010167495,0.0021433642,0.00033765702,0.000010978423,0.0012549045,0.0048463275],"genre_scores_gemma":[0.8829164,0.000026100313,0.11456686,0.0015706157,0.00071264233,0.000009536425,0.000011561357,0.000055083616,0.00013121188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690735,0.000094784526,0.00045184174,0.001012464,0.0006729477,0.0008606021],"domain_scores_gemma":[0.99820244,0.00012782573,0.0001759123,0.0011096799,0.00008286308,0.00030127694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003994936,0.00044171145,0.0003725647,0.00023897454,0.0005061428,0.00039241984,0.0016251508,0.00012938726,0.0000066146313],"category_scores_gemma":[0.00002789369,0.0003727763,0.0002357845,0.000717384,0.00011203398,0.000299141,0.0005318402,0.0005195685,0.0002810973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003123253,0.00053568184,0.000104214545,0.00006978251,0.00015286908,0.00054448284,0.004544119,0.34350997,0.005445219,0.5304529,0.0008775337,0.11373196],"study_design_scores_gemma":[0.0016461009,0.0008586539,0.00097218103,0.00021933598,0.000013270827,0.00020609907,0.000043714146,0.95305866,0.0057902536,0.031746496,0.004475332,0.00096988963],"about_ca_topic_score_codex":0.00007663171,"about_ca_topic_score_gemma":0.0000020325724,"teacher_disagreement_score":0.8300605,"about_ca_system_score_codex":0.00011459155,"about_ca_system_score_gemma":0.00012844773,"threshold_uncertainty_score":0.99987245},"labels":[],"label_agreement":null},{"id":"W2294556558","doi":"","title":"Decomposition of a linear reversible computer: digital versus analog","year":2010,"lang":"en","type":"article","venue":"Ghent University Academic Bibliography (Ghent University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Vlaamse regering; University of Toronto","keywords":"Mathematics; Group (periodic table); Computation; Finite field; Discrete mathematics; General linear group; Special linear group; Cyclic group; Field (mathematics); Arithmetic; Algebra over a field; Pure mathematics; Algorithm; Symmetric group; Abelian group; Physics","score_opus":0.010335592751618713,"score_gpt":0.2228204900701972,"score_spread":0.21248489731857848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294556558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64908606,0.000061986444,0.343797,0.0006893863,0.001542246,0.00028641612,0.00010031085,0.0004994196,0.0039371434],"genre_scores_gemma":[0.9537774,0.0008303198,0.044759057,0.000083963474,0.00023818792,8.910287e-8,0.00005274277,0.000019515248,0.00023877864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977337,0.000110409455,0.00026642202,0.000783338,0.00054315315,0.0005629702],"domain_scores_gemma":[0.99809736,0.0002535122,0.0003453506,0.00068252557,0.0002441934,0.00037708212],"candidate_categories":["metaepi_narrow","bibliometrics"],"consensus_categories":["bibliometrics"],"category_scores_codex":[0.00022577241,0.00033668178,0.00037522748,0.014894393,0.0005145918,0.00008196119,0.0024832156,0.00037474788,0.000023313736],"category_scores_gemma":[0.000008980118,0.00040302688,0.0005136299,0.021062545,0.00036113476,0.0014636322,0.0011564296,0.0012661307,0.00001999303],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039983653,0.0034624294,0.16812094,0.00062121724,0.0035983399,0.0027991547,0.005847319,0.03976581,0.024449246,0.5363789,0.07085317,0.14010513],"study_design_scores_gemma":[0.014980669,0.0023602087,0.040397845,0.00045769688,0.00053100137,0.00015491362,0.0010569652,0.45634857,0.002491209,0.0030302831,0.4750464,0.003144252],"about_ca_topic_score_codex":0.000097303964,"about_ca_topic_score_gemma":0.000011437492,"teacher_disagreement_score":0.5333486,"about_ca_system_score_codex":0.00005065573,"about_ca_system_score_gemma":0.00010358111,"threshold_uncertainty_score":0.99984217},"labels":[],"label_agreement":null},{"id":"W2295995314","doi":"10.1145/2049697.2049704","title":"QIP = PSPACE","year":2011,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"National Natural Science Foundation of China","keywords":"PSPACE; Quantum complexity theory; Turing machine; Complexity class; Quantum computer; Computer science; Computational complexity theory; Context (archaeology); Model of computation; Mathematics; Theoretical computer science; Quantum; Discrete mathematics; Computation; Algorithm; Quantum mechanics","score_opus":0.026207498746455875,"score_gpt":0.22904413157097595,"score_spread":0.20283663282452008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295995314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.801998,0.00049912196,0.16964483,0.021325143,0.0039780918,0.00006355729,3.459447e-7,0.000046539088,0.0024443285],"genre_scores_gemma":[0.7415545,0.000006566635,0.25743604,0.00055522803,0.00026283978,9.949533e-8,4.452771e-9,0.0000042708334,0.00018046716],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944085,0.00004992838,0.00014560562,0.00006186147,0.00018981818,0.00011192216],"domain_scores_gemma":[0.99875635,0.000047178914,0.0002120175,0.00087626633,0.000059713333,0.00004849713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031071907,0.00005315947,0.000085579144,0.00003873231,0.00007444368,0.000035716115,0.0040728822,0.000019123816,0.000007026169],"category_scores_gemma":[0.00024854668,0.00002744817,0.000115988965,0.00015887506,0.000021921822,0.00010464686,0.000916094,0.00022012697,0.000008917281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092083515,0.0007376834,0.015556764,0.000051126408,0.0004042003,0.0005663557,0.049028505,0.005815134,0.008674812,0.056729425,0.20198259,0.66036135],"study_design_scores_gemma":[0.0012249697,0.0008131933,0.13566165,0.00030832234,0.00004720515,0.0044932244,0.000111256195,0.08555689,0.023723494,0.7019159,0.04564432,0.0004995424],"about_ca_topic_score_codex":0.0000051935685,"about_ca_topic_score_gemma":5.95071e-7,"teacher_disagreement_score":0.6598618,"about_ca_system_score_codex":0.000010328248,"about_ca_system_score_gemma":0.000046447538,"threshold_uncertainty_score":0.7568496},"labels":[],"label_agreement":null},{"id":"W2296851547","doi":"10.1103/physreva.96.012311","title":"Engineering autonomous error correction in stabilizer codes at finite temperature","year":2017,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Unitary state; Stabilizer (aeronautics); Qubit; Code (set theory); Error detection and correction; Protocol (science); String (physics); Toric code; Operator (biology); Computer science; Algorithm; Physics; Quantum computer; Quantum mechanics; Quantum; Engineering; Chemistry; Mechanical engineering","score_opus":0.013083470380089316,"score_gpt":0.32213072537780096,"score_spread":0.30904725499771163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296851547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8888881,0.07605473,0.016912429,0.010670187,0.0022877918,0.003006541,0.000033655466,0.0007626005,0.00138396],"genre_scores_gemma":[0.975591,0.019521737,0.0020170808,0.0017035424,0.00073992903,0.00018933881,0.000015150954,0.000055229204,0.00016701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696004,0.00022464943,0.00056303665,0.0010207088,0.0005621982,0.00066934706],"domain_scores_gemma":[0.996695,0.0006023625,0.0004024091,0.0019016769,0.00012124688,0.00027733363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005553943,0.000541175,0.0014052861,0.0000619126,0.00038156335,0.00022569197,0.001703344,0.000057340156,0.0000120434215],"category_scores_gemma":[0.0016362726,0.00041605707,0.00059373514,0.00049657084,0.00010876438,0.00045878472,0.0009072496,0.0008921006,0.00027685752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056162582,0.0041732006,0.0019153601,0.0326523,0.0002901188,0.0004060151,0.0018866805,0.016833788,0.07546584,0.030874321,0.020880023,0.8145662],"study_design_scores_gemma":[0.00038038832,0.00019964557,0.0052714795,0.019424183,0.000093783296,0.000030599702,0.0000012668692,0.92582,0.0037013332,0.0031077631,0.04104708,0.00092247693],"about_ca_topic_score_codex":0.000029501583,"about_ca_topic_score_gemma":0.000011698498,"teacher_disagreement_score":0.9089862,"about_ca_system_score_codex":0.00016043376,"about_ca_system_score_gemma":0.00008987584,"threshold_uncertainty_score":0.9998291},"labels":[],"label_agreement":null},{"id":"W2302430074","doi":"10.1007/978-3-319-63390-9_1","title":"Verified Compilation of Space-Efficient Reversible Circuits","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Space (punctuation); Electronic circuit; Computer science; Electrical engineering; Engineering; Operating system","score_opus":0.018899072874438205,"score_gpt":0.24428745840054578,"score_spread":0.22538838552610757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2302430074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063834974,0.00035071975,0.9898351,0.00058836996,0.0024089424,0.00036649287,0.00001359657,0.00013681891,0.0056616436],"genre_scores_gemma":[0.6065199,0.000033470416,0.39179766,0.00032171464,0.0006298697,0.0000037930376,0.000010697731,0.000052307652,0.0006306256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960668,0.00004089102,0.00058421853,0.0014722693,0.0011869041,0.00064889726],"domain_scores_gemma":[0.99603605,0.00035683558,0.00077994104,0.0023193157,0.00033169586,0.00017618288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009975069,0.0005298959,0.00071675074,0.00090286793,0.0004920766,0.00042885105,0.004340647,0.00031550837,0.000012421602],"category_scores_gemma":[0.00012223505,0.00049374625,0.00020392856,0.00034853697,0.0008640881,0.00026338166,0.0016151774,0.0008338503,0.000026351603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004043923,0.00004378909,0.00003618527,0.00007934835,0.000015158562,0.000061550956,0.0009581761,0.40777636,0.00047133552,0.020095238,0.000026961608,0.5704318],"study_design_scores_gemma":[0.00031445877,0.00016681376,0.00049963046,0.0007281635,0.000008920622,0.000053892534,1.02674576e-7,0.9513932,0.0024083653,0.04279848,0.0010662177,0.0005617667],"about_ca_topic_score_codex":0.00002877535,"about_ca_topic_score_gemma":0.0000150967235,"teacher_disagreement_score":0.6058815,"about_ca_system_score_codex":0.00018364424,"about_ca_system_score_gemma":0.0006328042,"threshold_uncertainty_score":0.9997514},"labels":[],"label_agreement":null},{"id":"W2308615846","doi":"10.1109/tit.2019.2906374","title":"T-Count Optimization and Reed–Muller Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; List decoding; Upper and lower bounds; Controlled NOT gate; Quantum gate; Power of two; Sequential decoding; Integer (computer science)","score_opus":0.004116110082280556,"score_gpt":0.1944803577710045,"score_spread":0.19036424768872395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308615846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011222727,0.000011070944,0.98583174,0.0002357059,0.00060336624,0.00016922742,0.0000067668,0.0001913093,0.0017280694],"genre_scores_gemma":[0.95624304,0.000022294309,0.042566516,0.00087403925,0.00001850888,0.000011066486,0.0000033890835,0.000006281898,0.00025487907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929386,0.0000549984,0.00020502233,0.00012766792,0.00018013692,0.00013829004],"domain_scores_gemma":[0.9994033,0.00012704574,0.0000775996,0.0002791503,0.00006260469,0.000050273822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031709322,0.000109537075,0.00009619038,0.00019356085,0.00017738188,0.0001769743,0.00020710082,0.00005734677,0.000069129026],"category_scores_gemma":[0.0000034732013,0.00009514352,0.00003965968,0.00020649754,0.000030171672,0.0010625445,0.00000334614,0.00016191309,0.00017498768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013515899,0.000015717129,0.0000021539456,0.000015789816,0.000011274497,1.6845868e-7,0.0013497875,0.88307863,0.00001907326,0.01453369,0.000036941343,0.10092324],"study_design_scores_gemma":[0.00033284535,0.00008717475,0.00005055742,0.00002664577,0.00000401127,0.00001768593,0.000086543376,0.99505,0.0010593251,0.0020028225,0.0011467108,0.00013566331],"about_ca_topic_score_codex":0.000004522134,"about_ca_topic_score_gemma":3.7616115e-7,"teacher_disagreement_score":0.9450203,"about_ca_system_score_codex":0.00002207907,"about_ca_system_score_gemma":0.000027321277,"threshold_uncertainty_score":0.38798404},"labels":[],"label_agreement":null},{"id":"W2312982347","doi":"10.1103/physreva.91.032302","title":"Optimal simulation of Deutsch gates and the Fredkin gate","year":2015,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Australian Research Council; Chinese Academy of Sciences; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Toffoli gate; Qubit; Physics; Quantum gate; Unitary state; Controlled NOT gate; Topology (electrical circuits); Quantum mechanics; Mathematics; Quantum; Combinatorics; Law","score_opus":0.021020238028431296,"score_gpt":0.3035904089854999,"score_spread":0.2825701709570686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312982347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56327486,0.05146267,0.37286654,0.010638526,0.00016603484,0.0007053962,0.0000018986456,0.00012874277,0.0007553442],"genre_scores_gemma":[0.9915664,0.00034290022,0.0076609002,0.00033833308,0.00007768998,0.00000463778,3.662445e-7,0.0000032836701,0.0000054492602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935585,0.00011165529,0.0001280383,0.00014307059,0.00016406295,0.00009731327],"domain_scores_gemma":[0.9992889,0.00028764375,0.00007743201,0.00022984127,0.00006164902,0.000054523996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003539906,0.00007276656,0.00021835662,0.000010229515,0.000032271564,0.000025879675,0.00027067692,0.0000074965733,4.285667e-7],"category_scores_gemma":[0.00015483331,0.000038881393,0.00006109675,0.00017843781,0.00007861836,0.00006392768,0.00017712756,0.00008213819,0.0000059414338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021521126,0.00013154173,0.00004468658,0.00059569156,0.000038133232,0.000004068257,0.002650303,0.50755847,0.000072319395,0.11815833,0.00040172567,0.37032324],"study_design_scores_gemma":[0.00024445434,0.00003957503,0.0001041316,0.00023999564,0.00001116648,0.0000027169904,0.000001789069,0.9835224,0.00006774097,0.013923243,0.001791566,0.000051182105],"about_ca_topic_score_codex":0.000008502448,"about_ca_topic_score_gemma":9.090957e-8,"teacher_disagreement_score":0.475964,"about_ca_system_score_codex":0.0000031819905,"about_ca_system_score_gemma":0.000019580546,"threshold_uncertainty_score":0.15855372},"labels":[],"label_agreement":null},{"id":"W2325659777","doi":"10.1103/physreva.93.032322","title":"Robust surface code topology against sparse fabrication defects in a superconducting-qubit array","year":2016,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Qubit; Fabrication; Superconductivity; Topology (electrical circuits); Surface (topology); Materials science; Physics; Condensed matter physics; Quantum mechanics; Quantum; Mathematics; Combinatorics; Geometry","score_opus":0.0312832335181919,"score_gpt":0.3217265208194181,"score_spread":0.2904432873012262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325659777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8420535,0.04068037,0.09922628,0.014689738,0.00042315098,0.0017130063,0.000017867918,0.00036444803,0.00083166396],"genre_scores_gemma":[0.9399283,0.048345324,0.005987499,0.004830608,0.0006620753,0.00012985096,0.000011010038,0.000055074797,0.000050283015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534863,0.0008516694,0.0008043435,0.0013992976,0.0006499896,0.00094604545],"domain_scores_gemma":[0.99636126,0.0011342101,0.00037956555,0.0015374825,0.00022779604,0.00035966787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008670399,0.00060354755,0.0016408069,0.00007544153,0.00015666426,0.000064594075,0.0015908894,0.00006499613,0.0000134857455],"category_scores_gemma":[0.0015610901,0.00039134693,0.0006328736,0.001445696,0.00022671864,0.0005026596,0.0004485602,0.0006226468,0.00058009545],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001967287,0.0028229093,0.0016386921,0.008271973,0.000121341836,0.0001089302,0.00073131657,0.001073354,0.29867223,0.047754418,0.006080911,0.63270426],"study_design_scores_gemma":[0.0054266904,0.0026000976,0.0092536695,0.16198477,0.0008833871,0.00024835535,0.000040084306,0.27717352,0.13772584,0.21058592,0.18498829,0.009089384],"about_ca_topic_score_codex":0.000025003188,"about_ca_topic_score_gemma":0.0000105714635,"teacher_disagreement_score":0.62361485,"about_ca_system_score_codex":0.00014591265,"about_ca_system_score_gemma":0.0001483028,"threshold_uncertainty_score":0.99985385},"labels":[],"label_agreement":null},{"id":"W2327331630","doi":"10.1103/physrevlett.112.220501","title":"Experimental Realization of a Compressed Quantum Simulation of a 32-Spin Ising Chain","year":2014,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Physics; Qubit; Ising model; Quantum simulator; Quantum phase transition; Realization (probability); Quantum; Quantum mechanics; Spin engineering; Quantum error correction; Spin (aerodynamics); Quantum computer; Statistical physics; Mathematics; Spin polarization; Electron; Thermodynamics","score_opus":0.01586908010045838,"score_gpt":0.303695401916223,"score_spread":0.2878263218157646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2327331630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25502688,0.0007568337,0.7432288,0.00071447465,0.00006123296,0.00015011926,8.749253e-7,0.000036285706,0.000024519568],"genre_scores_gemma":[0.99571425,0.000028427638,0.0026422956,0.0015202953,0.000078147576,0.000003963897,0.0000048316665,0.0000074581467,3.6147654e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989031,0.00017695861,0.00030163373,0.00022339198,0.00026160557,0.000133325],"domain_scores_gemma":[0.9991286,0.0001975601,0.0002588177,0.00033527057,0.000041124425,0.00003864091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020826468,0.00011329326,0.00034038138,0.000040324398,0.00003754983,0.000014279953,0.00031930322,0.0000075016756,0.0000011485042],"category_scores_gemma":[0.00005830393,0.00009583942,0.00012087504,0.00027486624,0.00005048583,0.000108302505,0.00009632103,0.00007012703,0.0000017142162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000825507,0.00035158804,0.00003810139,0.001592265,0.00002631937,0.0000013609524,0.0013836457,0.54109704,0.37387308,0.046980772,0.0002458788,0.034401692],"study_design_scores_gemma":[0.00014423711,0.000077358585,0.00017304593,0.0010508412,0.000007764719,7.0767715e-7,0.0000011706562,0.9876421,0.009950558,0.00042987702,0.00042678733,0.00009552612],"about_ca_topic_score_codex":0.000012771072,"about_ca_topic_score_gemma":6.515839e-8,"teacher_disagreement_score":0.7406874,"about_ca_system_score_codex":0.000011776451,"about_ca_system_score_gemma":0.000008214406,"threshold_uncertainty_score":0.3908218},"labels":[],"label_agreement":null},{"id":"W2329299806","doi":"10.4204/eptcs.158.0","title":"Proceedings 9th Workshop on Quantum Physics and Logic","year":2014,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum logic; Physics; Engineering physics; Quantum; Quantum mechanics; Quantum computer","score_opus":0.005988836414477809,"score_gpt":0.22997265113382134,"score_spread":0.22398381471934353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329299806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.272502,0.000062397594,0.72031736,0.0029534486,0.00038467278,0.00027672172,2.1112727e-7,0.00039192877,0.0031112689],"genre_scores_gemma":[0.9558569,0.000017447337,0.04264678,0.0011008926,0.00033684657,0.000014125335,1.8193742e-7,0.000018428562,0.000008369406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576825,0.000023974631,0.00035625297,0.0014928451,0.0008223454,0.0015363605],"domain_scores_gemma":[0.99881107,0.00026248704,0.00013821691,0.00029652633,0.00020583441,0.00028584138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024347266,0.00038850328,0.0003730273,0.00031375547,0.00050601107,0.0009410408,0.0024478107,0.00010694107,0.0000026573066],"category_scores_gemma":[0.0002887529,0.00031370713,0.00006419945,0.0022063386,0.0015556406,0.00066769484,0.0011373091,0.00097477675,0.000015499072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102253225,0.000073375246,0.000098845005,0.00001678332,0.000002647242,0.0000014010036,0.00057295075,0.0001923162,0.00024677737,0.91505927,0.000038034646,0.0836874],"study_design_scores_gemma":[0.00021284992,0.00045581078,0.00032681483,0.000086815584,0.0000017687855,0.00004109111,0.0000063033713,0.55986893,0.00067878515,0.43786034,0.00021498749,0.00024548607],"about_ca_topic_score_codex":0.0000012372113,"about_ca_topic_score_gemma":3.083654e-7,"teacher_disagreement_score":0.6833549,"about_ca_system_score_codex":0.00015858813,"about_ca_system_score_gemma":0.00012543885,"threshold_uncertainty_score":0.9999315},"labels":[],"label_agreement":null},{"id":"W2329861040","doi":"10.1103/physrevlett.109.070504","title":"Practical Experimental Certification of Computational Quantum Gates Using a Twirling Procedure","year":2012,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Perimeter Institute; University of Waterloo","funders":"","keywords":"Computer science; Fidelity; Quantum computer; Qubit; Computer engineering; Computation; Quantum error correction; Quantum algorithm; Quantum; Spins; Algorithm; Process (computing); Theoretical computer science; Physics; Quantum mechanics; Programming language","score_opus":0.05243116224317121,"score_gpt":0.35719916475490937,"score_spread":0.3047680025117382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329861040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6924899,0.0030027097,0.29766148,0.006405347,0.0001416739,0.00022346871,0.0000010778828,0.00006523267,0.000009048968],"genre_scores_gemma":[0.919169,0.000025000532,0.07815215,0.0024211637,0.00020994547,0.000009237548,0.000003624421,0.000009601096,2.8587706e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876684,0.00010899791,0.0002677016,0.00024215569,0.00034182164,0.00027249346],"domain_scores_gemma":[0.9992326,0.00019054046,0.00019916239,0.00023059106,0.000046295874,0.00010083551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002285771,0.00014389637,0.0002622881,0.00003802497,0.000083560066,0.000031480704,0.00025388936,0.000009286139,0.0000032524667],"category_scores_gemma":[0.000067077395,0.00011809231,0.0001244779,0.00029628453,0.00006249581,0.00035063084,0.00011895476,0.00015721138,0.000014927606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003645384,0.0055660494,0.0021073031,0.0060293744,0.00029378277,0.000022817485,0.009939777,0.11479324,0.6094985,0.2194094,0.007091618,0.025211664],"study_design_scores_gemma":[0.00008441764,0.000028883782,0.00054878125,0.0005704525,0.000019050534,0.00004219549,0.000008990755,0.9927284,0.005073978,0.00046966138,0.00026233762,0.00016281751],"about_ca_topic_score_codex":0.000004185768,"about_ca_topic_score_gemma":1.3862577e-8,"teacher_disagreement_score":0.8779352,"about_ca_system_score_codex":0.000031792188,"about_ca_system_score_gemma":0.00003848619,"threshold_uncertainty_score":0.48156643},"labels":[],"label_agreement":null},{"id":"W2332132742","doi":"10.1080/07468342.2001.11921901","title":"In Search of a Missing Link: A Case Study in Error-Correcting Codes","year":2001,"lang":"en","type":"article","venue":"College Mathematics Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Link (geometry); Club; Mathematics; Mathematics education; Image (mathematics); Computer science; Artificial intelligence; Combinatorics","score_opus":0.04201275135143788,"score_gpt":0.3214164233019961,"score_spread":0.2794036719505582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332132742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8763852,0.00008620553,0.122371234,0.00058457727,0.00019126164,0.00019938979,6.2781635e-7,0.000017824976,0.00016367529],"genre_scores_gemma":[0.88061994,0.000002860229,0.11921918,0.000023059727,0.00008645359,0.0000020742839,2.8633135e-8,0.000010527139,0.000035881836],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981546,0.00021778747,0.0006981794,0.0002054502,0.0003682973,0.00035568827],"domain_scores_gemma":[0.9988179,0.0004740539,0.0002150952,0.00029278712,0.00010006464,0.00010007904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002255601,0.00014614158,0.00037639914,0.0005497713,0.00018220142,0.00013472904,0.0005440973,0.000048169786,0.0000079601],"category_scores_gemma":[0.0001868604,0.00012442471,0.000066177694,0.0011696331,0.000030371726,0.0001785036,0.00023454934,0.000659319,0.0000018412578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057424983,0.0057595843,0.025173405,0.00042886395,0.000114372975,0.31221285,0.33210996,0.06990341,0.00059218874,0.0027884934,0.00016420723,0.25069526],"study_design_scores_gemma":[0.000861106,0.00018647438,0.0005420172,0.00037242772,0.000004270506,0.0803534,0.008536179,0.9017102,0.00008621674,0.0071994527,0.000008653433,0.00013959588],"about_ca_topic_score_codex":0.00007568558,"about_ca_topic_score_gemma":0.00016999186,"teacher_disagreement_score":0.8318068,"about_ca_system_score_codex":0.000073084826,"about_ca_system_score_gemma":0.0001713815,"threshold_uncertainty_score":0.50738925},"labels":[],"label_agreement":null},{"id":"W2332880953","doi":"10.1109/isit.2016.7541702","title":"Codeword stabilized quantum codes for asymmetric channels","year":2016,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Code word; Degenerate energy levels; Pauli exclusion principle; Quantum; Quantum error correction; Error detection and correction; Code (set theory); Pauli matrices","score_opus":0.01739641631500403,"score_gpt":0.25605426385475877,"score_spread":0.23865784753975475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332880953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017802732,0.00009504869,0.9729066,0.007174077,0.0008718478,0.00030314692,0.000009795286,0.00046212983,0.00037463626],"genre_scores_gemma":[0.82473826,0.000018288127,0.17339776,0.0005815806,0.00023673385,0.000043840817,0.000001565762,0.000018173576,0.00096380647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984443,0.000053491498,0.00024267254,0.0004994193,0.00022691084,0.0005331959],"domain_scores_gemma":[0.99819463,0.0009179184,0.00007969099,0.00053560355,0.00014139543,0.00013074401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050393824,0.00017546648,0.00023455497,0.00019866978,0.00021315723,0.00013365904,0.00087384356,0.00006198702,0.000015842446],"category_scores_gemma":[0.00024020826,0.000098007666,0.00013056533,0.00053999544,0.00004653471,0.00017389418,0.0002665669,0.00006318832,0.00003377633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024559737,0.00011740787,0.00010508211,0.000028993994,0.000035801004,0.000005087885,0.00043246732,0.000413523,0.0014978877,0.3865556,0.006263347,0.6045202],"study_design_scores_gemma":[0.0012198681,0.0003251965,0.000119873555,0.0000396227,0.0000045796114,0.000014413585,0.000016118196,0.90436685,0.005712723,0.056421164,0.03142377,0.00033582762],"about_ca_topic_score_codex":0.000023934239,"about_ca_topic_score_gemma":0.0000063506363,"teacher_disagreement_score":0.9039533,"about_ca_system_score_codex":0.000033254903,"about_ca_system_score_gemma":0.0000542178,"threshold_uncertainty_score":0.39966366},"labels":[],"label_agreement":null},{"id":"W2339438075","doi":"10.1016/j.scico.2017.08.011","title":"A finite alternation result for reversible boolean circuits","year":2017,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Air Force Office of Scientific Research; Air Force Materiel Command; Natural Sciences and Engineering Research Council of Canada; U.S. Air Force","keywords":"Alternation (linguistics); Boolean function; Computer science; Boolean circuit; Function (biology); Discrete mathematics; Algorithm; Arithmetic; Mathematics","score_opus":0.024521928790932,"score_gpt":0.28819220411018726,"score_spread":0.26367027531925524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339438075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04147363,0.000026325342,0.9556394,0.0009107683,0.0012302365,0.000349665,0.0000021939761,0.00012958591,0.00023817996],"genre_scores_gemma":[0.5727007,0.0000013717948,0.42701155,0.00004580454,0.00018973609,0.000007703256,7.7511214e-7,0.000005566221,0.00003680213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794996,0.000021780701,0.0003026278,0.00064286863,0.00055408233,0.0005286844],"domain_scores_gemma":[0.99774927,0.00012964019,0.0004555231,0.0011573215,0.00037249384,0.00013575776],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014608252,0.00015256739,0.00020319509,0.00024982257,0.0013274791,0.0012219833,0.0037724043,0.00003959233,5.051974e-7],"category_scores_gemma":[0.00022967125,0.00013984602,0.000110667956,0.00035383206,0.0004610582,0.0010824186,0.0008888286,0.00012205049,0.000003598798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018656899,0.000041469277,0.0002261551,0.00003259426,0.000006692324,0.000002755018,0.0006350784,0.003790532,0.0006778546,0.013080245,0.00006810961,0.98143667],"study_design_scores_gemma":[0.0004559797,0.00027032287,0.0030592538,0.00012939487,0.0000039751385,0.000010846426,0.000007189416,0.98256487,0.0040670526,0.0054111625,0.0038184072,0.00020156881],"about_ca_topic_score_codex":0.00003171717,"about_ca_topic_score_gemma":0.000002563911,"teacher_disagreement_score":0.9812351,"about_ca_system_score_codex":0.000032600186,"about_ca_system_score_gemma":0.00019168506,"threshold_uncertainty_score":0.99997264},"labels":[],"label_agreement":null},{"id":"W2339668911","doi":"10.1145/1859204.1859231","title":"QIP = PSPACE","year":2010,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"PSPACE; Quantum complexity theory; Computer science; Quantum computer; Theoretical computer science; Computational complexity theory; Context (archaeology); Model of computation; Complexity class; Quantum; Computation; Algorithm; Quantum mechanics; Physics","score_opus":0.018893718780673426,"score_gpt":0.27466468714813735,"score_spread":0.25577096836746394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339668911","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40839988,0.00068640406,0.021081235,0.5571125,0.0014352631,0.00030245216,0.0000053903686,0.00031559536,0.010661238],"genre_scores_gemma":[0.53288716,0.000008517507,0.46689555,0.00012791994,0.000014662217,0.000002199741,2.6910615e-7,0.0000024698186,0.00006124362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995473,0.00006311484,0.00010694037,0.00009534902,0.00009753629,0.00008973513],"domain_scores_gemma":[0.95898855,0.00025115436,0.00008382991,0.040595047,0.0000568349,0.000024610243],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0002174522,0.000050962437,0.000063485204,0.000029392912,0.0002476338,0.000034448614,0.055718184,0.000027832419,0.0000022820682],"category_scores_gemma":[0.002248165,0.000034293505,0.00006102707,0.00028367306,0.00016419764,0.000057458125,0.03351818,0.0003283851,0.000012063525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017934299,0.0003167423,0.0033032969,0.000016307433,0.000041557283,3.4735643e-7,0.0038059638,0.00080315716,0.045049455,0.7722739,0.04618041,0.1282071],"study_design_scores_gemma":[0.00019833003,0.0000248942,0.021553425,0.000036038327,0.000008287024,0.000031089337,0.000022661321,0.25327668,0.007999561,0.6305867,0.086077586,0.00018476046],"about_ca_topic_score_codex":0.000027395821,"about_ca_topic_score_gemma":0.000033006952,"teacher_disagreement_score":0.5569846,"about_ca_system_score_codex":0.0000034091815,"about_ca_system_score_gemma":0.00004145884,"threshold_uncertainty_score":0.97429854},"labels":[],"label_agreement":null},{"id":"W2340115191","doi":"10.1038/srep43048","title":"Prime factorization using quantum annealing and computational algebraic geometry","year":2017,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"QLT (Canada)","funders":"","keywords":"Factorization; Quantum annealing; Algebraic number; Quantum; Prime (order theory); Quantum computer; Simulated annealing; Computer science; Quantum chemical; Algebra over a field; Mathematics; Discrete mathematics; Combinatorics; Pure mathematics; Algorithm; Physics; Quantum mechanics","score_opus":0.020969065359522834,"score_gpt":0.2712982490252503,"score_spread":0.2503291836657275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340115191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5678034,0.000082062536,0.42770702,0.00014545294,0.004071394,0.00007743032,6.983826e-7,0.00007968512,0.000032836764],"genre_scores_gemma":[0.9463063,8.0730655e-7,0.05347032,0.000022113432,0.00011246667,9.7762e-7,0.000009670528,0.0000089063715,0.00006845301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799615,0.000036819813,0.00033492732,0.00082550256,0.0005084428,0.00029816094],"domain_scores_gemma":[0.9980628,0.000046430876,0.00051500835,0.0010794286,0.00016397759,0.00013233823],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010236348,0.00014412585,0.00016090246,0.0002101326,0.0022293313,0.0026958887,0.00047925167,0.0000546098,0.000004390292],"category_scores_gemma":[0.0002073958,0.00013166155,0.000051187755,0.00025191664,0.00023860626,0.0006429403,0.00050274987,0.00012630528,0.0000033229512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011171788,0.00033571568,0.13444762,0.00022679182,0.00017172995,0.0022283737,0.007237234,0.30570173,0.046511434,0.03141546,0.0020243663,0.46968836],"study_design_scores_gemma":[0.00007781067,0.0000140338825,0.016011478,0.00004987318,0.000004286139,0.00038880034,0.0000064454275,0.90724015,0.0016361636,0.073764,0.00062592776,0.00018104269],"about_ca_topic_score_codex":0.000042048825,"about_ca_topic_score_gemma":0.000001493709,"teacher_disagreement_score":0.6015384,"about_ca_system_score_codex":0.000026139598,"about_ca_system_score_gemma":0.00014451543,"threshold_uncertainty_score":0.99906963},"labels":[],"label_agreement":null},{"id":"W2341890912","doi":"10.1145/2240236.2240258","title":"Quantum money","year":2012,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Carry (investment); Computer science; TRACE (psycholinguistics); Computer security; Business; Finance; Philosophy","score_opus":0.036959184617088546,"score_gpt":0.28647963321502207,"score_spread":0.24952044859793351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341890912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52271336,0.016272888,0.06867389,0.3778858,0.0024248152,0.0006165598,0.00001257564,0.0005894221,0.010810678],"genre_scores_gemma":[0.7198486,0.000030101199,0.27991435,0.0001497071,0.000023016613,0.0000032326138,4.5254117e-7,0.0000032061193,0.000027396805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940085,0.00012566733,0.00013822857,0.0000714563,0.00011264596,0.00015113046],"domain_scores_gemma":[0.9674414,0.00024251,0.000096571806,0.032138947,0.000040802093,0.00003976886],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00030254168,0.000057625126,0.00007565781,0.000032556753,0.00024289217,0.000021109621,0.041695792,0.000022920622,0.0000014752592],"category_scores_gemma":[0.0015132473,0.00003852952,0.00006975362,0.00030521906,0.00011234659,0.00012629708,0.03402214,0.00015812757,0.000018988021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018887423,0.00053548795,0.013917283,0.00001977062,0.00005451592,9.467755e-8,0.0059493696,0.00076757575,0.0031428428,0.88070786,0.042494286,0.052409034],"study_design_scores_gemma":[0.00027053658,0.000037690912,0.087796725,0.00009122576,0.000020142752,0.000036118214,0.00007344761,0.3584415,0.004641126,0.4760391,0.07224274,0.00030962913],"about_ca_topic_score_codex":0.000024227154,"about_ca_topic_score_gemma":0.0000014485832,"teacher_disagreement_score":0.40466875,"about_ca_system_score_codex":0.000009855359,"about_ca_system_score_gemma":0.000024328943,"threshold_uncertainty_score":0.9737905},"labels":[],"label_agreement":null},{"id":"W2342198989","doi":"10.1103/physrevlett.117.010501","title":"Thresholds for Universal Concatenated Quantum Codes","year":2016,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Controlled NOT gate; Qubit; Universal set; Quantum computer; Quantum error correction; Hadamard transform; Computer science; Algorithm; Physics; Topology (electrical circuits); Discrete mathematics; Quantum; Theoretical computer science; Quantum mechanics; Set (abstract data type); Mathematics; Combinatorics","score_opus":0.015922470198344134,"score_gpt":0.27318953698964366,"score_spread":0.2572670667912995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342198989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120020755,0.0016759009,0.7745828,0.102541886,0.00032086277,0.00047789633,0.000015154758,0.00031398537,0.000050770843],"genre_scores_gemma":[0.9611126,0.0009850007,0.008048029,0.02939548,0.00036486422,0.000037670292,0.000005524139,0.000023777564,0.000027050402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988538,0.00006580348,0.00016439521,0.00038833026,0.00018954277,0.00033809987],"domain_scores_gemma":[0.99896383,0.0003965931,0.00008995644,0.00040146013,0.00004713073,0.00010102676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017554048,0.00016841806,0.00031509396,0.000030388032,0.00009292097,0.00003836987,0.00072288106,0.000009303642,0.0000033346105],"category_scores_gemma":[0.000056889054,0.00009677584,0.000200029,0.00021380874,0.00008541862,0.00015828344,0.00014274477,0.000082357685,0.000050668164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003060841,0.00036594452,0.00018674252,0.0015883668,0.00021960487,0.0000741879,0.00056630454,0.0008319768,0.1317865,0.32722223,0.12032741,0.41680014],"study_design_scores_gemma":[0.0016519374,0.00038027109,0.00059656095,0.0040989923,0.000085187545,0.000035391004,0.0000034929033,0.7735418,0.0030646333,0.016512742,0.1989933,0.0010356836],"about_ca_topic_score_codex":0.00000466516,"about_ca_topic_score_gemma":2.4348975e-7,"teacher_disagreement_score":0.8410919,"about_ca_system_score_codex":0.000029843566,"about_ca_system_score_gemma":0.000021143554,"threshold_uncertainty_score":0.39464042},"labels":[],"label_agreement":null},{"id":"W2343804540","doi":"10.1088/1367-2630/aa61ba","title":"Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?","year":2017,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science; Agency for Science, Technology and Research","keywords":"Classical limit; Limit (mathematics); Quantum; Quantum circuit; Quantum gate; Path (computing); Sequence (biology); Topology (electrical circuits); Algebraic number","score_opus":0.026710996970267145,"score_gpt":0.28471904469267,"score_spread":0.2580080477224029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343804540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055217195,0.00007683604,0.94024074,0.0033505324,0.0008797811,0.00009667468,0.000010668132,0.000031490978,0.0000960812],"genre_scores_gemma":[0.9660237,0.000020990325,0.03129896,0.00023727087,0.0021503905,0.0000013949748,0.0000021358042,0.000028670482,0.00023647743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986726,0.000050053568,0.00035146417,0.00024660685,0.00037770314,0.00030154595],"domain_scores_gemma":[0.9980241,0.0001349423,0.00084789825,0.00060775125,0.00019720008,0.00018807959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002954133,0.00020335344,0.00035474685,0.000044781966,0.00041774075,0.0004940352,0.0014606441,0.00008709607,0.000004473679],"category_scores_gemma":[0.00006896132,0.00015063628,0.00036663614,0.000084078645,0.00006571549,0.0006260315,0.00018018349,0.0004841755,0.0000109295925],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026067606,0.00010737468,0.00011098889,0.000023718534,0.00007681314,0.000021870317,0.00079583284,0.0005201552,0.0010163173,0.03289587,0.003502591,0.9609024],"study_design_scores_gemma":[0.00051670684,0.00039848202,0.00066211045,0.00012483366,0.000023146767,0.00006489767,0.000020814192,0.7774611,0.00061085855,0.21834105,0.0016108704,0.00016510923],"about_ca_topic_score_codex":0.000019382938,"about_ca_topic_score_gemma":0.0000031867266,"teacher_disagreement_score":0.9607373,"about_ca_system_score_codex":0.0000780221,"about_ca_system_score_gemma":0.00019412396,"threshold_uncertainty_score":0.61427695},"labels":[],"label_agreement":null},{"id":"W2358728417","doi":"","title":"Research on Quantum Computer and its Applications","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Quantum computer; Quantum cryptography; Computation; Quantum; Cryptography; Theoretical computer science; Computer engineering; Quantum information; Computer security; Algorithm; Quantum mechanics; Physics","score_opus":0.019701622527123173,"score_gpt":0.29635080252326035,"score_spread":0.2766491799961372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2358728417","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006968883,0.00040285467,0.9873258,0.0026686902,0.00003422763,0.0011158416,0.000011798416,0.00046316936,0.0010087674],"genre_scores_gemma":[0.34271258,0.0000340779,0.6521797,0.001005852,0.002108566,0.0014277552,0.000044402885,0.000052049272,0.00043499595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99760455,0.00012291771,0.0003546489,0.0009810646,0.000370285,0.0005665581],"domain_scores_gemma":[0.99833494,0.00044134897,0.00008631489,0.0007485512,0.00023810042,0.00015071909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044771336,0.0002470299,0.0002112773,0.0004052488,0.00087317126,0.00042637234,0.0012438818,0.00010703855,0.000003743311],"category_scores_gemma":[3.2102793e-7,0.00023430631,0.000073647585,0.0011575718,0.000108100314,0.00014218705,0.0006916057,0.0004955097,0.0003701811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016533578,0.0002777111,0.000021243543,0.000030050129,0.0000116750625,0.0000033266572,0.000085552434,0.0031516075,0.0012093493,0.6391922,0.0068265754,0.34918904],"study_design_scores_gemma":[0.00024250122,0.00007783252,0.0012817237,0.000021539616,0.0000032251862,0.000055424614,0.000004310935,0.43035153,0.0008643856,0.02667741,0.54014754,0.0002725834],"about_ca_topic_score_codex":0.000025946974,"about_ca_topic_score_gemma":0.0000030998115,"teacher_disagreement_score":0.6125148,"about_ca_system_score_codex":0.000048916918,"about_ca_system_score_gemma":0.000055920118,"threshold_uncertainty_score":0.95547336},"labels":[],"label_agreement":null},{"id":"W2360313849","doi":"10.1103/physreva.95.042331","title":"Efficient state initialization by a quantum spectral filtering algorithm","year":2017,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Perimeter Institute; Institut National de la Recherche Scientifique; University of Waterloo","funders":"","keywords":"Initialization; Algorithm; Quantum phase estimation algorithm; Nondeterministic algorithm; Quantum algorithm; Computer science; Qubit; Quantum; One-way quantum computer; State (computer science); Mathematics; Quantum error correction; Quantum mechanics; Physics","score_opus":0.014359371436903306,"score_gpt":0.3395223824756128,"score_spread":0.3251630110387095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2360313849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11745671,0.043361984,0.8297898,0.005520121,0.00071479776,0.001768799,0.00008099209,0.0004883435,0.00081843877],"genre_scores_gemma":[0.9045849,0.06906645,0.017374953,0.006282554,0.0020494328,0.00031058645,0.000075344215,0.00015572677,0.000100069235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959548,0.0003387232,0.0006860105,0.0011611017,0.0009761977,0.000883157],"domain_scores_gemma":[0.9963288,0.0002492883,0.0007165076,0.0020975526,0.00018185438,0.00042603794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005989291,0.0006180595,0.0014071598,0.000048727656,0.0006652227,0.00044741298,0.002446782,0.00003386028,0.000009474302],"category_scores_gemma":[0.0005783328,0.00048289497,0.000709076,0.0004670136,0.00020786929,0.00032615077,0.0009961298,0.0006170618,0.00030712312],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072074035,0.0015535301,0.000021153934,0.005971103,0.000113462884,0.00009903396,0.00037613537,0.00064217666,0.012052644,0.022016797,0.007712946,0.9494338],"study_design_scores_gemma":[0.00029186485,0.00024015456,0.00026501995,0.009362752,0.00009562668,0.00002153808,7.76948e-7,0.94903165,0.00372079,0.020640193,0.015609572,0.0007200464],"about_ca_topic_score_codex":0.000040892704,"about_ca_topic_score_gemma":8.1348236e-7,"teacher_disagreement_score":0.9487138,"about_ca_system_score_codex":0.00007487805,"about_ca_system_score_gemma":0.0000965123,"threshold_uncertainty_score":0.9997623},"labels":[],"label_agreement":null},{"id":"W2364925156","doi":"","title":"The Simulation of Quantum Fourier Transform","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Radio frequency; Qubit; Spins; Fourier transform; Spin (aerodynamics); Rotation (mathematics); Physics; Computer science; Quantum computer; Precession; Field (mathematics); RF power amplifier; Computational physics; Nuclear magnetic resonance; Quantum; Quantum mechanics; Telecommunications; Condensed matter physics; Amplifier; Bandwidth (computing); Mathematics; Artificial intelligence","score_opus":0.005421718698045769,"score_gpt":0.2280191337788455,"score_spread":0.22259741508079972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2364925156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002463631,0.00019871088,0.9948313,0.0014992254,0.00003204178,0.00037790515,0.0000037281663,0.000137648,0.0004557939],"genre_scores_gemma":[0.6085145,0.000005873267,0.39086264,0.00010365371,0.00027126423,0.00007921695,0.000008099569,0.000012528598,0.00014224445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990109,0.000027404472,0.0003165368,0.0002604749,0.00016456212,0.00022007151],"domain_scores_gemma":[0.9990363,0.00024933097,0.00011164616,0.00047216186,0.00009766887,0.000032863463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017370493,0.000116316,0.00011137514,0.00005834755,0.00038905483,0.00011556067,0.00083370955,0.00004108901,9.973144e-7],"category_scores_gemma":[2.9944314e-7,0.00008414435,0.00009552048,0.0004006386,0.00007118906,0.000088968925,0.00010637508,0.000108996246,0.000015320287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013949516,0.00006694914,0.00002755642,0.000009066694,0.000009395644,3.3906534e-7,0.00012535548,0.13762559,0.00071999285,0.08909987,0.00074836984,0.7715661],"study_design_scores_gemma":[0.000097806485,0.000013084241,0.00043353622,0.0000042443803,0.0000026649786,0.0000044765093,0.0000017165344,0.68953884,0.00091859343,0.030919895,0.27799037,0.00007475494],"about_ca_topic_score_codex":0.000034352295,"about_ca_topic_score_gemma":0.000005815753,"teacher_disagreement_score":0.77149135,"about_ca_system_score_codex":0.000014737561,"about_ca_system_score_gemma":0.000033390974,"threshold_uncertainty_score":0.3431307},"labels":[],"label_agreement":null},{"id":"W2398011416","doi":"10.1103/physrevlett.117.100502","title":"Exponential Communication Complexity Advantage from Quantum Superposition of the Direction of Communication","year":2016,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":222,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Austrian Science Fund; John Templeton Foundation","keywords":"Communication complexity; Superposition principle; Computer science; Quantum information science; Quantum; Quantum entanglement; Bounded function; Task (project management); Exponential function; Quantum complexity theory; Theoretical computer science; Communications system; Function (biology); Models of communication; Quantum capacity; Computational complexity theory; Statistical physics; Quantum computer; Mathematics; Quantum network; Quantum mechanics; Physics; Algorithm; Computer network; Mathematical analysis","score_opus":0.018187768087827988,"score_gpt":0.27388415661050197,"score_spread":0.25569638852267396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398011416","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8669732,0.0027755378,0.1093635,0.02036676,0.00011978122,0.0002889045,0.000019936753,0.000053415213,0.000038925627],"genre_scores_gemma":[0.9925588,0.0014583197,0.0050401483,0.0008809314,0.00003533945,0.000010117182,0.000009160488,0.0000062067047,9.947706e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855775,0.00055968657,0.00031388487,0.00018578209,0.00027019478,0.000112718604],"domain_scores_gemma":[0.9979543,0.00038378066,0.00032799496,0.001243349,0.000062466876,0.000028122338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023720402,0.00010878193,0.00027221738,0.000022790366,0.00011102103,0.000012374538,0.0011016831,0.0000101314,0.000004922092],"category_scores_gemma":[0.00004884215,0.00006247536,0.00018593862,0.00023594362,0.00023219816,0.00020083586,0.00038899487,0.00012308228,0.00000523264],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017979813,0.0004361736,0.00059357134,0.00033131434,0.000068420864,3.6395946e-7,0.0009953228,0.00018889701,0.8304954,0.0453845,0.0010758294,0.1204122],"study_design_scores_gemma":[0.002284888,0.00030769926,0.16450498,0.02921286,0.000330926,0.000017089336,0.00003689082,0.5134057,0.19386637,0.088478215,0.0063225953,0.0012318245],"about_ca_topic_score_codex":0.00011561309,"about_ca_topic_score_gemma":0.0000045510455,"teacher_disagreement_score":0.63662905,"about_ca_system_score_codex":0.00002597558,"about_ca_system_score_gemma":0.000012086634,"threshold_uncertainty_score":0.25476712},"labels":[],"label_agreement":null},{"id":"W2398409825","doi":"","title":"Equivalence Checking of Reversible Circuits.","year":2009,"lang":"en","type":"article","venue":"MBMV","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Formal equivalence checking; Electronic circuit; Equivalence (formal languages); Boolean function; Computer science; Boolean satisfiability problem; Logical equivalence; Boolean circuit; Arithmetic; Sequential logic; Logic gate; Mathematics; Algorithm; Theoretical computer science; Formal verification; Discrete mathematics; Electrical engineering; Engineering","score_opus":0.01579356377274699,"score_gpt":0.24397304191080402,"score_spread":0.22817947813805703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398409825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21510307,0.0004472107,0.7714991,0.0019873227,0.0004322226,0.000099220706,0.00000132593,0.0002567492,0.010173755],"genre_scores_gemma":[0.9650328,0.0000062790186,0.03443349,0.00032271503,0.000060821756,2.9874826e-7,2.8160153e-7,0.000002640558,0.00014063877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992326,0.000021495498,0.00013929069,0.00021762754,0.00018486557,0.00020410208],"domain_scores_gemma":[0.9994385,0.000033556,0.00007020319,0.00037349833,0.000037073663,0.00004715178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018146125,0.000077343124,0.00011837029,0.000066144275,0.00006518433,0.00003428579,0.0006756205,0.000029843415,0.0000073615606],"category_scores_gemma":[0.000024796884,0.00007023414,0.00005499024,0.00033933323,0.000021791155,0.000114622846,0.00010380104,0.000103929095,0.000012477097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015250552,0.00008725825,0.00035299276,0.000030181998,0.000009159203,0.000030841897,0.0015561925,0.004107668,0.017269887,0.03614258,0.001071299,0.9393404],"study_design_scores_gemma":[0.0007594381,0.00067768904,0.034520216,0.00037975714,0.000011873892,0.00010959614,0.000033980654,0.83785653,0.061280653,0.05547387,0.008214308,0.0006821019],"about_ca_topic_score_codex":0.0000070965802,"about_ca_topic_score_gemma":2.0740507e-7,"teacher_disagreement_score":0.9386583,"about_ca_system_score_codex":0.000010323609,"about_ca_system_score_gemma":0.000030140935,"threshold_uncertainty_score":0.28640652},"labels":[],"label_agreement":null},{"id":"W2399863333","doi":"10.48550/arxiv.quant-ph/0410040","title":"An Application of Quantum Finite Automata to Interactive Proof Systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Computer science; Theoretical computer science; Quantum finite automata; Quantum; Automaton; Automata theory; Quantum mechanics; Physics","score_opus":0.008043567294008316,"score_gpt":0.2590792429191976,"score_spread":0.2510356756251893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399863333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08094242,0.000011023341,0.91756433,0.0005326015,0.00019499546,0.0002875341,0.0000026760133,0.0002187582,0.00024566095],"genre_scores_gemma":[0.91398126,2.5366614e-7,0.08581626,0.00010863742,0.000051527648,0.000020522459,0.0000023027812,0.000006354918,0.000012904779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990436,0.00003635412,0.00022027781,0.00033729628,0.00019534082,0.0001671254],"domain_scores_gemma":[0.9990112,0.000058091897,0.000096837786,0.00064129656,0.000094285475,0.000098284654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017861572,0.000103445265,0.00014533027,0.00011761814,0.00005540371,0.00008458033,0.00075341674,0.000032780994,7.25366e-7],"category_scores_gemma":[0.00001974581,0.00008289947,0.000031747935,0.00038408246,0.000016070408,0.00021624562,0.00015113533,0.00008573355,0.000025237825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008484911,0.00025948335,0.000055243316,0.000037471513,0.000014061854,0.0000037947302,0.002425877,0.6714141,0.0034601593,0.24249879,0.00003656918,0.079786025],"study_design_scores_gemma":[0.00016901559,0.00030367295,0.0006815992,0.00004285062,0.000001519539,0.000011724084,0.000035588833,0.9895393,0.0047357623,0.004041355,0.0003249911,0.000112623246],"about_ca_topic_score_codex":0.0003190633,"about_ca_topic_score_gemma":0.0000067709348,"teacher_disagreement_score":0.8330388,"about_ca_system_score_codex":0.00002949525,"about_ca_system_score_gemma":0.00004976874,"threshold_uncertainty_score":0.3380542},"labels":[],"label_agreement":null},{"id":"W2401973716","doi":"10.1088/1367-2630/18/9/093025","title":"Creating cat states in one-dimensional quantum walks using delocalized initial states","year":2016,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Calgary","funders":"Alberta Innovates; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Delocalized electron; Quantum walk; Quantum; Quantum state; Quantum discord; Realization (probability); Quantum process; Quantum dynamics","score_opus":0.02819507317629294,"score_gpt":0.2806214134646874,"score_spread":0.25242634028839445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401973716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53492385,0.00007186884,0.46419483,0.00050026184,0.0002530778,0.000029454373,0.0000020208267,0.000015883623,0.00000873549],"genre_scores_gemma":[0.8475189,0.000020067539,0.15151586,0.00021384582,0.00070193806,2.381798e-7,8.2647495e-7,0.000017717326,0.000010559326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831474,0.00012579566,0.0005287431,0.00020585368,0.00047864663,0.0003462055],"domain_scores_gemma":[0.9986014,0.0004329403,0.0004200401,0.00019108574,0.0001889346,0.00016561495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003749092,0.00017122134,0.00033091626,0.00011949144,0.00010901376,0.00009836859,0.00049346953,0.000044669294,0.000006031026],"category_scores_gemma":[0.0000579503,0.00011520409,0.00011636834,0.0002995957,0.000052220297,0.00045268246,0.00017995904,0.00022523,0.0000039489137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013620667,0.00035317714,0.0010316363,0.000030356194,0.000114557595,0.00027944375,0.004763379,0.29953098,0.04128418,0.008746783,0.00054032967,0.64318895],"study_design_scores_gemma":[0.001628422,0.00024383939,0.00042405326,0.0005770756,0.000011907505,0.00012307827,0.000033224722,0.85544026,0.0078036073,0.13338558,0.00011136963,0.00021757997],"about_ca_topic_score_codex":0.0001739849,"about_ca_topic_score_gemma":0.000007946741,"teacher_disagreement_score":0.6429714,"about_ca_system_score_codex":0.00009088316,"about_ca_system_score_gemma":0.00040032787,"threshold_uncertainty_score":0.46978867},"labels":[],"label_agreement":null},{"id":"W2403315016","doi":"10.4086/toc.2013.v009a002","title":"","year":2013,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Industry Canada; National Science Foundation; Government of Canada; Institut Périmètre de physique théorique; Canadian Institute for Advanced Research; California Institute of Technology","keywords":"Mathematics; Combinatorics; Class (philosophy); Discrete mathematics; Counting problem; Quantum","score_opus":0.008336922265740671,"score_gpt":0.21656755383699125,"score_spread":0.20823063157125057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403315016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5037176,0.00006996833,0.49495414,0.00042476054,0.0001864841,0.00016789025,1.8417684e-7,0.00032046725,0.00015851014],"genre_scores_gemma":[0.78534937,9.628442e-7,0.21410331,0.00039662368,0.00011980903,0.0000030711449,4.813089e-7,0.000014393634,0.000011961207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681234,0.0005563207,0.000763071,0.00063263316,0.0004733551,0.00076225045],"domain_scores_gemma":[0.99640435,0.0015349579,0.00045449618,0.0011229563,0.0002750637,0.00020818296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018646984,0.0003226424,0.0005065853,0.0002532085,0.00038164138,0.00023174463,0.0027128083,0.0000754457,0.00000909774],"category_scores_gemma":[0.00017046751,0.0002766314,0.00020519401,0.0007766721,0.00021656493,0.00061364914,0.0013731512,0.00034804613,0.000015873911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057876546,0.00010814316,0.001041884,0.00004320243,0.00004430722,0.0000068504487,0.009289677,0.046741642,0.007987564,0.33524492,0.00002376671,0.5994623],"study_design_scores_gemma":[0.00039857955,0.00016091096,0.030859884,0.00009665648,0.000003913896,0.00006148702,0.0001724818,0.71325225,0.0071647186,0.24754216,0.0000093062245,0.00027765502],"about_ca_topic_score_codex":0.000070690534,"about_ca_topic_score_gemma":4.0138758e-7,"teacher_disagreement_score":0.66651064,"about_ca_system_score_codex":0.00001818465,"about_ca_system_score_gemma":0.00005557305,"threshold_uncertainty_score":0.9999686},"labels":[],"label_agreement":null},{"id":"W2403742698","doi":"10.7146/brics.v7i52.20219","title":"How to Convert a Flavor of Quantum Bit Commitment","year":2000,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Danmarks Grundforskningsfond; National Research Foundation","keywords":"Scheme (mathematics); Commitment scheme; Quantum; Bit (key); Computer science; Theoretical computer science; Mathematics; Arithmetic; Algorithm; Discrete mathematics; Computer security; Cryptography; Quantum mechanics; Physics","score_opus":0.011983943210925248,"score_gpt":0.2296793519396509,"score_spread":0.21769540872872564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403742698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6222881,0.0001788036,0.36019617,0.013901556,0.00083733455,0.00038940684,0.000008755355,0.00036479087,0.0018350537],"genre_scores_gemma":[0.91346747,0.000025880225,0.0779736,0.0004988403,0.00012818094,0.000016046848,0.0000060349917,0.000018443377,0.007865499],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857676,0.000034378547,0.0003330797,0.00039455053,0.0003815391,0.0002797099],"domain_scores_gemma":[0.9987737,0.000048944516,0.00014388979,0.00078915944,0.00011264799,0.00013165413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002469813,0.00016095222,0.00026935458,0.00008900241,0.00012281413,0.00016432756,0.00055948837,0.000046093213,0.000020077916],"category_scores_gemma":[0.000069452675,0.00013963901,0.00009215062,0.0004884587,0.000062456755,0.00019878625,0.00021451023,0.00010505032,0.000017454635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012139682,0.00076150877,0.005094209,0.00032600842,0.00028800152,0.006277496,0.010658041,0.017136592,0.005082878,0.09229197,0.025622541,0.83633935],"study_design_scores_gemma":[0.00039459465,0.00086339767,0.010173591,0.00012468733,0.00001788697,0.0032389744,0.000094087474,0.1887804,0.016140902,0.00794447,0.7714632,0.0007637834],"about_ca_topic_score_codex":0.00006873928,"about_ca_topic_score_gemma":0.0000052326495,"teacher_disagreement_score":0.8355756,"about_ca_system_score_codex":0.00001958841,"about_ca_system_score_gemma":0.000088137596,"threshold_uncertainty_score":0.56943136},"labels":[],"label_agreement":null},{"id":"W2404437241","doi":"10.4086/toc.2012.v008a013","title":"","year":2012,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Quantum computer; Span (engineering); Quantum algorithm; Computer science; Quantum; Algorithm; Mathematics; Theoretical computer science; Quantum mechanics; Physics; Engineering","score_opus":0.013188188914694312,"score_gpt":0.24159888306533683,"score_spread":0.22841069415064252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404437241","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4996139,0.00031241888,0.49900964,0.0001239672,0.00043158227,0.00007745699,3.1573225e-7,0.00027561688,0.00015507972],"genre_scores_gemma":[0.8006791,0.0000012702773,0.19864857,0.0002710831,0.00037789924,8.6226487e-7,5.4528556e-7,0.000014970298,0.0000057188868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665403,0.0006768659,0.0006683507,0.00040679914,0.00048431268,0.0011096464],"domain_scores_gemma":[0.99659526,0.0015508295,0.00044526072,0.0009886386,0.000117821786,0.00030219197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004774335,0.0003087231,0.00047841916,0.00023784491,0.0003931249,0.00007814326,0.0020443785,0.00007545322,0.0000021467113],"category_scores_gemma":[0.00019174487,0.0002717806,0.00020805502,0.0007688453,0.00017941535,0.0006901228,0.0013219898,0.000341918,0.0000042497486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015200766,0.00021060999,0.00784445,0.000042424967,0.000044938257,0.000003322675,0.024167525,0.017992822,0.0032120442,0.6284788,0.000006799628,0.317981],"study_design_scores_gemma":[0.0008880173,0.00024250426,0.10247428,0.00019565674,0.000018456321,0.000265419,0.0004441078,0.77125734,0.027565008,0.09586104,0.0001025109,0.0006856632],"about_ca_topic_score_codex":0.000008944017,"about_ca_topic_score_gemma":1.4645174e-7,"teacher_disagreement_score":0.75326455,"about_ca_system_score_codex":0.000022584656,"about_ca_system_score_gemma":0.000041172803,"threshold_uncertainty_score":0.9999734},"labels":[],"label_agreement":null},{"id":"W2406595422","doi":"","title":"Quantum one-time programs (extended abstract)","year":2013,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Computer science; Quantum; Physics; Quantum mechanics","score_opus":0.012779459702253594,"score_gpt":0.2219203112200467,"score_spread":0.20914085151779313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406595422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56907606,0.00013307338,0.3856244,0.01062614,0.0010417551,0.0010847301,7.7814883e-7,0.0033809713,0.029032065],"genre_scores_gemma":[0.8293131,0.0000019321953,0.16781804,0.0005270614,0.00015297967,0.000027778915,0.000003194053,0.0000156165,0.0021402996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985101,0.000026595353,0.00023925236,0.00044207266,0.00030930687,0.00047267973],"domain_scores_gemma":[0.9989863,0.000061058374,0.00007153345,0.0006148887,0.00008851959,0.00017771714],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016644862,0.00017542839,0.0001790399,0.00007480431,0.00014072437,0.00048945844,0.0009839876,0.00006555137,0.00029817122],"category_scores_gemma":[0.000014985507,0.00013549873,0.00009087622,0.00029708204,0.000047513964,0.0003605143,0.0002910407,0.00020691271,0.002956308],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010378662,0.0002998023,0.000054251643,0.000013592455,0.000026905127,0.000011448474,0.00031924836,0.00015052095,0.002284907,0.038993005,0.0041722953,0.953673],"study_design_scores_gemma":[0.00021363817,0.00016149328,0.012632928,0.000027707587,0.0000025537777,0.0000288378,0.000009780388,0.94620824,0.00055907795,0.036093574,0.0037404075,0.00032176913],"about_ca_topic_score_codex":0.00017305146,"about_ca_topic_score_gemma":0.0000019392164,"teacher_disagreement_score":0.9533512,"about_ca_system_score_codex":0.000013943967,"about_ca_system_score_gemma":0.00004048948,"threshold_uncertainty_score":0.99782},"labels":[],"label_agreement":null},{"id":"W2406950345","doi":"10.37236/6145","title":"Quantum State Transfer in Coronas","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Institut Henri Poincaré; National Science Foundation","keywords":"Generalization; Corona (planetary geology); State (computer science); Product (mathematics); Transfer (computing); Combinatorics; Adjacency matrix; Quantum walk; Mathematics; Physics; Quantum; Quantum mechanics; Geometry; Mathematical analysis; Computer science; Quantum computer; Graph; Algorithm","score_opus":0.011538880585942728,"score_gpt":0.24913124623899627,"score_spread":0.23759236565305353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406950345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4483298,0.010756689,0.5309098,0.004542845,0.0049547167,0.0002681418,0.0000025135107,0.000047389676,0.0001881289],"genre_scores_gemma":[0.9975317,0.0019311255,0.00011023299,0.000076919016,0.00021050964,0.0000029485084,6.7996746e-7,0.000027236452,0.00010866513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688995,0.00035013663,0.00077298505,0.00033481143,0.00074591796,0.0009061972],"domain_scores_gemma":[0.9974751,0.00025150512,0.00067963335,0.0012292729,0.00025616682,0.00010833904],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0027436437,0.00036430164,0.0006725678,0.00026455504,0.00023766427,0.00038603856,0.0055979732,0.00017528613,0.0000017087089],"category_scores_gemma":[0.00008403801,0.00024797296,0.0003299817,0.00022805315,0.00010137806,0.00017852931,0.0008243552,0.004599101,0.000003975304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006067529,0.00031061337,0.00016748738,0.00008067933,0.00021575815,0.00023914556,0.0030073705,0.02812415,0.000037801063,0.94769764,0.0003736066,0.019685056],"study_design_scores_gemma":[0.0007638849,0.00042024002,0.0008313513,0.00022171055,0.000023509116,0.00026651987,0.000009913208,0.10317345,0.00014838942,0.8913736,0.002487684,0.00027975507],"about_ca_topic_score_codex":0.00004802304,"about_ca_topic_score_gemma":0.000022175102,"teacher_disagreement_score":0.5492019,"about_ca_system_score_codex":0.00039796624,"about_ca_system_score_gemma":0.0020016283,"threshold_uncertainty_score":0.99999726},"labels":[],"label_agreement":null},{"id":"W2407418246","doi":"10.1007/s11128-017-1569-z","title":"Systematic and deterministic graph minor embedding for Cartesian products of graphs","year":2017,"lang":"en","type":"preprint","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"QLT (Canada)","funders":"Mitacs","keywords":"Cartesian product; Embedding; Computer science; Bottleneck; Heuristic; Theoretical computer science; Overhead (engineering); Qubit; Graph; Algorithm; Quantum; Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.015934236378200385,"score_gpt":0.2732158089927692,"score_spread":0.2572815726145688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407418246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059903197,0.0014316746,0.93506676,0.0003383101,0.001089406,0.0017531276,0.00003705065,0.0002525092,0.000127961],"genre_scores_gemma":[0.9178216,0.000016067374,0.081861064,0.00005202178,0.000064288055,0.00012858509,0.00003034025,0.000016085425,0.000009941737],"study_design_codex":"systematic_review","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770236,0.0000562031,0.0010881156,0.00041414637,0.00038678994,0.00035239308],"domain_scores_gemma":[0.99602556,0.00015410676,0.002272688,0.00088152394,0.00057224825,0.00009384655],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008956547,0.0003662081,0.000719042,0.0005091344,0.00059562136,0.001304188,0.0011537991,0.00019551891,1.9630123e-7],"category_scores_gemma":[0.0006485167,0.00031721912,0.00013568254,0.00018321373,0.00012726616,0.0012153379,0.0006250238,0.0003158421,0.0000012855994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003466988,0.00009269111,0.00009393434,0.7065382,0.0002103281,0.000007894866,0.036380995,0.0126906345,0.00016635943,0.03918905,0.00017596752,0.20441926],"study_design_scores_gemma":[0.00023901308,0.00007933421,0.00010617505,0.012362642,0.00006652284,0.00005176348,0.00012993427,0.9552245,0.00025783316,0.031089935,0.00003141045,0.00036092667],"about_ca_topic_score_codex":0.000012411102,"about_ca_topic_score_gemma":8.082925e-7,"teacher_disagreement_score":0.94253385,"about_ca_system_score_codex":0.000023759556,"about_ca_system_score_gemma":0.0003591828,"threshold_uncertainty_score":0.999928},"labels":[],"label_agreement":null},{"id":"W2408048592","doi":"10.48550/arxiv.quant-ph/0701126","title":"Quantum t-designs: t-wise independence in the quantum world","year":2007,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Quantum; Quantum state; Independence (probability theory); Measure (data warehouse); Quantum algorithm; State (computer science); Mathematics; Property (philosophy); Haar measure; Discrete mathematics; Quantum operation; Set (abstract data type); Quantum mechanics; Computer science; Physics; Algorithm; Open quantum system","score_opus":0.03914882758290086,"score_gpt":0.2761735838716964,"score_spread":0.23702475628879552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408048592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81641644,0.000304559,0.17913716,0.0023167094,0.0006610381,0.00022642278,8.5816004e-7,0.00020362747,0.0007331983],"genre_scores_gemma":[0.9937658,0.0000113647675,0.0037922412,0.0019959759,0.00027260673,0.000009226696,0.000001298613,0.000018519511,0.00013298613],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99715614,0.00021668749,0.0004872713,0.0006629023,0.0006431855,0.0008338298],"domain_scores_gemma":[0.99786615,0.00069990545,0.00015711789,0.0010757658,0.00006797228,0.00013309818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00263328,0.0002856458,0.00025350472,0.0003459277,0.00028183212,0.00017353987,0.0024213502,0.00010380337,0.000012176243],"category_scores_gemma":[0.0001315292,0.00020082064,0.000115592724,0.0017461128,0.0001120519,0.00032705028,0.00036805504,0.00087791355,0.00017772571],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008180865,0.00094660575,0.64076227,0.00007988207,0.00006225706,0.0023587185,0.01681265,0.0034639293,0.00468968,0.22967976,0.0036597478,0.09740266],"study_design_scores_gemma":[0.00069148827,0.00022890921,0.76371497,0.00013706935,0.000008562481,0.00015096035,0.00030380473,0.20886473,0.0013119248,0.017101651,0.006822177,0.00066374405],"about_ca_topic_score_codex":0.00019952237,"about_ca_topic_score_gemma":0.00028650652,"teacher_disagreement_score":0.21257812,"about_ca_system_score_codex":0.000054475888,"about_ca_system_score_gemma":0.00009831995,"threshold_uncertainty_score":0.8189228},"labels":[],"label_agreement":null},{"id":"W2408326808","doi":"10.26421/qic15.7-8-8","title":"W-like states are not necessary for totally correct quantum anonymous leader election","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"State (computer science); Protocol (science); Quantum state; Quantum; Computation; Cluster state; Quantum computer; Resource (disambiguation); Computer science; Mathematics; Quantum mechanics; Physics; Computer network; Algorithm","score_opus":0.020839611810204647,"score_gpt":0.2564108620898384,"score_spread":0.23557125027963371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408326808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13717993,0.0000831894,0.85907006,0.0016318106,0.0011434262,0.00036722075,0.000012417692,0.00038610707,0.00012583249],"genre_scores_gemma":[0.9802201,0.000017254493,0.017425383,0.0019513621,0.00012775934,0.000035124853,0.00017142597,0.000013795067,0.000037829534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840254,0.00007900521,0.0005186732,0.00027876612,0.0003844749,0.00033652512],"domain_scores_gemma":[0.99859774,0.000173034,0.00040273837,0.0001896491,0.000460042,0.00017679167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005230227,0.0002351477,0.00024008723,0.00027589794,0.000319619,0.00057021197,0.0002611958,0.00010168358,0.0000012211148],"category_scores_gemma":[0.000081636936,0.00021729854,0.00006880968,0.00040913647,0.00004537392,0.0017734505,0.00009963614,0.00017791786,0.00003228127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029281928,0.00017848883,0.0003015076,0.00030223973,0.00007103756,0.0000058918467,0.016311752,0.35621572,0.00011123547,0.045097314,0.026799135,0.5543129],"study_design_scores_gemma":[0.0010104049,0.00045008922,0.0013740504,0.00003585576,0.000008541024,0.000071623064,0.0008516388,0.9793891,0.00015941188,0.010517053,0.0058345087,0.0002977508],"about_ca_topic_score_codex":0.000057655783,"about_ca_topic_score_gemma":0.000006862955,"teacher_disagreement_score":0.84304017,"about_ca_system_score_codex":0.000060730057,"about_ca_system_score_gemma":0.00013586503,"threshold_uncertainty_score":0.88611776},"labels":[],"label_agreement":null},{"id":"W2408440127","doi":"10.26421/4.2-7","title":"On the structure of nonstabilizer Cliford codes","year":2004,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Code (set theory); Stabilizer (aeronautics); Generalization; Linear code; Computer science; Mathematics; Class (philosophy); Concatenated error correction code; Discrete mathematics; Block code; Algorithm; Decoding methods; Programming language","score_opus":0.007973156719074767,"score_gpt":0.2296746625818598,"score_spread":0.22170150586278503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408440127","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50178206,0.000009821052,0.49672544,0.0010956475,0.00011162728,0.00009705856,0.0000049118376,0.000048195492,0.00012521657],"genre_scores_gemma":[0.98921883,0.0000041118583,0.009996821,0.0007515583,0.000014073708,0.0000010554821,0.0000103666225,0.000002428885,7.619367e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924207,0.000035633366,0.00028294077,0.00009721072,0.0002277391,0.000114428396],"domain_scores_gemma":[0.99937177,0.00015532563,0.00018132989,0.00016176031,0.00009464495,0.00003518207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014807726,0.00010047545,0.000103514736,0.00010276202,0.00017537086,0.00012437202,0.00021486027,0.000039686453,0.0000035348844],"category_scores_gemma":[0.00004513965,0.00006440891,0.000033556516,0.00025652625,0.00005957694,0.00042163307,0.00006231311,0.0001220375,0.000009053929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007512428,0.000014922917,0.000019680354,0.000020335703,0.0000066329862,2.1265784e-7,0.0023126884,0.14417943,0.000118587566,0.79913646,0.00006912908,0.054114416],"study_design_scores_gemma":[0.0003712065,0.00015910907,0.0014827838,0.0000373135,0.0000023705131,0.000014969929,0.00012751395,0.8068968,0.0011045559,0.18949418,0.00021300229,0.00009618463],"about_ca_topic_score_codex":0.000016815176,"about_ca_topic_score_gemma":0.0000018999721,"teacher_disagreement_score":0.66271734,"about_ca_system_score_codex":0.000014794072,"about_ca_system_score_gemma":0.000047610924,"threshold_uncertainty_score":0.26265192},"labels":[],"label_agreement":null},{"id":"W2412871963","doi":"10.26421/qic17.5-6-8","title":"Perfect state transfer is poly-time","year":2017,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"State (computer science); Transfer (computing); Time transfer; Computer science; Algorithm; Telecommunications; Parallel computing","score_opus":0.011685173644154091,"score_gpt":0.24955847263904418,"score_spread":0.2378732989948901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412871963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11604993,0.00029246332,0.87932235,0.0020011675,0.00082922686,0.0003594907,0.00005240269,0.0003973432,0.0006956342],"genre_scores_gemma":[0.97943646,0.00014535303,0.018592598,0.0013190234,0.00013651825,0.000023176335,0.0002136598,0.000020546757,0.00011268844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805474,0.000091842754,0.00066298625,0.00040910137,0.00045480012,0.0003265424],"domain_scores_gemma":[0.9985903,0.00007422545,0.00038298493,0.00059450325,0.00020904894,0.00014893532],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004794181,0.00037468623,0.00037752412,0.00032545347,0.00054534787,0.0019483931,0.0007983728,0.00020545484,0.000011232561],"category_scores_gemma":[0.00002734656,0.0003534401,0.00014610885,0.00011068508,0.00007483064,0.0012355526,0.0006246775,0.00057514716,0.00017778702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015826607,0.000030291229,0.000029892828,0.000281695,0.00005907058,0.000004440951,0.01141777,0.021676932,0.000015847289,0.004355924,0.0014647157,0.9606476],"study_design_scores_gemma":[0.0004036141,0.000099325305,0.0015595927,0.00014300333,0.000012420137,0.000029809975,0.000015923526,0.96849614,0.0001018249,0.025090778,0.0036248926,0.00042264248],"about_ca_topic_score_codex":0.00009337465,"about_ca_topic_score_gemma":0.000001173306,"teacher_disagreement_score":0.9602249,"about_ca_system_score_codex":0.000040415158,"about_ca_system_score_gemma":0.00020199738,"threshold_uncertainty_score":0.99989176},"labels":[],"label_agreement":null},{"id":"W2417068188","doi":"10.1007/s11128-016-1363-3","title":"Generalized Ramsey numbers through adiabatic quantum optimization","year":2016,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Ramsey's theorem; Adiabatic quantum computation; Ramsey theory; Quantum computer; Combinatorics; Order (exchange); Mathematics; Computation; Quantum; Adiabatic process; Discrete mathematics; Quantum mechanics; Physics; Algorithm; Graph","score_opus":0.01124272638650109,"score_gpt":0.23877219874770672,"score_spread":0.22752947236120563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2417068188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02177665,0.00011493273,0.97320807,0.0024312248,0.00056512473,0.00020362783,0.000004686199,0.00069312734,0.0010025859],"genre_scores_gemma":[0.7370782,0.000048518952,0.26101488,0.0015764708,0.00014474834,0.000028551049,0.000022091268,0.000022020138,0.00006455354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979067,0.00008324367,0.0007023864,0.0003038144,0.00050485926,0.0004989882],"domain_scores_gemma":[0.99857473,0.00009850999,0.0004946057,0.00044605648,0.00026485778,0.00012124701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040187011,0.00027213315,0.00025089472,0.0001959778,0.00047925123,0.00063873536,0.00074692833,0.000117862335,0.000036450157],"category_scores_gemma":[0.00016160216,0.0001880737,0.00009054854,0.0007248122,0.000080135316,0.006428769,0.0001741513,0.00015134116,0.00015434825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028995773,0.00006867613,0.00012623981,0.00024201172,0.00003398303,0.000005761175,0.009268233,0.17408241,0.00032714033,0.19423161,0.0018496871,0.61973524],"study_design_scores_gemma":[0.00078457466,0.00005812469,0.000066736895,0.0002155018,0.0000069155003,0.000042009164,0.000068877336,0.97958916,0.0004448891,0.012270806,0.0061009713,0.00035145172],"about_ca_topic_score_codex":0.000023847422,"about_ca_topic_score_gemma":6.256744e-7,"teacher_disagreement_score":0.8055067,"about_ca_system_score_codex":0.00008387775,"about_ca_system_score_gemma":0.00020841922,"threshold_uncertainty_score":0.76694226},"labels":[],"label_agreement":null},{"id":"W2418943682","doi":"10.1103/physrevlett.117.090502","title":"Optimal Compression for Identically Prepared Qubit States","year":2016,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"University of Hong Kong; National Natural Science Foundation of China; National Research Foundation Singapore; Ministry of Education - Singapore; National Research Foundation; Ministry of Education, Culture, Sports, Science and Technology; Foundational Questions Institute; Centre for Quantum Technologies; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Qubit; Independent and identically distributed random variables; Computer science; Quantum; Cloning (programming); Quantum mechanics; Quantum information; Compression (physics); Physics; Statistical physics; Topology (electrical circuits); Mathematics; Combinatorics; Statistics; Thermodynamics; Random variable","score_opus":0.011549699205688543,"score_gpt":0.2883482264926293,"score_spread":0.27679852728694077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2418943682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09304039,0.0010807541,0.8653849,0.039701544,0.00017092112,0.00042779886,0.000007427957,0.00017291358,0.000013356363],"genre_scores_gemma":[0.72466123,0.0016441689,0.22648549,0.045649786,0.0011182349,0.00027918382,0.000014510958,0.000063855725,0.000083559295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866015,0.00007947574,0.00022515417,0.00043501018,0.00025812944,0.0003420822],"domain_scores_gemma":[0.9988447,0.00043179616,0.00009739684,0.00045870687,0.0000501418,0.00011726321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018126273,0.00016674955,0.00031158671,0.000023947054,0.000092962204,0.00006648412,0.0007264412,0.0000075847915,0.0000046203663],"category_scores_gemma":[0.000080816986,0.00009434011,0.00021209122,0.00013444814,0.000072953706,0.0001854618,0.00024642938,0.00007506365,0.000051202158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048787642,0.0005671263,0.00008742061,0.0025974114,0.00015296492,0.00003871897,0.0007840149,0.0067563537,0.1637063,0.020158187,0.12487655,0.68022615],"study_design_scores_gemma":[0.0009941219,0.00027933114,0.0005439491,0.0059043765,0.00005519447,0.00001729676,0.000001287779,0.9119068,0.0032524655,0.007601336,0.068763845,0.00067999255],"about_ca_topic_score_codex":0.0000017759663,"about_ca_topic_score_gemma":1.0572687e-7,"teacher_disagreement_score":0.9051505,"about_ca_system_score_codex":0.000020141359,"about_ca_system_score_gemma":0.000016356444,"threshold_uncertainty_score":0.3847078},"labels":[],"label_agreement":null},{"id":"W2434782124","doi":"10.1103/physreva.95.022330","title":"Entanglement and deterministic quantum computing with one qubit","year":2017,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Université de Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Industry Canada; Wolfson Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Quantum entanglement; Degenerate energy levels; Quantum computer; Quantum technology; Qubit; Quantum network; Quantum information; Quantum algorithm; Quantum teleportation; Quantum mechanics; Quantum; Open quantum system; Computer science; Statistical physics; Physics","score_opus":0.01996359478930294,"score_gpt":0.3477766232589179,"score_spread":0.32781302846961496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2434782124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6752179,0.09123635,0.20786771,0.018197207,0.00049190264,0.0038551767,0.000032732234,0.0006197184,0.0024812554],"genre_scores_gemma":[0.9702599,0.019238157,0.0067860526,0.0029598235,0.0006333563,0.000056965513,0.0000069784223,0.000043046075,0.000015695336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965112,0.00024858647,0.00055487273,0.0011178271,0.00084169506,0.00072580844],"domain_scores_gemma":[0.9963049,0.00043812676,0.0007079878,0.0019753352,0.00014769063,0.00042595938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005501839,0.00056266924,0.0015298409,0.000037013353,0.00074154243,0.00038135672,0.0018347644,0.000027081496,0.000004148687],"category_scores_gemma":[0.00045445753,0.0003963192,0.00035671232,0.00027439272,0.00030779862,0.00033860034,0.0012030267,0.0005562412,0.000109140514],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001422436,0.0013267683,0.00037624917,0.011362633,0.00017407423,0.00014124262,0.00034229434,0.000027109354,0.0021657534,0.121048324,0.0008387821,0.86218256],"study_design_scores_gemma":[0.0013714702,0.0020161315,0.0107470825,0.074757405,0.0008098819,0.00016799073,0.000005275821,0.82479507,0.0016802658,0.058477424,0.022930045,0.002241982],"about_ca_topic_score_codex":0.000029199151,"about_ca_topic_score_gemma":0.0000033410167,"teacher_disagreement_score":0.8599406,"about_ca_system_score_codex":0.00004330591,"about_ca_system_score_gemma":0.00008890244,"threshold_uncertainty_score":0.99984884},"labels":[],"label_agreement":null},{"id":"W2460606659","doi":"","title":"Experimental Realization of Scattershot Boson Sampling","year":2015,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Computer science; Quantum computer; Realization (probability); Quantum; Photon; Boson; Scalability; Quantum information; Quantum technology; Quantum mechanics; Algorithm; Physics; Theoretical computer science; Mathematics; Open quantum system","score_opus":0.07804432529342802,"score_gpt":0.32734414973652054,"score_spread":0.2492998244430925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460606659","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8329449,0.00069254806,0.16422917,0.00093784084,0.00020929662,0.00034617196,0.000018837683,0.00009454286,0.0005266558],"genre_scores_gemma":[0.9713106,0.00001264875,0.028394418,0.00000970497,0.00007052001,3.291528e-7,0.000027919048,0.000009270959,0.00016455412],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99769485,0.0002668034,0.00019207037,0.00054521183,0.0008956282,0.00040541159],"domain_scores_gemma":[0.99812514,0.00009952907,0.0001407109,0.00078898226,0.00064279203,0.00020286432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487618,0.00012521434,0.00023744584,0.00046273202,0.00022785073,0.000039041202,0.0013918381,0.00005556848,0.00000917864],"category_scores_gemma":[0.00018100375,0.0001348781,0.00007005402,0.0010379466,0.00039971145,0.00039239836,0.0009725695,0.00027186054,0.000018690429],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008038999,0.003810979,0.00999483,0.00091959257,0.00042258707,0.00032839522,0.19668218,0.03556403,0.48062426,0.03705142,0.07132396,0.16247387],"study_design_scores_gemma":[0.0063512255,0.004550234,0.016740477,0.0008570233,0.000036927362,0.00022420936,0.016615016,0.14900745,0.71980274,0.009510331,0.07446034,0.0018440462],"about_ca_topic_score_codex":0.0012032216,"about_ca_topic_score_gemma":0.000011886738,"teacher_disagreement_score":0.23917846,"about_ca_system_score_codex":0.00012587562,"about_ca_system_score_gemma":0.0002967035,"threshold_uncertainty_score":0.5500169},"labels":[],"label_agreement":null},{"id":"W2465986318","doi":"10.1007/978-3-319-40648-0_26","title":"Hierarchical Verification of Quantum Circuits","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Automated theorem proving; HOL; Formal verification; Theoretical computer science; Electronic circuit; Quantum computer; Quantum; Quantum gate; Gas meter prover; Quantum circuit; Formal methods; Factoring; Quantum logic; Computer engineering; Programming language; Algorithm; Quantum network; Mathematics; Quantum mechanics; Physics","score_opus":0.015218145375567095,"score_gpt":0.23943304279271807,"score_spread":0.22421489741715098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465986318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036301458,0.00031945042,0.9935864,0.0011964509,0.0017160913,0.00026995502,0.0000098836135,0.00016520542,0.0023735329],"genre_scores_gemma":[0.73553604,0.000066900655,0.26233363,0.00066284207,0.0009839591,0.000007696398,0.0000047994613,0.000064168016,0.0003399853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589586,0.00005653366,0.00070418086,0.0015544262,0.0011228046,0.00066618045],"domain_scores_gemma":[0.99665457,0.00066723203,0.00045337455,0.0017615319,0.00026907978,0.00019423953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090969587,0.00050193333,0.0006243009,0.00091002946,0.00019819614,0.00019509508,0.0038223972,0.0003334687,0.000015312904],"category_scores_gemma":[0.00012286774,0.00039076584,0.00018838284,0.0005874505,0.0009848683,0.0003004481,0.0011273061,0.0007964449,0.000037871167],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024952888,0.00002400828,0.000014516211,0.000035323912,0.0000083859895,0.000026727761,0.0003659012,0.007160522,0.0006837483,0.14384657,0.000006972045,0.8478248],"study_design_scores_gemma":[0.0002227215,0.00019284795,0.00022644301,0.00056380057,0.000004556008,0.000066163564,3.4228762e-8,0.65865874,0.0017510578,0.3369289,0.0009024351,0.00048226328],"about_ca_topic_score_codex":0.0000063838547,"about_ca_topic_score_gemma":0.0000036010124,"teacher_disagreement_score":0.84734255,"about_ca_system_score_codex":0.00015038604,"about_ca_system_score_gemma":0.0006279232,"threshold_uncertainty_score":0.99985445},"labels":[],"label_agreement":null},{"id":"W2466842283","doi":"10.1007/s11128-017-1615-x","title":"Boosting quantum annealer performance via sample persistence","year":2017,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quadratic unconstrained binary optimization; Quantum annealing; Quantum; Boosting (machine learning); Quantum computer; Binary number; Quadratic equation; Ising model","score_opus":0.022718035334385808,"score_gpt":0.24655237631118967,"score_spread":0.22383434097680388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466842283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21762177,0.00009771108,0.7784387,0.0010051724,0.00059744023,0.00014792247,0.0000044577655,0.00041433668,0.0016725161],"genre_scores_gemma":[0.95493966,0.00001395459,0.04440867,0.00043464205,0.00014832248,0.000010807569,0.000011007946,0.000011825807,0.000021090003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979595,0.000030560488,0.0005735172,0.00032453766,0.0005280652,0.00058381],"domain_scores_gemma":[0.9976814,0.000088126064,0.00084128143,0.0009292947,0.00030831786,0.0001516052],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00062697136,0.0002721616,0.00024144592,0.00019063597,0.003266091,0.0023698092,0.001903308,0.00009868228,0.000008766193],"category_scores_gemma":[0.0003620571,0.00024474933,0.00008892654,0.00023461966,0.00014594587,0.008308907,0.0005175098,0.00035290665,0.00010896817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010487107,0.000030846793,0.0015800551,0.0002993417,0.000009497158,0.0000031987029,0.0049450155,0.0051398296,0.0000905521,0.004563192,0.00015172407,0.98317623],"study_design_scores_gemma":[0.00028918454,0.00010506272,0.0073629557,0.00022236233,0.000005200651,0.0000670749,0.00011995731,0.9841425,0.00031841855,0.002037427,0.004969767,0.0003601178],"about_ca_topic_score_codex":0.000056688576,"about_ca_topic_score_gemma":0.0000014287762,"teacher_disagreement_score":0.98281616,"about_ca_system_score_codex":0.000052214073,"about_ca_system_score_gemma":0.00016545539,"threshold_uncertainty_score":0.9986658},"labels":[],"label_agreement":null},{"id":"W2478948476","doi":"10.1007/s11128-016-1495-5","title":"Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target","year":2017,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Dalhousie University; Intelligence Advanced Research Projects Activity; Louisiana State University; University of Pennsylvania","keywords":"Quantum computer; Cross section (physics); Quantum; Algorithm; Computer science; Scattering; Section (typography); Radar cross-section; Physics; Quantum mechanics","score_opus":0.011661651786249068,"score_gpt":0.2581816389217678,"score_spread":0.24651998713551876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478948476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49649647,0.00003209829,0.502313,0.00044575104,0.00031656667,0.00020655045,0.000009723024,0.00007713295,0.000102675316],"genre_scores_gemma":[0.9790868,5.3671835e-7,0.020623919,0.00015738755,0.000089766516,0.000011403565,0.0000071266772,0.000009471139,0.000013578709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976885,0.00013047042,0.0008802488,0.00025956793,0.00067838986,0.00036284793],"domain_scores_gemma":[0.99682933,0.00011163023,0.0015027828,0.0011454169,0.00033411913,0.000076717704],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011455065,0.00022181415,0.00042418484,0.0003109112,0.0014349609,0.00080543867,0.0020591705,0.00008701275,0.00000165641],"category_scores_gemma":[0.00010475009,0.00014401623,0.00026398635,0.001294653,0.00017513285,0.0010752701,0.0005742604,0.00028950046,0.0000042886477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011418878,0.000069518195,0.007749936,0.0017978785,0.00120457,0.000007608322,0.075329065,0.5257715,0.01452581,0.013240208,0.00033204487,0.35985765],"study_design_scores_gemma":[0.00025877933,0.00010501776,0.018956887,0.00020668838,0.00007679469,0.000015798925,0.00019607393,0.97646743,0.0027818794,0.00009847986,0.0006627072,0.00017347126],"about_ca_topic_score_codex":0.00012279266,"about_ca_topic_score_gemma":0.000004240086,"teacher_disagreement_score":0.48259035,"about_ca_system_score_codex":0.000054117972,"about_ca_system_score_gemma":0.00012215484,"threshold_uncertainty_score":0.99986506},"labels":[],"label_agreement":null},{"id":"W2479964607","doi":"10.1103/physrevlett.117.070501","title":"Foliated Quantum Error-Correcting Codes","year":2016,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Quantum; Computer science; Quantum mechanics; Physics","score_opus":0.01758098992204809,"score_gpt":0.2840697675896808,"score_spread":0.2664887776676327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479964607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2920037,0.002636814,0.64379543,0.060021006,0.00065031205,0.00026020172,0.0000029526957,0.00053247326,0.00009712463],"genre_scores_gemma":[0.9777675,0.00042141485,0.0041910927,0.017204484,0.0003639402,0.000017030055,8.75351e-7,0.000018280567,0.000015347967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984517,0.00015507966,0.00023186897,0.0004634827,0.00028744864,0.00041043552],"domain_scores_gemma":[0.9987909,0.00039092646,0.00012668566,0.0005367796,0.00003674403,0.000117959826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025232194,0.00020409159,0.00036156183,0.00003899676,0.00011728919,0.0000533033,0.0007862418,0.000008657487,0.0000065389695],"category_scores_gemma":[0.00014087773,0.00011851551,0.00020437532,0.00038357047,0.00005798766,0.00018866258,0.00023244845,0.0001604278,0.00021666988],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003623502,0.00015142685,0.00021397643,0.00057275215,0.000060621802,0.000056985453,0.00032953545,0.00034195252,0.04367328,0.015780428,0.012693302,0.9261221],"study_design_scores_gemma":[0.0010623529,0.00029719816,0.0026291388,0.014268819,0.00009668309,0.00017373872,0.000007137546,0.8763414,0.00672477,0.012577422,0.0839307,0.0018906137],"about_ca_topic_score_codex":0.000008788432,"about_ca_topic_score_gemma":5.8185475e-7,"teacher_disagreement_score":0.9242315,"about_ca_system_score_codex":0.000029942534,"about_ca_system_score_gemma":0.000020504282,"threshold_uncertainty_score":0.48329222},"labels":[],"label_agreement":null},{"id":"W2487095096","doi":"10.1007/978-3-319-40578-0_22","title":"A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of New Brunswick","funders":"","keywords":"Computer science; Transformation (genetics); Algorithm; Representation (politics); Function (biology); State (computer science); Theoretical computer science","score_opus":0.01412225893105541,"score_gpt":0.23224488058621814,"score_spread":0.21812262165516275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487095096","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000067617834,0.00024398371,0.99229324,0.0033514712,0.0014547618,0.00076120713,0.000053633074,0.00030657055,0.0015283473],"genre_scores_gemma":[0.004352912,0.000026296932,0.99264354,0.0019604785,0.000677504,0.000045617653,0.0000064289507,0.000050575436,0.0002366254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588495,0.000050551527,0.0006210087,0.0016032069,0.0008943221,0.0009459814],"domain_scores_gemma":[0.9965683,0.001370515,0.0003348919,0.0012116868,0.00029570883,0.00021885385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010984064,0.0006782648,0.00069676514,0.0011143888,0.00048673886,0.00048740674,0.0032078922,0.00039196663,0.000017586608],"category_scores_gemma":[0.00008451519,0.000525733,0.00032896374,0.0005779642,0.00046775854,0.00050918636,0.00042546718,0.0005462734,0.00003662688],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003113235,0.00002103674,6.946905e-7,0.00005682277,0.000010204419,0.000013150062,0.00027762575,0.013805218,0.000047555397,0.010159279,0.000017023884,0.97558826],"study_design_scores_gemma":[0.00037190848,0.00018760459,0.0000066906528,0.00073525496,0.000013323972,0.000041968524,1.17324056e-7,0.87618715,0.0017665874,0.117771946,0.002258703,0.00065876293],"about_ca_topic_score_codex":0.000006532534,"about_ca_topic_score_gemma":0.000007717012,"teacher_disagreement_score":0.9749295,"about_ca_system_score_codex":0.00028857935,"about_ca_system_score_gemma":0.00064580067,"threshold_uncertainty_score":0.99971944},"labels":[],"label_agreement":null},{"id":"W2487380303","doi":"10.1007/978-1-4939-2864-4_302","title":"Quantum Analogues of Markov Chains","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov chain; Quantum; Computer science; Quantum mechanics; Physics; Machine learning","score_opus":0.009786744468596042,"score_gpt":0.22243669376813388,"score_spread":0.21264994929953784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487380303","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021074027,0.002778376,0.22493199,0.000700848,0.0027298653,0.00048461428,0.00032156042,0.0003080185,0.767534],"genre_scores_gemma":[0.003430761,0.008829474,0.23006631,0.00021953825,0.0035869144,0.00002267066,0.00008138761,0.0003165742,0.75344634],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966554,0.000053374893,0.0010436818,0.0008808433,0.000856427,0.00051025127],"domain_scores_gemma":[0.9966658,0.0003872982,0.0010276708,0.001418648,0.00030124988,0.0001993435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043892852,0.0006294985,0.0010981238,0.0005411232,0.000087940796,0.000028200322,0.0020234003,0.00043015045,0.000098235876],"category_scores_gemma":[0.000058549165,0.0004900693,0.0005018197,0.00015135601,0.00033120418,0.00016323985,0.0007683535,0.00050172216,0.00005548841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010290949,0.00006736021,0.000020057301,0.00018191032,0.00020331638,0.00007981773,0.00057874154,0.00003223126,0.00004245698,0.4075115,0.0026270654,0.5886453],"study_design_scores_gemma":[0.0017671407,0.0017996489,0.00075974094,0.0032735371,0.00019592948,0.00016391065,0.000019069998,0.10475751,0.00059209636,0.29477322,0.5888215,0.003076736],"about_ca_topic_score_codex":0.000021629061,"about_ca_topic_score_gemma":0.0000041210537,"teacher_disagreement_score":0.5861944,"about_ca_system_score_codex":0.00004381907,"about_ca_system_score_gemma":0.000286154,"threshold_uncertainty_score":0.9997551},"labels":[],"label_agreement":null},{"id":"W2492854019","doi":"10.1007/978-3-662-45711-5","title":"Transactions on Computational Science XXIV","year":2014,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.009395840214901856,"score_gpt":0.23996707279593002,"score_spread":0.23057123258102816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492854019","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019517296,0.00007608926,0.99227804,0.0012329135,0.0032949084,0.00037561552,0.000007818765,0.00040197684,0.0021374945],"genre_scores_gemma":[0.19846155,0.000005546206,0.7961429,0.0037434264,0.0008426195,0.000015556177,0.000006608904,0.000056905927,0.0007248975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926577,0.00009749012,0.0006596115,0.0027061794,0.002579293,0.001299723],"domain_scores_gemma":[0.99584866,0.0011335474,0.0003386554,0.0018297615,0.00044441057,0.00040495867],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002059906,0.00074115564,0.00066674803,0.0021839677,0.0012393482,0.001298251,0.006882827,0.0002900462,0.000015343672],"category_scores_gemma":[0.00010296101,0.00066499517,0.00021555636,0.0032619098,0.0024846783,0.0005984118,0.0005353794,0.0016945286,0.00012218599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002100481,0.00004031225,0.0000016651021,0.000016021422,0.0000038671988,0.00002076155,0.0003532781,0.5716625,0.000017689747,0.0021226744,0.00003403592,0.4257251],"study_design_scores_gemma":[0.00027645208,0.0003012556,0.00010108244,0.0003360915,0.000005070946,0.00011330627,7.692957e-8,0.8883153,0.0005112532,0.10793088,0.001423536,0.00068568997],"about_ca_topic_score_codex":0.000010398353,"about_ca_topic_score_gemma":0.000014582913,"teacher_disagreement_score":0.4250394,"about_ca_system_score_codex":0.00076624623,"about_ca_system_score_gemma":0.0038474677,"threshold_uncertainty_score":0.9997385},"labels":[],"label_agreement":null},{"id":"W2494512993","doi":"10.1109/ismvl.2016.44","title":"Fault Detection in Parity Preserving Reversible Circuits","year":2016,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Parity (physics); Electronic circuit; Computer science; Stuck-at fault; Fault detection and isolation; Fault model; Parity bit; Fault tolerance; Computer engineering; Algorithm; Engineering; Distributed computing; Electrical engineering; Artificial intelligence; Physics; Particle physics","score_opus":0.013366093896213809,"score_gpt":0.2292091166807825,"score_spread":0.21584302278456868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494512993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19661261,0.000023528237,0.7991075,0.0012367415,0.00024313244,0.00006622943,3.130802e-7,0.00019229649,0.0025176613],"genre_scores_gemma":[0.9901534,0.0000047332114,0.009030086,0.00011424454,0.0000537453,0.0000028544766,6.444232e-8,0.0000038543544,0.0006370554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991235,0.00005638527,0.00013025024,0.0003017863,0.00014603995,0.00024201337],"domain_scores_gemma":[0.9994249,0.00010806637,0.000033814205,0.0003512524,0.000028594572,0.00005340098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026294016,0.00007920926,0.0000863592,0.00010026987,0.00007195427,0.000056251905,0.00051988533,0.000045283377,0.000019060228],"category_scores_gemma":[0.00006621544,0.000051123912,0.00003246579,0.00033675157,0.000014060824,0.0002878531,0.00027325944,0.00009394937,0.000038765993],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012770718,0.000033322223,0.001984708,0.000009822793,0.0000038056046,0.000012858173,0.00022128083,0.0005921892,0.009661824,0.0025359546,0.0002908769,0.9846521],"study_design_scores_gemma":[0.0007999255,0.00010766223,0.035514325,0.00013935314,0.0000016516226,0.0000385876,0.000012271458,0.8949935,0.040867798,0.021398496,0.005767039,0.00035940524],"about_ca_topic_score_codex":0.00014488884,"about_ca_topic_score_gemma":0.00014779043,"teacher_disagreement_score":0.9842927,"about_ca_system_score_codex":0.00003548789,"about_ca_system_score_gemma":0.000021995038,"threshold_uncertainty_score":0.20847726},"labels":[],"label_agreement":null},{"id":"W2500983192","doi":"10.1007/978-3-540-28629-5_67","title":"A Common Algebraic Description for Probabilistic and Quantum Computations","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Université de Sherbrooke","funders":"","keywords":"Semiring; Complement (music); Generalization; Probabilistic logic; Computer science; Quantum gate; Discrete mathematics; Tensor (intrinsic definition); TRACE (psycholinguistics); Class (philosophy); Complexity class; Quantum computer; Quantum; Algebraic structure; Field (mathematics); Theoretical computer science; Mathematics; Computational complexity theory; Algorithm; Pure mathematics; Quantum mechanics; Physics; Artificial intelligence","score_opus":0.019035715424447864,"score_gpt":0.24748106096410197,"score_spread":0.2284453455396541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500983192","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014759065,0.00052901224,0.9937184,0.001425948,0.0013748399,0.0010088324,0.000015154954,0.0002822847,0.00016960873],"genre_scores_gemma":[0.43772,0.000019485113,0.56086886,0.00086121174,0.00038962744,0.000028438539,0.000016481246,0.00004815671,0.000047756672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962842,0.000038956976,0.0006167853,0.0016918473,0.0006383023,0.0007299105],"domain_scores_gemma":[0.9974635,0.0007980434,0.00032207824,0.00093597086,0.000256917,0.00022345109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077309244,0.0006065697,0.0006472147,0.00078616216,0.0005972696,0.00086598005,0.0018122952,0.00029532352,0.0000036053677],"category_scores_gemma":[0.00011393219,0.0005599847,0.00015294612,0.0005158174,0.0008281852,0.00040783733,0.0009263203,0.0007379342,0.0000076272972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006458535,0.000043556327,0.000014513481,0.00015423779,0.000012979418,0.000027814824,0.0010172596,0.27404797,0.000044058015,0.23700762,0.000009494136,0.48761404],"study_design_scores_gemma":[0.00027311058,0.00021842675,0.000120314195,0.00035023276,0.000008192265,0.00007775096,1.0254233e-7,0.5276011,0.000029349843,0.4708216,0.00014479096,0.0003549993],"about_ca_topic_score_codex":0.000036147732,"about_ca_topic_score_gemma":0.00007251886,"teacher_disagreement_score":0.48725903,"about_ca_system_score_codex":0.00030571688,"about_ca_system_score_gemma":0.000633534,"threshold_uncertainty_score":0.99968517},"labels":[],"label_agreement":null},{"id":"W25014018","doi":"10.1016/j.aquatox.2014.06.013","title":"A Quantum Algorithm for the Ferromagnetic Ising Model (Manuscript in preparation)","year":2008,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ising model; Quantum; Algorithm; Ferromagnetism; Quantum algorithm; Computer science; Quantum computer; Subject (documents); Mathematics; Statistical physics; Physics; Quantum mechanics","score_opus":0.029539940378437612,"score_gpt":0.2589807583748215,"score_spread":0.22944081799638388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25014018","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03134087,0.00023102271,0.9655817,0.0017844482,0.00025609587,0.00034462285,0.0000014434113,0.00015611829,0.00030368834],"genre_scores_gemma":[0.4199033,0.000013948974,0.57843375,0.0006527091,0.00009135381,0.00004658009,0.0000011975054,0.000010791806,0.00084637455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988045,0.000035628804,0.0002447307,0.0003744004,0.00020708948,0.00033364387],"domain_scores_gemma":[0.99916404,0.00021067052,0.000051487263,0.0004708154,0.000052815194,0.000050153507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002585646,0.00014275007,0.0001423868,0.000089587986,0.00037680398,0.00009965622,0.0007208569,0.0000432584,0.0000030106364],"category_scores_gemma":[0.000025189063,0.00009465874,0.00008079867,0.0003156597,0.000055231685,0.00019477065,0.00016050128,0.00014137426,0.00000831746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008227602,0.00013301216,0.000033081058,0.000010258769,0.000014282664,0.000022543809,0.004965533,0.7243605,0.00014008218,0.029992152,0.0037226933,0.23659763],"study_design_scores_gemma":[0.00031353958,0.00011044756,0.00041285434,0.000009592029,0.0000023180692,0.00007668991,0.000016953567,0.98757637,0.00009719959,0.010622545,0.0006166209,0.00014490321],"about_ca_topic_score_codex":0.0000668953,"about_ca_topic_score_gemma":0.00002144105,"teacher_disagreement_score":0.38856244,"about_ca_system_score_codex":0.000022961944,"about_ca_system_score_gemma":0.00009801654,"threshold_uncertainty_score":0.38600713},"labels":[],"label_agreement":null},{"id":"W2504500777","doi":"10.1103/physrevx.7.021027","title":"Optimizing Variational Quantum Algorithms Using Pontryagin’s Minimum Principle","year":2017,"lang":"en","type":"article","venue":"Physical Review X","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":152,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Quantum; Quantum algorithm; Quantum computer; Quantum phase estimation algorithm; Quantum annealing; Variational method; Computational complexity theory","score_opus":0.0353230616750476,"score_gpt":0.3420389790793262,"score_spread":0.30671591740427856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504500777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03335018,0.0059517324,0.9528054,0.00529461,0.0009702712,0.0004226038,0.0000083623045,0.00022821674,0.0009686152],"genre_scores_gemma":[0.55088323,0.00070897,0.44510996,0.0015894112,0.0015736957,0.000024496065,0.0000054015577,0.00003747541,0.00006734025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982826,0.000083800114,0.00027350063,0.00052873587,0.00043523047,0.00039612636],"domain_scores_gemma":[0.99807566,0.00012946135,0.0003256048,0.0012102781,0.00010066366,0.00015830182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037915263,0.00022474298,0.00042289772,0.000034303004,0.00071103027,0.00037815113,0.0016512882,0.000028003973,0.0000074039035],"category_scores_gemma":[0.00023514367,0.0001831892,0.0002238912,0.00012963054,0.00006760865,0.00043211452,0.00079411187,0.00026351865,0.000054486885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007838948,0.0007908498,0.00016021106,0.0013722123,0.00018480227,0.00014355416,0.0009911988,0.013495897,0.002962685,0.732716,0.0005668694,0.24660784],"study_design_scores_gemma":[0.00016111863,0.00003326785,0.0009093344,0.00074816734,0.000022472308,0.00002383016,5.764134e-7,0.9727182,0.00009218093,0.020899659,0.004147297,0.00024388965],"about_ca_topic_score_codex":0.00003112393,"about_ca_topic_score_gemma":5.0596975e-7,"teacher_disagreement_score":0.9592223,"about_ca_system_score_codex":0.000039825987,"about_ca_system_score_gemma":0.00011123426,"threshold_uncertainty_score":0.7470239},"labels":[],"label_agreement":null},{"id":"W2507686289","doi":"10.1103/physrevlett.118.080502","title":"Experimental Identification of Non-Abelian Topological Orders on a Quantum Simulator","year":2017,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Canadian Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"Ontario Ministry of Research, Innovation and Science; Basic Research Program of Jiangsu Province; Natural Sciences and Engineering Research Council of Canada; Departament d'Innovació, Universitats i Empresa, Generalitat de Catalunya; National Natural Science Foundation of China; Canadian Institute for Advanced Research; John Templeton Foundation","keywords":"Topological quantum computer; Toric code; Topological degeneracy; Topological order; Fibonacci number; Quantum computer; Topological entropy in physics; Topology (electrical circuits); Quantum simulator; Physics; Anyon; Symmetry protected topological order; Quantum algorithm; Topological quantum number; Quantum; String (physics); Theoretical physics; Quantum mechanics; Mathematics; Discrete mathematics","score_opus":0.019572273738886082,"score_gpt":0.3287744673008857,"score_spread":0.3092021935619996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507686289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95377845,0.00045456976,0.031924225,0.013161624,0.00030914485,0.00026555295,0.0000020555362,0.000054891334,0.000049467584],"genre_scores_gemma":[0.99438405,0.000051133764,0.0009432666,0.0044680783,0.00012877729,0.000012953828,0.000001125892,0.0000075760427,0.0000030179592],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875945,0.000063653555,0.0002664792,0.0003914116,0.00030155806,0.00021742987],"domain_scores_gemma":[0.998481,0.00009261307,0.0003062611,0.0010149103,0.00002704649,0.0000782209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019163557,0.00015856531,0.0003275692,0.000030649753,0.00023337294,0.00009967489,0.0011913155,0.000011503585,0.0000035955097],"category_scores_gemma":[0.00009886684,0.00011797515,0.00018826875,0.000091681824,0.00015140275,0.00014998097,0.00023710479,0.00015944657,0.000054939377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035309728,0.0021594937,0.0003578422,0.001357597,0.00013896918,0.00007756726,0.0014857142,0.012923192,0.7894657,0.07266275,0.0058565256,0.11347933],"study_design_scores_gemma":[0.0003366127,0.00026788915,0.005943187,0.00087897165,0.000016476339,0.0000037217665,0.000004194507,0.96372604,0.026398672,0.00093383476,0.0011714963,0.00031887845],"about_ca_topic_score_codex":0.000015310065,"about_ca_topic_score_gemma":8.2409905e-8,"teacher_disagreement_score":0.95080286,"about_ca_system_score_codex":0.0000184304,"about_ca_system_score_gemma":0.00001316215,"threshold_uncertainty_score":0.4810887},"labels":[],"label_agreement":null},{"id":"W2511528502","doi":"10.1109/isit.2016.7541703","title":"Concatenated codes for amplitude damping","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Guelph; University of Waterloo","funders":"","keywords":"Concatenation (mathematics); Concatenated error correction code; Block code; Luby transform code; Computer science; Linear code; Code (set theory); Construct (python library); Amplitude; Algorithm; Physics; Discrete mathematics; Mathematics; Arithmetic; Decoding methods; Quantum mechanics; Programming language","score_opus":0.02405255801100929,"score_gpt":0.2815785741887258,"score_spread":0.2575260161777165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511528502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038807252,0.00015017546,0.98794085,0.0036766801,0.001509989,0.00046624162,0.000034697125,0.0008164508,0.0015241753],"genre_scores_gemma":[0.43400386,0.000015681824,0.5629697,0.0010042347,0.00067957136,0.00011071901,0.000030785064,0.000040851985,0.0011445907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808615,0.000051298026,0.00032413035,0.0008763316,0.00020350717,0.00045859348],"domain_scores_gemma":[0.99822634,0.0003758022,0.00018691114,0.0009416882,0.00015508333,0.00011416656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036832585,0.0003068277,0.00037906968,0.000120681696,0.00016387072,0.0004062274,0.0018278679,0.00021086492,0.000008454914],"category_scores_gemma":[0.000067480214,0.00020486723,0.00020602383,0.00009102126,0.000053036645,0.00006734267,0.002189304,0.00030501178,0.000020442852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022079463,0.00014301218,0.0001826004,0.00061003095,0.00039876468,0.000030523675,0.0012994313,0.010602917,0.002845195,0.53163445,0.014341258,0.43788975],"study_design_scores_gemma":[0.000394612,0.000052892417,0.0002303729,0.0002926916,0.0000095384,0.00001181072,0.00000341203,0.76900566,0.0019066763,0.21611926,0.011449474,0.0005235762],"about_ca_topic_score_codex":0.00002355462,"about_ca_topic_score_gemma":0.000002820404,"teacher_disagreement_score":0.75840276,"about_ca_system_score_codex":0.00004308388,"about_ca_system_score_gemma":0.00014958311,"threshold_uncertainty_score":0.83542436},"labels":[],"label_agreement":null},{"id":"W2512412684","doi":"10.1109/iscas.2016.7538889","title":"Synthesis of reversible logic functions using ternary Max-Min algebra","year":2016,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Unary operation; Ternary operation; Toffoli gate; Realization (probability); Logic gate; Mathematics; Quantum circuit; Electronic circuit; Quantum; Galois theory; Quantum gate; Algorithm; Computer science; Discrete mathematics; Quantum algorithm; Quantum error correction; Physics; Quantum mechanics","score_opus":0.01866096518490481,"score_gpt":0.23045729554048752,"score_spread":0.2117963303555827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512412684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12255517,0.00003892623,0.8735664,0.0016829903,0.00027594704,0.000047336503,0.0000032713199,0.00013134284,0.0016986073],"genre_scores_gemma":[0.7419965,0.0000051778834,0.25634816,0.00020477998,0.00008221332,0.0000017532104,1.3002308e-7,0.000007542681,0.0013536956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913144,0.000048158407,0.00017441611,0.00027585583,0.0001613896,0.00020871259],"domain_scores_gemma":[0.9991379,0.0002461899,0.000078913996,0.00043321328,0.000043831784,0.000059972688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016182078,0.000101692705,0.0001421295,0.00011820572,0.00009872064,0.000026573982,0.00050715654,0.000040923827,0.00008463631],"category_scores_gemma":[0.000048809285,0.000060617724,0.000083546154,0.00026788627,0.000052368836,0.00016310587,0.0002785972,0.000051182087,0.000046515015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015275355,0.00020473296,0.0034608815,0.00006084307,0.00010969726,0.00006314903,0.00027982294,0.002874095,0.09336207,0.04996707,0.00475486,0.8448475],"study_design_scores_gemma":[0.0005825106,0.00026503074,0.004683466,0.00048425983,0.000040415365,0.0002684801,0.000057756308,0.86831945,0.08975484,0.030434733,0.004406628,0.0007024044],"about_ca_topic_score_codex":0.000057138255,"about_ca_topic_score_gemma":0.0000015353511,"teacher_disagreement_score":0.8654454,"about_ca_system_score_codex":0.000021184049,"about_ca_system_score_gemma":0.000042662483,"threshold_uncertainty_score":0.2471919},"labels":[],"label_agreement":null},{"id":"W2514765280","doi":"10.1063/1.4978327","title":"Pretty good state transfer in qubit chains—The Heisenberg Hamiltonian","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo; Royal Society","keywords":"Qubit; Hamiltonian (control theory); Kronecker delta; Algebraic number; Hypercube; Quantum; State (computer science); Kronecker product; Transfer (computing)","score_opus":0.015495566841307566,"score_gpt":0.25346409879861787,"score_spread":0.2379685319573103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514765280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30610135,0.00004664435,0.68779916,0.0049087727,0.00023392646,0.00011162171,0.0000017682536,0.000016984213,0.0007797566],"genre_scores_gemma":[0.9785286,0.000010177566,0.020893818,0.000186432,0.0002768305,0.0000014267688,7.209449e-8,0.000012326139,0.0000902718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860567,0.00008119493,0.00045266567,0.00014523773,0.00044161966,0.000273606],"domain_scores_gemma":[0.9986843,0.00022428216,0.00023937812,0.00066548004,0.00008082831,0.00010573864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007637338,0.00014735878,0.00032347842,0.000035619352,0.00024144884,0.0003277876,0.0016389864,0.000037487855,0.000002893883],"category_scores_gemma":[0.00009419945,0.0000874022,0.00018266439,0.00009676159,0.00011689071,0.00032798405,0.0001652282,0.0005337942,0.000011724146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054024433,0.0014865267,0.00048522203,0.0003049275,0.00021311727,0.00048467226,0.018883778,0.013676323,0.001357618,0.59475917,0.0006241425,0.36767045],"study_design_scores_gemma":[0.0007088439,0.00017872782,0.0046027857,0.00031192438,0.000013308967,0.0001387729,0.000020895732,0.501901,0.0010513229,0.49047005,0.0004084927,0.00019388561],"about_ca_topic_score_codex":0.0000041383905,"about_ca_topic_score_gemma":0.0000038131684,"teacher_disagreement_score":0.6724273,"about_ca_system_score_codex":0.000024739134,"about_ca_system_score_gemma":0.00007514607,"threshold_uncertainty_score":0.35641584},"labels":[],"label_agreement":null},{"id":"W2514778581","doi":"10.1109/iscas.2016.7538888","title":"Ternary max-min algebra for representation of reversible logic functions","year":2016,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Ternary operation; Algebra over a field; Representation (politics); Computer science; Mathematics; Discrete mathematics; Pure mathematics; Programming language","score_opus":0.022110031095093446,"score_gpt":0.2613111877895366,"score_spread":0.23920115669444317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514778581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02168629,0.000021286816,0.9720821,0.004512805,0.00032105035,0.0001247306,0.000004764139,0.00010785188,0.0011391352],"genre_scores_gemma":[0.52258325,0.000007803534,0.4660661,0.00046135538,0.00017658334,0.000017113707,0.0000030512354,0.000009417104,0.010675336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993259,0.00002391966,0.00015075345,0.00024751053,0.00010984079,0.00014213116],"domain_scores_gemma":[0.9992766,0.00021309107,0.00007126924,0.0003375285,0.000063954154,0.000037549096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111763686,0.00006602394,0.00009724876,0.00007635288,0.00007021577,0.000019818579,0.00032494852,0.00002895803,0.000030177727],"category_scores_gemma":[0.000044344564,0.00004008954,0.0000775492,0.0002021439,0.000028552893,0.00015344827,0.00012670984,0.000027816326,0.00002049946],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031568852,0.00015886208,0.0018568715,0.000044895314,0.000057659585,0.000007309123,0.00038234447,0.0010659166,0.039512992,0.14891222,0.03777848,0.7701909],"study_design_scores_gemma":[0.002574365,0.0011115979,0.009670775,0.0001829395,0.00002863618,0.00008905497,0.000098802884,0.6236185,0.071966104,0.2669456,0.023097266,0.00061635935],"about_ca_topic_score_codex":0.000022300086,"about_ca_topic_score_gemma":0.000001873794,"teacher_disagreement_score":0.7695745,"about_ca_system_score_codex":0.000010398642,"about_ca_system_score_gemma":0.000022999147,"threshold_uncertainty_score":0.1634804},"labels":[],"label_agreement":null},{"id":"W2516619901","doi":"10.1007/s00220-017-2923-9","title":"Fault-Tolerant Quantum Error Correction for non-Abelian Anyons","year":2017,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Topological quantum computer; Anyon; Toric code; Quantum; Abelian group; Lattice (music); Ising model; Symplectic geometry","score_opus":0.05536608491310637,"score_gpt":0.34700828059169686,"score_spread":0.2916421956785905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516619901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010254826,0.000035132816,0.98281604,0.0040088957,0.00042239952,0.00041379614,0.00000586925,0.00012181397,0.0019212293],"genre_scores_gemma":[0.7214504,0.000013076235,0.2781295,0.000091618494,0.00007868785,0.00009730578,0.000006159045,0.000016167753,0.000117116215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988712,0.00006573129,0.0003336342,0.0002819892,0.00015884683,0.0002885974],"domain_scores_gemma":[0.9947151,0.0006007401,0.00021659539,0.0042920043,0.0001030227,0.00007252195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041369293,0.00016235969,0.00026466083,0.00005604536,0.0010745734,0.00034190918,0.003885849,0.000068234694,0.0000015866513],"category_scores_gemma":[0.00030309704,0.00014719396,0.0001179276,0.00016592519,0.0002398257,0.00029716903,0.0010611165,0.00034494017,0.00004488596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006453964,0.0010810312,0.00014679633,0.00013037593,0.000031065647,0.0000019748545,0.0032305825,0.0032779695,0.0003322031,0.77312654,0.0017853283,0.21684967],"study_design_scores_gemma":[0.00022171426,0.00003177623,0.0005749777,0.00012265799,0.000005075638,0.0000037779414,0.0000346192,0.70919454,0.00010571853,0.2888336,0.00073930284,0.00013223522],"about_ca_topic_score_codex":0.000017483064,"about_ca_topic_score_gemma":0.000017528873,"teacher_disagreement_score":0.7111955,"about_ca_system_score_codex":0.00003887522,"about_ca_system_score_gemma":0.0000582643,"threshold_uncertainty_score":0.8264858},"labels":[],"label_agreement":null},{"id":"W2518441408","doi":"10.1038/ncomms13795","title":"Continuous-variable quantum computing on encrypted data","year":2016,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Villum Fonden","keywords":"Variable (mathematics); Computer science; Encryption; Quantum computer; Quantum; Computer security; Physics; Mathematics; Quantum mechanics","score_opus":0.028825689872811207,"score_gpt":0.2994533735312009,"score_spread":0.2706276836583897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518441408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073417854,0.0027040534,0.92755514,0.049647786,0.0014248658,0.0004084257,0.000121282006,0.0013503466,0.009446327],"genre_scores_gemma":[0.7610925,0.0000725674,0.23731539,0.0012361208,0.00012078004,0.0000034453842,0.000041920088,0.000015655207,0.00010163451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815,0.0002754535,0.00030868052,0.0005904679,0.00030338854,0.0003720006],"domain_scores_gemma":[0.9893629,0.001594693,0.00017399115,0.008591142,0.00016550331,0.00011175044],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007038186,0.00019969903,0.0002221639,0.0001374134,0.00059769105,0.00016959265,0.010282271,0.00021006475,0.000008970476],"category_scores_gemma":[0.0005476685,0.00013512356,0.00004999686,0.00064477336,0.0001314528,0.00030386163,0.0043127295,0.00091439066,0.00009632451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004275724,0.0001881761,0.00034529527,0.000004676197,0.00003944081,0.0000036117249,0.00017326612,0.00010103712,0.0014928367,0.8467384,0.018309707,0.13259931],"study_design_scores_gemma":[0.0005197799,0.000084220934,0.0021626963,0.00021879475,0.000010101181,0.000031556385,0.000013825537,0.68331134,0.00018977681,0.008701425,0.3043985,0.00035798794],"about_ca_topic_score_codex":0.00001693907,"about_ca_topic_score_gemma":0.000014791021,"teacher_disagreement_score":0.83803695,"about_ca_system_score_codex":0.000039664956,"about_ca_system_score_gemma":0.000112904796,"threshold_uncertainty_score":0.9950726},"labels":[],"label_agreement":null},{"id":"W2521927950","doi":"10.1145/2983535","title":"Quantum algorithms for machine learning","year":2016,"lang":"en","type":"article","venue":"XRDS Crossroads The ACM Magazine for Students","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum machine learning; Computer science; Quantum; Collision; Artificial intelligence; Quantum computer; Theoretical computer science; Algorithm; Machine learning; Physics; Computer security; Quantum mechanics","score_opus":0.02381000373843337,"score_gpt":0.3280131020699079,"score_spread":0.3042030983314745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521927950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11647966,0.00029954748,0.8700347,0.010080442,0.0014741768,0.0010563006,0.000083917555,0.00043673327,0.00005454098],"genre_scores_gemma":[0.7088179,0.00009043065,0.2720873,0.0013285284,0.0016881136,0.0006509494,0.000035149806,0.00017120433,0.01513044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972423,0.00008613195,0.00043954555,0.0007661281,0.0005994215,0.00086647726],"domain_scores_gemma":[0.9964441,0.0010835837,0.0002378655,0.0018741895,0.00021976136,0.00014052294],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0012922041,0.00036588626,0.00035919447,0.00010359759,0.0010585742,0.0005728652,0.0069360207,0.000091638794,0.000008610449],"category_scores_gemma":[0.0012370369,0.00019516653,0.000313491,0.00031045295,0.00015135892,0.00024823938,0.0028328334,0.00022235294,0.00007795486],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028689095,0.0006898498,0.018276405,0.00013942085,0.0004761491,0.000020152624,0.002804294,0.001423944,0.0100107705,0.024661291,0.025235966,0.91597486],"study_design_scores_gemma":[0.0070336354,0.001806274,0.019902779,0.00016594588,0.00006417448,0.00007371557,0.000026584219,0.559514,0.0019335331,0.08281204,0.3256288,0.0010385602],"about_ca_topic_score_codex":0.000013040639,"about_ca_topic_score_gemma":0.000008313298,"teacher_disagreement_score":0.9149363,"about_ca_system_score_codex":0.000054534634,"about_ca_system_score_gemma":0.000054943754,"threshold_uncertainty_score":0.9984369},"labels":[],"label_agreement":null},{"id":"W2526595197","doi":"10.48550/arxiv.1609.07786","title":"Extended Learning Graphs for Triangle Finding","year":2016,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Combinatorics; Computer science; Mathematics; Artificial intelligence; Discrete mathematics","score_opus":0.05977537356623829,"score_gpt":0.2051180674127344,"score_spread":0.1453426938464961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526595197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1742036,0.00015663115,0.8202248,0.00033572468,0.0025509777,0.0008663408,0.000038377493,0.00042843656,0.0011950737],"genre_scores_gemma":[0.98484874,0.00023310883,0.0066638906,0.00008050253,0.0005161632,0.0000037500195,0.000016339704,0.00007567333,0.0075618178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939822,0.00056460337,0.00063311204,0.0031504056,0.00021414297,0.001455566],"domain_scores_gemma":[0.99517405,0.0012902681,0.0010029218,0.0016287246,0.0003911038,0.00051293656],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012639335,0.0009389605,0.0010659815,0.0008380574,0.0015267167,0.00044573232,0.0033821831,0.00065099314,0.0000718595],"category_scores_gemma":[0.00029523674,0.00093936065,0.0013192056,0.001243779,0.0003286979,0.0004486563,0.002956181,0.001451916,0.00011506775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003108233,0.00028619266,0.0007765783,0.0003351819,0.0005120674,0.00046090054,0.0013406678,0.5883107,0.00031976274,0.3152993,0.00037202323,0.09167576],"study_design_scores_gemma":[0.0022423407,0.00041742797,0.00048008715,0.0006223921,0.00013851005,0.000021324786,0.00008144407,0.8184942,0.0002263352,0.17155373,0.004638654,0.0010835619],"about_ca_topic_score_codex":0.000033240736,"about_ca_topic_score_gemma":0.000005666552,"teacher_disagreement_score":0.81356096,"about_ca_system_score_codex":0.0002810821,"about_ca_system_score_gemma":0.0004728022,"threshold_uncertainty_score":0.99977314},"labels":[],"label_agreement":null},{"id":"W2527605658","doi":"10.22331/q-2023-01-19-901","title":"Quantum Tokens for Digital Signatures","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Ben-Gurion University of the Negev; Israel Science Foundation; Hebrew University of Jerusalem; European Commission; National Science Foundation","keywords":"Wife; Sign (mathematics); Digital signature; Quantum; Quantum computer; Computer science; Signature (topology); Fish <Actinopterygii>; Computer security; Law; Mathematics; Physics; Quantum mechanics; Hash function; Political science; Biology; Fishery","score_opus":0.015658231882587838,"score_gpt":0.2551596253151909,"score_spread":0.23950139343260304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527605658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29356942,0.00029945394,0.69274855,0.0060014627,0.0031514459,0.0005374553,0.00008723679,0.0029363905,0.0006686158],"genre_scores_gemma":[0.99303377,0.0000096254535,0.00551944,0.00036888308,0.00041936067,0.000032567936,0.000035858346,0.000033105058,0.0005474142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981982,0.000027450838,0.0002576166,0.000555592,0.00030897913,0.00065217004],"domain_scores_gemma":[0.99868757,0.00042922894,0.00008331914,0.0005775773,0.000079866804,0.00014247083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002776333,0.00022328591,0.00022908021,0.00021470527,0.00029756737,0.00044057824,0.0010486563,0.00009735256,0.0000044373414],"category_scores_gemma":[0.00014927392,0.00018899658,0.00019248223,0.0007797375,0.00005221546,0.00030579127,0.00034823208,0.00021205073,0.0002432388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027786307,0.00013684286,0.00017241512,0.00011025599,0.00007672758,0.00012806339,0.0016677205,0.012359204,0.0016853781,0.7435338,0.101177886,0.1389239],"study_design_scores_gemma":[0.00027505157,0.00018620922,0.0007034944,0.00002648931,0.000003260388,0.000012912845,0.000031714335,0.8787615,0.00024675467,0.07251694,0.04696441,0.00027130323],"about_ca_topic_score_codex":0.0000057440748,"about_ca_topic_score_gemma":8.757122e-7,"teacher_disagreement_score":0.86640227,"about_ca_system_score_codex":0.000017081435,"about_ca_system_score_gemma":0.00006505239,"threshold_uncertainty_score":0.77070564},"labels":[],"label_agreement":null},{"id":"W2530135691","doi":"","title":"Almost Perfect State Transfer Over Arbitrary Distances","year":2015,"lang":"en","type":"article","venue":"URSCA Proceedings","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Transfer (computing); State (computer science); Mathematics; Computer science; Algorithm","score_opus":0.012915910705010209,"score_gpt":0.22473441148507683,"score_spread":0.21181850078006662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530135691","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9374791,0.00045350072,0.051652387,0.0016064089,0.00056022976,0.00018210098,0.000005842741,0.0005682494,0.007492198],"genre_scores_gemma":[0.98581827,0.0000111370855,0.012927078,0.0005599306,0.00024080597,0.0000101151345,0.0000016224475,0.000022167334,0.00040885972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832165,0.0000117537675,0.00021451456,0.0005311454,0.00045904238,0.00046186513],"domain_scores_gemma":[0.9993488,0.000032802283,0.000042306165,0.00018091725,0.00012672003,0.00026843156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035199928,0.00023061883,0.00021104992,0.00009995456,0.00014390657,0.00036280195,0.0008253449,0.000054531436,0.0000075162548],"category_scores_gemma":[0.000029094599,0.00018731329,0.000086820204,0.00048326422,0.0000748021,0.00059986336,0.00014056973,0.00028240282,0.00003593295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024924852,0.0014449699,0.0330325,0.00064377184,0.0003763878,0.00036203058,0.14863808,0.0018784332,0.008227046,0.25633234,0.10805792,0.44075727],"study_design_scores_gemma":[0.002588344,0.0012929798,0.010610471,0.00029533022,0.000035380628,0.000342122,0.0005834555,0.7324035,0.011805018,0.069993824,0.16818208,0.0018675136],"about_ca_topic_score_codex":0.000028312867,"about_ca_topic_score_gemma":0.0000026143393,"teacher_disagreement_score":0.7305251,"about_ca_system_score_codex":0.00003767595,"about_ca_system_score_gemma":0.00009037238,"threshold_uncertainty_score":0.7638414},"labels":[],"label_agreement":null},{"id":"W2533940598","doi":"10.1103/physrevlett.119.030501","title":"Neural Decoder for Topological Codes","year":2017,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":192,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science; Ontario Trillium Foundation; National Science Foundation","keywords":"Boltzmann machine; Computer science; Artificial neural network; Decoding methods; Toric code; Code (set theory); Restricted Boltzmann machine; Topology (electrical circuits); Variety (cybernetics); Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Physics; Topological order; Quantum","score_opus":0.030741622364798035,"score_gpt":0.33188106354531316,"score_spread":0.3011394411805151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533940598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.286446,0.0028045264,0.52722245,0.18174848,0.00068592426,0.00064512325,0.0000063890316,0.00023085684,0.00021026863],"genre_scores_gemma":[0.9253655,0.00021557375,0.03313433,0.04060451,0.0006063247,0.000049221762,0.0000019396377,0.000010453843,0.000012129484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990314,0.000045512174,0.00013563801,0.00034927475,0.00014894854,0.00028922196],"domain_scores_gemma":[0.9988276,0.00019393019,0.00012096344,0.000747541,0.000025969237,0.00008399313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016517413,0.0001393588,0.0002985827,0.000011678735,0.0003939447,0.00019941789,0.0013253917,0.0000078031,0.0000024597546],"category_scores_gemma":[0.00016276391,0.000095719406,0.00022438267,0.000038599475,0.00010423106,0.00016145104,0.00030034233,0.00013757948,0.000021050539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011792634,0.00031571375,0.00046842583,0.0013321663,0.000082018494,0.00006631646,0.00030363377,0.002107909,0.0056816894,0.090405606,0.03408946,0.86513525],"study_design_scores_gemma":[0.00023603867,0.000094430674,0.0033264202,0.00035123195,0.000021201371,0.000015233713,4.1943372e-7,0.96515286,0.00018562324,0.0075207036,0.02280308,0.00029274207],"about_ca_topic_score_codex":0.0000048172537,"about_ca_topic_score_gemma":4.6012994e-7,"teacher_disagreement_score":0.96304494,"about_ca_system_score_codex":0.000008631894,"about_ca_system_score_gemma":0.0000085784695,"threshold_uncertainty_score":0.3903324},"labels":[],"label_agreement":null},{"id":"W2534741016","doi":"10.4230/lipics.ccc.2017.23","title":"Augmented Index and Quantum Streaming Algorithms for DYCK(2)","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Industry Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Leverage (statistics); Upper and lower bounds; Quantum; Computer science; Generalization; Algorithm; Quantum algorithm; Theoretical computer science; Mathematics; Quantum mechanics; Physics; Artificial intelligence","score_opus":0.01704133513518973,"score_gpt":0.26744324661322655,"score_spread":0.2504019114780368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534741016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056802783,0.00020783885,0.93321764,0.0010996588,0.0033419444,0.002592694,0.0018466817,0.000577456,0.00031326848],"genre_scores_gemma":[0.620129,0.00020576693,0.3722619,0.0018106857,0.002014577,0.001124607,0.0014138155,0.00030695723,0.00073269196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950205,0.00006717373,0.0017189124,0.0010147804,0.00072656065,0.0014520362],"domain_scores_gemma":[0.9956764,0.00054163404,0.0011849487,0.0016592817,0.0004984245,0.00043930003],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009564435,0.0010665717,0.0011260976,0.000595783,0.0006933997,0.0012756253,0.0024879312,0.0007501302,0.000005593605],"category_scores_gemma":[0.00015642992,0.00085435854,0.00055623654,0.0002484501,0.00021737942,0.00083370047,0.0037188353,0.0010916659,0.000017547569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004282446,0.0010313286,0.0036490562,0.009588051,0.002104484,0.000042174786,0.024575593,0.0045751696,0.00013806418,0.056523904,0.014329732,0.8830142],"study_design_scores_gemma":[0.0034605756,0.00035775147,0.0004740143,0.0011390529,0.00005959905,0.00007974124,0.0002001662,0.9464044,0.00022345695,0.022452576,0.023972828,0.0011758355],"about_ca_topic_score_codex":0.000028303599,"about_ca_topic_score_gemma":0.000008036192,"teacher_disagreement_score":0.9418292,"about_ca_system_score_codex":0.00019222003,"about_ca_system_score_gemma":0.0002715511,"threshold_uncertainty_score":0.99976116},"labels":[],"label_agreement":null},{"id":"W2536379336","doi":"10.1016/j.laa.2017.05.037","title":"Perfect quantum state transfer using Hadamard diagonalizable graphs","year":2017,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Brandon University; University of Guelph; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Diagonalizable matrix; Mathematics; Laplacian matrix; Eigenvalues and eigenvectors; Combinatorics; Cograph; Discrete mathematics; Graph; Chordal graph; Symmetric matrix; 1-planar graph; Quantum mechanics","score_opus":0.01945850489713435,"score_gpt":0.2677491987410982,"score_spread":0.24829069384396385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536379336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36788854,0.00046013953,0.63014954,0.0008280108,0.00009308606,0.00025873297,0.000016171678,0.000119527,0.00018627121],"genre_scores_gemma":[0.986016,0.00014488709,0.013290482,0.000202283,0.00013156001,0.000039092498,0.0000050370654,0.00001821788,0.00015244738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988975,0.000030112085,0.00018626946,0.0004385103,0.00016051733,0.00028709654],"domain_scores_gemma":[0.9989499,0.000064617554,0.000062935535,0.00071303156,0.00006946959,0.00014005748],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0001701438,0.00016233308,0.00017014556,0.0000691394,0.0013107652,0.00038078416,0.00075648987,0.00004934542,0.0000071611453],"category_scores_gemma":[0.000012943646,0.00014163165,0.00007290957,0.00013997829,0.00007984935,0.0002791028,0.00020196477,0.00017142674,0.00002154938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001118505,0.00025738956,0.0011418685,0.00014985485,0.00011202989,0.00001539314,0.001682258,0.0035106046,0.009556816,0.82672906,0.0002470861,0.15658645],"study_design_scores_gemma":[0.00024016023,0.000040117848,0.0020920483,0.00002119909,0.000015936086,0.000024760246,0.000005111891,0.95739675,0.0014372243,0.02755333,0.010938403,0.00023494606],"about_ca_topic_score_codex":0.00005366205,"about_ca_topic_score_gemma":0.000009074349,"teacher_disagreement_score":0.95388615,"about_ca_system_score_codex":0.000007410622,"about_ca_system_score_gemma":0.000049448743,"threshold_uncertainty_score":0.9999894},"labels":[],"label_agreement":null},{"id":"W2537746683","doi":"10.22331/q-2017-04-25-4","title":"Limits on the storage of quantum information in a volume of space","year":2017,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Qubit; Code (set theory); Locality; Quantum information; Erasure code; Upper and lower bounds; Erasure; Quantum; Operator (biology); Quantum computer","score_opus":0.015920231340553818,"score_gpt":0.24093518601733585,"score_spread":0.22501495467678204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537746683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92699194,0.00003335336,0.06695657,0.004543451,0.00045240542,0.00016964292,0.0000062437025,0.000034848028,0.0008115623],"genre_scores_gemma":[0.99848086,0.000007279276,0.0013407863,0.00009740247,0.00003090065,0.0000037516709,8.196464e-7,0.0000049602704,0.00003323493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888086,0.00007942866,0.00033586432,0.00016102225,0.00032418652,0.00021862099],"domain_scores_gemma":[0.998084,0.00016723653,0.0004987643,0.001131322,0.000080403646,0.000038287213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006176354,0.0001248924,0.0002160594,0.00014132471,0.00017852172,0.00011016449,0.0014530848,0.000056375615,0.0000048008455],"category_scores_gemma":[0.00032778952,0.00008578424,0.000075923184,0.00016740919,0.00011763357,0.0004042151,0.00023345977,0.00022357132,0.000025473077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004423808,0.00019312282,0.0030161191,0.0001135995,0.000023701281,0.000012991257,0.0066226507,0.014857026,0.00084224134,0.93302405,0.0018607081,0.039389577],"study_design_scores_gemma":[0.00023285563,0.00022432061,0.049639985,0.00013228496,0.0000018717952,0.0000034669765,0.000057461682,0.9403992,0.0012018948,0.0066786283,0.0013242235,0.00010376233],"about_ca_topic_score_codex":0.00022376206,"about_ca_topic_score_gemma":0.000008608436,"teacher_disagreement_score":0.9263454,"about_ca_system_score_codex":0.000015496005,"about_ca_system_score_gemma":0.00006402542,"threshold_uncertainty_score":0.34981796},"labels":[],"label_agreement":null},{"id":"W2545297326","doi":"10.1088/1367-2630/aa8fe3","title":"Equivalence between contextuality and negativity of the Wigner function for qudits","year":2017,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Western University","funders":"Division of Physics; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Gordon and Betty Moore Foundation","keywords":"Kochen–Specker theorem; Equivalence (formal languages); Physics; Negativity effect; Dimension (graph theory); Pure mathematics; Wigner distribution function; MAGIC (telescope); Quantum; Theoretical physics; Function (biology); Quantum mechanics; Mathematics","score_opus":0.04178742650885167,"score_gpt":0.2915115069865723,"score_spread":0.24972408047772063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545297326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3457116,0.00004603531,0.65277624,0.0010416948,0.00033677905,0.00004917159,0.000002906776,0.000003417831,0.000032123608],"genre_scores_gemma":[0.989911,0.0000028268705,0.00927107,0.000048496193,0.0007326395,1.6455806e-7,5.398029e-8,0.0000030127317,0.000030694682],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993818,0.000045413988,0.00018384865,0.00009473075,0.000195996,0.000098230026],"domain_scores_gemma":[0.99858546,0.00019173486,0.0006936607,0.00032644568,0.00014879796,0.000053891585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036268932,0.0000680946,0.00017318307,0.00001056781,0.0002607318,0.0000899898,0.000664675,0.000023820632,3.0306623e-7],"category_scores_gemma":[0.0001237348,0.000042394102,0.000099204466,0.000042052783,0.00008985551,0.00030156184,0.00019854707,0.00014748497,1.4841406e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015196274,0.000028253682,0.0070185624,0.00003100753,0.000044916596,4.7123908e-7,0.0005953417,0.00041290754,0.0020275342,0.013320498,0.00059925456,0.9759061],"study_design_scores_gemma":[0.0018387535,0.00076673453,0.53542197,0.00033859618,0.0000855221,0.000020401165,0.000021447646,0.046887934,0.020993678,0.3913551,0.0020479043,0.00022196173],"about_ca_topic_score_codex":0.000020060901,"about_ca_topic_score_gemma":0.0000021524916,"teacher_disagreement_score":0.9756841,"about_ca_system_score_codex":0.0000072570106,"about_ca_system_score_gemma":0.00008859719,"threshold_uncertainty_score":0.20053644},"labels":[],"label_agreement":null},{"id":"W2550835866","doi":"10.1098/rspa.2017.0698","title":"Computational tameness of classical non-causal models","year":2018,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; McGill University","keywords":"Factorization; Class (philosophy); Order (exchange); Combinatorics; Consistency (knowledge bases); Closed timelike curve; Physics; Characterization (materials science); Mathematics; Discrete mathematics; Algorithm; Quantum mechanics; Computer science","score_opus":0.009547470631499686,"score_gpt":0.21856794026272486,"score_spread":0.20902046963122517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550835866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7444289,0.000008393205,0.25463036,0.00043024274,0.00004591189,0.000059996637,8.597028e-7,0.00003555787,0.0003598014],"genre_scores_gemma":[0.9058868,3.5308807e-7,0.09397187,0.0000244702,0.000095346404,0.0000026332843,3.1723996e-8,0.0000039124143,0.000014525024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895895,0.0000026375953,0.00018156403,0.00023344687,0.00041683795,0.00020656914],"domain_scores_gemma":[0.9995355,0.00014901791,0.00008463983,0.00006608384,0.00010198602,0.000062796535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026099363,0.00011777638,0.00022032803,0.000017597677,0.00016175707,0.00006759384,0.0006710432,0.00003481105,7.7133467e-7],"category_scores_gemma":[0.000039510534,0.00007052527,0.0001335711,0.00038824577,0.0006902656,0.00015754909,0.0004201682,0.00012321389,8.021967e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002720905,0.00022393811,0.000054362925,0.00043541225,0.00003979426,7.1395476e-8,0.0055744937,0.1918363,0.005316286,0.79468334,0.00022990334,0.0016033519],"study_design_scores_gemma":[0.00006709817,0.00009654253,0.0003560563,0.000103359445,0.0000057635234,0.0000019768825,0.000028505048,0.82655424,0.0025595191,0.17014784,0.0000035391733,0.00007556777],"about_ca_topic_score_codex":0.000002006349,"about_ca_topic_score_gemma":9.305138e-9,"teacher_disagreement_score":0.63471794,"about_ca_system_score_codex":0.0000071978807,"about_ca_system_score_gemma":0.000022508744,"threshold_uncertainty_score":0.2875937},"labels":[],"label_agreement":null},{"id":"W2551884148","doi":"10.5539/jmr.v8n6p128","title":"The Fundamental Matrix of the Simple Random Walk with Mixed Barriers","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Stochastic matrix; Identity matrix; Simple (philosophy); State (computer science); Combinatorics; State-transition matrix; Inverse; Involutory matrix; Nonnegative matrix; Random matrix; Row; Square matrix; Identity (music); Symmetric matrix; Statistics; Algorithm; Eigenvalues and eigenvectors; Markov chain; Quantum mechanics; Geometry; Physics","score_opus":0.023599952109987787,"score_gpt":0.32111323644182627,"score_spread":0.2975132843318385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551884148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8427982,0.00026512615,0.14772834,0.008420706,0.00027726113,0.0002528267,0.0000033615077,0.000011294501,0.00024292029],"genre_scores_gemma":[0.97913224,0.000043017702,0.02030982,0.000013138718,0.000098439836,0.0000020635123,1.965085e-8,0.000011259865,0.0003900091],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972275,0.0003602505,0.00045519805,0.00010831776,0.0014991927,0.0003495789],"domain_scores_gemma":[0.99595773,0.0025389544,0.0003706966,0.00056535227,0.0004338926,0.00013336203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004542706,0.0000960134,0.00021982582,0.00011088776,0.0004524383,0.00016055214,0.0020200063,0.00003307029,0.000012499475],"category_scores_gemma":[0.0006856023,0.000030914085,0.00014289869,0.00041240145,0.00035382513,0.000112539004,0.00045446435,0.0003919614,0.0000046616638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015423358,0.0016885826,0.0067697093,0.0010580452,0.00203728,0.00041215075,0.037089728,0.0061011184,0.09458183,0.24338774,0.058418933,0.54691255],"study_design_scores_gemma":[0.017901896,0.0043486687,0.0046026506,0.0035051247,0.00008903966,0.0035623754,0.0070362072,0.38892838,0.086053886,0.4402286,0.042871427,0.00087173365],"about_ca_topic_score_codex":0.000004118404,"about_ca_topic_score_gemma":0.0000053556373,"teacher_disagreement_score":0.54604083,"about_ca_system_score_codex":0.000052387575,"about_ca_system_score_gemma":0.00032110975,"threshold_uncertainty_score":0.3753708},"labels":[],"label_agreement":null},{"id":"W2552133479","doi":"10.1038/nature20479","title":"Efficient fault tolerance","year":2016,"lang":"fr","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Computer science; Quantum computer; Fault tolerance; Quantum; Algorithm; Distributed computing; Physics; Quantum mechanics","score_opus":0.007631172105604312,"score_gpt":0.24296910139764016,"score_spread":0.23533792929203584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552133479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3051545,0.07453699,0.33761486,0.24757074,0.028854774,0.0003760165,0.00009000957,0.0005342256,0.0052678925],"genre_scores_gemma":[0.9391204,0.00009337387,0.03169886,0.0042763078,0.0022260435,0.000004302691,8.220759e-7,0.000029508337,0.02255038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976627,0.00012481991,0.00024517707,0.0007322972,0.00052699225,0.0007079724],"domain_scores_gemma":[0.9984881,0.00024934966,0.00011394511,0.0007466011,0.00019293545,0.0002090172],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00031422928,0.0002953899,0.00024713235,0.00008225592,0.00021867373,0.00016589496,0.0010535821,0.0014263547,0.00010518729],"category_scores_gemma":[0.00014214944,0.0001899534,0.00016931859,0.0005497066,0.00017308435,0.000092280054,0.0003743594,0.0022965411,0.0005073913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009909857,0.0001429771,0.00006220997,0.000049499205,0.000023228626,0.00016561388,0.0007182778,0.026066428,0.0012552567,0.08224831,0.024722539,0.86453575],"study_design_scores_gemma":[0.000507483,0.00008850889,0.0016383489,0.0006200113,0.000007747331,0.00015966877,0.0000035452645,0.558952,0.0011867585,0.0027025286,0.43378562,0.00034779485],"about_ca_topic_score_codex":0.000014063433,"about_ca_topic_score_gemma":0.00000412952,"teacher_disagreement_score":0.86418796,"about_ca_system_score_codex":0.00007208153,"about_ca_system_score_gemma":0.00013451462,"threshold_uncertainty_score":0.99987},"labels":[],"label_agreement":null},{"id":"W2558251195","doi":"10.1109/hpec.2016.7761625","title":"Abstractions considered helpful: A tools architecture for quantum annealers","year":2016,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; USable; Abstraction; Usability; Quantum; Quantum computer; Class (philosophy); Set (abstract data type); Architecture; Computer architecture; Distributed computing; Theoretical computer science; Software engineering; Human–computer interaction; Programming language; Multimedia; Artificial intelligence","score_opus":0.027320213286322125,"score_gpt":0.25900770154982616,"score_spread":0.23168748826350405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558251195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026283644,0.00004139222,0.94815576,0.02305008,0.00062643754,0.00033083177,0.000032359694,0.0005677226,0.00091178424],"genre_scores_gemma":[0.77426165,0.000007424446,0.22292794,0.0012888566,0.00031636778,0.000059788785,0.0000032713142,0.000025701658,0.0011089799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984109,0.00004188345,0.00026649312,0.00053471164,0.00019399734,0.0005520615],"domain_scores_gemma":[0.9979879,0.0010368997,0.00009671179,0.0006030253,0.00011136565,0.00016405452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024692356,0.00020213825,0.0002035181,0.00013125612,0.00029460047,0.00019812693,0.0006249205,0.000081333994,0.000043423683],"category_scores_gemma":[0.0001814857,0.00012092179,0.00016952626,0.00017417366,0.00008084653,0.00025701552,0.00015993122,0.00012713761,0.000071651935],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025121799,0.0001104211,0.000049818813,0.000029238723,0.00007119998,0.000020874464,0.0004926435,0.006005028,0.012145033,0.11740537,0.018404236,0.845241],"study_design_scores_gemma":[0.002969024,0.00070786953,0.003538102,0.00017877737,0.00002327207,0.00045804755,0.00009033471,0.6026182,0.012039835,0.1586854,0.21744086,0.0012502719],"about_ca_topic_score_codex":0.00001509297,"about_ca_topic_score_gemma":0.000019837733,"teacher_disagreement_score":0.84399074,"about_ca_system_score_codex":0.00002512541,"about_ca_system_score_gemma":0.00010109435,"threshold_uncertainty_score":0.49310476},"labels":[],"label_agreement":null},{"id":"W2559657995","doi":"10.26421/qic17.9-10-5","title":"Pretty good state transfer between internal nodes of paths","year":2017,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Path graph; Path (computing); Wheel graph; Hamiltonian (control theory); Combinatorics; Mathematics; Quantum walk; Graph; Transfer (computing); Quantum; Hamiltonian path; State (computer science); Integer (computer science); Discrete mathematics; Physics; Quantum mechanics; Computer science; Quantum algorithm; Graph power; Algorithm; Mathematical optimization","score_opus":0.01618188543001926,"score_gpt":0.26343674458941146,"score_spread":0.24725485915939222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559657995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35385662,0.00006862598,0.6447868,0.00023513591,0.00041893846,0.00020159922,0.000057691857,0.00010908928,0.00026553153],"genre_scores_gemma":[0.98749,0.000052155472,0.012149787,0.0000744191,0.00007392554,0.000008860288,0.00013312393,0.000008958637,0.000008787314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816656,0.00009441704,0.0007950816,0.00028968285,0.00042722953,0.00022703069],"domain_scores_gemma":[0.99850065,0.00011101185,0.0005911646,0.00044338085,0.00025086242,0.000102956175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004741615,0.0002869398,0.0004160742,0.00028350652,0.00021648238,0.00067279575,0.00080434914,0.00017076601,0.0000012731047],"category_scores_gemma":[0.00003273842,0.00026376563,0.0001275005,0.00008735453,0.00008950171,0.00093871704,0.00061347557,0.0005031028,0.000008540499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017180588,0.00003347693,0.0017124146,0.00067864486,0.00009420072,0.0000022136408,0.0095230285,0.04469913,0.000016640563,0.010939738,0.0000763802,0.9322069],"study_design_scores_gemma":[0.00042030244,0.00011353374,0.032834645,0.00031778743,0.000017082455,0.000009097802,0.00002859049,0.93533164,0.0002181275,0.030069126,0.00035313255,0.00028694814],"about_ca_topic_score_codex":0.00012614793,"about_ca_topic_score_gemma":0.0000021737596,"teacher_disagreement_score":0.93192,"about_ca_system_score_codex":0.000026835298,"about_ca_system_score_gemma":0.00015180338,"threshold_uncertainty_score":0.99998146},"labels":[],"label_agreement":null},{"id":"W2562046152","doi":"10.48550/arxiv.1801.08653","title":"Efficient Combinatorial Optimization Using Quantum Annealing","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum annealing; Quadratic unconstrained binary optimization; Heuristics; Computer science; Quantum; Quantum computer; Ising model; Simulated annealing; Clique; Graph; Theoretical computer science; Algorithm; Mathematics; Statistical physics; Combinatorics; Quantum mechanics; Physics","score_opus":0.04575292858148585,"score_gpt":0.1972359380443834,"score_spread":0.15148300946289756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562046152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40877175,0.000026290392,0.5877341,0.00002579504,0.0029280034,0.00014361662,0.000005428075,0.00025105957,0.00011393514],"genre_scores_gemma":[0.9578583,0.000009027282,0.041522857,0.00003878297,0.00050920213,2.1459502e-7,0.000010643347,0.000025867535,0.000025101848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976742,0.00019861542,0.00025480628,0.001246111,0.00015772821,0.00046851276],"domain_scores_gemma":[0.99801975,0.000087444045,0.00035430613,0.0010924117,0.00026826875,0.00017780358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003725399,0.00036856768,0.00035414827,0.00030930078,0.0004320383,0.00024774516,0.0016852485,0.0003149593,0.000011089693],"category_scores_gemma":[0.000039787978,0.00041736005,0.0002099796,0.00071709545,0.00013450852,0.000086275635,0.0025579485,0.0005913474,0.000019137553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011376675,0.000060610684,0.000091660935,0.000033279463,0.00003401709,0.00009127976,0.00020053374,0.9703683,0.000006843082,0.028959038,0.00003205057,0.00011098905],"study_design_scores_gemma":[0.00042202557,0.00006222693,0.000039124192,0.00015395653,0.000037749138,0.000009552932,0.000014372165,0.98379886,0.000041103336,0.014918831,0.00003927464,0.0004629086],"about_ca_topic_score_codex":0.00011717107,"about_ca_topic_score_gemma":8.9670374e-7,"teacher_disagreement_score":0.5490866,"about_ca_system_score_codex":0.0002053925,"about_ca_system_score_gemma":0.00025794093,"threshold_uncertainty_score":0.9998278},"labels":[],"label_agreement":null},{"id":"W2568356985","doi":"10.1145/2518131","title":"From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Fonds Québécois de la Recherche sur la Nature et les Technologies; Mitacs; Canada Research Chairs","keywords":"Mathematical proof; Uncertainty principle; Mathematics; Norm (philosophy); Discrete mathematics; Cryptography; Relation (database); Key (lock); Entropic uncertainty; Euclidean geometry; Quantum cryptography; Theoretical computer science; Quantum; Quantum information; Computer science; Algorithm; Law","score_opus":0.0047677070574981655,"score_gpt":0.20825070281678557,"score_spread":0.2034829957592874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568356985","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81195205,0.000023537683,0.17936966,0.008104609,0.00043179846,0.000072943796,7.498128e-7,0.0000125223605,0.000032123302],"genre_scores_gemma":[0.96419555,0.0000010839185,0.035188776,0.00045171447,0.00014432287,0.0000011136784,2.750959e-7,0.0000023129262,0.0000148637755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992759,0.000028258755,0.00027746565,0.00006894533,0.00024195922,0.00010744486],"domain_scores_gemma":[0.9989773,0.0001032979,0.00028791386,0.0004179633,0.00013916047,0.000074358446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002144163,0.000065964494,0.00008983468,0.000112362126,0.00017221957,0.00020019671,0.0009381938,0.000026462183,0.000005969546],"category_scores_gemma":[0.00037276337,0.000040946597,0.000055147695,0.00025330513,0.000010690961,0.00038665324,0.0005550277,0.0001782973,0.000021111537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009147276,0.000039760507,0.0012660741,0.00000921737,0.000030223908,0.0000016174312,0.01990028,0.8239239,0.002148097,0.00079777086,0.010157686,0.14171623],"study_design_scores_gemma":[0.00023007796,0.00006228262,0.048909634,0.000155821,0.000008178742,0.000042802723,0.00015260233,0.9364645,0.00048373072,0.011813637,0.0015741142,0.000102617385],"about_ca_topic_score_codex":0.00009044018,"about_ca_topic_score_gemma":0.0000014623741,"teacher_disagreement_score":0.15224348,"about_ca_system_score_codex":0.00006515986,"about_ca_system_score_gemma":0.000032549186,"threshold_uncertainty_score":0.19305015},"labels":[],"label_agreement":null},{"id":"W2569934227","doi":"10.1145/2493252.2493256","title":"Quantum rejection sampling","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Defense Advanced Research Projects Agency","keywords":"Quantum algorithm; Mathematics; Quantum state; Quantum sort; Quantum; Quantum phase estimation algorithm; Quantum operation; Algorithm; Computer science; Quantum error correction; Open quantum system; Quantum mechanics; Physics","score_opus":0.019020761596398737,"score_gpt":0.2617099762310813,"score_spread":0.24268921463468254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569934227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03752192,0.000027196696,0.9586483,0.0016846012,0.00095765287,0.00023089707,0.0000016740029,0.0006768296,0.00025088675],"genre_scores_gemma":[0.81376755,0.0000056880554,0.1853757,0.0005640423,0.000073253075,0.000032249824,0.0000031263241,0.00001731947,0.00016106006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853396,0.00021397888,0.00027554564,0.00043954034,0.00025817298,0.00027882343],"domain_scores_gemma":[0.99835885,0.0007322882,0.000095440446,0.00058302644,0.00012662026,0.000103797414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000349824,0.00018697167,0.00014957426,0.00027328933,0.0004942378,0.0002569465,0.0006480297,0.000075347816,0.00007981909],"category_scores_gemma":[0.000044528784,0.00017313467,0.00011630869,0.00053198234,0.00004787661,0.0004247407,0.000021304426,0.00032628092,0.00043778526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000641958,0.000086864056,0.0000025104594,0.0000074538984,0.000023277142,0.000001228213,0.0005233233,0.24080077,0.00031656108,0.022569994,0.0000787183,0.7355829],"study_design_scores_gemma":[0.00022566115,0.00012730941,0.00072782923,0.000025780691,0.000005871775,0.00002980824,0.00005556949,0.64394045,0.0006249526,0.35375538,0.0002908985,0.00019049719],"about_ca_topic_score_codex":0.000033039007,"about_ca_topic_score_gemma":0.0000011077772,"teacher_disagreement_score":0.77624565,"about_ca_system_score_codex":0.000046134137,"about_ca_system_score_gemma":0.000040040966,"threshold_uncertainty_score":0.7060227},"labels":[],"label_agreement":null},{"id":"W2570103531","doi":"","title":"How significant are the known collision and element distinctness quantum algorithms","year":2003,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Collision; Element (criminal law); Algorithm; Quantum; Computer science; Quantum algorithm; Mathematics; Physics; Quantum mechanics; Programming language; Political science","score_opus":0.015044609118566062,"score_gpt":0.2394091873235028,"score_spread":0.22436457820493674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570103531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32134715,0.0002364529,0.6731524,0.0033064557,0.0013919768,0.00019948604,0.0000019156923,0.00010145142,0.00026272246],"genre_scores_gemma":[0.97689396,0.000032257853,0.021899823,0.0006591048,0.0004113299,0.0000019273107,6.975549e-7,0.000017707307,0.000083195235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757516,0.00016821857,0.00052627036,0.00037385503,0.00071830384,0.00063817244],"domain_scores_gemma":[0.9979648,0.00049849704,0.00062445033,0.0004549608,0.00019804183,0.00025926146],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017292335,0.00032754012,0.00032040887,0.00016773665,0.001524697,0.002057969,0.0009487445,0.00007288619,0.0000024009341],"category_scores_gemma":[0.00026764965,0.00018339307,0.00013186697,0.00049184996,0.00010129561,0.00036028159,0.00031986082,0.00088910206,0.000009085193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027739497,0.00022112136,0.0028537156,0.00006104801,0.00012923923,0.00039046956,0.0032318372,0.08114889,0.000107817184,0.107356116,0.001708659,0.80276334],"study_design_scores_gemma":[0.00073092576,0.0004014275,0.0033547175,0.0002605051,0.000009375947,0.0011079973,0.0006116417,0.9562917,0.00043505503,0.0045017726,0.03188875,0.00040616852],"about_ca_topic_score_codex":0.0000039708157,"about_ca_topic_score_gemma":6.206573e-7,"teacher_disagreement_score":0.87514275,"about_ca_system_score_codex":0.00007638006,"about_ca_system_score_gemma":0.00011106204,"threshold_uncertainty_score":0.9997752},"labels":[],"label_agreement":null},{"id":"W2570901353","doi":"10.4204/eptcs.266.5","title":"A Finite Presentation of CNOT-Dihedral Operators","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Defense","keywords":"Controlled NOT gate; Dihedral angle; Dihedral group; Unitary state; Mathematics; Pure mathematics; Discrete mathematics; Computer science; Algebra over a field; Topology (electrical circuits); Combinatorics; Physics; Quantum gate; Quantum; Quantum mechanics; Quantum computer; Law; Group (periodic table)","score_opus":0.004989352581409593,"score_gpt":0.24526467180129644,"score_spread":0.24027531921988685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570901353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4620057,0.000029211144,0.535549,0.000533312,0.00029255,0.00016374,3.336301e-7,0.000114263916,0.0013119198],"genre_scores_gemma":[0.9248412,0.0000032698922,0.07470185,0.00021675142,0.00021735679,0.000006698575,2.0581263e-7,0.0000084662,0.000004149745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714595,0.000031524447,0.00039020096,0.0007952472,0.0006811873,0.0009558771],"domain_scores_gemma":[0.9989062,0.00014147729,0.00012288119,0.00031303058,0.00037430786,0.00014212418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015777991,0.00019949426,0.00024013016,0.00041378444,0.00026565182,0.0002897021,0.0024899612,0.00006201274,0.000012345543],"category_scores_gemma":[0.00019834397,0.00016733493,0.000056829504,0.0027372674,0.0022929336,0.0006885534,0.0009170264,0.0003682494,0.000012254385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010761093,0.00005640081,0.00025508017,0.000009956504,0.0000032212859,0.000001640326,0.0016025183,0.00024569937,0.0021452792,0.9759472,0.000017415921,0.019704804],"study_design_scores_gemma":[0.00024919177,0.000701698,0.00065209664,0.00004943255,0.0000017176112,0.000026508402,0.000009247556,0.81937915,0.03448436,0.14420752,0.000063301995,0.00017579409],"about_ca_topic_score_codex":0.000004985674,"about_ca_topic_score_gemma":0.000001296435,"teacher_disagreement_score":0.83173966,"about_ca_system_score_codex":0.000108683795,"about_ca_system_score_gemma":0.0003222096,"threshold_uncertainty_score":0.84484094},"labels":[],"label_agreement":null},{"id":"W2571163186","doi":"10.48550/arxiv.1612.09512","title":"Efficient Quantum Algorithms for Simulating Lindblad Evolution","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Canadian Institute for Advanced Research","funders":"","keywords":"Quantum; Algorithm; Computer science; Quantum algorithm; Physics; Quantum mechanics","score_opus":0.04860316703286171,"score_gpt":0.20898669260413438,"score_spread":0.16038352557127267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571163186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19625795,0.00008255404,0.80081826,0.00019533696,0.0015090914,0.00047822754,0.0000400388,0.0004526132,0.00016589955],"genre_scores_gemma":[0.9821508,0.000006029626,0.016918883,0.00004960305,0.00047405594,0.0000023971356,0.000009661211,0.00003394657,0.00035462275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707127,0.00013874052,0.00032746536,0.0016176032,0.00015758046,0.00068736187],"domain_scores_gemma":[0.99734753,0.00046458945,0.00041689022,0.0012699369,0.00028732882,0.0002137021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048059216,0.0004581941,0.0004368867,0.00033507898,0.00044077844,0.00015485537,0.0018834498,0.00036725335,0.0000043682826],"category_scores_gemma":[0.00009954586,0.0004292102,0.0004277425,0.00045783026,0.000106313884,0.00009028577,0.002123611,0.00055207807,0.000036877587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014945352,0.000064508924,0.00009090515,0.00006383787,0.000047924135,0.00004000637,0.00014307235,0.878339,0.000036931455,0.11558347,0.00005358791,0.005521837],"study_design_scores_gemma":[0.00064659555,0.00009527185,0.0002229696,0.00024561206,0.000033593165,0.0000047247977,0.00001638031,0.8894614,0.000042939617,0.108453564,0.00025193623,0.00052503846],"about_ca_topic_score_codex":0.000043202057,"about_ca_topic_score_gemma":0.0000031628144,"teacher_disagreement_score":0.78589284,"about_ca_system_score_codex":0.00032259655,"about_ca_system_score_gemma":0.0002744383,"threshold_uncertainty_score":0.99981594},"labels":[],"label_agreement":null},{"id":"W2571907426","doi":"10.1007/s00220-017-3002-y","title":"Quantum Algorithm for Linear Differential Equations with Exponentially Improved Dependence on Precision","year":2017,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":196,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research; Intelligence Advanced Research Projects Activity; National Science Foundation","keywords":"Quantum algorithm for linear systems of equations; Quantum algorithm; Quantum phase estimation algorithm; Logarithm; Linear differential equation; Quantum; Propagator; Exponential function; Exponential growth; Linear system","score_opus":0.050342640721197485,"score_gpt":0.32690952416301217,"score_spread":0.2765668834418147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571907426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031316956,0.000018631288,0.9948197,0.0009499262,0.00010369155,0.0005439863,0.000011713027,0.00009688784,0.00032375264],"genre_scores_gemma":[0.4359206,0.000007825796,0.5637996,0.000031420088,0.00006795313,0.00010963093,0.000009871413,0.000015557227,0.000037514765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864966,0.00009009434,0.00033803715,0.0003662968,0.00027161097,0.0002842972],"domain_scores_gemma":[0.994138,0.001222312,0.0002560753,0.004167862,0.00013887617,0.00007687624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030902398,0.00019593512,0.0002633474,0.00006111526,0.00096531905,0.00036316836,0.003985123,0.00006836641,0.0000025565284],"category_scores_gemma":[0.00030723755,0.00015455938,0.00009509188,0.00013104246,0.00022167404,0.00030337233,0.0010770679,0.00036151268,0.000021518757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001248145,0.0010202974,0.0000067969177,0.00003302304,0.000026875676,0.0000013274613,0.00069947116,0.0012278898,0.00042861752,0.6006459,0.000022226883,0.39587513],"study_design_scores_gemma":[0.00047424043,0.00014652172,0.00013084918,0.00016047544,0.000008939573,0.0000018905273,0.000010487086,0.7979115,0.00031135665,0.2006299,0.00005095867,0.00016287477],"about_ca_topic_score_codex":0.000008627217,"about_ca_topic_score_gemma":0.000008342957,"teacher_disagreement_score":0.7966836,"about_ca_system_score_codex":0.000033802873,"about_ca_system_score_gemma":0.00007231222,"threshold_uncertainty_score":0.7424551},"labels":[],"label_agreement":null},{"id":"W2572246423","doi":"","title":"Computational Role of Tunneling in a Programmable Quantum Annealer","year":2016,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Qubit; Quantum tunnelling; Physics; Quantum computer; Quantum annealing; Quantum; Quantum mechanics; Statistical physics; Cluster state; Dissipative system; Quantum state; Dissipation","score_opus":0.011886557069073359,"score_gpt":0.27344643876154656,"score_spread":0.2615598816924732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572246423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38195783,0.021212468,0.538648,0.05085305,0.00068825803,0.0011724638,0.00005744761,0.00088514085,0.004525345],"genre_scores_gemma":[0.82160974,0.000041172418,0.17820749,0.00008791722,0.000016773749,0.000012690115,0.00000491578,0.000006344811,0.000012989542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989772,0.00012304432,0.00028166606,0.00021599917,0.0001951072,0.00020701168],"domain_scores_gemma":[0.9979483,0.0005021759,0.00012109803,0.0012206224,0.00015899997,0.000048834183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032271925,0.00010072792,0.000147565,0.00017733636,0.000119674085,0.000034602326,0.0019643062,0.00011800513,0.0000025377974],"category_scores_gemma":[0.00010271865,0.00007282351,0.000058982176,0.00060907804,0.00008754023,0.00016887512,0.0006135047,0.0004047148,0.0000084112135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065368417,0.00037034188,0.007928287,0.000011719124,0.000023928991,0.000001981524,0.0011354805,0.006089699,0.0021262306,0.78517455,0.0002809088,0.19685034],"study_design_scores_gemma":[0.00037864217,0.000042076157,0.011483551,0.00012510939,0.000002496236,0.0000119371525,0.00003720489,0.92579514,0.00026003862,0.05237812,0.009336505,0.00014920352],"about_ca_topic_score_codex":0.000023150173,"about_ca_topic_score_gemma":0.00005115479,"teacher_disagreement_score":0.9197054,"about_ca_system_score_codex":0.00003172203,"about_ca_system_score_gemma":0.00009689053,"threshold_uncertainty_score":0.36502022},"labels":[],"label_agreement":null},{"id":"W2572966585","doi":"10.7566/jpsj.88.061007","title":"Quantum Annealing amid Local Ruggedness and Global Frustration","year":2019,"lang":"en","type":"preprint","venue":"Journal of the Physical Society of Japan","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Quantum annealing; Simulated annealing; Computer science; Heuristic; Quantum computer; Quantum Monte Carlo; Qubit; Quantum; Frustration; Wave function; Monte Carlo method; Global optimization; Algorithm; Theoretical computer science; Computational science; Mathematical optimization; Statistical physics; Mathematics; Artificial intelligence; Physics; Quantum mechanics; Statistics","score_opus":0.011606008675116852,"score_gpt":0.255540611937892,"score_spread":0.24393460326277516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572966585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76473373,0.00017771013,0.23053013,0.0034973081,0.00092978525,0.000093122784,0.0000091301135,0.0000143923,0.0000147154715],"genre_scores_gemma":[0.9872275,0.000021528582,0.011952891,0.00011706506,0.000664607,4.391268e-7,6.9125315e-7,0.0000080283,0.000007241487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983191,0.00015082918,0.0004335467,0.00026736956,0.000611272,0.00021788682],"domain_scores_gemma":[0.9981332,0.0001350535,0.0009833527,0.0004439834,0.00020240965,0.000102023405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051170576,0.00022213513,0.000521694,0.00001524404,0.00014780925,0.00013488127,0.0013518132,0.00015732815,4.2954065e-7],"category_scores_gemma":[0.000025807163,0.00014399107,0.00077776087,0.00017744112,0.00020766346,0.0001232461,0.0012674446,0.0012347964,7.705181e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005899602,0.0008640814,0.0041059637,0.0012560869,0.0010112841,0.0000044189533,0.02016925,0.7823353,0.0031668257,0.016692914,0.0056204633,0.16471446],"study_design_scores_gemma":[0.00025216583,0.00011129213,0.008572983,0.00040530716,0.000045413817,0.00005090622,0.00021357977,0.9309828,0.00039111642,0.058736738,0.000073444455,0.00016423527],"about_ca_topic_score_codex":0.00005600905,"about_ca_topic_score_gemma":0.0000010943288,"teacher_disagreement_score":0.2224938,"about_ca_system_score_codex":0.00008664494,"about_ca_system_score_gemma":0.00023594209,"threshold_uncertainty_score":0.5871786},"labels":[],"label_agreement":null},{"id":"W2573846703","doi":"10.3390/cryptography1020011","title":"Simple, Near-Optimal Quantum Protocols for Die-Rolling","year":2017,"lang":"en","type":"preprint","venue":"Cryptography","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Centre for Quantum Technologies; Ministry of Education, India; National University of Singapore; National Research Foundation","keywords":"Oblivious transfer; Cryptographic protocol; Computer science; Coin flipping; Commit; Generalization; Simple (philosophy); Cryptography; Quantum; Cryptographic primitive; Task (project management); Integer (computer science); Theoretical computer science; Commitment scheme; Protocol (science); State (computer science); Algorithm; Mathematics; Physics; Quantum mechanics; Engineering; Philosophy","score_opus":0.03229937241974729,"score_gpt":0.31552545576103597,"score_spread":0.2832260833412887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573846703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01653495,0.0004047579,0.96699023,0.00055725034,0.0012887333,0.013180143,0.000079850404,0.0007307176,0.00023333458],"genre_scores_gemma":[0.07433328,0.000031601983,0.90674525,0.00031946835,0.0015845243,0.016753284,0.000080545324,0.00012698218,0.00002504189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963549,0.00009590182,0.00059138675,0.001533186,0.0004916635,0.00093296554],"domain_scores_gemma":[0.9956241,0.00023042316,0.0007459329,0.0028540727,0.000280097,0.00026536908],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00070525846,0.00067285623,0.00079441234,0.0003377315,0.001323507,0.0028364093,0.0044767614,0.00044779765,0.0000043496498],"category_scores_gemma":[0.00011794964,0.0006136327,0.0010645392,0.00020680072,0.00026659403,0.0001951717,0.0026496043,0.0010895358,0.000011614783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038311537,0.0010252789,0.0031472517,0.004139616,0.0012272077,0.00021871678,0.0056003053,0.2686748,0.00038002132,0.11774401,0.016333936,0.58112574],"study_design_scores_gemma":[0.00057387643,0.0002934214,0.0007641106,0.00042274417,0.00002309416,0.000006495194,0.000005022575,0.79421926,0.0001637666,0.1367337,0.06606502,0.00072950945],"about_ca_topic_score_codex":0.00004331487,"about_ca_topic_score_gemma":0.000003958943,"teacher_disagreement_score":0.58039623,"about_ca_system_score_codex":0.000021823616,"about_ca_system_score_gemma":0.0003242436,"threshold_uncertainty_score":0.99997663},"labels":[],"label_agreement":null},{"id":"W2575840041","doi":"10.1609/socs.v7i1.18390","title":"A Hybrid Quantum-Classical Approach to Solving Scheduling Problems","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"NIH Office of the Director; Advanced Exploration Systems; Ames Research Center; Intelligence Advanced Research Projects Activity; Air Force Research Laboratory; Office of the Director of National Intelligence; National Aeronautics and Space Administration","keywords":"Quantum annealing; Computer science; Heuristics; Scheduling (production processes); Mathematical optimization; Quantum; Simulated annealing; Quantum computer; Algorithm; Mathematics","score_opus":0.015511196088179646,"score_gpt":0.24350126534513375,"score_spread":0.22799006925695411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575840041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9307831,0.00003556671,0.015504844,0.026996061,0.006945164,0.00050613546,0.000007839169,0.00019716557,0.019024156],"genre_scores_gemma":[0.98491925,0.000004970803,0.013858105,0.0003082194,0.0006728857,0.000023154294,0.0000017318624,0.000021540678,0.00019012886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997019,0.000029993822,0.0003813175,0.0006766881,0.0014833937,0.00040964189],"domain_scores_gemma":[0.9983409,0.0001551933,0.00013974728,0.00027353436,0.00092770567,0.00016289997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072461524,0.00020803406,0.0002461525,0.00011811365,0.00027043046,0.0005277336,0.0028040383,0.000065060034,0.0000040300442],"category_scores_gemma":[0.00032102477,0.0001626796,0.00018756538,0.0005790497,0.000063435924,0.00022043359,0.0019368754,0.000555309,0.00001450527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040155475,0.0006617255,0.00032889665,0.0000695052,0.00007758363,0.0000034915176,0.0008784024,0.012142695,0.09608508,0.88691366,0.0008572493,0.0019415432],"study_design_scores_gemma":[0.0008184362,0.00021991748,0.00028897222,0.000323036,0.000008043909,0.00009339399,0.00005067566,0.771936,0.18488272,0.03726029,0.0038006972,0.00031778842],"about_ca_topic_score_codex":0.000025000694,"about_ca_topic_score_gemma":2.0644084e-7,"teacher_disagreement_score":0.84965336,"about_ca_system_score_codex":0.0001542322,"about_ca_system_score_gemma":0.0001521769,"threshold_uncertainty_score":0.66338813},"labels":[],"label_agreement":null},{"id":"W2579806473","doi":"10.1088/2058-9565/aad3e4","title":"Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz","year":2018,"lang":"en","type":"preprint","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; Canadian Institute for Advanced Research","funders":"Army Research Office; Air Force Office of Scientific Research","keywords":"Ansatz; Wave function; Coupled cluster; Quantum computer; Quantum; Qubit; Unitary state; Quantum simulator; Quantum circuit; Statistical physics; Physics; Computer science; Quantum mechanics; Quantum error correction; Molecule","score_opus":0.017583069508492033,"score_gpt":0.278408676947036,"score_spread":0.260825607438544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579806473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5028211,0.00076756236,0.49026772,0.0042843027,0.0010055846,0.00042888246,0.0000059217546,0.00040067677,0.000018269126],"genre_scores_gemma":[0.9118529,0.00003396179,0.08725358,0.00060756697,0.00018738906,0.000027332782,0.0000035485352,0.000029918128,0.0000037833684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595463,0.00009507528,0.00054999185,0.0016032836,0.00068860326,0.001108389],"domain_scores_gemma":[0.99655294,0.00028876707,0.0004322282,0.0016854195,0.0009211556,0.000119466706],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.0020867768,0.0005456688,0.00057716895,0.0009767837,0.0017696087,0.0011950711,0.0046291966,0.0004665431,9.765398e-7],"category_scores_gemma":[0.00022986432,0.0003940665,0.000118788324,0.0020407494,0.0038891917,0.00035286398,0.0055735568,0.00094898744,0.0000019879137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014622307,0.00007698573,0.00007656609,0.00021472745,0.0000807127,0.000046614525,0.0017074383,0.04502686,0.018635523,0.9192846,0.00027585743,0.0145595325],"study_design_scores_gemma":[0.00019555281,0.000205138,0.000023430972,0.00014123015,0.000022181288,0.00012545584,0.00066877017,0.7571913,0.0018228146,0.23882993,0.0003749062,0.00039928735],"about_ca_topic_score_codex":0.00014753845,"about_ca_topic_score_gemma":0.000010469048,"teacher_disagreement_score":0.71216446,"about_ca_system_score_codex":0.0000871415,"about_ca_system_score_gemma":0.0015547129,"threshold_uncertainty_score":0.9998511},"labels":[],"label_agreement":null},{"id":"W2580349765","doi":"10.48550/arxiv.quant-ph/0506048","title":"Evanescence in Coined Quantum Walks","year":2005,"lang":"en","type":"article","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Périmètre de physique théorique; Centrum Wiskunde and Informatica; University of Waterloo; Mitacs; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Research Consortium for Informatics and Mathematics","keywords":"Quantum walk; Quantum; Mathematics; Exponential function; Statistical physics; Physics; Pure mathematics; Mathematical physics; Theoretical physics; Quantum mechanics; Mathematical analysis; Quantum algorithm","score_opus":0.05165062991290316,"score_gpt":0.34271491554276345,"score_spread":0.2910642856298603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580349765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22783598,0.00016638474,0.7384778,0.02812302,0.0007569789,0.0020959475,0.000019444704,0.00010456821,0.0024198524],"genre_scores_gemma":[0.90565246,0.00005706774,0.092765644,0.0010860703,0.00030889714,0.000092688184,0.0000043949576,0.0000099943145,0.000022767646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994996,0.00012890583,0.000734076,0.00042916846,0.0026984087,0.0010134054],"domain_scores_gemma":[0.9967585,0.001720171,0.00017501462,0.0006018515,0.0005933618,0.00015108277],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.014333898,0.0002483344,0.0002727856,0.0006206972,0.0010806089,0.0012384648,0.004004159,0.00008219388,0.000002905541],"category_scores_gemma":[0.0008436169,0.0001429714,0.0000773024,0.0021180555,0.001129117,0.0013388655,0.0008702494,0.00072886865,0.00001827339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026658046,0.00039043126,0.0000937349,0.00016880735,0.000014553752,0.0000069281336,0.028594138,0.050139237,0.00005111661,0.7997123,0.001677387,0.11912469],"study_design_scores_gemma":[0.00058588333,0.00013351112,0.00069314084,0.0001501628,0.0000018272564,0.00010227956,0.00020430797,0.8961503,0.00003539964,0.09400943,0.007756847,0.00017691798],"about_ca_topic_score_codex":0.0000267727,"about_ca_topic_score_gemma":0.00007235354,"teacher_disagreement_score":0.84601104,"about_ca_system_score_codex":0.0002538043,"about_ca_system_score_gemma":0.0006973947,"threshold_uncertainty_score":0.99979836},"labels":[],"label_agreement":null},{"id":"W2582427499","doi":"10.1515/rose-2017-0003","title":"Image processing via simulated quantum dynamics","year":2017,"lang":"en","type":"article","venue":"Random Operators and Stochastic Equations","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Image processing; Quantum; Mathematics; Image (mathematics); Algorithm; Statistical physics; Artificial intelligence; Computer vision; Computer science; Quantum mechanics; Physics","score_opus":0.009949587329023,"score_gpt":0.25934017036940815,"score_spread":0.24939058304038514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582427499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036160532,0.00014825664,0.96193814,0.0010199083,0.0002638116,0.00022336216,0.0000066610346,0.00012350047,0.00011582772],"genre_scores_gemma":[0.98115444,0.000002492022,0.018617598,0.000072455274,0.00008670502,0.000007742747,0.0000058742994,0.000012971643,0.000039714625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886954,0.00004405551,0.00024488603,0.0003715385,0.00019379638,0.00027618295],"domain_scores_gemma":[0.9988331,0.00020654162,0.00014248231,0.00054298766,0.00013935853,0.00013553043],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003050062,0.00017891315,0.00023647794,0.00008421743,0.0021277901,0.0012162037,0.0005919691,0.00006002145,0.000003998249],"category_scores_gemma":[0.00034636582,0.00014572103,0.00005315345,0.000116335956,0.00014041031,0.00047329545,0.00024764036,0.0001873705,0.0000096981175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000931779,0.0003047782,0.00018251565,0.00010546433,0.00013664218,0.000073871335,0.005490232,0.24221824,0.0017643556,0.2092486,0.000079063226,0.54030305],"study_design_scores_gemma":[0.0015745135,0.00004954744,0.0002531205,0.000052849016,0.000017025826,0.000015022206,0.000019067662,0.9903263,0.000009554995,0.0074676634,0.000012650822,0.00020272261],"about_ca_topic_score_codex":0.000073598705,"about_ca_topic_score_gemma":0.00002162633,"teacher_disagreement_score":0.9449939,"about_ca_system_score_codex":0.000019347157,"about_ca_system_score_gemma":0.00008850258,"threshold_uncertainty_score":0.99982065},"labels":[],"label_agreement":null},{"id":"W2582746905","doi":"10.1007/s11128-017-1639-2","title":"A subgradient approach for constrained binary optimization via quantum adiabatic evolution","year":2017,"lang":"en","type":"preprint","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"QLT (Canada)","funders":"","keywords":"Subgradient method; Quadratic unconstrained binary optimization; Mathematical optimization; Quantum; Lagrangian relaxation; Quadratic programming; Quadratic equation; Adiabatic process; Quantum phase estimation algorithm; Applied mathematics; Computer science; Quantum computer; Binary number; Mathematics; Quantum annealing; Physics; Quantum mechanics; Quantum error correction","score_opus":0.01593767461817021,"score_gpt":0.2488040224145937,"score_spread":0.2328663477964235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582746905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027214026,0.0005877356,0.9921506,0.0005351052,0.0013142334,0.0014412452,0.000050957366,0.00073163345,0.00046706173],"genre_scores_gemma":[0.6353725,0.000014298725,0.363329,0.00013402782,0.00020779725,0.00023978642,0.0006607062,0.000028603497,0.000013254561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967003,0.00009708686,0.001160048,0.00071012665,0.0006318087,0.000700669],"domain_scores_gemma":[0.99584264,0.00009133567,0.0020141075,0.0011237994,0.0007252195,0.0002028924],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010750658,0.0006046421,0.00061533897,0.00068511366,0.0014413771,0.002224536,0.0018477802,0.00047177533,0.0000026550176],"category_scores_gemma":[0.0002826444,0.0005816085,0.00027498743,0.00032667938,0.00018303088,0.0028011533,0.0008589869,0.0007384935,0.000008214411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022754151,0.00008000048,0.000011682769,0.002015014,0.000034487915,0.0000013203419,0.0030436805,0.9043997,0.000012356514,0.013313341,0.00017726523,0.07688842],"study_design_scores_gemma":[0.00065904675,0.00014932264,0.000084646046,0.00058250816,0.000043333344,0.000045618726,0.00009846793,0.9802451,0.000025662606,0.017036574,0.00032476356,0.00070493866],"about_ca_topic_score_codex":0.00004220912,"about_ca_topic_score_gemma":5.80628e-7,"teacher_disagreement_score":0.63265115,"about_ca_system_score_codex":0.0002851118,"about_ca_system_score_gemma":0.00095976656,"threshold_uncertainty_score":0.9998586},"labels":[],"label_agreement":null},{"id":"W2585327097","doi":"10.4086/toc.2016.v012a018","title":"","year":2016,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Mathematics; Computational complexity theory; Quantum algorithm; Communication complexity; Query optimization; Quantum; Bipartite graph; Matching (statistics); Worst-case complexity; Discrete mathematics; Combinatorics; Constructive; Computer science; Algorithm; Graph; Information retrieval","score_opus":0.009925032442266456,"score_gpt":0.22655946152639345,"score_spread":0.216634429084127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585327097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48747388,0.000054314693,0.51096934,0.0008231807,0.00021644849,0.000071756825,6.845062e-7,0.00031556736,0.00007486089],"genre_scores_gemma":[0.869123,0.000002700517,0.13046698,0.00021659354,0.00015451985,9.1219204e-7,1.3216989e-7,0.000015273012,0.00001991422],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968143,0.0006019229,0.0007062846,0.0006799301,0.00047532286,0.00072222337],"domain_scores_gemma":[0.9950693,0.0029539692,0.00046082347,0.0011632618,0.00017588402,0.00017676581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029088971,0.00030046437,0.0004724652,0.00024512367,0.00030410796,0.00006804696,0.0025986985,0.00006988713,0.000002991585],"category_scores_gemma":[0.00031349206,0.0001847208,0.00021086959,0.00059155934,0.00028577354,0.00040508827,0.0013093058,0.00015878036,0.0000047482986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017778906,0.000050175186,0.00083641487,0.000014752434,0.000026535645,0.0000106618945,0.0025688177,0.0023254647,0.021195037,0.37858424,0.000004321988,0.59436584],"study_design_scores_gemma":[0.0020632779,0.00051157427,0.03148229,0.0007563701,0.000011473575,0.00019448568,0.00010110887,0.30410963,0.08283204,0.5771609,0.00008114448,0.0006957167],"about_ca_topic_score_codex":0.0000055620726,"about_ca_topic_score_gemma":4.320983e-7,"teacher_disagreement_score":0.59367007,"about_ca_system_score_codex":0.000026913785,"about_ca_system_score_gemma":0.00006945133,"threshold_uncertainty_score":0.75326955},"labels":[],"label_agreement":null},{"id":"W2590232898","doi":"10.1088/1367-2630/ab2a9e","title":"Quantum gradient descent and Newton’s method for constrained polynomial optimization","year":2019,"lang":"en","type":"preprint","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Army Research Office; Ministry of Education - Singapore; National Research Foundation Singapore; National Research Foundation","keywords":"Gradient descent; Mathematical optimization; Maxima and minima; Quantum phase estimation algorithm; Quantum; Mathematics; Dimension (graph theory); Quantum algorithm; Convergence (economics); Descent direction; Computer science; Newton's method in optimization; Optimization problem; Quantum computer; Algorithm; Iterative method; Applied mathematics; Local convergence; Quantum error correction; Artificial neural network; Artificial intelligence","score_opus":0.020342394586718635,"score_gpt":0.277050652985788,"score_spread":0.25670825839906936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590232898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033362936,0.0003229655,0.991331,0.0020448272,0.0026168549,0.00029707383,0.0000117334075,0.000027252885,0.000012032535],"genre_scores_gemma":[0.033734135,0.00006638349,0.96400225,0.00019513126,0.0019379135,0.0000015525501,0.0000055857968,0.000025072412,0.000031992393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844825,0.00010419277,0.0005163773,0.0003581775,0.00030650047,0.0002664871],"domain_scores_gemma":[0.99801314,0.0002418944,0.00094141415,0.00034450163,0.00025781768,0.00020122775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047557772,0.00027399076,0.00054544775,0.00011085569,0.00008823594,0.00027341218,0.0007340563,0.0001400164,0.0000012097909],"category_scores_gemma":[0.000047541842,0.00023380812,0.0002927725,0.0001067006,0.00003446804,0.00013379479,0.00048467302,0.00062370766,5.056592e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027126061,0.000050707113,0.000010426284,0.000078085744,0.00008518369,0.0000049886135,0.0006636969,0.82407194,0.00015444153,0.0054123737,0.0021374782,0.16730356],"study_design_scores_gemma":[0.0010001977,0.00032107136,0.000045456578,0.00024874957,0.000057799265,0.00010042938,0.000011765543,0.9738041,0.00047563214,0.022824623,0.000874182,0.00023598359],"about_ca_topic_score_codex":0.000023419396,"about_ca_topic_score_gemma":5.5355315e-7,"teacher_disagreement_score":0.16706759,"about_ca_system_score_codex":0.00006887661,"about_ca_system_score_gemma":0.00071615906,"threshold_uncertainty_score":0.95344186},"labels":[],"label_agreement":null},{"id":"W2593381501","doi":"10.1017/fms.2017.2","title":"EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS","year":2017,"lang":"en","type":"article","venue":"Forum of Mathematics Sigma","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Waterloo","funders":"Army Research Office; Air Force Office of Scientific Research; Laboratory Directed Research and Development; Los Alamos National Laboratory; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Unicode; Algorithm; Exponential function; Computer science; Mathematics; Discrete mathematics; Mathematical analysis; Artificial intelligence","score_opus":0.02093792663290922,"score_gpt":0.27691467130505215,"score_spread":0.25597674467214293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593381501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32929242,0.000013974898,0.6694935,0.00040919086,0.00024272222,0.00033548675,0.0000046953687,0.000030398309,0.00017764333],"genre_scores_gemma":[0.6860789,0.0000010604703,0.31378916,0.000018234583,0.000036881367,0.000012123915,7.443564e-7,0.000009692612,0.000053214848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872726,0.00001184685,0.00042698704,0.00026854762,0.00024838618,0.0003169631],"domain_scores_gemma":[0.9983015,0.00025793334,0.00041645713,0.00092125323,0.00005616156,0.000046706915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005235412,0.0001369651,0.00025983126,0.00008889859,0.00025526332,0.00015474958,0.0011165268,0.00005643956,0.0000027218725],"category_scores_gemma":[0.00027147218,0.00011715016,0.00010922054,0.000050657272,0.00003918869,0.00017592436,0.00054236304,0.000091689115,0.0000023899354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003847237,0.0014023496,0.0014210887,0.00092567806,0.00007434807,0.000022303206,0.011180738,0.073460646,0.026990162,0.08477556,0.00050568295,0.799203],"study_design_scores_gemma":[0.00063372543,0.0002082731,0.0003390223,0.00020568389,0.0000036319384,0.000002387725,0.00006637321,0.9369424,0.007910938,0.053397194,0.00016069596,0.00012969122],"about_ca_topic_score_codex":0.000030864936,"about_ca_topic_score_gemma":0.000024790557,"teacher_disagreement_score":0.86348176,"about_ca_system_score_codex":0.000018246175,"about_ca_system_score_gemma":0.000030900334,"threshold_uncertainty_score":0.4777245},"labels":[],"label_agreement":null},{"id":"W2593971698","doi":"10.1038/s42005-019-0152-6","title":"Complex networks from classical to quantum","year":2019,"lang":"en","type":"article","venue":"Communications Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; University of Waterloo; Foundational Questions Institute","keywords":"Quantum entanglement; Complex network; Intersection (aeronautics); Quantum network; Quantum information; Quantum; Complex system; Quantum computer; Quantum discord","score_opus":0.034581086222251256,"score_gpt":0.2800547652832054,"score_spread":0.24547367906095413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593971698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030774642,0.000101825295,0.9582875,0.008176675,0.00030918853,0.00020954748,0.00001010375,0.00029388542,0.0018366666],"genre_scores_gemma":[0.82509863,0.000011225076,0.17350328,0.0011323967,0.00014218071,0.000010301772,0.00003944907,0.000012553875,0.000049974595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989383,0.00012824396,0.00019483724,0.00031782518,0.00016872538,0.0002520457],"domain_scores_gemma":[0.9954979,0.0003975147,0.00007102144,0.0038393545,0.000074603726,0.00011963385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001004497,0.0001408397,0.00019022435,0.000033701264,0.00023531674,0.00016501559,0.0036917767,0.000046089383,0.000010071773],"category_scores_gemma":[0.000011959084,0.000135686,0.00008273176,0.00054221053,0.000059581762,0.0001318137,0.0021260197,0.00034760687,0.0005091902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041543303,0.00029963284,0.0010050272,0.000004149052,0.000043579937,0.0000010483094,0.0012366312,0.07513681,0.0015013057,0.66347486,0.007012616,0.25028017],"study_design_scores_gemma":[0.00012967807,0.000038908292,0.0068316576,0.000020571226,0.0000032367711,9.867176e-7,0.000011068502,0.9342347,0.000024116824,0.024992002,0.03354001,0.00017310168],"about_ca_topic_score_codex":0.000039722858,"about_ca_topic_score_gemma":0.0000052851033,"teacher_disagreement_score":0.85909784,"about_ca_system_score_codex":0.000028048464,"about_ca_system_score_gemma":0.000038906528,"threshold_uncertainty_score":0.6860301},"labels":[],"label_agreement":null},{"id":"W2595090535","doi":"","title":"Two-message quantum interactive proofs and the quantum separability problem","year":2013,"lang":"en","type":"article","venue":"Civil War Book Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decidability; Mathematical proof; State (computer science); Discrete mathematics; Quantum computer; Computer science; Complexity class; Unitary state; Mathematics; Time complexity; Theoretical computer science; Quantum; Algorithm; Quantum mechanics","score_opus":0.007846870331688528,"score_gpt":0.24952345248994384,"score_spread":0.24167658215825533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595090535","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032558525,0.8780919,0.059769653,0.043817036,0.0006137739,0.0059119244,0.0000055807795,0.00058119977,0.007953086],"genre_scores_gemma":[0.60532796,0.23172219,0.051736765,0.101718165,0.001250197,0.0036424506,0.00002621185,0.00026784916,0.0043082386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732953,0.000636081,0.0005522657,0.00071249605,0.0003206147,0.0004490043],"domain_scores_gemma":[0.9978016,0.00052263873,0.00028637852,0.0010733106,0.00016098168,0.00015508577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013408691,0.00032961968,0.00063486333,0.00004384332,0.00029116217,0.00020192421,0.0010791811,0.000047313235,0.000109600216],"category_scores_gemma":[0.00017414126,0.00018655654,0.00020654364,0.00032574014,0.00031185246,0.00054471486,0.0007160911,0.00050619233,0.00018853637],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032412332,0.00039453624,0.00015570328,0.0075979056,0.00024984102,0.00004003224,0.0052728183,0.00017179984,0.000080737045,0.16965486,0.15515457,0.6611948],"study_design_scores_gemma":[0.0016304678,0.00022210437,0.00077002984,0.0071615083,0.0000881285,0.00027821818,0.000032408163,0.5853739,0.000056157634,0.11913546,0.28440458,0.00084704306],"about_ca_topic_score_codex":0.000085635926,"about_ca_topic_score_gemma":0.000007874461,"teacher_disagreement_score":0.66034776,"about_ca_system_score_codex":0.00003488388,"about_ca_system_score_gemma":0.000083988234,"threshold_uncertainty_score":0.76075554},"labels":[],"label_agreement":null},{"id":"W2595997627","doi":"10.48550/arxiv.1010.0009","title":"Unstructured Randomness, Small Gaps and Localization","year":2010,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Laboratory; Natural Sciences and Engineering Research Council of Canada; Army Research Office; W. M. Keck Foundation; National Science Foundation","keywords":"Randomness; Adiabatic quantum computation; Ground state; Hamiltonian (control theory); Adiabatic process; Mathematics; Quantum annealing; Quantum; Function (biology); Random function; Satisfiability; Statistical physics; Algorithm; Discrete mathematics; Quantum computer; Quantum mechanics; Physics; Random variable; Mathematical optimization; Statistics","score_opus":0.01623024332323293,"score_gpt":0.15185978386086899,"score_spread":0.13562954053763607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595997627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5063158,0.000014418728,0.49298146,0.000052525655,0.0002564336,0.000050574057,8.380323e-7,0.00010908741,0.00021884803],"genre_scores_gemma":[0.99363,0.000014882001,0.006031966,0.00011409862,0.00006414751,8.708524e-8,0.000001448444,0.000006395539,0.0001369664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992236,0.000043844444,0.000080147416,0.00042055175,0.000039151142,0.00019273248],"domain_scores_gemma":[0.9993494,0.000062723746,0.000058507307,0.00036393767,0.00005439232,0.00011103531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012217139,0.00012193275,0.00012020411,0.00009364036,0.00020765325,0.00008525265,0.00046042312,0.00007906481,0.000010336596],"category_scores_gemma":[0.000024111685,0.00011707404,0.000041584168,0.00042618418,0.0000974568,0.00016223558,0.00021197043,0.00021647154,0.000008212099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065441905,0.00007589526,0.011674169,0.000052479725,0.00005110166,0.0002889036,0.0009040722,0.21699871,0.0026543557,0.7086007,0.00017180563,0.058462355],"study_design_scores_gemma":[0.00088275806,0.00002422551,0.0026708632,0.00000825391,0.000008330219,0.00003147362,0.000010345893,0.97162443,0.00038054297,0.022940008,0.0012538382,0.00016493148],"about_ca_topic_score_codex":0.000031816853,"about_ca_topic_score_gemma":0.000053401323,"teacher_disagreement_score":0.75462574,"about_ca_system_score_codex":0.000007818848,"about_ca_system_score_gemma":0.000032007,"threshold_uncertainty_score":0.4774141},"labels":[],"label_agreement":null},{"id":"W2602448160","doi":"10.1007/978-3-319-93779-3_11","title":"Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer","year":2018,"lang":"en","type":"book-chapter","venue":"Philosophy of engineering and technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Quantum complexity theory; Universality (dynamical systems); Computer science; Quantum computer; Computability theory; Computational complexity theory; Theoretical computer science; Computability; Independence (probability theory); Mathematics; Quantum; Algorithm; Quantum mechanics; Physics","score_opus":0.019593647519711748,"score_gpt":0.21412603765972746,"score_spread":0.19453239014001572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602448160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056654412,0.004616674,0.7206228,0.17573556,0.0022738809,0.0029303862,0.00021660893,0.00051028375,0.036439426],"genre_scores_gemma":[0.9807017,0.000028214385,0.019045688,0.000058857764,0.000090387955,0.0000027086496,0.00000278151,0.000011604788,0.000058053007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991546,0.00003153712,0.0003178291,0.00021513809,0.00017602905,0.00010485704],"domain_scores_gemma":[0.99887884,0.0002872768,0.00026060283,0.00045647938,0.000104109364,0.000012724273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028680894,0.00016189256,0.00034701213,0.00023786466,0.00007976951,0.00001397053,0.00087807694,0.00013510103,0.0000014817108],"category_scores_gemma":[0.000023545368,0.00009341103,0.00006622758,0.00022095171,0.0011249862,0.000030884632,0.00052345707,0.00035679518,2.518332e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032241448,0.000012481068,0.0000123532145,0.00006922376,0.000039051087,8.577434e-7,0.00034558223,0.0021362638,0.000007587428,0.9965669,0.000020920166,0.0007855557],"study_design_scores_gemma":[0.00032357124,0.000066466215,0.00027793297,0.00019815334,0.000013921641,0.000028866965,0.0000036226036,0.27560216,0.000015988682,0.7221926,0.0011971992,0.00007949889],"about_ca_topic_score_codex":0.000011286435,"about_ca_topic_score_gemma":0.000003182178,"teacher_disagreement_score":0.9240473,"about_ca_system_score_codex":0.0000069619055,"about_ca_system_score_gemma":0.000034329918,"threshold_uncertainty_score":0.41450587},"labels":[],"label_agreement":null},{"id":"W2605394516","doi":"10.22331/q-2017-10-03-31","title":"Magic state distillation with low space overhead and optimal asymptotic input count","year":2017,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut quantique; Université de Sherbrooke","funders":"","keywords":"MAGIC (telescope); Qubit; Logarithm; Adder; State (computer science); Concatenation (mathematics); Topology (electrical circuits); Discrete logarithm","score_opus":0.006688174581715129,"score_gpt":0.22700304692378453,"score_spread":0.2203148723420694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605394516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7133508,0.00007685953,0.28449842,0.0013607547,0.0002418346,0.00010687976,0.000004586828,0.00010062425,0.00025926856],"genre_scores_gemma":[0.9808892,0.00001529143,0.018738229,0.000081133716,0.00008566351,0.0000018847678,0.0000017964687,0.000014349975,0.00017242697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987413,0.000035221976,0.0001462269,0.00045063265,0.00029063624,0.00033592654],"domain_scores_gemma":[0.99878347,0.000066166176,0.00018982336,0.00077368424,0.000060961476,0.00012590465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020040199,0.00019125825,0.00019037366,0.000057304744,0.00050071906,0.00075330597,0.0005610303,0.00003875403,0.0000030418853],"category_scores_gemma":[0.000035294695,0.00014457903,0.000029703604,0.000074249714,0.00015725476,0.00036351266,0.00029833787,0.0001784882,0.000023678294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038386925,0.0006230447,0.08356763,0.0006774312,0.00033849315,0.0013548284,0.013423364,0.17699583,0.0021949694,0.33113107,0.0028220373,0.38648742],"study_design_scores_gemma":[0.0004016134,0.00022722299,0.10567533,0.00009086228,0.0000053383337,0.00007281337,0.0000072911466,0.88928074,0.0001175586,0.0030581395,0.0008335138,0.00022961],"about_ca_topic_score_codex":0.00010931817,"about_ca_topic_score_gemma":0.000018460207,"teacher_disagreement_score":0.71228486,"about_ca_system_score_codex":0.000024126733,"about_ca_system_score_gemma":0.000062992396,"threshold_uncertainty_score":0.7264147},"labels":[],"label_agreement":null},{"id":"W2605687890","doi":"10.1088/1367-2630/aa8fe0","title":"Heat-bath algorithmic cooling with correlated qubit-environment interactions","year":2017,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"Canadian Institute for Advanced Research","keywords":"Physics; Qubit; Statistical physics; Quantum mechanics; Quantum","score_opus":0.01361962145933882,"score_gpt":0.24300578062119862,"score_spread":0.2293861591618598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605687890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072711505,0.00007974299,0.9250151,0.0010172651,0.0008860064,0.00005401925,9.4850435e-7,0.000028054343,0.00020734426],"genre_scores_gemma":[0.8408723,0.00003170849,0.15733488,0.00013577862,0.0013742747,5.726378e-7,5.9901197e-7,0.000019503515,0.00023038479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990037,0.00003195228,0.00025421637,0.00017183092,0.00032892544,0.00020937265],"domain_scores_gemma":[0.9988474,0.000060988714,0.0003337407,0.00051635096,0.00007479247,0.00016669017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014622703,0.00014758745,0.00022202711,0.000047148787,0.00043354192,0.00032216994,0.0009540844,0.00002828398,0.0000068863837],"category_scores_gemma":[0.00001465842,0.000108863394,0.00010663347,0.000067906316,0.000060087066,0.00054235465,0.00017516997,0.00053087267,0.000016595859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006338382,0.00026179117,0.0004942187,0.000010563672,0.00021159455,0.0002652574,0.0018819537,0.21322294,0.0024699895,0.0021080556,0.001920545,0.7770897],"study_design_scores_gemma":[0.0015982438,0.0006569441,0.0033431358,0.0003323256,0.00005090813,0.00096872717,0.000040468207,0.9785235,0.0029437651,0.004771788,0.006456052,0.0003141667],"about_ca_topic_score_codex":0.000042258507,"about_ca_topic_score_gemma":0.0000015718973,"teacher_disagreement_score":0.77677554,"about_ca_system_score_codex":0.000049333015,"about_ca_system_score_gemma":0.00014335176,"threshold_uncertainty_score":0.44393203},"labels":[],"label_agreement":null},{"id":"W2607337898","doi":"10.22331/q-2018-09-03-89","title":"Fidelity of quantum strategies with applications to cryptography","year":2018,"lang":"en","type":"preprint","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Centre for Quantum Technologies; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; Industry Canada; National Research Foundation Singapore; Government of Canada; National University of Singapore; National Research Foundation","keywords":"Fidelity; Computer science; Mathematical proof; Norm (philosophy); Cryptography; Theoretical computer science; Protocol (science); Generalization; Function (biology); Mathematics; Computer security; Law","score_opus":0.017005706922915444,"score_gpt":0.2759064550493677,"score_spread":0.2589007481264523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607337898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09054397,0.00022738709,0.90623105,0.00073957857,0.00047268785,0.00074669457,0.000055745768,0.00039349552,0.0005894053],"genre_scores_gemma":[0.75208217,0.0000167319,0.24717425,0.00017056381,0.00033069888,0.00016241203,0.000020289308,0.000034291512,0.000008566861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697125,0.000119614684,0.00061405485,0.0011758881,0.00059993786,0.0005192734],"domain_scores_gemma":[0.99641,0.00013652984,0.000454761,0.0022768935,0.0004853181,0.00023650058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044318262,0.00047764307,0.0006179237,0.00042383897,0.00020286143,0.00035356497,0.002578823,0.00022844244,0.000010840572],"category_scores_gemma":[0.000019502815,0.00038704064,0.00023127154,0.00096399075,0.00025457493,0.00013511322,0.0016790532,0.0006454906,0.000040510124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004878968,0.00039046086,0.0004146343,0.0006810602,0.00023051951,0.000016341097,0.0023721214,0.041487083,0.00040561036,0.93094,0.0030880158,0.01992539],"study_design_scores_gemma":[0.0002498662,0.0007541314,0.0043163057,0.00050493696,0.000039899893,0.0000204471,0.00014924865,0.6024847,0.0005883906,0.38185242,0.008139033,0.00090060354],"about_ca_topic_score_codex":0.00024338278,"about_ca_topic_score_gemma":0.000021005866,"teacher_disagreement_score":0.66153824,"about_ca_system_score_codex":0.000027370152,"about_ca_system_score_gemma":0.000514062,"threshold_uncertainty_score":0.99985814},"labels":[],"label_agreement":null},{"id":"W2608345920","doi":"10.1088/1751-8121/aaad13","title":"Fault-tolerant conversion between adjacent Reed–Muller quantum codes based on gauge fixing","year":2018,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Calgary","funders":"Higher Education Discipline Innovation Project; China Scholarship Council; National Natural Science Foundation of China","keywords":"Gauge (firearms); Measure (data warehouse); Quantum; Code (set theory); Gauge fixing; Quantum error correction; Process (computing); Transversal (combinatorics)","score_opus":0.011275276344848423,"score_gpt":0.24403661737610588,"score_spread":0.23276134103125745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608345920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41177982,0.000013908824,0.5855594,0.0021358281,0.00013094739,0.00006101427,0.0000030518727,0.00002386453,0.0002921613],"genre_scores_gemma":[0.9685209,0.0000034328257,0.030461114,0.00036829174,0.0006284191,5.71821e-7,6.5746747e-7,0.000012207113,0.0000044516228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983533,0.0001366726,0.00043674826,0.00022823206,0.00054942066,0.00029559605],"domain_scores_gemma":[0.998246,0.00085797225,0.00020536469,0.00027077209,0.00017353622,0.00024636317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071805273,0.00019509306,0.00043255495,0.00006805535,0.00016809985,0.0001370789,0.0004562694,0.00007306442,0.00004054967],"category_scores_gemma":[0.000112790345,0.00012326635,0.0001629356,0.00016616698,0.0005364332,0.00009420765,0.00017089894,0.0003956354,0.000027918139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037693615,0.00018582057,0.00003102024,0.000049244205,0.000025469071,0.0000249253,0.00044183512,0.000098900164,0.00010408456,0.9917219,0.00013910723,0.0071399612],"study_design_scores_gemma":[0.0003819332,0.0006295877,0.00006833448,0.00026819593,0.000018499228,0.00002954651,0.000014413175,0.5470768,0.0014314976,0.44985652,0.00012016912,0.00010445135],"about_ca_topic_score_codex":5.0143035e-7,"about_ca_topic_score_gemma":1.6455726e-8,"teacher_disagreement_score":0.55674106,"about_ca_system_score_codex":0.0000190174,"about_ca_system_score_gemma":0.000044524433,"threshold_uncertainty_score":0.5026656},"labels":[],"label_agreement":null},{"id":"W2608522339","doi":"10.22331/q-2018-01-04-43","title":"Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics","year":2018,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; University of Waterloo","funders":"Army Research Office; Université de Sherbrooke","keywords":"Quantum computer; Quantum error correction; Overhead (engineering); Computer science; Error detection and correction; Frame (networking); Pauli exclusion principle; Computation; Fault tolerance; Protocol (science); Decoding methods; Algorithm; Quantum gate; Quantum; Computer engineering; Distributed computing; Physics; Quantum mechanics; Computer network","score_opus":0.02154733608886181,"score_gpt":0.2743363146713025,"score_spread":0.25278897858244065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608522339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63689506,0.00015793908,0.35735458,0.0037432008,0.0009500694,0.00038628525,0.0000062430204,0.0002888583,0.0002177503],"genre_scores_gemma":[0.9683921,0.000018216224,0.028255548,0.0025355725,0.0007009532,0.000013851409,0.0000048780275,0.00003760031,0.00004132375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965507,0.00032108842,0.00057522743,0.0008295539,0.0007351186,0.0009883322],"domain_scores_gemma":[0.99695396,0.0012740724,0.00025171367,0.0012046042,0.0001610412,0.00015460003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009982568,0.00043763994,0.0004560596,0.00019486966,0.00060854445,0.0004505151,0.002276645,0.00014595504,0.000013907182],"category_scores_gemma":[0.0002477288,0.00024240506,0.00010405049,0.0013187205,0.00034335023,0.00022169334,0.00041043572,0.00077560265,0.00010827216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095794816,0.0037065835,0.025392672,0.00051780837,0.00037376123,0.006288998,0.118563585,0.034018006,0.0004020741,0.4408757,0.041531228,0.32737163],"study_design_scores_gemma":[0.0007658605,0.0013643841,0.011031538,0.00027805113,0.0000122266365,0.00030266124,0.00044101677,0.97141784,0.000067092034,0.0042901076,0.009545228,0.0004839815],"about_ca_topic_score_codex":0.00017753357,"about_ca_topic_score_gemma":0.00017468171,"teacher_disagreement_score":0.93739986,"about_ca_system_score_codex":0.00004030999,"about_ca_system_score_gemma":0.00018377884,"threshold_uncertainty_score":0.98849916},"labels":[],"label_agreement":null},{"id":"W2609330888","doi":"10.22331/q-2019-01-25-117","title":"POVMs are equivalent to projections for perfect state exclusion of three pure states in three dimensions","year":2019,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"State (computer science); POVM; Rank (graph theory); Quantum state; Simple (philosophy); Quantum; Generality","score_opus":0.020200621262306994,"score_gpt":0.2647921855115933,"score_spread":0.2445915642492863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609330888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74448764,0.000107343476,0.2524178,0.0013707932,0.0005788518,0.00088645506,0.00003151287,0.00009646171,0.000023128374],"genre_scores_gemma":[0.9832037,0.000009127151,0.016461683,0.00013439955,0.000046163364,0.000048144655,0.000005632731,0.000022227363,0.000068926056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982391,0.00005117797,0.0003650528,0.0005560312,0.00031028007,0.00047837378],"domain_scores_gemma":[0.9986947,0.00025216653,0.00015671595,0.0006543756,0.00013406576,0.000107935055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042775896,0.0002096,0.00033316395,0.00030058593,0.0001514212,0.00006095969,0.00062337617,0.000057730307,0.000007858946],"category_scores_gemma":[0.00005565278,0.00016983575,0.00012758563,0.00065507216,0.000029142411,0.00013690426,0.00052761415,0.00020647817,0.00002960514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004497969,0.002041686,0.10201979,0.0012056489,0.00020724014,0.00007941892,0.017913112,0.60144544,0.041291602,0.100832425,0.004005912,0.12850793],"study_design_scores_gemma":[0.0005516935,0.00086642965,0.025811711,0.0002675396,0.000005483964,0.000009043009,0.00007473761,0.9222214,0.00087664893,0.048365254,0.00068613875,0.00026388085],"about_ca_topic_score_codex":0.00018801485,"about_ca_topic_score_gemma":0.0005581774,"teacher_disagreement_score":0.320776,"about_ca_system_score_codex":0.000050480503,"about_ca_system_score_gemma":0.000093146875,"threshold_uncertainty_score":0.6925701},"labels":[],"label_agreement":null},{"id":"W2611519129","doi":"10.1088/2058-9565/aa7c4a","title":"Error suppression via complementary gauge choices in Reed-Muller codes","year":2017,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concatenation (mathematics); Convolutional code; Code (set theory); Concatenated error correction code; Error detection and correction; Noise (video); Linear code","score_opus":0.01725602039399979,"score_gpt":0.2926886410219251,"score_spread":0.2754326206279253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611519129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785579,0.0002094897,0.007602936,0.012241188,0.0005581671,0.00018159399,0.000004534752,0.00024155974,0.00040266762],"genre_scores_gemma":[0.987366,0.000023981222,0.012359297,0.00018007448,0.000033791184,0.000009313299,0.0000010349933,0.000005802685,0.000020676582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979822,0.000027465958,0.00024310302,0.0007497043,0.00039580168,0.0006017173],"domain_scores_gemma":[0.99841994,0.000058729394,0.00018032858,0.0011450058,0.00009898511,0.00009699572],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00086794974,0.00017456303,0.00023867832,0.00063162093,0.0014170943,0.00036677506,0.0031277833,0.0001101689,0.0000077179675],"category_scores_gemma":[0.00016672454,0.00013942782,0.000019811176,0.0006839835,0.0016128463,0.0006793436,0.00185337,0.0003544739,0.000012536495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017356018,0.0002668819,0.06221308,0.00004871292,0.000014291304,0.00023902235,0.0009166859,0.00005432949,0.09748836,0.3828619,0.0008126121,0.45506674],"study_design_scores_gemma":[0.0007909876,0.00035365933,0.052007888,0.00012010631,0.0000037305829,0.00015483855,0.00013381027,0.8289745,0.014255123,0.093939275,0.008831492,0.00043460884],"about_ca_topic_score_codex":0.0003719071,"about_ca_topic_score_gemma":0.00016715366,"teacher_disagreement_score":0.8289202,"about_ca_system_score_codex":0.000031427342,"about_ca_system_score_gemma":0.00010441698,"threshold_uncertainty_score":0.99988294},"labels":[],"label_agreement":null},{"id":"W2612640646","doi":"10.1103/physrevlett.120.160503","title":"Quantum and Private Capacities of Low-Noise Channels","year":2018,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Classical capacity; Physics; Quantum capacity; Quantum channel; Amplitude damping channel; Quantum; Superadditivity; Channel (broadcasting); Noise (video); Quantum noise; Quantum mechanics; Degenerate energy levels; Statistical physics; Computer science; Telecommunications; Topology (electrical circuits); Quantum information; Quantum network; Mathematics; Electrical engineering; Engineering; Mathematical economics","score_opus":0.01286078247914865,"score_gpt":0.2563534226513246,"score_spread":0.24349264017217595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612640646","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.931725,0.0022584323,0.059073914,0.006421195,0.00024349356,0.00016418006,0.0000019851389,0.00007085651,0.000040914794],"genre_scores_gemma":[0.9873043,0.00049467786,0.0035701669,0.008239133,0.0003728462,0.0000063847315,6.020869e-7,0.000008587859,0.0000033273905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990423,0.00007038084,0.00018343315,0.0002805837,0.00019771745,0.0002256244],"domain_scores_gemma":[0.9993169,0.000094191644,0.000105930296,0.0003698733,0.000038453658,0.00007466666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015592217,0.0001402706,0.00031986745,0.000034229754,0.00007016277,0.000032299446,0.000421145,0.0000066484604,0.0000025195768],"category_scores_gemma":[0.000037009926,0.000105184685,0.00008858079,0.0002273228,0.00031573902,0.0001161202,0.0002127369,0.00011291931,0.000018962864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003314617,0.0009214569,0.00043658508,0.020694379,0.00035882683,0.00009554504,0.025582233,0.0016141501,0.2548011,0.33546492,0.025207913,0.33478972],"study_design_scores_gemma":[0.00038574243,0.00043139918,0.0014004975,0.006366547,0.00004102907,0.00003764977,0.0000092030905,0.9565348,0.012119971,0.012745001,0.009242967,0.0006851786],"about_ca_topic_score_codex":0.000005240142,"about_ca_topic_score_gemma":8.9995844e-8,"teacher_disagreement_score":0.95492065,"about_ca_system_score_codex":0.000005960363,"about_ca_system_score_gemma":0.000009480652,"threshold_uncertainty_score":0.4289307},"labels":[],"label_agreement":null},{"id":"W2613474172","doi":"10.48550/arxiv.1011.5460","title":"Quantum Walks on Regular Graphs and Eigenvalues","year":2010,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Eigenvalues and eigenvectors; Mathematics; Strongly regular graph; Combinatorics; Spectrum (functional analysis); Stochastic matrix; Quantum graph; Quantum; Matrix (chemical analysis); Discrete mathematics; Pathwidth; Quantum computer; Graph; Physics; Quantum mechanics; Line graph; Markov chain","score_opus":0.02237343433972121,"score_gpt":0.1671149362627925,"score_spread":0.14474150192307128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613474172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95136404,0.000018966133,0.046867795,0.00023283552,0.00041507068,0.00007317522,0.000001507749,0.00025289808,0.00077373034],"genre_scores_gemma":[0.99698055,0.00001873265,0.00249411,0.00016518128,0.000041685496,1.2351573e-7,7.8979133e-7,0.0000089950145,0.0002898236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890214,0.00005318272,0.00008812076,0.00060006685,0.00007394068,0.00028254677],"domain_scores_gemma":[0.99899894,0.00009699431,0.000060624967,0.000640955,0.00004270988,0.0001597482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018589443,0.00016361757,0.00013887104,0.00016951702,0.00027083536,0.00008563509,0.0006851176,0.00008797812,0.000008227157],"category_scores_gemma":[0.000021524,0.00015654086,0.00007443697,0.00045558962,0.00013540422,0.00018346703,0.00026401586,0.0003580031,0.000032831165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009157254,0.00005044591,0.0011464512,0.000006616662,0.000016433813,0.00015516239,0.00018967823,0.006254744,0.0011581312,0.9838964,0.00015970848,0.006957112],"study_design_scores_gemma":[0.0002991418,0.00013601949,0.0055644535,0.000014210031,0.0000080003265,0.000022508932,0.000018805438,0.8368676,0.00058264163,0.15491845,0.0013335196,0.00023467833],"about_ca_topic_score_codex":0.00003316626,"about_ca_topic_score_gemma":0.000012720584,"teacher_disagreement_score":0.83061284,"about_ca_system_score_codex":0.000009598257,"about_ca_system_score_gemma":0.000027563137,"threshold_uncertainty_score":0.6383551},"labels":[],"label_agreement":null},{"id":"W2613822025","doi":"10.1063/1.5003169","title":"Thermocompression bonding technology for multilayer superconducting quantum circuits","year":2017,"lang":"en","type":"article","venue":"Applied Physics Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Superconductivity; Thermocompression bonding; Materials science; Electronic circuit; Quantum; Optoelectronics; Condensed matter physics; Nanotechnology; Physics; Quantum mechanics","score_opus":0.02572513695955639,"score_gpt":0.26464233907015156,"score_spread":0.23891720211059517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613822025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53422916,0.000011569302,0.46029666,0.004299873,0.00042801458,0.00028337905,0.0000023554794,0.00025535343,0.00019364094],"genre_scores_gemma":[0.9619242,5.1904686e-7,0.036742516,0.0007765329,0.00044670625,0.00006499033,0.000003929532,0.000029931352,0.000010707999],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99851847,0.000013144948,0.00019051963,0.0006009011,0.00017936683,0.0004976154],"domain_scores_gemma":[0.99838054,0.00011717342,0.00021663685,0.0011889996,0.000034455665,0.00006221209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017351967,0.00023083891,0.0002461973,0.00007915938,0.0012745733,0.00036196568,0.0017716715,0.00008407978,7.308567e-7],"category_scores_gemma":[0.000021255508,0.0002086881,0.000100661004,0.0001211797,0.00012376442,0.0002626331,0.0005387192,0.00029982644,0.00001076023],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001947611,0.000021941594,0.000030346799,0.000014128916,0.000016571532,0.000003734758,0.00037730148,0.00089396426,0.7395447,0.09379958,0.00019833262,0.16509745],"study_design_scores_gemma":[0.001509616,0.000044415458,0.0004946564,0.000102933176,0.00002048639,0.000020420368,0.000086429245,0.39898124,0.56173754,0.032236323,0.0038594792,0.00090648845],"about_ca_topic_score_codex":0.000008138154,"about_ca_topic_score_gemma":1.7054496e-7,"teacher_disagreement_score":0.427695,"about_ca_system_score_codex":0.000022769053,"about_ca_system_score_gemma":0.00001927106,"threshold_uncertainty_score":0.9803116},"labels":[],"label_agreement":null},{"id":"W2615748526","doi":"","title":"Interacting boson problems can be QMA-hard","year":2010,"lang":"en","type":"article","venue":"Bulletin of the American Physical Society","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; University of British Columbia","funders":"","keywords":"Quantum; Complexity class; Boson; Quantum complexity theory; Class (philosophy); Computer science; Physics; Quantum mechanics; Computational complexity theory; Quantum computer; Theoretical physics; Algorithm","score_opus":0.007592180676176014,"score_gpt":0.23136551438935518,"score_spread":0.22377333371317917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615748526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96302104,0.000004542018,0.0035600183,0.03250108,0.00036726764,0.00012432113,0.0000047606486,0.0001148715,0.00030208618],"genre_scores_gemma":[0.956371,0.000001673507,0.0416495,0.0015055465,0.00033946638,0.0000067786373,5.548667e-7,0.000014690114,0.000110769666],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871254,0.0000771057,0.0001809307,0.00036589996,0.00033602654,0.00032747057],"domain_scores_gemma":[0.9984854,0.0003076954,0.00036253536,0.0006959128,0.00006330988,0.000085134336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001992091,0.00017012868,0.00028114172,0.000009836367,0.00022269913,0.00007083917,0.0014143878,0.00002455872,0.00000835],"category_scores_gemma":[0.00008340986,0.000113055794,0.00044603134,0.00033961472,0.00041697992,0.000020837095,0.00077266345,0.0007045777,0.000008225244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021738126,0.00140118,0.0028844625,0.00015324367,0.0003338714,0.0000044447556,0.028167382,0.008196262,0.42591077,0.012629057,0.10217612,0.41812146],"study_design_scores_gemma":[0.0007172978,0.00048177203,0.01780582,0.00018449225,0.000049870167,0.000050052495,0.00057179795,0.6933856,0.050805148,0.005855187,0.22902033,0.0010726535],"about_ca_topic_score_codex":0.0006504458,"about_ca_topic_score_gemma":0.00000395661,"teacher_disagreement_score":0.6851893,"about_ca_system_score_codex":0.000017334947,"about_ca_system_score_gemma":0.000041876498,"threshold_uncertainty_score":0.46102813},"labels":[],"label_agreement":null},{"id":"W2617451301","doi":"","title":"Recovery-Restart Techniques for Resilient Krylov Methods","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Krylov subspace; Computer science; Resilience (materials science); Scale (ratio); Parallel computing; Subspace topology; Distributed computing; Presentation (obstetrics); Computational science; Algorithm; Iterative method; Artificial intelligence","score_opus":0.014308260211922403,"score_gpt":0.2767055740875662,"score_spread":0.2623973138756438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617451301","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046724277,0.0006617778,0.9740285,0.01106784,0.0006807704,0.00084302766,0.00003655213,0.000962432,0.007046661],"genre_scores_gemma":[0.017191095,0.00018995574,0.9788126,0.00030270594,0.00010012996,0.00019680275,0.00012774717,0.00006189479,0.0030170716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9899013,0.0067860717,0.00073232554,0.0015178223,0.00045857026,0.00060388655],"domain_scores_gemma":[0.9891593,0.0039144377,0.0007115081,0.004085125,0.0019241015,0.00020556574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.012319073,0.0005110609,0.0006094766,0.00033557916,0.00052683597,0.0009221477,0.0038380204,0.00042599844,0.000014041346],"category_scores_gemma":[0.0022815212,0.00050873973,0.00045980205,0.0004039941,0.00018148536,0.00014171096,0.0037360466,0.00091114535,0.000014139278],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009074529,0.0002745325,0.0000388541,0.00021007075,0.00006449885,0.000002421997,0.0024569833,0.00084909156,0.0011052885,0.103625916,0.0038130956,0.8875502],"study_design_scores_gemma":[0.00032287004,0.0000030906247,0.00026685497,0.0017461252,0.00003356532,0.0000176243,0.000010070301,0.686001,0.069744825,0.10630493,0.13474764,0.00080141734],"about_ca_topic_score_codex":0.0002878759,"about_ca_topic_score_gemma":0.00012255667,"teacher_disagreement_score":0.88674873,"about_ca_system_score_codex":0.00011965405,"about_ca_system_score_gemma":0.0003428876,"threshold_uncertainty_score":0.9997364},"labels":[],"label_agreement":null},{"id":"W2618134479","doi":"10.1007/978-3-319-59936-6_11","title":"Controlled and Uncontrolled SWAP Gates in Reversible Logic Synthesis","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Toffoli gate; Quantum gate; Computer science; Quantum circuit; Logic gate; Quantum logic; Gate count; Qubit; Controlled NOT gate; Swap (finance); Realization (probability); Arithmetic; Quantum computer; Quantum; Topology (electrical circuits); Algorithm; Quantum error correction; Mathematics; Quantum mechanics; Electrical engineering; Physics; Computer hardware; Engineering","score_opus":0.013179753917255418,"score_gpt":0.23549819117185333,"score_spread":0.2223184372545979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618134479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006172544,0.0020257605,0.9866435,0.0042047785,0.0014306423,0.00091116555,0.0000053178824,0.0001733214,0.0039882753],"genre_scores_gemma":[0.57298243,0.00035025206,0.42197213,0.0025281447,0.000859262,0.00005585309,0.0000027362655,0.00008121833,0.0011679605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954607,0.000104700746,0.0007240863,0.001970959,0.00081184466,0.00092769536],"domain_scores_gemma":[0.9951528,0.0021375408,0.0005744061,0.0017412531,0.00016843413,0.0002256221],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001960494,0.000752585,0.0015459948,0.0012228498,0.0005447406,0.0011194417,0.0038104437,0.0004139434,0.000013464114],"category_scores_gemma":[0.0006835978,0.0006019279,0.00022417796,0.0002889891,0.00090391573,0.0004595917,0.0018136159,0.0011100695,0.00001939653],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104107094,0.00006906777,0.00019315245,0.00009605131,0.00005162232,0.00062609726,0.0008324352,0.058187176,0.00013728264,0.019520672,0.000030347373,0.920152],"study_design_scores_gemma":[0.002182127,0.00015281343,0.00020868165,0.00078895735,0.000015673088,0.00009151098,1.8376466e-7,0.79655546,0.00017125426,0.19872889,0.00041658143,0.000687899],"about_ca_topic_score_codex":0.00008387107,"about_ca_topic_score_gemma":0.00016590513,"teacher_disagreement_score":0.9194641,"about_ca_system_score_codex":0.00018970847,"about_ca_system_score_gemma":0.0004966411,"threshold_uncertainty_score":0.9999175},"labels":[],"label_agreement":null},{"id":"W2619683245","doi":"10.1088/1367-2630/aab701","title":"Quantum walk on a chimera graph","year":2018,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Canadian Institute for Advanced Research","funders":"National Natural Science Foundation of China","keywords":"Quantum walk; Physics; Quantum; Hamiltonian (control theory); Statistical physics; Graph; Quantum algorithm; Quantum mechanics; Theoretical computer science; Computer science; Mathematics","score_opus":0.014352515882102818,"score_gpt":0.24954699481476264,"score_spread":0.23519447893265982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619683245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1752429,0.0000978429,0.8206302,0.0016176734,0.0015796621,0.000036453686,6.3498527e-7,0.000041232383,0.0007534202],"genre_scores_gemma":[0.9417919,0.000009550706,0.05328561,0.00078264734,0.0040730913,7.295598e-8,1.582669e-7,0.0000096090225,0.00004736819],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989883,0.000043216714,0.00023642271,0.00014983189,0.00036873302,0.00021351615],"domain_scores_gemma":[0.9990798,0.00006725203,0.0002644258,0.0002900048,0.00014469116,0.00015378265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016751868,0.00012558346,0.00018620436,0.000080792226,0.000117480755,0.00009869195,0.0007682139,0.000030654995,0.0000076183846],"category_scores_gemma":[0.00001814827,0.00009303325,0.00015903816,0.00036445278,0.000046512745,0.0001804216,0.00006521262,0.00031452134,0.0000410539],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022619155,0.00011609382,0.00007709771,0.0000048435504,0.00005397096,0.000040420888,0.0012297304,0.0026476393,0.00093492685,0.058158074,0.007316208,0.92939836],"study_design_scores_gemma":[0.0016259385,0.0042898934,0.005540748,0.00030427115,0.000027264467,0.000380071,0.000019446954,0.3951672,0.018432107,0.559637,0.014084084,0.00049198663],"about_ca_topic_score_codex":0.00001073455,"about_ca_topic_score_gemma":8.3362073e-7,"teacher_disagreement_score":0.9289064,"about_ca_system_score_codex":0.000010477019,"about_ca_system_score_gemma":0.00012757479,"threshold_uncertainty_score":0.3793786},"labels":[],"label_agreement":null},{"id":"W2620090200","doi":"10.1088/2058-9565/aabc6b","title":"Quantum-secured blockchain","year":2018,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":232,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Russian Science Foundation; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Blockchain; Hash function; Scalability; Cryptography; Quantum computer; Quantum key distribution; Digital signature; Key (lock)","score_opus":0.007949538730827772,"score_gpt":0.24064153636173818,"score_spread":0.23269199763091042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620090200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93669313,0.00025914048,0.051818978,0.00895946,0.0007986112,0.00014423052,0.0000013273664,0.00090376596,0.00042132888],"genre_scores_gemma":[0.9845549,0.000010508638,0.014828582,0.00043337393,0.0001297336,0.000008240824,1.5645365e-7,0.000008621269,0.000025896397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975376,0.000026661563,0.0002502393,0.0009042307,0.0005055835,0.000775689],"domain_scores_gemma":[0.99835217,0.00005793079,0.00010707852,0.0008824943,0.00043904124,0.00016131031],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009705117,0.0002046682,0.00022179501,0.0009277772,0.0009680168,0.00022371951,0.0021854525,0.00014415466,0.000006544231],"category_scores_gemma":[0.00033089804,0.00016781148,0.000027595277,0.0042521944,0.0031525947,0.00020544509,0.001072418,0.00029720683,0.000076047094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024179894,0.000045631095,0.0002305041,0.0000067448964,0.0000049864184,0.000026250196,0.00046250623,0.0000052101295,0.02677986,0.87793446,0.00030000883,0.09420141],"study_design_scores_gemma":[0.00022953124,0.00057189906,0.00052519393,0.00003361273,0.0000025858792,0.0002676164,0.00008999155,0.82403815,0.023772484,0.14612517,0.0040475554,0.00029621492],"about_ca_topic_score_codex":0.00002049918,"about_ca_topic_score_gemma":0.000005632856,"teacher_disagreement_score":0.8240329,"about_ca_system_score_codex":0.000033113876,"about_ca_system_score_gemma":0.00028570637,"threshold_uncertainty_score":0.99956024},"labels":[],"label_agreement":null},{"id":"W2623901742","doi":"10.4230/lipics.stacs.2011.661","title":"Quantum query complexity of minor-closed graph properties","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Minor (academic); Computer science; Graph; Quantum; Theoretical computer science; Mathematics; Physics; Quantum mechanics; Philosophy; Humanities","score_opus":0.08411088116472523,"score_gpt":0.18665731414721234,"score_spread":0.10254643298248711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623901742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7694726,0.000092343995,0.22836065,0.00017081705,0.00097288494,0.000250937,0.000019769253,0.0002787364,0.0003812738],"genre_scores_gemma":[0.9919185,0.000034715216,0.0076282723,0.000060562837,0.00011013893,6.4180114e-7,0.000009115842,0.000021504991,0.00021653695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976497,0.00020459274,0.00034214027,0.0011735933,0.00017137355,0.00045860035],"domain_scores_gemma":[0.99727166,0.00008505973,0.00046146414,0.0017446746,0.00025170733,0.00018545159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000317399,0.000436388,0.0005923487,0.00038602875,0.00021622548,0.00010623118,0.0029051842,0.00039405565,0.000013182125],"category_scores_gemma":[0.0000390337,0.0004227652,0.00039911945,0.0005898436,0.00067188364,0.00017532954,0.0028537672,0.001324872,0.000021173053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009979657,0.00064181146,0.0024509325,0.0008356711,0.00033070528,0.00042177035,0.0018722671,0.37696868,0.0036252912,0.6081787,0.00038331345,0.0041910643],"study_design_scores_gemma":[0.0003173431,0.000078041856,0.002535684,0.0001806193,0.000035603207,0.000010261937,0.000033117332,0.8744417,0.0013865451,0.12032978,0.0001589506,0.00049234816],"about_ca_topic_score_codex":0.0007280062,"about_ca_topic_score_gemma":0.00009886492,"teacher_disagreement_score":0.49747303,"about_ca_system_score_codex":0.000046107834,"about_ca_system_score_gemma":0.00028050356,"threshold_uncertainty_score":0.99982244},"labels":[],"label_agreement":null},{"id":"W2688697929","doi":"10.1103/physreve.96.043312","title":"Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods","year":2017,"lang":"en","type":"article","venue":"Physical review. E","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Office of the Director of National Intelligence; National Science Foundation","keywords":"Monte Carlo method; Persistence (discontinuity); Sample (material); Computer science; Quantum; Mathematical optimization; Mathematics; Statistics; Physics; Engineering","score_opus":0.04778696707844649,"score_gpt":0.3944627409043357,"score_spread":0.3466757738258892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2688697929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27863947,0.0006820578,0.7194961,0.00021103039,0.00015428383,0.0007315421,0.0000031165894,0.00006138205,0.000021081794],"genre_scores_gemma":[0.7194141,0.00014906884,0.28013396,0.00014750261,0.00011033655,0.000027263228,8.5507907e-7,0.000015399628,0.0000015235158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981499,0.0005371697,0.00020966385,0.0006136588,0.00023778959,0.0002518727],"domain_scores_gemma":[0.9981541,0.00050535763,0.0002753633,0.0008178702,0.00011719777,0.000130101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000627461,0.00023776338,0.0004419283,0.00005580617,0.00087047927,0.00032517122,0.0004671454,0.000030032088,8.6966577e-7],"category_scores_gemma":[0.000627517,0.00019188516,0.0001172075,0.00019746988,0.00007845363,0.0003040368,0.00034616268,0.00022890487,9.703248e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042313864,0.00018864221,0.0001261956,0.00009171797,0.000032274296,0.00011950554,0.0016037087,0.93773586,0.000014535044,0.000101755206,0.0000058970854,0.059975658],"study_design_scores_gemma":[0.00028285672,0.0004435114,0.00029747825,0.0003372103,0.00007872809,0.00016432731,0.00007675285,0.997864,0.000020378484,0.0002005417,0.000014892731,0.00021931627],"about_ca_topic_score_codex":0.00034983258,"about_ca_topic_score_gemma":0.000003375481,"teacher_disagreement_score":0.44077465,"about_ca_system_score_codex":0.000047222264,"about_ca_system_score_gemma":0.0000313693,"threshold_uncertainty_score":0.782485},"labels":[],"label_agreement":null},{"id":"W2724637409","doi":"10.1103/physrevlett.119.050503","title":"Experimental Blind Quantum Computing for a Classical Client","year":2017,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Canadian Institute for Advanced Research","funders":"Alberta Innovates; Alberta Innovates Bio Solutions; Chinese Academy of Sciences; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Server; Computer science; Correctness; Quantum computer; Quantum entanglement; Protocol (science); Quantum; Theoretical computer science; Honesty; Physics; Quantum mechanics; Computer network; Algorithm","score_opus":0.0348765527943275,"score_gpt":0.3436980049535341,"score_spread":0.3088214521592066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724637409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54009795,0.0022896184,0.41407782,0.04165602,0.0008152779,0.0007699101,0.0000038465255,0.0001839968,0.000105539686],"genre_scores_gemma":[0.9686888,0.00004570645,0.018586894,0.011799706,0.00081611116,0.000035527697,0.0000028806135,0.000018631381,0.000005742557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983137,0.00006759112,0.00026864666,0.0005840199,0.00031120388,0.0004548011],"domain_scores_gemma":[0.9983297,0.00021282607,0.00026252714,0.001003415,0.0000350217,0.00015652453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028283923,0.00023440584,0.0004436177,0.000027774864,0.00066903647,0.00034409796,0.0015872826,0.000012412225,0.0000015713011],"category_scores_gemma":[0.00010605898,0.00018551073,0.00035675766,0.00007422006,0.00013358456,0.00020541318,0.00059640885,0.0002302194,0.000038640992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000939096,0.0029097695,0.000383466,0.003332386,0.00031848537,0.00017321954,0.0030571052,0.0040423693,0.10275273,0.26191354,0.071238644,0.54978436],"study_design_scores_gemma":[0.00062627794,0.00015127813,0.0006741717,0.00087623566,0.00001796555,0.000012847083,0.0000023108466,0.9810345,0.0013490896,0.00073944515,0.014186249,0.0003296131],"about_ca_topic_score_codex":0.0000043581517,"about_ca_topic_score_gemma":1.299889e-7,"teacher_disagreement_score":0.97699213,"about_ca_system_score_codex":0.000032956505,"about_ca_system_score_gemma":0.000024217377,"threshold_uncertainty_score":0.75649077},"labels":[],"label_agreement":null},{"id":"W2725047442","doi":"10.1103/physreva.97.022315","title":"Continuous-variable quantum Gaussian process regression and quantum singular value decomposition of nonsparse low-rank matrices","year":2018,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Office of Naval Research; Louisiana State University","keywords":"Subroutine; Quantum computer; Quantum algorithm; Gaussian process; Computer science; Singular value decomposition; Gaussian; Algorithm; Kriging; Quantum process; Mathematics; Applied mathematics; Mathematical optimization; Quantum; Machine learning; Quantum mechanics; Physics; Quantum dynamics","score_opus":0.008607886062495018,"score_gpt":0.33643589816084796,"score_spread":0.32782801209835294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725047442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.743372,0.10526161,0.1448902,0.0029966193,0.00044547056,0.0020375885,0.000027504651,0.0003587078,0.0006102501],"genre_scores_gemma":[0.95885885,0.02914549,0.009389207,0.0016077973,0.0008344322,0.000075521726,0.00002145075,0.000057556394,0.000009676576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956872,0.0005608556,0.00094080385,0.0011722599,0.00092556496,0.0007133064],"domain_scores_gemma":[0.9966395,0.000519057,0.0008595203,0.0011588635,0.00044075612,0.00038234118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008322336,0.0006279321,0.0019667912,0.00009892129,0.00032550938,0.00012287546,0.0012103888,0.00006932447,0.000009245917],"category_scores_gemma":[0.00050256297,0.0004405493,0.00045733058,0.0015356372,0.00038218786,0.00048726794,0.00048634585,0.0005254773,0.00008288709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013846716,0.0059127472,0.00035194508,0.0738994,0.00036651848,0.000105402825,0.00184312,0.0001718539,0.119484626,0.47627503,0.0053512594,0.3160996],"study_design_scores_gemma":[0.00062067684,0.0012344482,0.00045056074,0.08623864,0.00044328062,0.00007000446,0.000007301268,0.75410736,0.017143026,0.1337456,0.0048561245,0.0010829755],"about_ca_topic_score_codex":0.000032247208,"about_ca_topic_score_gemma":5.4922003e-7,"teacher_disagreement_score":0.7539355,"about_ca_system_score_codex":0.000036287263,"about_ca_system_score_gemma":0.00014835484,"threshold_uncertainty_score":0.9998046},"labels":[],"label_agreement":null},{"id":"W2725746804","doi":"10.7146/brics.v10i3.21774","title":"On the Computational Collapse of Quantum Information","year":2003,"lang":"en","type":"article","venue":"BRICS Report Series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; McGill University","funders":"Danmarks Grundforskningsfond; National Research Foundation","keywords":"Oblivious transfer; Commitment scheme; Computer science; Quantum; Theoretical computer science; Communication source; Quantum capacity; String (physics); Quantum computer; Predicate (mathematical logic); Mathematics; Discrete mathematics; Computation; Quantum network; Cryptography; Algorithm; Quantum mechanics; Physics; Computer network","score_opus":0.009961743944809205,"score_gpt":0.2203831740741499,"score_spread":0.2104214301293407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725746804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20965126,0.000023229037,0.7832735,0.0015820405,0.00045738905,0.00014265021,0.000003233721,0.00008797733,0.0047786813],"genre_scores_gemma":[0.97285634,0.0000016727688,0.02670216,0.00031208526,0.000013239495,0.00000441488,0.0000057486513,0.0000033976846,0.000100927944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990529,0.000049916693,0.00031661932,0.00011502191,0.00034683378,0.0001187502],"domain_scores_gemma":[0.99903,0.0001803654,0.00025833535,0.000328287,0.00017364646,0.000029381872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004304701,0.00008314037,0.00010124111,0.000063550506,0.00016605303,0.00009232022,0.00024900198,0.000027422502,0.0000067661563],"category_scores_gemma":[0.00036739415,0.0000568971,0.0000460052,0.0003774323,0.000059770897,0.00026704784,0.00006124746,0.00008798152,0.000009842095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026757714,0.000020094389,0.00011991234,0.000009259514,0.000007712092,0.000022830376,0.00053457567,0.055403396,0.00000919795,0.9411874,0.0012351136,0.0014478583],"study_design_scores_gemma":[0.00020915872,0.00022843652,0.0055791805,0.00003355985,0.000004996066,0.0018384258,0.00012847659,0.6097672,0.0016750348,0.33706853,0.043210987,0.0002560334],"about_ca_topic_score_codex":0.0000072765465,"about_ca_topic_score_gemma":4.8772193e-7,"teacher_disagreement_score":0.7632051,"about_ca_system_score_codex":0.000011312765,"about_ca_system_score_gemma":0.00013750016,"threshold_uncertainty_score":0.23201965},"labels":[],"label_agreement":null},{"id":"W2726825966","doi":"10.1103/physreva.96.052315","title":"Quantum computation with indefinite causal structures","year":2017,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund; Fonds Québécois de la Recherche sur la Nature et les Technologies; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; PSPACE; Formalism (music); Quantum; Computational complexity theory; Quantum computer; Theoretical computer science; Closed timelike curve; Mathematics; Spacetime; Algorithm; Quantum mechanics; Physics","score_opus":0.0202305346428652,"score_gpt":0.35452225734562964,"score_spread":0.3342917227027644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726825966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50146323,0.06614158,0.40570515,0.017915865,0.0008996999,0.0033755596,0.000046066794,0.000916856,0.0035359676],"genre_scores_gemma":[0.97634476,0.012522568,0.006659691,0.0035076716,0.0007900903,0.00008431291,0.000021046373,0.00005351643,0.000016322643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622405,0.00032830748,0.0005482959,0.001120032,0.0010659985,0.00071332796],"domain_scores_gemma":[0.99612254,0.0004157314,0.0008109594,0.002008213,0.00025953958,0.0003830446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004280058,0.00063798483,0.001513243,0.000054637174,0.000718656,0.00041972488,0.0022975586,0.00004289429,0.000005624033],"category_scores_gemma":[0.000526541,0.00042105463,0.00051702326,0.00047321618,0.00030177782,0.00058935257,0.00077153003,0.00080102653,0.00021124956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026139993,0.0010028182,0.00041630078,0.010419936,0.00023638549,0.0001648465,0.00038575183,0.00063767703,0.0020113825,0.35932568,0.005442301,0.6199308],"study_design_scores_gemma":[0.001007892,0.0011504829,0.015018324,0.025101706,0.00045925967,0.00012503166,0.0000030840442,0.57823896,0.0013177156,0.35420594,0.021446984,0.0019246181],"about_ca_topic_score_codex":0.000042991564,"about_ca_topic_score_gemma":0.0000037212858,"teacher_disagreement_score":0.61800617,"about_ca_system_score_codex":0.0000458167,"about_ca_system_score_gemma":0.00014958331,"threshold_uncertainty_score":0.9998241},"labels":[],"label_agreement":null},{"id":"W2728671143","doi":"","title":"On the relation between quantum computation and classical statistical mechanics","year":2008,"lang":"en","type":"dissertation","venue":"TSpace (University of Toronto)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Army Research Office","keywords":"Mathematics; Partition function (quantum field theory); Discrete mathematics; Potts model; Quantum walk; Statistical mechanics; Belief propagation; Quantum computer; Chiral Potts curve; Ising model; Quantum; Algorithm; Statistical physics; Quantum mechanics","score_opus":0.01436836343979681,"score_gpt":0.24094684717744985,"score_spread":0.22657848373765305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2728671143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20223753,0.00019039957,0.790896,0.0015558912,0.0003692868,0.00026533147,0.000023495817,0.000119255645,0.004342814],"genre_scores_gemma":[0.9788475,0.00009754005,0.020297825,0.00002211922,0.000053292904,1.9061027e-7,0.00012681275,0.000013175358,0.0005415546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987838,0.00014976297,0.00011990482,0.00038220506,0.00038717853,0.00017711171],"domain_scores_gemma":[0.9987365,0.00058239955,0.00025027318,0.00026057765,0.000086332104,0.00008389484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016096242,0.00018717397,0.00027997536,0.000047255344,0.00040945073,0.0000339657,0.00044911407,0.00020456401,0.00009957577],"category_scores_gemma":[0.000041089024,0.00017433496,0.00007268127,0.00007846239,0.00005793719,0.00016176939,0.000102698315,0.0003447016,0.000008846565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010341576,0.00009861247,0.000029670719,0.000112663016,0.00015300555,0.00006200018,0.026809301,0.0015105082,0.00007400972,0.6606327,0.0029402252,0.30747384],"study_design_scores_gemma":[0.0003112191,0.00034757264,0.13574354,0.00012118275,0.000049569477,0.0000070706806,0.0013304813,0.85292006,0.000008745293,0.008706736,0.00018286028,0.0002709588],"about_ca_topic_score_codex":0.003176801,"about_ca_topic_score_gemma":0.001371264,"teacher_disagreement_score":0.85140955,"about_ca_system_score_codex":0.000092652226,"about_ca_system_score_gemma":0.00008977566,"threshold_uncertainty_score":0.7109173},"labels":[],"label_agreement":null},{"id":"W2729893749","doi":"10.1007/s00220-020-03689-1","title":"Approximate Quantum Error Correction Revisited: Introducing the Alpha-Bit","year":2020,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Canadian Institute for Advanced Research; Simons Foundation","keywords":"Quantum channel; Quantum capacity; Quantum error correction; Quantum teleportation; Qubit; Quantum entanglement; Quantum information; Quantum information science; Amplitude damping channel; Quantum algorithm","score_opus":0.046564295707404404,"score_gpt":0.299005864727243,"score_spread":0.2524415690198386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2729893749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029109865,0.00022689377,0.97219765,0.022726668,0.0001295518,0.00028158328,0.0000014858628,0.00024249955,0.0012826703],"genre_scores_gemma":[0.7922371,0.000049068727,0.20608078,0.0013178223,0.00021997126,0.00004261241,0.000007795931,0.000021449332,0.000023397846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985857,0.00026790882,0.0003796741,0.00030923623,0.00022014572,0.0002373391],"domain_scores_gemma":[0.99669737,0.0007571244,0.00013561387,0.0022720417,0.00006603074,0.000071809154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004940596,0.00015612866,0.00023685799,0.00003138858,0.00034276096,0.00017609328,0.0028277019,0.0000423318,0.0000050473013],"category_scores_gemma":[0.00038375804,0.00011367578,0.000084735024,0.00094296475,0.00016223357,0.0001858103,0.0013288176,0.0006518302,0.000098396216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031899908,0.0002609358,0.00004096481,0.00010044278,0.000019419169,0.0000016556426,0.0077701113,0.008252529,0.00022278503,0.88503224,0.002179164,0.096116565],"study_design_scores_gemma":[0.000089780835,0.000023887624,0.00006039912,0.00007555928,0.000006014553,0.0000064378683,0.000113166316,0.8368826,0.000080767095,0.16161516,0.00093109487,0.00011514129],"about_ca_topic_score_codex":0.0000043086816,"about_ca_topic_score_gemma":8.672731e-7,"teacher_disagreement_score":0.8286301,"about_ca_system_score_codex":0.000031131956,"about_ca_system_score_gemma":0.000034544497,"threshold_uncertainty_score":0.52546203},"labels":[],"label_agreement":null},{"id":"W2737913277","doi":"10.48550/arxiv.1707.06703","title":"An Infinite Family of Circulant Graphs with Perfect State Transfer in Discrete Quantum Walks","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Waterloo","funders":"","keywords":"Circulant matrix; Quantum walk; Transfer (computing); Mathematics; Circulant graph; Discrete mathematics; Quantum; State (computer science); Spectrum (functional analysis); Graph; Combinatorics; Line graph; Quantum computer; Quantum mechanics; Physics; Computer science; Algorithm; Voltage graph","score_opus":0.03532273943831923,"score_gpt":0.19349484393337682,"score_spread":0.15817210449505759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737913277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66827744,0.000044366952,0.330937,0.00002746892,0.00018759671,0.00021912379,0.000034588968,0.000099394434,0.00017305426],"genre_scores_gemma":[0.99860245,0.00013055679,0.0011258,0.00003170635,0.000023811077,9.1835625e-7,0.000016306023,0.00002828564,0.000040161252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974146,0.00026465158,0.0003045431,0.0013158172,0.00018579647,0.00051459],"domain_scores_gemma":[0.9972689,0.00009012636,0.00024297471,0.0020657736,0.00012893535,0.00020327621],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041607968,0.00046376904,0.0006355327,0.00055682333,0.00019480531,0.00017441223,0.0027608308,0.0002079972,0.0000024687795],"category_scores_gemma":[0.000009520236,0.00042266335,0.00023259447,0.00047082634,0.00027703444,0.00035381233,0.0006616187,0.0009616664,0.000003922476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012066013,0.0001806202,0.012741981,0.0002008394,0.00012871138,0.0011617519,0.0021739863,0.94582856,0.000428778,0.034046236,0.0000044802337,0.002983411],"study_design_scores_gemma":[0.00082933623,0.00036505805,0.038435124,0.0004255889,0.000038146532,0.000011775998,0.000050276944,0.93457603,0.00012684823,0.024512812,0.000030731335,0.0005982848],"about_ca_topic_score_codex":0.0013322373,"about_ca_topic_score_gemma":0.00024754315,"teacher_disagreement_score":0.33032504,"about_ca_system_score_codex":0.00005871119,"about_ca_system_score_gemma":0.0003022357,"threshold_uncertainty_score":0.9998225},"labels":[],"label_agreement":null},{"id":"W2739908270","doi":"10.1007/jhep10(2017)107","title":"Circuit complexity in quantum field theory","year":2017,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":402,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Government of Canada; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Simons Foundation","keywords":"Quantum circuit; Quantum gravity; Ground state; Circuit complexity; Scalar field; Quantum error correction; Quantum field theory; Open quantum system; Quantum; Quantum information","score_opus":0.029616206284404707,"score_gpt":0.2574368107117705,"score_spread":0.2278206044273658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739908270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11793731,0.00008174775,0.8791916,0.001164863,0.00096555136,0.000013136533,7.3090234e-7,0.00001592122,0.0006291373],"genre_scores_gemma":[0.9917819,0.000017373595,0.007135193,0.0004381483,0.00058445084,3.6063147e-7,2.2481606e-7,0.000007184035,0.00003519029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989699,0.000094964285,0.00029611352,0.00015360075,0.00027108222,0.0002143152],"domain_scores_gemma":[0.9985043,0.00019001632,0.0005252681,0.0005928895,0.00009141665,0.00009613309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003835897,0.00012113909,0.0002707048,0.00006501737,0.00022904533,0.00021480679,0.0016112451,0.000046649708,0.0000048134543],"category_scores_gemma":[0.000088807676,0.00009640569,0.0001259711,0.00008752291,0.00007304517,0.0003777139,0.00026961658,0.00031573823,0.0000018161052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000845125,0.00007063984,0.00012652496,0.000003677398,0.000016140191,0.00008145564,0.00015650842,0.0023818796,0.000049206592,0.8972542,0.00017109256,0.09968018],"study_design_scores_gemma":[0.0003643996,0.00015290112,0.005750014,0.00006031611,0.000003936476,0.000052457723,0.0000050390067,0.057581354,0.0014026101,0.9340761,0.00043144048,0.00011944577],"about_ca_topic_score_codex":0.0001291292,"about_ca_topic_score_gemma":0.000013811717,"teacher_disagreement_score":0.87384456,"about_ca_system_score_codex":0.000022766959,"about_ca_system_score_gemma":0.00009297036,"threshold_uncertainty_score":0.393131},"labels":[],"label_agreement":null},{"id":"W2744776838","doi":"10.1103/physreva.98.032322","title":"Stable quantum memories with limited measurement","year":2018,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Defense Advanced Research Projects Agency; Sandia National Laboratories; U.S. Department of Energy; National Nuclear Security Administration; Office of Science; National Science Foundation","keywords":"Quantum; Computer science; Physics; Quantum mechanics","score_opus":0.024301038502637172,"score_gpt":0.316824308059747,"score_spread":0.29252326955710983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744776838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19816165,0.25696355,0.4980134,0.029424138,0.0013308992,0.0061684456,0.000037760376,0.0021657285,0.0077344114],"genre_scores_gemma":[0.9424002,0.03374485,0.010183035,0.010718343,0.0024700097,0.00029628276,0.000013790641,0.00010769523,0.000065755],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947213,0.00046069143,0.0006468088,0.001264291,0.001926718,0.0009802106],"domain_scores_gemma":[0.9960804,0.00029546232,0.0004216251,0.0018566621,0.00087091944,0.00047493377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009891809,0.0007040844,0.0016607252,0.000063679996,0.00036919437,0.0001722291,0.0017693827,0.00003499542,0.00001878592],"category_scores_gemma":[0.00064186123,0.0004530982,0.0005448639,0.0019123156,0.00034893374,0.0004396383,0.0005934326,0.00061545405,0.0006294613],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009864562,0.0054354095,0.00019107648,0.027582508,0.0007669566,0.0001537027,0.0014768456,0.00010602683,0.02404742,0.25081,0.055240896,0.63409054],"study_design_scores_gemma":[0.0012856442,0.0044907373,0.0011323367,0.07070225,0.00093809905,0.00010856116,0.00001195715,0.3837616,0.029371066,0.094519764,0.4104394,0.0032385888],"about_ca_topic_score_codex":0.000021512831,"about_ca_topic_score_gemma":0.0000061414644,"teacher_disagreement_score":0.7442386,"about_ca_system_score_codex":0.00010710028,"about_ca_system_score_gemma":0.0002479416,"threshold_uncertainty_score":0.9997921},"labels":[],"label_agreement":null},{"id":"W2744938842","doi":"10.22331/q-2018-02-08-53","title":"Flag fault-tolerant error correction with arbitrary distance codes","year":2018,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Error detection and correction; Flag (linear algebra); Qubit; Quantum error correction; Low-density parity-check code; Code (set theory); Parity bit; Set (abstract data type)","score_opus":0.00959473008836012,"score_gpt":0.23576024963339,"score_spread":0.2261655195450299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744938842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2863419,0.00010001241,0.7089206,0.0007568125,0.0018212647,0.00012112212,0.000003450472,0.0004544455,0.0014803791],"genre_scores_gemma":[0.97013575,0.0000033561003,0.02853458,0.00046680536,0.00045913443,0.000008337597,0.0000035835105,0.00001991265,0.00036852504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840605,0.000071077906,0.00021405959,0.00055187644,0.0003326542,0.00042426967],"domain_scores_gemma":[0.99895597,0.00008709685,0.00011598082,0.0006028848,0.00011563928,0.00012246087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018675454,0.00022142824,0.00021790837,0.00008632944,0.00037889043,0.00017806084,0.00066631305,0.00006134949,0.000013286438],"category_scores_gemma":[0.000019134926,0.00016291835,0.000059304337,0.0004965217,0.00019373816,0.00024332618,0.00012189769,0.00026317907,0.00010300124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006904735,0.0013112015,0.0057681184,0.00023259647,0.00033569877,0.0008222902,0.0205538,0.013555879,0.0048384774,0.31853148,0.048481293,0.5848787],"study_design_scores_gemma":[0.00028746942,0.00055627176,0.0027119834,0.000109017215,0.0000057560565,0.00013595817,0.000042234493,0.97723657,0.0015882908,0.0035655994,0.013462491,0.00029838076],"about_ca_topic_score_codex":0.000062349165,"about_ca_topic_score_gemma":0.00006329757,"teacher_disagreement_score":0.9636807,"about_ca_system_score_codex":0.000027626098,"about_ca_system_score_gemma":0.00008228352,"threshold_uncertainty_score":0.6643618},"labels":[],"label_agreement":null},{"id":"W2745293121","doi":"10.1103/physreva.96.042322","title":"Experimental demonstration of perturbative anticrossing mitigation using nonuniform driver Hamiltonians","year":2017,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Qubit; Metastability; Hamiltonian (control theory); Bottleneck; Physics; Quantum; Degenerate energy levels; Quantum annealing; Ground state; Quantum mechanics; Statistical physics; Topology (electrical circuits); Quantum computer; Mathematics; Computer science; Combinatorics; Mathematical optimization","score_opus":0.021033939448545844,"score_gpt":0.3690518211767204,"score_spread":0.34801788172817455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745293121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86210006,0.018050151,0.11657638,0.0012293785,0.00019846996,0.0009088127,0.000010817573,0.00008728784,0.0008386665],"genre_scores_gemma":[0.98463714,0.0031770247,0.01120256,0.0005980577,0.00032328893,0.000022421531,0.0000069523003,0.000022785602,0.0000097549855],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975618,0.00019262741,0.0005447472,0.00065141154,0.00063470204,0.00041472155],"domain_scores_gemma":[0.99740565,0.00018566272,0.0008266192,0.0011797016,0.00022139796,0.00018098354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032932498,0.00038222587,0.0010255344,0.000038442682,0.00065986055,0.00022292527,0.0011739491,0.000034851502,0.000003877564],"category_scores_gemma":[0.00029013786,0.00029811662,0.00056393107,0.0002885236,0.00038821631,0.00083868735,0.00044434765,0.00034235328,0.0000307325],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011702742,0.0018001016,0.00056119484,0.0066336687,0.00014633597,0.00003392046,0.002079074,0.00022859074,0.6899018,0.05520489,0.00034097655,0.2430577],"study_design_scores_gemma":[0.00039395696,0.00030733796,0.0030186027,0.021954922,0.00018274615,0.000028632781,0.000010365567,0.75220454,0.2111924,0.009141723,0.0008728039,0.00069196936],"about_ca_topic_score_codex":0.000030006138,"about_ca_topic_score_gemma":8.801233e-7,"teacher_disagreement_score":0.75197595,"about_ca_system_score_codex":0.000074954936,"about_ca_system_score_gemma":0.00014292536,"threshold_uncertainty_score":0.9999471},"labels":[],"label_agreement":null},{"id":"W2746916492","doi":"","title":"A Modular Approach to Designing an Online Testable Ternary Reversible Circuit","year":2013,"lang":"en","type":"article","venue":"International Journal of Information and Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Ternary operation; Testability; Block (permutation group theory); Computer science; Modular design; Logic optimization; Logic synthesis; Sequential logic; Logic family; Design for testing; Logic gate; Electronic circuit; Algorithm; Arithmetic; Mathematics; Reliability engineering; Electrical engineering; Engineering; Programming language","score_opus":0.01749901461161646,"score_gpt":0.23183912533298678,"score_spread":0.21434011072137032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746916492","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16733555,0.000012875419,0.83110434,0.0006430081,0.0005758941,0.00007684525,0.0000011703556,0.000029400735,0.00022089417],"genre_scores_gemma":[0.4509563,0.0000041210465,0.54723096,0.0016464159,0.0001513413,0.0000010828611,0.0000012811225,0.0000019068118,0.0000065557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841267,0.000026628637,0.00042315043,0.00015907935,0.00077626813,0.000202179],"domain_scores_gemma":[0.9982852,0.000033229942,0.00027248735,0.00019156035,0.00096195086,0.00025558332],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006376211,0.000105543484,0.000121921556,0.00062072737,0.00015255809,0.0013086533,0.0020036844,0.00002410787,0.0000032731189],"category_scores_gemma":[0.00004273403,0.00008535359,0.000037900623,0.00047443417,0.000068023866,0.006363702,0.00045259684,0.00016077618,0.000012658005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006195159,0.00016136964,0.00044642985,0.000009568446,0.000023460274,0.000009029552,0.0052200016,0.10452066,0.0019044385,0.011604335,0.00044707782,0.8756474],"study_design_scores_gemma":[0.00024328203,0.00018977304,0.010715093,0.00004655384,0.0000012498718,0.0005798548,0.00006843169,0.9849708,0.00027025893,0.0020093224,0.0007902007,0.00011516555],"about_ca_topic_score_codex":0.000030111421,"about_ca_topic_score_gemma":1.6908368e-7,"teacher_disagreement_score":0.8804501,"about_ca_system_score_codex":0.000056079803,"about_ca_system_score_gemma":0.00017306874,"threshold_uncertainty_score":0.9997281},"labels":[],"label_agreement":null},{"id":"W2747088929","doi":"10.1007/978-3-319-66167-4_9","title":"Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; Quadratic unconstrained binary optimization; Maximum satisfiability problem; Scalability; Qubit; Encoding (memory); Theoretical computer science; Quantum computer; Quadratic equation; Algorithm; Quantum; Artificial intelligence; Boolean function; Mathematics","score_opus":0.01503819851531909,"score_gpt":0.24849767329681977,"score_spread":0.23345947478150067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747088929","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032711853,0.0009583385,0.99152935,0.001967613,0.0007527196,0.0004064412,0.000004069151,0.00017568005,0.00093459745],"genre_scores_gemma":[0.37831962,0.000104461535,0.6198122,0.00057754497,0.0005441464,0.0000121908915,0.00000961175,0.000059471025,0.0005607908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962215,0.00003073061,0.00044441115,0.0019334417,0.00072190096,0.0006480268],"domain_scores_gemma":[0.9968301,0.0004747938,0.0005009176,0.0017470453,0.00019465157,0.00025249872],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082949694,0.00058658415,0.0005735172,0.0005824399,0.0011195341,0.0016088537,0.0017623283,0.00023611585,0.0000030411159],"category_scores_gemma":[0.00012688112,0.0004701188,0.00006643518,0.0001813958,0.0014627778,0.00064794684,0.0021567128,0.0008536057,0.000004410422],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001998858,0.000031152562,0.0005647099,0.00012340432,0.000032258882,0.002018557,0.002215353,0.010735161,0.000040633906,0.010458448,0.000022764407,0.9737376],"study_design_scores_gemma":[0.0003129062,0.00053724105,0.002463609,0.00093121285,0.00001711102,0.0045621684,3.5735053e-7,0.90997773,0.00003249445,0.079188615,0.0012662231,0.00071032124],"about_ca_topic_score_codex":0.00005043121,"about_ca_topic_score_gemma":0.00007355138,"teacher_disagreement_score":0.9730272,"about_ca_system_score_codex":0.00008076957,"about_ca_system_score_gemma":0.0005035112,"threshold_uncertainty_score":0.99977505},"labels":[],"label_agreement":null},{"id":"W2747586170","doi":"10.1103/physrevlett.120.200503","title":"Topological Qubits from Valence Bond Solids","year":2018,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Physics; Qubit; Topology (electrical circuits); Subspace topology; Topological degeneracy; Parity (physics); Valence bond theory; Symmetry protected topological order; Quantum mechanics; Concatenation (mathematics); Twist; Topological order; Theoretical physics; Quantum; Mathematics; Combinatorics; Geometry","score_opus":0.016281826158856372,"score_gpt":0.2849950546701506,"score_spread":0.26871322851129426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747586170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6573178,0.005559875,0.26952818,0.06527177,0.00089117064,0.00033139176,0.000010282839,0.00046702506,0.00062246533],"genre_scores_gemma":[0.8523441,0.00054830895,0.043013792,0.101777345,0.0022675467,0.00001663017,0.0000048449765,0.00001528219,0.000012151973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846804,0.000104162194,0.00020065214,0.00054653146,0.00031244013,0.00036817658],"domain_scores_gemma":[0.9989112,0.00020926342,0.00008379065,0.0006242207,0.00003847829,0.00013301935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014890535,0.00019284803,0.00034303367,0.000021295298,0.00013769399,0.00007372969,0.001061687,0.000012559742,0.000023477609],"category_scores_gemma":[0.00006893378,0.0001382394,0.00016937015,0.00031495522,0.00019682098,0.00013642383,0.00037969058,0.00024387201,0.00044903142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001753664,0.0008840518,0.00057288655,0.0008826926,0.0001853977,0.00029988357,0.0040102038,0.0003230053,0.05903986,0.06557306,0.21416248,0.6540489],"study_design_scores_gemma":[0.0007396,0.0008109334,0.0083974665,0.004476315,0.00011425203,0.000069111426,0.0000079093425,0.728788,0.006897283,0.05256689,0.19514485,0.00198737],"about_ca_topic_score_codex":0.000019406087,"about_ca_topic_score_gemma":6.760036e-7,"teacher_disagreement_score":0.728465,"about_ca_system_score_codex":0.00001647845,"about_ca_system_score_gemma":0.000017029513,"threshold_uncertainty_score":0.577154},"labels":[],"label_agreement":null},{"id":"W2748611356","doi":"10.1109/msp.2017.3151325","title":"The Day the Cryptography Dies","year":2017,"lang":"en","type":"article","venue":"IEEE Security & Privacy","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptography; Computer science; Computer security; Internet privacy","score_opus":0.01230760616528595,"score_gpt":0.25839278028605595,"score_spread":0.24608517412077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748611356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65054107,0.0023183825,0.24685486,0.085853636,0.0077277124,0.0006353865,0.00000835662,0.00065499323,0.0054056277],"genre_scores_gemma":[0.99620444,0.000113681686,0.0026699977,0.00042194198,0.0005154383,0.000010361294,2.6464906e-7,0.000009841261,0.000054017208],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848753,0.00017875838,0.00018762417,0.0003631167,0.00034837684,0.0004345818],"domain_scores_gemma":[0.996365,0.00049787475,0.00019691022,0.0027924487,0.00006891576,0.00007882926],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010169763,0.00018058828,0.00013855861,0.000033006447,0.004338703,0.0018629811,0.0059976033,0.00004794502,0.0000019337947],"category_scores_gemma":[0.0002549154,0.000091267146,0.00017808509,0.00013032099,0.00041999368,0.0002648547,0.0011858039,0.00042172038,0.000034979555],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112004645,0.00013589053,0.002489222,0.000024044619,0.00017070575,0.000050511484,0.02675544,0.00021389616,0.00028492312,0.20434183,0.026362497,0.7391598],"study_design_scores_gemma":[0.00036639464,0.00009116722,0.032191545,0.000055750377,0.0000148257795,0.000035246667,0.00005352237,0.17414996,0.0019002539,0.4216806,0.36900946,0.00045126598],"about_ca_topic_score_codex":0.00007952318,"about_ca_topic_score_gemma":0.00003357443,"teacher_disagreement_score":0.73870856,"about_ca_system_score_codex":0.000009411461,"about_ca_system_score_gemma":0.000042588632,"threshold_uncertainty_score":0.9993804},"labels":[],"label_agreement":null},{"id":"W2753021805","doi":"10.1088/2058-9565/aab6ba","title":"Viewing vanilla quantum annealing through spin glasses","year":2018,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"QLT (Canada)","funders":"Intelligence Advanced Research Projects Activity; National Science Foundation","keywords":"Quantum annealing; Qubit; Heuristics; Quantum computer; Computer science; Quantum; Simulated annealing; Scope (computer science); Quadratic unconstrained binary optimization; Computer engineering; Spin glass; Physics; Algorithm; Quantum mechanics","score_opus":0.01518996267639541,"score_gpt":0.2791697663797089,"score_spread":0.26397980370331353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753021805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81165427,0.0008069888,0.17758392,0.007255904,0.0011039963,0.00015009103,0.0000013218237,0.0009287674,0.00051476504],"genre_scores_gemma":[0.9501151,0.000076273296,0.049013983,0.00058144174,0.00017926208,0.0000070325896,2.9720368e-7,0.000012438259,0.000014169011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970374,0.000035842688,0.00034329048,0.0010865637,0.00055346417,0.0009434341],"domain_scores_gemma":[0.9982634,0.000087266,0.00015660272,0.00090377074,0.00046127322,0.00012767501],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010103742,0.00026379232,0.0003112914,0.0006217615,0.0013807188,0.00037375296,0.0021375827,0.00015789851,0.0000050884855],"category_scores_gemma":[0.00041062903,0.00021755398,0.000039742532,0.0043801814,0.0025530937,0.0007823378,0.001226991,0.00034572583,0.000057079556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029864336,0.000043469263,0.0007635979,0.000020166755,0.000009990838,0.000045106397,0.0016796524,0.000016946233,0.027868258,0.86182237,0.00028006447,0.1074474],"study_design_scores_gemma":[0.00028393435,0.00078159594,0.00066380476,0.00010922996,0.0000066480684,0.0004187871,0.00026238145,0.7554319,0.028828474,0.18471499,0.027998421,0.0004998653],"about_ca_topic_score_codex":0.000051419986,"about_ca_topic_score_gemma":0.000005034195,"teacher_disagreement_score":0.7554149,"about_ca_system_score_codex":0.000047318346,"about_ca_system_score_gemma":0.00030618187,"threshold_uncertainty_score":0.99991935},"labels":[],"label_agreement":null},{"id":"W2753827843","doi":"10.1007/s11128-017-1791-8","title":"Nonexistence of n-qubit unextendible product bases of size $$2^n-5$$ 2 n - 5","year":2017,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Beijing Municipal Natural Science Foundation","keywords":"Cardinality (data modeling); Product (mathematics); Field (mathematics); Cardinal number (linguistics); Basis (linear algebra)","score_opus":0.013788789422714026,"score_gpt":0.26152542565691383,"score_spread":0.2477366362341998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753827843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39491275,0.0003851558,0.5915088,0.0017080036,0.00079621765,0.00042766388,0.000018773422,0.0002823994,0.009960242],"genre_scores_gemma":[0.9433238,0.000007955576,0.05651858,0.00007199388,0.000039854724,0.0000041982635,0.0000022353174,0.000004905738,0.000026501053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985482,0.000022889995,0.0006090032,0.00017915365,0.00040910885,0.00023163049],"domain_scores_gemma":[0.9974363,0.00007787041,0.0012712802,0.0008123705,0.00034625392,0.000055933553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048954616,0.00014476942,0.0002538099,0.0001313161,0.00048001652,0.00033411532,0.00128878,0.00004036257,0.000004859516],"category_scores_gemma":[0.00058137684,0.00012268854,0.00006828718,0.00023167244,0.00017144714,0.002378437,0.0003161783,0.00013160736,0.000008224339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028337901,0.00011093906,0.0011473275,0.0015526218,0.00002028302,0.0000031021139,0.0062616114,0.004477474,0.0028009892,0.04612875,0.00014599808,0.93732256],"study_design_scores_gemma":[0.0004045182,0.0001323228,0.009652149,0.0004999416,0.000008524821,0.000032331307,0.0001256951,0.9499889,0.031236473,0.006112521,0.0015561649,0.00025046355],"about_ca_topic_score_codex":0.00006614938,"about_ca_topic_score_gemma":0.000001157028,"teacher_disagreement_score":0.9455114,"about_ca_system_score_codex":0.000012074925,"about_ca_system_score_gemma":0.00020348931,"threshold_uncertainty_score":0.50030935},"labels":[],"label_agreement":null},{"id":"W27544195","doi":"10.1007/s10329-016-0566-7","title":"Demonstration of quantum error correction using linear optics (4 pages)","year":2005,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; American Society of Primatologists","keywords":"Physics; Quantum; Statistical physics; Optics; Quantum mechanics","score_opus":0.032794058632135296,"score_gpt":0.32097929597624525,"score_spread":0.28818523734410995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27544195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13410123,0.003031365,0.8606283,0.0014158384,0.0003157196,0.00018812237,7.108043e-7,0.000091927825,0.00022676648],"genre_scores_gemma":[0.92176455,0.0009058704,0.07638911,0.00041905543,0.00049409614,0.0000032081084,0.000001396954,0.000008817491,0.00001389444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991267,0.00007292351,0.00023449675,0.00020839811,0.000208317,0.00014919037],"domain_scores_gemma":[0.9993573,0.000085760235,0.00015019308,0.00027735575,0.000075351854,0.000054073706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017590786,0.00010663508,0.00024549698,0.000028318427,0.00004874458,0.000017667971,0.00026282374,0.000018074774,0.000001187111],"category_scores_gemma":[0.00006073021,0.00008615548,0.00011984592,0.0003349858,0.000030497984,0.00014883028,0.00008178993,0.00015018493,0.000013519334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031985317,0.00040951604,0.00005306902,0.00068924786,0.000024005047,0.000003588185,0.00029717453,0.057759363,0.0060041607,0.03378608,0.000729737,0.90024084],"study_design_scores_gemma":[0.000054315875,0.00005957779,0.00010707619,0.0006128833,0.000017445645,0.000014069875,0.0000015104665,0.9952595,0.0018584852,0.00082433585,0.001095313,0.00009548946],"about_ca_topic_score_codex":0.000005195735,"about_ca_topic_score_gemma":8.186423e-7,"teacher_disagreement_score":0.9375001,"about_ca_system_score_codex":0.00001675718,"about_ca_system_score_gemma":0.00004374919,"threshold_uncertainty_score":0.35133186},"labels":[],"label_agreement":null},{"id":"W2754727929","doi":"10.1371/journal.pone.0208510","title":"qTorch: The quantum tensor contraction handler","year":2018,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"Division of Chemistry; Office of Naval Research; National Energy Research Scientific Computing Center; Intel Corporation; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Contraction (grammar); Physics; Medicine; Internal medicine","score_opus":0.04207620031612348,"score_gpt":0.23062224314421884,"score_spread":0.18854604282809534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754727929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81659067,0.00014472754,0.16857871,0.011893797,0.0005684248,0.00025127918,0.0000022144523,0.0004076182,0.0015625801],"genre_scores_gemma":[0.98061687,0.0000071695845,0.01703912,0.0008352818,0.0009630314,0.0000078871935,6.470025e-7,0.000009427001,0.0005205615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894834,0.000069985166,0.00013629462,0.0002635053,0.00032319952,0.00025865564],"domain_scores_gemma":[0.9990779,0.00014887674,0.00006946243,0.0005086844,0.00013577506,0.000059287297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024790814,0.00010313022,0.00012584488,0.000042219282,0.00035206598,0.00016080742,0.0005985473,0.00004163257,0.000024957004],"category_scores_gemma":[0.00007929828,0.00006489737,0.000041382315,0.00021868324,0.00010366633,0.00012300395,0.00013761589,0.00020176866,0.00028071975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023427667,0.010219277,0.005587559,0.0002543168,0.0021172897,0.0001367261,0.024606979,0.0006539315,0.26547673,0.2785521,0.03050502,0.3816558],"study_design_scores_gemma":[0.00025751878,0.0002778232,0.0054495214,0.00007258981,0.000022035232,0.000014058242,0.000014372768,0.9687758,0.016565986,0.0048878267,0.0034902208,0.00017225299],"about_ca_topic_score_codex":0.000021843389,"about_ca_topic_score_gemma":0.0000058447135,"teacher_disagreement_score":0.9681219,"about_ca_system_score_codex":0.000013117376,"about_ca_system_score_gemma":0.000028144977,"threshold_uncertainty_score":0.3608178},"labels":[],"label_agreement":null},{"id":"W2761673598","doi":"10.1137/16m1087072","title":"Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":633,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Air Force Office of Scientific Research; Canadian Institute for Advanced Research; Intelligence Advanced Research Projects Activity; National Science Foundation","keywords":"Quantum algorithm; Quantum phase estimation algorithm; Mathematics; Quantum algorithm for linear systems of equations; Algorithm; State (computer science); Operator (biology); Quantum; Series (stratigraphy); Polynomial; Matrix (chemical analysis); Chebyshev filter; State vector; Quantum Fourier transform; Mathematical analysis; Quantum mechanics; Quantum error correction; Physics; Quantum process; Quantum dynamics","score_opus":0.02425147854645196,"score_gpt":0.2855787927311494,"score_spread":0.26132731418469746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761673598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06978989,0.000069863054,0.92745584,0.0003203795,0.0018665523,0.00034838956,0.000006250882,0.0000697194,0.000073101095],"genre_scores_gemma":[0.75448185,0.0000048163697,0.24469519,0.000046232777,0.000716649,0.0000029816151,0.0000011487924,0.000021726632,0.000029393448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976612,0.00013082511,0.0006107493,0.0004812187,0.0006517334,0.00046431608],"domain_scores_gemma":[0.9963697,0.0008445507,0.0012909067,0.000876242,0.0004393928,0.00017921645],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013877195,0.00026583884,0.00039676044,0.00021718105,0.0018880302,0.00077094877,0.0018018822,0.00008637684,9.688048e-7],"category_scores_gemma":[0.00031183998,0.00019403071,0.00017276162,0.00013080167,0.000067623914,0.0002910534,0.00028236906,0.00054803287,0.000004665429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008962093,0.00025829428,0.00006067868,0.000051686893,0.000099813886,0.000059802907,0.0006662953,0.27046967,0.0013173341,0.011809287,0.000065753426,0.7150518],"study_design_scores_gemma":[0.001092418,0.00190527,0.00043510873,0.0009037598,0.000012091801,0.00017001988,0.000027924316,0.993282,0.0010562303,0.0007171773,0.00015693117,0.0002410771],"about_ca_topic_score_codex":0.00002455383,"about_ca_topic_score_gemma":0.00000187193,"teacher_disagreement_score":0.7228123,"about_ca_system_score_codex":0.00004950922,"about_ca_system_score_gemma":0.00018548526,"threshold_uncertainty_score":0.9994114},"labels":[],"label_agreement":null},{"id":"W2761732830","doi":"10.1016/j.jmaa.2018.05.052","title":"Spectral properties of tensor products of channels","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; University of Regina","keywords":"Tensor product; Mathematics; Multiplicative function; Tensor (intrinsic definition); Unital; Matrix (chemical analysis); Pure mathematics; Quantum; Product (mathematics); Subalgebra; Tensor product of Hilbert spaces; Tensor product of algebras; Upper and lower bounds; Discrete mathematics; Combinatorics; Algebra over a field; Tensor contraction; Mathematical analysis; Quantum mechanics; Physics; Geometry","score_opus":0.01689079738618167,"score_gpt":0.24209501371379644,"score_spread":0.22520421632761478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761732830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37096706,0.0001336865,0.62778354,0.0009616507,0.00001097966,0.00006180847,8.25797e-7,0.000004948769,0.00007551577],"genre_scores_gemma":[0.9087864,0.000010201002,0.09100595,0.0000128452875,0.00014789097,0.000002035498,8.857729e-8,0.000002230346,0.00003232717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910444,0.000023503855,0.0004684326,0.000108592765,0.00020792938,0.00008707181],"domain_scores_gemma":[0.99889433,0.00004690693,0.0003919244,0.00023033717,0.0003838179,0.000052695097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034138616,0.00006504955,0.00033435397,0.00018659158,0.000051525534,0.00002562755,0.0003140123,0.000020390336,0.000006961922],"category_scores_gemma":[0.000042951975,0.000038918155,0.00012657761,0.0007992898,0.00015131003,0.000060644383,0.00006654507,0.000070033624,0.0000015573515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057507823,0.0037124234,0.0016223137,0.0015617901,0.004483473,0.000007036302,0.011271614,0.0037869196,0.21901295,0.5876369,0.0004223787,0.1664247],"study_design_scores_gemma":[0.00035565346,0.0005911251,0.002728324,0.00024225026,0.00087703316,0.00013659426,0.00016461854,0.68187284,0.19766428,0.11449996,0.0006235854,0.0002437266],"about_ca_topic_score_codex":0.0000016712825,"about_ca_topic_score_gemma":3.011667e-7,"teacher_disagreement_score":0.6780859,"about_ca_system_score_codex":0.0000032964683,"about_ca_system_score_gemma":0.000027143453,"threshold_uncertainty_score":0.15870364},"labels":[],"label_agreement":null},{"id":"W2761967291","doi":"10.1016/j.scib.2017.12.022","title":"NMRCloudQ: a quantum cloud experience on a nuclear magnetic resonance quantum computer","year":2017,"lang":"en","type":"article","venue":"Science Bulletin","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"National Key Research and Development Program of China; Ministry of Education of the People's Republic of China; Natural Sciences and Engineering Research Council of Canada; National Safety Academic Fund; National Natural Science Foundation of China; National Science Fund for Distinguished Young Scholars; Canadian Institute for Advanced Research","keywords":"Quantum computer; Cloud computing; Quantum network; Quantum information; IBM; Quantum; Quantum technology; USable","score_opus":0.012118444873115905,"score_gpt":0.24708174621446563,"score_spread":0.23496330134134974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761967291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.931561,0.00043074592,0.029050842,0.025875531,0.007153046,0.00056682684,0.000008251633,0.00084540056,0.0045083584],"genre_scores_gemma":[0.952332,0.000024206272,0.044379428,0.0022514625,0.000638489,0.000015218407,2.4609002e-7,0.000029763587,0.00032915184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952423,0.000102944905,0.00042429016,0.0016914987,0.0013130187,0.0012259559],"domain_scores_gemma":[0.9957397,0.00014741947,0.0003135249,0.0031997846,0.00018407211,0.00041548334],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012328366,0.0004070627,0.00036374351,0.00023231887,0.0036076985,0.0024117574,0.008259963,0.00009684052,0.00010154812],"category_scores_gemma":[0.00035952812,0.00034790754,0.00014510927,0.00052457594,0.0019612683,0.00037654015,0.002211693,0.00051615847,0.0011024628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007506111,0.0004640642,0.0004926243,0.000031314554,0.000006482871,0.00046041879,0.00806138,0.0015168487,0.0021711725,0.49654824,0.023619026,0.46655336],"study_design_scores_gemma":[0.0004975844,0.0007389202,0.017866857,0.00018935949,0.0000023244943,0.000102899336,0.000053522715,0.73120147,0.0002798491,0.0030544063,0.2454172,0.0005956166],"about_ca_topic_score_codex":0.00012626337,"about_ca_topic_score_gemma":0.0000019549816,"teacher_disagreement_score":0.7296846,"about_ca_system_score_codex":0.00008013533,"about_ca_system_score_gemma":0.00018450001,"threshold_uncertainty_score":0.9998973},"labels":[],"label_agreement":null},{"id":"W2764047484","doi":"10.1016/j.jcta.2019.105181","title":"State transfer in strongly regular graphs with an edge perturbation","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Perturbation (astronomy); Mathematics; Quantum walk; Algebraic number; Graph; Quantum; Strongly regular graph; Combinatorics; Discrete mathematics; Line graph; Physics; Quantum computer; Quantum mechanics; Graph power; Mathematical analysis","score_opus":0.006800926363474224,"score_gpt":0.21704227831666595,"score_spread":0.2102413519531917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764047484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84331805,0.00039543374,0.14694738,0.0003924741,0.00838424,0.000340651,0.000007950231,0.00005560442,0.00015822094],"genre_scores_gemma":[0.9903829,0.00006278008,0.008861426,0.000036643236,0.00049710163,0.0000042719685,0.0000046871733,0.000037746748,0.00011243784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709034,0.0007210874,0.0007309659,0.00042903912,0.0006710254,0.000357518],"domain_scores_gemma":[0.9980595,0.00017454168,0.0004762681,0.00074164494,0.00039091395,0.00015710005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001804875,0.00038687946,0.00072912,0.00042626882,0.000088889414,0.0003897833,0.0016068675,0.00021437,0.0000064561186],"category_scores_gemma":[0.000042873093,0.0002890933,0.00021788456,0.00032804182,0.00011328725,0.0007610006,0.00029470658,0.0014865729,0.000001019437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023481138,0.0004173051,0.00018147599,0.00016442483,0.00020858717,0.0002586214,0.008159475,0.13778159,0.00013581965,0.83797896,0.000043106356,0.012322521],"study_design_scores_gemma":[0.002111737,0.0032515896,0.000602649,0.0005578156,0.000031918957,0.00017280871,0.00014373592,0.021339046,0.0005625871,0.9698882,0.00086729985,0.0004705766],"about_ca_topic_score_codex":0.000008230078,"about_ca_topic_score_gemma":0.0000038079759,"teacher_disagreement_score":0.14706486,"about_ca_system_score_codex":0.000093957686,"about_ca_system_score_gemma":0.0005760226,"threshold_uncertainty_score":0.99995613},"labels":[],"label_agreement":null},{"id":"W2765753692","doi":"10.1038/s41534-018-0072-4","title":"Automated optimization of large quantum circuits with continuous parameters","year":2018,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":223,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Army Research Office; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Quantum computer; Computer science; Computation; Electronic circuit; Suite; Quantum; Computer engineering; Quantum gate; Quantum circuit; Bridge (graph theory); Algorithm; Quantum algorithm; Scale (ratio); Theoretical computer science; Parallel computing; Computational science; Quantum error correction; Electrical engineering","score_opus":0.007256840712945561,"score_gpt":0.22565556651367147,"score_spread":0.21839872580072592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765753692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25932366,0.0000108439635,0.73874223,0.00017235879,0.0003310178,0.00020892135,0.000009012334,0.00069731247,0.00050465635],"genre_scores_gemma":[0.9521018,0.0000047883896,0.047470156,0.00031646382,0.000042494674,0.000007912501,0.000040919378,0.000010205961,0.0000052441587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834615,0.000068815374,0.00054439896,0.00020712322,0.00044668964,0.00038684657],"domain_scores_gemma":[0.9983862,0.0000744013,0.0004970015,0.00049151614,0.0004623331,0.00008854804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042658762,0.00020142895,0.00025648004,0.00028828098,0.00021686825,0.00018386004,0.0005509592,0.00010011984,0.000010316784],"category_scores_gemma":[0.00007825379,0.00016248271,0.00005662469,0.00078273326,0.000102635684,0.0015590249,0.00011634124,0.00014087421,0.000057122717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018095397,0.00041367265,0.0017152319,0.00032990723,0.00021200615,0.00001935775,0.024951639,0.67518425,0.000507304,0.18355592,0.004136289,0.10879348],"study_design_scores_gemma":[0.0007070063,0.00061470154,0.001448392,0.000086961656,0.000008889818,0.000053276373,0.000103318074,0.9947519,0.0007607782,0.000342181,0.0008962885,0.00022630666],"about_ca_topic_score_codex":0.00003501245,"about_ca_topic_score_gemma":0.0000030940712,"teacher_disagreement_score":0.69277817,"about_ca_system_score_codex":0.000031182517,"about_ca_system_score_gemma":0.00010289551,"threshold_uncertainty_score":0.66258526},"labels":[],"label_agreement":null},{"id":"W2766144263","doi":"10.1088/1367-2630/aa939a","title":"Comparison of memory thresholds for planar qudit geometries","year":2017,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Physics; Planar; Statistical physics; Theoretical physics; Computer graphics (images)","score_opus":0.04393923366746822,"score_gpt":0.3263191156250112,"score_spread":0.282379881957543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766144263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16505532,0.00037157699,0.83226943,0.0010663389,0.0009466131,0.00006044495,0.00000408848,0.0000114508275,0.00021477167],"genre_scores_gemma":[0.9145648,0.000007713777,0.084188394,0.000043936012,0.001127638,2.2153193e-7,3.4404462e-7,0.0000074116083,0.000059552876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990542,0.000012962412,0.00033912034,0.0001142522,0.00031334878,0.00016614729],"domain_scores_gemma":[0.99811137,0.00016309437,0.0009925088,0.00044880243,0.00019124639,0.00009298146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026930042,0.0001026139,0.00035687024,0.00006799496,0.00023816206,0.00014640024,0.0014270846,0.000036976413,0.0000012425147],"category_scores_gemma":[0.00009093315,0.00008112751,0.00018068694,0.00009029962,0.000065752574,0.00031160857,0.000118883625,0.00019607932,0.0000011619251],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056440174,0.00023927006,0.005051857,0.000079851285,0.00015400274,0.000012581525,0.0025407018,0.018048095,0.0035205686,0.023329362,0.022396943,0.9245703],"study_design_scores_gemma":[0.0054348377,0.0037818106,0.025380027,0.00069289573,0.0001427049,0.00016769666,0.00022241026,0.41531605,0.20636639,0.31897628,0.022674717,0.00084416947],"about_ca_topic_score_codex":0.00001499203,"about_ca_topic_score_gemma":0.0000023425569,"teacher_disagreement_score":0.92372614,"about_ca_system_score_codex":0.00001167809,"about_ca_system_score_gemma":0.00014463026,"threshold_uncertainty_score":0.3308284},"labels":[],"label_agreement":null},{"id":"W2766225628","doi":"10.1016/j.laa.2020.08.027","title":"Sedentary quantum walks","year":2020,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum walk; Valency; Adjacency matrix; Combinatorics; Mathematics; Graph; Quantum; Regular graph; Random walk; Complete graph; Discrete mathematics; Physics; Graph power; Quantum algorithm; Quantum mechanics; Line graph","score_opus":0.017915803038159293,"score_gpt":0.25816573991269803,"score_spread":0.24024993687453874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766225628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017251974,0.002395644,0.9608145,0.016851125,0.00041060225,0.0008710622,0.0000849638,0.0007326505,0.00058749045],"genre_scores_gemma":[0.87826806,0.0006344129,0.11456845,0.0034542617,0.0021308083,0.00040509636,0.0002336275,0.00006976849,0.00023549213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820846,0.00004558961,0.0003194668,0.0009216472,0.00023350674,0.00027129822],"domain_scores_gemma":[0.99868804,0.00009706865,0.00015493525,0.00074760715,0.00007591418,0.00023645366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010483057,0.00029546363,0.00030448387,0.0000896691,0.00027034926,0.00022344306,0.0011825984,0.00018725402,0.000010370091],"category_scores_gemma":[0.000013228855,0.00027712638,0.00011593455,0.00028420307,0.00004053853,0.00007541407,0.0022170213,0.00079650164,0.00012171583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006650792,0.00024123407,0.00006376501,0.00059597584,0.00019626535,0.000028609895,0.002233398,0.0027537325,0.00110803,0.7700898,0.00482081,0.2178617],"study_design_scores_gemma":[0.00011539578,0.000032124226,0.00029233628,0.000040429844,0.000020681895,0.000018120307,0.000009492466,0.88410825,0.00023962966,0.08214409,0.03264829,0.00033115025],"about_ca_topic_score_codex":0.000025127918,"about_ca_topic_score_gemma":0.0000018163365,"teacher_disagreement_score":0.8813545,"about_ca_system_score_codex":0.000014602406,"about_ca_system_score_gemma":0.00011042102,"threshold_uncertainty_score":0.9999681},"labels":[],"label_agreement":null},{"id":"W2766265081","doi":"10.1109/tit.2018.2833466","title":"Complexity and Capacity Bounds for Quantum Channels","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum capacity; Quantum channel; Mathematics; Quantum algorithm; Hilbert space; Quantum; Quantum information; Classical capacity; Quantum error correction; Quantum operation; Upper and lower bounds; Discrete mathematics; Quantum network; Quantum mechanics; Open quantum system; Pure mathematics; Physics","score_opus":0.02387081041126787,"score_gpt":0.2446334930440721,"score_spread":0.2207626826328042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766265081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03315563,0.0000041778276,0.96425444,0.0004165044,0.0013186886,0.00021772762,0.00003363883,0.00022738821,0.00037179093],"genre_scores_gemma":[0.9717208,0.0000023890918,0.027263384,0.00083881157,0.0000953586,0.00002741053,0.0000021694252,0.000005220979,0.000044410754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920326,0.00005722863,0.00023075775,0.000148234,0.0001449273,0.00021555969],"domain_scores_gemma":[0.9992432,0.00017816122,0.00008680073,0.00027639454,0.00013450667,0.00008093426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001537,0.0001290303,0.0001183096,0.00017452113,0.0006727872,0.00022663783,0.00027385325,0.000060582428,0.000014834725],"category_scores_gemma":[0.000010247206,0.00011445346,0.00006370153,0.0001932264,0.00023296491,0.0008469155,0.0000037719387,0.00014319264,0.000046035264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009941608,0.00007978521,8.8844564e-7,0.00006903172,0.000046828085,2.1225557e-7,0.011148388,0.005503105,0.0001015044,0.6211823,0.0003967191,0.36137182],"study_design_scores_gemma":[0.00043520506,0.00033896932,0.00004604484,0.000021311336,0.000006153766,0.000022945822,0.00007315825,0.83991534,0.0050956253,0.14927313,0.0045981263,0.00017397112],"about_ca_topic_score_codex":0.0000102201875,"about_ca_topic_score_gemma":0.0000027983529,"teacher_disagreement_score":0.9385652,"about_ca_system_score_codex":0.000023031875,"about_ca_system_score_gemma":0.000029724646,"threshold_uncertainty_score":0.5174603},"labels":[],"label_agreement":null},{"id":"W2766417943","doi":"10.1088/2058-9565/ab8ebc","title":"OpenFermion: the electronic structure package for quantum computers","year":2020,"lang":"en","type":"preprint","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada); Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Computer science; Python (programming language); Quantum computer; Documentation; Quantum; Software; Field (mathematics); License; Interface (matter); Computational science; Domain (mathematical analysis); Software engineering; Computer engineering; Programming language; Operating system; Physics; Quantum mechanics","score_opus":0.014426279673966808,"score_gpt":0.2627204855713326,"score_spread":0.24829420589736578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766417943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18278109,0.0016486913,0.67492735,0.13510442,0.002736813,0.001570845,0.000051421495,0.0011448737,0.000034474913],"genre_scores_gemma":[0.9834432,0.000104690596,0.014465369,0.0016284236,0.00024378853,0.00006775033,0.000009144025,0.000028763092,0.000008841487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551594,0.000070785216,0.00046444035,0.001980909,0.0006884661,0.0012794534],"domain_scores_gemma":[0.9969328,0.00025074996,0.00036937697,0.0018284307,0.0004297171,0.00018891827],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010193865,0.00054372475,0.0006255397,0.0005891535,0.00131793,0.00092489435,0.0073425174,0.00045716856,0.0000021817157],"category_scores_gemma":[0.00038277925,0.00037401015,0.00012542852,0.0023717736,0.001895908,0.000239553,0.006510263,0.0019072033,0.000006497949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055125242,0.000021762267,0.000032670527,0.000075354736,0.00003237965,0.00001701873,0.00044096695,0.00019114077,0.0032962481,0.94987285,0.0011482578,0.04486586],"study_design_scores_gemma":[0.00019377368,0.0003047181,0.00010578058,0.000053673233,0.000014242711,0.00011114823,0.000053892865,0.5353866,0.0019891048,0.45442057,0.0070172497,0.00034921346],"about_ca_topic_score_codex":0.000023767414,"about_ca_topic_score_gemma":0.000010511244,"teacher_disagreement_score":0.80066216,"about_ca_system_score_codex":0.00011999844,"about_ca_system_score_gemma":0.0015389193,"threshold_uncertainty_score":0.99998224},"labels":[],"label_agreement":null},{"id":"W2767117158","doi":"10.1038/s41534-017-0045-z","title":"Enhancing quantum control by bootstrapping a quantum processor of 12 qubits","year":2017,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Qubit; Sequence (biology); Quantum computer; Quantum; Control (management); Extension (predicate logic); Quantum algorithm; Quantum error correction; Quantum control","score_opus":0.00903214418211557,"score_gpt":0.2343653902474009,"score_spread":0.22533324606528535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767117158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2890465,0.0001371462,0.7073327,0.0012377667,0.0008191241,0.0004153845,0.000029897472,0.00027405834,0.00070748094],"genre_scores_gemma":[0.997213,0.00002983792,0.0021992123,0.00034994035,0.000117838565,0.000027475626,0.000021549615,0.000016826029,0.000024322662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705315,0.000079405516,0.0010927692,0.00036837277,0.0007437152,0.00066257094],"domain_scores_gemma":[0.99655515,0.00016773067,0.0015539078,0.0012046801,0.00033730618,0.0001812053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009733348,0.00036753798,0.000517182,0.00026914064,0.0009608919,0.00082127296,0.0019580952,0.00018730825,0.0000079264355],"category_scores_gemma":[0.000454967,0.00033280117,0.00017589054,0.00020896518,0.00014667619,0.003972401,0.00029826153,0.00040236954,0.000066801535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059495465,0.00089205784,0.0052324184,0.0034030078,0.0005974494,0.000052546155,0.036800917,0.016608363,0.07712354,0.5239862,0.011710546,0.32299796],"study_design_scores_gemma":[0.0012667193,0.00025896015,0.0035215525,0.00030069184,0.000016407237,0.000040723,0.00013423218,0.97867376,0.006232104,0.0043198387,0.004794964,0.0004400759],"about_ca_topic_score_codex":0.00020701907,"about_ca_topic_score_gemma":0.00001540483,"teacher_disagreement_score":0.96206534,"about_ca_system_score_codex":0.000051485793,"about_ca_system_score_gemma":0.0002137528,"threshold_uncertainty_score":0.9999124},"labels":[],"label_agreement":null},{"id":"W2767868108","doi":"10.1088/2058-9565/aac8b2","title":"A deceptive step towards quantum speedup detection","year":2018,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Speedup; Heuristics; Quantum annealing; Benchmark (surveying); Quantum; Scaling; Simulated annealing","score_opus":0.00913964800535939,"score_gpt":0.24959577372099265,"score_spread":0.24045612571563327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767868108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68802327,0.00013273832,0.30589938,0.003559622,0.00093817245,0.00015820535,0.0000012370684,0.00072117057,0.00056616985],"genre_scores_gemma":[0.975228,0.000019005396,0.024313359,0.0002456826,0.00014582937,0.000009730072,1.8171903e-7,0.000009700945,0.000028488545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974366,0.000034071716,0.00025396168,0.0009711455,0.00054884574,0.0007554152],"domain_scores_gemma":[0.9983626,0.00004403172,0.00012747024,0.0007423923,0.00056250725,0.00016098519],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009098612,0.00022759415,0.00023784909,0.0010216731,0.0010120043,0.00026692805,0.001670616,0.00016546593,0.0000069871735],"category_scores_gemma":[0.00032391187,0.000188113,0.000035438905,0.004390832,0.0028290064,0.00049771083,0.0009781179,0.00034324467,0.00008823109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060046573,0.000045770576,0.00015908245,0.0000060483803,0.0000076044366,0.000018734692,0.0005009033,0.0000022875477,0.040651366,0.25390905,0.00009447774,0.70459867],"study_design_scores_gemma":[0.00031227886,0.00139315,0.0017894522,0.00003308297,0.0000059413615,0.00041001703,0.00027870652,0.8328945,0.07540059,0.07925045,0.007845704,0.0003861442],"about_ca_topic_score_codex":0.000068302106,"about_ca_topic_score_gemma":0.000031014293,"teacher_disagreement_score":0.8328922,"about_ca_system_score_codex":0.000069596135,"about_ca_system_score_gemma":0.00031945523,"threshold_uncertainty_score":0.9998847},"labels":[],"label_agreement":null},{"id":"W2768787509","doi":"10.1016/j.pbiomolbio.2017.10.007","title":"The Western and Eastern thought traditions for exploring the nature of mind and life","year":2017,"lang":"en","type":"review","venue":"Progress in Biophysics and Molecular Biology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Philosophy; History; Environmental ethics; Cognitive science; Epistemology; Psychology","score_opus":0.06095193478572364,"score_gpt":0.35298045644616716,"score_spread":0.2920285216604435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768787509","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004395449,0.98926765,0.0050570895,0.00051691616,0.0002627228,0.00046104987,0.000028827732,0.000006639981,0.0000036770123],"genre_scores_gemma":[0.0068179923,0.9887438,0.0040152315,0.000043590346,0.0001530664,0.00019436743,0.0000105089075,0.000016314701,0.000005167107],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898577,0.00012083999,0.00022913812,0.00039495763,0.000055560697,0.00021375291],"domain_scores_gemma":[0.99898154,0.00026274854,0.00024627708,0.00043493547,0.000028165512,0.000046338515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023950909,0.00021706693,0.00051106536,0.000048778613,0.0002767194,0.00017177968,0.000600957,0.00015224323,1.317065e-8],"category_scores_gemma":[0.000018079907,0.000112076756,0.00009817324,0.00007761543,0.00047536448,0.00003674291,0.0003457164,0.0003232622,7.835899e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014374177,0.000010387087,0.000027069136,0.00044812917,0.000045595734,0.0000022715699,0.00012278161,1.7730335e-7,0.0000010491243,0.011844426,9.2236775e-7,0.9874958],"study_design_scores_gemma":[0.0004239454,0.00043527677,0.00018899531,0.0035501684,0.00017314672,0.00008941891,0.000015901858,0.0057454756,0.000032515647,0.0134682525,0.9753385,0.0005384089],"about_ca_topic_score_codex":0.000001683356,"about_ca_topic_score_gemma":0.0000015946732,"teacher_disagreement_score":0.9869574,"about_ca_system_score_codex":0.0000029968405,"about_ca_system_score_gemma":0.000043697048,"threshold_uncertainty_score":0.45703575},"labels":[],"label_agreement":null},{"id":"W2769838435","doi":"10.1103/physrevlett.120.110501","title":"Quantum Simulation of Electronic Structure with Linear Depth and Connectivity","year":2018,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":441,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamiltonian (control theory); Qubit; Quantum; Electronic structure; Swap (finance); Computer science; Conjecture; Quantum computer; Topology (electrical circuits); Quantum mechanics; Physics; Mathematics; Discrete mathematics; Mathematical optimization; Combinatorics","score_opus":0.009398618415380852,"score_gpt":0.274263847196311,"score_spread":0.2648652287809301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769838435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77254367,0.0007375322,0.22463368,0.0018804976,0.000027527427,0.00013106337,0.0000010735841,0.00003833984,0.000006612428],"genre_scores_gemma":[0.9937909,0.000060365488,0.0029447607,0.003027085,0.00016704791,0.0000014973718,9.551144e-7,0.000007018907,3.4716143e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991348,0.00007716502,0.00011868792,0.00028002527,0.0001810955,0.0002082552],"domain_scores_gemma":[0.99935097,0.00016385652,0.00010582498,0.00028068258,0.000053233558,0.00004544893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010217287,0.00012472915,0.00025771503,0.000022525812,0.00006258352,0.000017325052,0.00022001714,0.0000074483464,0.0000015900687],"category_scores_gemma":[0.00003172513,0.00008375169,0.000040511986,0.00024298255,0.00011208941,0.00010556955,0.00007825705,0.00015617993,0.0000026126254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105817795,0.00056674756,0.0041054906,0.0050364924,0.00043151472,0.000030417437,0.00366916,0.2518171,0.056314453,0.08420764,0.00097009074,0.59274507],"study_design_scores_gemma":[0.00012989197,0.00027302132,0.0028164284,0.0003455861,0.00001723718,0.000007500637,4.8191714e-7,0.99344486,0.0006438574,0.0014924725,0.0007032855,0.00012540666],"about_ca_topic_score_codex":0.000007459935,"about_ca_topic_score_gemma":0.0000037407885,"teacher_disagreement_score":0.74162775,"about_ca_system_score_codex":0.000010939801,"about_ca_system_score_gemma":0.000023846605,"threshold_uncertainty_score":0.3415295},"labels":[],"label_agreement":null},{"id":"W2770107761","doi":"10.1007/978-3-319-71069-3_23","title":"Heat-Bath Algorithmic Cooling with Correlated-Qubits Relaxation","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; Canadian Institute for Advanced Research","funders":"","keywords":"Qubit; Reset (finance); Computer science; Quantum computer; Relaxation (psychology); Statistical physics; Quantum mechanics; Quantum; Physics; Algorithm","score_opus":0.010739252846637478,"score_gpt":0.22897986823454894,"score_spread":0.21824061538791145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770107761","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004998051,0.0005389621,0.99157774,0.00072002964,0.0029189328,0.00051542337,0.000006649174,0.0004127345,0.0028097176],"genre_scores_gemma":[0.17732455,0.00009012671,0.8183957,0.0012138303,0.0016364811,0.000016293036,0.00002113022,0.00014066683,0.0011612468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459624,0.000053341744,0.0006231937,0.0022824376,0.0014067803,0.0010380283],"domain_scores_gemma":[0.9958821,0.00044952956,0.000436317,0.0025508846,0.00038683036,0.00029431877],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010667854,0.0008710109,0.0007951536,0.00092188385,0.001097312,0.0013756242,0.004783143,0.00049067766,0.000009924609],"category_scores_gemma":[0.00011288802,0.00070622365,0.00016268119,0.00041744966,0.00092299253,0.0007234447,0.0014761224,0.0019181981,0.00006019071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013789678,0.00002771869,0.000031432555,0.000035821045,0.000024143155,0.00035913254,0.00081319694,0.2551991,0.00005012927,0.0034899719,0.000019603824,0.73993593],"study_design_scores_gemma":[0.00048764792,0.000381593,0.00020168298,0.0012444948,0.000015565225,0.00054670806,1.1335092e-7,0.96500236,0.00037694728,0.02953196,0.0012558489,0.0009550615],"about_ca_topic_score_codex":0.000071775874,"about_ca_topic_score_gemma":0.000071242415,"teacher_disagreement_score":0.7389809,"about_ca_system_score_codex":0.00030673863,"about_ca_system_score_gemma":0.00094981166,"threshold_uncertainty_score":0.999661},"labels":[],"label_agreement":null},{"id":"W2770397365","doi":"10.1103/physreva.97.022337","title":"Improved quantum backtracking algorithms using effective resistance estimates","year":2018,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"Ontario Ministry of Economic Development and Innovation","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Upper and lower bounds; Quantum algorithm; Backtracking; Tree (set theory); Algorithm; Discrete mathematics; Quantum; Physics; Quantum mechanics","score_opus":0.015482858193785002,"score_gpt":0.3549000426976509,"score_spread":0.33941718450386593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770397365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13109805,0.13538514,0.7235195,0.00318872,0.0010184408,0.0039086,0.000028493907,0.00092848804,0.000924574],"genre_scores_gemma":[0.844566,0.02533305,0.11614425,0.007955897,0.0052812216,0.00042348023,0.000023606115,0.00021778543,0.000054714084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994978,0.0005391505,0.00082106906,0.0016250742,0.0008977232,0.0011389995],"domain_scores_gemma":[0.99556965,0.0011397515,0.00062576035,0.0017062367,0.00050661684,0.00045198697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091314764,0.0008389444,0.001976919,0.00007840468,0.00051042566,0.00021328467,0.0018963483,0.000060260634,0.000009944453],"category_scores_gemma":[0.0012285498,0.00063800905,0.0009134891,0.0018275103,0.00040657594,0.0005811309,0.0008161023,0.00082963443,0.00028537854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004566209,0.0021777572,0.0000752957,0.023728764,0.0004144171,0.00011542836,0.0008986038,0.00009974914,0.108312726,0.06736297,0.0042212135,0.7925474],"study_design_scores_gemma":[0.0003027075,0.00042759397,0.0002439636,0.02407598,0.00025992034,0.000028927663,0.0000018270715,0.9032883,0.012614882,0.048382472,0.0094040595,0.0009693915],"about_ca_topic_score_codex":0.00002884006,"about_ca_topic_score_gemma":0.0000032438732,"teacher_disagreement_score":0.9031885,"about_ca_system_score_codex":0.00013857993,"about_ca_system_score_gemma":0.00014565725,"threshold_uncertainty_score":0.99960715},"labels":[],"label_agreement":null},{"id":"W2770585428","doi":"10.1038/s41534-018-0071-5","title":"Improved techniques for preparing eigenstates of fermionic Hamiltonians","year":2018,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hamiltonian (control theory); Eigenvalues and eigenvectors; Ground state; Quantum; Excited state; Quantum computer; Quantum mechanics; Upper and lower bounds; Fermion; Quantization (signal processing); Bound state; Statistical physics; Physics; Computer science; Mathematics; Algorithm; Mathematical optimization; Mathematical analysis","score_opus":0.00765224942829629,"score_gpt":0.2458033731265073,"score_spread":0.238151123698211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770585428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12154083,0.000015938545,0.8765098,0.00016730311,0.00029310276,0.00036622825,0.000005783758,0.0003374565,0.0007635925],"genre_scores_gemma":[0.89513636,0.0000073819338,0.104545295,0.00016123142,0.000092827526,0.000027261354,0.00001073955,0.0000060360726,0.000012847005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990018,0.000018119912,0.0004310123,0.00014321347,0.0001525716,0.0002532808],"domain_scores_gemma":[0.99893904,0.00007043702,0.00027863187,0.00037102588,0.00029732028,0.00004357162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003799156,0.00012437724,0.00015318436,0.00017252294,0.0001915514,0.00011376206,0.0004791086,0.00006877706,0.000001681769],"category_scores_gemma":[0.00007471604,0.00010822283,0.00007613121,0.00025282818,0.00006526681,0.0009795831,0.00014027656,0.00007840622,0.000009133917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074251184,0.00006225952,0.00011439602,0.00024944975,0.00004126479,3.1882936e-7,0.0096068885,0.00043309655,0.0066997143,0.123785004,0.0010295314,0.85790384],"study_design_scores_gemma":[0.00018349379,0.0004386852,0.00029351146,0.000047131645,0.0000038466387,0.000012645198,0.00003295521,0.94600374,0.03753495,0.0071620313,0.008146619,0.00014039646],"about_ca_topic_score_codex":0.00003605894,"about_ca_topic_score_gemma":0.0000065002914,"teacher_disagreement_score":0.94557065,"about_ca_system_score_codex":0.000028307497,"about_ca_system_score_gemma":0.00007893654,"threshold_uncertainty_score":0.44131988},"labels":[],"label_agreement":null},{"id":"W2770964512","doi":"10.1088/2058-9565/aab73c","title":"A small quantum computer is needed to optimize fault-tolerant protocols","year":2018,"lang":"en","type":"preprint","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut quantique; Université de Sherbrooke","funders":"Army Research Office","keywords":"Computer science; Quantum computer; Fault tolerance; Overhead (engineering); Noise (video); Distributed computing; Computer engineering; Bootstrapping (finance); Computation; Scope (computer science); Set (abstract data type); Quantum; Algorithm; Artificial intelligence; Mathematics","score_opus":0.027155685194140102,"score_gpt":0.28289229502924107,"score_spread":0.255736609835101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770964512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3538727,0.00013413416,0.59089434,0.041678153,0.0020154354,0.009365243,0.000026939253,0.0018888562,0.00012423182],"genre_scores_gemma":[0.2126402,0.00003673353,0.77320826,0.008352416,0.0008683644,0.004678351,0.0000057375137,0.000102581624,0.0001073661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993234,0.000087430424,0.0008348566,0.0031504037,0.001066711,0.0016266097],"domain_scores_gemma":[0.9948101,0.00010826349,0.00045308896,0.002977565,0.00113177,0.0005192326],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017551068,0.00082698796,0.0010315187,0.0022865562,0.0010076493,0.0013636521,0.007461014,0.00076381955,0.00001041465],"category_scores_gemma":[0.00022729424,0.00070450845,0.00014682909,0.003943465,0.0020947093,0.00025985998,0.012401156,0.0014917867,0.0001212076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001469223,0.0012590941,0.0005631787,0.0009997259,0.00026371863,0.0006785571,0.013629527,0.0082364585,0.01310797,0.31205884,0.03610081,0.6129552],"study_design_scores_gemma":[0.00044802888,0.0010532239,0.00010234775,0.0005698865,0.000011488541,0.00021737198,0.000059491933,0.92662793,0.004521424,0.05278967,0.012657467,0.00094169],"about_ca_topic_score_codex":0.00020722602,"about_ca_topic_score_gemma":0.000009778565,"teacher_disagreement_score":0.91839147,"about_ca_system_score_codex":0.000138994,"about_ca_system_score_gemma":0.0012101346,"threshold_uncertainty_score":0.999673},"labels":[],"label_agreement":null},{"id":"W2771726258","doi":"10.1088/2058-9565/aad8ca","title":"On the controlled-NOT complexity of controlled-NOT–phase circuits","year":2018,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"","keywords":"Controlled NOT gate; Quantum circuit; Quantum gate; Quantum Fourier transform; Reduction (mathematics); Electronic circuit","score_opus":0.02682715255777691,"score_gpt":0.27977708705792426,"score_spread":0.25294993450014736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771726258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9407166,0.00010323617,0.032829344,0.02386364,0.0005610709,0.0006339105,0.0000070027095,0.00030091807,0.0009842652],"genre_scores_gemma":[0.9972119,0.000009630439,0.0014521669,0.001199218,0.00006599069,0.000026363847,1.9705072e-7,0.000007101917,0.000027459666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736446,0.00010106163,0.00046349023,0.0007340393,0.0007085086,0.0006284396],"domain_scores_gemma":[0.997298,0.0006428346,0.00031810658,0.0010655476,0.0005670894,0.00010844618],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002353084,0.00023810573,0.00063584425,0.0006413448,0.0010064311,0.00015703202,0.0024287023,0.00012318607,0.00001349361],"category_scores_gemma":[0.0014584151,0.00014002896,0.00008597151,0.0022108231,0.0072432584,0.00017448151,0.0006188113,0.00037317834,0.000026413747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008314765,0.00011751208,0.000015772419,0.0000037769994,0.00001610666,0.0000069906346,0.00018427172,0.000003992883,0.021625325,0.94648486,0.00013917423,0.031319097],"study_design_scores_gemma":[0.008247209,0.0023969822,0.00024992193,0.000051347783,0.000014248973,0.000087081586,0.000098039185,0.7160619,0.04178673,0.23011881,0.00061684224,0.0002709042],"about_ca_topic_score_codex":0.000019496412,"about_ca_topic_score_gemma":0.0000053720205,"teacher_disagreement_score":0.716366,"about_ca_system_score_codex":0.000026705204,"about_ca_system_score_gemma":0.00027531298,"threshold_uncertainty_score":0.9954585},"labels":[],"label_agreement":null},{"id":"W2773699458","doi":"10.1109/pacrim.2017.8121882","title":"A reversible majority voter circuit and applications","year":2017,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Electronic circuit; Logic gate; Fault tolerance; Sequential logic; Circuit design; Electronic engineering; Reliability engineering; Electrical engineering; Engineering; Algorithm; Distributed computing; Embedded system","score_opus":0.015913844968408794,"score_gpt":0.24439985704092423,"score_spread":0.22848601207251545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773699458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083710225,0.000036145833,0.9728516,0.0028676488,0.00009271747,0.000099054014,9.2807124e-7,0.00011874682,0.015562155],"genre_scores_gemma":[0.92867315,0.0000068192867,0.06925395,0.00034008894,0.0001588857,0.000009193239,3.4360892e-7,0.0000037698915,0.0015538211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947345,0.000009051674,0.00006235779,0.00024388239,0.00007987504,0.0001313968],"domain_scores_gemma":[0.9990761,0.000022994664,0.000045431098,0.0007671568,0.000022786904,0.00006549438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010950563,0.000060512928,0.00006650876,0.000026485553,0.00059095136,0.0003827461,0.00071349525,0.000026145866,0.000006258821],"category_scores_gemma":[0.000007987301,0.000049968326,0.000022177026,0.00003739298,0.00005164379,0.00017761542,0.00042619903,0.000082438295,0.000027696604],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.215545e-7,0.000031334694,0.0028128135,0.000016219223,0.0000104692,0.0000068102618,0.00020559359,0.000016145566,0.00021142648,0.28925756,0.0012110845,0.70622003],"study_design_scores_gemma":[0.0006186674,0.00007225522,0.082817554,0.000029392972,0.000009295091,0.000116494826,0.000013150924,0.48091683,0.0007879879,0.32701585,0.10710303,0.0004994739],"about_ca_topic_score_codex":0.000060621554,"about_ca_topic_score_gemma":0.0000067494593,"teacher_disagreement_score":0.9203021,"about_ca_system_score_codex":0.0000048213046,"about_ca_system_score_gemma":0.000015344258,"threshold_uncertainty_score":0.454518},"labels":[],"label_agreement":null},{"id":"W2775106578","doi":"10.1073/pnas.1801723115","title":"Toward the first quantum simulation with quantum speedup","year":2018,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":574,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Army Research Office; U.S. Army; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Quantum computer; Computer science; Speedup; Quantum; Factoring; Quantum algorithm; Exploit; Quantum simulator; Computation; Quantum circuit; Computer engineering; Theoretical computer science; Algorithm; Quantum error correction; Parallel computing; Quantum mechanics; Physics","score_opus":0.04150195279190004,"score_gpt":0.29249293252590036,"score_spread":0.2509909797340003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775106578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95518994,0.000080793776,0.0028394025,0.03911217,0.00011816583,0.00029434563,0.0000036357158,0.00006772213,0.0022937956],"genre_scores_gemma":[0.9928409,0.00000269647,0.006296053,0.0006072835,0.00022269005,0.0000027727363,2.176775e-8,0.000003723382,0.000023869974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780643,0.000008505885,0.0002835295,0.000328058,0.001358884,0.00021461154],"domain_scores_gemma":[0.9988049,0.0002702123,0.00043653385,0.000023960712,0.0004318685,0.000032519158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013256288,0.00012098509,0.00013469101,0.0001242325,0.00057666923,0.00011040888,0.0024173798,0.00005210762,0.000003877139],"category_scores_gemma":[0.00023742112,0.00005729272,0.00006530683,0.0013876002,0.0013349408,0.00047667327,0.00036818336,0.00019167714,0.0000035347862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037649916,0.00011603417,0.0044752737,0.00009751747,0.000044791603,3.8150397e-8,0.005993836,0.04291236,0.0073475186,0.9326775,0.0014786442,0.0048188153],"study_design_scores_gemma":[0.00011717263,0.00016660015,0.028041137,0.000097766955,0.000005057185,0.000014783074,0.00008631056,0.8653736,0.0123096425,0.09291001,0.0007806843,0.000097238146],"about_ca_topic_score_codex":0.000008778983,"about_ca_topic_score_gemma":1.2996298e-7,"teacher_disagreement_score":0.8397675,"about_ca_system_score_codex":0.000018737648,"about_ca_system_score_gemma":0.00004740189,"threshold_uncertainty_score":0.49186447},"labels":[],"label_agreement":null},{"id":"W2775563604","doi":"10.1103/physrevlett.121.010501","title":"Quantum Algorithm for Spectral Measurement with a Lower Gate Count","year":2018,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Canadian Institute for Advanced Research","funders":"National Center of Competence in Research Affective Sciences - Emotions in Individual Behaviour and Social Processes; Natural Sciences and Engineering Research Council of Canada; Institute for Quantum Information and Matter, California Institute of Technology; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Simons Foundation","keywords":"Hamiltonian (control theory); Unitary state; Qubit; Algorithm; Computer science; Gate count; Lattice (music); Operator (biology); Quantum computer; Unitary operator; Ground state; Quantum algorithm; Quantum; Quantum mechanics; Topology (electrical circuits); Physics; Mathematics; Mathematical optimization","score_opus":0.019171413600056482,"score_gpt":0.2653781742452574,"score_spread":0.24620676064520092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775563604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015309492,0.0012273985,0.9680243,0.014192441,0.00039054072,0.00063098967,0.000004182436,0.00016756794,0.000053062184],"genre_scores_gemma":[0.4891846,0.00055014284,0.41313273,0.091062464,0.0055790576,0.00033917878,0.000008797596,0.000118781805,0.000024258416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803585,0.000063449465,0.0002141243,0.0005527167,0.0006320398,0.0005018468],"domain_scores_gemma":[0.99894685,0.00005998649,0.000119658594,0.0005561627,0.00018285582,0.00013450868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041771104,0.00025655545,0.00039031898,0.000033338165,0.00016608502,0.00009876971,0.000674156,0.000008446823,0.000004585094],"category_scores_gemma":[0.000022058806,0.0001720426,0.00019166742,0.00032467936,0.00012656988,0.00013388264,0.000100978155,0.00016515673,0.00006362165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000681996,0.0012314032,0.000026441938,0.0020258722,0.00047853883,0.00011393358,0.0012373478,0.0010778422,0.008357692,0.023446562,0.06429647,0.8976397],"study_design_scores_gemma":[0.00040103216,0.0006853885,0.000109130146,0.0013465217,0.00004451326,0.000019099525,9.3033964e-7,0.9594074,0.00039337328,0.0011468332,0.03607019,0.00037559393],"about_ca_topic_score_codex":0.000008140425,"about_ca_topic_score_gemma":0.0000015137039,"teacher_disagreement_score":0.95832956,"about_ca_system_score_codex":0.000064828564,"about_ca_system_score_gemma":0.000056644123,"threshold_uncertainty_score":0.7015693},"labels":[],"label_agreement":null},{"id":"W2775795709","doi":"10.1088/978-0-7503-1536-4","title":"How to Build a Quantum Computer","year":2017,"lang":"en","type":"book","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum computer; Computer science; Quantum network; Qubit; Quantum information; Quantum technology; Quantum logic; Quantum gate; Quantum; Theoretical computer science; Physics; Open quantum system; Quantum mechanics","score_opus":0.013777737748546834,"score_gpt":0.23472902256619696,"score_spread":0.22095128481765014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775795709","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010393647,0.00010779762,0.85971427,0.012505024,0.002564225,0.0003260488,0.000009733519,0.0006095788,0.124152936],"genre_scores_gemma":[0.000098902194,0.000005227147,0.23855399,0.0016907783,0.002074016,0.0000074265226,0.0000086407135,0.000045146902,0.75751585],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731654,0.000039868522,0.00025464522,0.0011951936,0.0005780761,0.0006156832],"domain_scores_gemma":[0.9964766,0.00012196222,0.00026403996,0.0026318089,0.00014085835,0.0003647652],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00024399874,0.0005608019,0.00062116503,0.00029429243,0.00041055886,0.00242656,0.004674913,0.0003150344,0.000011753259],"category_scores_gemma":[0.000028685246,0.00045433297,0.00028789413,0.000081471444,0.00006982546,0.00021540567,0.0023557083,0.00067553547,0.0003534457],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015010636,0.000017895423,8.490686e-7,0.000036811478,0.000043486223,0.00012836525,0.0001534374,0.00027010104,0.000003623854,0.15035333,0.60113937,0.24785121],"study_design_scores_gemma":[0.00011141429,0.00017215419,0.000020892474,0.0001823474,0.000006304426,0.000058184858,3.7866553e-7,0.25764623,0.0000091032925,0.018104753,0.72316176,0.0005264681],"about_ca_topic_score_codex":0.0000134423735,"about_ca_topic_score_gemma":0.000009103538,"teacher_disagreement_score":0.63336295,"about_ca_system_score_codex":0.00008234062,"about_ca_system_score_gemma":0.00039195153,"threshold_uncertainty_score":0.99979085},"labels":[],"label_agreement":null},{"id":"W2777792777","doi":"10.1098/rsta.2017.0323","title":"The small stellated dodecahedron code and friends","year":2018,"lang":"en","type":"article","venue":"Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Dodecahedron; Code (set theory); Quantum computer; Quantum information; Quantum","score_opus":0.014061768038259193,"score_gpt":0.22450010549191465,"score_spread":0.21043833745365545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777792777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.355083,0.00008534255,0.6334313,0.010813105,0.00014089484,0.00010557562,0.0000029188886,0.00009648371,0.00024135134],"genre_scores_gemma":[0.9821787,0.0000065530207,0.017621899,0.00004602375,0.00011785462,0.0000038536546,3.022271e-8,0.000004885378,0.000020187434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990464,0.000027178385,0.000165638,0.00025645905,0.00026018382,0.0002441356],"domain_scores_gemma":[0.99906456,0.0005474816,0.000039446437,0.00022313776,0.000032657597,0.00009272467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031027943,0.0001311943,0.00016451719,0.000011611956,0.0007908268,0.00012485398,0.0006017896,0.000045576566,0.0000013490037],"category_scores_gemma":[0.00003135446,0.0000658154,0.0001407246,0.0003540578,0.0011974494,0.00006224656,0.00010959242,0.00024837948,0.0000013288502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102831145,0.00036355856,0.000021472495,0.00023587431,0.00017895758,7.182334e-7,0.0055278204,0.063324235,0.0016767886,0.8969957,0.000025483881,0.031639107],"study_design_scores_gemma":[0.00006728761,0.00010815606,0.0001792706,0.00003881529,0.000012958295,0.000004662458,0.000013445048,0.82198864,0.00043697734,0.17703493,0.00003530068,0.00007952421],"about_ca_topic_score_codex":0.0000041173967,"about_ca_topic_score_gemma":3.34435e-7,"teacher_disagreement_score":0.7586644,"about_ca_system_score_codex":0.000006313081,"about_ca_system_score_gemma":0.000015614345,"threshold_uncertainty_score":0.60824805},"labels":[],"label_agreement":null},{"id":"W2778398489","doi":"10.1038/s42005-019-0218-5","title":"Quantum spacetime on a quantum simulator","year":2019,"lang":"en","type":"article","venue":"Communications Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Florida Atlantic University; Canadian Institute for Advanced Research; National Key Research and Development Program of China; Universidad del Atlántico; National Science Foundation","keywords":"Quantum simulator; Quantum geometry; Spin foam; Quantum algorithm; Open quantum system; Quantum gravity; Quantum process; Quantum operation; Loop quantum gravity; Quantum","score_opus":0.02159924550133706,"score_gpt":0.2722703188036058,"score_spread":0.25067107330226873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778398489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37075305,0.0006033998,0.59902453,0.013598247,0.0012559847,0.0009166683,0.000023672528,0.0014625735,0.012361844],"genre_scores_gemma":[0.9763894,0.000025285513,0.022676883,0.000588133,0.00008426369,0.000010469725,0.000011575211,0.00002131665,0.00019266638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874526,0.00014583998,0.00020728777,0.000354146,0.00025361322,0.00029386207],"domain_scores_gemma":[0.9944024,0.0004580372,0.0001251419,0.0048337714,0.00009119502,0.00008942584],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018328948,0.00018973018,0.00021162567,0.000066519,0.0002974263,0.00015470611,0.0032828662,0.000054729204,0.000007860949],"category_scores_gemma":[0.000026378468,0.00017531056,0.00012197875,0.0005599585,0.00008139614,0.00018937334,0.0011440456,0.0004282663,0.0011925217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030863418,0.00027010916,0.00017095207,0.000010147635,0.000022040538,8.8153394e-7,0.00068780594,0.025272133,0.00043754998,0.9456085,0.0006732955,0.026843471],"study_design_scores_gemma":[0.00023252417,0.000119894714,0.0005294047,0.000047395835,0.0000037388736,0.0000027563906,0.000016132693,0.9404138,0.00018969,0.039839897,0.018384483,0.00022032831],"about_ca_topic_score_codex":0.000014524863,"about_ca_topic_score_gemma":8.275114e-7,"teacher_disagreement_score":0.91514164,"about_ca_system_score_codex":0.00003651271,"about_ca_system_score_gemma":0.0000763003,"threshold_uncertainty_score":0.99958515},"labels":[],"label_agreement":null},{"id":"W2780128063","doi":"10.21468/scipostphys.7.1.001","title":"Quantum walks on graphs of the ordered Hamming scheme and spin networks","year":2019,"lang":"en","type":"article","venue":"SciPost Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Hamming distance; Quantum walk; Basis (linear algebra); Type (biology); Transfer matrix; Scheme (mathematics); Hamming code","score_opus":0.0064075442597459255,"score_gpt":0.21332218285422935,"score_spread":0.20691463859448342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780128063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95657444,0.00011273037,0.041416273,0.00054092985,0.0007867141,0.00018043572,0.0000016505426,0.00006335391,0.0003234934],"genre_scores_gemma":[0.99472344,0.000005057958,0.0048944303,0.00024027427,0.00008723219,0.0000013166272,7.420603e-7,0.00001042096,0.000037072325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898,0.00005064672,0.00015216992,0.0003229162,0.00024412718,0.00025014346],"domain_scores_gemma":[0.9990501,0.00009040501,0.0001234505,0.0006417403,0.000047969683,0.000046364632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015766162,0.00014143805,0.00017098998,0.000029947658,0.00014741135,0.00007333465,0.00065252965,0.00004421867,0.00000142],"category_scores_gemma":[0.000011223652,0.00009581841,0.00008293003,0.0004892712,0.00008229607,0.00009553348,0.00042149343,0.00025921172,0.00000738927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021409121,0.00019285367,0.0075653153,0.0000936705,0.00007399295,0.000003921225,0.0018911053,0.068275765,0.0060447636,0.6665226,0.00036830074,0.24894625],"study_design_scores_gemma":[0.00023645087,0.00012665834,0.008619531,0.00011953309,0.0000034376042,0.0000034906716,0.000011884024,0.9650789,0.001319083,0.024075208,0.00025695734,0.00014885601],"about_ca_topic_score_codex":0.000017096036,"about_ca_topic_score_gemma":0.0000015797716,"teacher_disagreement_score":0.89680314,"about_ca_system_score_codex":0.0000073494875,"about_ca_system_score_gemma":0.0000336543,"threshold_uncertainty_score":0.39073613},"labels":[],"label_agreement":null},{"id":"W2781364653","doi":"10.1103/physreva.98.032310","title":"Gaussian boson sampling for perfect matchings of arbitrary graphs","year":2018,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Adjacency matrix; Combinatorics; Gaussian; Discrete mathematics; Mathematics; Graph energy; Graph; Line graph; Voltage graph; Physics","score_opus":0.01990785230152801,"score_gpt":0.3580939589922621,"score_spread":0.33818610669073407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781364653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.432372,0.09449255,0.45744315,0.008936764,0.0006806332,0.0038376031,0.00005713275,0.0005610428,0.0016191138],"genre_scores_gemma":[0.9093908,0.026512314,0.05420356,0.0075874096,0.0018947553,0.00026784313,0.000024891104,0.000096373835,0.000022070593],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996528,0.00026161486,0.0007576154,0.0010220167,0.000701113,0.00072959904],"domain_scores_gemma":[0.99680245,0.000815479,0.0005165551,0.0012875956,0.0002622817,0.00031561332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007753503,0.0005402873,0.0017008694,0.00007591593,0.00024927242,0.00007032837,0.0015769798,0.000055486824,0.000007931298],"category_scores_gemma":[0.0005467953,0.0003944157,0.0013054514,0.0011412821,0.00024703826,0.0002986232,0.00043885567,0.0006436862,0.00009758831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028089697,0.0014831596,0.000089213056,0.027904985,0.0001910265,0.000008147681,0.0007171838,0.000016567872,0.03588136,0.3103626,0.005032213,0.6182854],"study_design_scores_gemma":[0.00074488414,0.0023164584,0.00073642674,0.0515443,0.0005641782,0.000043613443,0.000004787588,0.21105973,0.032636892,0.6330676,0.0655786,0.0017025287],"about_ca_topic_score_codex":0.000015496244,"about_ca_topic_score_gemma":7.313134e-7,"teacher_disagreement_score":0.61658293,"about_ca_system_score_codex":0.000030449422,"about_ca_system_score_gemma":0.00010851035,"threshold_uncertainty_score":0.99985075},"labels":[],"label_agreement":null},{"id":"W2781933787","doi":"10.1139/cjp-2017-0768","title":"Accelerating Shor’s factorization algorithm on GPUs","year":2018,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Speedup; Quantum algorithm; Block (permutation group theory); Kernel (algebra); Quantum; Factorization; Quantum computer; Quantum phase estimation algorithm","score_opus":0.019696180874674764,"score_gpt":0.23426561419262068,"score_spread":0.21456943331794592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781933787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041482765,0.000032707394,0.95550054,0.00043941993,0.0018160585,0.00003776692,0.000004506825,0.000017118016,0.00066910026],"genre_scores_gemma":[0.9265304,9.801762e-7,0.07028765,0.00044094157,0.0026969693,2.2469908e-7,9.64018e-7,0.000010895437,0.00003092816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913496,0.000039415892,0.00022773181,0.00013694845,0.00019560342,0.00026536954],"domain_scores_gemma":[0.998956,0.000042293646,0.0001917818,0.00020140946,0.0002718729,0.00033663784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016441317,0.00010931972,0.00013366037,0.0001148489,0.00027038244,0.00023523453,0.0005754984,0.000038043225,0.000009867754],"category_scores_gemma":[0.00004067008,0.00009498319,0.00006795146,0.00032889284,0.000050723756,0.00023688124,0.000022548105,0.0002449193,0.00001690771],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5479377e-7,0.000012647104,0.0001338399,0.0000025987483,0.000018653911,0.000053671592,0.0020408023,0.0024323124,0.00024186596,0.012913076,0.0013920339,0.98075765],"study_design_scores_gemma":[0.0004439817,0.0010948128,0.0016632143,0.00016869079,0.000011415022,0.00015283548,0.000058141784,0.9393711,0.012084695,0.027991006,0.016548965,0.00041114696],"about_ca_topic_score_codex":0.00023830547,"about_ca_topic_score_gemma":0.00021225945,"teacher_disagreement_score":0.9803465,"about_ca_system_score_codex":0.00007731812,"about_ca_system_score_gemma":0.0006069717,"threshold_uncertainty_score":0.3873302},"labels":[],"label_agreement":null},{"id":"W2782388642","doi":"10.1088/2058-9565/ab3951","title":"Low-depth circuit ansatz for preparing correlated fermionic states on a quantum computer","year":2019,"lang":"en","type":"preprint","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"Air Force Office of Scientific Research","keywords":"Ansatz; Quantum computer; Coupled cluster; Physics; Quantum algorithm; Quantum mechanics; Quantum entanglement; Statistical physics; Ground state; Quantum circuit; Quantum; Topology (electrical circuits); Quantum network; Mathematics","score_opus":0.013826367072476444,"score_gpt":0.2538985097535387,"score_spread":0.24007214268106228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782388642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53758234,0.00036021814,0.453273,0.002632928,0.0034399386,0.0012666859,0.000019052575,0.0013364387,0.0000894281],"genre_scores_gemma":[0.9910516,0.000111396665,0.008068742,0.0004195729,0.00013720828,0.000098795324,0.0000148880945,0.000044619137,0.000053160216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944555,0.000063582724,0.0006694894,0.0026595679,0.00079765666,0.0013541655],"domain_scores_gemma":[0.9962476,0.00035935183,0.00051226845,0.0020872345,0.000583494,0.00021005877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014214986,0.0006726902,0.0008553432,0.0017033212,0.0007980212,0.000750404,0.004047564,0.0007048338,0.0000017063309],"category_scores_gemma":[0.0002060975,0.0005893539,0.00014309064,0.0019485011,0.0011864788,0.0002822143,0.003835997,0.0015329262,0.000041230254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042625325,0.00043807883,0.0004978417,0.0007294322,0.00011871882,0.0000636734,0.0015797374,0.036030963,0.0023759715,0.7328073,0.001077018,0.22423868],"study_design_scores_gemma":[0.00048043576,0.00094262493,0.00033942645,0.0005358414,0.000015879878,0.00009553976,0.00003686776,0.8512931,0.0017266553,0.14328969,0.0005990825,0.00064489734],"about_ca_topic_score_codex":0.000037626934,"about_ca_topic_score_gemma":0.000006507223,"teacher_disagreement_score":0.8152621,"about_ca_system_score_codex":0.00019537803,"about_ca_system_score_gemma":0.0010231438,"threshold_uncertainty_score":0.9996558},"labels":[],"label_agreement":null},{"id":"W2782719366","doi":"10.1155/2018/6153274","title":"First Steps in Creating Online Testable Reversible Sequential Circuits","year":2018,"lang":"en","type":"article","venue":"VLSI design","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Electronic circuit; Quantum dot cellular automaton; Sequential logic; Computer science; FLOPS; Quantum; Computer engineering; Logic gate; Algorithm; Electronic engineering; Parallel computing; Engineering; Electrical engineering","score_opus":0.035127033324592126,"score_gpt":0.2555582966352801,"score_spread":0.220431263310688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782719366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06075036,0.0000796116,0.93679845,0.00043286599,0.0004267577,0.00019547406,0.0000032888695,0.0002281207,0.0010850794],"genre_scores_gemma":[0.67341715,0.0000058485075,0.32532007,0.00028221053,0.00046591373,0.0000049400746,0.0000024398726,0.000017207847,0.00048419746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848723,0.00011951384,0.00024324993,0.0004625992,0.00023402633,0.0004533745],"domain_scores_gemma":[0.9990635,0.00023752257,0.00008393561,0.00044797134,0.00007613759,0.00009095662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005120493,0.00015987015,0.00018105161,0.00017845554,0.0002802283,0.00016140318,0.00074544945,0.000068587404,0.000027529875],"category_scores_gemma":[0.0001098787,0.00015024375,0.000043926393,0.00080057053,0.00006111432,0.00023352026,0.00023915674,0.00020367475,0.00006747046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050140035,0.0015932977,0.0072392304,0.000277174,0.00013187011,0.0010075596,0.021885816,0.21648245,0.024187569,0.014524409,0.017617606,0.6950029],"study_design_scores_gemma":[0.00044803796,0.00027318395,0.0020475914,0.00015409783,0.000003783069,0.000042925247,0.000025025496,0.98930335,0.0031254436,0.0018239968,0.002504022,0.00024855492],"about_ca_topic_score_codex":0.00018471036,"about_ca_topic_score_gemma":0.00006814621,"teacher_disagreement_score":0.7728209,"about_ca_system_score_codex":0.00005791288,"about_ca_system_score_gemma":0.00011925166,"threshold_uncertainty_score":0.61267626},"labels":[],"label_agreement":null},{"id":"W2782981617","doi":"10.1103/physreve.97.051302","title":"Linear-time general decoding algorithm for the surface code","year":2018,"lang":"en","type":"article","venue":"Physical review. E","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut quantique; Université de Sherbrooke; Canadian Institute for Advanced Research","funders":"Army Research Office","keywords":"Decoding methods; Noise (video); Code (set theory); Matching (statistics); Encoding (memory); Error detection and correction; Channel (broadcasting)","score_opus":0.01975307886839489,"score_gpt":0.3284769266790381,"score_spread":0.3087238478106432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782981617","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009586074,0.0029675497,0.9816488,0.004664168,0.00037521197,0.0004206914,0.000010913104,0.00015480154,0.00017179133],"genre_scores_gemma":[0.022788081,0.0012010664,0.96316785,0.006136801,0.0059167347,0.000048005666,0.000007736961,0.000047660564,0.00068603817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873567,0.000073899064,0.00019776115,0.0003951574,0.00023512742,0.00036237878],"domain_scores_gemma":[0.99857914,0.0005214364,0.000094067516,0.0005865952,0.0001267544,0.000092002236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004247312,0.00017410099,0.0002924835,0.000011668291,0.0003343128,0.00008155315,0.0010330367,0.000020090834,0.0000078197245],"category_scores_gemma":[0.00009336438,0.000104978106,0.00021535787,0.0003131397,0.000092128525,0.00009456525,0.000300469,0.0001601902,0.00021374428],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011768651,0.000056210945,0.0000031356628,0.000057802565,0.000027260654,0.0000014895464,0.00011581331,0.0004977813,0.0008976268,0.004593975,0.008902942,0.9848448],"study_design_scores_gemma":[0.00010225121,0.00010108716,0.000030477888,0.00014963353,0.00001857266,0.000007023553,4.0326918e-7,0.92863643,0.0015360252,0.0043007215,0.06496984,0.00014751169],"about_ca_topic_score_codex":0.0000068156164,"about_ca_topic_score_gemma":6.579131e-7,"teacher_disagreement_score":0.9846973,"about_ca_system_score_codex":0.000014933168,"about_ca_system_score_gemma":0.00004006363,"threshold_uncertainty_score":0.42808828},"labels":[],"label_agreement":null},{"id":"W2783493337","doi":"10.22331/q-2019-09-30-189","title":"The complexity of simulating local measurements on quantum systems","year":2019,"lang":"lv","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Virginia Commonwealth University; National Science Foundation","keywords":"Observable; Hamiltonian (control theory); Quantum; Ground state; Upper and lower bounds; Turing machine; Task (project management); Quantum complexity theory; Computation","score_opus":0.06632970810345318,"score_gpt":0.2773005256368572,"score_spread":0.21097081753340402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783493337","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84244794,0.0029054899,0.13470289,0.0019956527,0.014253985,0.0015310717,0.000045381395,0.00027650344,0.0018410918],"genre_scores_gemma":[0.9987391,0.00001846611,0.00048085526,0.00013508223,0.00033576073,0.000006187376,0.0000045026172,0.000050189934,0.0002298094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940533,0.0008302768,0.0012129509,0.0010018284,0.0017872873,0.0011143758],"domain_scores_gemma":[0.99542713,0.0011527123,0.0008924848,0.0019093334,0.00038711837,0.00023121679],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023141066,0.0005798827,0.00081864215,0.00015306346,0.00081814616,0.00048738098,0.0022367148,0.0002078124,0.000016523121],"category_scores_gemma":[0.00016586731,0.00040753259,0.00034346312,0.000712126,0.00079491077,0.0001597269,0.0006583025,0.00084832916,0.00045738474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015217355,0.00041459876,0.0017161288,0.0005332895,0.00025519778,0.000020348623,0.0016880566,0.45520166,0.00081159995,0.50712365,0.0006866376,0.03139665],"study_design_scores_gemma":[0.0008079342,0.0010957987,0.0023149103,0.0009841269,0.000024127512,0.000018159906,0.00034440993,0.9841233,0.00031847294,0.007099355,0.0023935768,0.00047583037],"about_ca_topic_score_codex":0.00054930244,"about_ca_topic_score_gemma":0.0000126828145,"teacher_disagreement_score":0.52892166,"about_ca_system_score_codex":0.00013935797,"about_ca_system_score_gemma":0.00024852582,"threshold_uncertainty_score":0.99983764},"labels":[],"label_agreement":null},{"id":"W2784023939","doi":"10.22331/q-2018-08-22-85","title":"Real Randomized Benchmarking","year":2018,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Australian Research Council; Army Research Office; Natural Sciences and Engineering Research Council of Canada; Industry Canada; Bundesministerium für Bildung und Forschung; Elitenetzwerk Bayern; University of Sydney; Government of Canada; Deutsche Forschungsgemeinschaft; Canadian Institute for Advanced Research; Deutscher Akademischer Austauschdienst; Canada First Research Excellence Fund; Government of Ontario","keywords":"Benchmarking; Computation; Group (periodic table); Protocol (science); Word error rate; Error detection and correction","score_opus":0.00935931314201262,"score_gpt":0.2472905738837169,"score_spread":0.23793126074170426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784023939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2568288,0.00010897229,0.7282437,0.0011307407,0.0023133468,0.00020460102,8.241524e-7,0.0005517349,0.010617273],"genre_scores_gemma":[0.9392377,0.000042015286,0.059031904,0.00031788,0.00121827,0.000007902002,0.0000014461206,0.000012069819,0.00013079915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859107,0.00016896806,0.00025125776,0.0003876828,0.00024512847,0.00035587754],"domain_scores_gemma":[0.9989494,0.00027000275,0.00009877204,0.00051029853,0.000077242476,0.000094296665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079179154,0.00014725034,0.00030150102,0.00009850102,0.00025404853,0.00015357419,0.0007308547,0.000052150506,0.000033271386],"category_scores_gemma":[0.00006735824,0.00011242925,0.00013312395,0.00031741607,0.0001947509,0.00012969125,0.00026750137,0.0001438231,0.00014446961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084397127,0.00006715019,0.00007596033,0.000014467401,0.000058679296,0.000047243222,0.0034835716,0.00009750046,0.00077671005,0.86681825,0.004558301,0.123158194],"study_design_scores_gemma":[0.009591542,0.000111344285,0.00021281157,0.000025989253,0.000005032108,0.000026327903,0.00000475734,0.9522158,0.00035735645,0.033052824,0.004218001,0.0001782385],"about_ca_topic_score_codex":0.00009342343,"about_ca_topic_score_gemma":0.0000033715833,"teacher_disagreement_score":0.9521183,"about_ca_system_score_codex":0.000014551396,"about_ca_system_score_gemma":0.000049460246,"threshold_uncertainty_score":0.45847318},"labels":[],"label_agreement":null},{"id":"W2784176761","doi":"10.1038/s41534-018-0095-x","title":"16-qubit IBM universal quantum computer can be fully entangled","year":2018,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"National Safety Academic Fund; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"IBM; Quantum computer; Qubit; State (computer science); One-way quantum computer; Quantum; Cluster state; Graph","score_opus":0.008504098342242656,"score_gpt":0.214183029809643,"score_spread":0.20567893146740032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784176761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2479431,0.000014756012,0.74273455,0.0038535185,0.0022167233,0.00029160705,0.00001885341,0.0006788987,0.0022479568],"genre_scores_gemma":[0.97713304,0.000008629349,0.018807277,0.003188173,0.0006874876,0.0000071245177,0.00007964556,0.000016761624,0.00007185964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977288,0.000100172976,0.0005807362,0.00034980004,0.0006187972,0.0006216753],"domain_scores_gemma":[0.9982786,0.00009696575,0.00033545357,0.0007267389,0.00034967382,0.00021257148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042460614,0.0003250523,0.00028110205,0.00038295233,0.000522954,0.0005148471,0.0011580909,0.00015218956,0.000053899545],"category_scores_gemma":[0.000035444766,0.00029797584,0.00013382893,0.00073173165,0.00015374506,0.00179113,0.00045996258,0.00032484243,0.0003649032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014190693,0.00018330783,0.00044943683,0.000112375645,0.00012503107,0.000045408393,0.02409381,0.0032553093,0.0002871675,0.5469326,0.047576785,0.37679687],"study_design_scores_gemma":[0.0007396893,0.00052205607,0.001350749,0.000046590267,0.000009057235,0.00010514442,0.00014721569,0.90857124,0.00041207107,0.003073778,0.08462841,0.0003939907],"about_ca_topic_score_codex":0.00020247535,"about_ca_topic_score_gemma":0.000046778725,"teacher_disagreement_score":0.90531594,"about_ca_system_score_codex":0.00017867531,"about_ca_system_score_gemma":0.0001911443,"threshold_uncertainty_score":0.99994725},"labels":[],"label_agreement":null},{"id":"W2784671887","doi":"10.1038/d41586-017-07438-8","title":"Large quantum systems tamed","year":2017,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum; Computer science; Physics; Quantum mechanics","score_opus":0.008406333529666686,"score_gpt":0.2618584437100212,"score_spread":0.2534521101803545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784671887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.413386,0.007820339,0.514989,0.022708822,0.024614107,0.0007110767,0.000052590985,0.001682718,0.014035296],"genre_scores_gemma":[0.9945137,0.0000073766005,0.0039033939,0.0005407801,0.00050167163,0.0000038913777,0.0000019416016,0.00001035692,0.000516883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987635,0.000041926985,0.00012687717,0.00038091504,0.0003159617,0.00037082867],"domain_scores_gemma":[0.99821234,0.000046147135,0.00015460723,0.0014114646,0.00007465159,0.00010077916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003217149,0.0001443689,0.00017150429,0.00005619089,0.0007889751,0.0008162667,0.0022353115,0.00058943935,0.000003404722],"category_scores_gemma":[0.00013644004,0.00011143549,0.00007491051,0.00008203788,0.000033419674,0.00024720273,0.0005479098,0.001779028,0.000056424138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071771037,0.00013366618,0.0014198521,0.000077771445,0.000054135897,0.00028696205,0.0010827031,0.00073032215,0.0004431733,0.92945415,0.0390441,0.027265958],"study_design_scores_gemma":[0.0003730319,0.00004141507,0.010378469,0.000065411965,0.0000033085614,0.000059771402,0.000015047582,0.8442495,0.00012491511,0.004222254,0.14023027,0.00023664808],"about_ca_topic_score_codex":0.00001791706,"about_ca_topic_score_gemma":0.0000036996023,"teacher_disagreement_score":0.92523193,"about_ca_system_score_codex":0.000014974476,"about_ca_system_score_gemma":0.00004131611,"threshold_uncertainty_score":0.78712785},"labels":[],"label_agreement":null},{"id":"W2786313382","doi":"10.48550/arxiv.1801.09654","title":"Quantum Fractional Revival on Graphs","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Waterloo; York University","funders":"","keywords":"Vertex (graph theory); Quantum walk; Superposition principle; Quantum; Quantum entanglement; Mathematics; Physics; Quantum mechanics; Combinatorics; Quantum algorithm; Graph","score_opus":0.04766385670360419,"score_gpt":0.19767890905149432,"score_spread":0.15001505234789014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786313382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4626971,0.00004749849,0.53040355,0.00041456736,0.0028480317,0.00021511961,0.000019116134,0.0005361526,0.0028188794],"genre_scores_gemma":[0.9953609,0.00006075882,0.0032495128,0.00032740625,0.0004146139,5.153141e-7,0.0000131557435,0.00002156834,0.0005515778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997596,0.00017490378,0.00020489011,0.0014159371,0.00018508792,0.00042313267],"domain_scores_gemma":[0.99777323,0.00017829194,0.0002736098,0.0014111474,0.00016598338,0.00019771053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028658615,0.00038851038,0.00033950454,0.0003578999,0.0003291009,0.00016713525,0.0021089846,0.00028916443,0.000045978253],"category_scores_gemma":[0.00004116691,0.00040370386,0.0003376246,0.0005777263,0.0001571553,0.0001569996,0.0017794756,0.0010477239,0.00031207677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003505697,0.00016079354,0.00041323795,0.000053663658,0.000105963976,0.00035419787,0.00012690898,0.36772805,0.000009548115,0.6253403,0.0037805361,0.0018917457],"study_design_scores_gemma":[0.00020451027,0.00013176125,0.0011611506,0.00014494236,0.000018943783,0.00001134579,0.0000053664953,0.77181745,0.000027004406,0.22332208,0.00276778,0.0003876672],"about_ca_topic_score_codex":0.000055287583,"about_ca_topic_score_gemma":0.0000039272454,"teacher_disagreement_score":0.5326638,"about_ca_system_score_codex":0.00010929226,"about_ca_system_score_gemma":0.00018929083,"threshold_uncertainty_score":0.9998415},"labels":[],"label_agreement":null},{"id":"W2786939119","doi":"10.26421/qic19.7-8-1","title":"Switching and partially switching the hypercube while maintaining perfect state transfer","year":2019,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Qubit; Graph; Quantum; Vertex (graph theory); Mathematics; Combinatorics; Topology (electrical circuits); Discrete mathematics; Computer science; Physics; Quantum mechanics","score_opus":0.013188841467654203,"score_gpt":0.23567057269106834,"score_spread":0.22248173122341414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786939119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42522302,0.00016572785,0.5726458,0.0008870473,0.0004925839,0.00032692982,0.0000045616225,0.00016637264,0.00008798237],"genre_scores_gemma":[0.99244344,0.00012247878,0.0063248985,0.0009448213,0.00008675302,0.000017284972,0.000041599367,0.000015300548,0.0000034501577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979584,0.00020214872,0.0006621563,0.00040780715,0.00041753214,0.00035191368],"domain_scores_gemma":[0.99884665,0.00029421094,0.00026020024,0.00036300306,0.00013033478,0.000105616295],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010622338,0.00036292901,0.00034114494,0.00022993145,0.00053428,0.001524255,0.00047383134,0.00014662513,0.0000016802072],"category_scores_gemma":[0.00003201443,0.00027410645,0.00009225608,0.00018835955,0.000035486206,0.0010280639,0.00066640746,0.0009036117,0.000017498573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013429315,0.0000106451225,0.00011247719,0.00018519069,0.00003739835,0.0000019115375,0.021789333,0.44093016,0.00004960066,0.010240375,0.000033658067,0.52659583],"study_design_scores_gemma":[0.0003828129,0.000101099315,0.0050844457,0.0002021062,0.000017530843,0.00006345337,0.00035542357,0.9793333,0.000024620267,0.013569021,0.0005081681,0.0003580321],"about_ca_topic_score_codex":0.0001058721,"about_ca_topic_score_gemma":0.000007734248,"teacher_disagreement_score":0.5672204,"about_ca_system_score_codex":0.000038804214,"about_ca_system_score_gemma":0.00016268111,"threshold_uncertainty_score":0.9999711},"labels":[],"label_agreement":null},{"id":"W2789161290","doi":"10.1088/2058-9565/aad1f7","title":"Deep neural decoders for near term fault-tolerant experiments","year":2018,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Perimeter Institute; University of Waterloo","funders":"Ontario Ministry of Research, Innovation and Science; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Artificial neural network; Noise (video); Deep learning; Code (set theory); Encoding (memory); Deep neural networks; Term (time)","score_opus":0.012836766705657636,"score_gpt":0.2778231316242657,"score_spread":0.26498636491860805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789161290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72546214,0.00021789627,0.26979825,0.0031885135,0.000670253,0.00021660821,9.2029785e-7,0.00038019413,0.000065218526],"genre_scores_gemma":[0.92766654,0.0000041883636,0.07176941,0.00044656586,0.00007105339,0.000024273853,3.5782756e-7,0.000008486049,0.000009131105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980044,0.000013423669,0.00020926964,0.0007727077,0.0003054212,0.0006948266],"domain_scores_gemma":[0.9988708,0.00005027885,0.00008751029,0.00059082545,0.00027617687,0.00012440229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004150474,0.00017872984,0.00019355054,0.0003747082,0.001176585,0.00031506098,0.0015943847,0.00010369349,0.0000029341772],"category_scores_gemma":[0.00013003992,0.00014540524,0.000033518907,0.001401745,0.0022755878,0.00034119777,0.0005922837,0.00015234006,0.00001327538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017713493,0.00012337479,0.0010865577,0.000019847223,0.000016446234,0.000025759231,0.0026133172,0.00011076135,0.044406325,0.15858263,0.00023106406,0.7927662],"study_design_scores_gemma":[0.00033190608,0.0006014625,0.00034338245,0.000011189876,0.000002532088,0.000098603385,0.00009210463,0.96762353,0.0143563505,0.0147027075,0.001632882,0.00020333305],"about_ca_topic_score_codex":0.000009938682,"about_ca_topic_score_gemma":0.0000050000226,"teacher_disagreement_score":0.9675128,"about_ca_system_score_codex":0.00002728789,"about_ca_system_score_gemma":0.00013177171,"threshold_uncertainty_score":0.90494597},"labels":[],"label_agreement":null},{"id":"W2791230469","doi":"10.22323/1.020.0254","title":"Classical simulation of quantum lambda phi^4","year":2005,"lang":"en","type":"article","venue":"Proceedings of XXIIIrd International Symposium on Lattice Field Theory — PoS(LAT2005)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Lambda; Quantum; Computer science; Physics; Quantum mechanics","score_opus":0.008967489440551098,"score_gpt":0.25918242124656643,"score_spread":0.25021493180601534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791230469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81303895,0.0001326985,0.11261857,0.025670229,0.0015849838,0.00044823004,0.00001935893,0.00037383253,0.04611316],"genre_scores_gemma":[0.98712593,0.000018830035,0.010985038,0.0008767991,0.00056488963,0.0000067575397,0.0000027669141,0.000021688045,0.00039731746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771106,0.000029911755,0.00066898967,0.0005177391,0.0007273894,0.00034488662],"domain_scores_gemma":[0.9977421,0.0009099239,0.0004948504,0.00023959648,0.0004946307,0.0001188952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069290685,0.00027095596,0.00033159603,0.00022814704,0.00009994906,0.000113803275,0.0013215163,0.00017683205,0.00006512685],"category_scores_gemma":[0.0003017764,0.000244612,0.00020161994,0.00027769146,0.00009601142,0.00058678066,0.00031500903,0.000396428,0.000028839473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025974936,0.0005039661,0.00036875013,0.000071452116,0.000103748884,0.0000022946801,0.0011275751,0.028308155,0.011012675,0.9276255,0.00045832,0.030157844],"study_design_scores_gemma":[0.00077006273,0.0006035032,0.0005264721,0.00026799677,0.000025568663,0.000020434698,0.000050628016,0.92100495,0.03305264,0.03852678,0.004830464,0.00032047936],"about_ca_topic_score_codex":0.0000073156702,"about_ca_topic_score_gemma":7.329929e-7,"teacher_disagreement_score":0.8926968,"about_ca_system_score_codex":0.00006271108,"about_ca_system_score_gemma":0.00003748046,"threshold_uncertainty_score":0.99749875},"labels":[],"label_agreement":null},{"id":"W2791684480","doi":"10.1007/s42484-019-00002-9","title":"Batched quantum state exponentiation and quantum Hebbian learning","year":2019,"lang":"en","type":"article","venue":"Quantum Machine Intelligence","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Quantum machine learning; Hebbian theory; Quantum algorithm; Qubit; Learning with errors; Quantum; Unsupervised learning; Quantum network","score_opus":0.008382028643179088,"score_gpt":0.23715822955508054,"score_spread":0.22877620091190146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791684480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4898573,0.0006922013,0.5070303,0.000799006,0.00083246327,0.0002581834,0.000004101734,0.00040658916,0.00011984218],"genre_scores_gemma":[0.9929204,0.00022362541,0.0061007193,0.0002666805,0.000099882156,0.00001163562,0.00001550376,0.00004906935,0.00031247013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962985,0.0003321133,0.000720747,0.0011850479,0.0006362026,0.0008273831],"domain_scores_gemma":[0.9978552,0.0004618871,0.00036894582,0.0008853143,0.00014527635,0.0002833977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009951274,0.0005026568,0.0005105314,0.0003352759,0.0003788687,0.0004871385,0.0012311463,0.00012701585,0.000076757795],"category_scores_gemma":[0.00017213574,0.00045492177,0.00015431074,0.0007448768,0.000114340524,0.00060641556,0.0007032728,0.00091316353,0.00044561035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013779949,0.00042427515,0.025591064,0.00039902286,0.0001807864,0.00017051803,0.012160652,0.12213455,0.013257481,0.34710518,0.00024375498,0.47819492],"study_design_scores_gemma":[0.0002070309,0.00047336024,0.0038069168,0.00009892064,0.000007537412,0.00009523805,0.00013617246,0.95644546,0.001961311,0.03455607,0.0016259286,0.0005860897],"about_ca_topic_score_codex":0.00041774442,"about_ca_topic_score_gemma":0.00001945115,"teacher_disagreement_score":0.8343109,"about_ca_system_score_codex":0.000053019096,"about_ca_system_score_gemma":0.00009178091,"threshold_uncertainty_score":0.99979025},"labels":[],"label_agreement":null},{"id":"W2792255093","doi":"10.1080/00107514.2018.1450720","title":"A cross-disciplinary introduction to quantum annealing-based algorithms","year":2018,"lang":"en","type":"article","venue":"Contemporary Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Quantum computer; Quantum annealing; Quantum algorithm; Quantum; Quantum information; Quantum technology; Quantum gate; Computation","score_opus":0.0305192134187351,"score_gpt":0.2992487189008072,"score_spread":0.2687295054820721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792255093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09133234,0.00012687521,0.898704,0.006106429,0.0023382525,0.00027894048,0.000012557645,0.0005957353,0.00050489703],"genre_scores_gemma":[0.93740946,4.9993474e-7,0.053476002,0.0012238205,0.007636082,0.000018622955,0.000022298333,0.000033501627,0.00017972119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978652,0.00009409752,0.00034660404,0.0008878028,0.0003681813,0.00043808843],"domain_scores_gemma":[0.9981503,0.00007501084,0.00014786246,0.0010979208,0.00029755256,0.00023134044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003863685,0.00028826055,0.00027883286,0.00011474239,0.0004908086,0.00034806563,0.0010518692,0.00007599205,0.000008349567],"category_scores_gemma":[0.000038369988,0.00026756604,0.00013184702,0.00094067556,0.00019004579,0.00048377932,0.00048099403,0.0002523641,0.00020883525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004353062,0.0016015241,0.00628677,0.00028300605,0.00023338503,0.0002791728,0.011649052,0.10358196,0.010190085,0.08036337,0.13696264,0.64813375],"study_design_scores_gemma":[0.0004578182,0.0007307207,0.0014565339,0.00006367236,0.000003047146,0.000008921585,0.000012501646,0.9670076,0.0058564343,0.0070803654,0.016904108,0.00041830924],"about_ca_topic_score_codex":0.000020424222,"about_ca_topic_score_gemma":9.493068e-7,"teacher_disagreement_score":0.8634256,"about_ca_system_score_codex":0.000040639665,"about_ca_system_score_gemma":0.00023240565,"threshold_uncertainty_score":0.99997765},"labels":[],"label_agreement":null},{"id":"W2792585849","doi":"10.4204/eptcs.266.11","title":"A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)","year":2018,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; U.S. Air Force","keywords":"Morphism; Categorical variable; Categorical quantum mechanics; Programming language specification; Object language; State (computer science); Quantum circuit; Type (biology); Quantum","score_opus":0.011447697198179323,"score_gpt":0.254595512339921,"score_spread":0.2431478151417417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792585849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18100841,0.000049191338,0.81695217,0.0005926584,0.00029416798,0.00033296464,8.2224665e-7,0.00027448,0.00049515284],"genre_scores_gemma":[0.92168677,0.0000030818671,0.07744589,0.0004272622,0.0003697,0.000038230064,7.0932816e-7,0.000018110322,0.000010232742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960315,0.0000151315535,0.0004236535,0.001243044,0.00066194776,0.0016246776],"domain_scores_gemma":[0.99875873,0.00012253798,0.00012638765,0.00038696916,0.00036341863,0.00024197262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002211447,0.00029913703,0.00029985688,0.00040323613,0.00052177464,0.0006687852,0.002676327,0.000112167814,0.0000054440725],"category_scores_gemma":[0.00020389736,0.00025792076,0.0001018522,0.0016412082,0.00144901,0.0007844164,0.00060911436,0.0005446454,0.000015402467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020030262,0.00009760955,0.000009214514,0.000015492691,0.0000037073403,0.0000032119779,0.0030285702,0.0002879243,0.004586621,0.95974827,0.0000476385,0.03215174],"study_design_scores_gemma":[0.0002641589,0.00038322047,0.00015563137,0.000020681295,0.0000023554721,0.00005522589,0.0000105217605,0.5831244,0.0020356497,0.41372284,0.000020464699,0.00020488225],"about_ca_topic_score_codex":0.0000055249934,"about_ca_topic_score_gemma":0.0000030934154,"teacher_disagreement_score":0.74067837,"about_ca_system_score_codex":0.0003338396,"about_ca_system_score_gemma":0.00047767122,"threshold_uncertainty_score":0.9999873},"labels":[],"label_agreement":null},{"id":"W2792946961","doi":"10.1103/physrevlett.122.040504","title":"Quantum Machine Learning in Feature Hilbert Spaces","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1653,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Hilbert space; Kernel (algebra); Computer science; Quantum computer; Reproducing kernel Hilbert space; Quantum machine learning; Quantum state; Feature vector; Kernel method; Feature (linguistics); Quantum algorithm; Quantum information; POVM; Support vector machine; Quantum process; Algorithm; Quantum; Theoretical computer science; Artificial intelligence; Quantum operation; Open quantum system; Mathematics; Quantum mechanics; Physics; Quantum dynamics; Pure mathematics","score_opus":0.007675978581280417,"score_gpt":0.250474971303738,"score_spread":0.2427989927224576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792946961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8115247,0.024669398,0.012576054,0.14922929,0.0005651319,0.0006524614,0.0000015795175,0.00037394906,0.0004074493],"genre_scores_gemma":[0.96501845,0.0009898421,0.005728837,0.027862817,0.00024150505,0.000013847963,0.0000069568155,0.000025870462,0.00011189831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985962,0.00016287678,0.00015463245,0.000454427,0.00028358662,0.0003482823],"domain_scores_gemma":[0.99922293,0.00018181666,0.0000930399,0.0004142022,0.000014168961,0.00007382145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023345521,0.00019960872,0.00040660647,0.000059379017,0.00004827885,0.000078055484,0.0006593584,0.000012093434,0.000007672074],"category_scores_gemma":[0.00004320097,0.00014993349,0.00015375786,0.00052049954,0.00002282556,0.00016025997,0.00023276666,0.0006290334,0.00022891087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036788202,0.0011576709,0.038089298,0.008648365,0.00020836073,0.000527252,0.00508514,0.1159629,0.044264745,0.1491028,0.035485204,0.6014315],"study_design_scores_gemma":[0.00021141113,0.00007122671,0.0026654084,0.0015724517,0.0000063641896,0.000014512095,0.0000014514512,0.948596,0.00006418914,0.00060843874,0.045890767,0.00029776656],"about_ca_topic_score_codex":0.00003077425,"about_ca_topic_score_gemma":0.0000017623317,"teacher_disagreement_score":0.83263314,"about_ca_system_score_codex":0.000024787842,"about_ca_system_score_gemma":0.000016370206,"threshold_uncertainty_score":0.61141104},"labels":[],"label_agreement":null},{"id":"W2793920262","doi":"10.1038/s41567-018-0061-8","title":"Enter the machine","year":2018,"lang":"en","type":"article","venue":"Nature Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Physics; Quantum; Quantum tomography; Tomography; Quantum state; Theoretical physics; Statistical physics; Quantum mechanics; Optics","score_opus":0.005108843495230061,"score_gpt":0.239475502000982,"score_spread":0.23436665850575195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793920262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024558313,0.00056305376,0.95452374,0.010651806,0.002441289,0.00013717817,0.000004597587,0.00033766998,0.006782327],"genre_scores_gemma":[0.9778224,0.0000016818977,0.01658299,0.0037533352,0.0016790852,0.0000014922177,0.0000012155226,0.0000071183563,0.00015064518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930453,0.000033534918,0.00006689505,0.00021424066,0.00019621593,0.00018460653],"domain_scores_gemma":[0.99928766,0.000059331003,0.00003755382,0.00051919883,0.000063936895,0.00003229539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010222341,0.00009743463,0.00007017072,0.000012739638,0.00021332926,0.00010233616,0.0009291212,0.000060919792,0.000004553612],"category_scores_gemma":[0.000011743342,0.000054037384,0.000057508478,0.0002859859,0.00007015618,0.00007904657,0.00028205654,0.0005291426,0.00007171408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054979164,0.00008659959,0.00021280583,0.000007337251,0.000039537987,0.000009218773,0.0022471345,0.00023971235,0.00067298685,0.308824,0.019123053,0.66853213],"study_design_scores_gemma":[0.00019729482,0.00009977733,0.0013071649,0.000015948122,0.000005142432,0.000023301849,0.0000034073782,0.8031826,0.005093166,0.07024208,0.11964163,0.00018849738],"about_ca_topic_score_codex":0.0000043157424,"about_ca_topic_score_gemma":0.0000020713808,"teacher_disagreement_score":0.9532641,"about_ca_system_score_codex":0.0000068793324,"about_ca_system_score_gemma":0.000017075423,"threshold_uncertainty_score":0.22988908},"labels":[],"label_agreement":null},{"id":"W2794488470","doi":"10.1103/physreva.97.032344","title":"Quantum speedup in solving the maximal-clique problem","year":2018,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Clique; Clique graph; Clique problem; Combinatorics; Quantum walk; Quantum computer; Speedup; Quantum algorithm; Mathematics; Quantum; Graph; Discrete mathematics; Algorithm; Computer science; Quantum mechanics; Physics; Graph power; Line graph; Pathwidth","score_opus":0.015492048704956959,"score_gpt":0.3347248867868579,"score_spread":0.31923283808190095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794488470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4151363,0.25791514,0.1929547,0.10611331,0.001608411,0.010367793,0.000026474363,0.0014817433,0.014396116],"genre_scores_gemma":[0.92781067,0.045854896,0.007678326,0.015707178,0.0024802242,0.00030771177,0.0000074421187,0.00008491362,0.00006865112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954184,0.00071488286,0.0008306291,0.0011631311,0.0008722524,0.0010007031],"domain_scores_gemma":[0.99664396,0.0007318497,0.00040771833,0.0017055938,0.00022747907,0.00028340198],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013201404,0.0006044946,0.001422783,0.00006736573,0.00029574428,0.00016436559,0.0025448215,0.00004448928,0.000017302],"category_scores_gemma":[0.00063729525,0.0003662742,0.00072072836,0.0019695796,0.00034516066,0.00036487047,0.0010297449,0.0010497796,0.0008562881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001594327,0.002025537,0.00018186738,0.010285597,0.000105371684,0.00009075149,0.0013791008,0.00007153579,0.0070687165,0.3573934,0.015241006,0.60614115],"study_design_scores_gemma":[0.00043341963,0.00078494666,0.0014828129,0.034680646,0.00015506885,0.000076494,0.0000061356077,0.53940684,0.0025281913,0.3197842,0.09933593,0.0013253277],"about_ca_topic_score_codex":0.000049164464,"about_ca_topic_score_gemma":0.000009696762,"teacher_disagreement_score":0.60481584,"about_ca_system_score_codex":0.000077885554,"about_ca_system_score_gemma":0.00016208788,"threshold_uncertainty_score":0.9999217},"labels":[],"label_agreement":null},{"id":"W2794528644","doi":"10.1103/physreva.98.012322","title":"Quantum approximate optimization with Gaussian boson sampling","year":2018,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Simulated annealing; Gaussian; Stochastic optimization; Mathematical optimization; Sampling (signal processing); Quantum annealing; Random search; Computer science; Optimization problem; Algorithm; Boson; Quantum; Mathematics; Quantum computer; Quantum mechanics; Physics","score_opus":0.01862470465657641,"score_gpt":0.3332802181643583,"score_spread":0.3146555135077819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794528644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026798928,0.019472284,0.94667447,0.0040355413,0.0002065973,0.0012342273,0.0000076143206,0.00047151078,0.0010988513],"genre_scores_gemma":[0.7616006,0.048450913,0.17524919,0.010245969,0.0038004117,0.00035839493,0.00006312347,0.000189088,0.000042303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961229,0.0003277823,0.00059662096,0.0012068627,0.00092304056,0.00082278566],"domain_scores_gemma":[0.99706787,0.0002841889,0.00045593115,0.0014943851,0.00030272573,0.0003949228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053006585,0.0006161037,0.0013632578,0.000064332264,0.00034919108,0.00017780301,0.0014113723,0.00003947747,0.000015695965],"category_scores_gemma":[0.00025414798,0.0004093564,0.000460008,0.0016172423,0.00024637298,0.0004485472,0.00046670626,0.000555504,0.0002935049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000620772,0.0040429276,0.00012325132,0.026240218,0.0003614206,0.00007981166,0.0010789393,0.007945703,0.0068705813,0.39280438,0.0055942647,0.55479646],"study_design_scores_gemma":[0.00025466236,0.00066789263,0.00008254103,0.016119264,0.00015917885,0.00003459677,0.000002245081,0.95426184,0.0016014641,0.015700782,0.010386589,0.00072893756],"about_ca_topic_score_codex":0.00001165233,"about_ca_topic_score_gemma":8.9307724e-7,"teacher_disagreement_score":0.9463161,"about_ca_system_score_codex":0.000056457106,"about_ca_system_score_gemma":0.00011480248,"threshold_uncertainty_score":0.99983585},"labels":[],"label_agreement":null},{"id":"W2795230922","doi":"10.1103/physrevlett.121.030503","title":"Using Gaussian Boson Sampling to Find Dense Subgraphs","year":2018,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Boson; Gaussian; Statistical physics; Physics; Sampling (signal processing); Gaussian random field; Particle physics; Gaussian process; Quantum mechanics; Optics","score_opus":0.04040761973394579,"score_gpt":0.3299056448010207,"score_spread":0.2894980250670749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795230922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57898813,0.0006324326,0.4098162,0.00999772,0.0002383171,0.00018093885,9.731091e-7,0.000099712866,0.00004556544],"genre_scores_gemma":[0.7529065,0.00008445409,0.1903849,0.055302143,0.0012814425,0.000009113869,9.788702e-7,0.000025761568,0.0000047328454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849004,0.00008985267,0.00020384252,0.0004960604,0.00029613468,0.0004240851],"domain_scores_gemma":[0.9989875,0.00009883834,0.00007598323,0.000605132,0.000042829455,0.00018971889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022189948,0.00019670252,0.0003123954,0.00006807932,0.00019558784,0.00011102831,0.0007008074,0.000009036043,0.000004955915],"category_scores_gemma":[0.00005751607,0.00015854038,0.00016751584,0.0007129004,0.000063449676,0.00011842476,0.00027474886,0.00018192717,0.00014122142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017107437,0.00031496046,0.00085112645,0.001526942,0.00014065333,0.00011101483,0.004138734,0.007981273,0.3778588,0.014613755,0.014302944,0.5781427],"study_design_scores_gemma":[0.00032442328,0.00033655716,0.007232074,0.0059838956,0.00008001697,0.00009686709,0.00000401295,0.942059,0.004143905,0.0034019095,0.03502258,0.0013148079],"about_ca_topic_score_codex":0.000020073638,"about_ca_topic_score_gemma":8.127608e-7,"teacher_disagreement_score":0.9340777,"about_ca_system_score_codex":0.00002720245,"about_ca_system_score_gemma":0.000021889779,"threshold_uncertainty_score":0.6465089},"labels":[],"label_agreement":null},{"id":"W2796615720","doi":"10.22331/q-2019-03-11-129","title":"Strawberry Fields: A Software Platform for Photonic Quantum Computing","year":2019,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":314,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Computer science; Quantum computer; Quantum; Compiler; Quantum machine learning; Quantum circuit; Computational science; Quantum simulator; Python (programming language); Software; Gaussian; Quantum algorithm; Theoretical computer science; Programming language; Computer engineering; Quantum network; Quantum mechanics; Physics","score_opus":0.014501153148931988,"score_gpt":0.24921684659530882,"score_spread":0.23471569344637683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796615720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45778272,0.00017429917,0.539033,0.00039240046,0.0015082908,0.00045166077,0.000008991236,0.00048170355,0.00016690638],"genre_scores_gemma":[0.91432,0.00000583184,0.0845116,0.00066589337,0.00024333235,0.000013715383,0.000012323263,0.000036716574,0.00019056546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750394,0.000037193207,0.00045185228,0.0008064045,0.00036805976,0.0008325288],"domain_scores_gemma":[0.99798524,0.0006206249,0.00020945858,0.0009094497,0.00011025458,0.00016498985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047297997,0.00033862624,0.00042255994,0.00016001525,0.000312117,0.00027078597,0.0013633291,0.00017485948,0.00003037536],"category_scores_gemma":[0.0000839115,0.00030209357,0.00027126374,0.0003713729,0.000042502186,0.0003069818,0.0004021266,0.00042411446,0.00016598786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013971115,0.0005975693,0.0023323568,0.0010239842,0.00030032385,0.00012901641,0.0066823377,0.041070968,0.002744995,0.5164451,0.008432067,0.42010158],"study_design_scores_gemma":[0.00075647596,0.0004643713,0.0005323368,0.00012345532,0.000007729856,0.00006684739,0.00006738364,0.9619267,0.0005760847,0.029282115,0.0057459003,0.00045057494],"about_ca_topic_score_codex":0.000047012636,"about_ca_topic_score_gemma":0.0000063422117,"teacher_disagreement_score":0.92085576,"about_ca_system_score_codex":0.000047650683,"about_ca_system_score_gemma":0.00015615388,"threshold_uncertainty_score":0.99994314},"labels":[],"label_agreement":null},{"id":"W2798745146","doi":"10.1103/physreva.98.022321","title":"Quantum computational finance: Monte Carlo pricing of financial derivatives","year":2018,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":274,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Computational finance; Quantum computer; Monte Carlo method; Finance; Computer science; Stochastic game; Benchmark (surveying); Speedup; Quantum algorithm; Valuation of options; Quantum; Quantum Monte Carlo; Mathematical optimization; Mathematics; Physics; Parallel computing; Mathematical economics; Quantum mechanics; Economics","score_opus":0.013433728093051598,"score_gpt":0.33039441105176126,"score_spread":0.31696068295870966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798745146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7102289,0.054097183,0.22995338,0.003225297,0.0004054116,0.0013270422,0.00002652549,0.00023004528,0.00050617196],"genre_scores_gemma":[0.9716897,0.0114945285,0.012769945,0.0029789447,0.00095084263,0.00006424488,0.0000060944462,0.00003132006,0.0000143907355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647164,0.00034460556,0.0007974388,0.00089377863,0.00089217833,0.00060034654],"domain_scores_gemma":[0.99718934,0.000620953,0.00061413494,0.00088732375,0.00050665194,0.00018160438],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047665543,0.00048877543,0.0015416609,0.00006478502,0.00023452593,0.00004707794,0.0013457871,0.00003774469,0.000006049242],"category_scores_gemma":[0.00089669344,0.00037510946,0.00067630655,0.0014992442,0.00037671105,0.00031979076,0.0005793096,0.00048355342,0.00012473119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029663937,0.002277009,0.0002343686,0.014111178,0.00013897289,0.000038234266,0.0018831091,0.0026304328,0.0064483276,0.35782176,0.011575786,0.60281116],"study_design_scores_gemma":[0.0003880711,0.0008687099,0.005112267,0.020931222,0.00012653456,0.000018826411,0.0000022209445,0.845984,0.0034569986,0.1058382,0.016457714,0.0008152255],"about_ca_topic_score_codex":0.00001957127,"about_ca_topic_score_gemma":0.0000011252897,"teacher_disagreement_score":0.84335357,"about_ca_system_score_codex":0.000044710247,"about_ca_system_score_gemma":0.00024267334,"threshold_uncertainty_score":0.99987006},"labels":[],"label_agreement":null},{"id":"W2798945316","doi":"10.1103/physrevlett.121.040502","title":"Quantum Generative Adversarial Learning","year":2018,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":573,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Discriminator; Generator (circuit theory); Computer science; Quantum; Generative grammar; Theoretical computer science; Probabilistic logic; Adversarial system; Set (abstract data type); Point (geometry); Artificial intelligence; Algorithm; Statistical physics; Mathematics; Quantum mechanics; Physics","score_opus":0.013504263198152197,"score_gpt":0.27786894914698684,"score_spread":0.26436468594883467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798945316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1866969,0.00201517,0.77619416,0.032755505,0.0010643933,0.00031848185,0.0000010849074,0.00042744787,0.0005268362],"genre_scores_gemma":[0.9263672,0.00035386032,0.024246171,0.045233987,0.0037312512,0.000017479368,0.0000037664547,0.000022828317,0.000023440656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986379,0.00019304977,0.00016682778,0.00041365356,0.00027415578,0.00031437265],"domain_scores_gemma":[0.99929386,0.00011639546,0.0000961379,0.00034698765,0.00005118363,0.000095420844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020247202,0.00017015067,0.00028002443,0.0000305348,0.00021719329,0.0000732091,0.0006062706,0.000007612112,0.000010424035],"category_scores_gemma":[0.000080308855,0.00013107853,0.00015475451,0.00035473812,0.000107848384,0.00015295728,0.00024051215,0.0002887377,0.00030621182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025948393,0.00052479614,0.00020455373,0.0010858458,0.0002909445,0.0001669431,0.007856466,0.012097156,0.09284803,0.14930786,0.08953306,0.6460584],"study_design_scores_gemma":[0.00016576298,0.0001810267,0.00016699177,0.000451608,0.000016170943,0.000010877123,0.000001747939,0.94399685,0.00066569145,0.0013048598,0.052761532,0.00027685787],"about_ca_topic_score_codex":0.0000074443265,"about_ca_topic_score_gemma":2.880422e-7,"teacher_disagreement_score":0.9318997,"about_ca_system_score_codex":0.000019987665,"about_ca_system_score_gemma":0.000023937602,"threshold_uncertainty_score":0.5345227},"labels":[],"label_agreement":null},{"id":"W2798967590","doi":"10.1103/physreva.98.012324","title":"Quantum generative adversarial networks","year":2018,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":503,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Generative grammar; Ansatz; Computer science; Quantum; Adversarial system; Discriminator; Theoretical computer science; Artificial intelligence; Domain (mathematical analysis); Quantum machine learning; Quantum computer; Mathematics; Quantum mechanics; Physics","score_opus":0.01383444576192066,"score_gpt":0.3331960477269604,"score_spread":0.3193616019650397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798967590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036583092,0.09963725,0.8460738,0.010039315,0.0018515375,0.0022466222,0.000016573624,0.0007290357,0.002822769],"genre_scores_gemma":[0.8712338,0.073992975,0.012372043,0.02691941,0.014962643,0.00026771164,0.00003816878,0.00011840033,0.00009483443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548066,0.00065388106,0.00070154027,0.0013131701,0.00089313666,0.0009576114],"domain_scores_gemma":[0.9966319,0.0005215821,0.00042322325,0.0015861132,0.0003551458,0.00048203632],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006416047,0.00067798427,0.0016462462,0.000050805204,0.00038021675,0.00013948728,0.0019609118,0.00005587967,0.000027311005],"category_scores_gemma":[0.0005459662,0.0004906104,0.0009447114,0.001501657,0.00033952112,0.00038569493,0.00088298286,0.00081385265,0.00086521514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029281386,0.0018014464,0.000034169658,0.0040060794,0.00028223995,0.000077249446,0.00062045804,0.00049624464,0.004569935,0.3466344,0.06292722,0.5785213],"study_design_scores_gemma":[0.00031260718,0.00064258056,0.00011818265,0.0072075343,0.00017488256,0.000020479474,0.0000011557238,0.86991817,0.0011916043,0.043689396,0.07593565,0.0007877854],"about_ca_topic_score_codex":0.000016808293,"about_ca_topic_score_gemma":0.0000019960871,"teacher_disagreement_score":0.8694219,"about_ca_system_score_codex":0.00006739876,"about_ca_system_score_gemma":0.0001422295,"threshold_uncertainty_score":0.99991274},"labels":[],"label_agreement":null},{"id":"W2799222224","doi":"10.1103/physreva.99.042314","title":"Simulating the dynamics of time-dependent Hamiltonians with a truncated Dyson series","year":2019,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Australian Research Council","keywords":"Superposition principle; Hamiltonian (control theory); Inverse; Logarithm; Series (stratigraphy); Quantum; Statistical physics; Time evolution; Operator (biology); Computer science; Applied mathematics; Mathematics; Physics; Mathematical optimization; Quantum mechanics; Mathematical analysis","score_opus":0.00556957313767223,"score_gpt":0.2811370013885541,"score_spread":0.2755674282508818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799222224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8207384,0.043492705,0.10654672,0.019785069,0.00031636332,0.0054555796,0.000055646724,0.0006580594,0.002951495],"genre_scores_gemma":[0.98392236,0.009666842,0.0030663789,0.0026375235,0.00026349913,0.00008261062,0.000022519002,0.000070432194,0.00026781487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966922,0.00041407687,0.00060476275,0.0007806287,0.0009526096,0.000555762],"domain_scores_gemma":[0.99682266,0.0006983154,0.00054665044,0.0015317799,0.00023606922,0.00016454696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005577561,0.0004940936,0.0014616486,0.00003536754,0.00015277875,0.000076577395,0.0015662517,0.000031835192,0.000013633702],"category_scores_gemma":[0.00023047507,0.0002722493,0.00051579904,0.0011577766,0.00016760494,0.00036675518,0.00052547886,0.00061131606,0.00029821607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010477355,0.003166455,0.000884329,0.036529917,0.0007401226,0.00007689068,0.0018675327,0.02346444,0.021907762,0.20100655,0.0012361959,0.7090151],"study_design_scores_gemma":[0.00028209676,0.000652937,0.0002510535,0.0124536725,0.00017759226,0.00003052753,0.0000054548723,0.97388905,0.0011466296,0.007986816,0.0026290333,0.0004951349],"about_ca_topic_score_codex":0.000024349023,"about_ca_topic_score_gemma":0.000003980757,"teacher_disagreement_score":0.9504246,"about_ca_system_score_codex":0.000063217965,"about_ca_system_score_gemma":0.00012302797,"threshold_uncertainty_score":0.999973},"labels":[],"label_agreement":null},{"id":"W2799662396","doi":"10.1109/tit.2019.2916646","title":"Optimal Universal Learning Machines for Quantum State Discrimination","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Qubit; Quantum; Quantum state; Limit (mathematics); Quantum information; Generality; State (computer science); Process (computing); Quantum algorithm","score_opus":0.005544976962360111,"score_gpt":0.2164692786406838,"score_spread":0.21092430167832368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799662396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07606035,0.0000037586387,0.92187834,0.00019927502,0.0008517807,0.00026491078,0.00001539941,0.00026627205,0.0004599086],"genre_scores_gemma":[0.98138386,0.0000040722525,0.017767817,0.00016602899,0.000019786658,0.000016537719,0.000010996318,0.000008733038,0.00062217156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991634,0.00007819869,0.00022709362,0.00014585885,0.00018557278,0.00019989278],"domain_scores_gemma":[0.9992761,0.00024792258,0.000120905475,0.00021073635,0.00009391462,0.00005044852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038999683,0.0001326776,0.000109752444,0.00026083112,0.00029118347,0.00015927381,0.0003023891,0.000045072262,0.000025773323],"category_scores_gemma":[0.000007775506,0.00011855795,0.00009829564,0.00020479107,0.000024856847,0.0013855783,0.0000035938672,0.00023066714,0.00013663468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056117475,0.000021318216,0.0000012909826,0.000029111296,0.00001456126,1.7514017e-7,0.0033649828,0.7437097,0.00008182169,0.03423562,0.000017965172,0.21846737],"study_design_scores_gemma":[0.0005517747,0.00025971333,0.000046621702,0.000025411635,0.000006464688,0.00000709223,0.00026120892,0.98930335,0.0020469395,0.0057038125,0.0016248582,0.00016272838],"about_ca_topic_score_codex":0.0000064196192,"about_ca_topic_score_gemma":6.9307197e-7,"teacher_disagreement_score":0.9053235,"about_ca_system_score_codex":0.000041552757,"about_ca_system_score_gemma":0.000043295386,"threshold_uncertainty_score":0.4834653},"labels":[],"label_agreement":null},{"id":"W2802514037","doi":"10.4018/978-1-4666-5888-2.ch715","title":"Reversible Logic as a Stepping Stone to Quantum Computing","year":2014,"lang":"en","type":"book-chapter","venue":"Advances in information quality and management","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Stepping stone; Economics","score_opus":0.02039607344511029,"score_gpt":0.2931075155633517,"score_spread":0.2727114421182414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802514037","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000747326,0.00044385888,0.8014739,0.0013652206,0.00047597665,0.00047644597,0.0000035044336,0.00014236872,0.19554396],"genre_scores_gemma":[0.038057055,0.012605903,0.79259616,0.08232931,0.00076023256,0.00010277354,0.0002394208,0.000108682136,0.07320048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981402,0.00004745909,0.00074148655,0.00036350623,0.00041529402,0.00029201375],"domain_scores_gemma":[0.9988383,0.000106141066,0.000425545,0.00046839556,0.00006328458,0.00009833105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010492626,0.00027790508,0.0003691573,0.00045043833,0.00019082236,0.00021052588,0.0005720181,0.00009738859,0.0000073558244],"category_scores_gemma":[0.000032275817,0.00027484985,0.000060936625,0.00013770007,0.00004537089,0.0007964452,0.00090911327,0.0002768739,0.00012774263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048657253,0.00000354002,0.0000012364704,0.00037276238,0.0000081350145,0.0000031246107,0.000674648,0.010898943,7.827793e-8,0.6816797,0.00015948023,0.30619347],"study_design_scores_gemma":[0.00037006504,0.000118588956,0.000096963944,0.0007635583,0.000007543177,0.000008013572,0.000106759704,0.079528764,0.0000012699423,0.14199932,0.7765387,0.00046042068],"about_ca_topic_score_codex":0.000020069328,"about_ca_topic_score_gemma":0.000009147178,"teacher_disagreement_score":0.7763793,"about_ca_system_score_codex":0.00007536587,"about_ca_system_score_gemma":0.000016256028,"threshold_uncertainty_score":0.9999704},"labels":[],"label_agreement":null},{"id":"W2803079534","doi":"10.1038/s41534-019-0152-0","title":"Low-cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem","year":2019,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Dalhousie University; National Science Foundation","keywords":"Computer science; Quantum computer; Quantum; Hamiltonian (control theory); Quantum simulator; Quantum algorithm; Computational science; Computer engineering; Theoretical computer science; Mathematical optimization; Mathematics; Quantum mechanics; Physics","score_opus":0.006967876577109691,"score_gpt":0.22308031398309652,"score_spread":0.21611243740598685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803079534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33265996,0.0000105004365,0.66356945,0.0009068945,0.00085936714,0.0010795518,0.00002785954,0.00011881304,0.0007675987],"genre_scores_gemma":[0.99343354,0.000004675351,0.006136298,0.0002687161,0.000049072307,0.000027419395,0.000037330472,0.000010337737,0.000032592143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822974,0.000052931962,0.00067367475,0.00021772643,0.00046738828,0.00035850835],"domain_scores_gemma":[0.99797,0.00026625808,0.00061981793,0.0007534899,0.0003313446,0.000059093498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004996506,0.00019576414,0.00024300514,0.00014714812,0.00022760268,0.00022564306,0.0011747165,0.00012818458,0.0000037151733],"category_scores_gemma":[0.00014072396,0.00014349632,0.00013405555,0.0005688222,0.000051945357,0.0018304902,0.0002255775,0.00024007968,0.000031844866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027083299,0.00007573026,0.0010073408,0.00032495536,0.000020511703,1.9081767e-7,0.0022020491,0.51423275,0.0002708657,0.2641876,0.0001589268,0.21749195],"study_design_scores_gemma":[0.00051470153,0.00012236575,0.0053231986,0.00015014231,0.0000058117776,0.0000047161125,0.0000683094,0.9763372,0.00032931237,0.012304465,0.004646328,0.00019347646],"about_ca_topic_score_codex":0.000016824373,"about_ca_topic_score_gemma":0.000023289753,"teacher_disagreement_score":0.6607736,"about_ca_system_score_codex":0.000106835934,"about_ca_system_score_gemma":0.00019296404,"threshold_uncertainty_score":0.585161},"labels":[],"label_agreement":null},{"id":"W2803843259","doi":"10.22331/q-2019-09-02-182","title":"Faster quantum simulation by randomization","year":2019,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":169,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Multidisciplinary University Research Initiative; Canadian Institute for Advanced Research; U.S. Department of Energy; National Science Foundation","keywords":"Hamiltonian (control theory); Exponential function; Product (mathematics); Quantum; Quantum computer; Quantum algorithm; Quantization (signal processing); Upper and lower bounds","score_opus":0.006490829766301197,"score_gpt":0.2289627838313734,"score_spread":0.2224719540650722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803843259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31802693,0.00011709441,0.6795283,0.0005573824,0.00088865974,0.00023434756,0.0000028183372,0.00025093276,0.0003935698],"genre_scores_gemma":[0.9958916,0.0000047116832,0.003068961,0.00042020725,0.00010185001,0.0000048094084,0.00001539824,0.000018352517,0.00047416447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984501,0.00011821394,0.0002997384,0.0004685364,0.00032982288,0.00033356456],"domain_scores_gemma":[0.99890894,0.00025335475,0.00013391058,0.0005479875,0.00007127518,0.0000845118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032441234,0.00018676123,0.00023632818,0.00010420953,0.000116282376,0.0002010194,0.0005544036,0.000083983294,0.000051083276],"category_scores_gemma":[0.000040482042,0.00015852906,0.000094077724,0.0003457921,0.000021023623,0.00035617393,0.00014887602,0.00017461924,0.0004840315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001705817,0.00028058226,0.0021475642,0.000097209915,0.00007481522,0.000014603646,0.0022763927,0.763866,0.00942088,0.12446601,0.0085130725,0.0886723],"study_design_scores_gemma":[0.0015068178,0.000104620645,0.00033159685,0.000024888575,0.000003554797,0.0000051299185,0.000009940258,0.98260707,0.0003362052,0.0046311347,0.010212386,0.0002266881],"about_ca_topic_score_codex":0.0000134026395,"about_ca_topic_score_gemma":4.137685e-7,"teacher_disagreement_score":0.6778646,"about_ca_system_score_codex":0.000023237868,"about_ca_system_score_gemma":0.00003140208,"threshold_uncertainty_score":0.64646274},"labels":[],"label_agreement":null},{"id":"W2803889673","doi":"10.4204/eptcs.287.1","title":"Towards Large-scale Functional Verification of Universal Quantum Circuits","year":2019,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Quantum computer; Formal equivalence checking; Boolean function; Qubit; Boolean circuit; Theoretical computer science; Formal verification; Algorithm; Polynomial; Quantum circuit; Electronic circuit; Quantum algorithm; Quantum; Mathematics; Quantum error correction; Quantum mechanics; Physics","score_opus":0.004568378535353583,"score_gpt":0.20922265676031884,"score_spread":0.20465427822496526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803889673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44430125,0.00002892471,0.5525963,0.0004811148,0.00043954104,0.00015785721,7.407909e-7,0.000100847574,0.0018934722],"genre_scores_gemma":[0.9855087,0.000005929314,0.014211849,0.00016286473,0.00008566553,0.0000038681906,8.9084324e-7,0.000009451761,0.000010829328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697065,0.000027694714,0.0003443582,0.0008943332,0.0008211471,0.00094178756],"domain_scores_gemma":[0.9989872,0.00008745113,0.00014436604,0.0003667491,0.00028346575,0.0001307944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017688877,0.000201041,0.0002669401,0.00038521542,0.00016709974,0.00016480201,0.0020255584,0.00008034333,0.000028046194],"category_scores_gemma":[0.00005780095,0.0001814398,0.00007718102,0.0021654342,0.0006323933,0.00063936913,0.000668475,0.0004969099,0.000025845602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008575355,0.00009310482,0.0004401645,0.000018363966,0.0000036183044,8.7453793e-7,0.0008066338,0.0006726928,0.0033548148,0.982384,0.000023109244,0.0121940505],"study_design_scores_gemma":[0.0003976743,0.0003676531,0.0065454347,0.000052423933,0.0000021550047,0.00002676495,0.000027947373,0.86143625,0.0051746,0.12561654,0.00015092362,0.00020165637],"about_ca_topic_score_codex":0.0000031772013,"about_ca_topic_score_gemma":4.6819878e-7,"teacher_disagreement_score":0.86076355,"about_ca_system_score_codex":0.00022081894,"about_ca_system_score_gemma":0.0005210615,"threshold_uncertainty_score":0.73989004},"labels":[],"label_agreement":null},{"id":"W2804898954","doi":"10.1103/physrevlett.121.190501","title":"Quantum Error Correction Decoheres Noise","year":2018,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity; Industry Canada; Canada First Research Excellence Fund; Government of Ontario; Government of Canada; Office of the Director of National Intelligence; Canadian Institute for Advanced Research","keywords":"Fidelity; Quantum error correction; Pauli exclusion principle; Probabilistic logic; Noise (video); Computer science; Error detection and correction; Algorithm; Quantum; Encoding (memory); Quantum noise; Quantum computer; Physics; Quantum mechanics; Telecommunications; Artificial intelligence","score_opus":0.015554231936035584,"score_gpt":0.2900743188083186,"score_spread":0.274520086872283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804898954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54325926,0.0030777925,0.41801974,0.030730305,0.0034987824,0.0004131484,0.0000015252834,0.00060073234,0.00039872155],"genre_scores_gemma":[0.947157,0.0003088987,0.0076880287,0.043046802,0.0017237609,0.000021313954,0.000002222138,0.000021410919,0.000030549105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998742,0.000111906236,0.00018150422,0.00040648103,0.00025436908,0.00030376294],"domain_scores_gemma":[0.99911875,0.0001219547,0.00009733115,0.00050682743,0.000051546587,0.00010362295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016478845,0.00017008,0.00026460268,0.00003676103,0.00015506262,0.00007080741,0.00063291274,0.000008231901,0.000012325314],"category_scores_gemma":[0.00006709931,0.000130592,0.00015881221,0.0004181441,0.00009974825,0.00016068929,0.00017551621,0.00019225694,0.00043680833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009285718,0.00033406707,0.00020422437,0.0006993722,0.00006519969,0.000038057995,0.0009360415,0.0009861051,0.018487414,0.006655415,0.23677467,0.7348102],"study_design_scores_gemma":[0.0001071258,0.00013890411,0.0013720546,0.0008161496,0.000017436943,0.000025135376,0.0000016329045,0.9561512,0.00074556685,0.000982597,0.039364845,0.00027739006],"about_ca_topic_score_codex":0.00001813621,"about_ca_topic_score_gemma":0.000002248356,"teacher_disagreement_score":0.955165,"about_ca_system_score_codex":0.000022169028,"about_ca_system_score_gemma":0.000020331856,"threshold_uncertainty_score":0.5614433},"labels":[],"label_agreement":null},{"id":"W2805441291","doi":"10.1038/s41586-019-0952-6","title":"Verified quantum information scrambling","year":2019,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":375,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Scrambling; Quantum teleportation; Physics; Qubit; Quantum information; Quantum mechanics; Quantum; Quantum discord; Quantum decoherence; Quantum entanglement; Statistical physics; Quantum channel; Mathematics; Algorithm","score_opus":0.004578920497380476,"score_gpt":0.22439614795719465,"score_spread":0.21981722745981416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805441291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7655156,0.00043878861,0.21727034,0.004416227,0.004688438,0.00031469468,0.0000043766804,0.0007682881,0.0065832026],"genre_scores_gemma":[0.96870106,0.0000029108803,0.028661601,0.002436055,0.00010165062,0.0000012832196,0.000006528295,0.000004457795,0.00008443404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920374,0.000020885336,0.00013054699,0.00017121874,0.0002678456,0.00020578824],"domain_scores_gemma":[0.9993788,0.00004278049,0.00006587984,0.00039479832,0.000068720154,0.000049040253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016995356,0.00009999675,0.00010008015,0.00010839688,0.000078073164,0.00020269501,0.0006051671,0.00042541916,0.000012219351],"category_scores_gemma":[0.000033917433,0.00008200557,0.00005079449,0.0003582667,0.000008128254,0.00062277756,0.00015904545,0.0013885417,0.00035153917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024231684,0.00005948558,0.0009136551,0.000121879726,0.00004051166,0.00001476728,0.002964823,0.019646665,0.0022226973,0.58443934,0.011958269,0.37759367],"study_design_scores_gemma":[0.0002808405,0.00005114526,0.0030733682,0.000030417095,0.00000126733,0.000017418959,0.000016927335,0.91511536,0.00055500807,0.003945117,0.07674635,0.00016676173],"about_ca_topic_score_codex":0.00000469909,"about_ca_topic_score_gemma":2.616834e-7,"teacher_disagreement_score":0.8954687,"about_ca_system_score_codex":0.000015166812,"about_ca_system_score_gemma":0.000040587456,"threshold_uncertainty_score":0.60326},"labels":[],"label_agreement":null},{"id":"W2805918291","doi":"10.1007/s00037-022-00231-8","title":"Quantum generalizations of the polynomial hierarchy with applications to QMA(2)","year":2022,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Hierarchy; Computer science; Quantum; Polynomial; Polynomial hierarchy; Quantum computer; Theoretical computer science; Mathematics; Algorithm; Time complexity; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.02945818609854594,"score_gpt":0.2619659994610362,"score_spread":0.23250781336249027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805918291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11843651,0.000026087851,0.8758381,0.0046808487,0.00018155026,0.00042842823,0.00007725684,0.000098573255,0.00023262526],"genre_scores_gemma":[0.8373258,1.0213792e-7,0.16144644,0.00096637633,0.00007773562,0.000098308694,0.00002585201,0.000010190541,0.000049158396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983759,0.00019194956,0.00026390512,0.00036527222,0.00059082085,0.00021216218],"domain_scores_gemma":[0.9989333,0.00014041846,0.00014914565,0.00052719546,0.00015893321,0.00009099085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019490637,0.0001322317,0.00015679016,0.00013417425,0.0011143894,0.000058276823,0.0014474642,0.000013973155,0.00002934391],"category_scores_gemma":[0.000011643558,0.00010277184,0.0000822993,0.0013939744,0.00014607268,0.00006368315,0.0011028445,0.0002176016,0.00000554357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065087197,0.00008111957,0.0004362758,0.0000047441463,0.000012387265,6.23971e-7,0.0003347901,0.73089075,0.000043454475,0.26533723,0.0010787325,0.0017734116],"study_design_scores_gemma":[0.00025081355,0.00012710558,0.025627252,0.000005740636,0.000005057949,0.000050317198,0.00001872254,0.90107554,0.00004351844,0.060488135,0.012144456,0.00016333713],"about_ca_topic_score_codex":0.000062843945,"about_ca_topic_score_gemma":0.000010833173,"teacher_disagreement_score":0.71888936,"about_ca_system_score_codex":0.00006437732,"about_ca_system_score_gemma":0.0002627021,"threshold_uncertainty_score":0.8571094},"labels":[],"label_agreement":null},{"id":"W2806721132","doi":"10.1109/vts.2018.8368663","title":"Special session on quantum systems: Next challenges in design, test, integration","year":2018,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; D-Wave Systems (Canada); University of Waterloo","funders":"","keywords":"Exploit; Computer science; Implementation; Session (web analytics); Perspective (graphical); Quantum; Quantum computer; Scale (ratio); Path (computing); Computer architecture; Software engineering; Computer security; Computer network; Physics; Artificial intelligence","score_opus":0.06320642533007712,"score_gpt":0.2709422461182335,"score_spread":0.20773582078815636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806721132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020414118,0.00025241682,0.9599571,0.0025399716,0.0033035441,0.0003367158,6.0842336e-7,0.0003464731,0.012849055],"genre_scores_gemma":[0.96299636,0.000068674104,0.031491723,0.00019063064,0.0050408673,0.000010849949,7.945672e-7,0.000013259457,0.00018682779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862766,0.0001626413,0.00023669135,0.00044589085,0.00025635108,0.00027078277],"domain_scores_gemma":[0.99905175,0.00034197688,0.000071506445,0.00040117532,0.00006930477,0.00006428932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904214,0.00016126395,0.00016535897,0.00019804279,0.00012150599,0.00020579941,0.00051933195,0.000078787045,0.000012616999],"category_scores_gemma":[0.00010367447,0.000113636095,0.000032203003,0.00030873844,0.000039185383,0.00023234285,0.00012548394,0.00019009682,0.00015111332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021750528,0.0002684751,0.00004253722,0.000021405149,0.0000051490483,0.000035483852,0.0033283057,0.0027356427,0.0011454071,0.15966989,0.0061521423,0.8265738],"study_design_scores_gemma":[0.0002041407,0.0007556824,0.001036241,0.00021662381,8.070496e-7,0.000018326036,0.00015646592,0.9897434,0.0011804138,0.0032268146,0.0032874467,0.00017364777],"about_ca_topic_score_codex":0.00003710285,"about_ca_topic_score_gemma":0.000031414504,"teacher_disagreement_score":0.98700774,"about_ca_system_score_codex":0.00004587595,"about_ca_system_score_gemma":0.00004776104,"threshold_uncertainty_score":0.46339452},"labels":[],"label_agreement":null},{"id":"W2808544372","doi":"10.22606/jaam.2018.33002","title":"Mathematical Methods for a Quantum Annealing Computer","year":2018,"lang":"en","type":"article","venue":"Journal of Advances in Applied Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Quantum annealing; Computer science; Quantum computer; Quantum; Statistical physics; Physics; Quantum mechanics","score_opus":0.017636558037579707,"score_gpt":0.350912140588235,"score_spread":0.3332755825506553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808544372","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002216282,0.00038078838,0.99564695,0.00021464123,0.00058734545,0.00020718615,6.2972845e-7,0.000038180766,0.0007080006],"genre_scores_gemma":[0.0085732965,0.00003645692,0.9905823,0.00016772412,0.0006106746,0.000006562516,1.5254466e-7,0.000017983952,0.0000048446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827844,0.000037101654,0.00089186773,0.00020698443,0.00025661802,0.00032896252],"domain_scores_gemma":[0.99763906,0.0011274206,0.000632583,0.00033178457,0.00017362562,0.000095534226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018905223,0.00018632186,0.0005267394,0.00022400575,0.00009511928,0.00010006003,0.0009319419,0.000067925765,0.000004311731],"category_scores_gemma":[0.00012551274,0.00013862966,0.00013315404,0.00034734205,0.00010540194,0.0002106175,0.00017593673,0.0002561605,0.000005779311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002016741,0.00020702701,0.0000017307302,0.00028514382,0.000023586774,0.0000075119406,0.002970693,0.0046729953,0.0008161775,0.51217526,0.00013459536,0.4786851],"study_design_scores_gemma":[0.00034048787,0.00020196241,0.0000015584266,0.00014275117,0.0000062787867,0.0001193103,0.000049988404,0.5814193,0.0012230395,0.41249636,0.0038943328,0.000104642655],"about_ca_topic_score_codex":7.094337e-8,"about_ca_topic_score_gemma":2.3910042e-7,"teacher_disagreement_score":0.5767463,"about_ca_system_score_codex":0.000035469722,"about_ca_system_score_gemma":0.00005481309,"threshold_uncertainty_score":0.56531537},"labels":[],"label_agreement":null},{"id":"W2808555260","doi":"10.1103/physreva.100.030303","title":"Uncertain fate of fair sampling in quantum annealing","year":2019,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"QLT (Canada)","funders":"Office of the Director of National Intelligence; National Science Foundation","keywords":"Quantum annealing; Quantum; Transverse plane; Statistical physics; Sampling (signal processing); Importance sampling; Physics; Degeneracy (biology); Quantum Monte Carlo; Monte Carlo method; Quantum mechanics; Computer science; Mathematics; Quantum computer; Statistics; Optics; Engineering","score_opus":0.02222092331368797,"score_gpt":0.3580572961516306,"score_spread":0.33583637283794265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808555260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8729028,0.07784111,0.043221258,0.0030410239,0.00033195294,0.0018096255,0.000013667055,0.00020935427,0.0006292183],"genre_scores_gemma":[0.9688601,0.024129145,0.0045376713,0.0020565458,0.00028751846,0.00006197592,0.000011368785,0.00004148733,0.000014172832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996077,0.00042233517,0.00093628775,0.0010211673,0.0008009393,0.00074224966],"domain_scores_gemma":[0.9969406,0.00083582505,0.0005045664,0.0013263832,0.00016266441,0.00022995113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000900813,0.0005026608,0.00195705,0.00009695501,0.00006957731,0.000050409366,0.0015956752,0.000041223735,0.000009789909],"category_scores_gemma":[0.000477777,0.00038291787,0.00075709657,0.0017293931,0.0000892056,0.00030188938,0.00059831,0.0007168327,0.0002616987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032021875,0.0025659993,0.0017536909,0.059400644,0.00017889772,0.00006925221,0.0013301366,0.01247228,0.061240792,0.25925183,0.0011103122,0.60059416],"study_design_scores_gemma":[0.00043974412,0.00037317866,0.0011152456,0.041366987,0.00007905108,0.000011932213,0.0000064257047,0.88890135,0.0027532978,0.055183608,0.008942807,0.0008263663],"about_ca_topic_score_codex":0.00004699453,"about_ca_topic_score_gemma":0.0000016693571,"teacher_disagreement_score":0.8764291,"about_ca_system_score_codex":0.000062565094,"about_ca_system_score_gemma":0.00011819341,"threshold_uncertainty_score":0.99986225},"labels":[],"label_agreement":null},{"id":"W2808949610","doi":"10.1145/3188745.3188908","title":"Capacity approaching coding for low noise interactive quantum communication","year":2018,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Industry Canada; Government of Canada; U.S. Department of Defense","keywords":"Computer science; Coding (social sciences); Noise (video); Artificial intelligence; Sociology","score_opus":0.02497646449216111,"score_gpt":0.2657575328009154,"score_spread":0.2407810683087543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808949610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11120155,0.000010554435,0.88526386,0.0010050453,0.00030576962,0.00019066653,0.0000019761294,0.00023090787,0.0017896743],"genre_scores_gemma":[0.70902854,0.0000010173325,0.2905082,0.0002752342,0.00012338502,0.00001057507,0.0000021622204,0.0000065834606,0.000044282977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990492,0.000087678694,0.00018015808,0.00031370466,0.00012155354,0.0002477203],"domain_scores_gemma":[0.9987494,0.00033468983,0.000104361694,0.00061073265,0.00013773185,0.000063116786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004528624,0.00012286297,0.0001345673,0.00007711357,0.0004765678,0.0002072762,0.0009112592,0.000042211857,0.000005142492],"category_scores_gemma":[0.00009449583,0.000102048754,0.000069521244,0.00018051044,0.00008685064,0.00032575146,0.0003484535,0.00018763641,0.000017590844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043459215,0.00029757072,0.00018659083,0.00007929938,0.00007717979,0.0000014041982,0.019880531,0.0016559921,0.00639066,0.70629436,0.0026661188,0.26242682],"study_design_scores_gemma":[0.00020589217,0.000100086516,0.00030636575,0.000049597464,0.0000025223476,0.000010159933,0.00005536097,0.9798562,0.0045573106,0.013799359,0.00090979884,0.00014735779],"about_ca_topic_score_codex":0.00006585804,"about_ca_topic_score_gemma":0.000015045504,"teacher_disagreement_score":0.9782002,"about_ca_system_score_codex":0.000033302607,"about_ca_system_score_gemma":0.000024444806,"threshold_uncertainty_score":0.41614273},"labels":[],"label_agreement":null},{"id":"W2808979145","doi":"10.1103/physrevresearch.1.033063","title":"Continuous-variable quantum neural networks","year":2019,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":374,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Army Research Office","keywords":"Artificial neural network; Quantum computer; Quantum; Key (lock); Extension (predicate logic); Computation; Quantum information; Quantum network","score_opus":0.0296030830616106,"score_gpt":0.35409448935980925,"score_spread":0.32449140629819867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808979145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3460302,0.16526315,0.41965652,0.025098095,0.0034471224,0.006480782,0.0000133677295,0.0016371101,0.032373663],"genre_scores_gemma":[0.9920973,0.0016519838,0.0034718667,0.0013871405,0.0006895107,0.00004757128,0.0000057258653,0.000029620269,0.00061923545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967947,0.0005728257,0.00024539666,0.00063758716,0.0008845542,0.0008649175],"domain_scores_gemma":[0.99756414,0.00084215717,0.000060785853,0.0010656292,0.00025516897,0.00021213258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016290216,0.00017891431,0.00047766877,0.000072578994,0.00017990719,0.00020741904,0.0016641583,0.0000350683,0.00004863258],"category_scores_gemma":[0.00021790667,0.00013203615,0.00015907915,0.0014280266,0.00008086564,0.00020128378,0.0009402741,0.0010455187,0.00057847594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001238807,0.0004921552,0.0003753329,0.0016060777,0.00004925775,0.00004963073,0.00019008848,0.012337632,0.0011185607,0.6031045,0.023936171,0.35672823],"study_design_scores_gemma":[0.00012344064,0.00019087741,0.00016799314,0.0006274751,0.0000030301962,0.000010625666,0.00000193194,0.9564754,0.000023816643,0.010744255,0.031469345,0.00016185586],"about_ca_topic_score_codex":0.00004283225,"about_ca_topic_score_gemma":3.6632713e-7,"teacher_disagreement_score":0.9441377,"about_ca_system_score_codex":0.000029886956,"about_ca_system_score_gemma":0.00007601436,"threshold_uncertainty_score":0.7435331},"labels":[],"label_agreement":null},{"id":"W2811316479","doi":"10.1088/2058-9565/aaf24b","title":"Molecular realization of a quantum <tt>NAND</tt> tree","year":2018,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Canadian Institute for Advanced Research; Vector Institute; Xanadu Quantum Technologies (Canada)","funders":"Office of Naval Research; Villum Fonden; Danmarks Frie Forskningsfond; Carlsbergfondet; Oticon Fonden; Natur og Univers, Det Frie Forskningsråd","keywords":"Quantum gate; Quantum computer; Quantum algorithm; Quantum error correction; NAND gate; Controlled NOT gate; Realization (probability); Quantum; Quantum circuit","score_opus":0.00671449234091948,"score_gpt":0.240490223883658,"score_spread":0.23377573154273854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811316479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63128084,0.00018306196,0.36545673,0.001994227,0.00028366828,0.0001093184,9.678807e-7,0.00027886868,0.00041230145],"genre_scores_gemma":[0.99035907,0.000023126462,0.009404441,0.00015115456,0.00003814373,0.000005523491,4.2108186e-7,0.000008168034,0.000009959411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798,0.000031929238,0.00030496033,0.0006912328,0.00048547055,0.0005063964],"domain_scores_gemma":[0.99837965,0.0000431891,0.00018083157,0.00078225526,0.0005155142,0.000098555654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007398011,0.00017228581,0.0002499209,0.0008598557,0.00039610843,0.0000950549,0.0015019223,0.00013484692,0.0000024052622],"category_scores_gemma":[0.0003142254,0.00014383966,0.00003278162,0.0038480938,0.0023110823,0.00028826183,0.00066736084,0.00017085584,0.00000925627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029490302,0.000038832157,0.0004317603,0.000010306753,0.0000047797753,0.000013012979,0.00029195473,0.00001466384,0.06480929,0.8714708,0.00007168452,0.06283993],"study_design_scores_gemma":[0.0002756131,0.00082221616,0.0011515358,0.000051137435,0.0000060730495,0.00012016336,0.00006527957,0.72183585,0.09566163,0.1785036,0.0012760009,0.00023086945],"about_ca_topic_score_codex":0.00004466186,"about_ca_topic_score_gemma":0.000007281047,"teacher_disagreement_score":0.7218212,"about_ca_system_score_codex":0.000026006976,"about_ca_system_score_gemma":0.0002933099,"threshold_uncertainty_score":0.8515279},"labels":[],"label_agreement":null},{"id":"W2811434991","doi":"","title":"A Survey of Programming Tools for D-Wave Quantum-Annealing Processors.","year":2018,"lang":"en","type":"article","venue":"ISC","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Leverage (statistics); Computer science; Variety (cybernetics); Quantum annealing; Software engineering; Quantum; Quantum computer","score_opus":0.06454977534382168,"score_gpt":0.29841391043279797,"score_spread":0.2338641350889763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811434991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22008324,0.00011655401,0.7787639,0.00019269207,0.00029329275,0.00027998586,0.000010846392,0.00017645604,0.000083059895],"genre_scores_gemma":[0.8260245,9.143979e-7,0.17368758,0.0000627041,0.00016993577,0.000014902755,0.0000053009912,0.000010916312,0.000023284958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880034,0.000057767855,0.00026710087,0.00034696588,0.00019004031,0.00033779445],"domain_scores_gemma":[0.9986683,0.00039307264,0.0001573259,0.00035305842,0.00036578692,0.00006243907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000830235,0.00012500459,0.00020586417,0.00007128586,0.00015614179,0.00018178194,0.0005215931,0.000051150753,0.0000015439159],"category_scores_gemma":[0.00045340063,0.00010371694,0.00006509634,0.0004401248,0.00008301805,0.00019340067,0.00016765695,0.00008671145,0.0000054580273],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020836804,0.00007384201,0.000418038,0.000105163206,0.000029143892,0.0000035969897,0.0023833856,0.0002118945,0.00042968628,0.0047086105,0.0005035105,0.9911123],"study_design_scores_gemma":[0.00028765906,0.00045145926,0.006191706,0.00008242896,0.0000044025364,0.000010890932,0.000018527497,0.9830528,0.0048582037,0.0015351606,0.0033161615,0.00019062462],"about_ca_topic_score_codex":0.00010906821,"about_ca_topic_score_gemma":0.000047331807,"teacher_disagreement_score":0.9909217,"about_ca_system_score_codex":0.000009192717,"about_ca_system_score_gemma":0.00009438104,"threshold_uncertainty_score":0.4229454},"labels":[],"label_agreement":null},{"id":"W28221266","doi":"10.1097/mph.0000000000000787","title":"Asymptotically Optimal Regular Synthesis of Reversible Logic Networks","year":2003,"lang":"en","type":"article","venue":"Journal of Pediatric Hematology/Oncology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Toffoli gate; Asymptotically optimal algorithm; Realization (probability); Mathematics; Logic gate; Algorithm; Quantum gate; Arithmetic; Computer science; Topology (electrical circuits); Quantum; Quantum algorithm; Combinatorics","score_opus":0.011361078876041325,"score_gpt":0.25515516194459,"score_spread":0.24379408306854866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28221266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082396835,0.0030545308,0.9077477,0.0032012484,0.001731424,0.00012748416,0.0000010347865,0.000046580266,0.0016931648],"genre_scores_gemma":[0.59070957,0.0003817629,0.4080552,0.00033376916,0.0004775849,0.0000021615967,1.7879036e-7,0.000014456169,0.000025359574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687296,0.00077114184,0.0011598468,0.00031432888,0.0003458029,0.0005358927],"domain_scores_gemma":[0.99569535,0.0019467858,0.0013034123,0.00040709117,0.0003997517,0.00024759455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022178616,0.0002251701,0.0010047817,0.00045124732,0.00011197997,0.000025305346,0.0011267031,0.00042020247,0.00003041256],"category_scores_gemma":[0.0012477111,0.00017955272,0.00031704968,0.00079579576,0.00014929447,0.0001642499,0.00020324485,0.00073960016,0.000009929305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000358569,0.0037349057,0.01400158,0.0005043345,0.0010120826,0.008956974,0.0019598599,0.34583354,0.0005516585,0.4716652,0.055380892,0.096040405],"study_design_scores_gemma":[0.008582802,0.015342134,0.0026608023,0.00031627895,0.0017154085,0.080431044,0.0006754896,0.7360117,0.008786528,0.07488705,0.0679613,0.0026294922],"about_ca_topic_score_codex":0.0000016453554,"about_ca_topic_score_gemma":4.67845e-7,"teacher_disagreement_score":0.5083127,"about_ca_system_score_codex":0.000094024086,"about_ca_system_score_gemma":0.00080514594,"threshold_uncertainty_score":0.7321948},"labels":[],"label_agreement":null},{"id":"W2883727782","doi":"10.1007/jhep10(2018)011","title":"Circuit complexity for coherent states","year":2018,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":129,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Périmètre de physique théorique; Ministry of Advanced Education; Simons Foundation; National Natural Science Foundation of China; Government of Canada; Government of Ontario; China Scholarship Council; Ministry of Advanced Education and Skills Development","keywords":"Coherent states; Quantum entanglement; Circuit complexity; State (computer science); Vacuum state; Scalar (mathematics); Computational complexity theory; Field (mathematics)","score_opus":0.026662123969419634,"score_gpt":0.2504948910206562,"score_spread":0.22383276705123656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883727782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036908757,0.00005381263,0.96144897,0.00047162335,0.0009696228,0.000025451824,0.000004672151,0.000027792863,0.00008930197],"genre_scores_gemma":[0.9232388,0.0000074614386,0.07448135,0.00038052516,0.001835268,0.0000010507965,0.0000018770311,0.000009900241,0.00004375894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990525,0.000039094666,0.00028268722,0.00014752439,0.0002565786,0.00022159058],"domain_scores_gemma":[0.9988261,0.000118506345,0.00033978952,0.00023241548,0.0003892912,0.00009393562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016810655,0.000118811135,0.00023226357,0.00004473289,0.00015428102,0.000097920456,0.0006676308,0.000027777021,0.0000036402237],"category_scores_gemma":[0.000010600973,0.00009070411,0.00013837303,0.00017479737,0.000097537915,0.0001657327,0.000105026054,0.000109509485,0.0000021433686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000126726145,0.00011020947,0.000012576404,0.000008003897,0.000057351248,0.0000062976587,0.00030982375,0.0031516277,0.00017302952,0.8746549,0.0030512998,0.11845219],"study_design_scores_gemma":[0.00043224145,0.00063010445,0.00027050573,0.00002956377,0.000009137966,0.000037720187,0.00000529343,0.13919811,0.0055760955,0.84335226,0.010336184,0.00012278091],"about_ca_topic_score_codex":0.000026984058,"about_ca_topic_score_gemma":0.000004550031,"teacher_disagreement_score":0.8869676,"about_ca_system_score_codex":0.000027326048,"about_ca_system_score_gemma":0.00007667986,"threshold_uncertainty_score":0.36988065},"labels":[],"label_agreement":null},{"id":"W2884175209","doi":"10.1103/physrevlett.123.030503","title":"Direct Randomized Benchmarking for Multiqubit Devices","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Intelligence Advanced Research Projects Activity; Office of the Director of National Intelligence; U.S. Department of Energy","keywords":"Qubit; Computer science; Benchmarking; Quantum computer; Topology (electrical circuits); Quantum; Quantum mechanics; Mathematics; Physics","score_opus":0.009240767773537082,"score_gpt":0.27103818993770057,"score_spread":0.26179742216416346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884175209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30443856,0.027539276,0.62384915,0.035808835,0.0016815453,0.005047464,0.0000069953808,0.0005942122,0.0010339841],"genre_scores_gemma":[0.8571318,0.0021902546,0.07444592,0.06481509,0.0010531608,0.00027581307,0.000011818467,0.000039686674,0.000036486246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859613,0.00017669411,0.00024817427,0.0004486261,0.00022419075,0.00030620073],"domain_scores_gemma":[0.99802595,0.0012928998,0.00015039455,0.000427556,0.00003419239,0.00006898191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061347557,0.00018850689,0.0007486867,0.00002653412,0.000072275034,0.00007886389,0.0006270259,0.000007922063,0.000005807523],"category_scores_gemma":[0.0000911656,0.00013105653,0.00047485132,0.00021452324,0.000036291447,0.00014259756,0.0001469763,0.00012535263,0.000066000444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013402884,0.0006661993,0.00032673095,0.01572502,0.00081141526,0.000032486234,0.0024798785,0.018439177,0.025322367,0.052216277,0.03194852,0.8506916],"study_design_scores_gemma":[0.008339739,0.00004167439,0.00007199828,0.001564003,0.00004399136,0.000003061546,4.7916063e-7,0.95976096,0.00024209624,0.0004890188,0.029144853,0.0002981066],"about_ca_topic_score_codex":0.0000058869878,"about_ca_topic_score_gemma":2.304639e-7,"teacher_disagreement_score":0.9413218,"about_ca_system_score_codex":0.000014405127,"about_ca_system_score_gemma":0.000014353142,"threshold_uncertainty_score":0.534433},"labels":[],"label_agreement":null},{"id":"W2884199211","doi":"10.1088/2058-9565/aaf59e","title":"Machine learning method for state preparation and gate synthesis on photonic quantum computers","year":2018,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":127,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Electronic circuit; Artificial neural network; Quantum computer; State (computer science); Photonics; Quantum circuit; Logic gate; Power (physics); Phase (matter)","score_opus":0.010579818183211282,"score_gpt":0.2805958800397355,"score_spread":0.2700160618565242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884199211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4533964,0.00014948253,0.54205364,0.0033312645,0.00031519317,0.00027575353,0.000003720538,0.0004229344,0.0000516333],"genre_scores_gemma":[0.87587494,0.000044064822,0.1237728,0.00021362025,0.000035785746,0.000028929833,6.084876e-7,0.000010563673,0.000018716113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789584,0.00006823882,0.00024686052,0.00093139434,0.0002937064,0.0005639382],"domain_scores_gemma":[0.99863106,0.0004294127,0.0001610419,0.00043060342,0.00023702809,0.000110863155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015875304,0.00021177885,0.00026601096,0.00068451406,0.0010599847,0.00025432493,0.0007961529,0.000092514354,0.0000012173468],"category_scores_gemma":[0.00046669607,0.00017361357,0.00002841314,0.001303531,0.0010177618,0.00026893997,0.00045399545,0.00025129534,0.0000067518927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005490597,0.00007428687,0.00020798488,0.00004031697,0.000024379302,0.000013932345,0.0013044118,0.0006574456,0.025545536,0.33497795,0.00007891256,0.63701993],"study_design_scores_gemma":[0.00021578245,0.0013775068,0.00013428947,0.000044146607,0.0000056925433,0.000106948144,0.000028754263,0.9262054,0.026693875,0.04187499,0.0031023726,0.00021026461],"about_ca_topic_score_codex":0.000039465296,"about_ca_topic_score_gemma":0.000009805915,"teacher_disagreement_score":0.92554796,"about_ca_system_score_codex":0.000033553337,"about_ca_system_score_gemma":0.00011587437,"threshold_uncertainty_score":0.81526524},"labels":[],"label_agreement":null},{"id":"W2884219781","doi":"10.1103/physrevx.9.041009","title":"Stabilized Cat in a Driven Nonlinear Cavity: A Fault-Tolerant Error Syndrome Detector","year":2019,"lang":"en","type":"article","venue":"Physical Review X","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":146,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Division of Materials Research; Yale University; Université de Sherbrooke; National Science Foundation","keywords":"Fault tolerance; Computer science; Qubit; Noise (video); Overhead (engineering); Quantum computer; Error detection and correction; Quantum error correction; Quantum; Algorithm; Topology (electrical circuits); Distributed computing; Physics; Quantum mechanics; Mathematics; Artificial intelligence","score_opus":0.01151204861466132,"score_gpt":0.28207149581792756,"score_spread":0.27055944720326625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884219781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936392,0.0017740258,0.0022235955,0.0012782378,0.00019318341,0.00067202875,0.000005542249,0.00013014802,0.00008406873],"genre_scores_gemma":[0.9848037,0.00021151193,0.014008021,0.00081953575,0.00007294874,0.000034717108,0.0000027420108,0.000018563574,0.000028305167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981317,0.00017567303,0.00031687802,0.0005939479,0.00036259156,0.00041918957],"domain_scores_gemma":[0.99872136,0.00020209725,0.00010857361,0.00078597124,0.000046129455,0.00013587862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024198093,0.0002367105,0.00070110493,0.00006008151,0.00004301167,0.000054343393,0.0008489389,0.00003096034,0.000016760674],"category_scores_gemma":[0.00007586982,0.00017796682,0.00022413836,0.00065392425,0.000032595348,0.00014683529,0.00035555544,0.00030069554,0.000399974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010214439,0.0062418063,0.005703339,0.019746197,0.00031904483,0.0018591966,0.01038724,0.025622688,0.0411972,0.019658469,0.00041397614,0.8687487],"study_design_scores_gemma":[0.00047216157,0.00019227232,0.0019165697,0.0018646494,0.000011920983,0.000055748707,0.0000029423575,0.9904289,0.00012708332,0.0015838195,0.003023524,0.00032039927],"about_ca_topic_score_codex":0.000046267472,"about_ca_topic_score_gemma":0.000010748875,"teacher_disagreement_score":0.9648062,"about_ca_system_score_codex":0.00005285964,"about_ca_system_score_gemma":0.00008869492,"threshold_uncertainty_score":0.7257277},"labels":[],"label_agreement":null},{"id":"W2885845431","doi":"10.22331/q-2019-09-02-181","title":"Simulation of quantum circuits by low-rank stabilizer decompositions","year":2019,"lang":"lv","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":278,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Superposition principle; Quantum gate; Quantum computer; Electronic circuit; Quantum; Qubit; Diagonal; Quantum algorithm; Formalism (music)","score_opus":0.01089101886903762,"score_gpt":0.2535564788062195,"score_spread":0.2426654599371819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885845431","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6622882,0.0010590231,0.33242786,0.0006339171,0.0023885746,0.0005957201,0.00014681963,0.00017620095,0.00028370423],"genre_scores_gemma":[0.9979477,0.000034309334,0.0011892758,0.00023638672,0.00021005183,0.0000074078303,0.00005737839,0.0000662042,0.00025126748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536395,0.00039688376,0.001144582,0.0011996251,0.00094129227,0.0009536947],"domain_scores_gemma":[0.99580073,0.0013141088,0.0006519206,0.0015374869,0.00039676117,0.0002989813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006712543,0.00058687286,0.00084140955,0.00030728357,0.00031940712,0.0002585088,0.0013830296,0.00031779852,0.0002966297],"category_scores_gemma":[0.00012092059,0.00058313814,0.0004110323,0.00108499,0.0002068908,0.00047019796,0.00043115113,0.0006556866,0.0006316292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004650125,0.0011941037,0.0013403995,0.00068639976,0.00017988926,0.000021977361,0.0036841682,0.9037674,0.02657714,0.03808199,0.0017124437,0.022707574],"study_design_scores_gemma":[0.0010378321,0.000700511,0.0015916764,0.0005126863,0.00004463698,0.000010622309,0.0000826165,0.98613995,0.0016087753,0.005030958,0.0025572395,0.0006824813],"about_ca_topic_score_codex":0.00012369057,"about_ca_topic_score_gemma":0.0000029364217,"teacher_disagreement_score":0.33565953,"about_ca_system_score_codex":0.000096193515,"about_ca_system_score_gemma":0.00027055416,"threshold_uncertainty_score":0.999662},"labels":[],"label_agreement":null},{"id":"W2887185791","doi":"10.1103/physrevx.9.031006","title":"Locality and Digital Quantum Simulation of Power-Law Interactions","year":2019,"lang":"en","type":"article","venue":"Physical Review X","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Laboratory; U.S. Department of Energy; Advanced Scientific Computing Research; Air Force Office of Scientific Research; National Institute of Standards and Technology; Office of Science; Canadian Institute for Advanced Research; Achievement Rewards for College Scientists Foundation; Multidisciplinary University Research Initiative; Army Research Office; Heising-Simons Foundation; National Science Foundation","keywords":"Upper and lower bounds; Quantum; Locality; Limit (mathematics); Quantum simulator; Quantum algorithm; Quantum computer; Quantum system","score_opus":0.011092053738907577,"score_gpt":0.3009506087436479,"score_spread":0.2898585550047403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887185791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8646731,0.0020026548,0.12975548,0.0008822226,0.00020842333,0.000276335,0.0000063366283,0.000079818004,0.0021156573],"genre_scores_gemma":[0.9992354,0.0000360751,0.00041768534,0.00027000086,0.000026818923,0.0000011883559,0.0000011810239,0.0000033859358,0.000008271849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993811,0.00003133667,0.00015701108,0.00019813431,0.00013581238,0.00009661013],"domain_scores_gemma":[0.99930567,0.00024081522,0.000080604375,0.00028235087,0.0000442791,0.000046275964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007717829,0.00007855683,0.00021392875,0.000012789436,0.000027514392,0.000044020475,0.0001811183,0.000007768545,0.0000043657233],"category_scores_gemma":[0.00003972088,0.000059524424,0.000077726356,0.00014807966,0.000034845303,0.00025192063,0.00015202916,0.00010104038,0.000040798994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063668904,0.0004555942,0.0004718615,0.0015174765,0.000042905733,0.000002641188,0.000495362,0.018676706,0.0007517908,0.7462229,0.00005814877,0.23129821],"study_design_scores_gemma":[0.00006279265,0.0000795253,0.0007827248,0.0005211045,0.0000050288836,0.0000028821469,0.0000014636471,0.964162,0.00007877898,0.02955082,0.004666551,0.00008632408],"about_ca_topic_score_codex":0.0000058204014,"about_ca_topic_score_gemma":1.8794535e-7,"teacher_disagreement_score":0.9454853,"about_ca_system_score_codex":0.0000059982076,"about_ca_system_score_gemma":0.000009814018,"threshold_uncertainty_score":0.24273355},"labels":[],"label_agreement":null},{"id":"W2887367462","doi":"10.1063/1.5085428","title":"Approximation algorithms for quantum many-body problems","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Seventh Framework Programme","keywords":"Eigenvalues and eigenvectors; Gaussian; Semidefinite programming; Quartic function; Separable space; Quadratic equation; State (computer science); Simple (philosophy)","score_opus":0.019766545163025357,"score_gpt":0.26146416875652967,"score_spread":0.2416976235935043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887367462","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026421074,0.000036896567,0.97195643,0.0006108202,0.0003958425,0.000289342,0.0000015295127,0.000038783048,0.00024929893],"genre_scores_gemma":[0.34144354,0.000004109078,0.65756905,0.00014330728,0.00068227143,0.0000070757706,0.0000012840183,0.000026579426,0.00012276247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985585,0.000038988564,0.0005275372,0.0001765453,0.00044694167,0.00025145075],"domain_scores_gemma":[0.99854875,0.00033492674,0.0004693169,0.00031475132,0.00023449144,0.00009776513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006502167,0.00015172108,0.00037024062,0.000060029546,0.00006318886,0.00013773641,0.00067800673,0.00005441816,0.00000638759],"category_scores_gemma":[0.00006450631,0.000108182896,0.00023892584,0.00019963791,0.000025882002,0.00034940845,0.000104719256,0.00025086792,0.00004941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000809657,0.00034000707,0.000008359529,0.00038591126,0.000053613363,0.0000036437225,0.00080770766,0.006842161,0.0016570784,0.95352477,0.00041000373,0.035958648],"study_design_scores_gemma":[0.00031846913,0.00023162559,0.000018501634,0.00010897905,0.000008615219,0.000048990383,0.0000109551775,0.59209377,0.0005275359,0.40630916,0.00023770443,0.000085695305],"about_ca_topic_score_codex":2.2299707e-7,"about_ca_topic_score_gemma":4.379808e-9,"teacher_disagreement_score":0.5852516,"about_ca_system_score_codex":0.000026517828,"about_ca_system_score_gemma":0.000059245005,"threshold_uncertainty_score":0.44115704},"labels":[],"label_agreement":null},{"id":"W2887591403","doi":"10.1098/rspa.2018.0767","title":"Revisiting the simulation of quantum Turing machines by quantum circuits","year":2019,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Quantum Turing machine; Quantum computer; Turing machine; Quantum algorithm; Quantum circuit; Quantum information; Quantum; Quantum simulator; Quantum network; Turing","score_opus":0.006842666915785978,"score_gpt":0.21438881252614306,"score_spread":0.20754614561035709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887591403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95950216,0.000094786315,0.039351907,0.0006849909,0.00006726025,0.00012318497,0.0000010920434,0.000050133916,0.00012448475],"genre_scores_gemma":[0.99718213,0.0000015735224,0.002681257,0.000022633356,0.00008768843,0.0000022803276,4.9360857e-8,0.0000057038255,0.000016700027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988999,0.000005897837,0.00021870977,0.00024402351,0.00040827482,0.00022321749],"domain_scores_gemma":[0.9992252,0.0004254928,0.00015004259,0.000105350766,0.000054141736,0.000039768118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050773827,0.00013464138,0.00023473146,0.000013534166,0.0001828066,0.0001068946,0.0007831127,0.000031391744,9.947554e-7],"category_scores_gemma":[0.00012529406,0.00006897801,0.00016359212,0.00038238027,0.0001873452,0.00015566095,0.00034986192,0.00018444666,9.913836e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017629527,0.00009602737,0.00074295,0.001651795,0.000053005017,5.5884247e-8,0.0070907515,0.57107824,0.03138758,0.38047847,0.000069756,0.0073496173],"study_design_scores_gemma":[0.000058504596,0.000037296097,0.0007613112,0.00023785653,0.0000077601335,0.0000013058298,0.00006855019,0.97501135,0.0014830665,0.022225862,0.000013047836,0.00009407456],"about_ca_topic_score_codex":0.0000043750597,"about_ca_topic_score_gemma":2.729486e-9,"teacher_disagreement_score":0.40393314,"about_ca_system_score_codex":0.0000070104475,"about_ca_system_score_gemma":0.000009326965,"threshold_uncertainty_score":0.28128418},"labels":[],"label_agreement":null},{"id":"W2888421625","doi":"10.1088/1367-2630/aadcc7","title":"From randomized benchmarking experiments to gate-set circuit fidelity: how to interpret randomized benchmarking decay parameters","year":2018,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Waterloo","funders":"Canada First Research Excellence Fund; Army Research Office; Industry Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Physics; Fidelity; Quantum gate; Benchmarking; Qubit; Controlled NOT gate; Pauli exclusion principle; Set (abstract data type); Quantum circuit; Noise (video); Algorithm; Quantum mechanics; Topology (electrical circuits); Quantum error correction; Quantum; Computer science; Artificial intelligence; Mathematics; Combinatorics; Telecommunications","score_opus":0.023475543080559866,"score_gpt":0.2772447094440703,"score_spread":0.25376916636351043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888421625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.237881,0.00022911101,0.757736,0.0011201327,0.002459856,0.0004186413,0.00000409148,0.0000394291,0.00011170578],"genre_scores_gemma":[0.81092244,0.000027480204,0.1835711,0.0015891303,0.0038298669,0.000009008699,0.000002828998,0.000027739734,0.000020398265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642366,0.0007062166,0.0009384393,0.0005570036,0.00083327846,0.00054137624],"domain_scores_gemma":[0.99591225,0.0019073491,0.00062879676,0.00062972534,0.00034184614,0.0005800005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020190605,0.0003951265,0.0016136179,0.00023579999,0.00019838613,0.0006793505,0.0015691746,0.00008393311,0.000026707592],"category_scores_gemma":[0.0005318678,0.00030713645,0.000711244,0.00056182174,0.00013156293,0.0004390039,0.0005333146,0.00042450387,0.00001965737],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.08089848,0.00021478519,0.000024389157,0.00002226449,0.0015555283,0.00012951106,0.086146966,0.015285533,0.014015364,0.0043629203,0.021021014,0.77632326],"study_design_scores_gemma":[0.42474592,0.0009866914,0.000022455013,0.0015452229,0.0002407743,0.000072834984,0.0002263163,0.44117343,0.046495005,0.08076529,0.0026176076,0.0011084495],"about_ca_topic_score_codex":0.00017628225,"about_ca_topic_score_gemma":0.0000037636505,"teacher_disagreement_score":0.7752148,"about_ca_system_score_codex":0.000095858784,"about_ca_system_score_gemma":0.00019942234,"threshold_uncertainty_score":0.9999381},"labels":[],"label_agreement":null},{"id":"W2888801391","doi":"10.1007/978-3-319-96424-9_9","title":"Prospects for Near-Term Quantum Machine Learning","year":2018,"lang":"en","type":"book-chapter","venue":"Quantum science and technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Quantum machine learning; Computer science; Quantum computer; Term (time); Unitary state; Quantum; Scale (ratio); Quantum algorithm; Algorithm; Theoretical computer science; Computer engineering; Physics; Quantum mechanics","score_opus":0.011228055556953657,"score_gpt":0.23760453265763903,"score_spread":0.22637647710068537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888801391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1712538,0.02684014,0.6170019,0.048290975,0.016679829,0.011364439,0.00025404443,0.01929687,0.08901804],"genre_scores_gemma":[0.6237576,0.0013530905,0.23606667,0.001880535,0.0022107877,0.00030299474,0.00006543983,0.00055437593,0.13380852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622816,0.0000125984225,0.00044545095,0.0017027038,0.00065712054,0.0009539631],"domain_scores_gemma":[0.9976017,0.00012929927,0.00040354975,0.0010476958,0.0006224216,0.00019535131],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0010238176,0.00054213766,0.00061222556,0.0009929027,0.0016144805,0.00056758145,0.002597267,0.0005247801,0.000021554108],"category_scores_gemma":[0.0002972582,0.00046436326,0.00010501799,0.00070143933,0.0032563843,0.00028873497,0.0015214081,0.00095339277,0.00007172966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005868318,0.000018046545,0.000046505975,0.000053136344,0.000018033805,0.000033712593,0.00020910612,0.000005800545,0.000671623,0.93902224,0.000284547,0.059631355],"study_design_scores_gemma":[0.00030349958,0.0012303807,0.000020143032,0.00017283463,0.000016504851,0.0002593829,0.000008093045,0.49915794,0.0005273661,0.3907069,0.10700382,0.0005931253],"about_ca_topic_score_codex":0.000007201305,"about_ca_topic_score_gemma":0.0000071098475,"teacher_disagreement_score":0.54831535,"about_ca_system_score_codex":0.00008173448,"about_ca_system_score_gemma":0.0005980242,"threshold_uncertainty_score":0.99978083},"labels":[],"label_agreement":null},{"id":"W2889426946","doi":"10.1126/science.abo6587","title":"Quantum optimization of maximum independent set using Rydberg atom arrays","year":2022,"lang":"en","type":"article","venue":"Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":432,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Speedup; Rydberg formula; Quantum annealing; Quantum; Rydberg atom; Qubit; Computer science; Quantum computer; Maxima and minima; Degeneracy (biology); Quantum algorithm; Benchmark (surveying); Algorithm; Quantum mechanics; Physics; Mathematics; Parallel computing; Bioinformatics","score_opus":0.019057048836205123,"score_gpt":0.2562398562477634,"score_spread":0.23718280741155828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889426946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3016165,0.000046998444,0.69725686,0.00016849807,0.00068061316,0.000076417506,0.0000045047805,0.00006182056,0.00008777935],"genre_scores_gemma":[0.8162216,0.000001417241,0.18362096,0.00010542632,0.000028510654,0.0000029867545,9.889525e-7,0.0000056530666,0.000012449119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997837,0.00007816993,0.00023054692,0.0004995948,0.0009966359,0.00035805017],"domain_scores_gemma":[0.9990582,0.000038549573,0.000180124,0.00053012697,0.0000998998,0.00009310651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010909328,0.00010792717,0.00013334873,0.0002780757,0.0008015364,0.000117883596,0.0018407318,0.000017407374,0.000028982775],"category_scores_gemma":[0.000029240144,0.000103473874,0.000048961636,0.002040634,0.00021291758,0.0003343412,0.0013668898,0.00020268181,0.0000020462076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016834367,0.000030507303,0.0001824667,0.000004370691,0.0000018380103,0.000006875161,0.0009320095,0.9854935,0.0042686663,0.00584724,0.000012117137,0.0032187179],"study_design_scores_gemma":[0.00011853344,0.00008544122,0.00039344977,0.000008611346,0.000001899834,0.000071344184,0.00009894644,0.99282545,0.0018587105,0.0040448364,0.00036129323,0.00013148249],"about_ca_topic_score_codex":0.000041836294,"about_ca_topic_score_gemma":6.9286597e-7,"teacher_disagreement_score":0.5146051,"about_ca_system_score_codex":0.00009469942,"about_ca_system_score_gemma":0.00039129285,"threshold_uncertainty_score":0.61648506},"labels":[],"label_agreement":null},{"id":"W2890217530","doi":"10.1103/physreva.100.032306","title":"Quantum algorithm for nonhomogeneous linear partial differential equations","year":2019,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Air Force Office of Scientific Research; Army Research Office; Multidisciplinary University Research Initiative; Intelligence Advanced Research Projects Activity; National Science Foundation","keywords":"Mathematics; Partial differential equation; Hamiltonian (control theory); Algorithm; Partial derivative; Quantum gate; Quantum algorithm; Applied mathematics; Quantum; Mathematical analysis; Mathematical optimization; Quantum mechanics; Physics","score_opus":0.016379406230707574,"score_gpt":0.33405843191601975,"score_spread":0.3176790256853122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890217530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021688031,0.022594739,0.94953763,0.0021876264,0.0007628548,0.0027125084,0.0000750636,0.00031422905,0.00012732956],"genre_scores_gemma":[0.8727674,0.044230517,0.059717067,0.011422656,0.008982413,0.0017898373,0.00036224307,0.00030100037,0.00042690276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572605,0.0003353053,0.00079610577,0.0012939523,0.0009116056,0.00093697023],"domain_scores_gemma":[0.9962244,0.0011221677,0.00042477495,0.0015270764,0.0002837969,0.00041779864],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040829869,0.0006515292,0.0017401343,0.000061102786,0.0002459922,0.00011641552,0.0016539178,0.000057284014,0.000033161872],"category_scores_gemma":[0.0004490873,0.0004928985,0.0014072115,0.000849706,0.000099138066,0.00027414502,0.0005771245,0.00057384244,0.0010127939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010502016,0.0018457456,0.000009462889,0.006326608,0.00017807279,0.000016487451,0.00016097788,0.0002512245,0.0077533154,0.09206646,0.0033258828,0.88805526],"study_design_scores_gemma":[0.0004170719,0.0004890394,0.000026399472,0.0040293247,0.00020622823,0.000011357334,7.824774e-7,0.94331515,0.0018809703,0.012667872,0.03631833,0.00063750456],"about_ca_topic_score_codex":0.000010872894,"about_ca_topic_score_gemma":5.5189577e-7,"teacher_disagreement_score":0.9430639,"about_ca_system_score_codex":0.00005617901,"about_ca_system_score_gemma":0.00015781049,"threshold_uncertainty_score":0.99976504},"labels":[],"label_agreement":null},{"id":"W2890300132","doi":"10.1190/segam2018-2998507.1","title":"Quantum computing in geophysics: Algorithms, computational costs, and future applications","year":2018,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Speedup; Algorithm; Computational problem; Computational science; Supercomputer; Computational complexity theory; Quantum computer; Seismic wave; Key (lock); Domain (mathematical analysis); Theoretical computer science; Earth science; Parallel computing; Geophysics; Quantum; Geology; Mathematics","score_opus":0.007084124548647286,"score_gpt":0.24624286286123293,"score_spread":0.23915873831258563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890300132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038256135,0.00016853781,0.9576751,0.001959074,0.00027361148,0.00023635598,0.000003515805,0.00025843698,0.0011692264],"genre_scores_gemma":[0.6066454,0.000012112299,0.39090744,0.000862755,0.0015096103,0.000010424445,0.000009943615,0.000013937057,0.000028395234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857366,0.000057852176,0.00026851724,0.00053681433,0.00023088504,0.00033224563],"domain_scores_gemma":[0.999221,0.0001518607,0.000081449754,0.00031843284,0.000120043645,0.00010721128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023680157,0.00017797544,0.00018410258,0.00015293209,0.00029482244,0.00018270963,0.0005070012,0.00006296899,0.000008942339],"category_scores_gemma":[0.0000036867511,0.00016068084,0.00003572957,0.00066014705,0.000132545,0.00017693243,0.00035752243,0.00021865199,0.00003680138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018944074,0.00007585983,0.0005908001,0.0000109414395,0.000010033746,0.0000055311893,0.0006873239,0.0007932419,0.000027481583,0.29110152,0.0003027013,0.7063927],"study_design_scores_gemma":[0.00030053148,0.00006888446,0.01628151,0.000016073694,0.0000016413235,0.00003932395,0.000061706276,0.949958,0.000020062802,0.023363305,0.009680574,0.00020838722],"about_ca_topic_score_codex":0.00008558852,"about_ca_topic_score_gemma":0.000017793396,"teacher_disagreement_score":0.94916475,"about_ca_system_score_codex":0.000036295252,"about_ca_system_score_gemma":0.000058393427,"threshold_uncertainty_score":0.65523744},"labels":[],"label_agreement":null},{"id":"W2890327304","doi":"10.22331/q-2020-01-13-221","title":"Quantum algorithms and lower bounds for convex optimization","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Advanced Scientific Computing Research; Multidisciplinary University Research Initiative; Canadian Institute for Advanced Research; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Omega; Quantum; Convex optimization; Regular polygon; Function (biology); Convex body; Quadratic equation; Mathematics; Quantum algorithm; Convex function; Algorithm; Combinatorics; Quantum computer; Quantum mechanics; Physics; Geometry","score_opus":0.017996414302850382,"score_gpt":0.24258410198601627,"score_spread":0.2245876876831659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890327304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013135984,0.0003374312,0.9753574,0.009646787,0.0007811501,0.00028746834,0.0000125746965,0.000363582,0.00007763659],"genre_scores_gemma":[0.6503319,0.000050961382,0.34464997,0.0040903147,0.00071069074,0.00003353968,0.000019708805,0.000049794282,0.000063109466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842536,0.000047948153,0.00027980207,0.00062361365,0.00022727174,0.0003959936],"domain_scores_gemma":[0.9990668,0.00016502285,0.000111932866,0.00031239004,0.00010058311,0.00024324088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021280731,0.00022394098,0.00027513155,0.000064471,0.00027557224,0.00031192123,0.0005397879,0.000090808324,0.00001059491],"category_scores_gemma":[0.00010242085,0.00020199182,0.00009165287,0.00033044038,0.00007953331,0.00025196935,0.00023607796,0.00017682933,0.000013407612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019894331,0.00039382413,0.00033405048,0.0004860703,0.00021312875,0.00014079626,0.008872412,0.20267111,0.0015751877,0.5664379,0.022330038,0.19634654],"study_design_scores_gemma":[0.00056941045,0.0005245017,0.00007791804,0.00001950025,0.000008788718,0.000019655963,0.00002678688,0.9797705,0.00013033982,0.0052105794,0.013361683,0.00028032952],"about_ca_topic_score_codex":0.000009328918,"about_ca_topic_score_gemma":3.637133e-7,"teacher_disagreement_score":0.7770994,"about_ca_system_score_codex":0.000013327517,"about_ca_system_score_gemma":0.00006561913,"threshold_uncertainty_score":0.82369876},"labels":[],"label_agreement":null},{"id":"W2892601725","doi":"10.1017/9781009261692","title":"Discrete Quantum Walks on Graphs and Digraphs","year":2022,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Quantum walk; Random walk; Quantum algorithm; Quantum; Graph; Discrete mathematics; Relation (database); Quantum computer; Graph theory; Mathematics; Computer science; Theoretical computer science; Algebra over a field; Pure mathematics; Combinatorics; Quantum mechanics; Physics","score_opus":0.010060488067875123,"score_gpt":0.18970410942311944,"score_spread":0.1796436213552443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892601725","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012497755,0.0003285795,0.0066062184,0.00010563649,0.0008746737,0.00046768275,0.00024433513,0.000661489,0.9894616],"genre_scores_gemma":[0.0016683417,0.000094914314,0.0007365599,0.00023502133,0.00008097231,0.0000018044949,0.00004927955,0.00004729466,0.9970858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975168,0.00017107297,0.00020011335,0.0011057389,0.00052274007,0.0004835114],"domain_scores_gemma":[0.9981463,0.00021335302,0.00024264335,0.0010813735,0.000054292836,0.00026204527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017394354,0.0005098991,0.00048015063,0.00045696687,0.00071815995,0.00018876018,0.0017825372,0.00021882847,0.0000017370008],"category_scores_gemma":[0.000008566516,0.00054263655,0.0002871963,0.00006267596,0.000251337,0.0001047775,0.0020676225,0.0011682442,0.0000030826093],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027043463,0.000015322565,0.0000015590003,0.00006025038,0.000087620734,0.0005182398,0.00017118096,0.00007305507,0.000005303674,0.93353266,0.05892285,0.0065849144],"study_design_scores_gemma":[0.00054469856,0.000334872,0.00006396903,0.00014540822,0.00006441613,0.00006552862,0.000019335199,0.026639018,0.000021361966,0.00062942307,0.9707064,0.00076557713],"about_ca_topic_score_codex":0.00007773462,"about_ca_topic_score_gemma":7.6384276e-7,"teacher_disagreement_score":0.93290323,"about_ca_system_score_codex":0.00013879969,"about_ca_system_score_gemma":0.00019736706,"threshold_uncertainty_score":0.9997025},"labels":[],"label_agreement":null},{"id":"W2893036903","doi":"10.1109/dsd.2018.00005","title":"Optimization of Circuits for IBM's Five-Qubit Quantum Computers","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Quantum computer; IBM; Controlled NOT gate; Qubit; Computer science; Electronic circuit; Quantum circuit; Fidelity; Quantum gate; Set (abstract data type); Computer engineering; Quantum; Electrical engineering; Quantum error correction; Physics; Engineering; Quantum mechanics; Telecommunications","score_opus":0.018315360295998263,"score_gpt":0.254833830983043,"score_spread":0.23651847068704476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893036903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043250197,0.00009233336,0.99022853,0.0007065188,0.0031046155,0.00068625837,0.00003453521,0.00036211227,0.0004600826],"genre_scores_gemma":[0.11235538,0.0000169695,0.8864023,0.0003071764,0.00060127367,0.0000349566,0.00006528656,0.000037830276,0.00017883943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976469,0.00008043253,0.0005732266,0.0009412526,0.00035499886,0.0004031436],"domain_scores_gemma":[0.9975342,0.00028787876,0.00049023743,0.0011231082,0.00044783144,0.00011674902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004289944,0.00036683553,0.0005514543,0.00026044738,0.00014224522,0.00021188747,0.0020706211,0.00028208786,0.000012931209],"category_scores_gemma":[0.00006493095,0.00033174432,0.00030077528,0.00025621732,0.000107167485,0.000104115745,0.0018361051,0.00031374887,0.000006102378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004172969,0.00007610508,0.000013023385,0.00026822646,0.0000701652,0.0000021539827,0.0006402577,0.9531587,0.000020175916,0.013603885,0.0047620544,0.02738111],"study_design_scores_gemma":[0.00033380304,0.00021395052,0.00008740653,0.00024821682,0.000016127093,0.000008521174,0.0000060101165,0.9845357,0.0003790649,0.013248671,0.0005454784,0.0003770746],"about_ca_topic_score_codex":0.000056555207,"about_ca_topic_score_gemma":0.0000019719498,"teacher_disagreement_score":0.10803036,"about_ca_system_score_codex":0.0000389042,"about_ca_system_score_gemma":0.00022537741,"threshold_uncertainty_score":0.99991345},"labels":[],"label_agreement":null},{"id":"W2894247456","doi":"10.1103/physrevlett.123.020501","title":"Cellular-Automaton Decoders with Provable Thresholds for Topological Codes","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Army Research Office; Institute for Quantum Information and Matter, California Institute of Technology; Intelligence Advanced Research Projects Activity; Institut Périmètre de physique théorique; National Science Foundation; Government of Canada; Industry Canada; Simons Foundation; U.S. Department of Energy","keywords":"Toric code; Cellular automaton; Computer science; Euclidean geometry; Lattice (music); Code (set theory); Algorithm; Decoding methods; Topology (electrical circuits); Discrete mathematics; Quantum; Physics; Mathematics; Quantum computer; Combinatorics; Quantum mechanics; Geometry","score_opus":0.010479813895527393,"score_gpt":0.2595567823039589,"score_spread":0.24907696840843152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894247456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60462856,0.0017668707,0.37413135,0.017648848,0.00017677668,0.0011479579,0.0000028498757,0.00028721217,0.00020954321],"genre_scores_gemma":[0.895593,0.0001401034,0.07807616,0.025804564,0.0002068971,0.00011344069,0.000007764138,0.000026568998,0.000031484564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985747,0.000057448713,0.00017727153,0.0005180345,0.00026496014,0.00040762784],"domain_scores_gemma":[0.9990392,0.00020942879,0.00009818001,0.00052496855,0.000036794965,0.00009145243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020457234,0.00021097482,0.0004312961,0.000026353819,0.000091045935,0.00008410445,0.00068616855,0.000013480738,0.0000070075416],"category_scores_gemma":[0.000017285436,0.00013307598,0.00017600143,0.00024676826,0.0000636146,0.00014668563,0.00013653617,0.00017630048,0.00006490979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017069902,0.0022980089,0.006008589,0.019260578,0.000687132,0.00022358421,0.0021376896,0.059516605,0.12355999,0.4191437,0.039254386,0.32773906],"study_design_scores_gemma":[0.0006379826,0.0005741737,0.0002528005,0.0013878224,0.000042755237,0.000032326803,0.000004165611,0.9664674,0.0026448308,0.0034981025,0.023852514,0.000605151],"about_ca_topic_score_codex":0.0000041083126,"about_ca_topic_score_gemma":4.3527996e-7,"teacher_disagreement_score":0.9069508,"about_ca_system_score_codex":0.00001991315,"about_ca_system_score_gemma":0.000029656001,"threshold_uncertainty_score":0.5426681},"labels":[],"label_agreement":null},{"id":"W2895285911","doi":"10.1007/jhep04(2019)087","title":"Time evolution of complexity: a critique of three methods","year":2019,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":131,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Perimeter Institute","funders":"Japan Society for the Promotion of Science; Universidad de Murcia; National Research Foundation; Université de Genève; Government of Canada; Institut Périmètre de physique théorique; University of Windsor","keywords":"Computational complexity theory; Hamiltonian (control theory); Fidelity; Time evolution; Physics; Worst-case complexity; Circuit complexity; Algorithm; Function (biology); Time complexity; Statistical physics; Theoretical computer science; Computer science; Quantum mechanics; Mathematics; Mathematical optimization; Electronic circuit","score_opus":0.01505258785666873,"score_gpt":0.27162900609908147,"score_spread":0.25657641824241273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895285911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15429756,0.00016096076,0.8448847,0.00019024403,0.00028366837,0.000019479014,0.0000020374202,0.000010858041,0.000150477],"genre_scores_gemma":[0.6689407,0.000004770623,0.33085057,0.00003198601,0.00014372752,1.5466235e-7,3.449354e-7,0.000006109893,0.000021596852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987921,0.00015939222,0.00044530773,0.000128642,0.0003285239,0.00014602719],"domain_scores_gemma":[0.9984012,0.00020213371,0.00066420995,0.00032543807,0.00035407854,0.00005292127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042934075,0.000111897,0.00042860297,0.000099802244,0.000028095768,0.00001536988,0.0006472919,0.000046475398,0.0000066952966],"category_scores_gemma":[0.00001894986,0.000089999034,0.00019508197,0.00033952002,0.00008173524,0.0002008508,0.00016265218,0.0001729428,0.0000017021498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017222686,0.00014991335,0.00006567615,0.00003544815,0.000079784884,0.0000042257852,0.0001529381,0.027731055,0.013510817,0.9052303,0.00011104809,0.05291157],"study_design_scores_gemma":[0.00032773646,0.00040307187,0.0013238725,0.00010526514,0.000013989459,0.00004088814,0.000005037233,0.33522138,0.02494293,0.6373203,0.00019950923,0.00009600276],"about_ca_topic_score_codex":0.00008506703,"about_ca_topic_score_gemma":0.0000016084902,"teacher_disagreement_score":0.5146432,"about_ca_system_score_codex":0.000031734315,"about_ca_system_score_gemma":0.00013274945,"threshold_uncertainty_score":0.3670054},"labels":[],"label_agreement":null},{"id":"W2897180663","doi":"10.1103/physrevlett.122.120504","title":"Experimental Quantum Switching for Exponentially Superior Quantum Communication Complexity","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Canadian Institute for Advanced Research; Xanadu Quantum Technologies (Canada)","funders":"Australian Research Council; Chinese Academy of Sciences; National Natural Science Foundation of China; National Key Research and Development Program of China; Shanghai Science and Technology Development Foundation","keywords":"Computer science; Quantum; Quantum information science; Quantum computer; Quantum information; Communication complexity; Superposition principle; Quantum superposition; Quantum network; Quantum complexity theory; Coherence (philosophical gambling strategy); Quantum capacity; Theoretical computer science; Quantum error correction; Statistical physics; Quantum mechanics; Physics; Quantum entanglement","score_opus":0.027272424702325177,"score_gpt":0.3033709802503543,"score_spread":0.27609855554802915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897180663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7992061,0.0042014266,0.18341035,0.011719599,0.00035026058,0.0008838569,0.000004141429,0.00019369037,0.000030577638],"genre_scores_gemma":[0.9696283,0.00011982482,0.019982222,0.010001815,0.00015081468,0.000072608374,0.000017010132,0.00002425305,0.0000031732347],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820185,0.00019188091,0.00034591058,0.00052456616,0.00033218332,0.00040359664],"domain_scores_gemma":[0.9983644,0.00028143422,0.00016987148,0.0010316141,0.000044743032,0.00010794688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036047667,0.00025722268,0.00050293806,0.000042826254,0.00025984365,0.00014773947,0.001325933,0.000013479683,0.000011244589],"category_scores_gemma":[0.000029487215,0.00021959117,0.00033358476,0.00021501121,0.000059605823,0.00032099572,0.0004258196,0.0002586646,0.0001089961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003732947,0.00092777004,0.00012804255,0.0021883214,0.00012784975,0.000008271193,0.0037558735,0.0016632595,0.6668123,0.29171062,0.0051084366,0.027531916],"study_design_scores_gemma":[0.00048410564,0.0001612,0.00039687735,0.0010945806,0.000018485463,0.0000116790125,0.000017848064,0.9860878,0.0026936359,0.0032145542,0.0053900513,0.0004291693],"about_ca_topic_score_codex":0.00003204582,"about_ca_topic_score_gemma":5.400362e-7,"teacher_disagreement_score":0.98442453,"about_ca_system_score_codex":0.000046203186,"about_ca_system_score_gemma":0.00002809407,"threshold_uncertainty_score":0.8954668},"labels":[],"label_agreement":null},{"id":"W2898129650","doi":"10.1039/c8sc05592k","title":"Revising the measurement process in the variational quantum eigensolver: is it possible to reduce the number of separately measured operators?","year":2019,"lang":"en","type":"article","venue":"Chemical Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto; OTI Lumionics (Canada); Toronto Public Health","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Process (computing); Quantum; Quantum chemical; Mathematics; Computational chemistry; Computer science; Applied mathematics; Chemistry; Quantum mechanics; Physics; Molecule","score_opus":0.034142447030142214,"score_gpt":0.31050236431477846,"score_spread":0.27635991728463627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898129650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97731346,0.00006539588,0.0048425407,0.015770521,0.00024808236,0.00041843372,0.0000014218587,0.000019742482,0.0013203862],"genre_scores_gemma":[0.9948034,0.0000016849438,0.0028247861,0.0022709558,0.000069412905,0.0000136184,1.6988115e-7,0.000004240144,0.000011681409],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969265,0.000093491806,0.00030500218,0.0005195037,0.0017502871,0.00040522392],"domain_scores_gemma":[0.9984929,0.00016893237,0.00011015768,0.000749859,0.00040293453,0.000075246724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039151986,0.00014330183,0.00015294565,0.000038269325,0.00032323058,0.00034241777,0.0034720981,0.000035993045,0.000020384165],"category_scores_gemma":[0.00030734396,0.00006551793,0.000058597234,0.0022231555,0.00024121274,0.00022312689,0.00034132824,0.00028043965,0.00004940689],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009104764,0.0005648551,0.004921963,0.00014775526,0.00004595985,0.000006920359,0.12391203,0.033096034,0.7360856,0.06953357,0.0064776656,0.025116596],"study_design_scores_gemma":[0.00037885353,0.00006538029,0.008869609,0.00027384143,0.000008502269,0.000056864377,0.0006483606,0.6955967,0.28124788,0.010337321,0.0021013166,0.00041535014],"about_ca_topic_score_codex":0.000030853498,"about_ca_topic_score_gemma":0.0000011743741,"teacher_disagreement_score":0.6625007,"about_ca_system_score_codex":0.0000779734,"about_ca_system_score_gemma":0.0004747481,"threshold_uncertainty_score":0.645208},"labels":[],"label_agreement":null},{"id":"W2898153955","doi":"10.1088/1367-2630/ab8080","title":"VanQver: the variational and adiabatically navigated quantum eigensolver","year":2020,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"QLT (Canada)","funders":"","keywords":"Hamiltonian (control theory); Adiabatic process; Quantum annealing; Adiabatic quantum computation; Quantum; Coherence (philosophical gambling strategy); Coupled cluster; Simulated annealing","score_opus":0.01494496721736162,"score_gpt":0.22729725805777332,"score_spread":0.21235229084041168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898153955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043744717,0.00018967605,0.93965596,0.01603599,0.00025577119,0.000039033435,0.0000014637469,0.000020534733,0.000056842175],"genre_scores_gemma":[0.9079801,0.000019943305,0.08674861,0.003380066,0.0018467442,1.8048082e-7,5.421057e-7,0.000010221068,0.00001358676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999167,0.000053267693,0.00021972685,0.00011501643,0.00031362142,0.00013136728],"domain_scores_gemma":[0.99923205,0.00017481598,0.00018759657,0.00011529623,0.00011609267,0.00017411752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014873101,0.00008980848,0.0001408284,0.000012320251,0.00010467016,0.00012317752,0.00049430213,0.000024003975,0.0000052001774],"category_scores_gemma":[0.00005498194,0.00005631762,0.00007384154,0.00023059668,0.000033734785,0.00017748825,0.000119102195,0.0003165003,0.00000640157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004144644,0.00011339621,0.00043518152,0.000026706199,0.00023334386,0.00009370207,0.0106393695,0.04735323,0.0045248186,0.43370652,0.014837668,0.4879946],"study_design_scores_gemma":[0.00044556512,0.00021755682,0.0019428495,0.000027014028,0.000017747538,0.00008131938,0.000014393634,0.93448806,0.0003555133,0.057887223,0.0044176662,0.00010508383],"about_ca_topic_score_codex":0.0000038079181,"about_ca_topic_score_gemma":1.2665704e-7,"teacher_disagreement_score":0.88713485,"about_ca_system_score_codex":0.0000073078904,"about_ca_system_score_gemma":0.00016592987,"threshold_uncertainty_score":0.22965659},"labels":[],"label_agreement":null},{"id":"W2898444729","doi":"10.1515/spma-2020-0132","title":"Graph isomorphism and Gaussian boson sampling","year":2021,"lang":"en","type":"article","venue":"Special Matrices","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Oak Ridge National Laboratory; U.S. Department of Energy","keywords":"Graph isomorphism; Gaussian; Isospectral; Mathematics; Isomorphism (crystallography); Quantum graph; Discrete mathematics; Graph homomorphism; Graph; Combinatorics; Line graph; Voltage graph; Quantum mechanics; Pure mathematics; Physics","score_opus":0.01315331725089142,"score_gpt":0.24107352153313494,"score_spread":0.22792020428224352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898444729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66429436,0.005219093,0.30590707,0.007630467,0.0035280734,0.00015384305,0.000009780213,0.000444483,0.012812821],"genre_scores_gemma":[0.67003053,0.00045386105,0.32054958,0.0007206796,0.007908028,0.000004267925,0.0000052852256,0.000025692654,0.00030210763],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902695,0.000037650847,0.00014428585,0.0003627168,0.00019273035,0.00023566722],"domain_scores_gemma":[0.9994717,0.000080604856,0.00006010344,0.00025944048,0.000037396523,0.00009074922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109700304,0.00011466083,0.00014294196,0.000094223185,0.00022043867,0.00033248338,0.00030148283,0.000045168206,0.000031462747],"category_scores_gemma":[0.000025222129,0.000103217135,0.00005155641,0.00050485454,0.00003412099,0.00014353389,0.00028275818,0.00014281645,0.000016612004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008549525,0.00011787824,0.0029027087,0.000094811636,0.000049924503,0.00049417303,0.0028771874,0.00061672326,0.0022067747,0.31897265,0.0032390342,0.6684196],"study_design_scores_gemma":[0.0018674135,0.00037032377,0.08422118,0.00032739653,0.00006062654,0.001291497,0.00051063247,0.113153994,0.008770919,0.4885045,0.2988375,0.0020840294],"about_ca_topic_score_codex":0.000018951565,"about_ca_topic_score_gemma":0.000010235024,"teacher_disagreement_score":0.6663356,"about_ca_system_score_codex":0.000008413938,"about_ca_system_score_gemma":0.00004314789,"threshold_uncertainty_score":0.42090726},"labels":[],"label_agreement":null},{"id":"W2898669091","doi":"10.1109/lawp.2018.2877448","title":"Guest Editorial Special Cluster on Magnetless Nonreciprocity in Electromagnetics","year":2018,"lang":"en","type":"editorial","venue":"IEEE Antennas and Wireless Propagation Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Killam Trusts","keywords":"Electromagnetics; Electromagnetism; Physics; Atom optics; Reciprocity (cultural anthropology); Theory of relativity; Special relativity; Cosmology; Theoretical physics; Classical mechanics; Quantum mechanics; Engineering physics","score_opus":0.004958218805300963,"score_gpt":0.221621809877916,"score_spread":0.21666359107261504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898669091","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03880153,0.000025040734,0.0075988537,0.0017033785,0.95115995,0.00046121737,0.000031654108,0.00013129576,0.00008707282],"genre_scores_gemma":[0.0038041146,0.000084168954,0.00094120845,0.00057213614,0.9943386,0.000032958447,0.000063616964,0.000055281213,0.000107957916],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995847,0.00026719185,0.0006324801,0.0012600849,0.0012619084,0.00073135836],"domain_scores_gemma":[0.9980882,0.00046379986,0.00038894342,0.000616295,0.00029086307,0.00015192175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007212001,0.0006086239,0.00062358537,0.00039650532,0.00026531462,0.00059591135,0.0010183399,0.0007446917,0.0000049061605],"category_scores_gemma":[0.00012573386,0.00054305414,0.00012253056,0.00044541495,0.0002393502,0.00026464288,0.00022327491,0.001606639,0.000039192226],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096492986,0.00008452707,0.0000058265678,0.00008006763,0.000015947364,0.000043980654,0.00046926376,0.00005711685,0.001703756,0.000052349693,0.9918675,0.005523161],"study_design_scores_gemma":[0.002549374,0.0016516437,0.0001226539,0.0007630844,0.000030899795,0.000015032597,0.0000111201725,0.072514996,0.0010763158,0.00035358377,0.91940683,0.0015044581],"about_ca_topic_score_codex":0.00008285701,"about_ca_topic_score_gemma":0.0000862771,"teacher_disagreement_score":0.07246067,"about_ca_system_score_codex":0.00013472918,"about_ca_system_score_gemma":0.00021051613,"threshold_uncertainty_score":0.9997021},"labels":[],"label_agreement":null},{"id":"W2898924064","doi":"10.1103/physreva.99.052348","title":"Bounds on entanglement catalysts","year":2019,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum entanglement; Dimension (graph theory); Transformation (genetics); Qubit; State (computer science); LOCC; Mathematics; Upper and lower bounds; Discrete mathematics; Pure mathematics; Quantum mechanics; Quantum; Physics; Algorithm; Mathematical analysis","score_opus":0.00947888733096274,"score_gpt":0.3304648870243791,"score_spread":0.32098599969341635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898924064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73740935,0.1771343,0.020470858,0.031655908,0.0021832087,0.007703759,0.00005806323,0.0013352097,0.02204935],"genre_scores_gemma":[0.9458666,0.03179157,0.0016582684,0.019099815,0.0010388254,0.00020314156,0.000041791747,0.00006836836,0.00023165217],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99583817,0.00033244357,0.00061113946,0.001230794,0.0012067874,0.0007806872],"domain_scores_gemma":[0.99671566,0.00044777448,0.00034212932,0.0019860142,0.00012743988,0.00038096562],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005204386,0.0005961431,0.0014951113,0.000060284725,0.00014731432,0.00012064522,0.0018332324,0.000031309224,0.00003113084],"category_scores_gemma":[0.00020870056,0.0004244941,0.0009430023,0.0010773579,0.00007531264,0.0002618412,0.00067790085,0.0006625539,0.004258438],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001692161,0.0036084792,0.00021862407,0.017211929,0.00024794685,0.00008195712,0.00042778393,0.00014787409,0.01042728,0.2298793,0.03844434,0.69928753],"study_design_scores_gemma":[0.0013275077,0.002689576,0.0015628964,0.06149314,0.00048823855,0.00006352626,0.000005224647,0.18364678,0.013938487,0.07932951,0.6524384,0.003016726],"about_ca_topic_score_codex":0.000012321806,"about_ca_topic_score_gemma":7.279352e-7,"teacher_disagreement_score":0.6962708,"about_ca_system_score_codex":0.00010805288,"about_ca_system_score_gemma":0.00010224415,"threshold_uncertainty_score":0.9998207},"labels":[],"label_agreement":null},{"id":"W2899163859","doi":"10.22331/q-2019-05-20-143","title":"Fault-tolerant magic state preparation with flag qubits","year":2019,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MAGIC (telescope); Qubit; State (computer science); Distillation; Overhead (engineering); Quantum computer; Scheme (mathematics)","score_opus":0.005147332006206161,"score_gpt":0.21867599654062417,"score_spread":0.21352866453441802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899163859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7809899,0.00008151401,0.2163466,0.0005982413,0.00045689728,0.00024329736,0.0000023941598,0.00027975618,0.0010014283],"genre_scores_gemma":[0.9832843,0.000004178734,0.015253444,0.000276944,0.00006830887,0.000004926636,0.00000446194,0.000017067201,0.0010863947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984301,0.000071756636,0.00022355077,0.0005248025,0.0003666216,0.00038319733],"domain_scores_gemma":[0.9989763,0.00006357726,0.00012010493,0.00066310435,0.00007886656,0.00009805101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021678528,0.00019639415,0.00020656998,0.00009230361,0.000099953504,0.0002049024,0.00059424015,0.00004156212,0.000019733247],"category_scores_gemma":[0.0000069398698,0.00014271593,0.000052481893,0.00034671347,0.000030280675,0.00029241075,0.00014096787,0.0002012827,0.0005738085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048717036,0.0008390296,0.008373368,0.00043369018,0.00028366668,0.00048811047,0.024290178,0.5288707,0.013869337,0.19269493,0.007828235,0.2215416],"study_design_scores_gemma":[0.00044241597,0.0004981725,0.0023063119,0.000059795984,0.0000032924834,0.00006191479,0.000015352522,0.9855816,0.0009701868,0.0039841933,0.0058080773,0.0002687047],"about_ca_topic_score_codex":0.00004315096,"about_ca_topic_score_gemma":0.000011803402,"teacher_disagreement_score":0.4567109,"about_ca_system_score_codex":0.000022585471,"about_ca_system_score_gemma":0.00008715465,"threshold_uncertainty_score":0.73753387},"labels":[],"label_agreement":null},{"id":"W2899409620","doi":"10.26421/qic19.7-8","title":"A Complete Characterization of Pretty Good State Transfer on Paths","year":2019,"lang":"en","type":"paratext","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum walk; Oracle; Quantum; Markov chain; Logarithm; Quantum algorithm; Dimension (graph theory); Computer science; Mathematics; Theoretical computer science; Graph; Quantum computer; Algorithm; Combinatorics","score_opus":0.010680300764462325,"score_gpt":0.2285339317723246,"score_spread":0.21785363100786226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899409620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052002836,0.00004708744,0.9413886,0.0002656308,0.0020301025,0.0006804745,0.00040248674,0.00010805393,0.0030747287],"genre_scores_gemma":[0.98394126,0.00036538494,0.00507332,0.0016879624,0.00020579534,0.000042314634,0.007073309,0.00005384901,0.0015568066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978411,0.00014068368,0.0008812166,0.00033621333,0.0005264814,0.000274311],"domain_scores_gemma":[0.99865294,0.00012352098,0.00053683226,0.0003403806,0.00025886451,0.000087451735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026509844,0.00036948101,0.0004935374,0.00047642516,0.00014321895,0.00031514312,0.0004057157,0.0001958877,0.000019378305],"category_scores_gemma":[0.000009677909,0.00033799178,0.000114019334,0.0003878171,0.00004748032,0.0009061548,0.00010439671,0.00037117943,0.00072315626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013746617,0.00019248915,0.000014255738,0.002145316,0.00015716597,0.0000020822615,0.011275493,0.11660178,0.0020790002,0.040327184,0.0036174795,0.82345027],"study_design_scores_gemma":[0.00067643746,0.00051732676,0.0010631802,0.00033075616,0.000009443655,0.000010936741,0.000014766188,0.96323085,0.0002021198,0.0008136987,0.032738004,0.00039249432],"about_ca_topic_score_codex":0.00001830932,"about_ca_topic_score_gemma":4.237423e-7,"teacher_disagreement_score":0.9363153,"about_ca_system_score_codex":0.00003804887,"about_ca_system_score_gemma":0.00013747271,"threshold_uncertainty_score":0.9999072},"labels":[],"label_agreement":null},{"id":"W2899524259","doi":"10.1145/3290344","title":"Quantitative robustness analysis of quantum programs","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Wind Energy Technologies Office; Office of Science; Canadian Institute for Advanced Research; Advanced Scientific Computing Research; U.S. Department of Energy","keywords":"Robustness (evolution); Quantum computer; Quantum; Quantum logic; Computation; Quantum algorithm; Quantum error correction; Property (philosophy)","score_opus":0.013642235190661834,"score_gpt":0.2654272453488792,"score_spread":0.25178501015821736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899524259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995248,0.00019891934,0.0026495866,0.0009298214,0.0001514219,0.00042412404,0.000002574226,0.00015321284,0.00024231813],"genre_scores_gemma":[0.8857912,0.0000030335243,0.11404853,0.000031870215,0.000017392465,0.000013870949,0.0000016494756,0.000013285515,0.00007918622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982888,0.000020144096,0.00036332256,0.00045121,0.0005373238,0.00033920005],"domain_scores_gemma":[0.99810785,0.00017592678,0.0005456127,0.0008205533,0.0002976924,0.00005233935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005496415,0.00020574432,0.00046809588,0.0003364976,0.000081988976,0.00011910519,0.0034976688,0.000069897505,0.0000037810755],"category_scores_gemma":[0.00044604478,0.00013180802,0.00034410655,0.0025938512,0.00012011223,0.00016667458,0.001091024,0.00022708386,0.0000026717087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012976333,0.0012037008,0.086330526,0.0009357152,0.0024943876,0.0000044700664,0.014504205,0.021324627,0.014097167,0.32337508,0.00019745508,0.5354029],"study_design_scores_gemma":[0.0006346708,0.0017527831,0.02417737,0.00066143565,0.00048365098,0.000011310365,0.0029624086,0.9390508,0.02575436,0.0033097318,0.00059377047,0.0006076994],"about_ca_topic_score_codex":0.00004811366,"about_ca_topic_score_gemma":0.0000021707233,"teacher_disagreement_score":0.91772616,"about_ca_system_score_codex":0.000017196915,"about_ca_system_score_gemma":0.000025348985,"threshold_uncertainty_score":0.6499597},"labels":[],"label_agreement":null},{"id":"W2900580483","doi":"10.1103/physrevlett.123.070507","title":"Towards Low Overhead Magic State Distillation","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Seventh Framework Programme; Agence Nationale de la Recherche","keywords":"Distillation; MAGIC (telescope); Prime (order theory); Conjecture; Dimension (graph theory); Prime factor; Overhead (engineering); State (computer science); Quantum computer; Physics; Bounded function; Combinatorics; Discrete mathematics; Quantum; Mathematics; Computer science; Quantum mechanics; Algorithm; Mathematical analysis; Chemistry","score_opus":0.007514099497774103,"score_gpt":0.25735328396905544,"score_spread":0.24983918447128134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900580483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79662067,0.002337801,0.17704435,0.022111716,0.0005469684,0.00049570895,0.0000045507936,0.00024029697,0.0005979766],"genre_scores_gemma":[0.9698062,0.00046851364,0.005615131,0.023836913,0.00021263663,0.0000057922302,0.000005406069,0.000015433114,0.000033958444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987932,0.00007633693,0.00017152984,0.0003730041,0.00031933773,0.00026660692],"domain_scores_gemma":[0.99923944,0.00007292465,0.00009050402,0.0004927992,0.000024337884,0.000079980506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013930978,0.00015742869,0.0002840054,0.000026300155,0.00003653765,0.000072458846,0.00048562742,0.000005146599,0.0000119727],"category_scores_gemma":[0.0000184232,0.00011924464,0.0001531469,0.000295597,0.000024233597,0.00016707083,0.00017092018,0.0001748974,0.00060294237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062594677,0.00021415048,0.0005553227,0.002937042,0.00005874941,0.000039682658,0.00076652627,0.022734363,0.011233524,0.011169039,0.009956128,0.9403292],"study_design_scores_gemma":[0.0002044274,0.000068375244,0.008040938,0.0013471708,0.000011260721,0.000009668704,4.2479923e-7,0.96936363,0.00022506797,0.0031078404,0.01725395,0.0003672506],"about_ca_topic_score_codex":0.000008692328,"about_ca_topic_score_gemma":1.4743009e-7,"teacher_disagreement_score":0.9466293,"about_ca_system_score_codex":0.000026949328,"about_ca_system_score_gemma":0.000020310508,"threshold_uncertainty_score":0.77498055},"labels":[],"label_agreement":null},{"id":"W2901383498","doi":"10.1103/physrevlett.122.200501","title":"Neural Belief-Propagation Decoders for Quantum Error-Correcting Codes","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Institut quantique; Université de Sherbrooke","funders":"Canada First Research Excellence Fund; Canada Foundation for Innovation","keywords":"Quantum; Computer science; Belief propagation; Quantum error correction; Algorithm; Physics; Quantum mechanics; Statistical physics; Quantum computer; Decoding methods","score_opus":0.016829676153427564,"score_gpt":0.28912322967350806,"score_spread":0.2722935535200805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901383498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6353681,0.0013238472,0.3451292,0.01636417,0.0008219131,0.00074897596,0.0000025458328,0.00021573843,0.000025521314],"genre_scores_gemma":[0.96732545,0.000086192274,0.0116701415,0.020476319,0.0003501381,0.000048843438,0.000008886325,0.000023966182,0.000010068899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849224,0.00010093854,0.00025207506,0.00050608197,0.00026089785,0.0003877941],"domain_scores_gemma":[0.9988506,0.00040139395,0.00016540907,0.0004492986,0.00005109936,0.000082211394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029494314,0.00020711089,0.00038060916,0.00004169508,0.00013325464,0.00009161733,0.0006214249,0.000010863958,0.0000029776736],"category_scores_gemma":[0.00008979353,0.00016652363,0.00025499956,0.00029687127,0.00003033308,0.00022796547,0.00013826154,0.00021594827,0.000075812524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002054838,0.00027121513,0.00068509975,0.0050103674,0.00010482185,0.000012959709,0.0014162919,0.06596548,0.031451005,0.014368235,0.0117272185,0.86896676],"study_design_scores_gemma":[0.00017636832,0.00009193663,0.00028162793,0.0005898936,0.000015985932,0.000011020345,0.0000047532853,0.9953687,0.00038361462,0.0007714584,0.0020645815,0.00024004646],"about_ca_topic_score_codex":0.00000962826,"about_ca_topic_score_gemma":8.266848e-7,"teacher_disagreement_score":0.92940325,"about_ca_system_score_codex":0.000028175426,"about_ca_system_score_gemma":0.00002078291,"threshold_uncertainty_score":0.6790637},"labels":[],"label_agreement":null},{"id":"W2901502347","doi":"10.1109/focs.2019.00062","title":"Exponential Separation between Quantum Communication and Logarithm of Approximate Rank","year":2019,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"QuantERA; Environment and Climate Change Canada","keywords":"Logarithm; Conjecture; Mathematics; Boolean function; Rank (graph theory); Combinatorics; Polynomial; Communication complexity; Upper and lower bounds; Exponential function; Discrete mathematics; Mathematical analysis","score_opus":0.010681191442716235,"score_gpt":0.25276461272898076,"score_spread":0.24208342128626453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901502347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.562728,0.00007241632,0.43601638,0.00035288418,0.00006537765,0.000113504684,0.0000011683946,0.00006627452,0.0005840087],"genre_scores_gemma":[0.93134356,0.00001040358,0.06850746,0.000033703072,0.000022350696,0.0000016068343,0.0000070160504,0.0000041676894,0.00006974898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923563,0.0000793434,0.00020101084,0.00020767369,0.00015154018,0.00012479363],"domain_scores_gemma":[0.99922514,0.0001082744,0.00010220608,0.00048335904,0.000044559838,0.0000364598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002932985,0.00008418322,0.00015909006,0.000069654416,0.00006562085,0.00006336052,0.00040342484,0.00004583395,0.000009478407],"category_scores_gemma":[0.000006748396,0.00007059337,0.000031967633,0.00014230727,0.000038757415,0.00019004666,0.00029467215,0.00009979163,0.000012134133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039903636,0.0002615842,0.030735102,0.0002993653,0.00015483164,0.0000029959194,0.007468489,0.0065956134,0.019390728,0.5523617,0.0007424304,0.38194725],"study_design_scores_gemma":[0.00037839205,0.00008473474,0.011496731,0.000023143795,0.000004322393,0.0000053810695,0.000017789713,0.97782046,0.0028324083,0.0069431905,0.00028458983,0.0001088681],"about_ca_topic_score_codex":0.00006595086,"about_ca_topic_score_gemma":0.0000016515264,"teacher_disagreement_score":0.97122484,"about_ca_system_score_codex":0.0000052175883,"about_ca_system_score_gemma":0.000016205113,"threshold_uncertainty_score":0.28787142},"labels":[],"label_agreement":null},{"id":"W2902397160","doi":"10.1139/cjp-2018-0452","title":"Additive composition formulation of the iterative Grover algorithm","year":2018,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University; Redeemer University","funders":"Japan Society for the Promotion of Science","keywords":"Superposition principle; Algorithm; Physics; Rotation (mathematics); Search algorithm; Phase (matter); Operator (biology); Mathematics; Quantum mechanics; Geometry","score_opus":0.007626706953568936,"score_gpt":0.2130652140179394,"score_spread":0.20543850706437047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902397160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10088148,0.000030537227,0.8972995,0.0004766239,0.0008842223,0.0000628121,0.000029446677,0.000004402071,0.00033097333],"genre_scores_gemma":[0.9739139,4.1919344e-7,0.025214242,0.00020577639,0.00064819277,1.9770211e-7,0.0000011166356,0.00000415329,0.000011981963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994015,0.000053988348,0.00017811822,0.00007537241,0.00015484428,0.00013614711],"domain_scores_gemma":[0.9990087,0.000044685574,0.00026870146,0.00015102062,0.000411115,0.00011575217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010298231,0.00007010801,0.000107779226,0.000055419525,0.00018223978,0.000054148066,0.00040367525,0.000024409163,0.0000053306726],"category_scores_gemma":[0.000012096135,0.000049002418,0.000089457346,0.00028009783,0.000092141905,0.00025504178,0.000027365266,0.00014738018,0.00000224382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053435324,0.000040597162,0.00036805373,0.000009077723,0.00009272901,0.000021895217,0.013699682,0.0032510152,0.0016145868,0.0677327,0.0031906685,0.9099737],"study_design_scores_gemma":[0.0005769558,0.00059541385,0.019814678,0.0002925409,0.000025485795,0.00014729584,0.00006636139,0.86278087,0.04992111,0.062057167,0.003483205,0.00023892222],"about_ca_topic_score_codex":0.00021610038,"about_ca_topic_score_gemma":0.00018113258,"teacher_disagreement_score":0.9097347,"about_ca_system_score_codex":0.000054285225,"about_ca_system_score_gemma":0.00039067768,"threshold_uncertainty_score":0.19982606},"labels":[],"label_agreement":null},{"id":"W2902654239","doi":"10.1103/physrevlett.122.210502","title":"Sample Complexity of Device-Independently Certified “Quantum Supremacy”","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Army Research Office; Seventh Framework Programme; Generalitat de Catalunya; Narodowe Centrum Nauki; Agència de Gestió d'Ajuts Universitaris i de Recerca; H2020 Marie Skłodowska-Curie Actions; Ministerio de Economía y Competitividad; Horizon 2020 Framework Programme; John Templeton Foundation; Deutsche Forschungsgemeinschaft; H2020 European Research Council; Fundación Cellex","keywords":"Mathematical proof; Sampling (signal processing); Computer science; Quantum; Property (philosophy); Polynomial; Sample (material); Applied mathematics; Statistical physics; Algorithm; Mathematics; Quantum mechanics; Physics; Mathematical analysis; Telecommunications","score_opus":0.03458007956315768,"score_gpt":0.29232107609405816,"score_spread":0.2577409965309005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902654239","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86163384,0.0018865038,0.116918504,0.018033644,0.00046370964,0.0006567901,0.000015190506,0.00018936406,0.00020248836],"genre_scores_gemma":[0.9816137,0.0001286096,0.0088801505,0.009232009,0.00011214958,0.0000075262665,0.000007468911,0.0000148914805,0.0000035036671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808747,0.00016328057,0.000366179,0.0005035406,0.00050605304,0.00037350913],"domain_scores_gemma":[0.99835205,0.00036996548,0.00021374812,0.0008907552,0.00005958135,0.00011389407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026988483,0.00022497102,0.00060774153,0.000048808717,0.000059158498,0.000044732693,0.0011691811,0.00001205804,0.00003252825],"category_scores_gemma":[0.00006310953,0.0001793553,0.00029795596,0.00043214613,0.00009759287,0.00016797615,0.00038389978,0.00027316844,0.00018586867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057107794,0.002108928,0.0061386786,0.01894006,0.0005497922,0.000077694516,0.002917536,0.017821563,0.17117782,0.5634316,0.016838936,0.19994026],"study_design_scores_gemma":[0.00041723353,0.00013586188,0.006374026,0.0017028252,0.000038109574,0.000014680803,0.0000033170088,0.96739876,0.0021601773,0.013239602,0.008008799,0.0005065884],"about_ca_topic_score_codex":0.00007720577,"about_ca_topic_score_gemma":0.0000011991413,"teacher_disagreement_score":0.9495772,"about_ca_system_score_codex":0.000023648181,"about_ca_system_score_gemma":0.00003212435,"threshold_uncertainty_score":0.7313897},"labels":[],"label_agreement":null},{"id":"W2902765729","doi":"10.1103/physrevlett.123.220502","title":"Variational Thermal Quantum Simulation via Thermofield Double States","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Government of Canada","keywords":"Hamiltonian (control theory); Physics; Quantum; Ising model; Fidelity; Simple (philosophy); Thermal; Statistical physics; High fidelity; Quantum simulator; Quantum mechanics; Quantum computer; Computer science; Mathematical optimization; Mathematics; Thermodynamics","score_opus":0.011316125833626145,"score_gpt":0.2700294904543518,"score_spread":0.2587133646207257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902765729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50976455,0.00080284144,0.4747485,0.013631981,0.00034692668,0.00038011692,0.0000013486894,0.00015733538,0.00016640594],"genre_scores_gemma":[0.9816041,0.00005131827,0.0025064324,0.015563923,0.00023681732,0.000009328735,0.000007736015,0.000010998074,0.000009331581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884063,0.00007643884,0.00018906633,0.00033367367,0.00032150053,0.00023868006],"domain_scores_gemma":[0.999104,0.00029275837,0.0001059933,0.00040423957,0.000035636007,0.000057332505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018173747,0.00015181929,0.00023698226,0.000026528098,0.00006420677,0.0000679273,0.0004921042,0.000009687312,0.000038400533],"category_scores_gemma":[0.000007957694,0.00011334321,0.00013858046,0.00022497537,0.000017562568,0.00021046276,0.00012917047,0.0001852036,0.00031379337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000110715355,0.00014043078,0.00024040311,0.00039479104,0.00005076706,0.0000066024554,0.000590444,0.9147765,0.01224522,0.018895501,0.0005969635,0.052051302],"study_design_scores_gemma":[0.00019392316,0.000036982652,0.0014557326,0.00019003716,0.00000785266,0.000001644038,4.335469e-7,0.9942648,0.00008865907,0.0018069894,0.0017916635,0.00016132445],"about_ca_topic_score_codex":0.00001474889,"about_ca_topic_score_gemma":9.656503e-8,"teacher_disagreement_score":0.47224206,"about_ca_system_score_codex":0.000016054042,"about_ca_system_score_gemma":0.000016577198,"threshold_uncertainty_score":0.4622002},"labels":[],"label_agreement":null},{"id":"W2903221501","doi":"10.1103/physreva.99.032331","title":"Evaluating analytic gradients on quantum hardware","year":2019,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1053,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Quantum computer; Computer science; Quantum circuit; Quantum; Computation; Qubit; Electronic circuit; Quantum algorithm; Quantum gate; Function (biology); Algorithm; Quantum error correction; Theoretical computer science; Computer engineering; Topology (electrical circuits); Mathematics; Quantum mechanics; Physics","score_opus":0.030783315549239194,"score_gpt":0.39309661510730454,"score_spread":0.36231329955806535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903221501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91660744,0.055305872,0.013113997,0.0068265907,0.0009879054,0.0035447353,0.000021840198,0.0006410727,0.0029505747],"genre_scores_gemma":[0.968031,0.01739488,0.0025580332,0.010712934,0.00087718293,0.00015774833,0.000026685935,0.00008303345,0.0001585417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452573,0.00065261516,0.0007618327,0.001536274,0.0015978557,0.00092568423],"domain_scores_gemma":[0.9958381,0.0008431718,0.00049765926,0.0021472343,0.00023916409,0.00043467784],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009957473,0.0006940327,0.0018873565,0.000088664536,0.00019971734,0.00013254015,0.0020446947,0.000039861996,0.000032531974],"category_scores_gemma":[0.00091297406,0.0004989821,0.0011779212,0.0015850354,0.000081164486,0.00031802023,0.00064816955,0.00090694474,0.0035197355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023542729,0.0027554105,0.00033611356,0.020997768,0.00027577786,0.00006500169,0.00041045525,0.0015015776,0.0077359113,0.17987259,0.008170511,0.77785534],"study_design_scores_gemma":[0.00045929453,0.0012391793,0.0009409545,0.030048722,0.00023461958,0.000016735126,0.0000018520927,0.90526295,0.00076060294,0.043139495,0.01693913,0.00095646887],"about_ca_topic_score_codex":0.000010280703,"about_ca_topic_score_gemma":3.6368556e-7,"teacher_disagreement_score":0.9037614,"about_ca_system_score_codex":0.00010392325,"about_ca_system_score_gemma":0.00012408722,"threshold_uncertainty_score":0.9997462},"labels":[],"label_agreement":null},{"id":"W2903600347","doi":"10.1371/journal.pone.0208073","title":"Quantum++: A modern C++ quantum computing library","year":2018,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Industry Canada","keywords":"Toffoli gate; Quantum computer; Computer science; Qubit; Header; Quantum information; Quantum; One-way quantum computer; Software portability; Quantum gate; Quantum circuit; Reversible computing; Theoretical computer science; Quantum error correction; Computational science; Parallel computing; Physics; Quantum mechanics; Programming language","score_opus":0.029609322751162053,"score_gpt":0.22106531780829658,"score_spread":0.19145599505713454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903600347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5841132,0.00020331149,0.41078246,0.0019135756,0.0002328529,0.00015763604,0.0000036041793,0.0011115518,0.0014818134],"genre_scores_gemma":[0.8230753,0.000008404235,0.17489919,0.0008999377,0.0009064207,0.0000030766157,0.0000037313393,0.0000341914,0.00016974506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773216,0.00011236664,0.00033774375,0.0006759361,0.0005326365,0.0006091744],"domain_scores_gemma":[0.9985369,0.0001703332,0.0001368195,0.0008655335,0.000089050096,0.00020135213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021652781,0.00025408014,0.00033825228,0.0001677977,0.00040059045,0.0003551469,0.0014420631,0.000091423826,0.00003361931],"category_scores_gemma":[0.000050645613,0.0002332128,0.0000911065,0.0005931577,0.00013521542,0.0004656126,0.00093830464,0.00033660035,0.00028513133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011742052,0.009534065,0.006411386,0.0006714485,0.0012297258,0.00037803312,0.024373595,0.0016823612,0.07842779,0.41250804,0.008951249,0.45571488],"study_design_scores_gemma":[0.00025389038,0.00030066544,0.0007392702,0.00023041962,0.000013504576,0.000014796125,0.000008435902,0.95875883,0.008518245,0.030481607,0.00036282765,0.00031753146],"about_ca_topic_score_codex":0.000011808998,"about_ca_topic_score_gemma":9.556229e-7,"teacher_disagreement_score":0.95707643,"about_ca_system_score_codex":0.000014932623,"about_ca_system_score_gemma":0.00008827157,"threshold_uncertainty_score":0.9510142},"labels":[],"label_agreement":null},{"id":"W2903762116","doi":"10.1371/journal.pone.0208561","title":"Open source software in quantum computing","year":2018,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":175,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Creative Destruction Lab; University of Toronto; Perimeter Institute; ProteinQure (Canada)","funders":"","keywords":"Computer science; Quantum computer; Toolchain; Software; Software engineering; Quantum; Quantum information; Programming language; Physics","score_opus":0.03965382579079657,"score_gpt":0.25269175476623135,"score_spread":0.21303792897543478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903762116","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67411727,0.000049102196,0.32375723,0.00090741285,0.00011624267,0.00021426537,9.1085485e-7,0.00031167714,0.0005258793],"genre_scores_gemma":[0.7075313,0.0000014082328,0.29141182,0.00060452265,0.0002758345,0.0000032928745,0.0000012261401,0.000016087586,0.00015452251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840176,0.000093623086,0.00025299386,0.00051085924,0.0003134318,0.000427359],"domain_scores_gemma":[0.99896485,0.00015691521,0.00009396398,0.0005993922,0.000087724955,0.00009717389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044867102,0.00015025106,0.00026575394,0.00012481942,0.0002265517,0.00038051096,0.0023452593,0.00005599694,0.000016101465],"category_scores_gemma":[0.00013626664,0.00014218883,0.00003213163,0.0005620053,0.00007092754,0.00023020631,0.0021862974,0.00025935867,0.00015300003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008042402,0.008563212,0.06037845,0.00039180528,0.0004147447,0.00023518043,0.029588992,0.0072987955,0.009325103,0.029213056,0.0030658855,0.85144436],"study_design_scores_gemma":[0.00038815383,0.00020013383,0.00510659,0.0003301619,0.0000046001073,0.0000074050345,0.000016455391,0.98759735,0.0023468449,0.0033340924,0.00042696114,0.00024123471],"about_ca_topic_score_codex":0.00013340615,"about_ca_topic_score_gemma":0.000026540158,"teacher_disagreement_score":0.9802986,"about_ca_system_score_codex":0.000029422537,"about_ca_system_score_gemma":0.00006257128,"threshold_uncertainty_score":0.5798292},"labels":[],"label_agreement":null},{"id":"W2904612278","doi":"10.1007/s11005-019-01180-0","title":"Lower bounds on the localisation length of balanced random quantum walks","year":2019,"lang":"en","type":"article","venue":"Letters in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Centre de Recherches Mathématiques","keywords":"Quantum walk; Random walk; Upper and lower bounds; Tree (set theory); Homogeneous; Quantum","score_opus":0.00895964868794846,"score_gpt":0.21624610246262574,"score_spread":0.20728645377467728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904612278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5207803,0.0000032567943,0.47428486,0.004080339,0.0001898046,0.00017432286,6.087682e-7,0.000033852637,0.00045264422],"genre_scores_gemma":[0.99000674,6.584038e-7,0.0073839887,0.0024934295,0.000085251406,0.0000067966025,7.6214224e-7,0.000010442575,0.000011900726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878615,0.000108033964,0.00027140087,0.0002438772,0.00036137525,0.0002291348],"domain_scores_gemma":[0.9983578,0.0008788581,0.00010786053,0.0006083916,0.000020347912,0.000026753785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040317132,0.0001408276,0.00026167958,0.000033590753,0.00004345755,0.00005754362,0.00060806185,0.000038140202,0.000012638618],"category_scores_gemma":[0.000055060904,0.00008831379,0.00009891644,0.00027550536,0.000084448664,0.00008721593,0.000111095374,0.00028277072,0.00008215699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037955208,0.00033251004,0.00012693649,0.0001305876,0.000028631488,0.000007511262,0.0022059933,0.027996121,0.006740555,0.9528076,0.00074844656,0.008837148],"study_design_scores_gemma":[0.00047771135,0.00006046665,0.00018712088,0.00013007528,0.0000024377966,0.0000014552005,0.000010902032,0.7861216,0.0011015149,0.21175021,0.000048711507,0.00010780448],"about_ca_topic_score_codex":0.0000025714871,"about_ca_topic_score_gemma":1.1438348e-7,"teacher_disagreement_score":0.7581255,"about_ca_system_score_codex":0.000022114797,"about_ca_system_score_gemma":0.000013199692,"threshold_uncertainty_score":0.36013317},"labels":[],"label_agreement":null},{"id":"W2905703022","doi":"10.1103/physrevlett.123.030502","title":"Experimental Implementation of Efficient Quantum Pseudorandomness on a 12-Spin System","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Perimeter Institute; University of Waterloo","funders":"Guangdong Innovative and Entrepreneurial Research Team Program; Natural Sciences and Engineering Research Council of Canada; Science, Technology and Innovation Commission of Shenzhen Municipality; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Pseudorandomness; Quantum technology; Open quantum system; Quantum computer; Quantum error correction; Physics; Quantum; Computer science; Quantum network; Qubit; Quantum mechanics; Statistical physics; Pseudorandom number generator; Algorithm","score_opus":0.010465725661377248,"score_gpt":0.29708611529091483,"score_spread":0.28662038962953756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905703022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97804797,0.000809492,0.018735398,0.0013519016,0.00033700786,0.0005761167,0.0000027608128,0.00008107982,0.00005829908],"genre_scores_gemma":[0.9971442,0.0000127589055,0.00068000716,0.002046152,0.000077482604,0.000026106225,0.000002490471,0.000009768829,9.846938e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985717,0.00013521836,0.00029178866,0.00036580805,0.0004060356,0.00022944825],"domain_scores_gemma":[0.99916804,0.000101437254,0.00018809341,0.00046139228,0.000021755277,0.000059299637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021291473,0.00016788921,0.00040708148,0.000045426546,0.000045868477,0.000029969518,0.0004681356,0.0000062534873,0.0000058245278],"category_scores_gemma":[0.000004427189,0.00012670892,0.00019635544,0.00021717073,0.00002514258,0.00005187327,0.00012285529,0.000110004104,0.000089991794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104075865,0.0018053958,0.0003985217,0.01307484,0.0002404486,0.00006749124,0.005812083,0.068188086,0.5640775,0.2480813,0.0037208924,0.094429374],"study_design_scores_gemma":[0.0014340722,0.00045698872,0.0010120679,0.0035009396,0.000024085984,0.000015083141,0.0000835993,0.9615932,0.030960307,0.000028922143,0.00050678884,0.0003839588],"about_ca_topic_score_codex":0.000020358868,"about_ca_topic_score_gemma":7.8782975e-8,"teacher_disagreement_score":0.8934051,"about_ca_system_score_codex":0.000051759074,"about_ca_system_score_gemma":0.000018336446,"threshold_uncertainty_score":0.516704},"labels":[],"label_agreement":null},{"id":"W2905811380","doi":"10.1103/physrevlett.124.090505","title":"Efficiently Computable Bounds for Magic State Distillation","year":2020,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Advanced Scientific Computing Research; U.S. Department of Defense; U.S. Department of Energy; Canadian Institute for Advanced Research; Office of Science; National Science Foundation","keywords":"Computer science; MAGIC (telescope); Distillation; Exploit; Quantum; Computation; Upper and lower bounds; Statistical physics; Theoretical computer science; Mathematics; Algorithm; Quantum mechanics; Physics; Chemistry","score_opus":0.016261990677886962,"score_gpt":0.27127169071286705,"score_spread":0.2550097000349801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905811380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061331,0.0013380826,0.88983595,0.046739858,0.00014243388,0.00039830097,0.0000071756954,0.00017233207,0.000034890225],"genre_scores_gemma":[0.8687533,0.00016084446,0.037700683,0.092722595,0.0005879101,0.00002270589,0.00001792018,0.000025650737,0.000008358768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881977,0.000055299115,0.00019665237,0.00041030665,0.00022834976,0.00028961131],"domain_scores_gemma":[0.9993194,0.00016403582,0.00009914405,0.00024342602,0.000037020756,0.00013699701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012396104,0.00015647206,0.00030185666,0.000016579243,0.00010061308,0.00011769715,0.0004939383,0.000004493904,0.0000014690739],"category_scores_gemma":[0.000048268466,0.00012604556,0.00017266523,0.0003711339,0.00003505509,0.00010776151,0.00015007924,0.0001259898,0.000052533556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021355581,0.00027081702,0.00010242812,0.0048177666,0.00008881604,0.000027227718,0.002234201,0.358469,0.009142545,0.011749295,0.05797348,0.55510306],"study_design_scores_gemma":[0.00015504436,0.00007590585,0.0001199984,0.00021029341,0.000011454887,0.0000019214567,5.0104273e-7,0.96242577,0.00007775741,0.0007710314,0.03598588,0.0001644192],"about_ca_topic_score_codex":0.0000021192225,"about_ca_topic_score_gemma":5.692429e-8,"teacher_disagreement_score":0.85213524,"about_ca_system_score_codex":0.000017008564,"about_ca_system_score_gemma":0.000018279652,"threshold_uncertainty_score":0.51399887},"labels":[],"label_agreement":null},{"id":"W2906649690","doi":"10.1109/icse-nier.2019.00023","title":"On Testing Quantum Programs","year":2019,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Sketch; Software; Set (abstract data type); Field (mathematics); Quantum computer; Position (finance); Quantum","score_opus":0.016338158492093687,"score_gpt":0.22739962492652394,"score_spread":0.21106146643443024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906649690","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7268729,0.000015387883,0.24086723,0.0010571412,0.0008489313,0.00024210152,1.562706e-7,0.0010115335,0.029084584],"genre_scores_gemma":[0.88811404,1.06578206e-7,0.110823326,0.00046044658,0.00005579549,0.0000024049732,4.1939163e-7,0.0000066723205,0.0005368255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908954,0.000022914837,0.00010705345,0.00032534575,0.00019607747,0.0002590864],"domain_scores_gemma":[0.9992687,0.00016348956,0.00003668457,0.00043760918,0.00003374565,0.000059765436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014741498,0.00010144992,0.000094840245,0.000051020885,0.000065921275,0.00014694883,0.0005584898,0.000027827304,0.000013875119],"category_scores_gemma":[0.00003122598,0.00007284618,0.00003776237,0.0003497019,0.000010966456,0.00007825106,0.00016907541,0.00014122848,0.0005894694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016268715,0.00008878687,0.0013495033,0.0000115108205,0.000006021881,0.000011782391,0.00016293801,0.004230437,0.0003410337,0.4232212,0.00039924443,0.57017595],"study_design_scores_gemma":[0.0001304402,0.00035692708,0.0011429926,0.000034480232,4.5520116e-7,0.00001663146,0.000004084931,0.9790857,0.00014764155,0.017362965,0.0015866458,0.00013103036],"about_ca_topic_score_codex":0.000017053775,"about_ca_topic_score_gemma":4.654843e-7,"teacher_disagreement_score":0.97485524,"about_ca_system_score_codex":0.0000086084265,"about_ca_system_score_gemma":0.000023801002,"threshold_uncertainty_score":0.75766325},"labels":[],"label_agreement":null},{"id":"W2907512006","doi":"10.1002/qute.202000003","title":"Variational Quantum Generators: Generative Adversarial Quantum Machine Learning for Continuous Distributions","year":2020,"lang":"en","type":"preprint","venue":"Advanced Quantum Technologies","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; Canadian Institute for Advanced Research","funders":"Army Research Office; Office of Naval Research","keywords":"Quantum circuit; Quantum machine learning; Computer science; Quantum; Quantum algorithm; Quantum network; Generator (circuit theory); Quantum state; Topology (electrical circuits); Quantum computer; Algorithm; Theoretical computer science; Mathematics; Statistical physics; Quantum mechanics; Physics","score_opus":0.01707116633921113,"score_gpt":0.2599485468981357,"score_spread":0.24287738055892455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907512006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012684292,0.003224195,0.95868856,0.013097582,0.0031930907,0.0015024818,0.0008918105,0.006696501,0.000021479249],"genre_scores_gemma":[0.6212617,0.00039190074,0.3757442,0.00017174863,0.0005846237,0.000632687,0.0010881387,0.000100527875,0.000024481298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99416304,0.00025284637,0.0011804149,0.002467062,0.0007131443,0.0012235022],"domain_scores_gemma":[0.9957114,0.00082359486,0.0011641622,0.0015487291,0.0005720319,0.00018011869],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005099324,0.0011637945,0.0014029703,0.0004535646,0.001214144,0.0006011164,0.0034641125,0.0009824958,0.0000050930335],"category_scores_gemma":[0.0023269865,0.0011023796,0.0006315343,0.00093619566,0.00038401503,0.00040506257,0.0043472503,0.0029409577,0.000024283698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009446459,0.00022859102,0.00008509213,0.00017880155,0.00032912093,0.00006499981,0.00048408168,0.16690122,0.0030135962,0.7856177,0.0011690131,0.041833308],"study_design_scores_gemma":[0.0009343415,0.0004634685,0.00004060058,0.00012427829,0.000049667804,0.000019300145,0.00013429433,0.6511588,0.0030780388,0.33427924,0.008842921,0.0008750061],"about_ca_topic_score_codex":0.000055665703,"about_ca_topic_score_gemma":0.000011504867,"teacher_disagreement_score":0.6085774,"about_ca_system_score_codex":0.0002776663,"about_ca_system_score_gemma":0.000580708,"threshold_uncertainty_score":0.9993593},"labels":[],"label_agreement":null},{"id":"W2908019568","doi":"10.1103/physrevlett.123.050503","title":"Nearly Optimal Lattice Simulation by Product Formulas","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":186,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Canadian Institute for Advanced Research; Advanced Scientific Computing Research; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Hamiltonian (control theory); Lattice (music); Periodic boundary conditions; Product (mathematics); Quantum; Mathematics; Boundary value problem; Applied mathematics; Statistical physics; Computer science; Discrete mathematics; Quantum mechanics; Physics; Mathematical analysis; Mathematical optimization; Geometry","score_opus":0.009421627248963007,"score_gpt":0.27072725016489735,"score_spread":0.26130562291593434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908019568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7993191,0.0031836343,0.17732497,0.018937642,0.00028611862,0.0006110584,0.0000024005392,0.00021971214,0.000115384704],"genre_scores_gemma":[0.96627367,0.00008402698,0.014457878,0.018824399,0.0002850958,0.00001008088,0.000006545682,0.000017113143,0.000041192987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987052,0.00007480715,0.00017581812,0.00044862094,0.00030945745,0.00028606897],"domain_scores_gemma":[0.99908435,0.0001688544,0.00009410254,0.00054438395,0.00003370383,0.00007459358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017389188,0.00016331785,0.00027058565,0.00002137229,0.00006141631,0.00009133649,0.0005519581,0.0000063741118,0.000006878191],"category_scores_gemma":[0.000035585224,0.00012790164,0.00013222448,0.00030565172,0.00002118695,0.00031511555,0.00015543796,0.00020597487,0.00037231212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008769122,0.0003975614,0.00028696583,0.0021208967,0.000092480885,0.00001652298,0.0009603553,0.55061203,0.033645835,0.004741254,0.02375962,0.38335773],"study_design_scores_gemma":[0.00011379082,0.000046043388,0.00025248047,0.00030672256,0.000010881861,0.0000029554785,2.800589e-7,0.97208244,0.00027443853,0.000109339024,0.02660615,0.00019447933],"about_ca_topic_score_codex":0.0000051766083,"about_ca_topic_score_gemma":3.4127616e-8,"teacher_disagreement_score":0.42147043,"about_ca_system_score_codex":0.000019144229,"about_ca_system_score_gemma":0.000013852796,"threshold_uncertainty_score":0.52156776},"labels":[],"label_agreement":null},{"id":"W2908285344","doi":"10.1007/s00220-020-03699-z","title":"Quantum Spectral Methods for Differential Equations","year":2020,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; National Science Foundation of Sri Lanka; Canadian Institute for Advanced Research","keywords":"Quantum algorithm for linear systems of equations; Quantum algorithm; Spectral method; Boundary value problem; Linear differential equation; Quantum; Numerical partial differential equations; Differential equation; Quantum phase estimation algorithm","score_opus":0.0972695013407251,"score_gpt":0.3856985214600209,"score_spread":0.28842902011929583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908285344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044782567,0.00008830181,0.9903994,0.008029678,0.000056666548,0.00030022606,0.0000039748957,0.00016001266,0.00051386503],"genre_scores_gemma":[0.25642318,0.0000059718204,0.7431745,0.00023835483,0.00007744235,0.000054593653,0.000007845463,0.000010931598,0.000007188959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988882,0.00019860132,0.0003319854,0.00024396167,0.00010793473,0.00022933852],"domain_scores_gemma":[0.9966062,0.00187211,0.000083273524,0.0012922338,0.00005353877,0.00009268764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002478091,0.00013098006,0.00023782712,0.0000331002,0.00019408717,0.00011217278,0.00219771,0.000042506446,0.0000059182944],"category_scores_gemma":[0.0004426642,0.00012006154,0.000119970064,0.00046647072,0.00010554084,0.00012808523,0.000759443,0.00029083673,0.000027759976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012822729,0.0001701068,0.0000020956118,0.00003035848,0.000009023077,1.3635969e-7,0.0015506927,0.00077941106,0.0004591209,0.9482666,0.000069671616,0.048661463],"study_design_scores_gemma":[0.00012675539,0.000026782827,0.00001629451,0.000014636945,0.0000046191017,4.9156733e-7,0.000014230125,0.5758056,0.00015333941,0.4234048,0.00035078768,0.00008163398],"about_ca_topic_score_codex":0.0000011528151,"about_ca_topic_score_gemma":3.8928857e-7,"teacher_disagreement_score":0.5750262,"about_ca_system_score_codex":0.000021353613,"about_ca_system_score_gemma":0.000042709013,"threshold_uncertainty_score":0.48959672},"labels":[],"label_agreement":null},{"id":"W2908990136","doi":"10.21608/asat.2013.22186","title":"Spread Spectrum Encryption Architecture SSEA: A New Encryption Architecture for Post Quantum Computing - Design and Analysis.","year":2013,"lang":"en","type":"article","venue":"International Conference on Aerospace Sciences and Aviation Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Encryption; Computer science; Architecture; Computer architecture; Computer security; History","score_opus":0.01965571138063495,"score_gpt":0.270267874468548,"score_spread":0.25061216308791306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908990136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14144117,0.0000712024,0.8027576,0.05469806,0.00026822754,0.00045451763,0.000006827543,0.00023044314,0.000071919356],"genre_scores_gemma":[0.7937884,0.00004274215,0.20553695,0.0004056505,0.00009771732,0.000023437951,0.000013308322,0.000007961758,0.0000838464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777144,0.00009592316,0.0003361614,0.00093073124,0.00042424008,0.0004415304],"domain_scores_gemma":[0.9987652,0.00026301475,0.00032012328,0.0002837025,0.0002277508,0.00014020895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005418483,0.00029405358,0.0003127046,0.0010858224,0.000497194,0.0007537037,0.0008960218,0.00018650737,0.000029231098],"category_scores_gemma":[0.0001602074,0.00024146448,0.000091239,0.0011113674,0.000339567,0.00034519803,0.0002835374,0.00035621808,0.0000112106245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019662344,0.000062979176,0.0013580383,0.000013691194,0.000115584866,0.0000022948288,0.0009725003,0.017082788,0.012214435,0.7603014,0.0001206812,0.20773593],"study_design_scores_gemma":[0.00034362555,0.0005881151,0.0061240136,0.00004840385,0.000020538697,0.000033849115,0.00013104863,0.71591717,0.001026316,0.27538356,0.0001301646,0.00025317757],"about_ca_topic_score_codex":0.00017349217,"about_ca_topic_score_gemma":0.000047503647,"teacher_disagreement_score":0.6988344,"about_ca_system_score_codex":0.00004172512,"about_ca_system_score_gemma":0.00012765496,"threshold_uncertainty_score":0.9846636},"labels":[],"label_agreement":null},{"id":"W2909075322","doi":"10.1515/math-2018-0119","title":"Pretty good state transfer on 1-sum of star graphs","year":2018,"lang":"en","type":"article","venue":"Open Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Education Department of Henan Province; Henan University; University of Waterloo; Henan University of Science and Technology; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Adjacency matrix; Vertex (graph theory); Transfer (computing); Star (game theory); State (computer science); Scalar (mathematics); Unit (ring theory); Graph; Discrete mathematics; Geometry; Mathematical analysis; Algorithm; Computer science","score_opus":0.01999682019071355,"score_gpt":0.2655811290243024,"score_spread":0.24558430883358887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909075322","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5744138,0.000013143546,0.41404632,0.00032111924,0.00023820877,0.00044582202,0.00001680365,0.00008076697,0.010424022],"genre_scores_gemma":[0.59146273,0.0000044608933,0.4077773,0.00021085722,0.000039848488,0.0000068738573,0.0000011552028,0.00002006841,0.00047670826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887514,0.00004604777,0.00029500932,0.00026674685,0.0002827024,0.00023435174],"domain_scores_gemma":[0.99894184,0.00011778118,0.00007597759,0.0007119678,0.000082387094,0.00007003052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042092928,0.00014521657,0.00024717144,0.00006597454,0.00011112959,0.00016292973,0.0016260813,0.00003496821,0.000025921358],"category_scores_gemma":[0.000019798565,0.000109922315,0.000064169944,0.00029463254,0.000085534295,0.00014041047,0.00031815638,0.00012035881,0.00005343704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004203395,0.0015754614,0.00007625995,0.00044533645,0.00019773685,0.000029447387,0.04276311,0.0007041117,0.0039611636,0.82972,0.0020934306,0.11839186],"study_design_scores_gemma":[0.00076911354,0.0013466693,0.00038130223,0.00039079675,0.000016435515,0.000021348716,0.000086560925,0.622974,0.02962366,0.34127644,0.00267186,0.0004418589],"about_ca_topic_score_codex":0.000011356544,"about_ca_topic_score_gemma":0.0000066605035,"teacher_disagreement_score":0.62226987,"about_ca_system_score_codex":0.000007929522,"about_ca_system_score_gemma":0.00004628691,"threshold_uncertainty_score":0.44825017},"labels":[],"label_agreement":null},{"id":"W2911429116","doi":"10.22331/q-2019-08-05-170","title":"Clifford recompilation for faster classical simulation of quantum circuits","year":2019,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Canada First Research Excellence Fund; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Government of Ontario","keywords":"Overhead (engineering); Quantum computer; Quantum circuit; Quantum algorithm; Quantum; Electronic circuit; State (computer science); Quantum gate","score_opus":0.023146794630935396,"score_gpt":0.2744550318765683,"score_spread":0.2513082372456329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911429116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37954378,0.000022402308,0.6186158,0.0003761767,0.00087042135,0.00030529196,0.00000629037,0.00009747002,0.0001623514],"genre_scores_gemma":[0.99186623,0.0000012247068,0.007650392,0.00012813217,0.00016145,0.000008168781,0.000013409416,0.000018441153,0.00015255799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984074,0.00006956114,0.00043867313,0.00045786702,0.000293513,0.00033298304],"domain_scores_gemma":[0.9984595,0.00053101475,0.00024747485,0.0005321262,0.00015445231,0.00007539866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003646458,0.00017520139,0.0002983136,0.00014699709,0.000089040564,0.00007286729,0.00051690225,0.000109981156,0.0000144736805],"category_scores_gemma":[0.00006451966,0.00015522684,0.0001623458,0.00029656928,0.000032287706,0.00026081462,0.0001145795,0.00015348729,0.000056196226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062100495,0.00027375377,0.003926543,0.00027146994,0.000058076937,0.0000034065656,0.0014756693,0.41835383,0.0067011165,0.3597928,0.0007001572,0.20838109],"study_design_scores_gemma":[0.000540688,0.00038380155,0.0041499026,0.00005915673,0.000005999613,0.000004370596,0.000013210374,0.96554,0.00035789746,0.025267556,0.0034808014,0.00019663376],"about_ca_topic_score_codex":0.0000033435645,"about_ca_topic_score_gemma":6.2212797e-7,"teacher_disagreement_score":0.61232245,"about_ca_system_score_codex":0.00002554584,"about_ca_system_score_gemma":0.000049128856,"threshold_uncertainty_score":0.6329967},"labels":[],"label_agreement":null},{"id":"W2911695748","doi":"10.1038/s41598-022-11687-7","title":"Factoring semi-primes with (quantum) SAT-solvers","year":2022,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; Canadian Institute for Advanced Research","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Quantum computer; Computer science; Integer factorization; Quantum algorithm; Post-quantum cryptography; Boolean satisfiability problem; Factorization; Quantum; Cryptography; Time complexity; Theoretical computer science; Factoring; Satisfiability; Algorithm; Discrete mathematics; Parallel computing; Public-key cryptography; Mathematics; Quantum mechanics; Encryption","score_opus":0.009637495079463697,"score_gpt":0.21416464003112756,"score_spread":0.20452714495166385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911695748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89794284,0.0001837251,0.08514541,0.00064325973,0.013955372,0.00025894045,0.0000021166957,0.0005956265,0.0012727176],"genre_scores_gemma":[0.9877732,3.805732e-7,0.01042475,0.00008451521,0.00007354318,0.000018264525,0.000011339169,0.000015830943,0.0015982045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968409,0.00007278034,0.00033004826,0.0011471313,0.0011016682,0.000507458],"domain_scores_gemma":[0.9980147,0.000053231885,0.00027293767,0.0014246547,0.00007681875,0.00015768185],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011862243,0.00018907625,0.00019053163,0.0002408482,0.0016032696,0.0006565186,0.00080496905,0.00002292263,0.00007281942],"category_scores_gemma":[0.000029620634,0.00015491829,0.000093878974,0.0012037009,0.00013354103,0.00025762396,0.00094169675,0.0003319033,0.000013006865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005119813,0.0009828964,0.03958053,0.00015362617,0.00030635463,0.021510018,0.043012567,0.6151511,0.044970155,0.016483884,0.069809385,0.14798826],"study_design_scores_gemma":[0.00039816543,0.00038784792,0.0034735526,0.000060599985,0.000020837217,0.0044698403,0.00044315791,0.45002177,0.0108676925,0.020337448,0.508416,0.0011030781],"about_ca_topic_score_codex":0.000034390956,"about_ca_topic_score_gemma":0.0000020326315,"teacher_disagreement_score":0.43860662,"about_ca_system_score_codex":0.00008771775,"about_ca_system_score_gemma":0.00029744685,"threshold_uncertainty_score":0.9996965},"labels":[],"label_agreement":null},{"id":"W2911873466","doi":"","title":"Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography","year":2009,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum cryptography; Cryptography; Computer science; Theoretical computer science; Communication theory; Computation; Computer security; Mathematics; Quantum; Quantum mechanics; Algorithm; Quantum information; Physics","score_opus":0.014265318720700108,"score_gpt":0.2470084221646626,"score_spread":0.23274310344396248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911873466","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5383862,0.00008779461,0.42841968,0.009967745,0.00016553517,0.0002178844,0.0000032785586,0.00009672714,0.022655142],"genre_scores_gemma":[0.9651428,0.000017172584,0.034508117,0.0003018771,0.000009193349,7.585338e-7,5.029027e-7,0.0000019362167,0.000017634547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993389,0.000029013703,0.00020221151,0.00014742136,0.00020635832,0.000076081844],"domain_scores_gemma":[0.999263,0.00008857077,0.00017616857,0.00017840328,0.00027006917,0.000023812365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026954443,0.00007608478,0.00010362336,0.000085686675,0.00008150886,0.00004919145,0.00083456695,0.00002465102,0.0000041016183],"category_scores_gemma":[0.000026199314,0.000048753136,0.000043160027,0.00026860973,0.00013463695,0.00009375799,0.00015432017,0.00010322232,3.2438587e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046517735,0.000052125262,0.0004202471,0.000004458357,0.000008546989,4.0471374e-8,0.0008308161,0.00019194654,0.0005832777,0.97803944,0.00021629305,0.019648142],"study_design_scores_gemma":[0.00019764375,0.0001255523,0.039359387,0.000086475025,0.0000028578133,0.000006873204,0.000118955075,0.41732115,0.0017953451,0.5408453,0.00006734108,0.00007317823],"about_ca_topic_score_codex":0.0000051854463,"about_ca_topic_score_gemma":3.2797712e-7,"teacher_disagreement_score":0.4371942,"about_ca_system_score_codex":0.0000033899419,"about_ca_system_score_gemma":0.000019089788,"threshold_uncertainty_score":0.19880952},"labels":[],"label_agreement":null},{"id":"W2911898123","doi":"10.26421/qic15.7-8-5","title":"Momentum switches","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Construct (python library); Momentum (technical analysis); Scattering; Computation; Quantum; Physics; Computer science; Mathematics; Quantum mechanics; Algorithm","score_opus":0.01828933217209201,"score_gpt":0.24691155549415106,"score_spread":0.22862222332205906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911898123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12866664,0.00006178697,0.86789656,0.0013882257,0.00038151877,0.00009364585,9.4774884e-7,0.00026721077,0.0012434656],"genre_scores_gemma":[0.9763532,0.000006025275,0.022950731,0.00060313585,0.000044085427,0.0000051179945,0.000017755463,0.0000032353898,0.000016688953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918,0.0000282849,0.00026005082,0.000119418066,0.00025667585,0.00015553797],"domain_scores_gemma":[0.9994466,0.000032034455,0.00012288988,0.00012716981,0.00013254672,0.00013881562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002967137,0.00010538741,0.000098277145,0.0001527569,0.00011529486,0.00034167743,0.00018720207,0.000038680024,9.447146e-7],"category_scores_gemma":[0.000032911954,0.00009291023,0.000023007226,0.00026227915,0.000022795919,0.0013719244,0.000117543605,0.00008956996,0.00007500695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012008642,0.00003746593,0.000264194,0.000036217585,0.000015135505,0.0000020434745,0.009413514,0.04348197,0.000025568763,0.23304759,0.004260667,0.70940363],"study_design_scores_gemma":[0.0003981607,0.00010079561,0.0009793132,0.000009532593,0.0000016846561,0.000032428583,0.00021609741,0.96024233,0.000054576052,0.028361712,0.009477157,0.00012618706],"about_ca_topic_score_codex":0.00001794774,"about_ca_topic_score_gemma":4.1654553e-7,"teacher_disagreement_score":0.9167604,"about_ca_system_score_codex":0.000023179015,"about_ca_system_score_gemma":0.00006356534,"threshold_uncertainty_score":0.37887692},"labels":[],"label_agreement":null},{"id":"W2912290323","doi":"10.20944/preprints201905.0021.v1","title":"Quantum Computing in Four Spatial Dimensions","year":2019,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Quantum entanglement; Quantum computer; Superposition principle; Computation; Dimension (graph theory); Quantum; Set (abstract data type); Computer science; Volume (thermodynamics); Charge (physics); Theoretical physics; Topology (electrical circuits); Physics; Theoretical computer science; Quantum mechanics; Mathematics; Algorithm; Pure mathematics; Combinatorics","score_opus":0.06951460419783367,"score_gpt":0.3137925447502071,"score_spread":0.24427794055237345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912290323","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.812119,0.00011043244,0.1813007,0.0008947009,0.0034164025,0.0006214285,0.00000652398,0.000490548,0.0010402511],"genre_scores_gemma":[0.9887619,0.000025209301,0.010332432,0.00027650237,0.00037811522,0.000017861155,0.000011512149,0.000050155555,0.00014632825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951124,0.000411695,0.00087091804,0.0020964397,0.00064484624,0.00086365227],"domain_scores_gemma":[0.9959305,0.0003599185,0.0004954451,0.002870724,0.00013779386,0.00020559887],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012911849,0.0006114811,0.0008121426,0.00045900914,0.00018465005,0.00013033098,0.0030978613,0.00044445353,0.000043985925],"category_scores_gemma":[0.00024075466,0.000616274,0.0003298244,0.0004202766,0.000076609555,0.000121230274,0.013260373,0.0024901265,0.001137457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017690212,0.00026643174,0.4759215,0.00027047854,0.00009964319,0.00024652758,0.0031991778,0.500562,0.0012294052,0.0049085557,0.00007227746,0.013206312],"study_design_scores_gemma":[0.00031572883,0.000020702333,0.31024545,0.0004231761,0.0000080067075,0.000028624872,0.000008399713,0.68161404,0.0006037835,0.0057010152,0.00051746104,0.0005136111],"about_ca_topic_score_codex":0.0011378176,"about_ca_topic_score_gemma":0.000049848386,"teacher_disagreement_score":0.18105206,"about_ca_system_score_codex":0.0001607959,"about_ca_system_score_gemma":0.00039290788,"threshold_uncertainty_score":0.9998112},"labels":[],"label_agreement":null},{"id":"W2913430283","doi":"10.22331/q-2020-05-14-266","title":"Classical zero-knowledge arguments for quantum computations","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Multidisciplinary University Research Initiative; Canadian Institute for Advanced Research; Institute for Quantum Information and Matter, California Institute of Technology; California Institute of Technology; Gordon and Betty Moore Foundation; National Science Foundation","keywords":"Quantum; Argument (complex analysis); Quantum computer; Computation; Quantum system; Quantum information; Calculus (dental); Quantum operation; Quantum algorithm","score_opus":0.03248646587765049,"score_gpt":0.2842962697222746,"score_spread":0.25180980384462415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913430283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023874216,0.0001925593,0.9605184,0.013093157,0.0009855299,0.00036114812,0.000019808982,0.0005766497,0.00037853944],"genre_scores_gemma":[0.937273,0.0000046281066,0.060305495,0.00172173,0.0004897985,0.000035694175,0.00001912993,0.000032891458,0.000117614625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802357,0.000092990864,0.00038576496,0.00069839647,0.0002610491,0.0005382423],"domain_scores_gemma":[0.99863213,0.00037229183,0.00012384368,0.00039390777,0.00012873346,0.0003490852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001993372,0.0002634954,0.00032448373,0.000086928085,0.00037259381,0.00022870436,0.0010864299,0.000092303606,0.000006868822],"category_scores_gemma":[0.00012951565,0.00023826651,0.00020601359,0.00053401524,0.000073628864,0.00019300751,0.00035249826,0.00028149912,0.00021730542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032554184,0.0003913081,0.00014554306,0.00014530981,0.00008688114,0.000027437292,0.0043633613,0.008985232,0.00096489594,0.87163234,0.044704188,0.068520926],"study_design_scores_gemma":[0.0006415286,0.0003914608,0.0002630147,0.000028259381,0.000010251945,0.000010146609,0.000019953564,0.9090242,0.00020767344,0.028471926,0.06064481,0.0002868041],"about_ca_topic_score_codex":0.0000037177688,"about_ca_topic_score_gemma":9.1749916e-7,"teacher_disagreement_score":0.9133988,"about_ca_system_score_codex":0.00002934734,"about_ca_system_score_gemma":0.00012986733,"threshold_uncertainty_score":0.9716226},"labels":[],"label_agreement":null},{"id":"W2913721978","doi":"10.1109/icecs.2018.8618039","title":"Study of Stochastic Invertible Multiplier Designs","year":2018,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Invertible matrix; Multiplier (economics); Stochastic computing; Computer science; Multiplication (music); Reversible computing; Logic synthesis; Logic gate; Electronic circuit; Logic optimization; Arithmetic; Sequential logic; Algorithm; Mathematics; Electrical engineering; Engineering","score_opus":0.035366609568222816,"score_gpt":0.2738554163999693,"score_spread":0.23848880683174647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913721978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40993643,0.000004109082,0.58924913,0.000041577783,0.00014632058,0.000103229984,1.2022404e-7,0.000083838146,0.0004352501],"genre_scores_gemma":[0.9391009,4.405896e-8,0.0605944,0.00009297211,0.00007563413,0.0000027011897,7.211538e-8,0.000004900306,0.0001283569],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915147,0.000044763066,0.0001654207,0.00026012023,0.00019574485,0.0001824576],"domain_scores_gemma":[0.9992751,0.00007782509,0.00005065782,0.00045206942,0.000085817905,0.00005853902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015669805,0.000090152986,0.00012376414,0.00009149605,0.00010207915,0.000034802546,0.00060283847,0.00002200606,0.000016081683],"category_scores_gemma":[0.000026709891,0.00006742363,0.000026304542,0.00035162657,0.000050851522,0.00007622988,0.000294743,0.000069603826,0.00004114899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009002191,0.007943605,0.0066931937,0.00006375116,0.00041253064,0.00009109261,0.12504777,0.08414376,0.019674253,0.057102773,0.0070237597,0.6917135],"study_design_scores_gemma":[0.00047854104,0.0011743295,0.0023053263,0.000009529131,0.0000038193725,0.000007955558,0.00016054495,0.9925163,0.001799997,0.0013883936,0.000034708824,0.00012054935],"about_ca_topic_score_codex":0.00006800923,"about_ca_topic_score_gemma":0.00002787667,"teacher_disagreement_score":0.9083725,"about_ca_system_score_codex":0.000006116084,"about_ca_system_score_gemma":0.000028842705,"threshold_uncertainty_score":0.2749456},"labels":[],"label_agreement":null},{"id":"W2914666411","doi":"10.1038/s41534-018-0123-x","title":"Quantum computation is the unique reversible circuit model for which bits are balls","year":2019,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; Österreichischen Akademie der Wissenschaften; Government of Canada; Austrian Science Fund; John Templeton Foundation","keywords":"Quantum computer; Computation; Qubit; Quantum; Quantum circuit; Quantum algorithm; Quantum operation; Simple (philosophy); Quantum error correction","score_opus":0.017544847417501716,"score_gpt":0.23613772127564817,"score_spread":0.21859287385814646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914666411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10118387,0.000029098575,0.89231277,0.0040320554,0.00065483537,0.0008579783,0.000028359429,0.00025853087,0.00064253533],"genre_scores_gemma":[0.98512465,0.000015885344,0.011782624,0.0027633857,0.00007180993,0.000035563113,0.000060127026,0.000015119344,0.00013084772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818003,0.00006711779,0.0005384773,0.0003004952,0.00048380584,0.0004300519],"domain_scores_gemma":[0.99804145,0.00025292995,0.00048557407,0.0006104177,0.00052413513,0.0000854663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007726485,0.00024546948,0.00024548595,0.00021935602,0.00040244727,0.0004468453,0.00093142857,0.00014624823,0.0000066580933],"category_scores_gemma":[0.00008188094,0.00018833739,0.00013056335,0.0007235152,0.000026538135,0.001894938,0.00019410513,0.00028818758,0.00023173231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003541375,0.000057716323,0.00029814272,0.00028566708,0.00004655122,6.8853586e-7,0.012641214,0.64562696,0.00017648865,0.29706526,0.014469856,0.02929601],"study_design_scores_gemma":[0.00051010586,0.00010862435,0.0007843377,0.00008890154,0.000008171776,0.000016844018,0.0001501458,0.96071005,0.00013429606,0.032775376,0.0044451016,0.0002680259],"about_ca_topic_score_codex":0.000026525977,"about_ca_topic_score_gemma":0.0000062682616,"teacher_disagreement_score":0.88394076,"about_ca_system_score_codex":0.000075958626,"about_ca_system_score_gemma":0.00019183556,"threshold_uncertainty_score":0.7680176},"labels":[],"label_agreement":null},{"id":"W2914771158","doi":"10.22331/q-2020-04-16-253","title":"Detecting mixed-unitary quantum channels is NP-hard","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Unitary state; Algorithm; Dimension (graph theory); Mathematics; Combinatorics","score_opus":0.026512783391608022,"score_gpt":0.23654667845947183,"score_spread":0.2100338950678638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914771158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.518064,0.00057192566,0.45353526,0.02374006,0.002404764,0.0002416693,0.000012759463,0.0011860484,0.00024350318],"genre_scores_gemma":[0.97447705,0.000017147637,0.0168432,0.0076089287,0.0009417472,0.0000101627675,0.0000040181567,0.00004664752,0.000051096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706227,0.00016713772,0.0004656695,0.00097075914,0.00052992813,0.0008042549],"domain_scores_gemma":[0.99829966,0.00022500628,0.0001845566,0.000749921,0.000104811996,0.000436031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003839624,0.00039416878,0.0004199907,0.00014401469,0.00046069635,0.00032633805,0.0016975215,0.00013332546,0.000035963025],"category_scores_gemma":[0.00016769307,0.00036353854,0.00023309625,0.00096832664,0.00007126505,0.0003472192,0.0007524631,0.0006526705,0.00043481664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016151808,0.0006460904,0.0016102901,0.0008416144,0.00058177585,0.0018354672,0.060946018,0.025133368,0.029934958,0.19442445,0.13705151,0.546833],"study_design_scores_gemma":[0.00034713905,0.00038176277,0.00028867033,0.000048061007,0.0000102293,0.00008260427,0.00012381632,0.9666377,0.0047390154,0.008734366,0.018093161,0.00051352516],"about_ca_topic_score_codex":0.000060249968,"about_ca_topic_score_gemma":0.0000014666518,"teacher_disagreement_score":0.9415043,"about_ca_system_score_codex":0.000026958513,"about_ca_system_score_gemma":0.00008956383,"threshold_uncertainty_score":0.9998817},"labels":[],"label_agreement":null},{"id":"W2915171113","doi":"10.1007/978-3-030-14082-3_1","title":"An Introduction to Quantum Computing and Its Application","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; Quantum computer; Quantum; Theoretical computer science; Computational science; Quantum mechanics; Physics","score_opus":0.008853946245019326,"score_gpt":0.24707911040133923,"score_spread":0.2382251641563199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915171113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040729023,0.00023725093,0.98881507,0.0037891509,0.001978011,0.0006941572,0.0000033622725,0.00028753962,0.00012254591],"genre_scores_gemma":[0.64599305,0.000013457893,0.3491748,0.0017225078,0.0029259108,0.0000052999935,0.000010876659,0.000058962094,0.000095145966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558175,0.00005052335,0.00049632194,0.002428689,0.00077334687,0.0006693808],"domain_scores_gemma":[0.9974139,0.00023212734,0.00026848493,0.0015329578,0.00025964965,0.00029291306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010759021,0.00054462586,0.0005296505,0.0009172464,0.0003532757,0.0006067077,0.0024717802,0.00026382995,0.0000036510276],"category_scores_gemma":[0.000058884532,0.00051630504,0.00006952495,0.00072416535,0.00017938112,0.00049668003,0.001324311,0.00083373697,0.00005993578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036948338,0.000019911977,0.000015773061,0.00003591926,0.000004789278,0.0000080471855,0.0007151185,0.25753227,0.0011223924,0.053341474,0.000011079932,0.6871895],"study_design_scores_gemma":[0.00014064266,0.0003304985,0.00021645057,0.000119724966,0.000004527362,0.0001007352,1.9335141e-7,0.9662759,0.00074331125,0.02946288,0.0019998262,0.0006053332],"about_ca_topic_score_codex":0.00001280632,"about_ca_topic_score_gemma":0.000014817385,"teacher_disagreement_score":0.7087436,"about_ca_system_score_codex":0.00016516338,"about_ca_system_score_gemma":0.00029243453,"threshold_uncertainty_score":0.99972886},"labels":[],"label_agreement":null},{"id":"W2917449642","doi":"10.1103/physrevx.10.041018","title":"Continuous Symmetries and Approximate Quantum Error Correction","year":2020,"lang":"en","type":"article","venue":"Physical Review X","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Air Force Office of Scientific Research; Kavli Institute for Theoretical Physics, University of California, Santa Barbara; Intelligence Advanced Research Projects Activity; Institute for Quantum Information and Matter, California Institute of Technology; Deutsche Forschungsgemeinschaft; Canadian Institute for Advanced Research; U.S. Department of Energy; California Institute of Technology; Simons Foundation; Yvonne Lui Trust; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Walter Burke Institute for Theoretical Physics; National Science Foundation","keywords":"Qubit; Quantum error correction; Quantum computer; Discrete mathematics; Mathematics; Quantum mechanics; Quantum; Physics","score_opus":0.018350094386902955,"score_gpt":0.2736843282635075,"score_spread":0.2553342338766046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917449642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16004442,0.05371245,0.7331904,0.048568077,0.0012653078,0.0009790078,0.000006308148,0.0011485467,0.001085486],"genre_scores_gemma":[0.9860931,0.0021339098,0.0040967967,0.0072786366,0.00035099007,0.000013339496,0.0000017364896,0.000012642918,0.000018829582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990875,0.000070899485,0.00014915883,0.00034275017,0.00016811225,0.0001815591],"domain_scores_gemma":[0.9994195,0.00012312367,0.00007818097,0.00019347631,0.00004847956,0.00013720487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010895969,0.00013254724,0.00032921234,0.00001618086,0.0000860835,0.00007722412,0.000289357,0.000013158783,0.0000016937471],"category_scores_gemma":[0.00025412225,0.00009963228,0.00008006684,0.00041897895,0.000042967757,0.000115781906,0.00021533758,0.0001793692,0.000034793782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000787531,0.0001486749,0.00009797717,0.0021543496,0.000037977643,0.000025195268,0.0013733323,0.00021811911,0.00059568975,0.1014083,0.008149162,0.8857834],"study_design_scores_gemma":[0.00008995529,0.00015550747,0.00018105897,0.00036378513,0.000014481764,0.000014947229,0.000007115595,0.9822775,0.00027062293,0.005679896,0.010791435,0.00015366479],"about_ca_topic_score_codex":0.0000051323373,"about_ca_topic_score_gemma":1.7298382e-7,"teacher_disagreement_score":0.9820594,"about_ca_system_score_codex":0.000005032321,"about_ca_system_score_gemma":0.00001564246,"threshold_uncertainty_score":0.40628865},"labels":[],"label_agreement":null},{"id":"W2920509442","doi":"10.48550/arxiv.1903.00145","title":"Spin Chains, Graphs and State Revival","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Kravchuk polynomials; Mathematics; Spin (aerodynamics); Quantum walk; Relation (database); Recurrence relation; Combinatorics; Quantum; Orthogonal polynomials; Discrete mathematics; Pure mathematics; Quantum mechanics; Physics; Discrete orthogonal polynomials; Computer science; Quantum computer; Wilson polynomials","score_opus":0.030722774803301607,"score_gpt":0.18155224605177755,"score_spread":0.15082947124847595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920509442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64781886,0.00025605265,0.35003272,0.00017787804,0.0007168106,0.00023298369,0.000012705528,0.00027817814,0.00047384494],"genre_scores_gemma":[0.994098,0.0004534119,0.0036790557,0.00015460141,0.000046889523,2.574796e-7,0.0000061821975,0.00001805814,0.0015435481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797374,0.00013023881,0.00017397641,0.0012328337,0.00009721324,0.0003919962],"domain_scores_gemma":[0.99831,0.00007917523,0.0002102416,0.0011504613,0.00007542471,0.00017469104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026393394,0.00033745603,0.00037421915,0.0002651958,0.00014814264,0.00018208729,0.0014027714,0.00016863031,0.0000044122285],"category_scores_gemma":[0.000015660213,0.00035383718,0.00016799259,0.00040867928,0.0001029685,0.00014774027,0.0029960568,0.0007291879,0.00003997016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021454773,0.00007873934,0.0034807492,0.0003472204,0.00014249586,0.0006020143,0.0007515093,0.7553372,0.00003316986,0.22033478,0.0005300096,0.018340657],"study_design_scores_gemma":[0.00030273036,0.00006527898,0.0026165666,0.00016648418,0.000018719697,0.000012200117,0.000010216402,0.9316996,0.000022936807,0.06396422,0.00069169205,0.00042938907],"about_ca_topic_score_codex":0.00009317899,"about_ca_topic_score_gemma":0.00000826513,"teacher_disagreement_score":0.34635365,"about_ca_system_score_codex":0.000048281465,"about_ca_system_score_gemma":0.00012662412,"threshold_uncertainty_score":0.99989134},"labels":[],"label_agreement":null},{"id":"W2921097798","doi":"10.1007/s00165-019-00480-5","title":"A modeling and verification framework for optical quantum circuits","year":2019,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Concordia University","funders":"","keywords":"Theory of computation; Computer science; Electronic circuit; Quantum; Theoretical computer science; Programming language; Physics; Quantum mechanics","score_opus":0.012930044559586967,"score_gpt":0.24794604474985685,"score_spread":0.23501600019026989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921097798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46135497,0.000059789007,0.5378251,0.00011194079,0.00022378302,0.00015235203,6.9046206e-7,0.000074441836,0.00019691986],"genre_scores_gemma":[0.76576567,0.0000015604951,0.2340544,0.00005096197,0.000112984526,0.0000014230782,0.0000014764709,0.000009678789,0.0000018380399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867344,0.000016753747,0.00032834924,0.0003696882,0.00021591542,0.00039584495],"domain_scores_gemma":[0.9990531,0.00029074927,0.00012340362,0.00034347817,0.00010853655,0.000080736885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042301507,0.00014816616,0.00025145581,0.00009868795,0.00015704519,0.000103770755,0.0004638113,0.0000826327,0.0000010657192],"category_scores_gemma":[0.00008703376,0.0001385578,0.00007897369,0.00020638567,0.000026670456,0.00027434656,0.00028884318,0.00020709664,0.0000049100076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004683191,0.000024926105,0.0000716068,0.00008904263,0.000011580463,7.602274e-7,0.0008214639,0.0988858,0.00046819285,0.8389285,0.0000012729919,0.06069213],"study_design_scores_gemma":[0.00026789738,0.00020895814,0.0006187559,0.0001469203,0.0000042314123,0.000020991994,0.00003891065,0.91395026,0.0007238181,0.083842084,0.00001803952,0.00015911639],"about_ca_topic_score_codex":0.0000059336026,"about_ca_topic_score_gemma":2.52754e-7,"teacher_disagreement_score":0.8150645,"about_ca_system_score_codex":0.000014216734,"about_ca_system_score_gemma":0.00004876524,"threshold_uncertainty_score":0.56502235},"labels":[],"label_agreement":null},{"id":"W2921170388","doi":"10.1038/d41586-019-00771-0","title":"Machine learning in quantum spaces","year":2019,"lang":"en","type":"letter","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Quantum machine learning; Computer science; Quantum; Quantum computer; Theoretical computer science; Artificial intelligence; Machine learning; Physics; Quantum mechanics","score_opus":0.00650662182208638,"score_gpt":0.23075669909943247,"score_spread":0.22425007727734608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921170388","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010039136,0.006933793,0.0037875117,0.98235273,0.0037019567,0.0002658438,0.000013551046,0.00052448787,0.0014162065],"genre_scores_gemma":[0.011299274,0.00008675625,0.008160005,0.96898544,0.0043538776,0.0000073405945,0.00014950018,0.00008932598,0.006868457],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974882,0.00020728857,0.00024594294,0.0008587027,0.00059586775,0.0006039719],"domain_scores_gemma":[0.9986445,0.00033752059,0.00019596725,0.00073636614,0.000052299103,0.000033384513],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.00030154712,0.00041143052,0.0004733444,0.0004239617,0.00009216106,0.00030529549,0.0018258668,0.004355956,0.000014752138],"category_scores_gemma":[0.0001000444,0.00033706063,0.00015937952,0.0005994509,0.00002771807,0.00012410319,0.000524476,0.031710397,0.0001224981],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025399938,0.00001660072,0.00040573635,0.00015817737,0.000024105404,0.0010706425,0.0003307847,0.003965776,0.000010526545,0.0014528916,0.98091197,0.011650248],"study_design_scores_gemma":[0.00013779935,0.00004301918,0.00012363357,0.00012716261,0.000002545686,0.000043542484,0.0000011312575,0.37065345,0.0000057424386,0.00076636224,0.62781423,0.00028136483],"about_ca_topic_score_codex":0.000057771507,"about_ca_topic_score_gemma":0.0000076152164,"teacher_disagreement_score":0.3666877,"about_ca_system_score_codex":0.000054016655,"about_ca_system_score_gemma":0.000118940734,"threshold_uncertainty_score":0.99990815},"labels":[],"label_agreement":null},{"id":"W2921402294","doi":"10.23638/lmcs-16(2:11)2020","title":"Completeness of the ZX-Calculus","year":2020,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"Agence Nationale de la Recherche","keywords":"Completeness (order theory); Calculus (dental); Mathematics; Computer science; Medicine; Mathematical analysis; Dentistry","score_opus":0.07030176109592952,"score_gpt":0.35459560357403375,"score_spread":0.28429384247810424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921402294","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024707468,0.000050525476,0.9691081,0.00484487,0.0008665881,0.00014946159,6.9759034e-7,0.00009240515,0.00017988781],"genre_scores_gemma":[0.3378366,9.016194e-7,0.6600814,0.0019953053,0.0000800015,0.0000019720922,3.4788176e-8,0.0000028400823,9.800411e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721164,0.00056471885,0.0004320178,0.00076532573,0.00057561765,0.000450709],"domain_scores_gemma":[0.9982324,0.00059558364,0.0001575416,0.0007300984,0.00010134512,0.00018298288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019229143,0.00016950464,0.00033693505,0.00008729205,0.00021028979,0.00014409672,0.004943383,0.00005320094,0.000004384062],"category_scores_gemma":[0.00037532,0.00010058046,0.00012055739,0.0033196171,0.00076361716,0.00019315124,0.0031786854,0.00037957227,0.00000404936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038029352,0.00007274429,0.0008350402,0.000021187225,0.000003115738,0.000014410597,0.0011604954,0.05441526,0.008681919,0.05949003,0.000023231401,0.8752788],"study_design_scores_gemma":[0.00016043693,0.00012091679,0.019333666,0.00002772219,0.000001139261,0.000018711651,0.0000028101256,0.96146506,0.0060254894,0.012376568,0.00032477247,0.00014272855],"about_ca_topic_score_codex":0.00000996537,"about_ca_topic_score_gemma":4.72309e-7,"teacher_disagreement_score":0.9070498,"about_ca_system_score_codex":0.000024577103,"about_ca_system_score_gemma":0.00012336805,"threshold_uncertainty_score":0.9186118},"labels":[],"label_agreement":null},{"id":"W2923595161","doi":"10.22331/q-2020-07-16-296","title":"Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum computer; Computer science; Quantum; Qubit; Context (archaeology); Algorithm; Operator (biology); Fault tolerance; Phase (matter); Statistical physics; Electron; Physics; Quantum mechanics; Chemistry","score_opus":0.013502665156489527,"score_gpt":0.26022820608178016,"score_spread":0.24672554092529064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923595161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34674528,0.000064754364,0.6512851,0.0010984513,0.00027650007,0.00024047022,0.000009133981,0.00026619624,0.000014133855],"genre_scores_gemma":[0.9955744,0.0000036025297,0.00363317,0.00058494456,0.00012306008,0.000006580227,0.000036589467,0.000027684093,0.000009969318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978949,0.00015186373,0.0006187748,0.00056959875,0.00033191906,0.00043298327],"domain_scores_gemma":[0.9986442,0.0001817972,0.00036238585,0.00044494067,0.00017611602,0.00019057395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018909553,0.0002713651,0.00039402943,0.00011992129,0.0001682625,0.00009113359,0.0006372863,0.00012905784,0.000020454394],"category_scores_gemma":[0.000106737476,0.0002522208,0.00014137509,0.0007839932,0.00006644626,0.0002466891,0.00014973273,0.00033420845,0.000025327481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024606602,0.00043226208,0.00006902785,0.000114342736,0.000100841375,0.00004237394,0.0045372727,0.4808664,0.45575973,0.013345291,0.00022268879,0.0442637],"study_design_scores_gemma":[0.0015457652,0.0010484193,0.00014391734,0.00003023631,0.000018058869,0.000011391109,0.000018478904,0.9867966,0.008201115,0.0014669086,0.00042976165,0.0002893208],"about_ca_topic_score_codex":0.00002839808,"about_ca_topic_score_gemma":0.0000011356125,"teacher_disagreement_score":0.6488291,"about_ca_system_score_codex":0.000026564441,"about_ca_system_score_gemma":0.00010365074,"threshold_uncertainty_score":0.999993},"labels":[],"label_agreement":null},{"id":"W2928505530","doi":"10.1364/qim.2019.s3b.2","title":"Characterizing large-scale quantum devices","year":2019,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum; Scale (ratio); Computer science; Noise (video); Quantum sensor; Quantum noise; Quantum network; Quantum computer; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.007403691424076085,"score_gpt":0.22423135432479752,"score_spread":0.21682766290072142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928505530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7230433,0.000049755967,0.26900953,0.0013114456,0.00080079207,0.00010007448,0.0000012420307,0.0004168187,0.0052670445],"genre_scores_gemma":[0.94853425,0.0000016505938,0.04803594,0.0026831937,0.00011743445,0.0000019984718,0.0000015726054,0.000009585386,0.00061438634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988702,0.000033008037,0.00015556888,0.0003800665,0.00019556256,0.00036559545],"domain_scores_gemma":[0.9992785,0.00005546986,0.000058854934,0.0004981843,0.0000303814,0.00007863964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002268948,0.00012535139,0.00015049428,0.0000693315,0.000102019745,0.00018713996,0.0007445697,0.000041836054,0.000085694366],"category_scores_gemma":[0.000004412492,0.000097043354,0.00006651109,0.00024126393,0.000008888274,0.0002746777,0.00035821757,0.00014616118,0.00072457007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002233621,0.0007408879,0.08176686,0.0003169232,0.00013693538,0.000098064374,0.016344873,0.002352439,0.04426958,0.5632971,0.0034517883,0.2872022],"study_design_scores_gemma":[0.0001895034,0.000057635083,0.014824023,0.000025630086,0.0000012042835,0.000019962203,0.00005030195,0.9362184,0.00095357693,0.0009040088,0.046558466,0.00019729963],"about_ca_topic_score_codex":0.000011019451,"about_ca_topic_score_gemma":0.0000049242694,"teacher_disagreement_score":0.93386596,"about_ca_system_score_codex":0.000008710296,"about_ca_system_score_gemma":0.00002507787,"threshold_uncertainty_score":0.93131244},"labels":[],"label_agreement":null},{"id":"W2931404518","doi":"10.1007/s11433-019-9366-7","title":"Preparation of pseudo-pure states for NMR quantum computing with one ancillary qubit","year":2019,"lang":"en","type":"article","venue":"Science China Physics Mechanics and Astronomy","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Homonuclear molecule; Qubit; Quantum computer; Heteronuclear molecule; Quantum state; Quantum mechanics; Quantum; Hilbert space; Initialization; Physics; Topology (electrical circuits); Computer science; Molecule; Mathematics","score_opus":0.0066941146943626986,"score_gpt":0.23395805127625305,"score_spread":0.22726393658189034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2931404518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43248415,0.000019229745,0.5669967,0.000092042545,0.00009573122,0.00025367035,0.0000052749497,0.000028999935,0.00002417266],"genre_scores_gemma":[0.7861601,0.0000020402215,0.21372823,0.000024039238,0.00006221311,0.000004270018,0.000004887245,0.000007925997,0.000006300413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998426,0.000019572562,0.00021380895,0.00058740604,0.00035281992,0.0004003982],"domain_scores_gemma":[0.9990207,0.000060489292,0.00024415302,0.00041096756,0.00016460709,0.00009906633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005488905,0.00017939054,0.0002563384,0.00007587241,0.00029404467,0.00018232201,0.0006267031,0.000026189176,8.3152617e-7],"category_scores_gemma":[0.0000068480135,0.00014727112,0.000049672763,0.0005211512,0.00007961167,0.00047734426,0.00029667284,0.00012749789,0.0000014089718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035055604,0.00017269883,0.0005407306,0.00012590195,0.000031511263,4.85537e-7,0.0026412664,0.1487174,0.014142301,0.7161766,0.000016685983,0.11739933],"study_design_scores_gemma":[0.000365413,0.00069516926,0.00042071292,0.0000834545,0.0000060982356,0.0000034139327,0.00008472814,0.9490784,0.006274504,0.042717,0.00008243512,0.00018870586],"about_ca_topic_score_codex":0.000012027072,"about_ca_topic_score_gemma":7.970467e-7,"teacher_disagreement_score":0.800361,"about_ca_system_score_codex":0.000022732427,"about_ca_system_score_gemma":0.00023818293,"threshold_uncertainty_score":0.60055417},"labels":[],"label_agreement":null},{"id":"W2934743019","doi":"10.1088/2058-9565/ab79b1","title":"Quantum circuit optimizations for NISQ architectures","year":2020,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"National Research Council Canada; Canadian Institute for Advanced Research","keywords":"Quantum circuit; Quantum computer; Quantum algorithm; Quantum Fourier transform; Quantum gate; Quantum error correction; Qubit; Quantum; Quantum phase estimation algorithm","score_opus":0.01790373739786528,"score_gpt":0.24483562405383885,"score_spread":0.22693188665597358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2934743019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10418032,0.00031311112,0.8491116,0.044748988,0.00026992479,0.00035101757,0.000008260283,0.00087800075,0.00013874167],"genre_scores_gemma":[0.9314723,0.000014218482,0.06703345,0.0013537806,0.00007090381,0.00003337091,0.0000011408425,0.000012528772,0.000008296795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978297,0.000018718254,0.0002557481,0.00090470415,0.00035562334,0.000635521],"domain_scores_gemma":[0.9987481,0.00014496381,0.00010669682,0.0004986651,0.0002755652,0.00022598106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039965817,0.0002044765,0.00025212354,0.0005077518,0.00084999297,0.00024992894,0.0018769252,0.000114683455,0.000002812875],"category_scores_gemma":[0.0007647061,0.00017437867,0.000046744324,0.003036832,0.0010119972,0.00018484544,0.00062074256,0.00027828108,0.000009129351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034936859,0.000030319585,0.00015386702,0.000022776328,0.000008123479,0.000009595778,0.0006514539,0.0012114074,0.008570919,0.921162,0.00025502365,0.06792103],"study_design_scores_gemma":[0.00025433287,0.00040372636,0.00011829592,0.000011988522,0.0000049185933,0.00006688007,0.00006817321,0.85832626,0.0031836703,0.13329,0.004042784,0.00022901014],"about_ca_topic_score_codex":0.000006724731,"about_ca_topic_score_gemma":0.0000014111876,"teacher_disagreement_score":0.85711485,"about_ca_system_score_codex":0.000019870544,"about_ca_system_score_gemma":0.0003076789,"threshold_uncertainty_score":0.7110956},"labels":[],"label_agreement":null},{"id":"W2936032794","doi":"10.22331/q-2019-08-12-173","title":"A polar decomposition for quantum channels (with applications to bounding error propagation in quantum circuits)","year":2019,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Canada First Research Excellence Fund; Industry Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Quantum; Unitary state; Bounding overwatch; Fidelity; Factorization; Polar; Leverage (statistics); Quantum error correction; Quantum circuit; Process (computing)","score_opus":0.016282893573502186,"score_gpt":0.2811181849416891,"score_spread":0.2648352913681869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936032794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4042997,0.000048461483,0.5916126,0.0015822274,0.00046650844,0.0017249786,0.000011930472,0.00020898075,0.00004464872],"genre_scores_gemma":[0.97993714,0.0000019686868,0.018715441,0.00046688586,0.00022684531,0.0005182327,0.00003802292,0.00004628621,0.00004915768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728715,0.00010206272,0.00048486842,0.0009630146,0.00041322666,0.00074965775],"domain_scores_gemma":[0.9984088,0.00022613411,0.00021125092,0.0007832444,0.00016773457,0.00020282994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006577814,0.0003310646,0.00039198744,0.0005309009,0.0003182587,0.00035044682,0.000908675,0.000117484844,0.000006197517],"category_scores_gemma":[0.000033849214,0.00029413513,0.00010827827,0.0012136169,0.00003527012,0.00043473553,0.0001601548,0.0002868173,0.00015464847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001161108,0.0006214868,0.0028260117,0.00044275125,0.00006283081,0.00002224288,0.0050133592,0.057389222,0.031180441,0.8742342,0.00047195467,0.027619362],"study_design_scores_gemma":[0.00081819174,0.0007706369,0.0020844068,0.00023526233,0.000009291027,0.00004716071,0.000112404414,0.9697018,0.0008417956,0.021212334,0.0036616703,0.00050503446],"about_ca_topic_score_codex":0.00007330391,"about_ca_topic_score_gemma":0.000021330277,"teacher_disagreement_score":0.91231257,"about_ca_system_score_codex":0.00014846382,"about_ca_system_score_gemma":0.00014541206,"threshold_uncertainty_score":0.99995106},"labels":[],"label_agreement":null},{"id":"W2938693938","doi":"10.1109/tit.2021.3063093","title":"Polarization of Quantum Channels using Clifford-based Channel Combining","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"Agence Nationale de la Recherche","keywords":"Polar; Computer science; Quantum; Physics; Quantum mechanics","score_opus":0.060355496473122196,"score_gpt":0.20159826265799133,"score_spread":0.14124276618486914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938693938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40827173,0.00003215685,0.59007996,0.000043793436,0.0011786394,0.0001954305,0.000011301514,0.00013351197,0.000053442738],"genre_scores_gemma":[0.9944952,0.0000079217825,0.0051739295,0.00008488025,0.00009436946,2.402212e-7,0.000025504021,0.000030115852,0.00008782328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978472,0.00018953797,0.00032742368,0.0010383168,0.00016198985,0.0004355049],"domain_scores_gemma":[0.9976747,0.00014122769,0.0006337645,0.0011931788,0.0002295239,0.0001276084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035626054,0.00037804444,0.00053157966,0.0005110408,0.00018265954,0.0001107742,0.0017165269,0.00033734346,0.0000046576156],"category_scores_gemma":[0.00003229891,0.0004327818,0.0002822362,0.0008004731,0.000097647666,0.00020175305,0.0015686463,0.00064160186,0.000011378453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014105388,0.00008113083,0.0007249061,0.00015979215,0.000044999375,0.000035598805,0.00022372176,0.9715845,0.00015615812,0.026778052,0.000009364179,0.00018768306],"study_design_scores_gemma":[0.00054809457,0.000104202685,0.00026630625,0.00041087228,0.000041617826,0.0000038216913,0.000027081,0.98192185,0.0005238458,0.015694713,0.000018687735,0.00043888766],"about_ca_topic_score_codex":0.00023640765,"about_ca_topic_score_gemma":0.0000017646702,"teacher_disagreement_score":0.5862235,"about_ca_system_score_codex":0.00010504161,"about_ca_system_score_gemma":0.00036466966,"threshold_uncertainty_score":0.9998124},"labels":[],"label_agreement":null},{"id":"W2939431538","doi":"10.1007/s11005-020-01298-6","title":"Perfect state transfer on weighted graphs of the Johnson scheme","year":2020,"lang":"en","type":"article","venue":"Letters in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Transfer (computing); State (computer science); Mathematics; Simple (philosophy); Discrete mathematics; Physics; Algorithm; Computer science","score_opus":0.012339147977417822,"score_gpt":0.21198431792825131,"score_spread":0.19964516995083348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939431538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.537587,0.0000053468407,0.45211086,0.009930951,0.0000525861,0.00012271253,0.0000016821251,0.000046462428,0.00014243538],"genre_scores_gemma":[0.96155024,0.0000014002064,0.032189667,0.006181117,0.00005728222,0.000004235113,3.21004e-7,0.000013203559,0.0000025335082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887717,0.00009177246,0.00023056878,0.00025500802,0.00032844997,0.0002170512],"domain_scores_gemma":[0.999335,0.00019414283,0.000037958667,0.00036712267,0.000013088481,0.000052685853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011332711,0.00014394289,0.00022359347,0.000023706412,0.000047304246,0.000033128115,0.00073337054,0.000025714397,0.000003730468],"category_scores_gemma":[0.000022424154,0.000091596004,0.0001395732,0.0005497055,0.000088252,0.000059008707,0.00011291927,0.00035326448,0.000015706994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053079857,0.0009227994,0.0004926405,0.00091863656,0.00011674402,0.000056547226,0.022152193,0.023218486,0.089613914,0.79711336,0.0019550717,0.063386515],"study_design_scores_gemma":[0.00031533762,0.000083822204,0.00036799596,0.00014463182,0.0000041506937,0.0000016582832,0.0000040007367,0.81748635,0.017780514,0.16358492,0.00006787764,0.00015876797],"about_ca_topic_score_codex":0.0000013652112,"about_ca_topic_score_gemma":1.1103114e-7,"teacher_disagreement_score":0.79426783,"about_ca_system_score_codex":0.000009660716,"about_ca_system_score_gemma":0.000012154859,"threshold_uncertainty_score":0.37351766},"labels":[],"label_agreement":null},{"id":"W2940425080","doi":"10.1103/physrevlett.123.230504","title":"Integrating Neural Networks with a Quantum Simulator for State Reconstruction","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":146,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Air Force Office of Scientific Research; Institute for Quantum Information and Matter, California Institute of Technology; Natural Sciences and Engineering Research Council of Canada; Institut Périmètre de physique théorique; Flatiron Health; Simons Foundation; National Defense Science and Engineering Graduate; U.S. Department of Energy; Gordon and Betty Moore Foundation; Industry Canada; National Institutes of Health; Catholic University of America; National Science Foundation","keywords":"Observable; Computer science; Quantum; Wave function; Restricted Boltzmann machine; Regularization (linguistics); Quantum simulator; Artificial neural network; Physics; Statistical physics; Simulation; Artificial intelligence; Quantum computer; Quantum mechanics","score_opus":0.008113777563416111,"score_gpt":0.24980945842013258,"score_spread":0.24169568085671647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940425080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43965912,0.00051254523,0.55596465,0.0030393742,0.0002625609,0.00045389286,9.845652e-7,0.00009995863,0.0000069183448],"genre_scores_gemma":[0.9676841,0.00005800991,0.022287011,0.009657212,0.0002552556,0.000030902986,0.0000030681135,0.000019575029,0.000004849944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988487,0.00006909567,0.00019674061,0.00040672583,0.00016328963,0.00031546],"domain_scores_gemma":[0.99910814,0.0002674811,0.0001471005,0.00035786867,0.000046352696,0.0000730369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016243351,0.00018296216,0.00033672483,0.000026825497,0.00007908204,0.00008845809,0.00037199917,0.000006993381,0.0000017004238],"category_scores_gemma":[0.0000220943,0.00012165683,0.00014569152,0.000271261,0.00003297474,0.00019874475,0.00007354816,0.00023769356,0.000010757647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016366808,0.00004523473,0.00029652627,0.0006816314,0.00004452131,0.0000053865156,0.00021515152,0.54459983,0.0009829405,0.002667284,0.0004386042,0.4500065],"study_design_scores_gemma":[0.00019698396,0.00015258677,0.00009529643,0.0008541026,0.000011004155,0.000017455368,0.0000016368099,0.997521,0.00002173654,0.000333469,0.0006103163,0.00018444135],"about_ca_topic_score_codex":0.000004975882,"about_ca_topic_score_gemma":4.752261e-7,"teacher_disagreement_score":0.53367764,"about_ca_system_score_codex":0.000019872377,"about_ca_system_score_gemma":0.000014836641,"threshold_uncertainty_score":0.49610215},"labels":[],"label_agreement":null},{"id":"W2942934279","doi":"10.1126/sciadv.aay5901","title":"Bias-preserving gates with stabilized cat qubits","year":2020,"lang":"en","type":"article","venue":"Science Advances","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Waterloo; Université de Sherbrooke","funders":"Army Research Office; Division of Materials Research; Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; National Science Foundation","keywords":"Qubit; Topology (electrical circuits); Overhead (engineering); Noise (video); Quantum computer; Code (set theory); Upper and lower bounds; Path (computing)","score_opus":0.021058325378328684,"score_gpt":0.2560153880962628,"score_spread":0.2349570627179341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942934279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7925953,0.0009188547,0.19275895,0.011135096,0.00039889084,0.00023672645,0.0000022324314,0.0005964498,0.0013574882],"genre_scores_gemma":[0.81186837,0.000008432613,0.18712087,0.00086529995,0.00009253356,0.0000059366143,3.0673417e-7,0.0000071996706,0.000031064978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978476,0.000038713468,0.00016833466,0.0007544718,0.00068081246,0.0005100703],"domain_scores_gemma":[0.9988989,0.00013791537,0.00010374001,0.00045800162,0.0001326949,0.00026872518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038328566,0.0001643041,0.0001761451,0.000088018765,0.00048656864,0.00038742332,0.0021254332,0.000016959024,0.000010732871],"category_scores_gemma":[0.00025518364,0.00011027249,0.000033516746,0.0021170112,0.0004632035,0.0015890927,0.00061030686,0.00012491124,0.0000240397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006968329,0.00013188968,0.014309509,0.00018222719,0.000021631398,0.00013519858,0.020284565,0.16382831,0.11824888,0.014313838,0.00027295423,0.6682013],"study_design_scores_gemma":[0.0004841512,0.00057928526,0.0019065721,0.00008629658,0.0000038139174,0.00003129045,0.00037339696,0.93110025,0.049938574,0.0035893444,0.01140977,0.0004972319],"about_ca_topic_score_codex":0.000015001437,"about_ca_topic_score_gemma":0.000012379406,"teacher_disagreement_score":0.76727194,"about_ca_system_score_codex":0.000020327852,"about_ca_system_score_gemma":0.00024819144,"threshold_uncertainty_score":0.44967818},"labels":[],"label_agreement":null},{"id":"W2943531133","doi":"10.2172/1527395","title":"Quantum Computing as a High School Module","year":2019,"lang":"en","type":"report","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Colorado Boulder; Office of Science; University of Waterloo; University of St Andrews; Fermilab; High Energy Physics; U.S. Department of Energy","keywords":"Quantum computer; Bridge (graph theory); Intersection (aeronautics); Computer science; Key (lock); Field (mathematics); Quantum; Mathematics education; Computational science; Physics; Quantum mechanics; Mathematics; Engineering; Pure mathematics","score_opus":0.017495099968413565,"score_gpt":0.2709911176543765,"score_spread":0.2534960176859629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943531133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018505702,0.0012739546,0.82002294,0.0017244308,0.016174229,0.00090206094,0.000018973462,0.0023540626,0.13902365],"genre_scores_gemma":[0.592033,0.0004085866,0.30102417,0.0029266851,0.0076565817,0.00002161316,0.00014689608,0.0003476148,0.095434815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99470145,0.00013474858,0.00078592106,0.0015973229,0.0018606214,0.0009199473],"domain_scores_gemma":[0.9961177,0.00027119106,0.0005659654,0.0021408685,0.00054858683,0.00035569837],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011226911,0.0007039947,0.0009746946,0.0004142131,0.00028390248,0.0006987666,0.002846506,0.0005031279,0.00016677822],"category_scores_gemma":[0.0003167431,0.000582382,0.0003968532,0.00061976496,0.00005350444,0.00019631266,0.0020270145,0.001476968,0.0021352551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013797933,0.00044935365,0.0006963793,0.0012448013,0.00070751406,0.0009088462,0.00055121037,0.048030905,0.00012051753,0.11166408,0.3745139,0.4610987],"study_design_scores_gemma":[0.00032984448,0.00022725988,0.0011488526,0.00048436364,0.000022871518,0.0006450973,0.000008183342,0.8679903,0.00007185085,0.0069522704,0.121078864,0.0010402274],"about_ca_topic_score_codex":0.0020294862,"about_ca_topic_score_gemma":0.000008103268,"teacher_disagreement_score":0.8199594,"about_ca_system_score_codex":0.0002642343,"about_ca_system_score_gemma":0.0027632788,"threshold_uncertainty_score":0.99966276},"labels":[],"label_agreement":null},{"id":"W2943616864","doi":"10.22331/q-2020-06-25-286","title":"On the Entanglement Cost of One-Shot Compression","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Computer science; Quantum teleportation; LOCC; Qubit; Theoretical computer science; Multipartite entanglement; Squashed entanglement; W state; Quantum channel; Quantum mechanics; Quantum; Physics","score_opus":0.07052478021086277,"score_gpt":0.2761754842004897,"score_spread":0.20565070398962693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943616864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4638604,0.00015779032,0.48627,0.04637875,0.0006013297,0.00054450426,0.000015290918,0.00024292157,0.0019290317],"genre_scores_gemma":[0.9943806,0.0000045325646,0.0027498577,0.0027647144,0.00007903391,0.0000050176045,0.000001652505,0.000006474123,0.000008153013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989418,0.000091182264,0.00019281954,0.00025383398,0.0003342509,0.00018611895],"domain_scores_gemma":[0.9991648,0.00023578967,0.00010202956,0.00038254735,0.000031501088,0.000083319705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016095916,0.00010698728,0.00014241012,0.000025991574,0.00011996918,0.000045290362,0.0008395826,0.000024905858,0.000041525087],"category_scores_gemma":[0.00004502356,0.0000669567,0.0000655265,0.00023869118,0.000041782605,0.00004068721,0.00028451678,0.00018096155,0.000039962906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044538923,0.0003107972,0.00015484577,0.000054085012,0.00004643011,0.000022144724,0.004235154,0.009876251,0.013351015,0.8991285,0.0163557,0.056420553],"study_design_scores_gemma":[0.00023251247,0.00037611378,0.00055543944,0.00007468027,0.0000034159048,0.0000019627307,0.000037124406,0.9747003,0.01142254,0.0064519825,0.0060284594,0.00011550539],"about_ca_topic_score_codex":0.000009495392,"about_ca_topic_score_gemma":4.5938836e-7,"teacher_disagreement_score":0.964824,"about_ca_system_score_codex":0.000008998194,"about_ca_system_score_gemma":0.000023010272,"threshold_uncertainty_score":0.27304152},"labels":[],"label_agreement":null},{"id":"W2944028372","doi":"10.1007/978-3-662-43948-7_26","title":"The Bose-Hubbard Model is QMA-complete","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Boson; Subspace topology; Hamiltonian (control theory); Computation; Particle system; Graph; Perturbation (astronomy)","score_opus":0.017225380801346044,"score_gpt":0.23492014758792562,"score_spread":0.21769476678657956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944028372","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009924383,0.0006429606,0.9871963,0.0060157827,0.0022436613,0.00037831036,0.000010267861,0.00031263317,0.0031008003],"genre_scores_gemma":[0.08346736,0.00016042816,0.8945303,0.01629529,0.00216817,0.000021438947,0.0000062840613,0.00015051925,0.0032001932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940142,0.000068894646,0.00076562306,0.0022124976,0.0016260828,0.0013127208],"domain_scores_gemma":[0.994858,0.0010537559,0.0004408347,0.0030484484,0.00030066306,0.0002983005],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016402671,0.0008642403,0.00071821193,0.0005431654,0.0013068024,0.0015453709,0.0082062995,0.00036888378,0.0000082677325],"category_scores_gemma":[0.00010072794,0.0006088856,0.00032567236,0.0006240783,0.0012193699,0.0002460359,0.0028850813,0.0016527754,0.00011686261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030805465,0.0000082078805,0.0000024993108,0.00001678773,0.000012312312,0.000022099464,0.0007166057,0.3392299,0.000032822943,0.025407871,0.0002878071,0.63426],"study_design_scores_gemma":[0.0001318958,0.00008526052,0.000008505237,0.00014867687,0.0000048811494,0.000041066476,5.524709e-8,0.6398452,0.000121577956,0.34908998,0.010014116,0.0005087692],"about_ca_topic_score_codex":0.000017349976,"about_ca_topic_score_gemma":0.00003257286,"teacher_disagreement_score":0.6337512,"about_ca_system_score_codex":0.00020567927,"about_ca_system_score_gemma":0.0006417585,"threshold_uncertainty_score":0.9999934},"labels":[],"label_agreement":null},{"id":"W2945077829","doi":"10.22331/q-2020-08-13-307","title":"Quantum-inspired algorithms in practice","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":131,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Air Force Office of Scientific Research; Army Research Office; Multidisciplinary University Research Initiative; Intelligence Advanced Research Projects Activity; National Science Foundation","keywords":"Benchmark (surveying); Computer science; Algorithm; Speedup; Rank (graph theory); Quantum algorithm; Overhead (engineering); Variety (cybernetics); Dimension (graph theory); Time complexity; Computational complexity theory; Quantum; Matrix (chemical analysis); Quantum computer; Theoretical computer science; Mathematics; Parallel computing; Artificial intelligence","score_opus":0.020341642041867905,"score_gpt":0.26411608916566426,"score_spread":0.24377444712379637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945077829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09405164,0.0010450375,0.8250371,0.074097425,0.0014591826,0.00049238926,0.0000087184235,0.001308193,0.0025002798],"genre_scores_gemma":[0.90447825,0.000042009935,0.08750168,0.007494183,0.00041286927,0.000013530912,0.000004101797,0.00003280518,0.000020542051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974749,0.00022024085,0.00045182797,0.00078713935,0.0004766333,0.0005892279],"domain_scores_gemma":[0.9985529,0.00034369025,0.00016827726,0.0005649063,0.000086168526,0.00028402018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045322737,0.00027282094,0.00033276138,0.00013345368,0.00013736066,0.00021991968,0.0013106335,0.00010347512,0.00001027333],"category_scores_gemma":[0.00047099902,0.00025253423,0.00010722046,0.0011878277,0.000054349675,0.00057685317,0.00044236184,0.00055255054,0.00025957072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012577651,0.00085485156,0.00080495636,0.00013338603,0.000116791976,0.0025707865,0.01886072,0.017891867,0.0026617208,0.6159361,0.007835431,0.3322076],"study_design_scores_gemma":[0.0005640179,0.00031839786,0.0007663466,0.00003340959,0.0000061251662,0.000061964885,0.00012657724,0.95791155,0.0002294469,0.0036334563,0.036008015,0.00034070614],"about_ca_topic_score_codex":0.000118800286,"about_ca_topic_score_gemma":0.0000037112275,"teacher_disagreement_score":0.94001967,"about_ca_system_score_codex":0.000037373677,"about_ca_system_score_gemma":0.0001289237,"threshold_uncertainty_score":0.99999267},"labels":[],"label_agreement":null},{"id":"W2945680873","doi":"10.1002/qute.201900070","title":"Expressibility and Entangling Capability of Parameterized Quantum Circuits for Hybrid Quantum‐Classical Algorithms","year":2019,"lang":"en","type":"article","venue":"Advanced Quantum Technologies","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":797,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; Canadian Institute for Advanced Research","funders":"Army Research Office","keywords":"Quantum circuit; Parameterized complexity; Electronic circuit; Qubit; Quantum gate; Circuit design; Measure (data warehouse); Quantum; Quantum algorithm","score_opus":0.013719391952618678,"score_gpt":0.2563795871454434,"score_spread":0.24266019519282472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945680873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6747074,0.00083443563,0.3211923,0.0006002681,0.00048446964,0.0008659295,0.000042881926,0.0012584802,0.000013829893],"genre_scores_gemma":[0.8987351,0.00009394799,0.10095491,0.000036746853,0.000023761824,0.00010494359,0.000007897288,0.000032427186,0.000010278688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613273,0.000118881195,0.00089171657,0.0015435808,0.00044745838,0.0008656113],"domain_scores_gemma":[0.9958714,0.0013925903,0.00051056955,0.0018900667,0.00023099907,0.00010434743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000764607,0.0005165733,0.0009939991,0.0002733705,0.00022765301,0.00011394865,0.0016259088,0.00025044513,0.0000029798496],"category_scores_gemma":[0.0010675233,0.00044213684,0.00026443467,0.00054922036,0.0005937073,0.00054436835,0.0009501664,0.0005443701,0.0000061297046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015803588,0.00054770836,0.0026182467,0.000832585,0.00012129791,0.000026701297,0.00069742237,0.0028292928,0.12361786,0.15072161,0.000059604758,0.7177696],"study_design_scores_gemma":[0.0012863611,0.00082487514,0.0008728977,0.0001671064,0.000014908699,0.000035181536,0.0003871568,0.7393402,0.05921052,0.1967614,0.00056907145,0.000530333],"about_ca_topic_score_codex":0.000016282422,"about_ca_topic_score_gemma":0.0000015444742,"teacher_disagreement_score":0.7365109,"about_ca_system_score_codex":0.00007211816,"about_ca_system_score_gemma":0.00009413887,"threshold_uncertainty_score":0.99980307},"labels":[],"label_agreement":null},{"id":"W2945813936","doi":"10.1007/s11128-020-02642-4","title":"Benchmarking quantum processors with a single qubit","year":2020,"lang":"en","type":"preprint","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Agnostiq (Canada); University of Toronto","funders":"","keywords":"Benchmark (surveying); Computer science; Qubit; Benchmarking; TRACE (psycholinguistics); Context (archaeology); Quantum computer; Noise (video); Set (abstract data type); Algorithm; Quantum circuit; Computer engineering; Quantum algorithm; Controlled NOT gate; State (computer science); Task (project management); IBM; Theoretical computer science; Quantum; Quantum gate; Quantum error correction; Artificial intelligence; Physics; Programming language","score_opus":0.01774593362097329,"score_gpt":0.23261187563815952,"score_spread":0.21486594201718623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945813936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031067077,0.0003786385,0.96079123,0.0032268842,0.0007867238,0.0006663751,0.000017128104,0.0015867382,0.0014791797],"genre_scores_gemma":[0.8883516,0.000013119304,0.10959346,0.0013469129,0.00041285876,0.00008343822,0.00013983602,0.00004912591,0.000009635314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585253,0.000092317176,0.0011668529,0.0008881703,0.0012008568,0.0007992564],"domain_scores_gemma":[0.9965917,0.00008703467,0.0015929465,0.0008212046,0.00059712754,0.0003100027],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00051395694,0.0007776349,0.000719054,0.0005159873,0.0006565597,0.0031486964,0.0021348854,0.0003713575,0.000008402541],"category_scores_gemma":[0.00012853357,0.0006534742,0.00017052598,0.0012062845,0.0001271453,0.003097771,0.0016653006,0.0015996364,0.00006754923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011065698,0.00021192791,0.00014018659,0.006881666,0.00013694153,0.00006946006,0.037708066,0.1269499,0.00014356231,0.024670267,0.0011173147,0.80186003],"study_design_scores_gemma":[0.0004272726,0.00031936905,0.00013272298,0.0016331462,0.0000307095,0.00009758991,0.00022736876,0.97759205,0.00032406952,0.013625186,0.004646032,0.00094446115],"about_ca_topic_score_codex":0.00003658975,"about_ca_topic_score_gemma":0.000003182893,"teacher_disagreement_score":0.85728455,"about_ca_system_score_codex":0.00015823761,"about_ca_system_score_gemma":0.0011058698,"threshold_uncertainty_score":0.99959165},"labels":[],"label_agreement":null},{"id":"W2945916077","doi":"10.1038/s41467-019-13068-7","title":"Characterizing large-scale quantum computers via cycle benchmarking","year":2019,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":248,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity; Industry Canada; Canada First Research Excellence Fund; Austrian Science Fund; Government of Ontario; Government of Canada; Office of the Director of National Intelligence; Österreichische Forschungsförderungsgesellschaft; NIH Office of the Director; Canadian Institute for Advanced Research; U.S. Department of Defense","keywords":"Quantum computer; Qubit; Scalability; Quantum gate; Quantum; Set (abstract data type); Benchmarking; Noise (video)","score_opus":0.008022780285507302,"score_gpt":0.25317420762008963,"score_spread":0.24515142733458234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945916077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27712065,0.0030056671,0.68827105,0.020123994,0.0044913786,0.00073124183,0.000025802285,0.0012747024,0.0049555274],"genre_scores_gemma":[0.81924975,0.000047256344,0.17876092,0.0017223641,0.00012323748,0.000008172732,0.00004239901,0.000017091013,0.00002879657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983355,0.00018210607,0.00029831543,0.0004572243,0.00028543433,0.00044142565],"domain_scores_gemma":[0.99597836,0.00036837123,0.00017743574,0.0032524772,0.000109515124,0.00011386472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000445595,0.00021109503,0.00024754906,0.00016642289,0.0005406893,0.00022785075,0.0039804922,0.00021785051,0.00001332194],"category_scores_gemma":[0.00001867439,0.00020246702,0.00013805463,0.0006390862,0.000053137584,0.00034358486,0.0020474265,0.001403445,0.00013483939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023411076,0.0017477217,0.024893614,0.00016608162,0.0003221074,0.000026720469,0.020848528,0.0079889055,0.023385976,0.5026407,0.0065757856,0.4113804],"study_design_scores_gemma":[0.00023443972,0.000041464777,0.013138226,0.00006482343,0.000004869353,0.000029229745,0.000028372157,0.930052,0.00011179438,0.0011770475,0.05486125,0.00025651805],"about_ca_topic_score_codex":0.000012602118,"about_ca_topic_score_gemma":0.00002622242,"teacher_disagreement_score":0.92206305,"about_ca_system_score_codex":0.00004653864,"about_ca_system_score_gemma":0.000050532097,"threshold_uncertainty_score":0.82563657},"labels":[],"label_agreement":null},{"id":"W2946870964","doi":"10.1103/physrevresearch.2.013061","title":"Hamiltonian engineering of general two-body spin-1/2 interactions","year":2020,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Horizon 2020; Ministry of Science and Technology, Israel; Israel Science Foundation; European Commission; Canadian Institute for Advanced Research","keywords":"Hamiltonian (control theory); Zeeman effect; Icosahedral symmetry; Symmetry (geometry); Rotation (mathematics)","score_opus":0.055703243718495,"score_gpt":0.40892893468366065,"score_spread":0.35322569096516565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946870964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.432305,0.029694712,0.45527452,0.072335936,0.0007800574,0.0020980476,0.000022032293,0.0008017175,0.0066879727],"genre_scores_gemma":[0.97850996,0.00065967377,0.019447627,0.00058326573,0.00071442075,0.000023234063,0.0000020797988,0.00001636643,0.000043353455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836504,0.00016318883,0.00021976476,0.0003477339,0.00055174745,0.00035253278],"domain_scores_gemma":[0.998904,0.00026681373,0.00004472836,0.00040693465,0.00016186986,0.0002156517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038614424,0.00011365806,0.00030194514,0.000064786036,0.000079749305,0.00005431946,0.00093197025,0.000009752595,0.000011808522],"category_scores_gemma":[0.00036522944,0.00009187503,0.0001467628,0.0011093117,0.00004888041,0.00012224235,0.0006005028,0.00061000336,0.00009563227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011608351,0.0005812829,0.000072715535,0.004849001,0.00012941795,0.00008965172,0.0018631675,0.01387209,0.2024616,0.27694753,0.009891944,0.48923],"study_design_scores_gemma":[0.00008896913,0.00012602781,0.00026239088,0.00059457443,0.00000392598,0.00000503612,0.0000011886366,0.9733659,0.003625344,0.0007089691,0.021115016,0.000102630074],"about_ca_topic_score_codex":0.000028360835,"about_ca_topic_score_gemma":4.2510018e-7,"teacher_disagreement_score":0.9594938,"about_ca_system_score_codex":0.000020048685,"about_ca_system_score_gemma":0.000068009744,"threshold_uncertainty_score":0.3746555},"labels":[],"label_agreement":null},{"id":"W2946979177","doi":"10.5430/ijfr.v10n4p17","title":"An Introduction to Quantum Computers and Their Effect on Banking Institutions","year":2019,"lang":"en","type":"article","venue":"International Journal of Financial Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"George Mason University","keywords":"Leverage (statistics); Quantum computer; Computer science; Quantum; Computer security; Cryptography; Theoretical computer science; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.024326317303500718,"score_gpt":0.3486481542300381,"score_spread":0.3243218369265374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946979177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8594597,0.00002581488,0.1291939,0.008192692,0.002906984,0.0001170929,0.0000020956554,0.000016429718,0.00008528324],"genre_scores_gemma":[0.99331427,0.0000057581046,0.0044836453,0.00025545244,0.0019191414,0.0000015057477,0.0000010106988,0.0000056762087,0.000013554299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982473,0.00022963063,0.00024562978,0.0002691677,0.0007738196,0.00023444186],"domain_scores_gemma":[0.9985289,0.000376009,0.00009106922,0.00023181827,0.0006307674,0.00014143763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019474756,0.0001027826,0.00016183151,0.0007275882,0.0001484843,0.00031054416,0.0011726901,0.000044493514,0.000006541029],"category_scores_gemma":[0.00039496398,0.000075967815,0.00006188983,0.00036667145,0.000053472235,0.00035526193,0.00024498487,0.000580817,0.000023249002],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018422835,0.00012485865,0.00067055033,0.000008011365,0.000027212933,0.00006314949,0.0012050024,0.022079239,0.008842933,0.14552702,0.0012392055,0.8200286],"study_design_scores_gemma":[0.002908726,0.018636843,0.13466305,0.0008162055,0.000005605654,0.0012764022,0.000053045384,0.66666824,0.017043225,0.022398872,0.13485847,0.00067130063],"about_ca_topic_score_codex":0.00001488921,"about_ca_topic_score_gemma":0.0000030724136,"teacher_disagreement_score":0.8193573,"about_ca_system_score_codex":0.00011077092,"about_ca_system_score_gemma":0.00022906822,"threshold_uncertainty_score":0.30978775},"labels":[],"label_agreement":null},{"id":"W2948312251","doi":"10.1007/978-3-030-20656-7_7","title":"Layout-Aware Embedding for Quantum Annealing Processors","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Qubit; Quantum annealing; Embedding; Simulated annealing; Quantum computer; Theoretical computer science; Quantum; Graph; Node (physics); Algorithm; Artificial intelligence","score_opus":0.01724713969966172,"score_gpt":0.2683333825979079,"score_spread":0.25108624289824616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948312251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006094092,0.00050824246,0.9924979,0.0009593115,0.0036675679,0.00090239587,0.00002090104,0.00039321455,0.00044105522],"genre_scores_gemma":[0.20532408,0.000028216098,0.78934354,0.0022947344,0.0019487437,0.000030271305,0.000026451116,0.00016520718,0.0008387732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944859,0.00003346919,0.0007313178,0.0024440826,0.0010637186,0.0012414674],"domain_scores_gemma":[0.99629897,0.00095166155,0.0005044749,0.0015800006,0.00043228842,0.00023262139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001223826,0.0008363558,0.0008769218,0.000997304,0.0005501068,0.00092293654,0.004564053,0.0004621781,0.000007631733],"category_scores_gemma":[0.0001405444,0.00074658904,0.00029919253,0.0007047986,0.0004018812,0.00052728824,0.0015378321,0.0011337392,0.000037730024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008488926,0.000020500689,0.000022663446,0.00022445305,0.000018500794,0.000039031875,0.0015647972,0.60762376,0.000039642702,0.013208842,0.000031151096,0.3771982],"study_design_scores_gemma":[0.00033850278,0.0002537801,0.00001623327,0.0008482376,0.000009704248,0.00007138811,4.1648298e-7,0.92116654,0.00030926184,0.073709816,0.0023946564,0.0008814416],"about_ca_topic_score_codex":0.000013308559,"about_ca_topic_score_gemma":0.00001654831,"teacher_disagreement_score":0.37631673,"about_ca_system_score_codex":0.00023644396,"about_ca_system_score_gemma":0.0010823434,"threshold_uncertainty_score":0.9994985},"labels":[],"label_agreement":null},{"id":"W2948610381","doi":"10.1109/mc.2019.2908836","title":"Practical Annealing-Based Quantum Computing","year":2019,"lang":"en","type":"article","venue":"Computer","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; Quantum computer; Snapshot (computer storage); Quantum annealing; Quantum; Computational science; Theoretical computer science; Database; Physics; Quantum mechanics","score_opus":0.01647068182102247,"score_gpt":0.274089415214962,"score_spread":0.25761873339393954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948610381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12414351,0.000033916785,0.86954564,0.0031251116,0.0020492552,0.00018565459,9.4596965e-7,0.00058193295,0.00033404984],"genre_scores_gemma":[0.5834124,3.9479386e-7,0.4141168,0.0020129285,0.0004052446,0.0000010870926,0.000003439122,0.00001724539,0.000030427145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777824,0.00014806115,0.00033853,0.0007485487,0.00040726134,0.0005793423],"domain_scores_gemma":[0.99817663,0.00047712435,0.00014900742,0.00091063406,0.00010934474,0.00017728085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044363516,0.0002665212,0.00031047728,0.00015401868,0.00017418069,0.00036067684,0.00095005275,0.000101997866,0.000027968581],"category_scores_gemma":[0.00002124507,0.00023463357,0.00015694223,0.00043955527,0.000045511784,0.00022915743,0.00057769177,0.00043604473,0.0006130744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033359473,0.0005185032,0.0065726377,0.00020198779,0.00010682278,0.0004024459,0.0011858593,0.5205513,0.0004924757,0.17864907,0.026332717,0.26495278],"study_design_scores_gemma":[0.0005126278,0.00021900136,0.0025182841,0.00006753581,0.000003386915,0.000077672266,0.000002993181,0.9863161,0.00019916103,0.00088062015,0.008872757,0.00032986066],"about_ca_topic_score_codex":0.000008600573,"about_ca_topic_score_gemma":3.9332662e-7,"teacher_disagreement_score":0.46576476,"about_ca_system_score_codex":0.000032911343,"about_ca_system_score_gemma":0.000143187,"threshold_uncertainty_score":0.9568079},"labels":[],"label_agreement":null},{"id":"W2948673200","doi":"10.1088/1367-2630/ab4d9a","title":"Quantum-enhanced learning of rotations about an unknown direction","year":2019,"lang":"en","type":"preprint","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Croucher Foundation; National Natural Science Foundation of China; Foundational Questions Institute; Canadian Institute for Advanced Research","keywords":"Quantum memory; Benchmark (surveying); Qubit; Quantum; Computer science; Quantum machine learning; Quantum computer; Theoretical computer science; Quantum mechanics; Physics; Quantum network","score_opus":0.015972230484513093,"score_gpt":0.27185679955726877,"score_spread":0.2558845690727557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948673200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2167242,0.00026532164,0.7806833,0.00011982538,0.0018446955,0.00008310953,0.0000014470702,0.000041153333,0.00023694654],"genre_scores_gemma":[0.93665326,0.00008726507,0.061640102,0.000025865063,0.0014435392,6.4992105e-7,0.0000040737,0.000022149045,0.0001231091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822694,0.00018602681,0.0005888065,0.00029188415,0.00050264585,0.00020369198],"domain_scores_gemma":[0.9972013,0.00013644891,0.0015811855,0.00045276975,0.00049494224,0.00013330877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034436447,0.00022474141,0.00050903956,0.00014668498,0.000098536715,0.00015205835,0.001006784,0.00012591643,0.0000033936044],"category_scores_gemma":[0.00006116301,0.00020086931,0.00030128766,0.0002878064,0.000031246986,0.00030802528,0.00035808957,0.001423163,0.000004747333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006727818,0.000072583294,0.000036478097,0.000053023497,0.000050319064,0.0000023699224,0.0019109711,0.628679,0.0020956479,0.004471437,0.00008131187,0.36254016],"study_design_scores_gemma":[0.0004168286,0.0004991079,0.0015731992,0.00071729464,0.000041660707,0.000024060473,0.00003086449,0.9447002,0.00819017,0.042827986,0.00071566703,0.00026300762],"about_ca_topic_score_codex":0.000047578847,"about_ca_topic_score_gemma":0.0000019201582,"teacher_disagreement_score":0.71992904,"about_ca_system_score_codex":0.000047612328,"about_ca_system_score_gemma":0.0005927082,"threshold_uncertainty_score":0.8191213},"labels":[],"label_agreement":null},{"id":"W2949080538","doi":"10.48550/arxiv.0910.5952","title":"Streaming universal distortion-free entanglement concentration","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum entanglement; Qubit; Block (permutation group theory); Randomness; Mathematics; Binary logarithm; Discrete mathematics; Upper and lower bounds; Combinatorics; Quantum; Physics; Quantum mechanics; Statistics; Mathematical analysis","score_opus":0.01718490996426221,"score_gpt":0.23713414745208453,"score_spread":0.2199492374878223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949080538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6849684,0.00023972424,0.3106288,0.0016585396,0.0013569872,0.00023130656,0.0000134868005,0.00033265332,0.0005700769],"genre_scores_gemma":[0.9796814,0.000038881248,0.019310279,0.00028386223,0.00047844986,0.0000059314157,0.000061410276,0.000014272378,0.0001255343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980301,0.00010024481,0.00034204574,0.00076079683,0.00038456864,0.00038224683],"domain_scores_gemma":[0.9982353,0.000052947114,0.00028065368,0.0012181434,0.00008323436,0.00012976243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019522243,0.00030704346,0.0002607974,0.000077087374,0.00021440511,0.00017300273,0.0015887514,0.00015543458,0.000014492303],"category_scores_gemma":[0.000034657227,0.00030454656,0.00015131063,0.00017028835,0.00004694915,0.00015147573,0.0013869639,0.0005657605,0.000025072733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004124843,0.0010789548,0.20595832,0.0003283856,0.00045904075,0.0007184977,0.011220577,0.10852976,0.0020634737,0.034137696,0.009573894,0.62589014],"study_design_scores_gemma":[0.0015704691,0.00040926956,0.3470146,0.0007051986,0.000090763824,0.000032532706,0.00011959915,0.61869633,0.003344231,0.017355224,0.008973734,0.0016880176],"about_ca_topic_score_codex":0.00009931832,"about_ca_topic_score_gemma":0.000020312402,"teacher_disagreement_score":0.62420213,"about_ca_system_score_codex":0.00023161394,"about_ca_system_score_gemma":0.00017956302,"threshold_uncertainty_score":0.9999407},"labels":[],"label_agreement":null},{"id":"W2949093047","doi":"10.26421/qic15.9-10-3","title":"Tensor networks and graphical calculus for open quantum systems","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Canada Excellence Research Chairs, Government of Canada; Natural Sciences and Engineering Research Council of Canada; Foundational Questions Institute; Canadian Institute for Advanced Research","keywords":"Multipartite; Quantum entanglement; Tensor (intrinsic definition); Quantum information; Bipartite graph; Mathematics; Fidelity; Quantum; Algebra over a field; Computer science; Calculus (dental); Theoretical computer science; Pure mathematics; Discrete mathematics; Quantum mechanics; Graph; Physics","score_opus":0.02436090355698631,"score_gpt":0.27455046523211335,"score_spread":0.250189561675127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949093047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044342548,0.00029902274,0.9528762,0.0009684776,0.0006570386,0.00060454634,0.0000056010294,0.00015554848,0.00009100279],"genre_scores_gemma":[0.98291034,0.000019986783,0.016325455,0.00054264214,0.00008985924,0.000044361568,0.00005033916,0.0000076285396,0.000009408934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988033,0.00007652769,0.00043008348,0.00022725934,0.00021598168,0.00024681672],"domain_scores_gemma":[0.9989977,0.00014711428,0.00021476814,0.00016242663,0.00026074774,0.00021728255],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00071721413,0.00016491752,0.00022310895,0.0001587115,0.0002773601,0.0012836076,0.0003551685,0.000093118266,2.0631182e-7],"category_scores_gemma":[0.00006503204,0.00014026172,0.000032032764,0.00028359247,0.000052739775,0.0014170744,0.00029122352,0.0001304932,0.000004461743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005499428,0.00003425545,0.00018346733,0.000086528016,0.000024784114,0.0000018058897,0.002113303,0.22508836,0.0000020044965,0.6345992,0.0030483117,0.13476296],"study_design_scores_gemma":[0.001080718,0.00028967691,0.0011344863,0.00003505885,0.000006623912,0.000077730845,0.00026752183,0.98149437,0.0000015774978,0.010538999,0.0048696357,0.00020360514],"about_ca_topic_score_codex":0.00009564926,"about_ca_topic_score_gemma":0.0000018147838,"teacher_disagreement_score":0.93856776,"about_ca_system_score_codex":0.00002051035,"about_ca_system_score_gemma":0.00006697392,"threshold_uncertainty_score":0.9997532},"labels":[],"label_agreement":null},{"id":"W2949119876","doi":"10.1109/tit.2019.2915242","title":"Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"National Research Foundation Singapore","keywords":"Randomness; Trace distance; Computer science; Decoding methods; Alice and Bob; Algorithm; Theoretical computer science; Mathematics; Quantum; Quantum state; Statistics; Quantum mechanics; Alice (programming language)","score_opus":0.04634266103087381,"score_gpt":0.23633352703571267,"score_spread":0.18999086600483886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949119876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099505536,0.000021937549,0.8980883,0.00012047992,0.00033077574,0.0004671673,0.000005832491,0.0001764287,0.0012835381],"genre_scores_gemma":[0.9608172,0.000007508555,0.038731143,0.00035968213,0.000019325667,0.000036268495,7.3203506e-7,0.000008325825,0.00001980926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863404,0.00014430586,0.00033491105,0.00025600923,0.0004179288,0.0002128118],"domain_scores_gemma":[0.9987882,0.0004911293,0.00013044443,0.0003150267,0.00014789151,0.00012732203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010030366,0.000181744,0.00021103778,0.00028594388,0.00033757297,0.00025479312,0.0002119903,0.00007471625,0.000007197386],"category_scores_gemma":[0.000036078407,0.00015953218,0.000041108953,0.00030351337,0.00003837044,0.00094107876,0.00000858348,0.00024331336,0.000043976102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027360147,0.00017656559,0.000015570617,0.00021240639,0.000052256666,3.6701383e-7,0.004779449,0.09387542,0.00431186,0.010266793,0.000023924886,0.8860118],"study_design_scores_gemma":[0.0016541563,0.00021974073,0.0014612684,0.00021041659,0.000021992762,0.000058914415,0.00031816258,0.9829312,0.0071648564,0.005229566,0.00037336585,0.0003563781],"about_ca_topic_score_codex":0.0000149465095,"about_ca_topic_score_gemma":4.8711667e-7,"teacher_disagreement_score":0.8890558,"about_ca_system_score_codex":0.00004283432,"about_ca_system_score_gemma":0.000034086854,"threshold_uncertainty_score":0.65055335},"labels":[],"label_agreement":null},{"id":"W2949162070","doi":"10.48550/arxiv.quant-ph/0502030","title":"Oblivious transfer and quantum non-locality","year":2005,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Oblivious transfer; Communication source; Computer science; Theoretical computer science; Cryptography; Locality; Protocol (science); Realization (probability); Encryption; Simple (philosophy); Transfer (computing); Quantum; Mathematics; Algorithm; Computer security; Computer network; Physics; Parallel computing","score_opus":0.022664486040269334,"score_gpt":0.2504380698494494,"score_spread":0.22777358380918006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949162070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7002299,0.0005528827,0.2956688,0.0019449416,0.0008855699,0.0002212471,0.0000099457875,0.00030027697,0.00018646065],"genre_scores_gemma":[0.98923975,0.00013986355,0.009024121,0.00077811,0.0006402989,0.000018580527,0.000008982914,0.00003355385,0.00011671391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971864,0.00012728207,0.00046443802,0.0012731613,0.000362385,0.00058629434],"domain_scores_gemma":[0.99813855,0.00012481873,0.00009352977,0.0013099103,0.00008353533,0.00024966602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046849204,0.0004955318,0.00054464955,0.0001526914,0.00023226184,0.00026394008,0.0014811545,0.00035886734,0.000011208993],"category_scores_gemma":[0.00002727302,0.00044351065,0.00020857707,0.00023260813,0.00014588457,0.00013238032,0.0016391382,0.0013057925,0.00006453999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006787245,0.001365565,0.24350157,0.0015519402,0.0007048585,0.00075517944,0.01880195,0.05185541,0.0019994283,0.013475907,0.0033796593,0.6625407],"study_design_scores_gemma":[0.0004630592,0.00011431403,0.2389271,0.00024844683,0.000031843996,0.00006732657,0.0000130728995,0.7513332,0.0005109108,0.0041881925,0.0032426878,0.00085985445],"about_ca_topic_score_codex":0.000195725,"about_ca_topic_score_gemma":0.000024449044,"teacher_disagreement_score":0.6994778,"about_ca_system_score_codex":0.000045294863,"about_ca_system_score_gemma":0.00016787153,"threshold_uncertainty_score":0.9998017},"labels":[],"label_agreement":null},{"id":"W2949317307","doi":"10.1007/978-3-030-21500-2_6","title":"Sized Types for Low-Level Quantum Metaprogramming","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Metaprogramming; Programmer; Programming language; Subtyping; Context (archaeology); Quantum circuit; Theoretical computer science; Quantum; Quantum computer; Quantum network","score_opus":0.022556353791820295,"score_gpt":0.2553420356084694,"score_spread":0.2327856818166491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949317307","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021417848,0.0007143898,0.9920148,0.0012448952,0.0040008263,0.0009840076,0.000019945288,0.0003217517,0.00048516435],"genre_scores_gemma":[0.0530071,0.000022166061,0.9437495,0.0013395699,0.0009673782,0.00002122395,0.000014434361,0.00009122314,0.00078742515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99490005,0.00004122211,0.00069902063,0.002199153,0.001013857,0.0011467107],"domain_scores_gemma":[0.9959195,0.0012862507,0.00043525416,0.00178106,0.00035914537,0.00021877923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013048049,0.00079539104,0.00096676085,0.00084713724,0.00039283902,0.00087562914,0.0043641888,0.00041273725,0.000010908058],"category_scores_gemma":[0.00018299687,0.00068054686,0.00039009552,0.0006455186,0.00047548919,0.00038581615,0.0015446064,0.00096043246,0.000067322006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010968709,0.000033342345,0.0000044671056,0.000119392345,0.00003191268,0.000029483195,0.00041270765,0.06361641,0.00013799405,0.0440225,0.000026118647,0.8915547],"study_design_scores_gemma":[0.00046905724,0.000265044,0.000031761698,0.0004158535,0.000015611193,0.00004823883,1.1083289e-7,0.8447657,0.0005442335,0.14840804,0.0042464337,0.0007898817],"about_ca_topic_score_codex":0.000017755317,"about_ca_topic_score_gemma":0.000022800223,"teacher_disagreement_score":0.89076483,"about_ca_system_score_codex":0.00018662162,"about_ca_system_score_gemma":0.0010416284,"threshold_uncertainty_score":0.9995646},"labels":[],"label_agreement":null},{"id":"W2949434780","doi":"10.48550/arxiv.0907.5162","title":"Programming with Quantum Communication","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Quantum; Physics; Quantum mechanics","score_opus":0.025008777734288886,"score_gpt":0.25770620155678947,"score_spread":0.23269742382250058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949434780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68604827,0.0008809337,0.30789173,0.0032973217,0.00030159033,0.00039448158,0.00000142269,0.0007766963,0.00040755744],"genre_scores_gemma":[0.81236,0.000052438027,0.18696027,0.0003312614,0.00015375554,0.00002773942,0.000023479235,0.000023755476,0.000067345325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979177,0.00017587478,0.00033294482,0.000775768,0.00034733227,0.00045039272],"domain_scores_gemma":[0.99704444,0.00009080747,0.00032973726,0.0022718739,0.00013788464,0.00012522892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041241132,0.0003693847,0.0003589643,0.00013424525,0.00029963016,0.00034687476,0.0025477023,0.00020306748,0.0000027465678],"category_scores_gemma":[0.000027141383,0.00029820856,0.000120956436,0.00033129976,0.000093229886,0.00013859755,0.0017438326,0.001237718,0.00004631423],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032175638,0.0006598547,0.06210065,0.00031328812,0.00023695009,0.00018061185,0.0055421917,0.036810033,0.00013034236,0.023165753,0.00092626386,0.8699019],"study_design_scores_gemma":[0.00073277,0.00058442575,0.17346951,0.0016441424,0.00005972127,0.000117693,0.000058300342,0.7843527,0.00044770597,0.018709838,0.018163152,0.0016600351],"about_ca_topic_score_codex":0.00010191362,"about_ca_topic_score_gemma":0.0000149052785,"teacher_disagreement_score":0.86824185,"about_ca_system_score_codex":0.000051291543,"about_ca_system_score_gemma":0.0001715878,"threshold_uncertainty_score":0.999947},"labels":[],"label_agreement":null},{"id":"W2949517543","doi":"10.48550/arxiv.0808.0748","title":"Communication in XYZ All-to-All Quantum Networks with a Missing Link","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Link (geometry); Quantum; Computer science; Computer network; Physics; Quantum mechanics","score_opus":0.03777762340208361,"score_gpt":0.27016804084545154,"score_spread":0.2323904174433679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949517543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6328183,0.00094881793,0.35224098,0.012424103,0.000467628,0.00043762484,0.00000174844,0.00036159635,0.00029919817],"genre_scores_gemma":[0.8864995,0.00052245543,0.10986438,0.0026331402,0.00031328754,0.000036486726,0.000036221954,0.000051690662,0.000042842166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971552,0.00030019833,0.0005347947,0.0010108965,0.00034769333,0.0006512435],"domain_scores_gemma":[0.99673647,0.00023187372,0.0003217125,0.0023746325,0.00010789253,0.00022740598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004949973,0.00046451483,0.00052230444,0.00027735138,0.00021130661,0.00024405033,0.002705071,0.00033195227,0.0000022993022],"category_scores_gemma":[0.000046713933,0.00041130543,0.000121417885,0.00053316884,0.00008982631,0.00012573313,0.0027936948,0.0019531634,0.00003252453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026067542,0.00015996158,0.020468688,0.00006425264,0.00008881909,0.00018442787,0.006397365,0.89559025,0.000035687055,0.000379175,0.0005690364,0.07603627],"study_design_scores_gemma":[0.00032279795,0.00010079951,0.054384843,0.0008439034,0.000012289958,0.000066531946,0.000011724944,0.93867713,0.000024247864,0.0009285073,0.004063585,0.0005636607],"about_ca_topic_score_codex":0.00037490574,"about_ca_topic_score_gemma":0.000077726894,"teacher_disagreement_score":0.25368118,"about_ca_system_score_codex":0.00010675805,"about_ca_system_score_gemma":0.00020743997,"threshold_uncertainty_score":0.9998339},"labels":[],"label_agreement":null},{"id":"W2949605446","doi":"10.48550/arxiv.1003.1914","title":"Synthesis of the Optimal 4-bit Reversible Circuits","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Google (Canada)","funders":"National Science Foundation","keywords":"Toffoli gate; Reversible computing; Computer science; Electronic circuit; Benchmark (surveying); Heuristics; Function (biology); Algorithm; Quantum computer; Quantum gate; Quantum","score_opus":0.03142260738140438,"score_gpt":0.17268106775447467,"score_spread":0.1412584603730703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949605446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7544253,0.000034727625,0.24163048,0.0002901972,0.0013378421,0.00021682473,0.000020577309,0.00015893728,0.0018851447],"genre_scores_gemma":[0.9946775,0.00002066651,0.004515718,0.000053765747,0.00009486136,4.4903484e-7,9.675513e-7,0.000015229203,0.0006208438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829066,0.00015471844,0.00020219354,0.00087235856,0.0001442763,0.0003357982],"domain_scores_gemma":[0.9972201,0.00023757895,0.0003662728,0.0019238451,0.00013984436,0.00011236304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029674798,0.00028329808,0.0003500375,0.00017093483,0.00022666993,0.00007529404,0.0040137153,0.00033255896,0.00001933924],"category_scores_gemma":[0.0000923644,0.00024410387,0.00038395496,0.00064029614,0.00020048225,0.00011859704,0.003905124,0.0011582907,0.000019795456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006775168,0.000118397504,0.001007074,0.00014792546,0.0001270454,0.00010046828,0.00040020267,0.9384678,0.00046584543,0.04866516,0.00041419698,0.010079123],"study_design_scores_gemma":[0.00015887903,0.000023326716,0.0020741904,0.00021737178,0.00006627417,0.000013351037,0.000018788767,0.98218036,0.004368872,0.009913628,0.0006012342,0.00036373644],"about_ca_topic_score_codex":0.00012316532,"about_ca_topic_score_gemma":0.000017798016,"teacher_disagreement_score":0.24025223,"about_ca_system_score_codex":0.000054999648,"about_ca_system_score_gemma":0.00027685813,"threshold_uncertainty_score":0.99542665},"labels":[],"label_agreement":null},{"id":"W2949615964","doi":"10.48550/arxiv.1010.4705","title":"Spatial search using the discrete time quantum walk","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Engineering and Physical Sciences Research Council; University of Leeds; Nuffield Foundation","keywords":"Quantum walk; Dimension (graph theory); Scaling; Degree (music); Quantum; Graph; Quantum algorithm; Symmetry (geometry); Computer science; Algorithm; Mathematics; Statistical physics; Combinatorics; Physics; Quantum mechanics; Geometry","score_opus":0.04393948072182336,"score_gpt":0.20299839840949888,"score_spread":0.15905891768767552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949615964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46539775,0.000021644022,0.5329927,0.00025716404,0.0007361852,0.00018586351,0.000012292911,0.00016944087,0.00022694407],"genre_scores_gemma":[0.9935792,0.000013655809,0.005523798,0.00008484493,0.00040321212,1.8031335e-7,0.000009888007,0.000022878363,0.0003623311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975296,0.00029867401,0.00020729385,0.0011824769,0.0002013907,0.00058056705],"domain_scores_gemma":[0.997405,0.00019903669,0.00020123785,0.0018672883,0.00013902735,0.00018844208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048724384,0.00039367538,0.0003433147,0.00019874814,0.0005635381,0.00035013782,0.0035735758,0.00034426517,0.00004778511],"category_scores_gemma":[0.000025870793,0.00031871014,0.00029999492,0.0004998496,0.0002579272,0.00015774762,0.0038319582,0.0021102454,0.000099639896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001799758,0.0000359409,0.00034433402,0.00003382291,0.00007518149,0.00027959136,0.0004750646,0.9767071,0.00022526008,0.017039657,0.00004859787,0.0047174296],"study_design_scores_gemma":[0.00018695214,0.00004705684,0.000777914,0.00006658105,0.000035638288,0.000024021172,0.000015626334,0.9807748,0.00013080891,0.01731221,0.00021585147,0.00041252788],"about_ca_topic_score_codex":0.0012953894,"about_ca_topic_score_gemma":0.0000723987,"teacher_disagreement_score":0.5281815,"about_ca_system_score_codex":0.00006986468,"about_ca_system_score_gemma":0.00032918097,"threshold_uncertainty_score":0.9999265},"labels":[],"label_agreement":null},{"id":"W2949671922","doi":"","title":"Quantum algorithms for the subset-sum problem","year":2013,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristic; Exponent; Computer science; Algorithm; Subset sum problem; Quantum algorithm; Quantum walk; Discrete mathematics; Quantum; Theoretical computer science; Combinatorics; Mathematics; Artificial intelligence; Quantum mechanics; Physics","score_opus":0.02324731095667313,"score_gpt":0.26864942616591614,"score_spread":0.24540211520924302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949671922","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007799031,0.0007141427,0.9706783,0.013314673,0.003653293,0.002636451,0.0001004939,0.00060315244,0.0005004262],"genre_scores_gemma":[0.013199676,0.00014178212,0.98337966,0.0008075702,0.00094187853,0.0013637437,0.000068671805,0.00008112841,0.000015911148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949855,0.0004412753,0.000877002,0.0019316353,0.00044913057,0.0013154268],"domain_scores_gemma":[0.9936945,0.0024800994,0.00065789477,0.0026461598,0.0002580473,0.0002633441],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00090477645,0.00084483484,0.0009352278,0.0002895787,0.00072619086,0.00050879526,0.005427276,0.00048625295,0.000031481653],"category_scores_gemma":[0.00016447292,0.00059210695,0.0006844505,0.00023492455,0.00060271093,0.00011552218,0.006943001,0.0023614173,0.00021473701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001734656,0.000107126594,0.00010760519,0.00014245912,0.00029097576,0.000025726742,0.0027191727,0.016219838,0.00008986775,0.8817463,0.0047782226,0.093755364],"study_design_scores_gemma":[0.0002590736,0.000091525035,0.00088443613,0.00007035949,0.000030395517,0.000068984824,0.000028111,0.47867373,0.00008070822,0.5106042,0.00880289,0.0004056133],"about_ca_topic_score_codex":0.00021968453,"about_ca_topic_score_gemma":0.000041461735,"teacher_disagreement_score":0.46245387,"about_ca_system_score_codex":0.00006775478,"about_ca_system_score_gemma":0.00043101833,"threshold_uncertainty_score":0.99995387},"labels":[],"label_agreement":null},{"id":"W2949698939","doi":"10.48550/arxiv.math/0411098","title":"Simple Permutations Mix Even Better","year":2004,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple (philosophy); Computer science; Combinatorics; Mathematics; Philosophy","score_opus":0.0240248397506421,"score_gpt":0.2662473660892155,"score_spread":0.2422225263385734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949698939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6914353,0.00015528206,0.30275047,0.00386409,0.000926953,0.00019034006,0.000015142032,0.00037658756,0.00028587523],"genre_scores_gemma":[0.9732229,0.00000865719,0.024313834,0.0014903967,0.000661636,0.000029833976,0.00005306649,0.00003396158,0.00018572995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99778074,0.00009000176,0.000370047,0.0009337713,0.00033543396,0.0004900302],"domain_scores_gemma":[0.99814355,0.000104514635,0.00019819496,0.0012957837,0.00010509893,0.0001528435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001896905,0.00036803662,0.00033929062,0.00016332364,0.00027908632,0.00023160984,0.0017291905,0.00023369811,0.00003084137],"category_scores_gemma":[0.000049393802,0.0003428064,0.00024917512,0.00026669484,0.0000690204,0.00012021666,0.0020840473,0.0009977414,0.00030723863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010568412,0.0007039879,0.24307187,0.0005916296,0.0005694074,0.0007469188,0.014364903,0.61848193,0.001108402,0.009808718,0.008346534,0.10219515],"study_design_scores_gemma":[0.0006509828,0.000118007985,0.5337072,0.0003391885,0.000052778967,0.00007646966,0.000026393802,0.3418823,0.0008419721,0.10842063,0.012482856,0.0014012264],"about_ca_topic_score_codex":0.00015891217,"about_ca_topic_score_gemma":0.000014969307,"teacher_disagreement_score":0.29063535,"about_ca_system_score_codex":0.000092467984,"about_ca_system_score_gemma":0.00031235663,"threshold_uncertainty_score":0.99990237},"labels":[],"label_agreement":null},{"id":"W2949723071","doi":"10.48550/arxiv.0810.5495","title":"Two-dimensional quantum random walk","year":2008,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Limit (mathematics); Algebraic number; Quantum walk; Mathematics; Variety (cybernetics); Gaussian; Random walk; Function field of an algebraic variety; Limiting; Quantum; Curvature; Statistical physics; Physics; Quantum algorithm; Mathematical analysis; Quantum mechanics; Geometry; Statistics","score_opus":0.0358767241949326,"score_gpt":0.18467861057298288,"score_spread":0.14880188637805028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949723071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6045855,0.00016849214,0.39114705,0.00025893078,0.0016570765,0.00026443813,0.000013815772,0.00058112975,0.0013235068],"genre_scores_gemma":[0.99079984,0.00008515788,0.007826123,0.0002370838,0.00026837495,6.5986495e-7,0.000017661658,0.000027120548,0.00073799054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718153,0.00024084658,0.00027905352,0.0015294974,0.00020219681,0.00056686904],"domain_scores_gemma":[0.99754506,0.000253008,0.00027964526,0.0014835537,0.00016685961,0.0002718761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002766535,0.0004827809,0.0005364033,0.00032027814,0.00039522946,0.00012258544,0.0023581402,0.0002656237,0.000019332665],"category_scores_gemma":[0.000033706852,0.000496572,0.00042817666,0.00057095307,0.00017565893,0.00018307219,0.0033837294,0.0011086029,0.00014928401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003768048,0.00008755567,0.00011961161,0.000023646795,0.00007536275,0.0011697679,0.00017706405,0.9623388,0.000022413418,0.033792187,0.00085598335,0.0012998957],"study_design_scores_gemma":[0.0015272809,0.00005011854,0.0002566526,0.000096942844,0.000027234679,0.000083841405,0.0000059235153,0.9571145,0.000057972506,0.03959492,0.00061576534,0.00056882383],"about_ca_topic_score_codex":0.00021168753,"about_ca_topic_score_gemma":0.000008510972,"teacher_disagreement_score":0.3862143,"about_ca_system_score_codex":0.00011407584,"about_ca_system_score_gemma":0.00035046344,"threshold_uncertainty_score":0.9997486},"labels":[],"label_agreement":null},{"id":"W2949755764","doi":"10.48550/arxiv.1503.05679","title":"Determination and correction of persistent biases in quantum annealers","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Spurious relationship; Benchmark (surveying); Quantum; Set (abstract data type); Computer science; Noise (video); Calibration; Statistical physics; Algorithm; Physics; Quantum mechanics; Artificial intelligence; Machine learning","score_opus":0.07082741840287485,"score_gpt":0.20512800891976052,"score_spread":0.13430059051688567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949755764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857213,0.0001378997,0.012867051,0.000048328297,0.0008078394,0.00014212303,0.0000049543637,0.000069929316,0.00020058402],"genre_scores_gemma":[0.99921393,0.00006205025,0.0005699077,0.000013357132,0.00002816901,2.9286278e-7,0.000005660888,0.0000069761527,0.00009963928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882877,0.00012680661,0.00017021898,0.00059641333,0.000079835096,0.0001979797],"domain_scores_gemma":[0.9990298,0.00012325983,0.00021445284,0.0004049148,0.00012909382,0.000098441094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003025939,0.00017624257,0.0002488499,0.0003843058,0.000052630174,0.000043592223,0.00050239434,0.00015016143,0.0000012370945],"category_scores_gemma":[0.000075371696,0.00019614173,0.00012881141,0.00040756274,0.00008778318,0.00014195124,0.0007853271,0.00032218435,0.0000016548552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011442048,0.00004521606,0.0013527579,0.00004015741,0.0000136849885,0.000050619252,0.00065250695,0.9916245,0.0000092840455,0.00017980806,0.000044699635,0.00597535],"study_design_scores_gemma":[0.00027949538,0.00011979207,0.0020707925,0.00021645808,0.000020413854,0.000010286485,0.00015706947,0.9959803,0.000037282356,0.00088211894,0.00003114843,0.00019482888],"about_ca_topic_score_codex":0.00029493045,"about_ca_topic_score_gemma":0.0000548277,"teacher_disagreement_score":0.013492656,"about_ca_system_score_codex":0.0001206864,"about_ca_system_score_gemma":0.00013032932,"threshold_uncertainty_score":0.7998427},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2949775108","doi":"10.1007/978-1-4614-1800-9_147","title":"Quantum Computational Complexity","year":2011,"lang":"en","type":"book-chapter","venue":"Computational Complexity","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.08558391872999488,"score_gpt":0.2735751312171957,"score_spread":0.1879912124872008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949775108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002393673,0.00046908052,0.7981067,0.0012519317,0.0014122897,0.0006072729,0.00033890706,0.001172695,0.19640177],"genre_scores_gemma":[0.122495785,0.000028554214,0.8193676,0.0036401686,0.0018479788,0.00004034986,0.0028614297,0.0003877019,0.049330436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939749,0.00017514295,0.0013494145,0.0019377095,0.0016855008,0.0008773075],"domain_scores_gemma":[0.99561226,0.00064564997,0.0009831548,0.0013065498,0.00092441577,0.00052794744],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005867617,0.0012253538,0.0012584443,0.0006187299,0.0009901215,0.00043782583,0.0031105883,0.0004930408,0.00087112514],"category_scores_gemma":[0.00004571826,0.0012875019,0.00071780157,0.00025963516,0.0012394412,0.00037677886,0.0017555836,0.0015643319,0.0013195602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020785625,0.000116338626,0.000011005805,0.000074541276,0.00017704393,0.00008326406,0.000273881,0.054175165,5.7388166e-7,0.9299336,0.00631466,0.008819128],"study_design_scores_gemma":[0.0003608154,0.0001240035,0.0013304215,0.0001121523,0.000022708997,0.0001648342,0.0000010835147,0.42697287,8.4788957e-7,0.55027527,0.019859161,0.00077587296],"about_ca_topic_score_codex":0.00006632122,"about_ca_topic_score_gemma":0.000019005844,"teacher_disagreement_score":0.37965837,"about_ca_system_score_codex":0.00025501868,"about_ca_system_score_gemma":0.00069457275,"threshold_uncertainty_score":0.999458},"labels":[],"label_agreement":null},{"id":"W2949835993","doi":"10.48550/arxiv.1310.3235","title":"Hardness of decoding quantum stabilizer codes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; List decoding; Berlekamp–Welch algorithm; Degeneracy (biology); Sequential decoding; Algorithm; Code (set theory); Mathematics; Quantum; Computer science; Concatenated error correction code; Block code; Physics; Quantum mechanics; Set (abstract data type)","score_opus":0.0541364149125702,"score_gpt":0.19247409542941904,"score_spread":0.13833768051684883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949835993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5494222,0.00006633675,0.44889617,0.00005589086,0.0007617661,0.00016308248,0.000010897402,0.00017053196,0.0004531168],"genre_scores_gemma":[0.9895056,0.00005979543,0.009952092,0.000038146092,0.00007264423,7.0997277e-7,0.000006015627,0.000020158448,0.00034486683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979066,0.00017399475,0.00030168943,0.0010648998,0.00013485811,0.00041791797],"domain_scores_gemma":[0.9976258,0.0001817895,0.0003951497,0.001383946,0.000245035,0.00016826841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002946892,0.00035456853,0.00053994416,0.00028296225,0.00014884144,0.00013119435,0.0023806307,0.00025186854,0.000031426614],"category_scores_gemma":[0.000045596382,0.0003634968,0.00028181393,0.00050301134,0.00016591763,0.00022590264,0.00289844,0.0006298783,0.000043199936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001355394,0.00015545478,0.0019600259,0.00029388475,0.00013892622,0.000093215654,0.00078890927,0.7090706,0.00021882527,0.2825834,0.00058172096,0.0041014752],"study_design_scores_gemma":[0.00024147917,0.000046607012,0.0008974872,0.00017722335,0.000027831202,0.000004972084,0.000044471228,0.93465793,0.00036362774,0.062876716,0.00027260033,0.00038904266],"about_ca_topic_score_codex":0.00030647026,"about_ca_topic_score_gemma":0.000013563038,"teacher_disagreement_score":0.44008335,"about_ca_system_score_codex":0.00008181872,"about_ca_system_score_gemma":0.00020065438,"threshold_uncertainty_score":0.9998817},"labels":[],"label_agreement":null},{"id":"W2949935330","doi":"10.1088/1367-2630/acdf78","title":"The rank of contextuality","year":2023,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"Narodowe Centrum Nauki; Fundacja na rzecz Nauki Polskiej; Narodowym Centrum Nauki; European Commission","keywords":"Kochen–Specker theorem; Rank (graph theory); Mathematics; Physics; Combinatorics; Quantum mechanics; Quantum","score_opus":0.021714959027437277,"score_gpt":0.2704546718846189,"score_spread":0.24873971285718163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949935330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17624517,0.0003464999,0.816866,0.004876638,0.0012259852,0.000050674684,0.000001273579,0.00004409839,0.000343713],"genre_scores_gemma":[0.99081093,0.000050066446,0.008067675,0.000110456596,0.00076952856,8.766707e-8,1.2985345e-7,0.0000055742366,0.00018556115],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921036,0.000059409205,0.0002500739,0.00006192855,0.0002898238,0.00012837799],"domain_scores_gemma":[0.99898934,0.00032898574,0.00028755414,0.00021270062,0.0001243486,0.000057070898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005051026,0.000055925622,0.00013645408,0.000023566989,0.00008374514,0.000047969377,0.0007201891,0.000015009449,6.5912246e-7],"category_scores_gemma":[0.00005503564,0.000032998774,0.00012329289,0.00038364736,0.000039460767,0.00009102979,0.00011328661,0.00017272292,0.000007688276],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008873759,0.000021834885,0.00007291207,0.000006761319,0.000038888586,0.0000115567445,0.0012970836,0.0065833894,0.0011883029,0.051901117,0.010631036,0.9282383],"study_design_scores_gemma":[0.0017766132,0.00058270636,0.009257349,0.00017832789,0.000024523164,0.00010535504,0.00017180246,0.4188008,0.017561266,0.5109007,0.04037997,0.00026061127],"about_ca_topic_score_codex":0.00000763331,"about_ca_topic_score_gemma":7.231135e-7,"teacher_disagreement_score":0.9279776,"about_ca_system_score_codex":0.000006148927,"about_ca_system_score_gemma":0.000120880046,"threshold_uncertainty_score":0.1345651},"labels":[],"label_agreement":null},{"id":"W2949971971","doi":"10.48550/arxiv.1312.6064","title":"Extending Construction X for Quantum Error-Correcting Codes","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hermitian matrix; Quantum; Error detection and correction; Quantum convolutional code; Prime (order theory); Discrete mathematics; Order (exchange); Quantum error correction; Finite field; Mathematics; Computer science; Algorithm; Pure mathematics; Quantum information; Physics; Quantum mechanics; Combinatorics","score_opus":0.056850939017835625,"score_gpt":0.20675139801003628,"score_spread":0.14990045899220067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949971971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4181871,0.00004533978,0.5788549,0.00008663117,0.0020567921,0.00028784465,0.000008419625,0.00035241104,0.00012053591],"genre_scores_gemma":[0.95714307,0.000024868754,0.042207144,0.000046697816,0.00029476694,0.0000030882782,0.000013941888,0.000026893917,0.00023954455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977011,0.0001258743,0.00026216256,0.0012918446,0.00009344085,0.000525543],"domain_scores_gemma":[0.9979708,0.00033292559,0.0004114144,0.0008830135,0.00023977947,0.00016203568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032601506,0.00038494807,0.0004133436,0.00031400376,0.00047378812,0.0003014088,0.0014751153,0.00028561978,0.000008593222],"category_scores_gemma":[0.00008879025,0.00042313524,0.00030505078,0.00041036392,0.00012824818,0.00028796442,0.0014783661,0.00069717487,0.000029658573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000143464185,0.00004874881,0.00096073846,0.00018702282,0.00009843296,0.000052041338,0.00040451172,0.76664805,0.00007176054,0.19532043,0.00026447553,0.03592943],"study_design_scores_gemma":[0.00027162684,0.00005456983,0.00021042452,0.0001616683,0.000033487624,0.000037678747,0.00015240248,0.88379574,0.0001648207,0.11440537,0.00026764226,0.00044459404],"about_ca_topic_score_codex":0.00017876037,"about_ca_topic_score_gemma":0.000023820012,"teacher_disagreement_score":0.5389559,"about_ca_system_score_codex":0.00016289609,"about_ca_system_score_gemma":0.00017071201,"threshold_uncertainty_score":0.999822},"labels":[],"label_agreement":null},{"id":"W2950042952","doi":"10.48550/arxiv.1308.4134","title":"An algorithm for the T-count","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Toffoli gate; Gate count; Quantum computer; Context (archaeology); Quantum gate; Mathematics; Electronic circuit; Computation; Unitary state; Computer science; Algorithm; Discrete mathematics; Qubit; Quantum circuit; Topology (electrical circuits); Combinatorics; Quantum; Quantum error correction; Quantum mechanics; Physics","score_opus":0.039059794342880184,"score_gpt":0.19236443661583352,"score_spread":0.15330464227295335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950042952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035111297,0.00011565341,0.9620609,0.0003305288,0.0013128229,0.0005849186,0.000026814041,0.00033213303,0.00012492461],"genre_scores_gemma":[0.9060606,0.00008015795,0.0919601,0.0004053133,0.00061396445,0.000007358996,0.000019228308,0.000035061403,0.00081824913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980772,0.00009979465,0.00016854193,0.0011077226,0.00010197647,0.0004447435],"domain_scores_gemma":[0.9972879,0.0002921948,0.0002006921,0.0018558974,0.0002001733,0.0001631054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033187945,0.0003331246,0.00027016157,0.00012692036,0.00044290582,0.00039942825,0.0037248996,0.00022307901,0.000012835444],"category_scores_gemma":[0.000013225413,0.00026380687,0.0002590727,0.00031027212,0.00011255118,0.00023965535,0.0014269488,0.0006095304,0.000044233402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037086695,0.000086049455,0.00003484271,0.000029223205,0.000099946315,0.000041393043,0.00035408148,0.76511264,0.000009172564,0.06390247,0.000994525,0.16933197],"study_design_scores_gemma":[0.00023432595,0.00008162892,0.0002738162,0.000029385523,0.000037064165,0.000006187536,0.00003177387,0.9416987,0.000026105165,0.053998906,0.0032353606,0.00034680366],"about_ca_topic_score_codex":0.00025964025,"about_ca_topic_score_gemma":0.000010977892,"teacher_disagreement_score":0.87094927,"about_ca_system_score_codex":0.00007860084,"about_ca_system_score_gemma":0.00016424617,"threshold_uncertainty_score":0.9999814},"labels":[],"label_agreement":null},{"id":"W2950303658","doi":"10.48550/arxiv.quant-ph/0108095","title":"A quantum Goldreich-Levin theorem with cryptographic applications","year":2001,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cryptography; Quantum; Computer science; Quantum cryptography; Mathematics; Theoretical computer science; Quantum mechanics; Quantum information; Computer security; Physics","score_opus":0.018984299341055725,"score_gpt":0.2442665841902108,"score_spread":0.22528228484915508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950303658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31154352,0.00060597656,0.6837242,0.0013927714,0.00032696573,0.0006027747,0.000009964646,0.00073839765,0.0010554044],"genre_scores_gemma":[0.93951905,0.00016499078,0.058514003,0.00057546125,0.000645977,0.00030616965,0.00003059133,0.00006938978,0.00017438362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666315,0.0001969641,0.00046807784,0.001488441,0.00048717484,0.0006961811],"domain_scores_gemma":[0.9964203,0.00020721642,0.00038979726,0.0025462676,0.00018864895,0.00024772005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005019088,0.00060143863,0.0005380952,0.00034813033,0.00037861257,0.00034939527,0.0029106159,0.00030416693,0.000019260393],"category_scores_gemma":[0.00002466327,0.0004748135,0.00027116993,0.0011015056,0.0002452125,0.00012484135,0.0018589053,0.0014161537,0.00013965929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007516022,0.0015772657,0.30960134,0.0008378121,0.0010772364,0.0005331307,0.00404663,0.06881376,0.00061352184,0.38539386,0.0020155585,0.22541475],"study_design_scores_gemma":[0.0010173258,0.00040900992,0.15131976,0.0009534512,0.00014471651,0.0003654203,0.00007522486,0.67289567,0.00025667713,0.13319649,0.03664421,0.002722051],"about_ca_topic_score_codex":0.0001039466,"about_ca_topic_score_gemma":0.000022091943,"teacher_disagreement_score":0.6279755,"about_ca_system_score_codex":0.000044854918,"about_ca_system_score_gemma":0.00026146957,"threshold_uncertainty_score":0.99977034},"labels":[],"label_agreement":null},{"id":"W2950395077","doi":"10.48550/arxiv.0709.0738","title":"A quantum characterization of NP","year":2007,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Soundness; Quantum entanglement; Complexity class; Class (philosophy); Completeness (order theory); Logarithm; Characterization (materials science); Discrete mathematics; Quantum; Context (archaeology); Mathematics; Quantum complexity theory; Binary logarithm; Computer science; Combinatorics; Quantum algorithm; Time complexity; Quantum mechanics; Physics","score_opus":0.039926639394398236,"score_gpt":0.18434225925840678,"score_spread":0.14441561986400853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950395077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.487301,0.000011146809,0.51178586,0.000050659204,0.0004246391,0.000089772155,0.000008796159,0.00011938804,0.00020871774],"genre_scores_gemma":[0.996757,0.0000452143,0.002738531,0.00007986039,0.00010330135,1.5724417e-7,0.000022827948,0.000013735969,0.00023941853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851096,0.00008824866,0.00023979935,0.0007619999,0.000106169864,0.0002927962],"domain_scores_gemma":[0.99832916,0.00006839092,0.0003868313,0.0009511541,0.0001550949,0.00010934788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029206177,0.00024482797,0.0003188807,0.00034664045,0.000087071836,0.000055938042,0.0014875025,0.00023745174,0.000008381824],"category_scores_gemma":[0.000017154736,0.00027006734,0.00018798161,0.0006275802,0.00008150222,0.00014113689,0.001566273,0.0004852135,0.000017614555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006953425,0.00043056463,0.0025115116,0.00047578686,0.00022806459,0.00089219597,0.0014074255,0.48791063,0.0066988254,0.4811389,0.00010139233,0.01813513],"study_design_scores_gemma":[0.00020179187,0.000051685856,0.003781118,0.00010067708,0.00001917174,0.0000091888505,0.0000061097785,0.97884774,0.0006933208,0.015553682,0.00044648332,0.00028901757],"about_ca_topic_score_codex":0.00005596622,"about_ca_topic_score_gemma":0.0000032562446,"teacher_disagreement_score":0.509456,"about_ca_system_score_codex":0.00005408804,"about_ca_system_score_gemma":0.00012861735,"threshold_uncertainty_score":0.99997514},"labels":[],"label_agreement":null},{"id":"W2950457807","doi":"10.48550/arxiv.1204.5936","title":"Maximum-likelihood coherent-state quantum process tomography","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum state; Quantum tomography; Coherent states; Algorithm; Statistical physics; Tensor (intrinsic definition); Quantum; Computer science; A priori and a posteriori; Quantum process; Process (computing); Estimator; Physics; Quantum mechanics; Mathematics; Statistics; Quantum dynamics","score_opus":0.030889571057333084,"score_gpt":0.19042519705607686,"score_spread":0.15953562599874377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950457807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5065746,0.0002531594,0.49004683,0.00011108654,0.0013558479,0.00033426462,0.000026543374,0.0006422409,0.0006554606],"genre_scores_gemma":[0.9967532,0.0000652763,0.0026175152,0.00012393182,0.00021238124,0.000002196192,0.000019580448,0.000042331554,0.00016355427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966467,0.00019601783,0.00032648272,0.0015817907,0.00022213595,0.0010268559],"domain_scores_gemma":[0.99712,0.00009735751,0.00043102086,0.0016547828,0.00022717977,0.00046964033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036474896,0.00063181674,0.00054297026,0.0004785489,0.00030732513,0.0002724705,0.0032770962,0.00032364426,0.000024555668],"category_scores_gemma":[0.000015540898,0.0006607551,0.0004431254,0.001162173,0.00015969164,0.00037927215,0.0024849786,0.0012522949,0.00013404056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001217954,0.0014209029,0.019453803,0.0012486567,0.00092685514,0.0014377165,0.005606856,0.81791556,0.00010018715,0.08074607,0.0011682644,0.06985335],"study_design_scores_gemma":[0.00043123757,0.000067723806,0.0018130353,0.00017062254,0.000060209033,0.000018256746,0.000040233892,0.7856803,0.00012363009,0.21020648,0.0005550085,0.00083324086],"about_ca_topic_score_codex":0.00011250768,"about_ca_topic_score_gemma":0.000017637487,"teacher_disagreement_score":0.49017867,"about_ca_system_score_codex":0.00009093138,"about_ca_system_score_gemma":0.00025257215,"threshold_uncertainty_score":0.9995844},"labels":[],"label_agreement":null},{"id":"W2950467956","doi":"10.48550/arxiv.1204.2439","title":"Degenerate Viterbi decoding","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity; Fonds Québécois de la Recherche sur la Nature et les Technologies; Compute Canada","keywords":"Convolutional code; Algorithm; Sequential decoding; Decoding methods; Computer science; Degenerate energy levels; Viterbi decoder; Soft output Viterbi algorithm; Iterative Viterbi decoding; List decoding; Viterbi algorithm; Mathematics; Block code; Concatenated error correction code; Physics; Quantum mechanics","score_opus":0.05847697119351735,"score_gpt":0.18603176021680873,"score_spread":0.12755478902329137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950467956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3954464,0.00016246234,0.60172147,0.000088050045,0.001246698,0.00010555699,0.0000055331366,0.0003296949,0.00089415],"genre_scores_gemma":[0.9804118,0.000053444845,0.018321829,0.0001606265,0.00038822435,4.392529e-7,0.000008628365,0.000022427983,0.00063254463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795413,0.00015027646,0.0001885116,0.0010303465,0.00009302199,0.0005837404],"domain_scores_gemma":[0.99810076,0.00008831192,0.00022035214,0.0012375364,0.00008828097,0.00026478496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002973081,0.00036783126,0.00032345677,0.00023537005,0.000253486,0.0002199352,0.0021058102,0.00025916524,0.00001970374],"category_scores_gemma":[0.000014841557,0.00039541515,0.00023876669,0.0004699341,0.00006287077,0.00025828663,0.0033353928,0.00076164515,0.00013187443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008302093,0.000095429605,0.0016779876,0.00008337351,0.00010148562,0.00033884583,0.0005829082,0.87375605,0.00016745932,0.10814319,0.0004042386,0.014640721],"study_design_scores_gemma":[0.0001913122,0.000017700591,0.00050580973,0.00007856855,0.000030465284,0.000016481583,0.0000072837997,0.98233825,0.00034459177,0.015053215,0.00092304527,0.0004932775],"about_ca_topic_score_codex":0.000055352026,"about_ca_topic_score_gemma":0.000008694238,"teacher_disagreement_score":0.5849654,"about_ca_system_score_codex":0.00011178939,"about_ca_system_score_gemma":0.00011955794,"threshold_uncertainty_score":0.9998498},"labels":[],"label_agreement":null},{"id":"W2950488211","doi":"10.48550/arxiv.1212.6253","title":"Efficient Clifford+T approximation of single-qubit operators","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity","keywords":"Combinatorics; Mathematics; Sequence (biology); Operator (biology); Binary logarithm; Product (mathematics); Constant (computer programming); Polynomial; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.04388913428643814,"score_gpt":0.18153605230225098,"score_spread":0.13764691801581283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950488211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51566327,0.000056966695,0.48278576,0.000032944445,0.0005744776,0.00016708464,0.0000066395132,0.00012882885,0.0005840653],"genre_scores_gemma":[0.98797464,0.000007015796,0.011732474,0.000032500164,0.000118904165,4.918829e-7,0.000009180201,0.000016524164,0.00010829106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982705,0.00013919034,0.0002790501,0.00077715085,0.0001425699,0.00039152152],"domain_scores_gemma":[0.99814713,0.00008448571,0.00036743385,0.001076452,0.00016139146,0.00016312207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003381613,0.0003040747,0.00037221107,0.00027489173,0.00013525586,0.00007950053,0.0015095024,0.00023921399,0.000009696662],"category_scores_gemma":[0.000025667381,0.0003129163,0.00022753593,0.00059575296,0.00010921012,0.00009309261,0.0019132929,0.0004647059,0.000026864012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074212026,0.00021924436,0.00033615626,0.00010201241,0.000039776474,0.000018181086,0.0006006546,0.9473594,0.00024565365,0.047360428,0.000027609616,0.0036834516],"study_design_scores_gemma":[0.00024890437,0.000051178176,0.00042095888,0.00012057264,0.000033388154,0.0000051676793,0.000028169394,0.9941312,0.0008937336,0.0036168029,0.000114856426,0.0003350355],"about_ca_topic_score_codex":0.000043829405,"about_ca_topic_score_gemma":0.0000023267996,"teacher_disagreement_score":0.47231138,"about_ca_system_score_codex":0.00011641465,"about_ca_system_score_gemma":0.0001155289,"threshold_uncertainty_score":0.9999323},"labels":[],"label_agreement":null},{"id":"W2950522577","doi":"10.26421/qic15.5-6-1","title":"The Trotter step size required for accurate quantum simulation of quantum chemistry","year":2015,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Scaling; Statistical physics; Computer science; Quantum; Algorithm; Quantum mechanics; Mathematics; Physics","score_opus":0.022749020320635117,"score_gpt":0.2797801669984358,"score_spread":0.25703114667780064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950522577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11309861,0.00008634086,0.88458556,0.0011560381,0.00044008484,0.0003914687,0.000009930968,0.00014005529,0.00009190323],"genre_scores_gemma":[0.9908814,0.000008789895,0.008705818,0.00022859541,0.000083968735,0.000026330556,0.000038521866,0.0000093044955,0.000017309347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982525,0.000081347855,0.0007704948,0.0002084745,0.00040387778,0.0002833041],"domain_scores_gemma":[0.99753803,0.00088646397,0.0006063421,0.00028892694,0.00055517285,0.00012509138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088948396,0.0002000999,0.00022261214,0.00007029978,0.00035180207,0.00040000302,0.0003916725,0.000096356525,9.901755e-7],"category_scores_gemma":[0.00041667168,0.00015184346,0.00008400823,0.000322348,0.00008624218,0.0011971114,0.00012674053,0.00013199281,0.000008444678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019873718,0.00005440381,0.000046913567,0.00020770372,0.000045308247,6.9235625e-7,0.004531728,0.7290746,0.00022532124,0.06721813,0.0015999167,0.19679658],"study_design_scores_gemma":[0.0010873077,0.000187218,0.00044784846,0.0000338318,0.00000877063,0.000009635716,0.00037393344,0.9696318,0.000220942,0.022261478,0.0055456185,0.0001916512],"about_ca_topic_score_codex":0.000016209258,"about_ca_topic_score_gemma":5.8636374e-7,"teacher_disagreement_score":0.87778276,"about_ca_system_score_codex":0.000038566395,"about_ca_system_score_gemma":0.00014067545,"threshold_uncertainty_score":0.61919963},"labels":[],"label_agreement":null},{"id":"W2950625729","doi":"10.48550/arxiv.1408.3955","title":"Ancilla-free synthesis of large reversible functions using binary decision diagrams","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Binary decision diagram; Binary number; Exponential function; Computer science; Function (biology); Algorithm; Boolean function; Theoretical computer science; Mathematics; Arithmetic","score_opus":0.03905006450911135,"score_gpt":0.19525613461498176,"score_spread":0.1562060701058704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950625729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45640323,0.000057895526,0.54237425,0.000037824113,0.000640319,0.00010682709,0.000031179017,0.00012717188,0.00022131261],"genre_scores_gemma":[0.9705277,0.00005132866,0.02906172,0.00004228997,0.00012425549,4.0349232e-7,0.0000056916992,0.000021611602,0.00016498056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977729,0.00020232495,0.00029136264,0.0010983016,0.000183121,0.00045199567],"domain_scores_gemma":[0.99639106,0.00053928787,0.0003972483,0.0022875704,0.00020899765,0.00017581719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005390098,0.00034585825,0.00050764513,0.00045579858,0.00032786716,0.00007613888,0.0025282947,0.00030660068,0.00001863722],"category_scores_gemma":[0.0002180087,0.000367295,0.00038128084,0.00088225043,0.000102513106,0.0001831682,0.004799583,0.00055285345,0.000025715037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024330844,0.00012714,0.0015881588,0.00011728687,0.00008596512,0.00011205686,0.00010913781,0.98430395,0.00009903428,0.007924069,0.00081540836,0.0046934686],"study_design_scores_gemma":[0.000331431,0.00006026627,0.001125838,0.00042203645,0.00008493474,0.000009501418,0.000028947508,0.98011553,0.00017838507,0.016690644,0.00056206615,0.0003903938],"about_ca_topic_score_codex":0.00013347513,"about_ca_topic_score_gemma":0.000025669178,"teacher_disagreement_score":0.5141245,"about_ca_system_score_codex":0.00014047178,"about_ca_system_score_gemma":0.00020309996,"threshold_uncertainty_score":0.9998779},"labels":[],"label_agreement":null},{"id":"W2950680601","doi":"","title":"Oracles Are Subtle But Not Malicious","year":2005,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Oracle; Argument (complex analysis); Computer science; Upper and lower bounds; Discrete mathematics; Electronic circuit; Boolean function; Boolean circuit; Theoretical computer science; Mathematics; Combinatorics; Algorithm; Quantum mechanics; Physics","score_opus":0.04589625493814718,"score_gpt":0.1817524367002666,"score_spread":0.13585618176211944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950680601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.705059,0.000099082754,0.29199833,0.00056793995,0.0007339735,0.00016966002,0.00003016975,0.0005729409,0.0007688945],"genre_scores_gemma":[0.9894215,0.000075898286,0.0074939094,0.0004172706,0.00039508374,5.0550346e-7,0.0000086776045,0.000028337501,0.002158859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976167,0.00013744402,0.00022198592,0.0013560692,0.00014486565,0.00052290945],"domain_scores_gemma":[0.9976616,0.00011253884,0.00034452355,0.0015281859,0.00013380095,0.00021938009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020808609,0.0004216271,0.00042313544,0.00027625635,0.00025525037,0.00022331494,0.0026901609,0.0003228462,0.000024111903],"category_scores_gemma":[0.000026183545,0.00045722394,0.0002856841,0.00045382764,0.00011116008,0.00018062678,0.003127707,0.0009305055,0.00019832859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018396257,0.00013544247,0.0009729239,0.00007500697,0.00008470614,0.0010634707,0.00033642622,0.9591441,0.00006318057,0.028093658,0.0007153859,0.009297306],"study_design_scores_gemma":[0.00030433928,0.000037593112,0.0034143347,0.00012349646,0.00003191344,0.000026125877,0.000036424703,0.9837479,0.00038290033,0.008944547,0.0023393016,0.0006110999],"about_ca_topic_score_codex":0.00020524445,"about_ca_topic_score_gemma":0.000061162544,"teacher_disagreement_score":0.2845044,"about_ca_system_score_codex":0.00014031371,"about_ca_system_score_gemma":0.00016445635,"threshold_uncertainty_score":0.9997879},"labels":[],"label_agreement":null},{"id":"W2950695032","doi":"10.48550/arxiv.0907.5149","title":"High performance single-error-correcting quantum codes for amplitude damping","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Block code; Code word; Luby transform code; Linear code; Dimension (graph theory); Quantum; Construct (python library); Encoding (memory); Expander code; Decoding methods; Algorithm; Computer science; Mathematics; Physics; Quantum mechanics; Combinatorics","score_opus":0.04792537121981303,"score_gpt":0.2761056043847968,"score_spread":0.2281802331649838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950695032","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.595781,0.00023138204,0.3997297,0.00073891133,0.002536043,0.00036101253,0.000008518251,0.00056512747,0.00004827774],"genre_scores_gemma":[0.8870121,0.000027710073,0.11099736,0.0006553738,0.0010831724,0.000049581293,0.000048294383,0.000053919575,0.00007243919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617463,0.00012204181,0.00073953974,0.0015460281,0.0004200379,0.0009976979],"domain_scores_gemma":[0.9970641,0.00043214278,0.0006080336,0.0014806882,0.00023165302,0.00018335764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008438554,0.00067294936,0.0007754543,0.00025062292,0.00066360825,0.0005016688,0.0023852007,0.00035343567,0.0000033384936],"category_scores_gemma":[0.00020042191,0.0006459299,0.00032146313,0.0003516687,0.00008092988,0.00023876636,0.0017208472,0.0012517518,0.000030041678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007309263,0.00062483136,0.04049731,0.0013439658,0.0002915778,0.00006519007,0.005481712,0.44275123,0.0027768207,0.0041391156,0.0009446995,0.5010105],"study_design_scores_gemma":[0.000436085,0.00036896297,0.043414205,0.0010984115,0.000035943398,0.000059181042,0.000037526344,0.9424426,0.0041103205,0.005758415,0.0011743101,0.0010640322],"about_ca_topic_score_codex":0.000118278214,"about_ca_topic_score_gemma":0.000009953975,"teacher_disagreement_score":0.49994642,"about_ca_system_score_codex":0.00014786776,"about_ca_system_score_gemma":0.0001830048,"threshold_uncertainty_score":0.9995992},"labels":[],"label_agreement":null},{"id":"W2950732706","doi":"10.48550/arxiv.quant-ph/0301141","title":"Shor's discrete logarithm quantum algorithm for elliptic curves","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Post-quantum cryptography; Quantum computer; Quantum algorithm; Integer factorization; Qubit; Elliptic curve; Schoof's algorithm; Mathematics; Counting points on elliptic curves; Elliptic curve cryptography; Quantum Fourier transform; Algorithm; Modulo; Logarithm; Cryptography; Discrete mathematics; Quantum; Quantum error correction; Public-key cryptography; Computer science; Pure mathematics; Quantum mechanics; Encryption; Physics; Mathematical analysis; Quarter period","score_opus":0.030748110713166646,"score_gpt":0.27513218251803284,"score_spread":0.2443840718048662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950732706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03323218,0.0052106404,0.95160586,0.0029872374,0.0048521366,0.0011215878,0.000108388835,0.00064832845,0.00023366835],"genre_scores_gemma":[0.1336403,0.002012289,0.8521504,0.00548795,0.0028861691,0.000608986,0.00037367886,0.00032711023,0.002513149],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524236,0.00024436612,0.00087179086,0.0019410489,0.0005807031,0.0011197361],"domain_scores_gemma":[0.9963596,0.0003760881,0.00050990813,0.0021642921,0.00026794485,0.00032216974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000912836,0.0008537356,0.00094236754,0.00023615615,0.00041289596,0.00034719068,0.0028689175,0.00046724363,0.000018318435],"category_scores_gemma":[0.00016413095,0.0007685958,0.0006330748,0.00041014995,0.00017182445,0.00020068145,0.0020810717,0.0014203627,0.00009483265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045724548,0.0016301689,0.014742751,0.006571555,0.0021120491,0.0007671423,0.0033731991,0.031977613,0.0005851736,0.03017662,0.06421339,0.8438046],"study_design_scores_gemma":[0.00048525073,0.00022267383,0.0030748905,0.0010252086,0.000084352476,0.000066352615,0.000012426999,0.96083164,0.0004212417,0.012730517,0.019808903,0.001236549],"about_ca_topic_score_codex":0.000061742765,"about_ca_topic_score_gemma":0.000004586252,"teacher_disagreement_score":0.92885405,"about_ca_system_score_codex":0.00009671525,"about_ca_system_score_gemma":0.00035168848,"threshold_uncertainty_score":0.9994765},"labels":[],"label_agreement":null},{"id":"W2950810033","doi":"10.48550/arxiv.1012.4427","title":"Quantum interactive proofs with weak error bounds","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research","keywords":"PSPACE; Soundness; Mathematical proof; Completeness (order theory); Complexity class; Proof complexity; Mathematics; Discrete mathematics; Class (philosophy); Computer-assisted proof; Quantum; Bounded function; Turing machine; Computer science; Computational complexity theory; Time complexity; Algorithm; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.031274709444419305,"score_gpt":0.1932767970677666,"score_spread":0.16200208762334728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950810033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4933809,0.000023795285,0.502525,0.00031817297,0.0011039659,0.00030414687,0.000011235248,0.00044165616,0.0018911537],"genre_scores_gemma":[0.9879692,0.000009602859,0.010494908,0.00010015707,0.00020181651,0.0000017707085,0.000012096714,0.00003614718,0.0011742624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972586,0.00014479601,0.00021626994,0.0016448027,0.00016760199,0.0005679547],"domain_scores_gemma":[0.99726695,0.00014553021,0.00039102175,0.0017009138,0.00023977444,0.0002558287],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00023310899,0.00053106033,0.00046570608,0.00034170755,0.00031799218,0.00035968164,0.0027296217,0.0003803546,0.000021178259],"category_scores_gemma":[0.000028833296,0.0004822218,0.00022350237,0.0006316958,0.00023762218,0.0003610805,0.0027576091,0.0023888361,0.00006593925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023255596,0.00057290634,0.0017579239,0.00023271806,0.00050514966,0.0017557705,0.002715939,0.70623285,0.00018683613,0.27492937,0.00079813134,0.010079878],"study_design_scores_gemma":[0.0004617213,0.0002055115,0.00097250874,0.00020414765,0.0000460703,0.000052040334,0.00006823086,0.96316886,0.00012648529,0.03173739,0.0022832137,0.0006738121],"about_ca_topic_score_codex":0.00018621521,"about_ca_topic_score_gemma":0.00013592622,"teacher_disagreement_score":0.49458832,"about_ca_system_score_codex":0.00012809258,"about_ca_system_score_gemma":0.00043959325,"threshold_uncertainty_score":0.9999127},"labels":[],"label_agreement":null},{"id":"W2950844200","doi":"10.48550/arxiv.1405.6015","title":"Multipartite Quantum Correlation and Communication Complexities","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multipartite; Mathematics; LOCC; Quantum state; Quantum information science; Bipartite graph; Communication complexity; State (computer science); Quantum; Multipartite entanglement; Discrete mathematics; W state; Bounded function; Statistical physics; Combinatorics; Quantum entanglement; Quantum mechanics; Algorithm; Physics; Squashed entanglement","score_opus":0.051365761999865124,"score_gpt":0.1896535650692326,"score_spread":0.13828780306936747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950844200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3617096,0.00013016492,0.6369137,0.00020672579,0.0002658431,0.0001310167,0.0000050366675,0.00023525467,0.00040268],"genre_scores_gemma":[0.98975813,0.00009582899,0.009728689,0.00009857799,0.00005679096,5.700572e-7,0.000027735168,0.000012899233,0.00022074684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854565,0.00026530554,0.00018728526,0.0006877658,0.00007573834,0.00023824307],"domain_scores_gemma":[0.99811023,0.00024568322,0.00026339543,0.0011648067,0.00010448832,0.000111362235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029009377,0.00024746018,0.0002735109,0.00017050547,0.0003255843,0.00019601191,0.0011409073,0.00018831216,0.000004387532],"category_scores_gemma":[0.000029764626,0.00027523187,0.000092592476,0.0002044381,0.00018722429,0.00018388394,0.002208583,0.000595215,0.00002535805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063937073,0.000025608473,0.00086467876,0.000047300036,0.000025017838,0.000010306359,0.0005949934,0.6556656,0.0000054668903,0.34084532,0.00013819909,0.0017711325],"study_design_scores_gemma":[0.00024079133,0.000030936044,0.0034928205,0.00011514208,0.000018141967,0.000006217644,0.000027532204,0.8738681,0.000007107809,0.12134152,0.0005818884,0.00026979562],"about_ca_topic_score_codex":0.00018739993,"about_ca_topic_score_gemma":0.00002671122,"teacher_disagreement_score":0.6280486,"about_ca_system_score_codex":0.000056473593,"about_ca_system_score_gemma":0.0000499167,"threshold_uncertainty_score":0.99996996},"labels":[],"label_agreement":null},{"id":"W2950872758","doi":"10.26421/qic8.10-1","title":"The geometry of quantum computation","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum; Oracle; Complexity class; Quantum complexity theory; Mathematics; Class (philosophy); Quantum algorithm; Quantum computer; Discrete mathematics; Combinatorics; Computer science; Quantum mechanics; Time complexity; Physics","score_opus":0.011819555094252514,"score_gpt":0.2373156616422663,"score_spread":0.2254961065480138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950872758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30754253,0.00013251166,0.6910211,0.0005685468,0.00031282142,0.00012319289,0.0000019471388,0.000114945644,0.00018243407],"genre_scores_gemma":[0.98901373,0.00010155051,0.010618212,0.00019691448,0.00003296408,0.0000049708483,0.000019815878,0.0000047219796,0.0000071412114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859303,0.000081622115,0.00057427085,0.00014735265,0.00039347104,0.00021022576],"domain_scores_gemma":[0.99878526,0.00031900356,0.00039310235,0.00018067383,0.00025052152,0.00007145823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041009032,0.0001431645,0.00016348295,0.0002087874,0.0006872677,0.00015861014,0.00030516044,0.00005709408,8.2113615e-7],"category_scores_gemma":[0.00006531605,0.000106545274,0.000058768695,0.00056986365,0.00014019216,0.000941992,0.00013027647,0.00015008955,0.000020535992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028161765,0.000054801916,0.0005380567,0.0000790592,0.000035497902,0.0000031719849,0.005827296,0.09914043,0.000053577995,0.30093953,0.0017107886,0.5915896],"study_design_scores_gemma":[0.00035608682,0.00013200704,0.0143661415,0.00001744134,0.000002913732,0.00009524296,0.00013809801,0.97118354,0.000082889914,0.011874374,0.0016201814,0.000131077],"about_ca_topic_score_codex":0.000030524072,"about_ca_topic_score_gemma":6.543341e-7,"teacher_disagreement_score":0.87204313,"about_ca_system_score_codex":0.000017850887,"about_ca_system_score_gemma":0.00007826877,"threshold_uncertainty_score":0.52859765},"labels":[],"label_agreement":null},{"id":"W2950944671","doi":"10.48550/arxiv.quant-ph/0305182","title":"Continuous-time quantum walks on the symmetric group","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Group (periodic table); Quantum walk; Mathematics; Quantum; Physics; Quantum mechanics; Quantum algorithm","score_opus":0.022395881105953547,"score_gpt":0.23089713227009062,"score_spread":0.20850125116413706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950944671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9612927,0.00054864684,0.02703646,0.004151908,0.0029018815,0.0005801427,0.0000133434105,0.0005730327,0.0029018982],"genre_scores_gemma":[0.9917478,0.000051784078,0.0038327253,0.002861683,0.0005548136,0.000049105733,0.000016250566,0.000062494844,0.00082336465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625677,0.00047928668,0.0005307044,0.0013325585,0.0006258467,0.00077486463],"domain_scores_gemma":[0.9960801,0.0007909145,0.0004102056,0.0024213672,0.000116965086,0.00018044513],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00088399963,0.0006232519,0.0006180592,0.00032393215,0.00043243592,0.000398451,0.0033914198,0.00031630642,0.000042609758],"category_scores_gemma":[0.00030081978,0.00042262292,0.00038614668,0.0009128563,0.0001241647,0.00007862775,0.0020220082,0.0019921248,0.0010269802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012799966,0.0033009672,0.09862317,0.0007174715,0.001860472,0.0014452363,0.00638464,0.028343339,0.0015331509,0.46139517,0.102542095,0.2937263],"study_design_scores_gemma":[0.00081864727,0.0009175582,0.21476446,0.0006479471,0.00008339794,0.0001068425,0.000029186436,0.7174639,0.0005410507,0.025768952,0.036518253,0.002339799],"about_ca_topic_score_codex":0.00006200236,"about_ca_topic_score_gemma":0.0000031010104,"teacher_disagreement_score":0.6891206,"about_ca_system_score_codex":0.00008382139,"about_ca_system_score_gemma":0.0001226024,"threshold_uncertainty_score":0.99982256},"labels":[],"label_agreement":null},{"id":"W2951064298","doi":"10.48550/arxiv.1502.05095","title":"Experimental Detection of Entanglement Polytopes via Local Filters","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Polytope; Quantum entanglement; Mathematics; Type (biology); Spectral line; Combinatorics; Discrete mathematics; Topology (electrical circuits); Physics; Quantum mechanics; Quantum","score_opus":0.038069919475412405,"score_gpt":0.19071094055798374,"score_spread":0.15264102108257133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951064298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3922932,0.00010194153,0.60662305,0.0000226521,0.0005691097,0.00012121015,0.0000059351755,0.0001025005,0.0001603583],"genre_scores_gemma":[0.997269,0.000006636924,0.0024842774,0.00003784707,0.00007983275,6.2488635e-7,0.000006341531,0.00001280409,0.000102645616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848706,0.00011791242,0.00021094964,0.0007609078,0.00014343737,0.00027971301],"domain_scores_gemma":[0.998696,0.000034459434,0.00024807025,0.00075973506,0.00010189614,0.0001598009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018918538,0.0002687624,0.00029101965,0.00021573728,0.00009156008,0.000047458463,0.0011942761,0.00015659368,0.000011091558],"category_scores_gemma":[0.000005360064,0.00029070702,0.00018777403,0.00031440382,0.00012882799,0.00013070999,0.0020301207,0.00036163852,0.000015412988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054279975,0.00028513945,0.0001364076,0.00006439701,0.000121764264,0.00019865762,0.001409474,0.9612293,0.006262407,0.004417582,0.00013222844,0.025688339],"study_design_scores_gemma":[0.0003938069,0.00020625835,0.00008574766,0.0000647391,0.000020174177,0.000010972265,0.00016268097,0.94872206,0.045879945,0.003984786,0.00016860437,0.00030020755],"about_ca_topic_score_codex":0.0002835767,"about_ca_topic_score_gemma":0.000012658297,"teacher_disagreement_score":0.60497576,"about_ca_system_score_codex":0.00026264528,"about_ca_system_score_gemma":0.00010919546,"threshold_uncertainty_score":0.9999545},"labels":[],"label_agreement":null},{"id":"W2951202993","doi":"10.26421/qic7.1-2-4","title":"Hidden symmetry detection on a quantum computer","year":2007,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Canadian Institute for Advanced Research","funders":"","keywords":"Homogeneous space; Quantum algorithm; Symmetry (geometry); Quantum; Simple (philosophy); Class (philosophy); Quantum computer; Discrete symmetry; Similarity (geometry); Discrete mathematics; Mathematics; Point (geometry); Combinatorics; Algorithm; Pure mathematics; Computer science; Physics; Quantum mechanics; Artificial intelligence; Geometry","score_opus":0.00853869995008665,"score_gpt":0.23936084432878962,"score_spread":0.23082214437870296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951202993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25572842,0.000017263495,0.74210346,0.00043434318,0.00078682497,0.00016473164,0.0000014930419,0.00036144705,0.0004020316],"genre_scores_gemma":[0.9751805,0.0000071166646,0.023214813,0.0013784773,0.00018080066,0.000003955516,0.000019778714,0.000008594458,0.000005976956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998341,0.00006138512,0.0005489445,0.0002715743,0.0004279249,0.0003491485],"domain_scores_gemma":[0.9989661,0.00022551682,0.00026983352,0.00023454054,0.00015071104,0.00015329171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000744018,0.00022477585,0.00018495783,0.0005292719,0.0003666677,0.00041851445,0.0002751961,0.00011262155,0.000002234469],"category_scores_gemma":[0.000030405943,0.00020528665,0.00006766364,0.0005914322,0.000042819433,0.0011242838,0.00012851549,0.00027268822,0.00012124975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024215873,0.000032321346,0.00003984013,0.000027207954,0.000010893991,0.0000037290515,0.0010765143,0.0032464997,0.00003874475,0.09742125,0.00020459747,0.8978742],"study_design_scores_gemma":[0.00054072554,0.00042656486,0.013936382,0.000037747956,0.000004064843,0.000077855446,0.000086586886,0.9715283,0.00045884072,0.009906579,0.002735617,0.00026075993],"about_ca_topic_score_codex":0.000025728064,"about_ca_topic_score_gemma":0.0000031766667,"teacher_disagreement_score":0.9682818,"about_ca_system_score_codex":0.00005566667,"about_ca_system_score_gemma":0.000032333006,"threshold_uncertainty_score":0.83713466},"labels":[],"label_agreement":null},{"id":"W2951237228","doi":"10.26421/qic8.8-9-1","title":"Estimating Jones polynomials is a complete problem for one clean qubit","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Institut Périmètre de physique théorique; W. M. Keck Foundation; U.S. Department of Energy; National Science Foundation","keywords":"Braid; Qubit; Quantum computer; Mathematics; TRACE (psycholinguistics); Polynomial; Discrete mathematics; Combinatorics; Closure (psychology); Quantum; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.02902893302079605,"score_gpt":0.25695676594392985,"score_spread":0.22792783292313382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951237228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10376505,0.000029815197,0.89355177,0.0015255278,0.00023946336,0.0004316972,0.000014213086,0.00026318265,0.00017930829],"genre_scores_gemma":[0.56895643,0.000006180164,0.42977396,0.0010814483,0.00009574474,0.000024031897,0.000044834327,0.000007146874,0.0000102017375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986548,0.000039983475,0.0005543489,0.00021964284,0.0002626663,0.00026860088],"domain_scores_gemma":[0.99905133,0.00015711688,0.00033368857,0.00016699173,0.00019288115,0.00009801019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030501327,0.00017504014,0.00022639,0.00020137554,0.0006561028,0.0002738985,0.0002495319,0.000061599785,0.0000027437645],"category_scores_gemma":[0.000035185756,0.0001704819,0.00006703602,0.00026762323,0.00005607014,0.0011764436,0.00011022744,0.000112139154,0.000029642222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049069917,0.00009996301,0.00017476644,0.0003655476,0.000057359222,0.000002080032,0.022993429,0.08773281,0.00016499472,0.0593848,0.006158516,0.82281667],"study_design_scores_gemma":[0.0007191444,0.00019423434,0.0015672632,0.000051650306,0.000005233439,0.000074931006,0.000070067676,0.9817765,0.00010119357,0.013281421,0.0019354082,0.00022297715],"about_ca_topic_score_codex":0.00004278329,"about_ca_topic_score_gemma":0.0000011993156,"teacher_disagreement_score":0.8940437,"about_ca_system_score_codex":0.00002303395,"about_ca_system_score_gemma":0.000070251335,"threshold_uncertainty_score":0.69520503},"labels":[],"label_agreement":null},{"id":"W2951321479","doi":"10.48550/arxiv.1106.2190","title":"Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Binary Golay code; Computer science; Qubit; Overhead (engineering); Algorithm; Fault tolerance; Noise (video); Quantum computer; Error detection and correction; Hamming bound; Code (set theory); Mathematics; Parallel computing; Set (abstract data type); Quantum; Block code; Hamming code; Decoding methods; Physics; Quantum mechanics; Distributed computing","score_opus":0.04908596611915239,"score_gpt":0.20380270923539226,"score_spread":0.15471674311623987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951321479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38674834,0.00031484792,0.61032456,0.00020751783,0.0009839879,0.0006292698,0.00002982442,0.00019334171,0.00056833023],"genre_scores_gemma":[0.9949876,0.00012876275,0.0033839494,0.00018987402,0.00019425701,0.0000046808427,0.000010636048,0.000022387692,0.0010778224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980203,0.00006821015,0.00022016649,0.0011666884,0.00011350787,0.00041114262],"domain_scores_gemma":[0.9979257,0.00021646728,0.0002519318,0.0012864993,0.00017565815,0.00014372532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003936956,0.00036568922,0.00032565414,0.00012406455,0.0005051828,0.0003012004,0.0015644041,0.00024693977,0.0000052445625],"category_scores_gemma":[0.000024107876,0.00029901855,0.00022487869,0.0002587564,0.00017812528,0.00020436231,0.0015438835,0.0005133846,0.0000133826925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022084432,0.00016676678,0.00061188795,0.00015287311,0.00022549783,0.00011578684,0.002659015,0.8942964,0.00008770592,0.09593339,0.0017826477,0.0037471717],"study_design_scores_gemma":[0.00045873018,0.00013757448,0.00064224564,0.00007697333,0.000069455826,0.000012044761,0.000020701227,0.9651083,0.000082627324,0.029010788,0.003989829,0.00039073508],"about_ca_topic_score_codex":0.000074139876,"about_ca_topic_score_gemma":0.00008222055,"teacher_disagreement_score":0.6082393,"about_ca_system_score_codex":0.000071072296,"about_ca_system_score_gemma":0.00016977981,"threshold_uncertainty_score":0.9999462},"labels":[],"label_agreement":null},{"id":"W2951475827","doi":"10.26421/qic.10-8","title":"On the iterative decoding of sparse quantum codes","year":2008,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Decoding methods; Belief propagation; Algorithm; List decoding; Theoretical computer science; Sequential decoding; Quantum computer; Quantum; Concatenated error correction code; Block code; Quantum mechanics; Physics","score_opus":0.020854610964425476,"score_gpt":0.2456400102863635,"score_spread":0.22478539932193803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951475827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48342764,0.000020729229,0.5152891,0.00070023804,0.00012733,0.00010017859,0.0000025915292,0.000060679355,0.000271492],"genre_scores_gemma":[0.9928283,0.000027826818,0.006292456,0.0008048524,0.0000202641,0.0000053116496,0.000013328131,0.0000032890757,0.000004377067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989874,0.000088461085,0.00037398946,0.00012523144,0.0002775626,0.0001473635],"domain_scores_gemma":[0.9989748,0.00040666203,0.00026394363,0.00016812386,0.00013957985,0.000046918434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029385637,0.00012820662,0.00014600669,0.00015579938,0.00039472786,0.00011259632,0.00023919586,0.00003875963,0.0000035730952],"category_scores_gemma":[0.00007721315,0.00008772572,0.000045772587,0.0003102569,0.00008902773,0.00062096055,0.000080846534,0.00013947365,0.000022468068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019700981,0.00004121869,0.00010863816,0.000030155827,0.000018922363,0.0000026635114,0.01448653,0.064177655,0.000042109306,0.86791414,0.0012698339,0.051888417],"study_design_scores_gemma":[0.00023392748,0.0001679804,0.0023573604,0.000040368697,0.0000020371142,0.000045434284,0.00017503799,0.97522503,0.00027338925,0.021026859,0.00034398775,0.00010861312],"about_ca_topic_score_codex":0.000018608698,"about_ca_topic_score_gemma":6.007098e-7,"teacher_disagreement_score":0.91104734,"about_ca_system_score_codex":0.000013477763,"about_ca_system_score_gemma":0.000042219304,"threshold_uncertainty_score":0.3577351},"labels":[],"label_agreement":null},{"id":"W2951476737","doi":"10.48550/arxiv.quant-ph/0702229","title":"An extremal result for geometries in the one-way measurement model","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Unitary state; Mathematics; Embedding; Upper and lower bounds; Graph; Flow (mathematics); Discrete mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.1414423142933238,"score_gpt":0.31097711703122605,"score_spread":0.16953480273790225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951476737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43065697,0.00035008581,0.5664051,0.0013984347,0.0004128065,0.00048767572,0.000011570144,0.00012261899,0.00015468315],"genre_scores_gemma":[0.92235804,0.00001977965,0.07628982,0.0007424358,0.00044594664,0.00007034537,0.0000141557875,0.000026160085,0.000033295273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664587,0.0001419022,0.0005609364,0.0010496548,0.0009443493,0.00065728783],"domain_scores_gemma":[0.9973324,0.00024046906,0.00024951785,0.0017847302,0.00028229808,0.00011056318],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0039757327,0.0003832565,0.0003987497,0.00039921261,0.000260009,0.00031884477,0.0030856507,0.0002625795,0.0000012764747],"category_scores_gemma":[0.00023112667,0.00028683408,0.00019932992,0.0005368105,0.0000773911,0.00014717209,0.0008687088,0.000981592,0.000007557048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012109377,0.0011918187,0.012194776,0.0003815801,0.00014548031,0.0000680868,0.015225591,0.8177774,0.0015331713,0.00887393,0.0010346299,0.14145245],"study_design_scores_gemma":[0.0004521048,0.00015416677,0.036512345,0.0001827048,0.00001669008,0.0000062838926,0.000049949434,0.9480394,0.0007478463,0.0126514435,0.00073045184,0.00045657458],"about_ca_topic_score_codex":0.000116237905,"about_ca_topic_score_gemma":0.00012146831,"teacher_disagreement_score":0.49170107,"about_ca_system_score_codex":0.00011771092,"about_ca_system_score_gemma":0.00024965405,"threshold_uncertainty_score":0.9999584},"labels":[],"label_agreement":null},{"id":"W2951563906","doi":"10.48550/arxiv.quant-ph/0010002","title":"Quantum Computation Relative to Oracles","year":2000,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computation; Computer science; Quantum; Theoretical computer science; Algorithm; Physics; Quantum mechanics","score_opus":0.03204955659944806,"score_gpt":0.2801765902000227,"score_spread":0.24812703360057467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951563906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5929316,0.00014834908,0.40209284,0.002498847,0.0010037333,0.00028503942,0.00000887586,0.00046552127,0.0005651552],"genre_scores_gemma":[0.928921,0.000019351151,0.06942818,0.0008887333,0.00042211573,0.00002455932,0.000028558114,0.000038827002,0.00022867431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972024,0.00020410048,0.0004833632,0.0011962914,0.00041673708,0.0004970996],"domain_scores_gemma":[0.9982275,0.0002164749,0.00024191417,0.0009489118,0.0001338005,0.00023143605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002597097,0.0004441878,0.0004608919,0.00028287663,0.00026599749,0.00025707044,0.001507708,0.00026651568,0.000017712131],"category_scores_gemma":[0.00006506909,0.0004177892,0.00020095397,0.00050414697,0.000058931997,0.00018964248,0.0017708823,0.0010581494,0.0006959963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039771203,0.00031600232,0.013807117,0.00016772324,0.00023676113,0.00023678606,0.0114611015,0.689888,0.00031354217,0.010127079,0.004938903,0.2684672],"study_design_scores_gemma":[0.000248836,0.00018021048,0.1148779,0.00040561636,0.000021525693,0.000024487475,0.000019288873,0.8431649,0.00023493721,0.035614405,0.004372495,0.0008353816],"about_ca_topic_score_codex":0.00012096091,"about_ca_topic_score_gemma":0.000006978215,"teacher_disagreement_score":0.3359894,"about_ca_system_score_codex":0.000082077066,"about_ca_system_score_gemma":0.00018173689,"threshold_uncertainty_score":0.9998274},"labels":[],"label_agreement":null},{"id":"W2951625064","doi":"10.48550/arxiv.0710.5794","title":"Quantum Algorithms for Evaluating MIN-MAX Trees","year":2007,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Bounded function; Quantum; Algorithm; Tree (set theory); Quantum algorithm; Computer science; Mathematics; Discrete mathematics; Combinatorics; Physics; Quantum mechanics","score_opus":0.108831898960261,"score_gpt":0.2522712761908307,"score_spread":0.14343937723056965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951625064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20965865,0.00017183846,0.787179,0.0001592208,0.0014939359,0.00052221766,0.000029258668,0.0004363465,0.0003495069],"genre_scores_gemma":[0.8877209,0.00003834654,0.11044527,0.00018302926,0.0004789438,0.0000030643614,0.000032794054,0.000049029026,0.0010486101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655855,0.00016403459,0.00039805032,0.0018263898,0.00022683665,0.000826114],"domain_scores_gemma":[0.9968215,0.00062619435,0.00045025855,0.0014992568,0.00033541338,0.00026737707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00117773,0.0005525704,0.0005646264,0.0004673622,0.0004364767,0.00025316855,0.0027774137,0.00042283884,0.000010425209],"category_scores_gemma":[0.00013229364,0.0005970029,0.0005143484,0.0006985035,0.00012909563,0.00020412865,0.002305674,0.00085222657,0.000032347354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043650565,0.00014438435,0.00018439417,0.00014413249,0.0001541773,0.00023863482,0.0006201508,0.8756193,0.00008059739,0.06700238,0.0005049799,0.055263218],"study_design_scores_gemma":[0.0006492727,0.00022366755,0.00039672756,0.00016319545,0.00006722067,0.000012686361,0.000052624655,0.9295163,0.00013179878,0.067104094,0.0010174366,0.0006649715],"about_ca_topic_score_codex":0.00012670731,"about_ca_topic_score_gemma":0.000030671676,"teacher_disagreement_score":0.67806226,"about_ca_system_score_codex":0.00018611035,"about_ca_system_score_gemma":0.00033011497,"threshold_uncertainty_score":0.99964815},"labels":[],"label_agreement":null},{"id":"W2951629661","doi":"10.48550/arxiv.1006.4147","title":"Investigating the Performance of an Adiabatic Quantum Optimization Processor","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Adiabatic process; Adiabatic quantum computation; Quantum computer; Qubit; Quantum annealing; Quantum; Statistical physics; Quadratic unconstrained binary optimization; Physics; Computation; Spin (aerodynamics); Computer science; Quantum mechanics; Mathematics; Algorithm; Thermodynamics","score_opus":0.031582739891959345,"score_gpt":0.18227906585117384,"score_spread":0.1506963259592145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951629661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7123604,0.000015543263,0.28686124,0.00008907692,0.00030871356,0.00017604519,0.0000031784984,0.00011819649,0.00006761407],"genre_scores_gemma":[0.970103,0.00001834429,0.029651867,0.0000644939,0.00008984904,8.6511943e-7,0.000009265301,0.000014863748,0.000047449816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985838,0.000133537,0.00022685443,0.0006717196,0.00012091286,0.00026320101],"domain_scores_gemma":[0.9980405,0.000111224916,0.0004532989,0.0010882813,0.00019065176,0.000116027986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039258078,0.00024069322,0.00024529998,0.00014701988,0.00028457068,0.000113769944,0.002270112,0.00020210634,0.000004784613],"category_scores_gemma":[0.0000645225,0.00020029939,0.000091984446,0.00058682385,0.000205106,0.0003069909,0.0011256834,0.00092885667,0.0000036709002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020499922,0.000034047298,0.0004571207,0.00011937171,0.000015700889,0.0000053740623,0.00060710177,0.98946595,0.00005160852,0.00784968,0.0000041687426,0.0013878513],"study_design_scores_gemma":[0.00014079367,0.00009206136,0.00071208144,0.0001480444,0.000024407493,0.000006183114,0.000029015195,0.99286336,0.0003866117,0.005346179,0.000011464631,0.00023978035],"about_ca_topic_score_codex":0.00005924877,"about_ca_topic_score_gemma":0.000010677677,"teacher_disagreement_score":0.25774258,"about_ca_system_score_codex":0.000027307413,"about_ca_system_score_gemma":0.0002719582,"threshold_uncertainty_score":0.8167972},"labels":[],"label_agreement":null},{"id":"W2951692133","doi":"10.48550/arxiv.quant-ph/0204010","title":"Quantum Optimization Problems","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Optimization problem; Quantum computer; L-reduction; Quantum; Quantum algorithm; Time complexity; Quantum complexity theory; Computation; Mathematics; Polynomial; Computer science; Mathematical optimization; Continuous optimization; Discrete mathematics; Algorithm; Multi-swarm optimization; Quantum mechanics; Physics","score_opus":0.034488801741865,"score_gpt":0.23929828546198137,"score_spread":0.20480948372011637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951692133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15907778,0.0006577569,0.8342466,0.0019282221,0.0021570986,0.0003630738,0.000006512347,0.00080099725,0.0007619641],"genre_scores_gemma":[0.8544523,0.00022384318,0.14290209,0.0005451643,0.00081650325,0.000054200533,0.000037493483,0.0000673327,0.00090104964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974665,0.00012259852,0.00045003887,0.0010746414,0.00038196004,0.00050423486],"domain_scores_gemma":[0.9979156,0.00007192709,0.00032524994,0.0014047076,0.0001324212,0.00015006874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027716684,0.0004185347,0.00038982584,0.00019219001,0.00022241932,0.00030076527,0.0018896499,0.0003119485,0.000048733935],"category_scores_gemma":[0.000052222174,0.00038400144,0.00019617923,0.00036343577,0.000059300368,0.0001530643,0.002192962,0.0010000628,0.00017576628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.6594616e-7,0.00008475241,0.0040014517,0.0001091852,0.000033790504,0.00002467687,0.0006855099,0.98622143,0.00002341698,0.00082717056,0.0007482116,0.0072395275],"study_design_scores_gemma":[0.00016256058,0.00005613739,0.0036818057,0.00020238134,0.0000099990575,0.000020433334,0.0000032000669,0.990659,0.00006195207,0.0022116306,0.0024660488,0.00046485514],"about_ca_topic_score_codex":0.00005420958,"about_ca_topic_score_gemma":0.0000019415302,"teacher_disagreement_score":0.69537455,"about_ca_system_score_codex":0.000056571695,"about_ca_system_score_gemma":0.00008945277,"threshold_uncertainty_score":0.9998612},"labels":[],"label_agreement":null},{"id":"W2951814536","doi":"10.22331/q-2020-04-20-254","title":"Time-dependent Hamiltonian simulation with<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:msup><mml:mi>L</mml:mi><mml:mn>1</mml:mn></mml:msup></mml:math>-norm scaling","year":2020,"lang":"lv","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Advanced Scientific Computing Research; U.S. Department of Defense; U.S. Department of Energy; Multidisciplinary University Research Initiative; Canadian Institute for Advanced Research; Office of Science; National Science Foundation","keywords":"Hamiltonian (control theory); Scaling; Quantum; Adiabatic quantum computation; Quantum simulator; Quantum algorithm; Exploit; Norm (philosophy)","score_opus":0.017290702811286637,"score_gpt":0.23549047544877919,"score_spread":0.21819977263749255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951814536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95237106,0.0007676446,0.036931988,0.0024667417,0.0021666053,0.00012110391,0.00015599442,0.0006445585,0.004374326],"genre_scores_gemma":[0.9872524,0.00012259553,0.008164955,0.0015889683,0.002044602,0.00010699421,0.00023022656,0.00034835623,0.00014086309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921851,0.00034050216,0.0014019205,0.0020084963,0.0021932595,0.0018707347],"domain_scores_gemma":[0.9947937,0.0009791318,0.0012221959,0.0018618017,0.00020041723,0.00094273634],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011411572,0.0009007176,0.0004915683,0.00029384583,0.001737661,0.0016601444,0.0022330766,0.0010276171,0.0010342713],"category_scores_gemma":[0.00051037944,0.0012009314,0.0008692233,0.0011553228,0.0007151322,0.00095875695,0.0018585706,0.001688054,0.0033051942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004169631,0.00025611362,0.000013827516,0.0006031467,0.00050500117,0.001429818,0.0064915856,0.13852353,0.0007878745,0.8378813,0.0028575493,0.010233237],"study_design_scores_gemma":[0.0012533083,0.0017510991,0.00007524761,0.0008229395,0.0003541288,0.0006773263,0.0005692995,0.96828824,0.019998424,0.00057526305,0.0044235787,0.0012111383],"about_ca_topic_score_codex":0.0004838861,"about_ca_topic_score_gemma":0.00009680148,"teacher_disagreement_score":0.8373061,"about_ca_system_score_codex":0.00003409484,"about_ca_system_score_gemma":0.00095035334,"threshold_uncertainty_score":0.99987894},"labels":[],"label_agreement":null},{"id":"W2951841454","doi":"10.26421/qic9.5-6-12","title":"Exact quantum lower bound for Grover's problem","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research","keywords":"Upper and lower bounds; Oracle; Intuition; Simple (philosophy); Mathematics; Quantum algorithm; Set (abstract data type); Quantum; Combinatorics; Discrete mathematics; Computer science; Algorithm; Quantum mechanics; Physics","score_opus":0.009243585197173913,"score_gpt":0.24577145728734529,"score_spread":0.23652787209017137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951841454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076153874,0.0000632129,0.9195265,0.002594397,0.00042957958,0.0004130293,0.0000056387426,0.00031992412,0.00049382553],"genre_scores_gemma":[0.9485247,0.000013608328,0.0494985,0.001783139,0.00009268936,0.000013709501,0.000053350315,0.000006011467,0.0000143091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870265,0.000035475914,0.0004632803,0.0002311491,0.00026571084,0.00030175768],"domain_scores_gemma":[0.9991598,0.000111140864,0.0002495129,0.00019000238,0.0001796262,0.00010990374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034970086,0.00019559926,0.00018496499,0.0002025888,0.00036424896,0.0006524022,0.00026973494,0.00007945304,0.000002031254],"category_scores_gemma":[0.000032077,0.00017665827,0.00007662091,0.00029668357,0.000029526971,0.0017573802,0.000054438555,0.00013162136,0.000023088858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034641147,0.00006565051,0.000013848053,0.000059344802,0.000012555782,0.0000012563752,0.001836649,0.015689012,0.000058391754,0.38380548,0.0026053225,0.59581786],"study_design_scores_gemma":[0.000625729,0.0005382286,0.0017621676,0.000030935178,0.0000047851954,0.000028167893,0.000040262876,0.87870425,0.000039364826,0.10814322,0.009859701,0.00022317254],"about_ca_topic_score_codex":0.000010200751,"about_ca_topic_score_gemma":6.310743e-7,"teacher_disagreement_score":0.87237084,"about_ca_system_score_codex":0.000030571224,"about_ca_system_score_gemma":0.00006586821,"threshold_uncertainty_score":0.7203915},"labels":[],"label_agreement":null},{"id":"W2951945888","doi":"10.26421/qic9.9-10-8","title":"Complete characterization of mixing time for the continuous quantum walk on the hypercube with Markovian decoherence model","year":2009,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of British Columbia","funders":"","keywords":"Quantum decoherence; Mixing (physics); Quantum walk; Qubit; Hypercube; Statistical physics; Markov process; Quantum; Random walk; Physics; Quantum computer; Quantum mechanics; Mathematics; Discrete mathematics","score_opus":0.01567765873367429,"score_gpt":0.2281364805216202,"score_spread":0.2124588217879459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951945888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17663793,0.000033319564,0.8193545,0.0024511511,0.00018334301,0.0010576342,0.00007363682,0.000113260525,0.000095267096],"genre_scores_gemma":[0.9782976,0.000035405556,0.019825626,0.0012833613,0.00006735849,0.00005061938,0.00041715437,0.00001307139,0.000009786091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981992,0.0001198908,0.00066375604,0.00031458665,0.00043803375,0.00026453688],"domain_scores_gemma":[0.99764,0.000536483,0.00090724294,0.00047928636,0.00037846834,0.00005848783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067163084,0.00033545127,0.00036382963,0.00017484326,0.0004448646,0.0004536772,0.0007363239,0.00013590253,0.000002013415],"category_scores_gemma":[0.000046750407,0.00019868914,0.00010477586,0.00023258895,0.00009642176,0.00043628854,0.00019266295,0.00039607505,0.00000717862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000982019,0.0000425933,0.000015968395,0.00018571703,0.00006292441,5.210693e-7,0.0030289236,0.6045572,0.00022491992,0.06659766,0.000109174995,0.3250762],"study_design_scores_gemma":[0.00035798093,0.00028330908,0.0032856308,0.0002644991,0.000026322716,0.000013939558,0.00005401517,0.9762427,0.00004330238,0.018991815,0.00017195973,0.00026451075],"about_ca_topic_score_codex":0.000022961754,"about_ca_topic_score_gemma":0.0000015973771,"teacher_disagreement_score":0.8016597,"about_ca_system_score_codex":0.00002748887,"about_ca_system_score_gemma":0.00013929038,"threshold_uncertainty_score":0.8102308},"labels":[],"label_agreement":null},{"id":"W2952032150","doi":"10.48550/arxiv.quant-ph/0006004","title":"Fast parallel circuits for the quantum Fourier transform","year":2000,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Binary logarithm; Mathematics; Bounded function; Polynomial; Circuit complexity; Logarithm; Quantum Fourier transform; Fourier transform; Constant (computer programming); Combinatorics; Quantum computer; Discrete mathematics; Quantum circuit; Quantum; Electronic circuit; Quantum mechanics; Mathematical analysis; Physics; Quantum error correction; Computer science","score_opus":0.03433781165195882,"score_gpt":0.26034856728870426,"score_spread":0.22601075563674544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952032150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13100913,0.0011216993,0.85380155,0.009523414,0.0022224141,0.0011117538,0.00004316768,0.00042785797,0.0007389915],"genre_scores_gemma":[0.9718205,0.00030861553,0.023015378,0.0016148614,0.0016380538,0.00032438766,0.0000353206,0.00008946558,0.0011534616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971335,0.00007906891,0.00050676765,0.0010876831,0.00042092492,0.00077208405],"domain_scores_gemma":[0.997373,0.00043629645,0.00019998853,0.0017318134,0.00009812766,0.00016081534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005187693,0.00052527804,0.00048494717,0.0001127918,0.00057329756,0.00032303907,0.003170514,0.00031620997,0.000027181048],"category_scores_gemma":[0.00003395622,0.00036549746,0.0005327798,0.0002451809,0.00012388869,0.00012067631,0.0006005693,0.0011161485,0.00008019815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024266896,0.00017251994,0.001359165,0.00021965033,0.00030921388,0.000039724255,0.0044146893,0.095272176,0.000035162542,0.006196714,0.0034295078,0.8885272],"study_design_scores_gemma":[0.0005347236,0.00011719365,0.010561533,0.00015484444,0.00005289745,0.00003484997,0.00002275192,0.92610264,0.00008707566,0.021325983,0.04035002,0.0006555128],"about_ca_topic_score_codex":0.0000740516,"about_ca_topic_score_gemma":0.000015990616,"teacher_disagreement_score":0.8878717,"about_ca_system_score_codex":0.000044191704,"about_ca_system_score_gemma":0.00025263123,"threshold_uncertainty_score":0.9998797},"labels":[],"label_agreement":null},{"id":"W2952072673","doi":"10.1088/1367-2630/ab1800","title":"Bounding the average gate fidelity of composite channels using the unitarity","year":2019,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Waterloo","funders":"Army Research Office; Canada First Research Excellence Fund; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Physics; Unitarity; Upper and lower bounds; Coherence (philosophical gambling strategy); Fidelity; Quantum; Quadratic equation; Bounding overwatch; Algorithm; Scaling; Error detection and correction; Quantum error correction; Quantum gate; Quantum information; Quantum mechanics; Computer science; Mathematics","score_opus":0.02230652414241865,"score_gpt":0.2606939180969342,"score_spread":0.23838739395451555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952072673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6155767,0.00009908581,0.38290232,0.0006362786,0.0006863845,0.000048764297,6.646484e-7,0.000005858551,0.000043974702],"genre_scores_gemma":[0.9869269,0.0000056662075,0.0122402925,0.0002173795,0.0005840068,4.7792696e-8,1.3542929e-7,0.000005830566,0.00001973136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888986,0.00014843237,0.00030491813,0.000104646635,0.00037339117,0.00017875378],"domain_scores_gemma":[0.9986805,0.00023532203,0.0004911083,0.0003727017,0.00016459431,0.000055782602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066790025,0.000105204585,0.00020898611,0.000028112421,0.00019975436,0.00013890665,0.0010608416,0.000024008223,0.0000026161156],"category_scores_gemma":[0.000015213605,0.000056039113,0.00015929218,0.00031451235,0.000052956362,0.00022078678,0.00023619407,0.00044717465,0.000002200424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016958606,0.00007013898,0.00077527616,0.000029810895,0.00009719536,0.000010196,0.0051265713,0.9146694,0.012395851,0.019079255,0.00018672392,0.047542624],"study_design_scores_gemma":[0.00033715428,0.00010971336,0.0013542715,0.0001376338,0.000018002094,0.00010303336,0.000040525763,0.9483742,0.0059283674,0.042949956,0.0005462492,0.00010087257],"about_ca_topic_score_codex":0.000076389915,"about_ca_topic_score_gemma":8.029021e-7,"teacher_disagreement_score":0.37135023,"about_ca_system_score_codex":0.000025281364,"about_ca_system_score_gemma":0.00014665994,"threshold_uncertainty_score":0.22852087},"labels":[],"label_agreement":null},{"id":"W2952110573","doi":"10.48550/arxiv.1310.2984","title":"Fault-Tolerant Quantum Computation with Constant Overhead","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; Canadian Institute for Advanced Research","funders":"Division of Mathematical Sciences; Institut Périmètre de physique théorique; Industry Canada; Government of Canada","keywords":"Qubit; Quantum computer; Fault tolerance; Computer science; Overhead (engineering); Quantum error correction; Constant (computer programming); Quantum; Topology (electrical circuits); Mathematics; Discrete mathematics; Quantum mechanics; Physics; Distributed computing; Combinatorics","score_opus":0.03554215293170759,"score_gpt":0.18375304442833926,"score_spread":0.14821089149663166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952110573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41717345,0.000055870474,0.58081573,0.00017593392,0.00044911428,0.00029475187,0.0000114334725,0.0003668887,0.00065684004],"genre_scores_gemma":[0.9865418,0.000033225828,0.012856886,0.00016079414,0.000097029675,0.0000013484506,0.000022952594,0.000030024388,0.00025590605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730253,0.0001873048,0.00028802705,0.0014592108,0.000206612,0.0005563286],"domain_scores_gemma":[0.9978194,0.00017141287,0.00040197957,0.001077213,0.00027535387,0.00025464516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019903076,0.0005173606,0.00051997736,0.00028957942,0.0002891385,0.00035029146,0.0015853288,0.0002699528,0.000016003161],"category_scores_gemma":[0.000011983182,0.00047165735,0.00018972452,0.0006019825,0.00021300442,0.00029477547,0.0015071172,0.0009434361,0.00011074375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020937361,0.00008964909,0.00027547881,0.00007551776,0.000090792724,0.00040718095,0.0003651203,0.8872435,0.00001476798,0.108330615,0.00032741597,0.002759027],"study_design_scores_gemma":[0.000639963,0.00015749535,0.00067946827,0.0002873094,0.000038385333,0.000042382035,0.00005368061,0.9557093,0.00002589116,0.041442215,0.00026665165,0.00065727584],"about_ca_topic_score_codex":0.0003629263,"about_ca_topic_score_gemma":0.000023339686,"teacher_disagreement_score":0.5693684,"about_ca_system_score_codex":0.00014747046,"about_ca_system_score_gemma":0.0003338697,"threshold_uncertainty_score":0.9997735},"labels":[],"label_agreement":null},{"id":"W2952267329","doi":"10.48550/arxiv.cs/0506068","title":"Quantum Arthur-Merlin Games","year":2005,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Merlin (protein); Quantum pseudo-telepathy; Soundness; Quantum sort; Quantum; Quantum computer; Computer science; Quantum information; Mathematics; Discrete mathematics; Quantum mechanics; Quantum network; Physics","score_opus":0.02676892182261488,"score_gpt":0.259083907083698,"score_spread":0.23231498526108313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952267329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86243826,0.0014991662,0.12705036,0.0043847896,0.002848519,0.0002646586,0.000010439857,0.0008594913,0.0006443272],"genre_scores_gemma":[0.9665575,0.00014312839,0.02960597,0.0011234265,0.0018431522,0.000027949245,0.000019741663,0.000052544,0.0006265685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659276,0.00015905207,0.0005836466,0.0014153544,0.00049264973,0.00075655064],"domain_scores_gemma":[0.9970612,0.00015821325,0.00035680455,0.0020593891,0.00012021902,0.00024417712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043485034,0.0005887576,0.0005970783,0.00023526669,0.000231799,0.0003133835,0.0027893,0.00038000222,0.00003931123],"category_scores_gemma":[0.000074068426,0.00053304667,0.00036831677,0.0003257731,0.00010973067,0.00015569798,0.0033176544,0.0016225774,0.000609948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029840972,0.00090990646,0.08485006,0.0005066859,0.0005435963,0.0006806339,0.008334328,0.13051087,0.0011970949,0.023830712,0.013574178,0.7350321],"study_design_scores_gemma":[0.0004114716,0.00012104976,0.094769485,0.00039738585,0.000029740955,0.00007273204,0.00002026472,0.858996,0.0009926381,0.010446253,0.03247621,0.0012667915],"about_ca_topic_score_codex":0.000061331484,"about_ca_topic_score_gemma":0.00001476719,"teacher_disagreement_score":0.7337653,"about_ca_system_score_codex":0.000064242624,"about_ca_system_score_gemma":0.00026389107,"threshold_uncertainty_score":0.9997121},"labels":[],"label_agreement":null},{"id":"W2952301357","doi":"10.48550/arxiv.0810.2780","title":"Universal quantum computation in a hidden basis","year":2008,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Mitacs; Government of Canada; Canadian Institute for Advanced Research","keywords":"Invariant (physics); Bounded function; Quantum computer; Qubit; Mathematics; Quantum; Quantum state; Discrete mathematics; Basis (linear algebra); Quantum algorithm; Quantum mechanics; Mathematical physics; Physics; Mathematical analysis","score_opus":0.04249667185003747,"score_gpt":0.18810492577645233,"score_spread":0.14560825392641485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952301357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52548146,0.00004011517,0.47270942,0.0001727189,0.0004944907,0.00017271355,0.0000072258354,0.00026633727,0.00065550185],"genre_scores_gemma":[0.9888907,0.00016080734,0.010546537,0.000079719066,0.00008984504,4.110222e-7,0.000017855615,0.000021399595,0.00019271631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975807,0.00025232593,0.00026068883,0.0012901737,0.00014470346,0.0004713906],"domain_scores_gemma":[0.9984926,0.00016529395,0.0002547797,0.0008090601,0.000111239315,0.00016704283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020314449,0.0003834597,0.00042634062,0.0006435683,0.00017970956,0.00010533562,0.0017612211,0.0003083019,0.0000060342845],"category_scores_gemma":[0.00002249141,0.00045566112,0.00022489778,0.0010692523,0.00012144469,0.00025651933,0.0020649328,0.00095269416,0.000052141848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016277345,0.000104816725,0.0011807849,0.000038551472,0.000036628167,0.0015057677,0.0008144835,0.96774477,0.0000055284563,0.02251564,0.0002862419,0.005750534],"study_design_scores_gemma":[0.0005790097,0.000056309378,0.003737834,0.00012678886,0.000014234022,0.00002630421,0.000053461714,0.9707934,0.000014049148,0.023936197,0.00018443204,0.00047798152],"about_ca_topic_score_codex":0.0005707557,"about_ca_topic_score_gemma":0.000053501582,"teacher_disagreement_score":0.46340925,"about_ca_system_score_codex":0.0002871812,"about_ca_system_score_gemma":0.0003289591,"threshold_uncertainty_score":0.99978954},"labels":[],"label_agreement":null},{"id":"W2952369254","doi":"10.1142/s0129054103002047","title":"ANALYSIS OF QUANTUM FUNCTIONS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Quantum algorithm; Quantum; Quantum operation; Quantum computer; Quantum capacity; Mathematics; Oracle; Computer science; Theoretical computer science; Quantum network; Open quantum system; Quantum mechanics; Physics","score_opus":0.013466439627247716,"score_gpt":0.2863128427988463,"score_spread":0.2728464031715986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952369254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16509849,0.000036331134,0.8320607,0.00042258008,0.0020924832,0.00002739548,0.0000038961803,0.000010282553,0.000247846],"genre_scores_gemma":[0.82365,0.0000066339144,0.17621532,0.000049128663,0.00006516642,3.27183e-7,8.605609e-7,0.0000023027262,0.000010278393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770486,0.00006849781,0.0007365568,0.00021067163,0.0011238188,0.00015556377],"domain_scores_gemma":[0.99607277,0.00024345178,0.0008587153,0.00037280127,0.0023604396,0.00009184866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012110835,0.000097993965,0.0002750571,0.0020024274,0.000117212796,0.00016831305,0.0023578792,0.000023693943,0.000021279702],"category_scores_gemma":[0.00022010712,0.00008398897,0.00027205376,0.0028982009,0.0003367071,0.0008079545,0.00020030796,0.00013450345,0.0000024177714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001119632,0.0004843455,0.006007177,0.0000065333943,0.001125218,0.000015259317,0.0012913023,0.5216978,0.003194601,0.3652637,0.0001668886,0.100735955],"study_design_scores_gemma":[0.00026888237,0.00018269735,0.0205498,0.000038213235,0.00007960214,0.00011000679,0.000019154155,0.9704711,0.0019151694,0.004950425,0.0013117434,0.00010323638],"about_ca_topic_score_codex":0.000011311789,"about_ca_topic_score_gemma":0.0000018576432,"teacher_disagreement_score":0.6585515,"about_ca_system_score_codex":0.000054397227,"about_ca_system_score_gemma":0.00055536354,"threshold_uncertainty_score":0.43815652},"labels":[],"label_agreement":null},{"id":"W2952496423","doi":"10.1137/1.9781611973082.44","title":"Reflections for quantum query algorithms","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Query optimization; Quantum; Algorithm; Theoretical computer science; Information retrieval; Physics; Quantum mechanics","score_opus":0.05782026642874026,"score_gpt":0.327029660967095,"score_spread":0.26920939453835474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952496423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054213556,0.00024141987,0.9832559,0.0012061014,0.005060915,0.00057379575,0.000022452756,0.001160397,0.007936879],"genre_scores_gemma":[0.019838847,0.00003787624,0.9762524,0.0006203234,0.0010410065,0.00021568203,0.0000283172,0.000052393123,0.001913153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975069,0.00007417216,0.0004575717,0.0011591951,0.00024584436,0.000556295],"domain_scores_gemma":[0.9977424,0.00017442266,0.00023758956,0.0014674312,0.00020740762,0.00017073132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044729456,0.0004161382,0.00045706317,0.00029010707,0.00032594067,0.00033142223,0.002044622,0.0003568202,0.000017266319],"category_scores_gemma":[0.000054106025,0.00035764882,0.0004318237,0.00024492448,0.000057166864,0.00010844251,0.0021043147,0.0007893197,0.00004318854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013366479,0.00035534438,0.000011166966,0.00032736754,0.0002553649,0.000032921318,0.0026343868,0.007485494,0.00014828357,0.76757634,0.020024115,0.20113584],"study_design_scores_gemma":[0.00014344881,0.000111442554,0.00005653943,0.000069678885,0.0000146106495,0.000035360626,0.000007959148,0.6785783,0.0004024371,0.30722392,0.012910885,0.00044541495],"about_ca_topic_score_codex":0.00029196098,"about_ca_topic_score_gemma":0.000028222074,"teacher_disagreement_score":0.6710928,"about_ca_system_score_codex":0.000052873173,"about_ca_system_score_gemma":0.00030273013,"threshold_uncertainty_score":0.9998875},"labels":[],"label_agreement":null},{"id":"W2952499512","doi":"10.1007/s00453-011-9521-6","title":"On the Hitting Times of Quantum Versus Random Walks","year":2009,"lang":"en","type":"preprint","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Army Research Office; Agence Nationale de la Recherche; Government of Canada; National University of Singapore; National Research Foundation; Natural Sciences and Engineering Research Council of Canada; European Commission; Centre for Quantum Technologies; Canadian Institute for Advanced Research","keywords":"Hitting time; Quantum walk; Mathematics; Markov chain; Quantum; Quantum algorithm; Ergodic theory; State (computer science); Random walk; Discrete mathematics; Statistical physics; Algorithm; Quantum mechanics; Physics; Pure mathematics; Statistics","score_opus":0.015351017635354937,"score_gpt":0.24683248862861465,"score_spread":0.23148147099325972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952499512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04850197,0.0010295651,0.9129913,0.021105276,0.0069112363,0.0012043149,0.00004707864,0.00080565707,0.0074035954],"genre_scores_gemma":[0.9152101,0.000041662344,0.082981676,0.00069278036,0.0008323559,0.000031199314,0.000018983028,0.000051451836,0.00013977032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968929,0.0003501539,0.0006137414,0.0008998874,0.0007012246,0.0005420872],"domain_scores_gemma":[0.9953457,0.0020395673,0.0005462857,0.0018142657,0.00014417438,0.00010997433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009780896,0.00049504946,0.00066392194,0.00019279856,0.00026228797,0.00022722062,0.00306347,0.0002836333,0.000028785427],"category_scores_gemma":[0.00031659938,0.0003348145,0.00043687824,0.00034194722,0.00013498453,0.000056693047,0.0016162728,0.0014281451,0.000034519813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019276219,0.00026515714,0.0000020394775,0.00009373676,0.00032565117,0.00006815255,0.0015193537,0.03879872,0.00007563593,0.366224,0.0072415415,0.5851933],"study_design_scores_gemma":[0.0010449359,0.00027374914,0.00005448808,0.00025459795,0.000028626046,0.0000092918435,0.000014082062,0.8685174,0.0009870474,0.12747811,0.0009652358,0.00037241855],"about_ca_topic_score_codex":0.000059541242,"about_ca_topic_score_gemma":9.744163e-7,"teacher_disagreement_score":0.86670816,"about_ca_system_score_codex":0.000050255647,"about_ca_system_score_gemma":0.0002135895,"threshold_uncertainty_score":0.9999104},"labels":[],"label_agreement":null},{"id":"W2952501978","doi":"10.48550/arxiv.cond-mat/0703085","title":"Landau-Zener transitions in the presence of spin environment","year":2007,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Adiabatic process; Spins; Physics; Excited state; Zener diode; Limit (mathematics); Spin (aerodynamics); Statistical physics; Quantum mechanics; Ground state; Quantum; Upper and lower bounds; Condensed matter physics; Mathematics; Thermodynamics","score_opus":0.037585536607051655,"score_gpt":0.18500504328484732,"score_spread":0.14741950667779566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952501978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42913836,0.000056395118,0.5695799,0.00034342217,0.00012602436,0.000163396,0.00000928289,0.000032146047,0.00055106217],"genre_scores_gemma":[0.9958307,0.000059043625,0.0038701436,0.00008686875,0.0000441478,4.9969117e-7,0.000004883384,0.0000060422376,0.00009766949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986969,0.0001678197,0.00018376687,0.0005700912,0.00012762513,0.00025377792],"domain_scores_gemma":[0.99875915,0.00012113432,0.0001303258,0.00091432093,0.000022082619,0.000052977062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000449878,0.00018128088,0.0002030384,0.00020110044,0.000081031845,0.000035949062,0.0017517104,0.0001362353,0.000009741113],"category_scores_gemma":[0.0000084019875,0.00015242834,0.00014250919,0.00038453282,0.00012103046,0.00007260945,0.0006434853,0.000568793,0.000009499741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006903458,0.00012330578,0.00046269267,0.000032680782,0.00001682237,0.00021100926,0.002109926,0.9662004,0.00003080509,0.028754316,0.00004785556,0.0020032446],"study_design_scores_gemma":[0.00025095826,0.000049366226,0.0058644256,0.000095005125,0.000016593236,0.000008259831,0.000091901755,0.97768337,0.00008773183,0.014938417,0.00070115435,0.00021281556],"about_ca_topic_score_codex":0.00012274082,"about_ca_topic_score_gemma":0.00002637271,"teacher_disagreement_score":0.56669235,"about_ca_system_score_codex":0.000044115204,"about_ca_system_score_gemma":0.00006214548,"threshold_uncertainty_score":0.6215847},"labels":[],"label_agreement":null},{"id":"W2952568606","doi":"10.1145/2499370.2462177","title":"Quipper","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Quantum computer; Quantum; Theoretical computer science; Quantum algorithm; Programming language; Scalability; Set (abstract data type); Quantum gate; Computation; Computer engineering","score_opus":0.010881866858145378,"score_gpt":0.22561920259834484,"score_spread":0.21473733574019946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952568606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9491757,0.00021224844,0.037512317,0.008456367,0.00077263446,0.00016648226,0.0000013957076,0.00049891334,0.0032039264],"genre_scores_gemma":[0.8936769,0.0000019150682,0.104935855,0.0009883675,0.00018200293,0.0000066544812,0.0000013965289,0.0000070349324,0.0001999198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999065,0.000037054084,0.00013136267,0.00029054645,0.00018654484,0.0002894872],"domain_scores_gemma":[0.99879134,0.00024494051,0.000055050245,0.000771787,0.000040654537,0.00009620328],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009982515,0.00011758958,0.00011070502,0.00006070099,0.00012481764,0.00030379757,0.0015921412,0.000041178173,0.00009226002],"category_scores_gemma":[0.00009276658,0.000089006986,0.00004189062,0.00018243334,0.000030509314,0.00034305145,0.00047877108,0.00013316734,0.0010088116],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039015645,0.00018604034,0.008498588,0.00006625892,0.0000803174,0.00007537036,0.006780613,0.0066973562,0.0038514328,0.03142342,0.044524174,0.89781255],"study_design_scores_gemma":[0.00040878312,0.00020709395,0.056684423,0.00005277504,0.000008599056,0.00005099196,0.00011895437,0.8865494,0.0017385174,0.03011932,0.02341538,0.00064575445],"about_ca_topic_score_codex":0.0002098134,"about_ca_topic_score_gemma":0.000005507933,"teacher_disagreement_score":0.8971668,"about_ca_system_score_codex":0.0000062890167,"about_ca_system_score_gemma":0.00001893096,"threshold_uncertainty_score":0.99976903},"labels":[],"label_agreement":null},{"id":"W2952708901","doi":"10.26421/qic1.3-2","title":"Decomposing finite Abelian groups","year":2001,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abelian group; Mathematics; Factoring; Elementary abelian group; Cyclic group; Decomposition; Rank of an abelian group; Riemann hypothesis; Order (exchange); Class (philosophy); Product (mathematics); Group (periodic table); Solvable group; Discrete mathematics; Pure mathematics; Combinatorics; Algebra over a field; Computer science; Physics","score_opus":0.009734508865858991,"score_gpt":0.2402801878867882,"score_spread":0.2305456790209292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952708901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20693724,0.000053477015,0.7906588,0.0009803367,0.00029677403,0.00009137912,9.484094e-7,0.00026727002,0.00071378745],"genre_scores_gemma":[0.9651789,0.000037570993,0.033682138,0.0010059088,0.00005491279,0.000003861264,0.000025383604,0.0000045223737,0.000006808635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901676,0.000043934113,0.0003472049,0.00015725917,0.00021930161,0.00021556499],"domain_scores_gemma":[0.9993886,0.00010989937,0.0001598509,0.0001519965,0.0000932517,0.00009644508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023025548,0.0001364798,0.00012034286,0.0002331437,0.00031245593,0.0004925749,0.00021980255,0.000051250077,0.0000045220822],"category_scores_gemma":[0.000025265406,0.00012689337,0.00003772448,0.0004306109,0.000028274402,0.0015331183,0.000108780776,0.00012899967,0.000074957454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009478655,0.00002616421,0.00046050226,0.000026349537,0.000010233474,0.0000052976907,0.0028681783,0.066763334,0.000028804947,0.068306044,0.0003149212,0.86118066],"study_design_scores_gemma":[0.0003488188,0.000078984776,0.005000681,0.000025511892,0.0000024361684,0.000092605216,0.000082404105,0.9752924,0.000020572943,0.012550657,0.006336007,0.00016892763],"about_ca_topic_score_codex":0.000019011575,"about_ca_topic_score_gemma":0.0000012852471,"teacher_disagreement_score":0.90852904,"about_ca_system_score_codex":0.000019073885,"about_ca_system_score_gemma":0.000028391285,"threshold_uncertainty_score":0.5174561},"labels":[],"label_agreement":null},{"id":"W2952736688","doi":"10.48550/arxiv.1006.1362","title":"A renormalization group decoding algorithm for topological quantum codes","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fonds Québécois de la Recherche sur la Nature et les Technologies; Compute Canada","keywords":"Toric code; Block code; Algorithm; Quantum algorithm; Quantum computer; Qubit; Mathematics; Quantum error correction; Topology (electrical circuits); Discrete mathematics; Computer science; Decoding methods; Quantum; Physics; Quantum mechanics; Combinatorics","score_opus":0.0474779430395763,"score_gpt":0.2074368806001136,"score_spread":0.15995893756053728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952736688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11575796,0.000049375507,0.88162106,0.00014976134,0.0014526063,0.0003676021,0.000032962733,0.00044742256,0.00012125344],"genre_scores_gemma":[0.8009158,0.00007911443,0.19822916,0.00016323509,0.00034918412,0.0000032295573,0.000078514044,0.000023856084,0.00015792539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772507,0.00012900805,0.00026268009,0.0012656123,0.00010476419,0.0005128567],"domain_scores_gemma":[0.9981585,0.00027348727,0.00030209357,0.00090862665,0.00017298285,0.00018429566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044836858,0.0003758496,0.00041024384,0.00024372274,0.00042680185,0.00024687304,0.0018896271,0.00052810396,0.000010958844],"category_scores_gemma":[0.0000642388,0.00038285772,0.0002987305,0.000400807,0.00013563939,0.00019899508,0.0018210053,0.0008888787,0.000010486831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022613363,0.00020116907,0.00024128884,0.00011409225,0.000103138605,0.000197652,0.00043326445,0.3241363,0.00009883386,0.6104437,0.0003168432,0.06369114],"study_design_scores_gemma":[0.00035091568,0.00011133624,0.00014461196,0.000058636815,0.000031715772,0.00001511291,0.000021078278,0.87833315,0.0000675171,0.11929944,0.001139441,0.00042701763],"about_ca_topic_score_codex":0.00010307149,"about_ca_topic_score_gemma":0.000034665343,"teacher_disagreement_score":0.68515784,"about_ca_system_score_codex":0.000082218125,"about_ca_system_score_gemma":0.00010084587,"threshold_uncertainty_score":0.9998623},"labels":[],"label_agreement":null},{"id":"W2952871282","doi":"10.48550/arxiv.math/0402105","title":"Noiseless subsystems for collective rotation channels in quantum information theory","year":2004,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; University of Guelph","funders":"Institut Périmètre de physique théorique; Agricultural Research Development Agency; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Centralizer and normalizer; Rotation (mathematics); Class (philosophy); Operator algebra; Mathematics; Quantum channel; Channel (broadcasting); Operator (biology); Algebra over a field; Quantum; Pure mathematics; Set (abstract data type); Quantum information; Noise (video); Computer science; Discrete mathematics; Quantum mechanics; Physics; Geometry; Artificial intelligence","score_opus":0.022585814920131946,"score_gpt":0.25255122134607555,"score_spread":0.2299654064259436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952871282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.488586,0.00008244424,0.5080333,0.00028412536,0.00176886,0.0009741637,0.000015564367,0.00015536141,0.0001002344],"genre_scores_gemma":[0.99501604,0.000009003495,0.0039888816,0.00019033841,0.00029988063,0.0003496909,0.00006985653,0.000020770143,0.00005555042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791104,0.00018749584,0.0006153269,0.00056075095,0.0002881851,0.00043719547],"domain_scores_gemma":[0.9982958,0.0002910029,0.00046878826,0.00059881946,0.00026406022,0.00008154148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009595001,0.00034672776,0.0004389993,0.00045211788,0.00019910025,0.00028747442,0.0009991089,0.00029822814,0.0000014051936],"category_scores_gemma":[0.0001610879,0.00033061267,0.00016491151,0.0005194204,0.00004125881,0.0004549958,0.0005472947,0.0005883219,0.000029654886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009387546,0.0001663195,0.005454548,0.0009423514,0.00009899005,0.000013422966,0.030981326,0.8968378,0.000065181266,0.044871505,0.00013982118,0.020334892],"study_design_scores_gemma":[0.00090952433,0.00012805239,0.016180152,0.0005908649,0.00001037229,0.000009206729,0.00017427947,0.90744674,0.0005967621,0.07329445,0.00018557864,0.00047403184],"about_ca_topic_score_codex":0.00015154584,"about_ca_topic_score_gemma":0.000019785233,"teacher_disagreement_score":0.50643003,"about_ca_system_score_codex":0.00036275695,"about_ca_system_score_gemma":0.0006284624,"threshold_uncertainty_score":0.9999146},"labels":[],"label_agreement":null},{"id":"W2952899251","doi":"10.48550/arxiv.1404.4134","title":"Solution to time-energy costs of quantum channels","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Hong Kong Polytechnic University; National Science Foundation","keywords":"Channel (broadcasting); Energy (signal processing); Semidefinite programming; Quantum; Energy cost; Class (philosophy); Physics; Computer science; Quantum mechanics; Mathematics; Statistical physics; Mathematical optimization; Telecommunications; Engineering","score_opus":0.027350229471581607,"score_gpt":0.17786258374211575,"score_spread":0.15051235427053414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952899251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14674889,0.000028852524,0.85122603,0.00023374632,0.00091377017,0.00012912396,0.000009112019,0.0002075517,0.0005029473],"genre_scores_gemma":[0.99520993,0.000015733789,0.0037369034,0.00016483881,0.00018069288,5.854915e-7,0.000010999071,0.000018858178,0.0006614612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979743,0.00019535373,0.00024236928,0.0010398387,0.00013555597,0.00041259875],"domain_scores_gemma":[0.99794567,0.00011930252,0.00029255834,0.0012203451,0.00019317647,0.00022893731],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030312056,0.0003204741,0.00044417978,0.00039103857,0.0001333536,0.00007599395,0.0020185343,0.0002478166,0.000009769129],"category_scores_gemma":[0.000034048648,0.00035498952,0.00022661759,0.0006075858,0.00007310398,0.00010182609,0.0027938497,0.00035893012,0.00008120562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013186615,0.000055664557,0.00002079678,0.000031420368,0.000040203824,0.00003673522,0.00013483966,0.85216355,0.00015451979,0.14199579,0.00081585714,0.004537405],"study_design_scores_gemma":[0.00019442517,0.00013583897,0.00007889185,0.0001964578,0.000019503143,0.000004831024,0.00000401127,0.97402745,0.0003832077,0.023721417,0.0008609663,0.00037297158],"about_ca_topic_score_codex":0.00038009364,"about_ca_topic_score_gemma":0.000008638486,"teacher_disagreement_score":0.84846103,"about_ca_system_score_codex":0.0001316332,"about_ca_system_score_gemma":0.00013005239,"threshold_uncertainty_score":0.9998902},"labels":[],"label_agreement":null},{"id":"W2953119614","doi":"10.48550/arxiv.1204.5485","title":"Finding low-energy conformations of lattice protein models by quantum annealing","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Quantum annealing; Quantum; Maxima and minima; Statistical physics; Protein folding; Simulated annealing; Lattice (music); Protein structure prediction; Energy landscape; Physics; Computer science; Protein structure; Quantum mechanics; Algorithm; Quantum computer; Mathematics; Thermodynamics","score_opus":0.049437151639089454,"score_gpt":0.1877668914832348,"score_spread":0.13832973984414534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953119614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28745592,0.00012440869,0.7110704,0.000057436515,0.00026489957,0.00014774995,0.00003332256,0.00015409627,0.00069177675],"genre_scores_gemma":[0.99375737,0.00002968737,0.0057546287,0.000045417393,0.00006742416,0.0000011933333,0.000030371515,0.000017846383,0.00029608537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983119,0.0001364749,0.00033307893,0.0006123377,0.0001422914,0.0004639527],"domain_scores_gemma":[0.99811935,0.000108593056,0.00050530967,0.00091503834,0.00016987344,0.00018180549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031146794,0.00031464105,0.00037914916,0.00026426703,0.00023002317,0.00010149931,0.001621657,0.00025885206,0.000006965895],"category_scores_gemma":[0.000017531796,0.0003476851,0.00019661887,0.00050896493,0.00009358097,0.0005596179,0.0016333355,0.0005449021,0.000008791561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046739788,0.000051256513,0.000018155757,0.000104220584,0.00004192151,0.000010275365,0.0004775071,0.69095707,0.00010395886,0.30744138,0.00008319429,0.0007063782],"study_design_scores_gemma":[0.0002129573,0.000024183926,0.000012880446,0.00025911466,0.000026387488,0.00000353151,0.00004081719,0.94677985,0.0007732266,0.0513685,0.00014403349,0.00035449906],"about_ca_topic_score_codex":0.0003100008,"about_ca_topic_score_gemma":0.000005138754,"teacher_disagreement_score":0.70630145,"about_ca_system_score_codex":0.00007936267,"about_ca_system_score_gemma":0.00015713213,"threshold_uncertainty_score":0.99989754},"labels":[],"label_agreement":null},{"id":"W2953206701","doi":"10.26421/qic9.11-12-7","title":"Quantum universality by state distillation","year":2009,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Upper and lower bounds; Universality (dynamical systems); Mathematics; Quantum; Quantum computer; Distillation; Statistical physics; Quantum mechanics; Topology (electrical circuits); Discrete mathematics; Physics; Combinatorics; Chemistry; Mathematical analysis","score_opus":0.006348388901392206,"score_gpt":0.22762004628158983,"score_spread":0.22127165738019763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953206701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20504133,0.000049656028,0.7923304,0.0016525332,0.00016982264,0.0001246984,0.000008151826,0.00028686618,0.00033657087],"genre_scores_gemma":[0.9929198,0.000023712384,0.0061063245,0.0008248723,0.000020670886,0.0000012024074,0.00008766828,0.00000304312,0.00001268331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998884,0.00006677703,0.00036940505,0.00018902493,0.00027802048,0.00021276479],"domain_scores_gemma":[0.999326,0.0000589221,0.0002251084,0.00016386028,0.00011937692,0.00010676733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026300855,0.0001559791,0.00013936612,0.00014794222,0.00025935055,0.00038424737,0.00020522623,0.000050897463,0.0000020061227],"category_scores_gemma":[0.000022803195,0.00014693689,0.00003750174,0.0003502517,0.00003116878,0.0017123346,0.00005140019,0.00013164131,0.00002785468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001698533,0.00004006055,0.00008541158,0.000020719968,0.000008567986,0.0000013788602,0.002716006,0.022789184,0.00010075044,0.12983626,0.0025277338,0.84185696],"study_design_scores_gemma":[0.00037006236,0.0001602648,0.009389558,0.0000137184325,0.0000025968254,0.0000133012745,0.00005254472,0.9469295,0.000057541256,0.038260754,0.004563643,0.00018652402],"about_ca_topic_score_codex":0.000028416262,"about_ca_topic_score_gemma":5.6723997e-7,"teacher_disagreement_score":0.92414033,"about_ca_system_score_codex":0.000035409907,"about_ca_system_score_gemma":0.000038231043,"threshold_uncertainty_score":0.59919125},"labels":[],"label_agreement":null},{"id":"W2953359391","doi":"10.1088/2399-6528/ab1c6e","title":"Accelerated quantum walk, two-particle entanglement generation and localization","year":2019,"lang":"en","type":"article","venue":"Journal of Physics Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Science and Engineering Research Board","keywords":"Quantum entanglement; Quantum walk; Quantum discord; Amplitude damping channel; Quantum dynamics; Quantum dissipation; Quantum; Quantum process; Connection (principal bundle); Position (finance)","score_opus":0.03880507793594716,"score_gpt":0.29151474396123267,"score_spread":0.2527096660252855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953359391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42606416,0.00034569492,0.57169676,0.001517599,0.00018034599,0.00008690278,0.0000010522504,0.000020505811,0.00008695387],"genre_scores_gemma":[0.9602514,0.00009252755,0.03935137,0.0001863332,0.00009880044,7.9751663e-7,0.0000047173694,0.0000047293,0.000009331658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992125,0.0001257581,0.00028790522,0.000093351635,0.00017688461,0.000103608756],"domain_scores_gemma":[0.9987571,0.00007662955,0.0002673989,0.0006222585,0.00022090459,0.00005568067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000258407,0.000074001226,0.00011958779,0.00003821094,0.00016605678,0.00015092756,0.0006707921,0.000017328319,0.000004847998],"category_scores_gemma":[0.000010945181,0.000064369306,0.00004230604,0.00027530472,0.00002986658,0.0003795134,0.00022156209,0.00016822682,0.000008636899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008701525,0.0005374176,0.010578341,0.000022428747,0.00012514532,0.0000032734395,0.0042781085,0.1860199,0.058135264,0.42988685,0.00050044496,0.30990413],"study_design_scores_gemma":[0.00037731437,0.00009648841,0.0012981844,0.000022376553,0.000008387228,0.000017081282,0.000031424326,0.987899,0.0037235941,0.0059014354,0.00055102556,0.00007370423],"about_ca_topic_score_codex":0.000011831256,"about_ca_topic_score_gemma":0.000004250743,"teacher_disagreement_score":0.8018791,"about_ca_system_score_codex":0.00002309179,"about_ca_system_score_gemma":0.000052294847,"threshold_uncertainty_score":0.26249042},"labels":[],"label_agreement":null},{"id":"W2954292307","doi":"10.1063/1.5141458","title":"Measurement optimization in the variational quantum eigensolver using a minimum clique cover","year":2020,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":268,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamiltonian (control theory); Qubit; Hamiltonian path; Hamiltonian path problem; Mathematics; Quantum; Heuristics; Discrete mathematics; Quantum mechanics; Graph; Combinatorics; Mathematical optimization; Physics","score_opus":0.03641151878824619,"score_gpt":0.24668562670481148,"score_spread":0.21027410791656528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954292307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09506903,0.00006947604,0.89948493,0.0051968023,0.00009160675,0.000057045134,5.0312593e-7,0.000006828271,0.000023747176],"genre_scores_gemma":[0.97144836,0.000004264141,0.026115201,0.001864444,0.0005616999,2.6692618e-7,2.4738696e-7,0.0000053047593,1.881877e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871385,0.00016192296,0.00028354718,0.00008648559,0.0006230292,0.00013117131],"domain_scores_gemma":[0.9992582,0.00014654528,0.00024145567,0.00014129748,0.00016800626,0.00004447592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073800713,0.000089436944,0.00013207599,0.000013678334,0.000053874606,0.00005758174,0.00075376465,0.000028346427,0.0000019894353],"category_scores_gemma":[0.00008859026,0.00004900905,0.00007861532,0.00031350512,0.00003134677,0.00013776486,0.00009353228,0.00035873253,0.0000014974147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029540844,0.00007250166,0.000010007107,0.000007392572,0.000020958929,0.000004834527,0.0034446123,0.97248137,0.020618014,0.002288279,0.0003365015,0.0006859641],"study_design_scores_gemma":[0.00025652215,0.00004739539,0.000032669177,0.000031007065,0.00001404756,0.000031092775,0.00001992488,0.9887063,0.0034805834,0.0072659072,0.000049967693,0.00006456303],"about_ca_topic_score_codex":0.0000024110166,"about_ca_topic_score_gemma":2.6016751e-8,"teacher_disagreement_score":0.8763794,"about_ca_system_score_codex":0.000041856998,"about_ca_system_score_gemma":0.0001226519,"threshold_uncertainty_score":0.1998531},"labels":[],"label_agreement":null},{"id":"W2954436648","doi":"10.1103/physreva.103.062422","title":"Entanglement of a bipartite channel","year":2021,"lang":"en","type":"preprint","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences; University of Calgary","keywords":"Quantum entanglement; Bipartite graph; Quantum channel; Multipartite entanglement; LOCC; Computer science; Mathematics; Squashed entanglement; Quantum; Theoretical computer science; Quantum mechanics; Physics","score_opus":0.020336707937946848,"score_gpt":0.3510177294495936,"score_spread":0.33068102151164674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954436648","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13270976,0.6902304,0.15590876,0.012655051,0.001631461,0.0048844274,0.00013019513,0.00055632595,0.001293569],"genre_scores_gemma":[0.5702385,0.40770963,0.010695298,0.008045679,0.0020970393,0.0008380356,0.00018677009,0.00013515289,0.000053933738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936547,0.0007497186,0.0013373208,0.0018705252,0.0015305869,0.00085711875],"domain_scores_gemma":[0.9944403,0.00044433848,0.0011819648,0.0030109014,0.00046538078,0.00045711146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007875154,0.0009894125,0.003546941,0.000092510665,0.000114582435,0.0001475882,0.002933487,0.00009066058,0.000022457396],"category_scores_gemma":[0.00054142694,0.0007781356,0.0023874326,0.0012440641,0.00016303427,0.00018630123,0.0049235984,0.001549885,0.00011913761],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016798642,0.009138979,0.000055124066,0.23573288,0.0013312796,0.00031911847,0.0022359388,0.002073065,0.012086868,0.047677275,0.016362948,0.6729697],"study_design_scores_gemma":[0.00068621663,0.000780711,0.00037543435,0.28585935,0.0016147693,0.00005051911,0.0000108765935,0.5368941,0.019145502,0.10454962,0.04677121,0.0032617075],"about_ca_topic_score_codex":0.0000358128,"about_ca_topic_score_gemma":0.000002139673,"teacher_disagreement_score":0.669708,"about_ca_system_score_codex":0.00010053763,"about_ca_system_score_gemma":0.0003713342,"threshold_uncertainty_score":0.99946696},"labels":[],"label_agreement":null},{"id":"W2954619560","doi":"10.1201/9781315216843-13","title":"Verified Multicore Parallelism Using Atomic Verifiable Operations","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Parallelism (grammar); Multi-core processor; Verifiable secret sharing; Parallel computing; Computer science; Programming language","score_opus":0.02739413875125012,"score_gpt":0.24987439122952856,"score_spread":0.22248025247827843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954619560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037453887,0.00030796725,0.8316735,0.000315027,0.002130096,0.00047003696,0.000020101601,0.0007372451,0.16060065],"genre_scores_gemma":[0.0026944545,0.000033676453,0.63291293,0.0006983848,0.0009574578,0.0000046201512,0.000026291065,0.000078847355,0.36259332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815917,0.000019928146,0.0003649987,0.00076481776,0.0003131209,0.00037796333],"domain_scores_gemma":[0.9984949,0.000044967554,0.000098465054,0.0010741279,0.00014093316,0.00014655654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001386511,0.00041357058,0.00038415982,0.0001680824,0.00039164274,0.00037237097,0.0011032742,0.00029877917,0.00052612385],"category_scores_gemma":[0.000010901667,0.00036134617,0.00017366582,0.00005923889,0.00011338427,0.00017307559,0.00056351145,0.00041197584,0.0004915756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010791909,0.000056392855,0.0000017150568,0.000063026426,0.00021824492,0.00013058545,0.0014565552,0.0484681,0.0006327979,0.916805,0.011204166,0.02095259],"study_design_scores_gemma":[0.00020994422,0.000053061933,0.0000028319375,0.000106343534,0.000016029766,0.000055199915,0.000002549359,0.906918,0.00009824074,0.013932704,0.0781363,0.0004688048],"about_ca_topic_score_codex":0.000089337555,"about_ca_topic_score_gemma":0.000019721425,"teacher_disagreement_score":0.9028723,"about_ca_system_score_codex":0.0000705243,"about_ca_system_score_gemma":0.00023556534,"threshold_uncertainty_score":0.99988383},"labels":[],"label_agreement":null},{"id":"W2954955923","doi":"10.22215/etd/2017-11829","title":"Negotiating a Quantum Computation Network: Mechanics, Machines, Mindsets","year":2017,"lang":"en","type":"dissertation","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mindset; Quantum computer; Negotiation; Computer science; Context (archaeology); Software; Computation; Quantum; Theoretical computer science; Software engineering; Management science; Artificial intelligence; Sociology; Engineering; Social science; Programming language","score_opus":0.011880293819371224,"score_gpt":0.269562498039819,"score_spread":0.2576822042204478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954955923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048600356,0.0013337896,0.9689562,0.00035799245,0.011962975,0.000515125,0.0000100210555,0.0008177279,0.011186165],"genre_scores_gemma":[0.49650082,0.00019356776,0.4588787,0.0012372001,0.0067258403,0.00011212455,0.0039510615,0.00041239924,0.031988263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705285,0.00012442785,0.00056054624,0.0009774371,0.00058683835,0.00069792964],"domain_scores_gemma":[0.9975685,0.00016990482,0.00091560924,0.00097036775,0.00021370478,0.00016194613],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00050690223,0.0005518304,0.0005704182,0.00018962528,0.0010242405,0.0012816028,0.0019909935,0.00037814915,0.000018180592],"category_scores_gemma":[0.000091243215,0.0004975697,0.00021712374,0.00022738578,0.000014143933,0.00042052177,0.00022133597,0.00076412666,0.000063660584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016470633,0.000056455363,0.00001336823,0.00017163952,0.000119335295,0.00007911471,0.0010018498,0.21346804,0.000047353333,0.14103277,0.01257886,0.6314147],"study_design_scores_gemma":[0.00023521257,0.000075841315,0.00044241396,0.00023906755,0.0000230507,0.000027392201,0.000027521068,0.9669477,0.00001887055,0.028699227,0.0026878517,0.00057586486],"about_ca_topic_score_codex":0.0004096706,"about_ca_topic_score_gemma":0.00014072795,"teacher_disagreement_score":0.75347966,"about_ca_system_score_codex":0.000061909726,"about_ca_system_score_gemma":0.00031816115,"threshold_uncertainty_score":0.99975514},"labels":[],"label_agreement":null},{"id":"W2956731923","doi":"10.21468/scipostphys.6.3.029","title":"Efficient variational simulation of non-trivial quantum states","year":2019,"lang":"en","type":"article","venue":"SciPost Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Gordon and Betty Moore Foundation","keywords":"Quantum; Ising model; Quantum computer; Quantum state; Quantum algorithm; Conjecture; Statistical physics; Physics; Computer science; Quantum mechanics; Theoretical physics; Mathematics; Discrete mathematics","score_opus":0.006523068678222679,"score_gpt":0.24008261121444494,"score_spread":0.23355954253622224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956731923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46475717,0.0000064131955,0.53452903,0.00007793983,0.00040406344,0.00009080689,0.0000056459294,0.00003696796,0.000091980655],"genre_scores_gemma":[0.98618805,3.1368586e-7,0.013557396,0.000051367115,0.00016227565,0.0000010763348,0.000009698015,0.0000075813687,0.000022254468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989279,0.000033594242,0.00019471945,0.00027265816,0.00037715898,0.0001939691],"domain_scores_gemma":[0.99911755,0.00021140339,0.0001421066,0.00035046245,0.0001354256,0.000043072378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018089895,0.00010973449,0.00015173048,0.000048943337,0.00007210165,0.000052060725,0.00040164922,0.000031458825,0.00000677067],"category_scores_gemma":[0.000011628328,0.00009683833,0.00007184911,0.0003973182,0.000028424145,0.00007744114,0.00018781808,0.00010590511,0.00007150113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004536561,0.00007620309,0.00024535912,0.000014892616,0.000009767125,4.4806754e-7,0.00073356275,0.97310966,0.001083128,0.016612671,0.000014617755,0.00809515],"study_design_scores_gemma":[0.000267097,0.00010456467,0.0051950365,0.00002402675,0.0000031122122,6.400153e-7,0.000005494747,0.980927,0.00082503504,0.012461296,0.00006921738,0.000117498574],"about_ca_topic_score_codex":0.0000119706,"about_ca_topic_score_gemma":2.091309e-7,"teacher_disagreement_score":0.52143085,"about_ca_system_score_codex":0.000017588425,"about_ca_system_score_gemma":0.00007916569,"threshold_uncertainty_score":0.39489526},"labels":[],"label_agreement":null},{"id":"W2961508355","doi":"10.48550/arxiv.1907.04729","title":"Fractional Revival and Association Schemes","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; York University","funders":"","keywords":"Association scheme; Algebraic combinatorics; Mathematics; Combinatorics; Adjacency matrix; Quantum walk; Quantum entanglement; Adjacency list; Vertex (graph theory); Hamming graph; Discrete mathematics; Mathematical proof; Quantum; Graph; Quantum computer; Quantum mechanics; Hamming code; Physics","score_opus":0.031240090697176863,"score_gpt":0.18061191849245728,"score_spread":0.1493718277952804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961508355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44434863,0.00012689938,0.55273503,0.0004684376,0.0009766292,0.0001413199,0.00000857278,0.00019004388,0.001004443],"genre_scores_gemma":[0.99312216,0.00011682256,0.0044233617,0.00012461882,0.00016787235,1.9100825e-7,0.000007729548,0.000008925779,0.0020283032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987035,0.00009385565,0.000115757655,0.0007495243,0.0001135442,0.00022383472],"domain_scores_gemma":[0.99887127,0.00018031923,0.00025452967,0.0005049014,0.00010739027,0.00008158933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002617587,0.00018937781,0.00022461341,0.00012913732,0.00013288864,0.00015239463,0.0006463701,0.00023836922,0.000010857866],"category_scores_gemma":[0.00005328009,0.00021030304,0.00011070716,0.00021548405,0.000025316334,0.00018243094,0.0014329152,0.00066602306,0.00005544708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016339482,0.00009629952,0.029461239,0.00018468016,0.0002519411,0.00011516286,0.00028236583,0.7963491,0.00003662808,0.16439189,0.0021044307,0.006709923],"study_design_scores_gemma":[0.00021590985,0.000022373884,0.0053433324,0.00007125136,0.000021734784,0.0000046016303,0.000006461505,0.9698261,0.00001748174,0.01953965,0.0046783234,0.0002527808],"about_ca_topic_score_codex":0.000032063235,"about_ca_topic_score_gemma":0.0000020876457,"teacher_disagreement_score":0.5487735,"about_ca_system_score_codex":0.0001620178,"about_ca_system_score_gemma":0.00012619307,"threshold_uncertainty_score":0.8575909},"labels":[],"label_agreement":null},{"id":"W2962792428","doi":"10.26421/qic7.1-2-6","title":"Invertible quantum operations and perfect encryption of quantum states","year":2007,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Mitacs; Government of Canada","keywords":"Invertible matrix; Encryption; Mathematics; Quantum; Unitary transformation; Unitary state; Quantum state; Discrete mathematics; Quantum operation; Quantum algorithm; Pure mathematics; Computer science; Quantum mechanics; Physics; Open quantum system","score_opus":0.008959282702468613,"score_gpt":0.24589734855391038,"score_spread":0.23693806585144175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962792428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4554933,0.000094101946,0.5436699,0.00028365612,0.00016297905,0.00013262923,0.0000035505977,0.00009717981,0.00006269915],"genre_scores_gemma":[0.98359597,0.000096322314,0.015887119,0.0003115797,0.000034599685,0.000004303721,0.000059306898,0.0000067476644,0.0000040709697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845314,0.0000695413,0.0006689175,0.00021959218,0.00032065687,0.00026815603],"domain_scores_gemma":[0.9990476,0.00018351534,0.00021873973,0.00018119463,0.00024033774,0.00012866023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084512914,0.00019004876,0.00021785784,0.00040965813,0.00032593752,0.00027126583,0.00018619513,0.000085636646,0.0000032478904],"category_scores_gemma":[0.000058550206,0.00017338322,0.00004455384,0.000475429,0.000096940355,0.0016161294,0.00013155017,0.00016773056,0.000012194524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051368203,0.00009765177,0.0010629366,0.00025626886,0.000038415412,0.0000030362187,0.015061043,0.08932195,0.0011448476,0.57181764,0.00028054617,0.3208643],"study_design_scores_gemma":[0.00049107784,0.00029476342,0.012445742,0.000048869577,0.000007486338,0.000043784752,0.0005135298,0.97189647,0.0005349587,0.0130728325,0.00044610482,0.00020440032],"about_ca_topic_score_codex":0.00016658683,"about_ca_topic_score_gemma":0.000011626995,"teacher_disagreement_score":0.8825745,"about_ca_system_score_codex":0.000025084124,"about_ca_system_score_gemma":0.00006268688,"threshold_uncertainty_score":0.7070362},"labels":[],"label_agreement":null},{"id":"W2962825398","doi":"10.4086/toc.2015.v011a016","title":"","year":2015,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Monotone polygon; Combinatorics; Mathematics; Bounded function; Function (biology); Quadratic equation; Discrete mathematics; Mathematical analysis","score_opus":0.02375489289472492,"score_gpt":0.25114493347704003,"score_spread":0.2273900405823151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962825398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49054527,0.00013603576,0.5080619,0.0002789263,0.00033357815,0.00008063352,3.1786524e-7,0.00033094216,0.00023242978],"genre_scores_gemma":[0.7768318,5.133751e-7,0.22271495,0.00026302866,0.00016645165,6.937603e-7,6.1251023e-7,0.000013421803,0.000008541797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966281,0.0007341326,0.0007019128,0.0006031996,0.0006698263,0.0006628343],"domain_scores_gemma":[0.9967455,0.0010100605,0.00044860842,0.0010776324,0.00034343055,0.00037472433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005078183,0.00030118975,0.00051649427,0.0002542122,0.00022511318,0.00012914812,0.0026285553,0.00007299872,4.944966e-7],"category_scores_gemma":[0.00042433667,0.00026679458,0.00016486281,0.00089102396,0.00020776888,0.0003779797,0.0015139568,0.0003255919,0.000003522927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040975137,0.00012756312,0.0011075007,0.000026987052,0.000041541043,0.00003141678,0.026914066,0.2055632,0.00082519255,0.4797151,0.000027518041,0.28557894],"study_design_scores_gemma":[0.00090659497,0.0003236465,0.0029336205,0.0000899057,0.000005924475,0.00013006793,0.0004286836,0.73514736,0.004885744,0.2548149,0.000045058445,0.00028847216],"about_ca_topic_score_codex":0.00002157833,"about_ca_topic_score_gemma":6.4151124e-7,"teacher_disagreement_score":0.52958417,"about_ca_system_score_codex":0.00003419414,"about_ca_system_score_gemma":0.00017962694,"threshold_uncertainty_score":0.9999784},"labels":[],"label_agreement":null},{"id":"W2962915432","doi":"10.26421/qic16.9-10-1","title":"Near-linear constructions of exact unitary 2-designs","year":2016,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Canadian Institute for Advanced Research","funders":"","keywords":"Unitary state; Mathematics; Logarithm; Hash function; Qubit; Quadratic equation; Quantum; Quantum Fourier transform; Quantum circuit; Quantum gate; Discrete mathematics; Unitary matrix; Function (biology); Quantum mechanics; Quantum error correction; Computer science; Mathematical analysis; Physics","score_opus":0.015285160950586699,"score_gpt":0.24671118233561862,"score_spread":0.23142602138503193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962915432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27520853,0.000016267071,0.72350454,0.00069933356,0.00017580371,0.0000776905,0.000005997842,0.00010816622,0.00020368084],"genre_scores_gemma":[0.94198996,0.000014464538,0.057810247,0.00014309505,0.000022189019,0.0000025163886,0.000008166431,0.00000312101,0.0000062604026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991437,0.00005301469,0.00036622767,0.00011347722,0.0001873625,0.00013619965],"domain_scores_gemma":[0.99926454,0.00015642837,0.00020549909,0.00015103299,0.00015639504,0.000066099696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001953173,0.00010230136,0.00012346328,0.00014771376,0.00017623628,0.00007752745,0.0001694195,0.00004515863,0.0000064560622],"category_scores_gemma":[0.000037869722,0.00007264849,0.000036648747,0.0002793979,0.00010689155,0.0010747398,0.00007583437,0.00006349339,0.000025485379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011651987,0.000026003458,0.00040678887,0.000041052375,0.000019224237,9.0720874e-7,0.0017722675,0.012006711,0.00034614664,0.14998569,0.00028168588,0.83510184],"study_design_scores_gemma":[0.00047555604,0.00012913295,0.0040674377,0.00004706542,0.0000037058276,0.000048233225,0.000080631005,0.98150504,0.00032919477,0.011799247,0.0013922976,0.00012244111],"about_ca_topic_score_codex":0.00001881255,"about_ca_topic_score_gemma":5.5170415e-7,"teacher_disagreement_score":0.96949834,"about_ca_system_score_codex":0.000013440277,"about_ca_system_score_gemma":0.00007721358,"threshold_uncertainty_score":0.29625192},"labels":[],"label_agreement":null},{"id":"W2962922713","doi":"10.1016/j.dam.2018.12.017","title":"Quantum fractional revival on graphs","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Waterloo; York University","funders":"Natural Sciences and Engineering Research Council of Canada; Universidade Federal de Minas Gerais; Université de Montréal; Centre de Recherches Mathématiques","keywords":"Mathematics; Vertex (graph theory); Quantum walk; Quantum; Superposition principle; Quantum entanglement; Combinatorics; Discrete mathematics; Quantum algorithm; Quantum mechanics; Graph; Physics; Mathematical analysis","score_opus":0.009901371269682874,"score_gpt":0.23602318192251406,"score_spread":0.22612181065283118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962922713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19606104,0.00003600958,0.7543667,0.00088280736,0.00074238435,0.0005671925,0.00000727263,0.0005339353,0.046802647],"genre_scores_gemma":[0.80174375,0.0000068367412,0.1972567,0.00060123834,0.000111182926,0.000019488882,0.000007851824,0.000030767373,0.00022216544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985366,0.000013593737,0.00027026574,0.00040451885,0.0004680598,0.0003069975],"domain_scores_gemma":[0.99873185,0.0002307526,0.00014876305,0.000773012,0.000027832155,0.0000878142],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023375716,0.00021150758,0.00025712166,0.00010212671,0.000118750766,0.00013022729,0.00071101583,0.00006694672,0.000047213678],"category_scores_gemma":[0.000015882413,0.00016570333,0.00011255378,0.00028268935,0.000030679355,0.00007936816,0.00019517819,0.00028386578,0.0008256363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035758892,0.00006792751,0.000008132849,0.000059472626,0.000017318172,0.0000028703814,0.0004068401,0.0016955173,0.0009084303,0.9927572,0.00045748998,0.0036152427],"study_design_scores_gemma":[0.00034633777,0.000105135376,0.00018954271,0.000087474335,0.0000074261297,0.000020775331,0.000071455346,0.6287912,0.0007624486,0.36599985,0.0032714,0.00034692048],"about_ca_topic_score_codex":0.000001278595,"about_ca_topic_score_gemma":1.233679e-7,"teacher_disagreement_score":0.6270957,"about_ca_system_score_codex":0.000018088256,"about_ca_system_score_gemma":0.000029710482,"threshold_uncertainty_score":0.9999523},"labels":[],"label_agreement":null},{"id":"W2963000054","doi":"10.1007/s11128-019-2213-x","title":"Practical integer-to-binary mapping for quantum annealers","year":2019,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; QLT (Canada)","funders":"","keywords":"Integer programming; Binary number; Integer (computer science); Quadratic unconstrained binary optimization; Quantum annealing; Encoding (memory); Quantum; Quantum computer","score_opus":0.020628130528578766,"score_gpt":0.2833123717630261,"score_spread":0.26268424123444734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963000054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11428645,0.00003090167,0.8782027,0.00503921,0.0008004065,0.00058145856,0.0000048588863,0.00043134292,0.0006227201],"genre_scores_gemma":[0.8056569,0.0000018761466,0.19164018,0.0024548534,0.000111937225,0.00004472882,0.000022188942,0.00001669479,0.000050605428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998011,0.000040667015,0.00062419113,0.00034398018,0.00042173747,0.0005584248],"domain_scores_gemma":[0.99851596,0.00020292422,0.00034719118,0.00042041662,0.0003286794,0.00018480909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074664986,0.00024620627,0.0002665713,0.0004139026,0.0003726913,0.00076321186,0.0006517697,0.00010821454,0.000009623222],"category_scores_gemma":[0.00024048405,0.00022201482,0.00010159988,0.00078918756,0.000030414434,0.003694933,0.00026664452,0.0003023,0.00033665352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017255086,0.00022416998,0.00042346094,0.0022963737,0.000066429246,0.000012221828,0.037376475,0.13798968,0.001802127,0.2219615,0.015483277,0.5821917],"study_design_scores_gemma":[0.0003952893,0.00023264489,0.0002905187,0.00021086188,0.0000034807128,0.000050850675,0.0006875533,0.95883465,0.00019964417,0.0022401502,0.036524475,0.00032988575],"about_ca_topic_score_codex":0.000005360654,"about_ca_topic_score_gemma":1.8829869e-7,"teacher_disagreement_score":0.82084495,"about_ca_system_score_codex":0.00007011486,"about_ca_system_score_gemma":0.00028705256,"threshold_uncertainty_score":0.90535015},"labels":[],"label_agreement":null},{"id":"W2963006036","doi":"10.1142/s0219749908003724","title":"LIMITATIONS OF SOME SIMPLE ADIABATIC QUANTUM ALGORITHMS","year":2008,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Hadamard transform; Diagonal; Adiabatic process; Adiabatic quantum computation; Hamiltonian (control theory); Qubit; Basis (linear algebra); Mathematics; Simple (philosophy); Quantum algorithm; Quantum; Quantum mechanics; Quantum computer; Algorithm; Combinatorics; Discrete mathematics; Physics; Mathematical optimization; Geometry","score_opus":0.04188342511616375,"score_gpt":0.2606389758383065,"score_spread":0.21875555072214273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963006036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26734644,0.000119597455,0.7287996,0.0014911409,0.0018924036,0.00008032933,0.000014977071,0.00004126327,0.00021429453],"genre_scores_gemma":[0.9740202,0.00023486868,0.025037445,0.00037597504,0.000298683,0.0000018776166,0.000015932672,0.0000065636796,0.00000848263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749154,0.000075617114,0.0011451413,0.0000945783,0.00099914,0.00019398982],"domain_scores_gemma":[0.9968728,0.000346546,0.0012251635,0.00021845952,0.0012291054,0.00010792829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005593966,0.00014848079,0.00025424233,0.0006773165,0.0001155397,0.00010010903,0.0012647524,0.00006282144,0.000008090574],"category_scores_gemma":[0.000452243,0.00012799229,0.00020493516,0.0003044186,0.00008162449,0.003382926,0.00014328287,0.00025915797,0.000031146177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089162124,0.000485443,0.00094918435,0.000059781996,0.0005220876,0.0001550155,0.01810616,0.11748102,0.000918631,0.40967125,0.006605898,0.44495636],"study_design_scores_gemma":[0.00081334397,0.00032881432,0.0065269736,0.00007193751,0.000010113119,0.0009425578,0.00013789648,0.95696354,0.0010034632,0.025096355,0.007934522,0.00017048093],"about_ca_topic_score_codex":0.000021818481,"about_ca_topic_score_gemma":5.04431e-7,"teacher_disagreement_score":0.83948255,"about_ca_system_score_codex":0.00006972095,"about_ca_system_score_gemma":0.0002702149,"threshold_uncertainty_score":0.52193743},"labels":[],"label_agreement":null},{"id":"W2963143041","doi":"10.4230/lipics.tqc.2013.285","title":"Kitaev's Z_d-Codes Threshold Estimates","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Intelligence Advanced Research Projects Activity; Compute Canada","keywords":"Decoding methods; Code (set theory); Error detection and correction; Noise (video); Quantum; Toric code; Mathematics; Algorithm; Discrete mathematics; Computer science; Physics; Quantum computer; Quantum mechanics; Artificial intelligence; Image (mathematics); Set (abstract data type)","score_opus":0.009502770313851085,"score_gpt":0.23302664153535987,"score_spread":0.2235238712215088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963143041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38909578,0.00015502021,0.5979979,0.0019715412,0.0018120137,0.0016801658,0.00012814984,0.0011416805,0.0060177506],"genre_scores_gemma":[0.7443128,0.000018200433,0.2525212,0.0021390312,0.00030082048,0.00018112524,0.00013457284,0.000059811806,0.00033243845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996841,0.000024325283,0.0010128899,0.0004270557,0.0005706609,0.0011240689],"domain_scores_gemma":[0.997574,0.00024718427,0.00037318864,0.0011638235,0.00030876134,0.00033305393],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043012353,0.0005357498,0.00053555897,0.0002869315,0.0005594782,0.0013337467,0.0021345238,0.00021468026,0.000050677576],"category_scores_gemma":[0.00009081659,0.00043150192,0.00030473844,0.00042439366,0.00015241587,0.0019631737,0.00084681396,0.00053325034,0.0005889772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011075631,0.002263289,0.028259745,0.0030465145,0.001311391,0.00006800119,0.05215424,0.03621248,0.001453023,0.21603304,0.1524761,0.5066114],"study_design_scores_gemma":[0.0011525993,0.00023600057,0.001841111,0.00014396338,0.000016585733,0.0001004025,0.00019310608,0.96631646,0.00098691,0.011885625,0.016478755,0.00064847694],"about_ca_topic_score_codex":0.000046821475,"about_ca_topic_score_gemma":0.0000050619533,"teacher_disagreement_score":0.93010396,"about_ca_system_score_codex":0.000066936875,"about_ca_system_score_gemma":0.0000752414,"threshold_uncertainty_score":0.9998137},"labels":[],"label_agreement":null},{"id":"W2963144492","doi":"","title":"Robust Quantum Algorithms for Oracle Identification","year":2004,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Oracle; Upper and lower bounds; Computer science; Set (abstract data type); Matching (statistics); Algorithm; Identification (biology); Range (aeronautics); Computational complexity theory; Theoretical computer science; Combinatorics; Discrete mathematics; Mathematics","score_opus":0.033022843855384114,"score_gpt":0.26307889350172825,"score_spread":0.23005604964634413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963144492","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111040985,0.000054851986,0.98430353,0.0031160181,0.0005665092,0.00022463492,0.000002957232,0.00042768513,0.00019971216],"genre_scores_gemma":[0.32327825,0.000003964956,0.6757918,0.0003162832,0.00020475643,0.000026880816,0.0000067053547,0.000013922293,0.0003574095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885637,0.000015487716,0.00023062693,0.00042437462,0.00018512769,0.00028800446],"domain_scores_gemma":[0.9992128,0.000060679205,0.000078161094,0.00046829623,0.000098997676,0.00008107654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029622723,0.00012220761,0.00011687854,0.0000858615,0.00023538675,0.00023994932,0.0006916852,0.000048538855,0.000004033491],"category_scores_gemma":[0.00003645414,0.00010322553,0.00008571091,0.0003123841,0.000027294454,0.0002519907,0.000119203745,0.000087504304,0.000058463174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034857776,0.00016991972,0.000017312062,0.00002611368,0.000019996101,0.000007012368,0.0006801683,0.124615386,0.0016095592,0.563375,0.0010433174,0.30843273],"study_design_scores_gemma":[0.00042882035,0.00010590619,0.0005506687,0.000011871631,0.0000029975688,0.00002059889,0.000016833723,0.9215215,0.004351129,0.07045523,0.0023608243,0.0001736591],"about_ca_topic_score_codex":0.000039972645,"about_ca_topic_score_gemma":0.0000054313364,"teacher_disagreement_score":0.79690605,"about_ca_system_score_codex":0.000033772583,"about_ca_system_score_gemma":0.000064431246,"threshold_uncertainty_score":0.4209415},"labels":[],"label_agreement":null},{"id":"W2963218519","doi":"10.26421/qic10.3-4-1","title":"The quantum query complexity of certification","year":2010,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quantum; Upper and lower bounds; Discrete mathematics; Certificate; Quantum algorithm; Tilde; Combinatorics; Physics; Algorithm; Quantum mechanics; Mathematical analysis","score_opus":0.019912356393657835,"score_gpt":0.255435706030646,"score_spread":0.23552334963698818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963218519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3592591,0.000030682644,0.6371926,0.0023305144,0.00064912264,0.00014757318,0.000002966375,0.00012314794,0.00026431732],"genre_scores_gemma":[0.9870293,0.000016036369,0.0127314385,0.00015102033,0.000038343864,0.0000063506604,0.000019783833,0.0000035004546,0.000004189458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887186,0.000060166614,0.0004908716,0.00013232487,0.00027429676,0.00017047954],"domain_scores_gemma":[0.99885947,0.00020412453,0.0003567438,0.00028414075,0.00023125252,0.000064298656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055331906,0.000115861825,0.00012004567,0.00011318163,0.00046432842,0.00030100832,0.00036942033,0.00006006962,0.0000016402903],"category_scores_gemma":[0.00008304284,0.000084136045,0.000045109045,0.0003012183,0.00021199624,0.0008071092,0.00010993332,0.00023132554,0.000018515933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000737332,0.000016775039,0.000082070634,0.000021904647,0.000006294151,1.235667e-7,0.0011461056,0.0012872319,0.00046348796,0.7388147,0.00021170093,0.25794223],"study_design_scores_gemma":[0.00017735339,0.000052710133,0.01423098,0.000008611536,0.0000024236892,0.00001841943,0.00009962513,0.91326636,0.00035959846,0.06814098,0.003542002,0.0001009194],"about_ca_topic_score_codex":0.00005055006,"about_ca_topic_score_gemma":0.00001128359,"teacher_disagreement_score":0.91197914,"about_ca_system_score_codex":0.000007913121,"about_ca_system_score_gemma":0.00005887908,"threshold_uncertainty_score":0.3571286},"labels":[],"label_agreement":null},{"id":"W2963313484","doi":"10.26421/qic10.7-8","title":"Limitations on the simulation of non-sparse Hamiltonians","year":2010,"lang":"en","type":"paratext","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Hamiltonian (control theory); Quantum; Running time; Arboricity; Mathematics; Combinatorics; Measure (data warehouse); Computer science; Discrete mathematics; Statistical physics; Applied mathematics; Physics; Algorithm; Quantum mechanics; Graph; Mathematical optimization","score_opus":0.028581936668601333,"score_gpt":0.26751429989691944,"score_spread":0.2389323632283181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963313484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015577763,0.000050322273,0.9715134,0.0015433856,0.0017820904,0.00051492313,0.0000406152,0.0000783125,0.008899176],"genre_scores_gemma":[0.9885313,0.00010195136,0.009186851,0.0012022988,0.00017756004,0.000029963083,0.0003214652,0.000018415061,0.0004302085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828494,0.0001006071,0.00069711154,0.00023997355,0.00045858548,0.00021877351],"domain_scores_gemma":[0.99746025,0.0009177582,0.00078597525,0.00041941795,0.00034492684,0.000071671835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003875109,0.0002908783,0.00029090844,0.0003964239,0.00038611077,0.00036586355,0.0005097204,0.00026190872,0.00002099756],"category_scores_gemma":[0.00010356634,0.00021453992,0.000104915474,0.0004697163,0.00009914787,0.00061536406,0.00013802883,0.0006461192,0.00057443435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008637964,0.000033316777,9.368453e-7,0.00007880116,0.000022976255,2.6638563e-7,0.0028463074,0.79823524,0.000019677896,0.01414288,0.010716187,0.1738948],"study_design_scores_gemma":[0.00023985765,0.00018178883,0.0003705275,0.000117536074,0.000009894403,0.0000051223806,0.00007492666,0.95998335,0.00006341765,0.0017438848,0.03698108,0.0002286191],"about_ca_topic_score_codex":0.00002391571,"about_ca_topic_score_gemma":0.0000033597616,"teacher_disagreement_score":0.9729535,"about_ca_system_score_codex":0.000022928534,"about_ca_system_score_gemma":0.00015370712,"threshold_uncertainty_score":0.8748684},"labels":[],"label_agreement":null},{"id":"W2963387653","doi":"","title":"Polar codes for private classical communication","year":2012,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum key distribution; Computer science; Quantum channel; Channel (broadcasting); Polar; Topology (electrical circuits); Quantum; Theoretical computer science; Computer network; Mathematics; Quantum information; Physics; Quantum mechanics; Combinatorics","score_opus":0.017461230503574947,"score_gpt":0.265433195254334,"score_spread":0.24797196475075906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963387653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035146978,0.00020164975,0.95978636,0.0034749126,0.00016619104,0.00011126895,0.000001477213,0.00020898506,0.0009021568],"genre_scores_gemma":[0.56488866,0.0000026194627,0.43454352,0.0003330961,0.00008888337,0.000005840437,0.00000260133,0.0000037749355,0.00013101948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939466,0.00004488214,0.00010487761,0.00011522635,0.000090415386,0.00024993997],"domain_scores_gemma":[0.9992208,0.0001783117,0.00003586511,0.00045725665,0.000026343427,0.00008145495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030033977,0.00006933895,0.00008061564,0.00003047647,0.00016553818,0.00007206255,0.0006056677,0.00003391336,0.0000036883262],"category_scores_gemma":[0.000028567829,0.000052750103,0.00004650556,0.000103191305,0.000027878526,0.00019922623,0.0002358637,0.00008714782,0.000019514882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022479974,0.00009199113,0.0010304832,0.000008251557,0.000010288861,1.1793455e-7,0.00055115344,0.00010856169,0.0005479265,0.90809536,0.0031296383,0.08642399],"study_design_scores_gemma":[0.00024262117,0.00005738505,0.006501135,0.000012366193,0.0000036135013,0.000012638187,0.0000087218805,0.8326837,0.0022566568,0.016079832,0.14196412,0.00017721501],"about_ca_topic_score_codex":0.0000055962178,"about_ca_topic_score_gemma":0.0000011541335,"teacher_disagreement_score":0.8920155,"about_ca_system_score_codex":0.000010347544,"about_ca_system_score_gemma":0.000010558677,"threshold_uncertainty_score":0.21510868},"labels":[],"label_agreement":null},{"id":"W2963540678","doi":"10.1139/p07-203","title":"Long-range coupling and scalable architecture for superconducting flux qubits","year":2008,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Physics; Quantum computer; Qubit; Scalability; Initialization; Quantum mechanics; Computation; Coupling (piping); Superconducting quantum computing; Topology (electrical circuits); Quantum; Algorithm; Computer science; Electrical engineering","score_opus":0.021785325541816246,"score_gpt":0.2219045569842658,"score_spread":0.20011923144244956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963540678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6462698,0.00065667176,0.3519254,0.0006527145,0.0003825336,0.000067662644,0.0000053328163,0.000011506118,0.00002838784],"genre_scores_gemma":[0.94622594,0.0000062601225,0.052674763,0.00021411573,0.00080155197,9.0302143e-7,0.000001083145,0.000015955326,0.00005945268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909526,0.000016040316,0.00021599467,0.00017487284,0.00013531146,0.0003625477],"domain_scores_gemma":[0.99896795,0.000119721415,0.00012009961,0.00016922674,0.00018693574,0.00043605347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021333167,0.00013215655,0.00021837662,0.00011511769,0.0004528943,0.0001070016,0.0004186607,0.00004595351,0.000002390743],"category_scores_gemma":[0.000061137034,0.00011715351,0.00009557731,0.00022295056,0.00009140899,0.00023636722,0.000029611432,0.00030688316,0.0000012684848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029922285,0.000120555866,0.045123827,0.00041738446,0.0003621513,0.0018230105,0.037484687,0.3506842,0.0047725015,0.020185672,0.01050212,0.528494],"study_design_scores_gemma":[0.0028793218,0.0010526115,0.013171152,0.0007027471,0.000075264405,0.00792288,0.00028727858,0.91130745,0.007415805,0.038467504,0.015350537,0.0013674167],"about_ca_topic_score_codex":0.0003627644,"about_ca_topic_score_gemma":0.00062059215,"teacher_disagreement_score":0.5606233,"about_ca_system_score_codex":0.000037650116,"about_ca_system_score_gemma":0.00064183766,"threshold_uncertainty_score":0.47773817},"labels":[],"label_agreement":null},{"id":"W2963652075","doi":"10.26421/qic12.11-12","title":"Hamiltonian Simulation Using Linear Combinations of Unitary Operations","year":2012,"lang":"en","type":"paratext","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Unitary state; Hamiltonian (control theory); Unitary transformation; Computer science; Mathematics; Algorithm; Applied mathematics; Mathematical optimization; Quantum; Physics; Quantum mechanics","score_opus":0.024435515609420467,"score_gpt":0.2976477463470241,"score_spread":0.27321223073760365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963652075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025062816,0.00042212234,0.97117186,0.00021527182,0.001547016,0.0003930434,0.00007616771,0.00009795486,0.0010137813],"genre_scores_gemma":[0.9295903,0.00009092665,0.068547964,0.00032580472,0.00020170222,0.000010117946,0.0009968834,0.000021460286,0.00021488013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806523,0.00014598772,0.0008862954,0.00021775906,0.00041373508,0.00027101007],"domain_scores_gemma":[0.9983523,0.00017493154,0.00050535996,0.00030144668,0.0005445465,0.000121422105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033224418,0.00030357088,0.000363839,0.0006624944,0.0004282344,0.00023148833,0.00033854242,0.00024849497,0.000026088279],"category_scores_gemma":[0.00004112927,0.00030388782,0.00009195743,0.00062665174,0.00007624357,0.0019334356,0.00020422497,0.00034176954,0.0002018141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000310994,0.00006931357,0.000004690567,0.00013189377,0.000026795535,1.6982938e-7,0.0017985816,0.95894545,0.000010598308,0.008623841,0.00073376234,0.029651782],"study_design_scores_gemma":[0.0005211669,0.000090732734,0.00024339606,0.00013340627,0.000025440024,0.000015308866,0.00007088647,0.9877225,0.000025788226,0.0004712381,0.010364811,0.00031530808],"about_ca_topic_score_codex":0.00013473467,"about_ca_topic_score_gemma":0.00000306723,"teacher_disagreement_score":0.9045274,"about_ca_system_score_codex":0.00006180562,"about_ca_system_score_gemma":0.0002338665,"threshold_uncertainty_score":0.99994135},"labels":[],"label_agreement":null},{"id":"W2963671227","doi":"10.1016/j.jcta.2019.05.003","title":"Discrete-time quantum walks and graph structures","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum walk; Rotation system; Mathematics; Limiting; Quantum; Random walk; Statistical physics; TRACE (psycholinguistics); Entropy (arrow of time); Graph; Discrete mathematics; Quantum algorithm; Combinatorics; Quantum mechanics; Physics; Statistics","score_opus":0.002975383547587072,"score_gpt":0.20376703839428,"score_spread":0.20079165484669292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963671227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97838324,0.00064819976,0.011384499,0.0007580996,0.008103928,0.00012882728,0.0000024096987,0.00006141474,0.00052938005],"genre_scores_gemma":[0.9942805,0.000029880788,0.0049602427,0.00009393243,0.0004932231,4.2881396e-7,3.6713215e-7,0.0000145487475,0.00012684397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851084,0.00024427054,0.0003968863,0.0002071304,0.00038276185,0.00025812935],"domain_scores_gemma":[0.9987049,0.00028764724,0.00038085922,0.00033564953,0.00014577822,0.00014512982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086716784,0.00019419724,0.00040206936,0.00015746467,0.00013389873,0.00024884622,0.00078525045,0.000084128274,0.00003832158],"category_scores_gemma":[0.00008141514,0.00013858065,0.0001484923,0.00023658441,0.0001083154,0.000569521,0.00027635667,0.00039554332,0.0000068219106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025344448,0.000027622977,0.00008380369,0.000017904562,0.000065098604,0.00002966566,0.0009174087,0.0002432178,0.0013810684,0.990929,0.00021008862,0.0058416906],"study_design_scores_gemma":[0.00094060163,0.0013516076,0.0006682799,0.000055276243,0.000013429485,0.0004613246,0.000083962565,0.0036792404,0.0007686092,0.987666,0.0041072695,0.00020438706],"about_ca_topic_score_codex":0.0000019243253,"about_ca_topic_score_gemma":8.562949e-8,"teacher_disagreement_score":0.01589729,"about_ca_system_score_codex":0.000015682537,"about_ca_system_score_gemma":0.00007439509,"threshold_uncertainty_score":0.5651155},"labels":[],"label_agreement":null},{"id":"W2963760674","doi":"10.1088/1367-2630/17/8/083002","title":"Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes","year":2015,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":226,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"CHIST-ERA; Danmarks Frie Forskningsfond; Institut Périmètre de physique théorique; Industry Canada","keywords":"Physics; Transversal (combinatorics); Transversality; Gauge fixing; Gauge (firearms); Stabilizer (aeronautics); Topology (electrical circuits); Dimension (graph theory); Quantum mechanics; Gauge theory; Pure mathematics; Gauge boson; Mathematical analysis; Combinatorics; Mathematics","score_opus":0.02686247627111954,"score_gpt":0.2663364458233821,"score_spread":0.23947396955226258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963760674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8404383,0.0003642934,0.1577737,0.0010410473,0.00022411619,0.00005348354,0.0000029716114,0.000020667847,0.0000814333],"genre_scores_gemma":[0.92240745,0.000016477281,0.0770728,0.00012642957,0.00035255298,3.4657361e-7,4.965623e-7,0.000007104136,0.000016352316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988085,0.00010409381,0.00032165178,0.00018755176,0.00031313126,0.00026504553],"domain_scores_gemma":[0.99914026,0.0002114181,0.00016863734,0.00013447378,0.00010504594,0.00024017839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044098712,0.00014833742,0.00032552565,0.000060707956,0.00005562676,0.00011817611,0.00044123028,0.000059308477,0.0000040406526],"category_scores_gemma":[0.000055809774,0.00011217445,0.00008088455,0.00022747245,0.000092426344,0.00029309205,0.000106237974,0.00038371098,0.0000016854016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008517975,0.0017060699,0.020637512,0.00016721078,0.00029134908,0.0016036165,0.07103681,0.2748361,0.015689872,0.2154541,0.008654361,0.3890712],"study_design_scores_gemma":[0.0068524736,0.003410795,0.00623394,0.00035651634,0.000049773636,0.0008063637,0.0013203563,0.81950516,0.010437123,0.14596121,0.0042618914,0.0008044173],"about_ca_topic_score_codex":0.000043648277,"about_ca_topic_score_gemma":0.0000087857625,"teacher_disagreement_score":0.54466903,"about_ca_system_score_codex":0.000040103885,"about_ca_system_score_gemma":0.00020793828,"threshold_uncertainty_score":0.45743415},"labels":[],"label_agreement":null},{"id":"W2963775622","doi":"","title":"Disjointness of Stabilizer Codes and Limitations on Fault-Tolerant Logical Gates","year":2018,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Code (set theory); Constant (computer programming); Computer science; Metric (unit); Pauli exclusion principle; Stabilizer (aeronautics); Hierarchy; Mathematics; Discrete mathematics; Algorithm; Topology (electrical circuits); Physics; Quantum mechanics; Combinatorics; Set (abstract data type)","score_opus":0.021996273471439533,"score_gpt":0.25354981139618793,"score_spread":0.2315535379247484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963775622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8819861,0.00032481836,0.10135291,0.0135553405,0.00047519672,0.00030725676,0.000030411573,0.00048431015,0.0014836648],"genre_scores_gemma":[0.90086114,0.00003254608,0.098891854,0.000109075074,0.000046790818,0.000011564304,0.00000306824,0.000011780502,0.000032146952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983009,0.00004281876,0.00042517405,0.0005836635,0.00027479415,0.000372651],"domain_scores_gemma":[0.9983566,0.00017071438,0.0002668271,0.00085144356,0.0002686841,0.00008576602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022658981,0.00027218115,0.00047580243,0.0005258268,0.00022433246,0.000046305184,0.0009470262,0.0002631795,0.0000038478565],"category_scores_gemma":[0.00043122968,0.00021438631,0.0000923546,0.0009340601,0.0017144819,0.00021002215,0.00050450774,0.00034319243,0.000007905877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007714665,0.0009200313,0.0049528116,0.00021299452,0.00025307504,0.00006578591,0.002358207,0.0024441415,0.022425937,0.71700263,0.0008659219,0.24842131],"study_design_scores_gemma":[0.004321931,0.0065324963,0.022011662,0.0014573046,0.00014959558,0.00028279633,0.000576676,0.38488856,0.25849867,0.15740262,0.16167864,0.0021990573],"about_ca_topic_score_codex":0.000013392051,"about_ca_topic_score_gemma":0.000041997548,"teacher_disagreement_score":0.55960006,"about_ca_system_score_codex":0.000023579063,"about_ca_system_score_gemma":0.000073511736,"threshold_uncertainty_score":0.874242},"labels":[],"label_agreement":null},{"id":"W2963776404","doi":"","title":"All languages in NP have very short quantum proofs","year":2007,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematical proof; Soundness; Quantum entanglement; Completeness (order theory); Complexity class; Quantum complexity theory; Class (philosophy); Quantum; Discrete mathematics; Logarithm; Mathematics; Quantum information; Computer science; Theoretical computer science; Combinatorics; Time complexity; Quantum mechanics; Physics; Programming language","score_opus":0.035091163649685314,"score_gpt":0.2048224276190403,"score_spread":0.16973126396935498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963776404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73619217,0.00004538087,0.2612735,0.00013141215,0.00015133467,0.00009769722,0.000001060114,0.00017150432,0.0019359026],"genre_scores_gemma":[0.99722064,0.000009923413,0.0020678272,0.00027039126,0.000072217365,1.3688015e-7,0.000002082993,0.000010206921,0.00034655238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986369,0.00005785709,0.00015477875,0.0005759869,0.00009084299,0.00048365683],"domain_scores_gemma":[0.99913853,0.0001306667,0.000047733924,0.00050803635,0.00003920724,0.00013580787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004598032,0.00017167263,0.00017052444,0.0002800729,0.00008659898,0.000053388332,0.0008713273,0.00008976436,0.0000060468506],"category_scores_gemma":[0.000022508597,0.00017701795,0.00008376959,0.00061162387,0.000061815495,0.0002546284,0.00033038156,0.00028826264,0.000031720232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015203487,0.00079443026,0.17975888,0.000087391985,0.00014026016,0.014598958,0.004697717,0.3051938,0.0013945719,0.4312627,0.001344469,0.060574785],"study_design_scores_gemma":[0.00040261523,0.00009120212,0.029121153,0.000032171658,0.000007951689,0.000035133373,0.00017724266,0.9622596,0.00057266996,0.004916752,0.002034009,0.00034950924],"about_ca_topic_score_codex":0.00016539593,"about_ca_topic_score_gemma":0.00021090168,"teacher_disagreement_score":0.6570658,"about_ca_system_score_codex":0.000075768505,"about_ca_system_score_gemma":0.00004126158,"threshold_uncertainty_score":0.72185826},"labels":[],"label_agreement":null},{"id":"W2963864336","doi":"10.1103/physreva.100.032308","title":"Automated distribution of quantum circuits via hypergraph partitioning","year":2019,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Dalhousie University","keywords":"Hypergraph; Computer science; Electronic circuit; Quantum; Qubit; State (computer science); Theoretical computer science; Quantum algorithm; Algorithm; Computer engineering; Mathematics; Physics; Quantum mechanics; Discrete mathematics","score_opus":0.009519611846734971,"score_gpt":0.3077715891774892,"score_spread":0.29825197733075426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963864336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7311932,0.053662658,0.20816594,0.002713071,0.0005310289,0.002000456,0.000049895836,0.0011225197,0.0005612584],"genre_scores_gemma":[0.98669547,0.011489323,0.00042369566,0.0010049347,0.00021368288,0.00006636513,0.00007033981,0.000027486838,0.000008681676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965696,0.00039401444,0.0007527949,0.00084604044,0.0008295528,0.00060801953],"domain_scores_gemma":[0.99732274,0.00041703117,0.00053092296,0.0012066455,0.0002666537,0.00025601394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005163621,0.00044444654,0.0014889663,0.000045594734,0.00012578872,0.00005361095,0.0011021941,0.000041076397,0.0000123158825],"category_scores_gemma":[0.00032877715,0.0003444038,0.00083168567,0.0016220328,0.000112101145,0.00033505863,0.00035620068,0.00046913436,0.0005143527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000126747345,0.0037971206,0.0011413944,0.039376546,0.00035455386,0.000040814943,0.00036426427,0.0014604361,0.082738064,0.3952952,0.010041394,0.46537754],"study_design_scores_gemma":[0.00026976556,0.00035724288,0.0030575476,0.016378172,0.00015208453,0.000021224621,0.0000010174072,0.9375418,0.0039022819,0.030085586,0.0076450193,0.0005882881],"about_ca_topic_score_codex":0.00001698635,"about_ca_topic_score_gemma":2.6702787e-7,"teacher_disagreement_score":0.93608135,"about_ca_system_score_codex":0.00004890781,"about_ca_system_score_gemma":0.00008810823,"threshold_uncertainty_score":0.9999008},"labels":[],"label_agreement":null},{"id":"W2963865676","doi":"10.37236/7867","title":"A New Perspective on the Average Mixing Matrix","year":2018,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Adjacency matrix; Mathematics; Quantum walk; Centralizer and normalizer; Mixing (physics); Combinatorics; Diagonal matrix; Matrix (chemical analysis); Graph energy; Graph; Discrete mathematics; Diagonal; Pure mathematics; Quantum; Voltage graph; Line graph; Quantum computer; Geometry","score_opus":0.006463072534604405,"score_gpt":0.24793409973938782,"score_spread":0.24147102720478342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963865676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09840636,0.0021134652,0.86516714,0.030498007,0.0014700866,0.0001390781,1.8381314e-7,0.000052932726,0.002152762],"genre_scores_gemma":[0.9979584,0.0000584464,0.0004248909,0.00043890323,0.00067946,4.1467658e-7,2.2040439e-8,0.000011397993,0.00042806147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983133,0.00026779156,0.00024803865,0.0001522873,0.0005037712,0.00051478605],"domain_scores_gemma":[0.9982652,0.0005877527,0.00031383176,0.0004699805,0.00028485814,0.00007836943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001690269,0.00015093206,0.00017451409,0.000091228765,0.00043379885,0.00016928751,0.0019908354,0.00003841259,0.000010155343],"category_scores_gemma":[0.0001703337,0.00007512904,0.00014669355,0.0006267995,0.00006667286,0.00011160222,0.00017132626,0.0010401926,0.000025097317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021289892,0.000031140335,0.000003735332,7.641632e-7,0.00004860789,0.0000075979465,0.0020414342,0.00034925548,0.00006382978,0.9930917,0.0019267102,0.0024139488],"study_design_scores_gemma":[0.00041606463,0.0014392252,0.00009312833,0.000034250283,0.000013567987,0.00037429505,0.00012641073,0.030286469,0.001230149,0.95932734,0.006540779,0.000118319775],"about_ca_topic_score_codex":0.00001763606,"about_ca_topic_score_gemma":0.0000021759356,"teacher_disagreement_score":0.89955205,"about_ca_system_score_codex":0.0003086512,"about_ca_system_score_gemma":0.0006213021,"threshold_uncertainty_score":0.45191768},"labels":[],"label_agreement":null},{"id":"W2964062355","doi":"10.1088/1367-2630/18/1/012002","title":"Bounding quantum gate error rate based on reported average fidelity","year":2015,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Canadian Institute for Advanced Research; University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Quantum error correction; Quantum gate; Quantum computer; Qubit; Pauli exclusion principle; Upper and lower bounds; Quantum circuit; Fidelity; Word error rate; Computer science; Quantum algorithm; Fault tolerance; Quantum; Algorithm; Mathematics; Physics; Quantum mechanics; Telecommunications; Mathematical analysis","score_opus":0.04618921244457481,"score_gpt":0.2886738318057389,"score_spread":0.2424846193611641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964062355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15951526,0.000039199324,0.8371471,0.0015189643,0.0013940774,0.000049938924,9.675218e-7,0.000052029587,0.00028242904],"genre_scores_gemma":[0.961618,0.0000016429345,0.036595277,0.0007061103,0.0010051611,2.2240731e-7,8.799464e-7,0.000013985875,0.000058734327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982452,0.00016957633,0.0005043549,0.00022867261,0.00057380524,0.0002784329],"domain_scores_gemma":[0.9980519,0.00014797988,0.0007103689,0.00045199005,0.00029251073,0.0003452545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011911028,0.00017449178,0.00029448856,0.000087625536,0.000115969604,0.0002036116,0.00065114064,0.000043678952,0.000003709764],"category_scores_gemma":[0.000204382,0.0001379855,0.00017796415,0.00038737585,0.000028222692,0.000295433,0.000090815825,0.00048172614,0.000012639859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008651231,0.00020861923,0.000153783,0.000016309175,0.000056235043,0.0005767885,0.0011676857,0.86906505,0.0011056266,0.006870305,0.0076262383,0.11306685],"study_design_scores_gemma":[0.00091714464,0.00041701368,0.0006324215,0.00009196215,0.000011350482,0.000090069196,0.000009311711,0.95042014,0.0016213028,0.043055493,0.002569601,0.00016421531],"about_ca_topic_score_codex":0.000022579316,"about_ca_topic_score_gemma":8.2396275e-7,"teacher_disagreement_score":0.80210274,"about_ca_system_score_codex":0.00007611724,"about_ca_system_score_gemma":0.0006432889,"threshold_uncertainty_score":0.5626885},"labels":[],"label_agreement":null},{"id":"W2964071930","doi":"10.1063/1.5055357","title":"Relation between fermionic and qubit mean fields in the electronic structure problem","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"OTI Lumionics (Canada); University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamiltonian (control theory); Qubit; Mean field theory; Quantum mechanics; Electronic structure; Physics; Atomic orbital; Quantum; Mathematics; Electron","score_opus":0.021877841430643433,"score_gpt":0.1750706756727951,"score_spread":0.1531928342421517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964071930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8957723,0.000023237884,0.10323132,0.00046478194,0.000047051486,0.000107472886,4.986021e-7,0.000050722,0.0003026565],"genre_scores_gemma":[0.9991626,0.000007845157,0.0005044596,0.00014832159,0.00009400031,1.0811882e-7,0.0000013883423,0.000003913507,0.00007732603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913234,0.000114235285,0.00008533206,0.00035316581,0.000056045843,0.00025890215],"domain_scores_gemma":[0.99946475,0.000093382565,0.000052902607,0.00032325747,0.000028689292,0.000037011145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020819374,0.00010086243,0.00009214641,0.00009163979,0.00020037631,0.000060792292,0.0005739941,0.000076394055,0.0000050046015],"category_scores_gemma":[0.0000071568343,0.000079832025,0.000028187655,0.0005942907,0.00007083906,0.00018613524,0.0001489382,0.00030572864,0.000005847011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015545855,0.000038358125,0.045638427,0.00002070779,0.000040586292,0.0000615654,0.0068852752,0.028184943,0.00004585097,0.90033036,0.00015131607,0.01858707],"study_design_scores_gemma":[0.00044392218,0.00027248048,0.104166344,0.000024215347,0.000014374315,0.000019379251,0.0000668492,0.61488324,0.000060115133,0.27922803,0.0006121564,0.00020889274],"about_ca_topic_score_codex":0.000059065067,"about_ca_topic_score_gemma":0.0002986526,"teacher_disagreement_score":0.62110233,"about_ca_system_score_codex":0.000035361645,"about_ca_system_score_gemma":0.000043697994,"threshold_uncertainty_score":0.32554555},"labels":[],"label_agreement":null},{"id":"W2964113733","doi":"10.26421/qic18.1-2-6","title":"Magic state distillation at intermediate size","year":2018,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut quantique; Université de Sherbrooke","funders":"","keywords":"MAGIC (telescope); Qubit; BCH code; Computer science; Error detection and correction; State (computer science); Algorithm; Mathematics; Discrete mathematics; Quantum; Quantum mechanics; Physics","score_opus":0.00670973982452309,"score_gpt":0.23382863752900815,"score_spread":0.22711889770448507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964113733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48577213,0.00001340878,0.5127176,0.00036297122,0.00039431767,0.000092892995,0.0000033593774,0.00017784399,0.00046548134],"genre_scores_gemma":[0.989143,0.000010625181,0.010023823,0.0006614318,0.000086734275,0.0000027573537,0.000025873831,0.0000048125585,0.000040909996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897003,0.00004964636,0.00036293303,0.00017548722,0.00023765372,0.00020427669],"domain_scores_gemma":[0.9992385,0.00011818106,0.00022156909,0.00015854574,0.00017065823,0.00009254979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022685243,0.0001388025,0.00011662023,0.00012846928,0.0002869004,0.00030994302,0.00018791854,0.000040178187,0.000015263613],"category_scores_gemma":[0.000052697404,0.00012345664,0.000031887514,0.00027921546,0.00008545871,0.0011078926,0.00020741345,0.00008705699,0.0002706372],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035907364,0.000020441646,0.00058781606,0.00004959173,0.000015360432,0.0000019637428,0.009927111,0.0048008435,0.00008591724,0.017974956,0.0013638876,0.96513623],"study_design_scores_gemma":[0.00035528844,0.00016326176,0.032829206,0.000018124076,0.0000023126945,0.0000288065,0.00003028968,0.9490429,0.0001238411,0.013111889,0.004135928,0.00015814154],"about_ca_topic_score_codex":0.000014032083,"about_ca_topic_score_gemma":0.0000049587766,"teacher_disagreement_score":0.96497804,"about_ca_system_score_codex":0.000043109183,"about_ca_system_score_gemma":0.000029136243,"threshold_uncertainty_score":0.5034416},"labels":[],"label_agreement":null},{"id":"W2964117233","doi":"10.1016/j.laa.2012.10.006","title":"Pretty good state transfer on double stars","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Creations of Advanced Catalytic Transformation for the Sustainable Manufacturing at Low Energy, Low Environmental Load","keywords":"Mathematics; Stars; Transfer (computing); State (computer science); Pure mathematics; Geometry; Astrophysics; Physics; Algorithm; Computer science","score_opus":0.01336796604129477,"score_gpt":0.2450173836732997,"score_spread":0.23164941763200492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964117233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44881573,0.00058072974,0.5468237,0.0013721483,0.00011905831,0.000479497,0.000020215452,0.00025571912,0.0015332267],"genre_scores_gemma":[0.9889345,0.000044938482,0.009902703,0.000452673,0.00021924255,0.0000728789,0.0000073073343,0.000012652688,0.0003530956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991288,0.000020303529,0.00014562074,0.00026625878,0.00014379343,0.00029519998],"domain_scores_gemma":[0.999385,0.00006230075,0.000022603705,0.000328484,0.000031889787,0.00016974394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001320564,0.00012513497,0.00010546172,0.000053120937,0.00021854708,0.0000627407,0.00029911965,0.000039676066,0.000007598221],"category_scores_gemma":[0.0000019128593,0.00010321556,0.00003776804,0.00025103867,0.000022421376,0.00017160062,0.00007194816,0.00016570846,0.00009448549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014448972,0.00040735232,0.00033545337,0.000042916476,0.000042608473,9.172033e-7,0.002854099,0.0007269354,0.0022009984,0.8044073,0.00034108787,0.18862587],"study_design_scores_gemma":[0.0020684015,0.00037624504,0.014550145,0.000056727516,0.00004075425,0.000054485346,0.000042676224,0.5712625,0.02957494,0.013106306,0.36770898,0.0011578304],"about_ca_topic_score_codex":0.000004755974,"about_ca_topic_score_gemma":0.0000010034671,"teacher_disagreement_score":0.791301,"about_ca_system_score_codex":0.000007417848,"about_ca_system_score_gemma":0.000018933511,"threshold_uncertainty_score":0.42090085},"labels":[],"label_agreement":null},{"id":"W2964121217","doi":"10.1142/s0219749913500470","title":"SYMMETRIC AND ASYMMETRIC QUANTUM CODES","year":2013,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"BCH code; Block code; Expander code; Linear code; Hermitian matrix; Luby transform code; Discrete mathematics; Mathematics; Algorithm; Pure mathematics; Error detection and correction; Decoding methods","score_opus":0.00767518488308606,"score_gpt":0.23418539428589455,"score_spread":0.2265102094028085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964121217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28808698,0.00028041986,0.70432705,0.0043698917,0.0020794151,0.0001059381,0.0000036550246,0.000052270192,0.0006944065],"genre_scores_gemma":[0.98297864,0.00014745716,0.01586883,0.00078337773,0.00020323676,0.0000021436886,0.000004488206,0.000004395159,0.0000074263303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982363,0.00004836494,0.0007010816,0.00009042604,0.00074632734,0.00017748777],"domain_scores_gemma":[0.9978234,0.00022556528,0.0006808273,0.00014029849,0.0010080014,0.00012186974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051940663,0.00013091089,0.00018113019,0.0012764032,0.00007721822,0.0007067746,0.0009456609,0.0000567681,0.0000116701],"category_scores_gemma":[0.0003541393,0.0001023812,0.00008873714,0.00057197514,0.000036954014,0.003479493,0.0001982018,0.0002503362,0.00007614329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015088675,0.00006837893,0.0007526093,0.000020616273,0.00012152169,0.00001587793,0.0013404873,0.0033015474,0.00008574661,0.22600262,0.0037783,0.7644972],"study_design_scores_gemma":[0.00052326295,0.00019123578,0.016980013,0.000052476677,0.000005478286,0.0006585876,0.00009669682,0.9528389,0.00017775448,0.021940826,0.006390436,0.00014436267],"about_ca_topic_score_codex":0.000065503365,"about_ca_topic_score_gemma":2.4045556e-7,"teacher_disagreement_score":0.94953734,"about_ca_system_score_codex":0.000057477206,"about_ca_system_score_gemma":0.00006686945,"threshold_uncertainty_score":0.68154436},"labels":[],"label_agreement":null},{"id":"W2964122836","doi":"10.1109/ms.2020.2985321","title":"Quantum Advantage and the Y2K Bug: A Comparison","year":2020,"lang":"en","type":"article","venue":"IEEE Software","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Toronto Metropolitan University","funders":"","keywords":"Quantum computer; Quantum; Quantum cryptography; Quantum algorithm; Cryptography; Computation; Quantum information; Quantum technology","score_opus":0.014873082323117954,"score_gpt":0.24411442581218962,"score_spread":0.22924134348907166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964122836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09548626,0.0008529415,0.892159,0.010328865,0.0004542487,0.00017235555,0.000006681093,0.0004960078,0.000043680455],"genre_scores_gemma":[0.9562587,0.000015322616,0.040267322,0.003166345,0.00025002117,0.000006463509,0.0000012782184,0.000013099046,0.00002141107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881923,0.000102453996,0.00020214992,0.0003834719,0.00023169281,0.00026098618],"domain_scores_gemma":[0.99908257,0.00031108723,0.00008492576,0.00034620834,0.000033736767,0.0001414692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001823033,0.00015932029,0.00024872145,0.000025521627,0.00040316995,0.00014950077,0.00075883686,0.00004287078,0.0000042280185],"category_scores_gemma":[0.00011472056,0.000101678364,0.000075346274,0.00026670084,0.00013907088,0.00010839566,0.00040430404,0.00030652128,0.000029441288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027483402,0.00021292549,0.011015761,0.00033429297,0.00020268989,0.00028308725,0.08986877,0.021662382,0.0006186929,0.06918227,0.02976647,0.77657783],"study_design_scores_gemma":[0.0009081274,0.00009811791,0.00050039677,0.00002296127,0.000007811083,0.000029331428,0.00006402963,0.97980607,0.00018794273,0.003713636,0.014471221,0.00019034809],"about_ca_topic_score_codex":0.000015341022,"about_ca_topic_score_gemma":0.0000036128918,"teacher_disagreement_score":0.9581437,"about_ca_system_score_codex":0.0000061888486,"about_ca_system_score_gemma":0.000030907122,"threshold_uncertainty_score":0.41463235},"labels":[],"label_agreement":null},{"id":"W2964229111","doi":"10.48550/arxiv.1802.09025","title":"Online Learning of Quantum States","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dimension (graph theory); Learnability; Quantum decoherence; Qubit; Quantum state; State (computer science); Convex optimization; Mathematics; Weak measurement; Quantum; Measure (data warehouse); Discrete mathematics; Computer science; Algorithm; Regular polygon; Combinatorics; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.030052862385734735,"score_gpt":0.1860936531163934,"score_spread":0.15604079073065866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964229111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5534938,0.0000098882365,0.446068,0.00004687849,0.00009920511,0.000021717746,0.0000013712423,0.00009272647,0.00016643817],"genre_scores_gemma":[0.99544466,0.000015498894,0.0040117516,0.00004969865,0.00007526054,2.1932971e-8,0.0000024666656,0.0000062875306,0.00039438214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991869,0.0000707696,0.00010985565,0.0003521582,0.000056377554,0.0002239554],"domain_scores_gemma":[0.9992688,0.00008905342,0.00010543529,0.0003391573,0.00012207456,0.000075482974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001293129,0.000104800056,0.00013528804,0.000118968535,0.00014756038,0.000022344759,0.0006780986,0.000039561837,0.000014959631],"category_scores_gemma":[0.00002543921,0.00010375188,0.00006425863,0.00062725233,0.00014552273,0.00015214099,0.00030596272,0.00016130113,0.00003200803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003229972,0.00031351738,0.008340803,0.000033233922,0.000067951565,0.00014851661,0.0019696774,0.5846421,0.0007763089,0.3858242,0.00028067845,0.017570691],"study_design_scores_gemma":[0.00021427035,0.00025780968,0.0025512613,0.000021572125,0.0000054919046,0.0000049177675,0.00008375267,0.98510337,0.00049433275,0.010005361,0.0011339053,0.00012394293],"about_ca_topic_score_codex":0.000063793384,"about_ca_topic_score_gemma":0.0000068785866,"teacher_disagreement_score":0.44205624,"about_ca_system_score_codex":0.000016000175,"about_ca_system_score_gemma":0.000032335618,"threshold_uncertainty_score":0.4230879},"labels":[],"label_agreement":null},{"id":"W2964323614","doi":"10.1007/s11128-015-1150-6","title":"Fast clique minor generation in Chimera qubit connectivity graphs","year":2015,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada); Simon Fraser University","funders":"Mitacs","keywords":"Quantum annealing; Pairwise comparison; Clique graph; Combinatorics; Ising model; Qubit; Quantum computer; Discrete mathematics; Computer science; Quantum; Mathematics; Graph; Line graph; Physics; Quantum mechanics; Graph power","score_opus":0.02286054463001615,"score_gpt":0.2533548314418175,"score_spread":0.2304942868118013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964323614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45866194,0.000092347625,0.53908294,0.0006690503,0.00031426467,0.0001611442,0.0000016658612,0.00020232584,0.0008143226],"genre_scores_gemma":[0.97738546,0.0000027063204,0.021862576,0.0006058683,0.00008585171,0.00001735801,0.00002414457,0.0000064682,0.00000956797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985421,0.00008495419,0.00048749032,0.00022102575,0.00035625944,0.00030822968],"domain_scores_gemma":[0.99910855,0.00003073973,0.0002667062,0.00025179857,0.00021735666,0.00012486395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007657284,0.00017643157,0.00018241012,0.0003636173,0.0001927676,0.0005568607,0.00040203167,0.000089748355,0.0000018817949],"category_scores_gemma":[0.0001236875,0.00016146917,0.0000421859,0.0007998539,0.000035407225,0.0035986567,0.00012107735,0.00025772554,0.0000387084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000217431,0.00011282819,0.0014174477,0.00012877287,0.0000087961635,0.0000078771745,0.02429041,0.08155772,0.0003738578,0.05794855,0.00087388646,0.8332581],"study_design_scores_gemma":[0.00049916387,0.000070924405,0.0015757848,0.000043222604,0.0000016739173,0.000035442295,0.00017072506,0.9894179,0.00066460576,0.006119726,0.0011757335,0.00022509137],"about_ca_topic_score_codex":0.00007394469,"about_ca_topic_score_gemma":0.000020811485,"teacher_disagreement_score":0.90786016,"about_ca_system_score_codex":0.000070915514,"about_ca_system_score_gemma":0.00027222498,"threshold_uncertainty_score":0.65845215},"labels":[],"label_agreement":null},{"id":"W2964904559","doi":"10.1088/1367-2630/ab35fb","title":"Parallel quantum trajectories via forking for sampling without redundancy","year":2019,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ProteinQure (Canada)","funders":"National Research Foundation of Korea; Department of Science and Technology, Republic of South Africa; National Research Foundation","keywords":"Quantum algorithm; Quantum computer; Quantum; Quantum entanglement; Quantum network; Quantum error correction; Redundancy (engineering); Quantum state; One-way quantum computer","score_opus":0.025828014668379178,"score_gpt":0.2762647693803045,"score_spread":0.2504367547119253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964904559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11256863,0.0002266226,0.88514555,0.0003722751,0.0014995445,0.00011470663,7.7193926e-7,0.000032141208,0.000039776693],"genre_scores_gemma":[0.6051475,0.000006685304,0.3931284,0.00009988063,0.0015362994,6.458259e-7,4.855981e-7,0.00001707536,0.00006303855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988004,0.000027285749,0.00036337768,0.00019817571,0.00031152935,0.0002992372],"domain_scores_gemma":[0.99881786,0.00018822832,0.00044374785,0.00026837268,0.00016341657,0.00011839824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027311116,0.00016039636,0.00032778355,0.000057045072,0.00012337005,0.0001550061,0.0007007325,0.00004511373,0.0000018348928],"category_scores_gemma":[0.000024242603,0.00013017794,0.00023438038,0.00021040614,0.000018007546,0.00036024576,0.0000806312,0.00028579388,0.000004734196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097008124,0.0001231438,0.0016017262,0.00010569997,0.00014863587,0.000007958353,0.0041931355,0.10497198,0.007564941,0.0955286,0.000734826,0.78492236],"study_design_scores_gemma":[0.0016235033,0.0007742476,0.0006704494,0.0002920117,0.000026173802,0.00013583183,0.000045258043,0.66569275,0.00230043,0.32010105,0.00800231,0.0003360141],"about_ca_topic_score_codex":0.000008785512,"about_ca_topic_score_gemma":8.2623023e-7,"teacher_disagreement_score":0.7845863,"about_ca_system_score_codex":0.00002863073,"about_ca_system_score_gemma":0.00019720719,"threshold_uncertainty_score":0.53085023},"labels":[],"label_agreement":null},{"id":"W2966125890","doi":"10.1145/3408039","title":"Efficient Estimation of Pauli Channels","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Quantum Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Australian Research Council; Government of Ontario; Canada First Research Excellence Fund; Industry Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Pauli exclusion principle; Quantum error correction; Qubit; Quantum; Quantum channel; Channel (broadcasting); Markov process; Quantum information; Hilbert space","score_opus":0.021273168529966743,"score_gpt":0.2523869865209993,"score_spread":0.23111381799103253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966125890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27351332,0.000039204504,0.7225936,0.0029043045,0.00046851297,0.00013346248,0.0000025607974,0.00032086158,0.000024198624],"genre_scores_gemma":[0.8717732,0.0000018391733,0.1276823,0.00044117295,0.00007921453,0.0000022031343,0.0000013835102,0.000015985675,0.000002700855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981571,0.0001020216,0.00046541617,0.0005280436,0.00039948933,0.0003479658],"domain_scores_gemma":[0.99852735,0.00039339485,0.00019847631,0.00063375646,0.000077759214,0.00016925589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025752716,0.00022693754,0.0002988078,0.00015311205,0.00031173724,0.00008560734,0.0010990091,0.00007038575,0.000010500898],"category_scores_gemma":[0.00007591879,0.0002155733,0.00016867941,0.000876668,0.000054188687,0.00006552749,0.000064241634,0.0003650401,0.000044979668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050438607,0.00008112016,0.0000036552274,0.000028607423,0.000017391081,0.0000055806195,0.0017510228,0.8237621,0.00024092631,0.0014807316,0.000016266122,0.17260754],"study_design_scores_gemma":[0.00033693083,0.0003207619,0.00011505624,0.00009021092,0.000010262067,0.000017833692,0.00005100165,0.9939571,0.0037621667,0.0010687775,0.000052541094,0.00021733923],"about_ca_topic_score_codex":0.000013420942,"about_ca_topic_score_gemma":1.5391939e-7,"teacher_disagreement_score":0.5982599,"about_ca_system_score_codex":0.00002267021,"about_ca_system_score_gemma":0.000054638793,"threshold_uncertainty_score":0.8790824},"labels":[],"label_agreement":null},{"id":"W2967776020","doi":"10.1103/physrevlett.124.080501","title":"Accelerating Lattice Quantum Field Theory Calculations via Interpolator Optimization Using Noisy Intermediate-Scale Quantum Computing","year":2020,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Nuclear Physics; Australian Research Council; Institut Périmètre de physique théorique; National Science Foundation; Government of Canada; U.S. Department of Energy; Office of Science","keywords":"Quantum computer; Physics; Quantum field theory; Statistical physics; Quantum algorithm; Quantum; Computation; Lattice (music); Field (mathematics); Computer science; Quantum mechanics; Theoretical physics; Algorithm; Mathematics","score_opus":0.023844680747087867,"score_gpt":0.2886550807493156,"score_spread":0.2648104000022278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967776020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1436954,0.0005267997,0.8421762,0.012782147,0.00029383381,0.00026937676,0.000002003895,0.00023700371,0.000017234122],"genre_scores_gemma":[0.85264313,0.000049087055,0.08576479,0.06077692,0.00071909785,0.000005772504,0.000008274696,0.000032416385,4.9359096e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977259,0.00034680794,0.0005194751,0.0006339615,0.00033884557,0.0004350125],"domain_scores_gemma":[0.9982977,0.0006403148,0.00029389793,0.00042238555,0.000073369854,0.0002723261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000326789,0.00031277747,0.0005140603,0.000054920354,0.0002948786,0.0001995507,0.00085199036,0.000025807745,0.000015098224],"category_scores_gemma":[0.00026971105,0.00027415156,0.00026355343,0.0006493197,0.000060649807,0.00038045054,0.0005398332,0.0005262074,0.000028881484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019903957,0.00021421279,0.00034594804,0.00160672,0.00012726877,0.000048956437,0.0059418683,0.9087751,0.014173268,0.011537521,0.0010267996,0.056182463],"study_design_scores_gemma":[0.0001404224,0.00007345353,0.00008329666,0.00093487446,0.00004370011,0.000010864356,0.000010091732,0.9977552,0.00016499788,0.00031553095,0.00014905946,0.0003184987],"about_ca_topic_score_codex":0.000014404755,"about_ca_topic_score_gemma":3.2086723e-7,"teacher_disagreement_score":0.75641143,"about_ca_system_score_codex":0.00004277204,"about_ca_system_score_gemma":0.00004495098,"threshold_uncertainty_score":0.9999711},"labels":[],"label_agreement":null},{"id":"W2967973346","doi":"10.22331/q-2020-04-06-252","title":"Number-Theoretic Characterizations of Some Restricted Clifford+T Circuits","year":2020,"lang":"lv","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Electronic circuit; Unitary state; Unitary matrix; Quantum gate; Set (abstract data type); Matrix (chemical analysis); Topology (electrical circuits); Field (mathematics)","score_opus":0.020041669367498297,"score_gpt":0.24546463035842667,"score_spread":0.22542296099092837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967973346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82928413,0.00041455188,0.15513389,0.01139924,0.0020404735,0.0004901193,0.00017154451,0.0004251881,0.0006408382],"genre_scores_gemma":[0.99546295,0.00014216475,0.0019386375,0.0013993692,0.00088079047,0.0000066105295,0.000037787646,0.000053218624,0.00007845087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964718,0.00031151247,0.00094877207,0.0009014256,0.0006302203,0.00073624926],"domain_scores_gemma":[0.9975784,0.00030042138,0.0005954206,0.00083702867,0.00022172114,0.00046703487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002107449,0.0004414199,0.00067237153,0.00013476047,0.00030579147,0.0002271487,0.0016038695,0.00022014328,0.00013770281],"category_scores_gemma":[0.00033683277,0.00043768043,0.0002739712,0.0017414386,0.00029633276,0.00034123394,0.0005487979,0.000622849,0.00040909005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038001508,0.000500299,0.002195946,0.000684108,0.00016805046,0.00016169649,0.010772094,0.0015541933,0.017044038,0.91577286,0.0016533028,0.049455434],"study_design_scores_gemma":[0.0006986267,0.0005687143,0.011880086,0.00027964782,0.00006071105,0.0000446079,0.00006536518,0.9607773,0.001039903,0.02148165,0.002510193,0.00059323973],"about_ca_topic_score_codex":0.000024971356,"about_ca_topic_score_gemma":2.995882e-7,"teacher_disagreement_score":0.9592231,"about_ca_system_score_codex":0.00002908571,"about_ca_system_score_gemma":0.00028540005,"threshold_uncertainty_score":0.9998075},"labels":[],"label_agreement":null},{"id":"W2968685279","doi":"10.1007/978-3-030-26948-7_2","title":"Quantum Cryptanalysis in the RAM Model: Claw-Finding Attacks on SIKE","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Key encapsulation; Cryptanalysis; Computer science; Quantum computer; Supersingular elliptic curve; Computation; Post-quantum cryptography; Quantum; Cryptography; Theoretical computer science; Algorithm; Public-key cryptography; Key exchange; Elliptic curve; Mathematics; Computer security; Quantum mechanics; Physics; Encryption","score_opus":0.023087604089308066,"score_gpt":0.26689988001001513,"score_spread":0.24381227592070706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968685279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019351367,0.00024968822,0.990141,0.0024313128,0.0014383735,0.0005432453,0.000006177152,0.00016284201,0.0030922769],"genre_scores_gemma":[0.80014133,0.00004789126,0.19161932,0.0070863906,0.00070167484,0.000012388568,0.000008486531,0.00007914447,0.00030337303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936047,0.0001426202,0.0008162923,0.0023435445,0.0019139041,0.0011789186],"domain_scores_gemma":[0.99504656,0.0014422032,0.00043326302,0.002779651,0.00014617323,0.00015214736],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0022853361,0.00086661096,0.0009066058,0.001638702,0.00043959625,0.0010757975,0.0074354475,0.00045001827,0.00000826097],"category_scores_gemma":[0.00011431884,0.00061414414,0.00036092685,0.0016062646,0.00049901236,0.00036608297,0.0014726683,0.0024567368,0.000081887236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004929064,0.00003660989,0.000029473988,0.000020865176,0.000011427574,0.00008914312,0.0013074334,0.77991736,0.000015016185,0.04314557,0.000030643612,0.17539153],"study_design_scores_gemma":[0.0002461333,0.0002002929,0.00008472415,0.0003991573,0.000010595463,0.000050170995,4.6723972e-7,0.85702443,0.00005938553,0.1408759,0.00040001882,0.0006487393],"about_ca_topic_score_codex":0.00003144399,"about_ca_topic_score_gemma":0.00006415101,"teacher_disagreement_score":0.79852164,"about_ca_system_score_codex":0.00032816778,"about_ca_system_score_gemma":0.00067680795,"threshold_uncertainty_score":0.9999612},"labels":[],"label_agreement":null},{"id":"W2968697199","doi":"10.4230/lipics.mfcs.2020.26","title":"Span Programs and Quantum Time Complexity","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"QuantERA; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Span (engineering); Computer science; Structural engineering; Engineering","score_opus":0.03405248869646342,"score_gpt":0.2589164173791722,"score_spread":0.22486392868270877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968697199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17912425,0.0002318531,0.8038238,0.0054695327,0.0027935763,0.004004749,0.00086224877,0.001954879,0.0017350628],"genre_scores_gemma":[0.5399454,0.000072212766,0.452876,0.0028977448,0.00110189,0.0002752777,0.002402391,0.00018478399,0.00024429022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995647,0.0000953885,0.0014503832,0.00091449934,0.0007684978,0.0011242244],"domain_scores_gemma":[0.9965699,0.00015108062,0.0009037258,0.0015244844,0.00028533567,0.0005655311],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006552122,0.0009478654,0.0011558726,0.0002733616,0.00052815786,0.0018333369,0.002839275,0.0005434071,0.000010913105],"category_scores_gemma":[0.00008668699,0.00085156364,0.00047624172,0.00035038785,0.0003539491,0.0005871224,0.005929237,0.0018208433,0.00015429544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045102078,0.0027065196,0.006312046,0.017111372,0.00280628,0.00020908845,0.0992243,0.0071926196,0.00014524497,0.18620476,0.03648323,0.6411535],"study_design_scores_gemma":[0.0011732973,0.0003881679,0.0006035699,0.00047914797,0.000045018878,0.000106206855,0.00009920541,0.94091785,0.000050541792,0.027082382,0.028071916,0.0009826897],"about_ca_topic_score_codex":0.000042780383,"about_ca_topic_score_gemma":0.000007815143,"teacher_disagreement_score":0.93372524,"about_ca_system_score_codex":0.00009778709,"about_ca_system_score_gemma":0.00021118994,"threshold_uncertainty_score":0.9993935},"labels":[],"label_agreement":null},{"id":"W2968865619","doi":"10.5539/cis.v12n3p104","title":"Quantum Computing in the Biomedical Sciences; A Brief Introduction into Concepts and Applications","year":2019,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quantum computer; Computer science; Qubit; IBM; Quantum entanglement; Exploit; Quantum superposition; Quantum; Quantum algorithm; Theoretical computer science; Superposition principle; Quantum technology; Computational science; Computer engineering; Open quantum system; Quantum mechanics; Physics; Computer security","score_opus":0.006398549489011946,"score_gpt":0.26140925625224,"score_spread":0.255010706763228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968865619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19208981,0.00004874735,0.8037129,0.0031413399,0.0003567117,0.0002859591,5.1251624e-7,0.00005952636,0.00030449085],"genre_scores_gemma":[0.956639,0.000012023279,0.041407287,0.0017184662,0.00021207065,0.0000058707674,0.0000024774256,0.0000014661622,0.0000013411171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985098,0.00005288179,0.00030377414,0.0003564849,0.00050291204,0.00027413134],"domain_scores_gemma":[0.99926865,0.0001493283,0.000110877554,0.00030461178,0.00008651609,0.00007998614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019108874,0.000109633234,0.00011873006,0.00037813987,0.0006039923,0.0009209794,0.0009769903,0.000032024283,0.0000014531709],"category_scores_gemma":[0.00002782024,0.0000755856,0.000016630274,0.0018902357,0.0008238543,0.003183914,0.0005389952,0.00018421334,0.000017779623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014803924,0.000026681031,0.0010641612,0.000038623493,0.0000016023173,4.963851e-7,0.01100622,0.0027963864,0.00013448439,0.4261799,0.00023642018,0.5585136],"study_design_scores_gemma":[0.0002223679,0.00011824565,0.016100526,0.000017137547,6.737914e-7,0.00009564678,0.00017095468,0.95846164,0.000016258899,0.002023086,0.02266181,0.00011165254],"about_ca_topic_score_codex":0.000020308145,"about_ca_topic_score_gemma":4.4465907e-7,"teacher_disagreement_score":0.95566523,"about_ca_system_score_codex":0.000020987802,"about_ca_system_score_gemma":0.00011573721,"threshold_uncertainty_score":0.8881026},"labels":[],"label_agreement":null},{"id":"W2969914862","doi":"","title":"Layout-Aware Embedding for Quantum Annealing Processors.","year":2019,"lang":"en","type":"article","venue":"ISC","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantum annealing; Qubit; Embedding; Quantum computer; Ising model; Quantum; Lattice (music); Computer science; Graph; Simulated annealing; Mathematics; Discrete mathematics; Theoretical computer science; Statistical physics; Quantum mechanics; Algorithm; Physics; Artificial intelligence","score_opus":0.010671612457324026,"score_gpt":0.2655260001234615,"score_spread":0.2548543876661375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969914862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38524315,0.00012233974,0.61188316,0.00088549976,0.00086776953,0.00026346053,0.0000054899588,0.00042440704,0.00030471894],"genre_scores_gemma":[0.95845383,0.0000011964572,0.040642783,0.00032822613,0.00022189305,0.000012592801,0.000003830422,0.000017028278,0.0003186289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988355,0.000020486877,0.00017301463,0.00042253063,0.00017776215,0.00037070492],"domain_scores_gemma":[0.99926645,0.0001265198,0.00008349854,0.0003780681,0.00007600363,0.00006947577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002398576,0.00014073781,0.00017344538,0.00007512729,0.00015468194,0.00016998069,0.0006857977,0.000056792283,0.0000060493257],"category_scores_gemma":[0.000028932503,0.00011881348,0.0000857886,0.00022208685,0.0000139075455,0.00018655599,0.00017628985,0.0001378825,0.000075525066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071357375,0.0003010705,0.0054556495,0.0013672434,0.00017881396,0.000065665154,0.026381116,0.46850982,0.004376522,0.11747856,0.012475955,0.36333823],"study_design_scores_gemma":[0.0002669326,0.00009262561,0.00018580694,0.00007049032,0.0000025826446,0.000013243835,0.000041536798,0.98652786,0.00054158777,0.0026258938,0.009442774,0.00018866056],"about_ca_topic_score_codex":0.000008963083,"about_ca_topic_score_gemma":0.0000012001325,"teacher_disagreement_score":0.57321066,"about_ca_system_score_codex":0.000014970411,"about_ca_system_score_gemma":0.000054374465,"threshold_uncertainty_score":0.4845073},"labels":[],"label_agreement":null},{"id":"W2971493483","doi":"10.1007/jhep09(2019)021","title":"Quantum error-detection at low energies","year":2019,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; Institute for Quantum Information and Matter, California Institute of Technology; Simons Foundation Autism Research Initiative; Technische Universität München; Kavli Institute for Theoretical Physics, University of California, Santa Barbara; QuantERA; Simons Foundation; National Science Foundation","keywords":"Bethe ansatz; Toric code; Degenerate energy levels; Eigenvalues and eigenvectors; Tensor (intrinsic definition); Tensor product; Gapless playback; Ansatz; Excited state","score_opus":0.006661869818167387,"score_gpt":0.20649686484089022,"score_spread":0.19983499502272284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971493483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5813144,0.00009708861,0.4167451,0.00012688347,0.0016229767,0.000012082041,5.1162425e-7,0.000035836132,0.000045141376],"genre_scores_gemma":[0.9935112,0.0000315614,0.005206611,0.00018037723,0.0007743604,5.199299e-7,6.544657e-7,0.000015282685,0.00027943664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987143,0.00007340046,0.0003255567,0.0002049546,0.00043608088,0.0002456902],"domain_scores_gemma":[0.9988495,0.00009456023,0.00044342352,0.00036164065,0.00016010256,0.00009074698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015190445,0.00016628808,0.00028529178,0.000096091564,0.000114133276,0.00008757335,0.0006595307,0.0000587606,0.0000066072503],"category_scores_gemma":[0.00000799479,0.00012971279,0.00019436049,0.00031280468,0.000028426939,0.00035966255,0.0002345665,0.00022147634,0.000020499641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004993004,0.00018634615,0.00010970878,0.00003588721,0.00012216331,0.00006979065,0.0004837966,0.47439688,0.029176116,0.37024063,0.00076804677,0.124360725],"study_design_scores_gemma":[0.0010617066,0.0008954271,0.0015711449,0.00012987683,0.000020921045,0.00038946353,0.000027891121,0.63023645,0.18097495,0.17842752,0.0057900795,0.00047459247],"about_ca_topic_score_codex":0.000037498045,"about_ca_topic_score_gemma":0.0000039382694,"teacher_disagreement_score":0.41219682,"about_ca_system_score_codex":0.00006967557,"about_ca_system_score_gemma":0.000061994084,"threshold_uncertainty_score":0.5289534},"labels":[],"label_agreement":null},{"id":"W2972032089","doi":"10.22331/q-2020-05-25-269","title":"Quantum Natural Gradient","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":439,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Mathematics; Tensor (intrinsic definition); Diagonal; Quantum; Quantum algorithm; Generalization; Metric (unit); Gradient descent; Pure mathematics; Mathematical analysis; Quantum mechanics; Computer science; Physics; Geometry; Artificial intelligence; Artificial neural network","score_opus":0.014673203779509083,"score_gpt":0.22896044920490996,"score_spread":0.21428724542540087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972032089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43794343,0.001271424,0.5177107,0.03735471,0.0031603726,0.00027703043,0.0000060144835,0.0015876135,0.00068874203],"genre_scores_gemma":[0.9843058,0.000009148804,0.011843944,0.0033806842,0.0003964097,0.0000043903738,0.000003403367,0.000017932205,0.00003830589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816924,0.000078415105,0.00027288595,0.0006116577,0.0003666579,0.00050113676],"domain_scores_gemma":[0.99900305,0.00008815999,0.00009464896,0.00047597662,0.000054628763,0.00028350882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014969119,0.00023187869,0.00024492072,0.00006709765,0.00020594716,0.00018933057,0.0012670931,0.000053826338,0.000013367316],"category_scores_gemma":[0.000079976206,0.00019165948,0.00014746662,0.0005801668,0.000054932287,0.00020663581,0.0004232312,0.0004088335,0.00027942882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002749468,0.00013704374,0.0003133089,0.00007632652,0.000064381515,0.00034031726,0.0058289105,0.0025689285,0.0036768294,0.87399846,0.021192389,0.091775626],"study_design_scores_gemma":[0.0002566395,0.00020569733,0.0008911077,0.000016655966,0.0000037971329,0.000038980234,0.00002623378,0.96560025,0.000473788,0.008211734,0.023990937,0.00028416218],"about_ca_topic_score_codex":0.000017621207,"about_ca_topic_score_gemma":9.62258e-7,"teacher_disagreement_score":0.96303135,"about_ca_system_score_codex":0.000019433095,"about_ca_system_score_gemma":0.000056092944,"threshold_uncertainty_score":0.78156465},"labels":[],"label_agreement":null},{"id":"W2973363947","doi":"10.1103/physrevx.11.011023","title":"Fault-Tolerant Gates on Hypergraph Product Codes","year":2021,"lang":"en","type":"article","venue":"Physical Review X","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; National Research Council Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Hypergraph; Product (mathematics); Fault tolerance; Quantum; Overhead (engineering); Class (philosophy); Theoretical computer science; Discrete mathematics; Distributed computing; Mathematics; Physics; Quantum mechanics","score_opus":0.01309196206770562,"score_gpt":0.2817337348314733,"score_spread":0.26864177276376766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973363947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6498923,0.21975227,0.033170674,0.08418712,0.0018207122,0.0011762768,0.000019447485,0.001351336,0.008629874],"genre_scores_gemma":[0.97715515,0.0050931307,0.010728903,0.0062305694,0.00060604454,0.000025513978,0.000006520514,0.000018601964,0.00013555515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864167,0.00012748866,0.00016613628,0.00051705295,0.00029346824,0.00025417775],"domain_scores_gemma":[0.99893326,0.0001493957,0.00005725948,0.00067857426,0.00008836062,0.0000931248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013959961,0.00016655808,0.00035611397,0.000020668263,0.000102326085,0.00007499383,0.00048329748,0.000010242991,0.0000066711777],"category_scores_gemma":[0.00013752523,0.000117649375,0.0001931331,0.0005370925,0.000033064316,0.00006886836,0.00018604181,0.00021529128,0.00014512903],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003887886,0.00082992896,0.00004356761,0.0012496436,0.00006096231,0.00016026161,0.00029651125,0.0015530289,0.004274115,0.17434388,0.0031985675,0.81398565],"study_design_scores_gemma":[0.00057860644,0.00053540204,0.002771961,0.00994392,0.000094635594,0.00020686789,0.000007010161,0.6077328,0.054503426,0.1166253,0.20552604,0.0014740621],"about_ca_topic_score_codex":0.0000026277955,"about_ca_topic_score_gemma":4.6962475e-7,"teacher_disagreement_score":0.81251156,"about_ca_system_score_codex":0.000008427503,"about_ca_system_score_gemma":0.00004933226,"threshold_uncertainty_score":0.47976023},"labels":[],"label_agreement":null},{"id":"W2973746486","doi":"10.1145/3357713.3384269","title":"Computations with greater Quantum depth are strictly more powerful (relative to an oracle)","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Oracle; Quantum computer; Computation; Polynomial; Quantum; Quantum algorithm; Mathematics; Complexity class; Tree (set theory); Combinatorics; Discrete mathematics; Time complexity; Physics; Quantum mechanics; Computer science; Algorithm; Mathematical analysis","score_opus":0.02821327175174783,"score_gpt":0.2775630341383328,"score_spread":0.24934976238658496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973746486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10247004,0.000037790465,0.88326365,0.011263327,0.00046416844,0.000635335,0.00004714053,0.000980925,0.00083762535],"genre_scores_gemma":[0.61211526,0.0000013874562,0.3852046,0.0022754297,0.00019780376,0.000017594675,0.000042644915,0.000048122045,0.00009713613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963593,0.0001919612,0.00045533892,0.0017455484,0.0006772823,0.00057059486],"domain_scores_gemma":[0.99729717,0.0001297022,0.00033133663,0.0012831019,0.0003400834,0.000618582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013309372,0.00065870694,0.00065227854,0.00033813957,0.0002575325,0.0007057104,0.0021206597,0.00023114542,0.000018054672],"category_scores_gemma":[0.00003609731,0.0004946328,0.00015725901,0.0009148399,0.0000807299,0.00029295808,0.0024521651,0.0012232829,0.00013612123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070235,0.00035219363,0.002977103,0.0001757172,0.0004243513,0.000849826,0.025410352,0.8984635,0.000024517924,0.036259424,0.002948336,0.032044485],"study_design_scores_gemma":[0.0003144778,0.0005773555,0.029296773,0.00023782912,0.000032955428,0.000049302736,0.00024702263,0.95917165,0.00006837467,0.00861052,0.00055671984,0.00083702104],"about_ca_topic_score_codex":0.00019333382,"about_ca_topic_score_gemma":0.000068173715,"teacher_disagreement_score":0.5096452,"about_ca_system_score_codex":0.000079785015,"about_ca_system_score_gemma":0.00030312146,"threshold_uncertainty_score":0.99975055},"labels":[],"label_agreement":null},{"id":"W2974990958","doi":"10.1109/tit.2021.3063093","title":"Polarization of Quantum Channels Using Clifford-Based Channel Combining","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Qubit; Topology (electrical circuits); Quantum channel; Decoding methods; Quantum entanglement; Quantum capacity; Computer science; Quantum mechanics; Quantum; Mathematics; Physics; Algorithm; Quantum network; Combinatorics","score_opus":0.014365904557510625,"score_gpt":0.23517192678589288,"score_spread":0.22080602222838225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974990958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026408758,0.000014518654,0.971676,0.00017695273,0.0013126865,0.00010799955,0.000017103712,0.0001598356,0.0001261396],"genre_scores_gemma":[0.9832931,0.000002500926,0.01610739,0.0005277452,0.000023500123,0.0000055146265,0.000010057785,0.000008474077,0.000021685577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877506,0.0001485821,0.000431328,0.00015189392,0.00028629194,0.0002068105],"domain_scores_gemma":[0.998928,0.00017832857,0.0002220207,0.0003716601,0.00023501342,0.000064963504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004296178,0.00014509131,0.00017335064,0.00032583054,0.00030147587,0.00011895805,0.00028117734,0.00008601479,0.000019599564],"category_scores_gemma":[0.000017322376,0.00014572803,0.00011951875,0.0006920482,0.000046861114,0.0008522411,0.0000046506498,0.00021548272,0.000016065349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020385938,0.00008490062,0.0000011589567,0.000048109076,0.000021959446,0.000001373115,0.0016170657,0.9400395,0.000838715,0.027567094,0.0000051784214,0.029754564],"study_design_scores_gemma":[0.0004476865,0.00007826794,0.000013637887,0.00009370786,0.000010279419,0.000018058165,0.0001480846,0.9225481,0.069845885,0.0065883687,0.000061880564,0.00014600494],"about_ca_topic_score_codex":0.000009209624,"about_ca_topic_score_gemma":3.5424878e-7,"teacher_disagreement_score":0.9568844,"about_ca_system_score_codex":0.000034999222,"about_ca_system_score_gemma":0.00017312123,"threshold_uncertainty_score":0.59426165},"labels":[],"label_agreement":null},{"id":"W2975791266","doi":"10.1109/isit.2019.8849622","title":"Second-Order Characterizations via Partial Smoothing","year":2019,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Smoothing; Computer science; Information theory; Ball (mathematics); State (computer science); Theoretical computer science; Statistical physics; Mathematics; Algorithm; Mathematical analysis; Physics","score_opus":0.005680337253200725,"score_gpt":0.20979095828871475,"score_spread":0.20411062103551403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975791266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2173302,0.0000073662586,0.77566403,0.0010492104,0.0006950312,0.00008578442,7.752708e-7,0.0002678664,0.0048997146],"genre_scores_gemma":[0.91449195,6.340249e-7,0.081298,0.0015081476,0.00015276244,0.0000031657087,0.0000039293523,0.000009710155,0.002531686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916565,0.000028972716,0.00014214584,0.0002933704,0.00013802786,0.00023183865],"domain_scores_gemma":[0.9994044,0.000044394266,0.000045885565,0.00040040226,0.00004168283,0.000063291496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010826257,0.00009810206,0.000104098566,0.000059101843,0.00010332064,0.00016107582,0.00046627998,0.000038050195,0.0005464257],"category_scores_gemma":[0.0000073052393,0.00008107292,0.00004056058,0.00029035343,0.000011256367,0.00024882014,0.00021115792,0.00013257237,0.00046273213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000086114205,0.00032391495,0.006520611,0.00008985205,0.00010669495,0.00003972279,0.0066123568,0.018336928,0.085819215,0.30127454,0.0017832794,0.5790843],"study_design_scores_gemma":[0.00014610974,0.00003540545,0.003679677,0.000007745723,0.0000010391664,0.000017229193,0.000003401806,0.97135645,0.0018025502,0.00095831306,0.021837777,0.00015430532],"about_ca_topic_score_codex":0.000007358275,"about_ca_topic_score_gemma":0.000002066006,"teacher_disagreement_score":0.9530195,"about_ca_system_score_codex":0.000007298676,"about_ca_system_score_gemma":0.00003472801,"threshold_uncertainty_score":0.59829783},"labels":[],"label_agreement":null},{"id":"W2976208308","doi":"10.1038/s41534-020-0278-0","title":"Resource-efficient digital quantum simulation of d-level systems for photonic, vibrational, and spin-s Hamiltonians","year":2020,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Canadian Institute for Advanced Research; University of Toronto","funders":"","keywords":"Quantum; Hamiltonian (control theory); Quantum computer; Operator (biology); Quantum information; Exponential function; Hamming distance; Quantum algorithm; Qubit","score_opus":0.023757064336693067,"score_gpt":0.24332782442381018,"score_spread":0.21957076008711712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976208308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18281232,0.000090252695,0.8151511,0.0009333576,0.00017897355,0.00048002411,0.00009323229,0.00013652223,0.0001242029],"genre_scores_gemma":[0.99429524,0.0000063039815,0.0051918924,0.00030782804,0.000083684485,0.000017194563,0.00008514706,0.0000095677315,0.000003146647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843335,0.00002893314,0.00066279946,0.00023119652,0.00040180507,0.00024191912],"domain_scores_gemma":[0.9987767,0.0002513788,0.00039224897,0.0002451528,0.0002130215,0.000121540346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026331743,0.00018222957,0.00023961414,0.00014339175,0.00019949992,0.00044709112,0.00034520013,0.000087650034,0.0000011837834],"category_scores_gemma":[0.00019032112,0.00016603968,0.00008085019,0.0003301711,0.000050420105,0.0010605189,0.00014265472,0.00011787969,0.000012326219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042811498,0.000025399297,0.00004313818,0.0001820968,0.0000148064655,4.853848e-7,0.0036136876,0.9368589,0.00013180469,0.049158916,0.00020777031,0.0097202035],"study_design_scores_gemma":[0.0005202629,0.00028328368,0.0006197544,0.00005525162,0.000005984788,0.000010345259,0.00019041922,0.9863533,0.00017003786,0.0003936391,0.01120521,0.00019251644],"about_ca_topic_score_codex":0.000009197907,"about_ca_topic_score_gemma":1.9185909e-7,"teacher_disagreement_score":0.8114829,"about_ca_system_score_codex":0.000026763371,"about_ca_system_score_gemma":0.00008748422,"threshold_uncertainty_score":0.67709017},"labels":[],"label_agreement":null},{"id":"W2977049528","doi":"10.1038/s41567-020-01109-8","title":"Classical algorithms for quantum mean values","year":2021,"lang":"en","type":"article","venue":"Nature Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum algorithm; Quantum sort; Quantum; Quantum computer; Quantum phase estimation algorithm; Quantum process; Quantum network; Quantum error correction; Qubit; Quantum circuit","score_opus":0.016198577901152464,"score_gpt":0.2833122773944627,"score_spread":0.2671136994933102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977049528","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005864147,0.0007827503,0.98628306,0.004324044,0.0018775057,0.0001420761,0.000018141764,0.0003213926,0.0003868625],"genre_scores_gemma":[0.4405618,0.000017827513,0.55263054,0.0026793429,0.003409843,0.00002249105,0.000046010955,0.000048479465,0.0005836453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983427,0.00006685162,0.0001810956,0.00062006694,0.0003750079,0.00041428578],"domain_scores_gemma":[0.99859,0.00029264574,0.000076999415,0.0006488245,0.0002739906,0.00011754593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016975573,0.0002134261,0.00025739596,0.000029800174,0.00024168761,0.0002095013,0.0007132203,0.00021243958,0.0000018813816],"category_scores_gemma":[0.00007610996,0.00018415217,0.00023163574,0.00049622194,0.00004699241,0.00016784175,0.0002983649,0.00074118574,0.000012666112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006242798,0.00023584912,0.000018111952,0.000046306064,0.00006662426,0.00005225103,0.0008120321,0.0016305308,0.0016869777,0.63426524,0.01044175,0.3507381],"study_design_scores_gemma":[0.00032121444,0.000067010515,0.000117439486,0.000026887841,0.000010577253,0.00002560051,0.000013615036,0.7519186,0.010186174,0.21630213,0.020768605,0.00024214188],"about_ca_topic_score_codex":0.0000013941907,"about_ca_topic_score_gemma":0.0000011823455,"teacher_disagreement_score":0.75028807,"about_ca_system_score_codex":0.00002780987,"about_ca_system_score_gemma":0.00015669661,"threshold_uncertainty_score":0.7509508},"labels":[],"label_agreement":null},{"id":"W2978019533","doi":"10.22331/q-2020-06-29-287","title":"Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Quantum walk; Quantum algorithm; Quantum computer; Heuristic; Quantum; Quantum phase estimation algorithm; Quantum circuit; Quantum sort","score_opus":0.021485017672962962,"score_gpt":0.24816726118140514,"score_spread":0.22668224350844218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978019533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03803835,0.00038951472,0.95236146,0.006525845,0.0012230534,0.00046384332,0.000045121087,0.0007736739,0.00017911132],"genre_scores_gemma":[0.8574042,0.00000496134,0.13884965,0.0025941094,0.001021868,0.000026247351,0.000015104784,0.00005177674,0.000032096366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968532,0.00009241577,0.0005220295,0.001050331,0.0005577649,0.00092430844],"domain_scores_gemma":[0.9981214,0.00036754826,0.00023271817,0.0006152423,0.00019084016,0.00047228235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041774687,0.00040538775,0.00048433695,0.00015680154,0.00043926135,0.000298115,0.0015619567,0.00012181594,0.000017489796],"category_scores_gemma":[0.00029095978,0.00036382166,0.00030244162,0.0009170054,0.000092557755,0.000105620085,0.00033587878,0.00038095808,0.00011747294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021239233,0.00026833816,0.00007223181,0.0002219564,0.00012555147,0.000109277076,0.0042760554,0.044174116,0.0017034753,0.16770831,0.0066088275,0.77471066],"study_design_scores_gemma":[0.00069841836,0.00052159233,0.00023546828,0.000038110647,0.000016657268,0.000034683453,0.000068622634,0.9831479,0.0006931196,0.005797307,0.008264466,0.00048361483],"about_ca_topic_score_codex":0.000049998416,"about_ca_topic_score_gemma":8.4849347e-7,"teacher_disagreement_score":0.93897384,"about_ca_system_score_codex":0.000042377,"about_ca_system_score_gemma":0.00013689799,"threshold_uncertainty_score":0.9998814},"labels":[],"label_agreement":null},{"id":"W2978124974","doi":"10.1109/icdis.2019.00039","title":"A Survey on the Impacts of Quantum Computers on Information Security","year":2019,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Computer science; Quantum computer; Quantum information; Quantum entanglement; Information security; Qubit; NIST; Quantum; Theoretical computer science; Computer security; Quantum cryptography; Quantum mechanics; Physics","score_opus":0.010184771586990498,"score_gpt":0.22675685291768963,"score_spread":0.21657208133069913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978124974","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91866213,0.0000040717423,0.076839276,0.0017144845,0.00057798746,0.00021310858,0.000008208737,0.00009724462,0.0018834914],"genre_scores_gemma":[0.997574,0.00000115644,0.0008218453,0.0015670524,0.00001782229,7.247892e-7,0.0000047253875,0.0000029894504,0.000009717641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989742,0.00015110959,0.00020902292,0.0001502779,0.00032272033,0.0001926604],"domain_scores_gemma":[0.9984486,0.0007304554,0.00012996032,0.0005701094,0.00007118949,0.000049694314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007288108,0.00011669739,0.00013940525,0.000093752606,0.00006485226,0.000106479725,0.00071524555,0.000036931386,0.00001228226],"category_scores_gemma":[0.00006912441,0.000065753695,0.000059451235,0.00032252475,0.000023639166,0.00019779877,0.00016862,0.00018656203,0.00018096999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069045534,0.00025556795,0.006206496,0.000065197666,0.000060396575,0.0000021875428,0.006886562,0.039610256,0.00008398265,0.88120306,0.019622602,0.045934655],"study_design_scores_gemma":[0.0001748349,0.00036616425,0.08011066,0.00004145792,5.1882125e-7,0.0000015642436,0.000013202741,0.9167005,0.00048376905,0.0016279547,0.00038636758,0.0000930237],"about_ca_topic_score_codex":0.00035584703,"about_ca_topic_score_gemma":0.000010134859,"teacher_disagreement_score":0.8795751,"about_ca_system_score_codex":0.000014392337,"about_ca_system_score_gemma":0.000040230036,"threshold_uncertainty_score":0.2681358},"labels":[],"label_agreement":null},{"id":"W2978128916","doi":"10.1088/2058-9565/ab657a","title":"Machine learning design of a trapped-ion quantum spin simulator","year":2019,"lang":"en","type":"preprint","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Government of Canada; Canada First Research Excellence Fund; Ministero dello Sviluppo Economico; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada","keywords":"Spins; Ion; Computer science; Workstation; Spin (aerodynamics); Laser; Quantum; Coupling (piping); Quantum simulator; Graph; Quantum computer; Physics; Quantum mechanics; Theoretical computer science; Mechanical engineering; Engineering; Condensed matter physics","score_opus":0.016063342780326475,"score_gpt":0.2594197347541207,"score_spread":0.24335639197379424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978128916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36878273,0.0021057185,0.624588,0.0020996921,0.0011059865,0.00058687374,0.0000066728057,0.0006832877,0.00004104421],"genre_scores_gemma":[0.975317,0.00024729967,0.024260452,0.00006210538,0.000047746464,0.000015269254,0.0000023479674,0.000023744991,0.000024031446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960031,0.00012928115,0.0006115191,0.0015930833,0.00083836075,0.00082468375],"domain_scores_gemma":[0.99720436,0.00022354281,0.00059417135,0.0013933012,0.00044098037,0.000143626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020399767,0.0004708836,0.0007810618,0.0017728637,0.00042167748,0.00022901819,0.0033949993,0.00054663286,0.0000034773793],"category_scores_gemma":[0.0005402072,0.00040558068,0.000096592186,0.0025081944,0.0013566344,0.00023524731,0.003872272,0.0016509107,0.000016309621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000458494,0.0003673879,0.003114455,0.000640291,0.000096634234,0.00010931853,0.001725024,0.28977895,0.06458245,0.47570953,0.0000952318,0.16373487],"study_design_scores_gemma":[0.0002808666,0.00065560703,0.00017039887,0.00022597885,0.000012362795,0.00006618147,0.000041260733,0.9325587,0.006627557,0.058440853,0.00049386016,0.0004263582],"about_ca_topic_score_codex":0.00007578852,"about_ca_topic_score_gemma":0.0000012430634,"teacher_disagreement_score":0.64277977,"about_ca_system_score_codex":0.00006666383,"about_ca_system_score_gemma":0.00095895724,"threshold_uncertainty_score":0.9998396},"labels":[],"label_agreement":null},{"id":"W2978518535","doi":"10.2139/ssrn.3333537","title":"Portfolio Asset Identification Using Graph Algorithms on a Quantum Annealer","year":2018,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; Fleming College; University of Toronto","funders":"","keywords":"Quantum annealing; Algorithm; Computer science; Quantum computer; Portfolio; Quantum algorithm; Curse of dimensionality; Finance; Quantum; Speedup; Graph; Theoretical computer science; Artificial intelligence; Parallel computing; Economics","score_opus":0.013673393501155477,"score_gpt":0.26855483085034654,"score_spread":0.25488143734919105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978518535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29549688,0.00032984695,0.70227325,0.0005487845,0.0010146094,0.000085249834,0.0000015483681,0.00011377246,0.00013603497],"genre_scores_gemma":[0.9905714,0.00016586398,0.007460957,0.00026605968,0.0012942519,0.0000019636793,0.0000024774038,0.000027438049,0.00020959954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600637,0.00015316899,0.0004314227,0.00049305643,0.0005399223,0.0023760805],"domain_scores_gemma":[0.99871546,0.0000478158,0.00034404005,0.00052958063,0.00021906989,0.00014400724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023041235,0.0002414082,0.00020861518,0.0003892201,0.00080471556,0.00037698084,0.0010846112,0.000092483686,0.000009294516],"category_scores_gemma":[0.000044473156,0.00020574973,0.00016333167,0.0007648254,0.00009338766,0.00036889774,0.00013676267,0.0015122248,0.000065438224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005540492,0.00035863696,0.00038649037,0.000009672024,0.00029381434,0.00005670792,0.0009201896,0.004206325,0.0037693859,0.62767893,0.0009863074,0.36127815],"study_design_scores_gemma":[0.0003942344,0.00076063705,0.0013301122,0.0000424922,0.000016281834,0.0016918319,0.00009793265,0.638934,0.00060679694,0.3549166,0.00088222866,0.0003268329],"about_ca_topic_score_codex":0.000049301983,"about_ca_topic_score_gemma":0.000028964801,"teacher_disagreement_score":0.6950745,"about_ca_system_score_codex":0.00034839334,"about_ca_system_score_gemma":0.001040642,"threshold_uncertainty_score":0.83902305},"labels":[],"label_agreement":null},{"id":"W2978899725","doi":"10.22331/q-2020-08-31-314","title":"Stochastic gradient descent for hybrid quantum-classical optimization","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":206,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Freie Universität Berlin; Deutsche Forschungsgemeinschaft; European Commission; Alexander von Humboldt-Stiftung; John Templeton Foundation","keywords":"Stochastic gradient descent; Convergence (economics); Gradient descent; Benchmark (surveying); Parameterized complexity; Context (archaeology); Quantum; Stochastic optimization; Range (aeronautics)","score_opus":0.02167426729585881,"score_gpt":0.2375129160911009,"score_spread":0.2158386487952421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978899725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016189437,0.00012027167,0.9707455,0.011296917,0.00077129423,0.0004055516,0.000013821781,0.00043751785,0.000019662282],"genre_scores_gemma":[0.89106476,0.0000045236093,0.10706558,0.0013357069,0.00043630536,0.000032196258,0.00001763673,0.000030120165,0.000013199264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980934,0.00006462441,0.00034010244,0.0006716497,0.00032091019,0.00050929736],"domain_scores_gemma":[0.9988775,0.00019242382,0.00012957185,0.00037610473,0.00009969026,0.0003246866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018032565,0.00024533382,0.00027989587,0.00007365068,0.0002599959,0.00019247708,0.00080752297,0.00005043831,0.000007966848],"category_scores_gemma":[0.00018285857,0.00021714684,0.00016455626,0.00032621762,0.000056525565,0.0001560486,0.00023630395,0.00021729665,0.000034895387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040523108,0.00013551324,0.000008214221,0.000055617733,0.000028344903,0.000024017763,0.0007696184,0.86413485,0.00020224533,0.112496495,0.004803185,0.017301355],"study_design_scores_gemma":[0.0005366685,0.0005161062,0.000037103157,0.000032104726,0.000011919876,0.000025962634,0.00001377435,0.99124974,0.00020900101,0.0046567335,0.0024219565,0.000288925],"about_ca_topic_score_codex":0.0000041435333,"about_ca_topic_score_gemma":3.3920963e-7,"teacher_disagreement_score":0.8748753,"about_ca_system_score_codex":0.000040170868,"about_ca_system_score_gemma":0.00008879081,"threshold_uncertainty_score":0.8854991},"labels":[],"label_agreement":null},{"id":"W2979387342","doi":"10.1007/978-3-030-64381-2_4","title":"Quantum Encryption with Certified Deletion","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Plaintext; Encryption; Ciphertext; Quantum; Quantum cryptography; String (physics); Cryptography; Quantum computer","score_opus":0.015861750209509886,"score_gpt":0.22296787470290835,"score_spread":0.20710612449339846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979387342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040522657,0.00020760391,0.99352974,0.0028391448,0.0011312003,0.00037672318,0.0000028311538,0.00042493222,0.0010825715],"genre_scores_gemma":[0.42850128,0.000027741948,0.5679544,0.0023271504,0.000995103,0.0000098347255,0.000013133329,0.000069843336,0.00010152413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954977,0.000048608792,0.0005144532,0.002000177,0.0012384817,0.0007005811],"domain_scores_gemma":[0.99763906,0.00028226228,0.00034790154,0.0012266723,0.00023134012,0.00027276596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051660324,0.00066527375,0.0005896983,0.000645491,0.00035761914,0.00063647877,0.0028468275,0.00029943627,0.000012249996],"category_scores_gemma":[0.000053194377,0.0005335803,0.00013566685,0.0008754324,0.0005397501,0.000428997,0.0010126964,0.0012436751,0.000074278476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021832511,0.000030167565,0.00001947539,0.000050630704,0.000018698232,0.0002533029,0.0010178013,0.15166713,0.00034731018,0.050316036,0.000029035644,0.7962286],"study_design_scores_gemma":[0.00027504284,0.00043479586,0.000088067856,0.0003649879,0.000008349021,0.00014544903,1.3360594e-7,0.8830228,0.0005846165,0.11333202,0.0010671037,0.0006766192],"about_ca_topic_score_codex":0.000017808281,"about_ca_topic_score_gemma":0.00002787997,"teacher_disagreement_score":0.79555196,"about_ca_system_score_codex":0.00020609293,"about_ca_system_score_gemma":0.00054153666,"threshold_uncertainty_score":0.9997116},"labels":[],"label_agreement":null},{"id":"W2979840408","doi":"10.1145/3352460.3358287","title":"A Case for Multi-Programming Quantum Computers","year":2019,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Quantum computer; Qubit; Reliability (semiconductor); Throughput; Parallel computing; Computer engineering; Theoretical computer science; Quantum; Operating system","score_opus":0.027688443652532025,"score_gpt":0.27257368205112925,"score_spread":0.24488523839859722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979840408","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116392225,0.00002800559,0.88140047,0.00036962275,0.00095127727,0.00039026188,0.0000014458539,0.00040408203,0.00006264019],"genre_scores_gemma":[0.38446912,2.8042584e-7,0.6149726,0.00030835796,0.00005643923,0.000009073868,0.0000011397515,0.000009141502,0.00017387979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998799,0.000027586228,0.00018906881,0.0004660089,0.00012076776,0.00039754267],"domain_scores_gemma":[0.99912024,0.00017590237,0.000061149454,0.000479226,0.000057828205,0.000105677194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002351561,0.00015484281,0.00017556305,0.00008779239,0.00015054885,0.00022078624,0.00056783826,0.00004806024,0.0000056222902],"category_scores_gemma":[0.0000141018945,0.00012526261,0.00012576787,0.00022253224,0.000019488984,0.0001478877,0.00025795016,0.00011396622,0.00005800529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000084748945,0.00020017741,0.0003429188,0.000111349895,0.000053081694,0.0007062181,0.001682495,0.00858549,0.00028968646,0.13867648,0.0010412912,0.8483023],"study_design_scores_gemma":[0.0006505246,0.00016555582,0.000042813735,0.000015159804,0.0000024935891,0.0013694939,0.00003904972,0.98910314,0.000108416294,0.00042387308,0.00787319,0.0002063101],"about_ca_topic_score_codex":0.000046350193,"about_ca_topic_score_gemma":0.000006181787,"teacher_disagreement_score":0.9805176,"about_ca_system_score_codex":0.0000149755015,"about_ca_system_score_gemma":0.000030549698,"threshold_uncertainty_score":0.5108061},"labels":[],"label_agreement":null},{"id":"W2979929440","doi":"10.4230/lipics.tqc.2020.4","title":"Uncloneable Quantum Encryption via Oracles","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Encryption; Computer science; Pseudorandom function family; Theoretical computer science; Quantum cryptography; Random oracle; Quantum; Probabilistic encryption; Cryptography; Quantum information; Computer security; Public-key cryptography; Physics; Quantum mechanics","score_opus":0.013423494992439852,"score_gpt":0.2472337597318089,"score_spread":0.23381026473936903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979929440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10442712,0.00020632902,0.8838455,0.0006852809,0.0063355453,0.0019481209,0.0004481228,0.00084008713,0.0012639152],"genre_scores_gemma":[0.75103396,0.00014548085,0.24317424,0.0017886114,0.0010799252,0.0002591993,0.0016906211,0.00018658549,0.00064137805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947383,0.000107609114,0.0018129038,0.00093084626,0.0010379357,0.0013724],"domain_scores_gemma":[0.9949565,0.00027087613,0.0013314126,0.0026010189,0.0005089719,0.00033120054],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011136322,0.0010353402,0.0011371847,0.000593916,0.00053311285,0.0014877087,0.0037877636,0.00087512063,0.000022204566],"category_scores_gemma":[0.00009035914,0.00093202374,0.0007243499,0.00043503696,0.00013839608,0.001124399,0.004313226,0.0019876363,0.000527813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042556057,0.0026629106,0.0047150156,0.018093806,0.0022342973,0.00009797471,0.054631703,0.43177506,0.0005122428,0.098614,0.051125266,0.33511215],"study_design_scores_gemma":[0.0012777058,0.00026333774,0.0003294628,0.00061769877,0.00004628048,0.00008632287,0.00012524491,0.94475937,0.00032027697,0.015593045,0.03545635,0.0011249318],"about_ca_topic_score_codex":0.00008200818,"about_ca_topic_score_gemma":0.000009040711,"teacher_disagreement_score":0.64660686,"about_ca_system_score_codex":0.0002486873,"about_ca_system_score_gemma":0.00035703724,"threshold_uncertainty_score":0.99954885},"labels":[],"label_agreement":null},{"id":"W2980364240","doi":"10.1007/jhep09(2019)121","title":"Erratum to: On the Noether charge and the gravity duals of quantum complexity","year":2019,"lang":"en","type":"erratum","venue":"Journal of High Energy Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Noether's theorem; Physics; Dual polyhedron; Mistake; Theoretical physics; Charge (physics); Mathematical physics; Quantum; State (computer science); Quantum gravity; Quantum mechanics; Pure mathematics; Law; Lagrangian; Algorithm; Computer science; Mathematics; Political science","score_opus":0.01802881897449823,"score_gpt":0.238251821208343,"score_spread":0.22022300223384478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980364240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043021012,0.004693834,0.6892353,0.09009081,0.15958844,0.0011329276,0.00019550107,0.00015399298,0.011888166],"genre_scores_gemma":[0.96152955,0.00059690373,0.0045249052,0.0066478266,0.009554622,0.000009067206,0.000016249185,0.00012543255,0.016995417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971922,0.0005194676,0.0006514988,0.00034426124,0.0009466615,0.0003459289],"domain_scores_gemma":[0.9963912,0.0007206947,0.001435142,0.0009871878,0.00035166752,0.00011411425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010569933,0.0004031581,0.0009978608,0.00010658409,0.00023713688,0.00017871308,0.0021252662,0.00017841387,0.0000051690204],"category_scores_gemma":[0.000076211436,0.00019361606,0.0004033781,0.00041548276,0.00033423383,0.0001030076,0.0005710042,0.0014986804,0.000006048733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004012282,0.00007732886,0.0000011242485,0.000024670306,0.00012532625,0.000006454799,0.0004185317,0.0011725854,0.000008961718,0.7257124,0.26993173,0.002480754],"study_design_scores_gemma":[0.001001279,0.0007216883,0.00035219095,0.0006658397,0.00007838347,0.00007311101,0.000020621519,0.08869442,0.0003839707,0.8146982,0.09286237,0.0004479065],"about_ca_topic_score_codex":0.00015623897,"about_ca_topic_score_gemma":0.00000601864,"teacher_disagreement_score":0.9185086,"about_ca_system_score_codex":0.00003193633,"about_ca_system_score_gemma":0.0002466101,"threshold_uncertainty_score":0.7895434},"labels":[],"label_agreement":null},{"id":"W2980809717","doi":"10.1103/physrevresearch.3.033285","title":"Independent state and measurement characterization for quantum computers","year":2021,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Canada First Research Excellence Fund; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Government of Ontario","keywords":"Qubit; Ambiguity; Quantum error correction; Protocol (science); State (computer science); Quantum gate; Quantum computer; Quantum; Characterization (materials science); Uncorrelated","score_opus":0.08731672390703371,"score_gpt":0.3760968924352457,"score_spread":0.288780168528212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980809717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080230184,0.0122995945,0.8944932,0.011502638,0.00027999774,0.0010249373,0.000012317679,0.00007870243,0.000078415826],"genre_scores_gemma":[0.96824473,0.012201556,0.016679114,0.0018520225,0.00055647816,0.00022650682,0.000036959304,0.00003981911,0.00016283433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755895,0.00036035714,0.00019779062,0.00050564785,0.0009764071,0.00040085716],"domain_scores_gemma":[0.9984023,0.00028310684,0.00005091861,0.00040288112,0.0007062234,0.00015459149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001613887,0.00011835794,0.0002709635,0.000054073997,0.00021220048,0.00020547085,0.00041238693,0.000015067328,0.0000023818461],"category_scores_gemma":[0.00029861816,0.000096770535,0.00008353544,0.0005049913,0.000050012295,0.00012770873,0.0005100569,0.00028132004,0.000019767176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006930987,0.00031240535,0.000032508142,0.0022479484,0.000044950815,0.000029195031,0.00046776372,0.000052798467,0.036489833,0.0402833,0.0010413602,0.918991],"study_design_scores_gemma":[0.00038937986,0.00024103743,0.0044076242,0.0020030711,0.000009535604,0.00002230276,0.000004378194,0.9220534,0.0038232633,0.027664289,0.03911724,0.00026445286],"about_ca_topic_score_codex":0.000004019031,"about_ca_topic_score_gemma":0.0000012076229,"teacher_disagreement_score":0.92200065,"about_ca_system_score_codex":0.000047119476,"about_ca_system_score_gemma":0.00016826266,"threshold_uncertainty_score":0.39461878},"labels":[],"label_agreement":null},{"id":"W2980835754","doi":"10.1103/physrevlett.125.260505","title":"Obstacles to Variational Quantum Optimization from Symmetry Protection","year":2020,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":283,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Institute for Quantum Information and Matter, California Institute of Technology; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Conjecture; Symmetry (geometry); Quantum; Locality; Ising model; Physics; Topology (electrical circuits); Mathematics; Quantum mechanics; Theoretical physics; Combinatorics; Geometry","score_opus":0.01941405164572249,"score_gpt":0.2522649859887701,"score_spread":0.23285093434304763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980835754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01732378,0.0004214861,0.87403256,0.10760983,0.00013319837,0.0003006838,0.00000500496,0.00016387585,0.0000095575215],"genre_scores_gemma":[0.5326056,0.0001555535,0.29204518,0.17351592,0.0015449891,0.00007531824,0.000027948503,0.000028310875,0.0000012303592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987954,0.000106571584,0.00018548463,0.000426599,0.000311771,0.0001741693],"domain_scores_gemma":[0.9993999,0.00009339519,0.000084427855,0.00023287967,0.00003679784,0.00015262773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008042769,0.00014033119,0.00022686594,0.00002610216,0.00008560652,0.00008667005,0.0004470624,0.00000840845,0.000008547402],"category_scores_gemma":[0.00013522328,0.000119819255,0.00010253535,0.0005896295,0.000011959268,0.00016357697,0.00016001514,0.00017167581,0.00011228784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102208805,0.00013685046,0.000021252567,0.00042599335,0.000061840445,0.000014009917,0.0013630888,0.87009734,0.01728945,0.0141801555,0.007036139,0.08936368],"study_design_scores_gemma":[0.00007425672,0.000048508908,0.00027044225,0.0002505399,0.000010506852,9.1400307e-7,9.436919e-7,0.9960703,0.00016124907,0.00050088175,0.002456388,0.00015505427],"about_ca_topic_score_codex":0.000018944034,"about_ca_topic_score_gemma":8.7655536e-8,"teacher_disagreement_score":0.5819874,"about_ca_system_score_codex":0.000022718265,"about_ca_system_score_gemma":0.000018882858,"threshold_uncertainty_score":0.48860875},"labels":[],"label_agreement":null},{"id":"W2980995059","doi":"10.26421/qic21.5-6-1","title":"Pretty good state transfer of multiple qubit states on paths","year":2021,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"State (computer science); Qubit; Transfer (computing); Eigenvalues and eigenvectors; Physics; Topology (electrical circuits); Computer science; Mathematics; Quantum mechanics; Algorithm; Quantum; Combinatorics","score_opus":0.010342917048554728,"score_gpt":0.23149070409132935,"score_spread":0.22114778704277463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980995059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4254103,0.00008407915,0.57334524,0.00023887894,0.00040771172,0.00025743953,0.000044552413,0.00012735187,0.00008446082],"genre_scores_gemma":[0.9836817,0.00011458675,0.015381274,0.0003407089,0.00002934817,0.000018496827,0.00041704933,0.000011178085,0.0000056974427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979344,0.00015532163,0.00081322016,0.00035516874,0.00049449503,0.00024740378],"domain_scores_gemma":[0.9986363,0.00022502591,0.0003433923,0.00036969018,0.0003226406,0.00010295693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037649876,0.0003151246,0.0003943094,0.00029255587,0.00013837888,0.00049615133,0.0003823225,0.00015701888,0.0000026150512],"category_scores_gemma":[0.00003646454,0.00029407273,0.00012988223,0.00025998792,0.000051272404,0.000632053,0.0003426439,0.00048563883,0.000007152901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032017117,0.00009900909,0.0001235711,0.0005990812,0.000058443024,0.0000039019333,0.015840255,0.6317551,0.000038288814,0.0068061478,0.00008155378,0.34456262],"study_design_scores_gemma":[0.0005893542,0.00021667301,0.003886872,0.00030013206,0.000009748626,0.000009305589,0.00019827885,0.9864187,0.00063068065,0.0070901155,0.00033714308,0.0003129869],"about_ca_topic_score_codex":0.000099193785,"about_ca_topic_score_gemma":0.0000070988954,"teacher_disagreement_score":0.55827135,"about_ca_system_score_codex":0.000034416928,"about_ca_system_score_gemma":0.00017323374,"threshold_uncertainty_score":0.9999511},"labels":[],"label_agreement":null},{"id":"W2981652294","doi":"10.1017/9781009283403.017","title":"Quantum Error-Correcting Codes","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Content (measure theory); Quantum; Theoretical computer science; Algorithm; Mathematics; Physics; Quantum mechanics","score_opus":0.0193405857451683,"score_gpt":0.21018718772584985,"score_spread":0.19084660198068154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981652294","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023184283,0.00042224044,0.046422716,0.0000847126,0.0020305759,0.0002388978,0.00007861455,0.0010818625,0.94940853],"genre_scores_gemma":[0.0019756893,0.000028246177,0.0023639156,0.00007987788,0.00036144842,3.8899356e-7,0.000012573898,0.000062033614,0.9951158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99782526,0.000038921768,0.0002436921,0.0010420342,0.00038853838,0.00046151938],"domain_scores_gemma":[0.99836254,0.00015919971,0.0002076052,0.0009384754,0.00012206751,0.00021009854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017473118,0.0005296931,0.00048443844,0.0003348992,0.0003472354,0.0002885792,0.0017030964,0.00034364325,0.0000015364523],"category_scores_gemma":[0.000009222089,0.00056847447,0.00036085022,0.000028796723,0.0001650814,0.00011240031,0.0017133891,0.0011421094,0.000068885114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007269476,0.0000052021974,2.5795737e-7,0.00012203257,0.000110844274,0.00095048617,0.00014589728,0.00013122048,0.000015493832,0.9713086,0.012895804,0.014306932],"study_design_scores_gemma":[0.00017743223,0.000071818984,0.000002160808,0.00053607486,0.000093448514,0.00018438906,0.000022072667,0.1846738,0.00014666076,0.000547008,0.81284475,0.0007004087],"about_ca_topic_score_codex":0.000116749354,"about_ca_topic_score_gemma":0.0000024012054,"teacher_disagreement_score":0.97076154,"about_ca_system_score_codex":0.00014912678,"about_ca_system_score_gemma":0.00015207891,"threshold_uncertainty_score":0.99967664},"labels":[],"label_agreement":null},{"id":"W2981894857","doi":"10.1038/s41598-020-71654-y","title":"On speeding up factoring with quantum SAT solvers","year":2020,"lang":"en","type":"preprint","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Speedup; Factorization; Factoring; Computer science; Integer factorization; Quantum; Quantum sort; Quantum algorithm; Quantum computer; Quantum phase estimation algorithm; Parallel computing; Multiplication (music); Prime factor; Algorithm; Arithmetic; Mathematics; Prime (order theory); Combinatorics; Quantum mechanics; Quantum simulator; Physics","score_opus":0.027933929258223727,"score_gpt":0.25204569047052583,"score_spread":0.2241117612123021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981894857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5664651,0.00014584207,0.34039876,0.0024226906,0.08682755,0.00075542415,0.0000060231228,0.0013937452,0.0015848726],"genre_scores_gemma":[0.9776079,0.0000020578243,0.021058675,0.00013300368,0.00044400708,0.0000121691755,0.00004111593,0.00004622673,0.0006548576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940323,0.00006133529,0.00064743985,0.0029792995,0.0015637109,0.0007158883],"domain_scores_gemma":[0.9960513,0.00011080009,0.00078172423,0.0024891137,0.00018853229,0.00037849645],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010702092,0.00054821844,0.000543261,0.00037857966,0.0006404983,0.002646392,0.001446857,0.0001893511,0.000016654836],"category_scores_gemma":[0.00016354724,0.0004321357,0.00025469932,0.00077628106,0.00020131006,0.00020058721,0.0023082208,0.0012645648,0.00005728669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116566414,0.0005845411,0.0036374629,0.0017076916,0.00084578205,0.0327532,0.055953912,0.64069176,0.015894504,0.03939466,0.110433124,0.0979868],"study_design_scores_gemma":[0.0002904473,0.00027583365,0.00063312677,0.0014841608,0.000044399414,0.00065638183,0.00008829357,0.79656,0.00804915,0.16148067,0.028748719,0.00168881],"about_ca_topic_score_codex":0.000038295606,"about_ca_topic_score_gemma":0.0000028635693,"teacher_disagreement_score":0.4111428,"about_ca_system_score_codex":0.00013034754,"about_ca_system_score_gemma":0.0005628899,"threshold_uncertainty_score":0.999813},"labels":[],"label_agreement":null},{"id":"W2981993210","doi":"10.4086/toc.2019.v015a005","title":"","year":2019,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"PSPACE; Mathematics; Discrete mathematics; Hamiltonian (control theory); Connection (principal bundle); Quantum computer; Hamiltonian path; Combinatorics; Quantum; Computer science; Computational complexity theory; Quantum mechanics; Physics; Graph; Algorithm","score_opus":0.006912052154871736,"score_gpt":0.2191981759038802,"score_spread":0.21228612374900846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981993210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52540636,0.0000720271,0.47326076,0.00015541307,0.00038273496,0.00014694908,3.2840407e-7,0.00027407738,0.00030136268],"genre_scores_gemma":[0.8776354,9.5216365e-7,0.12190748,0.00031518383,0.00009587883,5.74133e-7,6.536499e-7,0.000016526465,0.000027353863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687976,0.00051369565,0.0006822733,0.0007174657,0.00052319426,0.0006836027],"domain_scores_gemma":[0.9963283,0.0015762772,0.00046769023,0.001335346,0.00015354255,0.00013886268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002831849,0.00030676415,0.0005725811,0.00025697207,0.00020571976,0.0001131972,0.0026838318,0.00007632651,0.000005903553],"category_scores_gemma":[0.00009027054,0.00027322068,0.00022793701,0.00079264666,0.00011560264,0.00035497927,0.0013930588,0.00036479125,0.000016331078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028933353,0.000097049815,0.0052355975,0.00008383758,0.00004935233,0.000009845543,0.009390108,0.15901835,0.00959094,0.57952213,0.0000033031513,0.23697054],"study_design_scores_gemma":[0.00080448325,0.00032149733,0.02222017,0.00018767912,0.000005057954,0.00007614139,0.00018294083,0.85543114,0.0102192275,0.110172704,0.000029874642,0.00034906063],"about_ca_topic_score_codex":0.000010733843,"about_ca_topic_score_gemma":2.6321902e-7,"teacher_disagreement_score":0.6964128,"about_ca_system_score_codex":0.000020217318,"about_ca_system_score_gemma":0.000072822935,"threshold_uncertainty_score":0.999972},"labels":[],"label_agreement":null},{"id":"W2982115751","doi":"10.1063/1.5110682","title":"Exact and approximate symmetry projectors for the electronic structure problem on a quantum computer","year":2019,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Ansatz; Wave function; Eigenvalues and eigenvectors; Subspace topology; Quantum; Homogeneous space; Electronic structure; Symmetry (geometry); Quantum computer","score_opus":0.0064687687869991375,"score_gpt":0.2213215005151321,"score_spread":0.21485273172813296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982115751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7534355,0.00017011048,0.24408366,0.0017228182,0.00022108023,0.00032598426,0.0000023944508,0.00002178116,0.000016668202],"genre_scores_gemma":[0.99274236,0.000011492189,0.0062265615,0.00043006937,0.00056884624,0.0000011767628,4.5825846e-7,0.000013316792,0.0000057325014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898565,0.000056950288,0.00022342028,0.00015273219,0.00028234356,0.0002988936],"domain_scores_gemma":[0.99862075,0.0006691842,0.00027263458,0.00030845212,0.00008240917,0.000046564448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038816375,0.00015982392,0.00022188983,0.000023838937,0.00009310692,0.0000932142,0.0008618792,0.000043119082,7.506765e-7],"category_scores_gemma":[0.000011136497,0.00007258624,0.00010982391,0.00019030884,0.000060036797,0.000100562,0.00015956518,0.00060055894,9.3602085e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069211907,0.0005564663,0.00022739753,0.0005901616,0.0009453188,0.0000063908747,0.008280553,0.06486039,0.14780548,0.37554368,0.0073267748,0.39316526],"study_design_scores_gemma":[0.0005353363,0.00052267103,0.00006011706,0.000074187265,0.000030604646,0.00010792235,0.000014322787,0.8622136,0.01944406,0.11624957,0.00060796103,0.00013962081],"about_ca_topic_score_codex":0.0000015827025,"about_ca_topic_score_gemma":5.0476807e-8,"teacher_disagreement_score":0.79735327,"about_ca_system_score_codex":0.000028670958,"about_ca_system_score_gemma":0.0000697812,"threshold_uncertainty_score":0.2959981},"labels":[],"label_agreement":null},{"id":"W2982483590","doi":"10.1103/physreva.101.032324","title":"Mediator-assisted cooling in quantum annealing","year":2020,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; Consejo Superior de Investigaciones Científicas; Ministerio de Ciencia, Innovación y Universidades; Federación Española de Enfermedades Raras; Canadian Institute of Steel Construction","keywords":"Quantum annealing; Qubit; Redundancy (engineering); Subspace topology; Quantum; Coherence (philosophical gambling strategy); Simulated annealing; Computer science; Quantum mechanics; Physics; Statistical physics; Quantum computer; Algorithm; Artificial intelligence","score_opus":0.023774436451566083,"score_gpt":0.3397518547528731,"score_spread":0.31597741830130704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982483590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5147332,0.29896992,0.12507111,0.05497456,0.0007002484,0.0033358643,0.00003210391,0.0012692887,0.00091369374],"genre_scores_gemma":[0.9288489,0.04771067,0.0032173141,0.018608786,0.0014020955,0.00012465008,0.000019188472,0.00006452549,0.000003826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954438,0.0005601548,0.0009296895,0.001260325,0.00094987126,0.00085611903],"domain_scores_gemma":[0.99710697,0.00073970546,0.0004089628,0.0009511602,0.00014810491,0.00064506795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006311408,0.00059835176,0.0019223286,0.0000607797,0.00014474202,0.00010873332,0.0018279237,0.00004682869,0.000008688597],"category_scores_gemma":[0.0014002637,0.0004696099,0.00076008186,0.0023940643,0.00010091217,0.00034089235,0.0007091091,0.0010540532,0.00039096136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047132708,0.0023948592,0.0005004797,0.040508483,0.00020185312,0.00053808495,0.002339544,0.0019059787,0.023196792,0.10780783,0.011797042,0.8087619],"study_design_scores_gemma":[0.00037345226,0.00024239408,0.0006996055,0.014675708,0.00009915119,0.000015034012,0.0000042840275,0.95335764,0.0011952722,0.007969321,0.020587206,0.0007809345],"about_ca_topic_score_codex":0.000016768598,"about_ca_topic_score_gemma":0.0000013817674,"teacher_disagreement_score":0.95145166,"about_ca_system_score_codex":0.00006331246,"about_ca_system_score_gemma":0.00014887263,"threshold_uncertainty_score":0.9997756},"labels":[],"label_agreement":null},{"id":"W2982672004","doi":"10.1007/s11128-019-2483-3","title":"An infinite family of circulant graphs with perfect state transfer in discrete quantum walks","year":2019,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Circulant matrix; Transfer (computing); Mathematics; Quantum graph; Quantum; Circulant graph; Discrete mathematics; State (computer science); Quantum computer; Graph; Combinatorics; Quantum mechanics; Computer science; Physics; Line graph; Algorithm; Voltage graph","score_opus":0.006119963805271291,"score_gpt":0.21874193089215763,"score_spread":0.21262196708688633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982672004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6580773,0.000052416464,0.3411721,0.00005866333,0.00009469688,0.00021348141,0.0000065304353,0.00011952122,0.00020530974],"genre_scores_gemma":[0.9951857,0.000010727694,0.0045165047,0.00022685136,0.000009845967,0.000009766631,0.000022964468,0.000014490885,0.0000031700063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979019,0.00008703448,0.0007231007,0.00030146373,0.0005474162,0.00043909714],"domain_scores_gemma":[0.9989462,0.000056574398,0.00023696819,0.0004699577,0.00018437023,0.000105928295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005962665,0.0002666583,0.0003541112,0.00055665156,0.00012828998,0.00033015123,0.0006684095,0.00007605872,0.0000039350257],"category_scores_gemma":[0.0000113186325,0.00020422708,0.00006719648,0.0010846067,0.00007111331,0.003651476,0.000057416582,0.00034129442,0.00001803455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036850892,0.00032841644,0.02414889,0.0025919506,0.00007219327,0.000030109573,0.08943162,0.3148426,0.011511305,0.0813319,0.000015569714,0.47532693],"study_design_scores_gemma":[0.00086779834,0.00048815322,0.020134088,0.00038643906,0.000004882712,0.00002921385,0.00045695645,0.97375995,0.00074080925,0.0026398406,0.0001456233,0.00034625083],"about_ca_topic_score_codex":0.00010206693,"about_ca_topic_score_gemma":0.000007163203,"teacher_disagreement_score":0.6589173,"about_ca_system_score_codex":0.000029683242,"about_ca_system_score_gemma":0.00023609186,"threshold_uncertainty_score":0.83281386},"labels":[],"label_agreement":null},{"id":"W2984245858","doi":"10.1088/1367-2630/ab68fd","title":"Triangular color codes on trivalent graphs with flag qubits","year":2020,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Intelligence Advanced Research Projects Activity","keywords":"Qubit; Flag (linear algebra); Code (set theory); Scalability; Topology (electrical circuits); Encoding (memory); Quantum","score_opus":0.018934442478513915,"score_gpt":0.2332799005322255,"score_spread":0.21434545805371158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984245858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22620487,0.000178256,0.7650446,0.007993562,0.00031378795,0.000098236334,0.0000020177492,0.000051344796,0.00011330508],"genre_scores_gemma":[0.87743473,0.000022519456,0.11823163,0.0026352974,0.0016150082,4.914531e-7,5.6460357e-7,0.00002086653,0.000038897353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988387,0.000067075125,0.00025075,0.00017884655,0.0004764849,0.00018812584],"domain_scores_gemma":[0.99903506,0.000104039165,0.0003104895,0.00018276538,0.00010869105,0.00025894976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121789184,0.00014684236,0.0002883429,0.000044680575,0.00007963797,0.000101051475,0.0006752909,0.000028840657,0.000002836725],"category_scores_gemma":[0.000028017319,0.00009877434,0.00014918964,0.00044772789,0.000027677168,0.00015142026,0.00006480279,0.0003479929,0.0000088080915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044090327,0.0003275272,0.00012397273,0.00004654668,0.00025583667,0.0004746408,0.0052364,0.20337845,0.0037471992,0.048670292,0.017463421,0.7198348],"study_design_scores_gemma":[0.0113442615,0.015742341,0.0012566433,0.0006667496,0.0001450817,0.00040049726,0.0001065545,0.82663363,0.050437264,0.043938395,0.048313607,0.0010149693],"about_ca_topic_score_codex":0.0000029170676,"about_ca_topic_score_gemma":4.3173645e-7,"teacher_disagreement_score":0.71881986,"about_ca_system_score_codex":0.0000151942195,"about_ca_system_score_gemma":0.00018530722,"threshold_uncertainty_score":0.40279007},"labels":[],"label_agreement":null},{"id":"W2985257503","doi":"10.1145/3357713.3384332","title":"Interactive shallow Clifford circuits: Quantum advantage against NC¹ and beyond","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Innovative Research Group Project of the National Natural Science Foundation of China; National Science Foundation","keywords":"Circuit complexity; Constant (computer programming); Quantum; Electronic circuit; Quantum circuit; Mathematics; Quantum computer; Qubit; Quantum algorithm; Computer science; Topology (electrical circuits); Quantum error correction; Quantum mechanics; Physics; Combinatorics","score_opus":0.014906940046659503,"score_gpt":0.2573579176302524,"score_spread":0.2424509775835929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985257503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069308065,0.00067974074,0.9012558,0.008362877,0.0029653017,0.0006593493,0.00006114049,0.0011686226,0.015539111],"genre_scores_gemma":[0.9252012,0.00022451574,0.06866701,0.005027504,0.0005491695,0.000029443116,0.00005371735,0.00006090158,0.00018655664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661136,0.00014593957,0.00054298335,0.0016986594,0.00044843313,0.0005526549],"domain_scores_gemma":[0.99786705,0.00028942354,0.00033205608,0.001038487,0.00010971856,0.00036324287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002669483,0.00062358845,0.00069801806,0.00021658164,0.0002045906,0.00076365296,0.0019316269,0.000285135,0.000014868079],"category_scores_gemma":[0.00009604096,0.0005456261,0.00023715213,0.0002740143,0.00010710859,0.00027406932,0.005892712,0.001748463,0.000043519743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025160292,0.0002547964,0.00043545116,0.0005799016,0.00040253514,0.00073680904,0.010547519,0.0041283565,0.0010229294,0.0793437,0.0031844485,0.89933836],"study_design_scores_gemma":[0.0003492314,0.00015711445,0.00066345616,0.00022030996,0.000017599228,0.000046803772,0.00019248825,0.9470077,0.00018921866,0.046167348,0.004216575,0.0007721666],"about_ca_topic_score_codex":0.00002988525,"about_ca_topic_score_gemma":0.000011451129,"teacher_disagreement_score":0.9428793,"about_ca_system_score_codex":0.00006395965,"about_ca_system_score_gemma":0.00019782313,"threshold_uncertainty_score":0.99969953},"labels":[],"label_agreement":null},{"id":"W2985944953","doi":"10.1103/physrevresearch.2.013326","title":"Simple communication complexity separation from quantum state antidistinguishability","year":2020,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Engineering and Physical Sciences Research Council; University of Oxford; Government of Canada; John Templeton Foundation","keywords":"Simple (philosophy); Dimension (graph theory); Conjecture; Bounded function; Set (abstract data type); Quantum; Quantum complexity theory; Communication complexity; Task (project management)","score_opus":0.15311818921264794,"score_gpt":0.44647519223657833,"score_spread":0.2933570030239304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985944953","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73840255,0.018522862,0.18147162,0.057427872,0.00010406508,0.0017931773,0.00010174309,0.00069995626,0.001476146],"genre_scores_gemma":[0.9911479,0.00098855,0.006402396,0.0011954987,0.00017012155,0.000023055201,0.000057577567,0.0000113604265,0.0000035805417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996423,0.0013853778,0.0003291408,0.0006090663,0.0008363812,0.00041699814],"domain_scores_gemma":[0.99709797,0.001096216,0.00010278352,0.0010659358,0.0003756691,0.0002614538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012433274,0.00015453681,0.00039052762,0.000027518778,0.00039523406,0.00019780885,0.0016462078,0.000019719873,0.000020939418],"category_scores_gemma":[0.0013879092,0.00012876908,0.000129029,0.0010215472,0.00023007413,0.00020280888,0.0011624806,0.0007611084,0.00024157694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088013454,0.0019707389,0.0033197054,0.0042256797,0.00015599414,0.000052654148,0.011472139,0.0018082147,0.010847621,0.28772172,0.072076015,0.6062615],"study_design_scores_gemma":[0.000102385595,0.00011114058,0.0044505196,0.0002420226,0.000003325023,4.6762926e-7,0.000004758916,0.80779344,0.00033199645,0.17032135,0.016499244,0.00013932619],"about_ca_topic_score_codex":0.00037205406,"about_ca_topic_score_gemma":0.000011073534,"teacher_disagreement_score":0.8059853,"about_ca_system_score_codex":0.000041056534,"about_ca_system_score_gemma":0.00010189231,"threshold_uncertainty_score":0.52510506},"labels":[],"label_agreement":null},{"id":"W2987160512","doi":"10.1038/s41592-020-01004-3","title":"Quantum computing at the frontiers of biological sciences","year":2021,"lang":"en","type":"article","venue":"Nature Methods","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; Canadian Institute for Advanced Research","funders":"National Institute of Allergy and Infectious Diseases; National Center for Advancing Translational Sciences; National Institute of Mental Health; Engineering and Physical Sciences Research Council","keywords":"Quantum computer; Quantum; Biological sciences; Scale (ratio); Biological network; Quantum information science","score_opus":0.03178018099900156,"score_gpt":0.36381339704534044,"score_spread":0.3320332160463389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987160512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09301215,0.010650199,0.890512,0.0029866535,0.002024151,0.000060374612,0.0000017994536,0.00008482752,0.0006678344],"genre_scores_gemma":[0.1662788,0.000022473852,0.8327718,0.0007397492,0.00011870494,6.6554577e-7,0.0000010432107,0.0000042118754,0.00006256684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758565,0.0010470597,0.0002438834,0.0005053273,0.0003020219,0.0003160645],"domain_scores_gemma":[0.9980396,0.0011403733,0.000149098,0.00050196087,0.000114547474,0.00005444642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026231124,0.0001432252,0.0002634382,0.000064595806,0.00047839535,0.00008412084,0.0012014015,0.00018983342,0.0000076151964],"category_scores_gemma":[0.0006512752,0.0000801251,0.0001508629,0.0010890128,0.0003445652,0.00005217995,0.0010354588,0.0006346674,0.0000020803177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009313865,0.00009874388,0.0040850136,0.000023913091,0.000078266916,0.000054807082,0.0014675373,0.005890699,0.022233699,0.15415822,0.008691098,0.8032087],"study_design_scores_gemma":[0.00018511974,0.0001143927,0.0067281066,0.00003113858,0.000008203507,0.00016632218,0.000116820505,0.88426393,0.059671696,0.024012553,0.024461003,0.00024073494],"about_ca_topic_score_codex":0.000004320826,"about_ca_topic_score_gemma":0.0000010657652,"teacher_disagreement_score":0.8783732,"about_ca_system_score_codex":0.000020310285,"about_ca_system_score_gemma":0.0001052784,"threshold_uncertainty_score":0.36794785},"labels":[],"label_agreement":null},{"id":"W2989593155","doi":"10.1088/1367-2630/ab8ab1","title":"Randomized benchmarking for qudit Clifford gates","year":2020,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Benchmarking; Unitary state; Topology (electrical circuits); Exploit; Gravitational singularity","score_opus":0.023840453855502486,"score_gpt":0.25675967792307974,"score_spread":0.23291922406757726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989593155","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008757807,0.0003296282,0.983572,0.0065607843,0.0005643973,0.00011612965,8.0798515e-7,0.000026571974,0.0000718569],"genre_scores_gemma":[0.4591908,0.000083907755,0.5287172,0.002465997,0.009485469,0.0000018356715,0.0000011800535,0.000022420678,0.000031221367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902606,0.000059636903,0.0003627723,0.00013814191,0.00023456804,0.00017879727],"domain_scores_gemma":[0.9987104,0.0004580693,0.00041698004,0.000112729154,0.00012899307,0.00017281294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036318105,0.00011419748,0.00042280514,0.000026081787,0.000083823346,0.000117579344,0.00059844163,0.000026567777,0.000003030371],"category_scores_gemma":[0.00012734356,0.00008391784,0.00035638805,0.0001917342,0.000026886966,0.00019517107,0.00008943466,0.00020620442,0.0000023723908],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003215081,0.000060872688,0.000024543986,0.000056103116,0.00019968169,0.000022765144,0.003971568,0.028854553,0.0011495005,0.059720755,0.020047845,0.8826767],"study_design_scores_gemma":[0.045059662,0.0003390835,0.000010186573,0.000073480594,0.0000356617,0.000027559545,0.000010715697,0.8518133,0.0026485475,0.088839486,0.01098743,0.0001548884],"about_ca_topic_score_codex":0.000002433686,"about_ca_topic_score_gemma":1.14385635e-7,"teacher_disagreement_score":0.88252187,"about_ca_system_score_codex":0.00000965798,"about_ca_system_score_gemma":0.00012689848,"threshold_uncertainty_score":0.342207},"labels":[],"label_agreement":null},{"id":"W2990614671","doi":"10.1088/2632-2153/abb215","title":"Quantum computation with machine-learning-controlled quantum stuff","year":2020,"lang":"en","type":"preprint","venue":"Machine Learning Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Computation; Set (abstract data type); Quantum computer; Computer science; Quantum; Quantum gate; Quantum circuit; Theoretical computer science; Computer engineering; Algorithm; Artificial intelligence; Quantum error correction; Physics; Programming language; Quantum mechanics","score_opus":0.008791595298409182,"score_gpt":0.24315708159832458,"score_spread":0.2343654862999154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990614671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38915142,0.0025453686,0.5690442,0.033093173,0.00082286535,0.0010946468,0.000008159495,0.0039168014,0.0003233983],"genre_scores_gemma":[0.9670385,0.00011386362,0.032275625,0.0002783999,0.00010351321,0.000051069153,0.000020823161,0.00004975149,0.000068433495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945688,0.00030902485,0.00063521916,0.0022824358,0.0011979751,0.0010065171],"domain_scores_gemma":[0.9973113,0.0002836693,0.0007954691,0.00077353965,0.00054954085,0.00028648105],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017864989,0.0007441276,0.001181856,0.0015529612,0.0015658299,0.0009873349,0.0028846583,0.0004300795,0.0000046861287],"category_scores_gemma":[0.0012065744,0.00057154184,0.00012075101,0.0031951156,0.0012988921,0.00027690674,0.0044867015,0.004886976,0.000025592943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000443329,0.0006176992,0.034775533,0.00056380744,0.000492754,0.0010021864,0.005976701,0.32165387,0.0057525914,0.21608132,0.00015571031,0.4124845],"study_design_scores_gemma":[0.002111073,0.0012170787,0.000634067,0.00014918658,0.00003896372,0.0002147034,0.00007738203,0.97034085,0.00015509553,0.022396293,0.0019775198,0.00068777817],"about_ca_topic_score_codex":0.00026093348,"about_ca_topic_score_gemma":0.00002369467,"teacher_disagreement_score":0.648687,"about_ca_system_score_codex":0.00009882884,"about_ca_system_score_gemma":0.00070065877,"threshold_uncertainty_score":0.999734},"labels":[],"label_agreement":null},{"id":"W2994217331","doi":"10.4230/lipics.stacs.2021.6","title":"A Unified Framework of Quantum Walk Search","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"QuantERA; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research; Institute for Quantum Information and Matter, California Institute of Technology; Samsung; California Institute of Technology; National Science Foundation","keywords":"Quantum walk; Hitting time; Electric network; Quantum; Random walk; Computer science; Quantum algorithm; Operator (biology); Mathematics; Theoretical computer science; Algorithm; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.018530198710314177,"score_gpt":0.27452845219937855,"score_spread":0.25599825348906435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994217331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22284399,0.00024307967,0.7711638,0.00055896974,0.002795044,0.001054662,0.00042367383,0.00030414824,0.00061260414],"genre_scores_gemma":[0.655444,0.00009665275,0.34281224,0.0005481883,0.00033753985,0.000049102604,0.0005759966,0.000063638305,0.000072594616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452245,0.00016366255,0.0020441134,0.00080997107,0.001230402,0.0012293933],"domain_scores_gemma":[0.9942958,0.0005619419,0.0010357276,0.002858045,0.0008873228,0.00036117376],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001165046,0.0008587725,0.0013397648,0.0005759883,0.00035050116,0.0010909456,0.0041220956,0.0009878614,0.000031839663],"category_scores_gemma":[0.00024829005,0.00079521333,0.00087306707,0.0007335277,0.00022164902,0.00056916376,0.004614236,0.0028495505,0.000030210222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038002874,0.0030177953,0.006032918,0.027585912,0.0035343762,0.00025894452,0.17695989,0.24000095,0.00016312949,0.25523153,0.004646042,0.28218848],"study_design_scores_gemma":[0.0009669871,0.0002515821,0.0008896327,0.0019066056,0.000047965365,0.00007441615,0.00079530256,0.97879136,0.00091593224,0.012052172,0.0023893612,0.0009186732],"about_ca_topic_score_codex":0.00010473569,"about_ca_topic_score_gemma":0.000008967514,"teacher_disagreement_score":0.7387904,"about_ca_system_score_codex":0.00011263881,"about_ca_system_score_gemma":0.0006764064,"threshold_uncertainty_score":0.999946},"labels":[],"label_agreement":null},{"id":"W2994809744","doi":"10.1007/s11128-020-02815-1","title":"Optimal control of traffic signals using quantum annealing","year":2020,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum annealing; Quadratic unconstrained binary optimization; Qubit; Quantum computer; Optimal control; Quantum; Optimization problem; Ising model","score_opus":0.01893446232119752,"score_gpt":0.24753004401598575,"score_spread":0.22859558169478822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994809744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3693823,0.00017643068,0.62926894,0.0007115613,0.000098986566,0.00011815535,0.00000568497,0.00021081114,0.000027133712],"genre_scores_gemma":[0.94581896,0.0000026308035,0.053001575,0.0010612143,0.00009559333,0.0000028574182,0.0000058895002,0.000010884957,4.122738e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798775,0.00006619948,0.00084965944,0.00023826232,0.00047811551,0.0003800327],"domain_scores_gemma":[0.99858856,0.00008377975,0.00066040806,0.00020911495,0.00028821282,0.00016991138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043048422,0.00022549927,0.00035194366,0.00018506433,0.00029932894,0.0003695166,0.0006890424,0.00008845378,0.0000064908822],"category_scores_gemma":[0.00012805825,0.00020695949,0.00010991799,0.0008045256,0.000054795677,0.0024415785,0.00011889907,0.0002556013,0.000015089652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019960658,0.000013868163,0.000011768369,0.00022265545,0.000011652443,0.0000023302437,0.006180528,0.9324114,0.0009507515,0.0014874431,0.000024233259,0.058663446],"study_design_scores_gemma":[0.00061803224,0.0001410761,0.000026377078,0.00012388598,0.000012001574,0.000025506513,0.00030409583,0.9965039,0.0014294103,0.00015703509,0.00040995143,0.00024873385],"about_ca_topic_score_codex":0.0000051978745,"about_ca_topic_score_gemma":6.636252e-8,"teacher_disagreement_score":0.57643664,"about_ca_system_score_codex":0.000023810559,"about_ca_system_score_gemma":0.00024393472,"threshold_uncertainty_score":0.8439563},"labels":[],"label_agreement":null},{"id":"W2994883802","doi":"","title":"Capacity of Quantum Erasure Channel Assisted by Backwards Classical Communication","year":2009,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Erasure; Classical capacity; Binary erasure channel; Channel (broadcasting); Upper and lower bounds; Computer science; Quantum; Quantum channel; Channel capacity; Mathematics; Computer network; Physics; Quantum mechanics; Quantum information; Mathematical analysis","score_opus":0.015255846209091537,"score_gpt":0.23909183907252646,"score_spread":0.22383599286343492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994883802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49157187,0.001708658,0.43199444,0.0705731,0.0008366648,0.0005868309,0.00012343275,0.0014241457,0.0011808691],"genre_scores_gemma":[0.8934311,0.000064593376,0.10618051,0.00019722973,0.000029736586,0.00000890783,0.000016742862,0.000014972794,0.000056181667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748755,0.000103623264,0.00068441435,0.00063452014,0.0005547348,0.00053516985],"domain_scores_gemma":[0.99690473,0.000060432496,0.0005994279,0.0020062595,0.00030447,0.00012467385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044664156,0.00038376448,0.0007067336,0.00059428,0.00025758706,0.00005134939,0.0027170617,0.0005894433,0.0000033677745],"category_scores_gemma":[0.00024954425,0.00035505465,0.0002102737,0.0016622511,0.0007844432,0.00039158328,0.0004767098,0.0009035723,0.0000070357164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008498802,0.0030074336,0.0017049526,0.00025200442,0.00053156534,0.00006195329,0.0018851962,0.0033821783,0.13940525,0.43140668,0.032195363,0.38608244],"study_design_scores_gemma":[0.0041606724,0.0025111034,0.01817965,0.0011932043,0.00015171767,0.00030523483,0.00011623468,0.5552289,0.15348251,0.078057185,0.18438448,0.0022291327],"about_ca_topic_score_codex":0.000039315193,"about_ca_topic_score_gemma":0.000014950593,"teacher_disagreement_score":0.5518467,"about_ca_system_score_codex":0.00008100597,"about_ca_system_score_gemma":0.00013869492,"threshold_uncertainty_score":0.99989015},"labels":[],"label_agreement":null},{"id":"W2994932301","doi":"10.1088/1367-2630/ab7a34","title":"Quantum compression of tensor network states","year":2020,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Croucher Foundation; National Natural Science Foundation of China; Foundational Questions Institute; John Templeton Foundation","keywords":"Physics; Upper and lower bounds; Multiplicative function; State (computer science); Compression (physics); Tensor (intrinsic definition); Topology (electrical circuits); Quantum state; Flow (mathematics); Quantum; Combinatorics; Quantum mechanics; Algorithm; Pure mathematics; Mathematics; Mathematical analysis","score_opus":0.018840477679757967,"score_gpt":0.2419715591012602,"score_spread":0.22313108142150223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994932301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091374874,0.0004065643,0.9050128,0.0027327407,0.0003816591,0.00003214481,0.0000011163736,0.000022822775,0.00003528279],"genre_scores_gemma":[0.86961526,0.000038864382,0.12747157,0.0007042201,0.0021494518,7.130583e-8,5.2715984e-7,0.000011022223,0.000009028444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990076,0.000055310415,0.00033730365,0.00011470007,0.0003170275,0.00016807577],"domain_scores_gemma":[0.99896026,0.0001153385,0.00046149024,0.0001511287,0.00013810389,0.00017366339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011747556,0.00010058856,0.00027080052,0.000017958479,0.00005166753,0.000040196508,0.0006613079,0.000024528768,0.0000032014184],"category_scores_gemma":[0.000020767828,0.00007371043,0.00013010736,0.00030426716,0.000025295558,0.00015511086,0.00015534868,0.00026919856,0.0000032476023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004398698,0.00008133209,0.0005382715,0.00004079805,0.00006193093,0.000038933475,0.0027251267,0.68980116,0.004172278,0.012186914,0.028679678,0.26162958],"study_design_scores_gemma":[0.00051656796,0.0005349168,0.0006875077,0.00015203035,0.000011695434,0.000024164945,0.000020174894,0.95079523,0.004006653,0.038515728,0.0046232706,0.000112061345],"about_ca_topic_score_codex":0.000005433637,"about_ca_topic_score_gemma":9.1827474e-8,"teacher_disagreement_score":0.7782404,"about_ca_system_score_codex":0.0000057041284,"about_ca_system_score_gemma":0.000099463374,"threshold_uncertainty_score":0.3005824},"labels":[],"label_agreement":null},{"id":"W2995067406","doi":"10.22331/q-2020-10-11-341","title":"Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Quantum algorithm; Quantum; Quantum circuit; Quantum computer; Quantum phase estimation algorithm; Quantum gate; Representation (politics); Quantum network; Quantum error correction","score_opus":0.03570084225003806,"score_gpt":0.26822870158003626,"score_spread":0.2325278593299982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995067406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034885225,0.00059390446,0.98334724,0.009314847,0.0015535045,0.000725085,0.000020207082,0.000921446,0.00003521857],"genre_scores_gemma":[0.13445368,0.00001558731,0.86104804,0.0034868577,0.0008511139,0.00005427806,0.0000061540854,0.00006266784,0.000021613178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660695,0.00018210978,0.0005341444,0.0011643704,0.00056125916,0.0009511717],"domain_scores_gemma":[0.99726665,0.0009823209,0.00022390035,0.0008516071,0.00020039457,0.00047512085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060729816,0.00044697078,0.00051879085,0.00013778277,0.0004601079,0.0003495915,0.0016588646,0.0002037755,0.000014424211],"category_scores_gemma":[0.00044993078,0.00039420123,0.00029069572,0.0009721381,0.0000968029,0.00013614108,0.00043988923,0.0005462772,0.00015843299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000734468,0.00027605912,0.000012104308,0.0001251561,0.00009705787,0.00014263803,0.003542816,0.10374881,0.0007727603,0.6414727,0.010743733,0.2389927],"study_design_scores_gemma":[0.00046589444,0.0006877056,0.00007488262,0.00007697906,0.000015828384,0.000031032127,0.0000463434,0.91523635,0.0010639012,0.0746637,0.0071313186,0.00050606375],"about_ca_topic_score_codex":0.000011222746,"about_ca_topic_score_gemma":1.3774256e-7,"teacher_disagreement_score":0.81148756,"about_ca_system_score_codex":0.00003651375,"about_ca_system_score_gemma":0.00017774,"threshold_uncertainty_score":0.999851},"labels":[],"label_agreement":null},{"id":"W2995674760","doi":"10.21105/joss.01705","title":"The Walrus: a library for the calculation of hafnians, Hermite polynomials and Gaussian boson sampling","year":2019,"lang":"en","type":"article","venue":"The Journal of Open Source Software","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Hermite polynomials; Sampling (signal processing); Gaussian; Boson; Mathematics; Statistical physics; Applied mathematics; Physics; Computer science; Pure mathematics; Particle physics; Quantum mechanics; Optics","score_opus":0.017142827007083233,"score_gpt":0.27040629136007704,"score_spread":0.2532634643529938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995674760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45321384,0.0028206022,0.53143746,0.0114777805,0.00037117992,0.00061424647,0.000007996248,0.00002832316,0.000028585691],"genre_scores_gemma":[0.9272086,0.00016873967,0.0706855,0.00070127455,0.00039158989,0.0000037626783,9.788606e-7,0.000037251193,0.0008023329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888027,0.00018311743,0.00038443657,0.00011793061,0.00023748126,0.00019677945],"domain_scores_gemma":[0.99670863,0.0021397818,0.00057261775,0.00045937736,0.00006592308,0.000053650874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016031143,0.00011689391,0.00022253735,0.00003925089,0.0005272809,0.00052334054,0.002157882,0.000038584276,0.0000044124295],"category_scores_gemma":[0.00011505558,0.00004972563,0.00010697241,0.00017830267,0.00007889056,0.0003963087,0.00064968265,0.00024890262,0.0000014549292],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034673393,0.000043894295,0.0037829562,0.00007095386,0.00022676025,0.0000023729358,0.015532155,0.067247525,0.0006088393,0.001610606,0.0031726894,0.90735453],"study_design_scores_gemma":[0.003003273,0.0011553641,0.048716344,0.0011129744,0.00018911074,0.0007668543,0.002038197,0.71810514,0.0027148726,0.014280437,0.20732513,0.0005923347],"about_ca_topic_score_codex":0.000035647736,"about_ca_topic_score_gemma":0.0000028551356,"teacher_disagreement_score":0.9067622,"about_ca_system_score_codex":0.000008967287,"about_ca_system_score_gemma":0.00009574802,"threshold_uncertainty_score":0.5046585},"labels":[],"label_agreement":null},{"id":"W2995724754","doi":"10.1088/2058-9565/ab8504","title":"Applications of near-term photonic quantum computers: software and algorithms","year":2020,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Photonics; Software; Key (lock); Quantum computer; Quantum; State (computer science); Point (geometry); Quantum algorithm","score_opus":0.009667399653265211,"score_gpt":0.2383995459536308,"score_spread":0.2287321463003656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995724754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35281527,0.0008369477,0.6378224,0.007590377,0.0001258987,0.00029047852,0.0000061757805,0.00049504713,0.000017423665],"genre_scores_gemma":[0.8690196,0.00007769671,0.13045645,0.00038404198,0.000031599302,0.000019169334,8.0826476e-7,0.0000086644295,0.0000019414638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979992,0.000022538492,0.00030378118,0.000847565,0.00037706632,0.00044986286],"domain_scores_gemma":[0.99874884,0.00011187481,0.00016695079,0.000536049,0.00023090589,0.00020539665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038405292,0.00019446987,0.00032268986,0.00031986364,0.0005170965,0.0001929929,0.0014753437,0.00011502611,0.0000018116276],"category_scores_gemma":[0.0001394843,0.00017082674,0.000031492968,0.002824797,0.0020949296,0.00029658037,0.0011616929,0.00029616532,0.000006569067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000396712,0.000074076816,0.0019049671,0.000106169406,0.000015741449,0.000020861095,0.0013097636,0.00004046549,0.011119487,0.19096696,0.00007998771,0.79435754],"study_design_scores_gemma":[0.00032894296,0.0005028474,0.0011850235,0.000039957253,0.0000074005998,0.00014398572,0.000112310605,0.9667783,0.0049168686,0.02197227,0.0037388387,0.00027329862],"about_ca_topic_score_codex":0.000014819046,"about_ca_topic_score_gemma":8.337724e-7,"teacher_disagreement_score":0.9667378,"about_ca_system_score_codex":0.000015541515,"about_ca_system_score_gemma":0.00025444964,"threshold_uncertainty_score":0.7718855},"labels":[],"label_agreement":null},{"id":"W2995742898","doi":"10.22331/q-2020-10-09-340","title":"Transfer learning in hybrid classical-quantum neural networks","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":385,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Quantum machine learning; Computer science; Artificial neural network; Quantum; Artificial intelligence; Quantum circuit; Quantum computer; Deep learning; Theoretical computer science; Quantum network; Physics","score_opus":0.014960445801953532,"score_gpt":0.22454820658977784,"score_spread":0.20958776078782432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995742898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3714566,0.00023678681,0.61304414,0.014028719,0.0004808047,0.00012769033,0.0000013107174,0.0005140509,0.00010990796],"genre_scores_gemma":[0.99546397,0.000015517668,0.0014308041,0.002636346,0.00038914222,0.0000069812004,0.0000053745002,0.00002878399,0.000023064982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762183,0.00023093482,0.0004094844,0.0007230112,0.00032325534,0.0006914876],"domain_scores_gemma":[0.99911267,0.00019450948,0.00005027386,0.00032916304,0.00003305831,0.00028030624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002601676,0.0002832922,0.00036279924,0.00010052984,0.00017448729,0.00019796428,0.0010071648,0.000081688144,0.000015483312],"category_scores_gemma":[0.00006911173,0.00025590986,0.00015471796,0.0007211466,0.00006619627,0.00031206736,0.00024267752,0.0011278107,0.00004260618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003493694,0.00008979695,0.000832908,0.000033104847,0.000017435088,0.000520332,0.0013046856,0.8333261,0.00046552654,0.054065354,0.0011548903,0.108154945],"study_design_scores_gemma":[0.00047426234,0.00031164894,0.0010030104,0.000027620594,0.000003752244,0.000036914924,0.000021872553,0.9902338,0.00011930819,0.0012850286,0.0061533717,0.00032942306],"about_ca_topic_score_codex":0.00002129598,"about_ca_topic_score_gemma":0.0000025656316,"teacher_disagreement_score":0.6240074,"about_ca_system_score_codex":0.000022570612,"about_ca_system_score_gemma":0.000046482648,"threshold_uncertainty_score":0.99998933},"labels":[],"label_agreement":null},{"id":"W2996387336","doi":"10.1103/prxquantum.2.030316","title":"Models of Quantum Complexity Growth","year":2021,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Army Research Office; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; U.S. Department of Energy; McGill University; Institute for Quantum Information and Matter, California Institute of Technology; California Institute of Technology; Office of Naval Research; Simons Foundation; Government of Canada; National Science Foundation","keywords":"Quantum complexity theory; Quantum algorithm; Quantum computer; Quantum; Unitary state; Quantum operation; Unitary transformation; Randomness; Quantum process; Mathematics; Statistical physics; Computer science; Open quantum system; Theoretical computer science; Quantum mechanics; Quantum dynamics; Physics","score_opus":0.03772300457296517,"score_gpt":0.2521455488719819,"score_spread":0.2144225442990167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996387336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13862213,0.00063338986,0.8560243,0.002202331,0.00069917925,0.000099314064,0.000013596476,0.00026277624,0.001442951],"genre_scores_gemma":[0.9350776,0.000035197743,0.06440178,0.00030122744,0.0000978174,0.000004215645,0.0000076091083,0.000017355154,0.000057158664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787986,0.00017326769,0.00043792767,0.0005895709,0.00046483273,0.00045452992],"domain_scores_gemma":[0.9983122,0.00017682688,0.00017968188,0.0008485312,0.00033466052,0.00014815372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034196823,0.00022444254,0.0003955512,0.00010893527,0.00016739535,0.000102731334,0.0010168718,0.00008012566,0.000020420173],"category_scores_gemma":[0.00009298452,0.00020677254,0.00018611451,0.00070992147,0.00013746673,0.00028792804,0.0006634811,0.00028339872,0.00002510155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045901115,0.00016002491,0.00011317473,0.000067096655,0.000027330623,0.000058848742,0.0006448098,0.0035703988,0.000997989,0.99013644,0.00058557367,0.0036337315],"study_design_scores_gemma":[0.0001881576,0.000054809945,0.00072374026,0.000038364306,0.0000047500675,0.000055882036,0.000018760527,0.6350968,0.0032346635,0.36012167,0.0002966616,0.0001657643],"about_ca_topic_score_codex":0.000093261035,"about_ca_topic_score_gemma":0.0000056376657,"teacher_disagreement_score":0.7964555,"about_ca_system_score_codex":0.000021089225,"about_ca_system_score_gemma":0.00019547038,"threshold_uncertainty_score":0.843194},"labels":[],"label_agreement":null},{"id":"W2996671537","doi":"","title":"Quantum Algorithm for Data Fitting","year":2012,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum phase estimation algorithm; Algorithm; Quantum algorithm; Quantum; Quantum algorithm for linear systems of equations; Function (biology); Computer science; Quantum computer; Quantum state; Mathematics; Quantum error correction; Quantum process; Quantum dynamics; Quantum mechanics; Physics","score_opus":0.028463326696078345,"score_gpt":0.2779225992400782,"score_spread":0.24945927254399988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996671537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020287221,0.0016654726,0.96619767,0.0072751134,0.002630731,0.000500678,0.00015067583,0.0010946712,0.00019776454],"genre_scores_gemma":[0.1871372,0.00002754295,0.81214035,0.00015576438,0.00034192443,0.000032300482,0.000045256507,0.00003305999,0.00008663217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713224,0.000033691493,0.00056073384,0.0008441711,0.0003881368,0.0010410405],"domain_scores_gemma":[0.9962843,0.00011875237,0.0004192001,0.002841435,0.00016135283,0.00017496235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008399878,0.00038895357,0.0005435591,0.0006531033,0.0003737982,0.00008171867,0.004357128,0.000393404,0.0000037143977],"category_scores_gemma":[0.00044045446,0.00035681258,0.00014475966,0.0012233907,0.00036936713,0.00118091,0.0023062981,0.00052242604,0.000020262236],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004209538,0.0002575999,0.0014240317,0.00007327784,0.000151962,0.00001263125,0.00029130743,0.00013566713,0.0011537711,0.049767226,0.0043144627,0.94241387],"study_design_scores_gemma":[0.00069956324,0.00015418637,0.00027796417,0.00011760617,0.00003951347,0.00009250925,0.000037934526,0.6276858,0.005947867,0.004204089,0.36023763,0.0005053805],"about_ca_topic_score_codex":0.000025880136,"about_ca_topic_score_gemma":0.000005328513,"teacher_disagreement_score":0.9419085,"about_ca_system_score_codex":0.000051493465,"about_ca_system_score_gemma":0.00014022434,"threshold_uncertainty_score":0.99988836},"labels":[],"label_agreement":null},{"id":"W2996674934","doi":"10.1088/2058-9565/ab9359","title":"<tt>staq</tt> —A full-stack quantum processing toolkit","year":2020,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Computer science; Compiler; Stack (abstract data type); Quantum; Set (abstract data type); Task (project management); State (computer science); Piping; Programming language; Range (aeronautics); Physics; Engineering; Systems engineering","score_opus":0.013342487806264713,"score_gpt":0.23989001106402968,"score_spread":0.22654752325776498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996674934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7109346,0.0012662665,0.22159179,0.06306734,0.00047954975,0.00030708194,0.000004130231,0.0019113567,0.00043788215],"genre_scores_gemma":[0.97664154,0.00003988885,0.021674547,0.001487882,0.000113472175,0.000011441955,6.9449607e-7,0.000016539047,0.000014019373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965411,0.000034260567,0.00039287476,0.0013301449,0.0007244662,0.0009771587],"domain_scores_gemma":[0.9983945,0.00006246533,0.00018916199,0.00067574903,0.0003493373,0.00032882628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069250015,0.00031591137,0.000377371,0.0005649092,0.0009762307,0.0005605369,0.0026954873,0.00018311071,0.000006207577],"category_scores_gemma":[0.00044216888,0.00026679618,0.00004851793,0.005224989,0.0014907176,0.0007975079,0.0014144408,0.0005975853,0.00006185632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016259864,0.000100136844,0.00072333956,0.00010023826,0.0000130645585,0.00017475086,0.0020597195,0.0001527724,0.05974319,0.5093998,0.000973329,0.4265434],"study_design_scores_gemma":[0.0003179603,0.00066128187,0.00026831584,0.00005157155,0.0000064119954,0.00022970588,0.00028413063,0.95356005,0.0047096657,0.028772749,0.010693459,0.00044470263],"about_ca_topic_score_codex":0.000011680005,"about_ca_topic_score_gemma":0.000002416809,"teacher_disagreement_score":0.9534073,"about_ca_system_score_codex":0.000042670577,"about_ca_system_score_gemma":0.000552299,"threshold_uncertainty_score":0.9999784},"labels":[],"label_agreement":null},{"id":"W2997289813","doi":"10.1103/physreva.104.032610","title":"Probabilistic simulation of quantum circuits using a deep-learning architecture","year":2021,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; MaRS; Vector Institute","funders":"Kavli Institute for Theoretical Physics, University of California, Santa Barbara; Natural Sciences and Engineering Research Council of Canada; Institut Périmètre de physique théorique; Instituto Nacional de Ciência e Tecnologia de Informação Quântica; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Instituto Serrapilheira; University of Illinois at Urbana-Champaign; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; National Science Foundation; Compute Canada; Innovation, Science and Economic Development Canada; Canadian Institute for Advanced Research; U.S. Department of Energy; Government of Canada","keywords":"Quantum algorithm; Quantum computer; Quantum machine learning; Quantum circuit; Quantum simulator; Computer science; Quantum network; Qubit; Quantum; Ansatz; Theoretical computer science; Open quantum system; Quantum dynamics; Statistical physics; Quantum mechanics; Physics","score_opus":0.021332684677753108,"score_gpt":0.3433576732251804,"score_spread":0.3220249885474273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997289813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20154747,0.07877953,0.71684974,0.0010769912,0.00018789447,0.0010553184,0.0000064982382,0.00023076616,0.00026575505],"genre_scores_gemma":[0.9862866,0.007660527,0.004397588,0.0010734845,0.00046774247,0.00003869761,0.000017306304,0.000047895053,0.000010168756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564046,0.00091058505,0.0008162736,0.0010543142,0.00094995485,0.00062840275],"domain_scores_gemma":[0.99628675,0.0012156445,0.00059550715,0.0011351339,0.0004836663,0.0002833181],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005292306,0.0005129043,0.0016502489,0.00006379618,0.00021175091,0.00007809433,0.00092835457,0.000047621546,0.000011060053],"category_scores_gemma":[0.0025345967,0.00041039722,0.00088453526,0.0018984803,0.00013856128,0.00021626562,0.0005655277,0.00088762684,0.00004702481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053609015,0.0013320298,0.00005551744,0.025105964,0.00013535212,0.0000822682,0.0006729062,0.28967378,0.024866419,0.03934793,0.000053083953,0.6186694],"study_design_scores_gemma":[0.00016238014,0.00015131151,0.00014616642,0.01365679,0.00019509115,0.000034864766,0.0000021454332,0.934952,0.0013725474,0.04608256,0.0028037152,0.00044038796],"about_ca_topic_score_codex":0.0000068993327,"about_ca_topic_score_gemma":7.277945e-7,"teacher_disagreement_score":0.78473914,"about_ca_system_score_codex":0.00006676229,"about_ca_system_score_gemma":0.0002103245,"threshold_uncertainty_score":0.9998348},"labels":[],"label_agreement":null},{"id":"W2998793783","doi":"10.1038/s41534-021-00424-z","title":"Optimal two-qubit circuits for universal fault-tolerant quantum computation","year":2021,"lang":"en","type":"preprint","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Division of Materials Research; Natural Sciences and Engineering Research Council of Canada; Materials Research Science and Engineering Center, Harvard University; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Princeton Center for Complex Materials; National Science Foundation","keywords":"Quantum computer; Qubit; Universal set; Toffoli gate; Electronic circuit; Computation; Computer science; Quantum circuit; Quantum gate; Operator (biology); Controlled NOT gate; Gate count; Algorithm; Mathematics; Set (abstract data type); Topology (electrical circuits); Quantum; Quantum error correction; Quantum mechanics; Combinatorics; Physics; Embedded system","score_opus":0.015314190145892083,"score_gpt":0.25615280272032753,"score_spread":0.24083861257443545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998793783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20114301,0.0001276188,0.7926862,0.00085299293,0.0033014722,0.0009442153,0.00007702588,0.00061144034,0.0002559847],"genre_scores_gemma":[0.91076535,0.00003538084,0.08657147,0.00053061236,0.0004266768,0.00008897975,0.0015220927,0.00003993121,0.000019509002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622357,0.00017241109,0.0011944043,0.00078668096,0.000861566,0.00076135155],"domain_scores_gemma":[0.99658865,0.00029433248,0.0010284957,0.000946692,0.0009144396,0.00022739553],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007899752,0.000657157,0.0007177503,0.00057732034,0.00052424386,0.0016220155,0.0015174157,0.0004622,0.000008581007],"category_scores_gemma":[0.00012898244,0.00068684795,0.0004571671,0.00054308225,0.00007714985,0.0020503637,0.001288631,0.0010198726,0.00005359543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000271519,0.0000742557,0.000012841261,0.00040934706,0.000088557135,0.000018209013,0.0067063537,0.8770972,0.000056868383,0.023845771,0.00079818186,0.09086526],"study_design_scores_gemma":[0.0013388233,0.00018680817,0.00035564514,0.0003762372,0.0000416328,0.00009261713,0.00037673512,0.9891315,0.00015060887,0.0038203453,0.0033229731,0.00080605026],"about_ca_topic_score_codex":0.00014653175,"about_ca_topic_score_gemma":0.000008425096,"teacher_disagreement_score":0.7096223,"about_ca_system_score_codex":0.00026160295,"about_ca_system_score_gemma":0.00079138565,"threshold_uncertainty_score":0.99955827},"labels":[],"label_agreement":null},{"id":"W2999821764","doi":"10.1103/physreva.101.062324","title":"Quantum walks in weak electric fields and Bloch oscillations","year":2020,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Consejo Superior de Investigaciones Científicas; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Generalitat Valenciana","keywords":"Bloch oscillations; Semiclassical physics; Electric field; Physics; Quantum mechanics; Superposition principle; Quantum beats; Amplitude; Hamiltonian (control theory); Quantum electrodynamics; Quantum; Mathematics","score_opus":0.01509196025836238,"score_gpt":0.3174937104695019,"score_spread":0.3024017502111395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999821764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46204478,0.29674035,0.12133457,0.1120669,0.00030312256,0.0032531486,0.00001504649,0.0006976065,0.00354449],"genre_scores_gemma":[0.9193595,0.068032384,0.0013721918,0.010572937,0.0005415055,0.00007598741,0.0000054093857,0.000027710856,0.00001239503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970812,0.0003239652,0.0005571952,0.0009264549,0.00054321694,0.0005679627],"domain_scores_gemma":[0.9981267,0.00054206926,0.00020179964,0.0006467758,0.00008820481,0.0003944879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031453214,0.00040615958,0.0011934151,0.000056725446,0.00012880727,0.0000841287,0.00088967715,0.00004119094,0.0000070808433],"category_scores_gemma":[0.00074062287,0.00031377433,0.00038016494,0.002050954,0.00006367382,0.00022255558,0.00047023332,0.0008019117,0.00014918612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013156638,0.0011641526,0.00042599087,0.0129428655,0.00009325387,0.00007527051,0.0010666256,0.00034092413,0.009795386,0.24682164,0.012942586,0.71431816],"study_design_scores_gemma":[0.00029698876,0.0004151376,0.0014655042,0.0053458796,0.00009491019,0.000017321438,0.0000019977958,0.90695584,0.00041419946,0.049023744,0.035322722,0.00064576155],"about_ca_topic_score_codex":0.000016896007,"about_ca_topic_score_gemma":0.000001984402,"teacher_disagreement_score":0.9066149,"about_ca_system_score_codex":0.000029246072,"about_ca_system_score_gemma":0.000090185815,"threshold_uncertainty_score":0.99993145},"labels":[],"label_agreement":null},{"id":"W3000143109","doi":"10.1007/s11128-020-02829-9","title":"Pair state transfer","year":2020,"lang":"en","type":"preprint","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Laplacian matrix; Quantum walk; Combinatorics; Mathematics; Vertex (graph theory); State (computer science); Transfer (computing); Discrete mathematics; Graph; Transitive relation; Transfer matrix; Quantum; Physics; Quantum mechanics; Computer science; Quantum algorithm; Algorithm","score_opus":0.016900110390585994,"score_gpt":0.23956104665430142,"score_spread":0.22266093626371541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000143109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016555177,0.00021805546,0.97543997,0.004482104,0.0011242229,0.00029832826,0.00002418842,0.0012473036,0.00061064796],"genre_scores_gemma":[0.95246917,0.000019565576,0.044698186,0.0024474182,0.00018498693,0.00003342243,0.00009563891,0.00002478454,0.000026799851],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763536,0.00006763327,0.0008202503,0.00043794242,0.0006067651,0.00043202128],"domain_scores_gemma":[0.99870473,0.00004064598,0.00030048355,0.00052380265,0.00023946646,0.00019086154],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003661192,0.0004070478,0.00038748118,0.00025562095,0.00030843588,0.0016640688,0.0014749916,0.00019627661,0.0000063606017],"category_scores_gemma":[0.000052082334,0.0003723386,0.00016325535,0.00046829495,0.00004957483,0.0018665106,0.0008807811,0.0011056695,0.00012883039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118718945,0.000030442217,0.000018292998,0.0015814117,0.000029709918,0.000011645257,0.021248177,0.06064423,0.000033485692,0.007937765,0.0012416337,0.9072113],"study_design_scores_gemma":[0.00021096882,0.000046327837,0.00017880336,0.00030273898,0.000007985293,0.000016564194,0.000043412972,0.95227075,0.00035847965,0.031436656,0.014665632,0.0004616789],"about_ca_topic_score_codex":0.000016393735,"about_ca_topic_score_gemma":5.0881926e-7,"teacher_disagreement_score":0.93591404,"about_ca_system_score_codex":0.000055071196,"about_ca_system_score_gemma":0.0005488368,"threshold_uncertainty_score":0.99987286},"labels":[],"label_agreement":null},{"id":"W3000286126","doi":"","title":"MIP*=RE","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum entanglement; Tensor product; Class (philosophy); Conjecture; Embedding; Discrete mathematics; Mathematics; Von Neumann architecture; Degree (music); Set (abstract data type); Quantum; Computer science; Pure mathematics; Quantum mechanics; Physics","score_opus":0.06232903771764277,"score_gpt":0.18212631243834806,"score_spread":0.1197972747207053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000286126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12186529,0.000084442356,0.8716097,0.0015283899,0.0010340511,0.00018786792,0.00001359652,0.00075213896,0.0029245156],"genre_scores_gemma":[0.9886985,0.00003493414,0.010025606,0.00045299972,0.0002443677,2.8382567e-7,0.000009497527,0.000019624053,0.0005141902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979121,0.00011642889,0.00016482202,0.0013309139,0.00010312742,0.0003726133],"domain_scores_gemma":[0.9982133,0.000085047184,0.0001808672,0.0011886177,0.00007798202,0.00025421995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012084641,0.00033785464,0.00033917636,0.00015055273,0.0001730282,0.00018127848,0.0027788812,0.00023475033,0.000023518005],"category_scores_gemma":[0.000026908489,0.00037129366,0.0002705726,0.00058650685,0.00007354823,0.00013078033,0.0041195396,0.0009569431,0.00018068319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012694189,0.0000730919,0.0003717254,0.00011745391,0.000112960974,0.0014725396,0.00076966354,0.8583201,0.000036169375,0.1295081,0.0028250127,0.0063804984],"study_design_scores_gemma":[0.00020506117,0.00004515165,0.00038494056,0.000063497646,0.000022007942,0.000005867575,0.000018694283,0.9263864,0.000053940952,0.069511674,0.0028987762,0.00040394557],"about_ca_topic_score_codex":0.000060600654,"about_ca_topic_score_gemma":0.000008242741,"teacher_disagreement_score":0.8668332,"about_ca_system_score_codex":0.000072273724,"about_ca_system_score_gemma":0.0001847771,"threshold_uncertainty_score":0.9998739},"labels":[],"label_agreement":null},{"id":"W3000907577","doi":"10.48550/arxiv.2001.09642","title":"How symmetric is too symmetric for large quantum speedups?","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"","keywords":"Symmetric group; Speedup; Combinatorics; Symmetric function; Adjacency matrix; Permutation group; Boolean function; Discrete mathematics; Mathematics; Graph; Computer science; Parallel computing","score_opus":0.06301264475270711,"score_gpt":0.19984549007054472,"score_spread":0.13683284531783763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000907577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05841692,0.0003696101,0.9332073,0.0041854377,0.0017879829,0.0007035516,0.00016088648,0.00061178626,0.00055657554],"genre_scores_gemma":[0.98552155,0.00012878352,0.011019397,0.0009155015,0.00045167166,0.0000021838855,0.000033882174,0.00005176927,0.0018752483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964538,0.00014521983,0.00029184378,0.001950779,0.0002442675,0.0009140688],"domain_scores_gemma":[0.9968213,0.00041762955,0.00045597865,0.0015730471,0.00028950584,0.00044252898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040342883,0.0006394264,0.00073665206,0.0011768057,0.0003926579,0.00069860806,0.0036583755,0.00045517474,0.0000069154835],"category_scores_gemma":[0.00024684376,0.0006926772,0.000709584,0.0039094156,0.00006125474,0.00032431632,0.0038323645,0.0011213574,0.00006256225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039718452,0.0002592631,0.0004828599,0.0004801154,0.00031701065,0.0004037214,0.00067207596,0.026896244,0.000021957532,0.95127326,0.011119835,0.008033945],"study_design_scores_gemma":[0.00075592194,0.0001870553,0.00041178096,0.00007013301,0.00008724145,0.000009547276,0.000055439315,0.9022198,0.00011595437,0.0814651,0.013872075,0.0007499461],"about_ca_topic_score_codex":0.0000548082,"about_ca_topic_score_gemma":0.0000032038022,"teacher_disagreement_score":0.92710465,"about_ca_system_score_codex":0.00018685868,"about_ca_system_score_gemma":0.00029493822,"threshold_uncertainty_score":0.9995524},"labels":[],"label_agreement":null},{"id":"W3002228079","doi":"10.22331/q-2021-07-28-511","title":"Causal and compositional structure of unitary transformations","year":2021,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Institut Périmètre de physique théorique; Government of Canada; Innovation, Science and Economic Development Canada; John Templeton Foundation","keywords":"Unitary state; Causal structure; Unitary transformation; Tensor product; Formalism (music); Set (abstract data type); Quantum circuit; Quantum; Path (computing)","score_opus":0.006987410790574859,"score_gpt":0.22067278068276547,"score_spread":0.2136853698921906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002228079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.761597,0.00034118036,0.23600096,0.001594424,0.00018901947,0.000035303106,0.000044317436,0.000047809728,0.00015000832],"genre_scores_gemma":[0.9657527,0.0000100552825,0.034007642,0.00015983822,0.00003615492,3.511709e-7,0.000021473428,0.0000033729157,0.0000083631485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993905,0.00004521313,0.00014839631,0.0001509854,0.00014712183,0.00011781077],"domain_scores_gemma":[0.9995897,0.00007120013,0.000034619352,0.00017681206,0.00007605622,0.0000516356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000039963837,0.00007472312,0.000110043846,0.00004943065,0.00010873716,0.000035967856,0.00016357473,0.000033595505,0.000014943854],"category_scores_gemma":[0.000007023455,0.000067299814,0.000031871972,0.00022155103,0.00004592862,0.00012114037,0.000071900904,0.00011947533,0.0000012372776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058967403,0.00010467358,0.00039336065,0.00010983043,0.000059094866,0.000070640235,0.0029791463,0.0046817926,0.0636364,0.90235746,0.0006358071,0.024965925],"study_design_scores_gemma":[0.00039770477,0.00010010515,0.013163395,0.0000565405,0.000010314149,0.0004888045,0.000065734865,0.88956755,0.019221038,0.07543869,0.0012905747,0.000199512],"about_ca_topic_score_codex":0.000009650084,"about_ca_topic_score_gemma":0.0000056984654,"teacher_disagreement_score":0.8848858,"about_ca_system_score_codex":0.000004698043,"about_ca_system_score_gemma":0.00007103622,"threshold_uncertainty_score":0.27444068},"labels":[],"label_agreement":null},{"id":"W3002379060","doi":"","title":"Fault-Tolerant Computations Over Finite Rings with Applications in Digital Signal Processing","year":2002,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Signal processing; Fault tolerance; Computation; Digital signal processing; Algorithm; Theoretical computer science; Distributed computing; Computer hardware","score_opus":0.008521879828595345,"score_gpt":0.2042748067449666,"score_spread":0.19575292691637125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002379060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06986506,0.00024732374,0.9202361,0.0025388366,0.000015584374,0.00023259057,0.000008724491,0.00026560496,0.006590147],"genre_scores_gemma":[0.88873243,0.000009583953,0.110349774,0.00008650221,0.000012599252,0.000033470253,0.00002673178,0.000017947335,0.0007309683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808973,0.00036405073,0.0003207714,0.00055176846,0.00033936335,0.00033428584],"domain_scores_gemma":[0.99756557,0.00085095386,0.00019361412,0.0007182345,0.0005407821,0.00013084819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069054496,0.00020338457,0.00018875502,0.00020322311,0.0004368365,0.00076819555,0.0009734074,0.00006042725,0.000023817793],"category_scores_gemma":[0.00007897331,0.0001832329,0.00006268944,0.0010988965,0.00014315014,0.00047944635,0.00030144543,0.00030266296,0.000024400077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042146653,0.0011850866,0.0073016575,0.00007512529,0.000027295659,0.000018724053,0.025554424,0.028283881,0.00020361929,0.076213144,0.00015605605,0.86097676],"study_design_scores_gemma":[0.00042353207,8.9163046e-7,0.00413538,0.00034603573,0.0000038800713,0.000017558028,0.00004452025,0.9888248,0.00040209986,0.0018410236,0.0037182446,0.00024204906],"about_ca_topic_score_codex":0.00008254429,"about_ca_topic_score_gemma":0.00011179185,"teacher_disagreement_score":0.9605409,"about_ca_system_score_codex":0.00004243254,"about_ca_system_score_gemma":0.00006228185,"threshold_uncertainty_score":0.74720204},"labels":[],"label_agreement":null},{"id":"W3003022945","doi":"10.1016/j.tcs.2020.01.024","title":"Theory versus practice in annealing-based quantum computing","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Quantum annealing; Computer science; Quantum computer; Theoretical computer science; Quantum information science; Quantum; Adiabatic quantum computation; Computation; Abstraction; Algorithm; Quantum entanglement","score_opus":0.014502515370097254,"score_gpt":0.27484250850672864,"score_spread":0.26033999313663136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003022945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03819954,0.00008881343,0.94734186,0.011561236,0.0009841303,0.00019305608,0.0000011989833,0.00047863772,0.001151522],"genre_scores_gemma":[0.73855865,0.0000013419404,0.25644016,0.0047332505,0.000251633,0.0000015809718,6.1021234e-7,0.0000125129545,2.4723275e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575007,0.00054099323,0.00048780223,0.0012729305,0.0009777911,0.00097040867],"domain_scores_gemma":[0.99529713,0.0030234612,0.0001579683,0.0007807953,0.00021853451,0.000522134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032542169,0.00031909216,0.0003519811,0.00024136592,0.0004725866,0.00063138886,0.0035662383,0.00007883086,0.00001305557],"category_scores_gemma":[0.0014430459,0.0002771146,0.00010273899,0.0028221358,0.0016680015,0.0006289391,0.0014641497,0.00067662,0.00007245059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010096828,0.00006831549,0.000014713417,0.000011181116,0.0000045431884,0.0001017976,0.0021661737,0.06667977,0.00009574355,0.8540941,0.000017198628,0.07664553],"study_design_scores_gemma":[0.00096942106,0.0006037297,0.00016621717,0.000051163857,0.0000051686097,0.000021146761,0.00003959208,0.9680419,0.00062850193,0.028905177,0.00020569279,0.0003622869],"about_ca_topic_score_codex":0.0000055663163,"about_ca_topic_score_gemma":2.562563e-7,"teacher_disagreement_score":0.9013621,"about_ca_system_score_codex":0.00006528382,"about_ca_system_score_gemma":0.0003286988,"threshold_uncertainty_score":0.9999681},"labels":[],"label_agreement":null},{"id":"W3003161615","doi":"10.3390/sym14081625","title":"A Quantum-Based Signcryption for Supervisory Control and Data Acquisition (SCADA) Networks","year":2022,"lang":"en","type":"article","venue":"Symmetry","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cistel Technology (Canada); Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"SCADA; Signcryption; Computer science; Encryption; Quantum computer; Supervisory control; Computer security; Quantum; Control (management); Public-key cryptography; Engineering","score_opus":0.021768616092685794,"score_gpt":0.2491061829143859,"score_spread":0.22733756682170012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003161615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041354306,0.00091639993,0.9548461,0.0017917863,0.00051747734,0.00030297315,0.00008069115,0.0001698537,0.000020451009],"genre_scores_gemma":[0.9717769,0.0000036716178,0.025880832,0.0019405864,0.0002217495,0.000041428702,0.0001113792,0.000014532137,0.000008913541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852914,0.00016799249,0.00018207119,0.00056847965,0.00025681852,0.0002955174],"domain_scores_gemma":[0.9986842,0.00037841732,0.000081178485,0.00074810686,0.000033838594,0.00007425359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008516095,0.00013444583,0.00016833321,0.00012165688,0.00055633445,0.00012443773,0.000948122,0.000043213353,0.0000076247647],"category_scores_gemma":[0.000029969438,0.0001313149,0.00005005607,0.00032040672,0.000032237454,0.00017314802,0.0005827066,0.00022377512,0.0000010799225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035939162,0.00057553634,0.00243818,0.00021167738,0.00017159907,0.000060973372,0.00060487963,0.359365,0.0025162562,0.12125078,0.02150078,0.49094495],"study_design_scores_gemma":[0.0010091687,0.00026406627,0.0015389782,0.00000999736,0.00001205861,0.000018643192,0.000025041596,0.9898124,0.000016709553,0.0035214124,0.0035984751,0.00017306196],"about_ca_topic_score_codex":0.000015287113,"about_ca_topic_score_gemma":0.0000010714033,"teacher_disagreement_score":0.9304226,"about_ca_system_score_codex":0.00002822103,"about_ca_system_score_gemma":0.000057846602,"threshold_uncertainty_score":0.5354866},"labels":[],"label_agreement":null},{"id":"W3003486108","doi":"10.1145/3377816.3381731","title":"Is your quantum program bug-free?","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Debugging; Computer science; Mainstream; Task (project management); Process (computing); Quantum computer; Code (set theory); Programming language; Face (sociological concept); Quantum; Software engineering; Engineering; Systems engineering","score_opus":0.039559831141328716,"score_gpt":0.2976944975829863,"score_spread":0.25813466644165756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003486108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009450775,0.00047303308,0.9135972,0.061497457,0.0031875924,0.0010185357,0.000037037404,0.0047218767,0.006016473],"genre_scores_gemma":[0.14389609,0.00004225332,0.848539,0.005188709,0.0013377409,0.00010101586,0.000025277868,0.00007068972,0.000799217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967299,0.00008873094,0.00045226797,0.0015040362,0.0006285241,0.0005965051],"domain_scores_gemma":[0.996772,0.0000612249,0.00022743827,0.0024981168,0.00011701038,0.0003242444],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00022067489,0.000519476,0.0005245508,0.00013692137,0.00016127623,0.0008737539,0.005428806,0.00031239886,0.00004350491],"category_scores_gemma":[0.00007009443,0.00043181345,0.00038634863,0.0004155128,0.000063196065,0.00008778877,0.010750547,0.001416325,0.00018784194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011083743,0.00053889945,0.0002102342,0.00060043344,0.00029384304,0.0003383462,0.005480119,0.0044730655,0.00007902679,0.086658135,0.15414068,0.7471761],"study_design_scores_gemma":[0.00019396706,0.00015482907,0.00042222888,0.00008846917,0.0000113068,0.000023469269,0.000009782894,0.84947634,0.00018955795,0.12085283,0.028053721,0.0005235169],"about_ca_topic_score_codex":0.00014347922,"about_ca_topic_score_gemma":0.0000031435532,"teacher_disagreement_score":0.84500325,"about_ca_system_score_codex":0.00003399266,"about_ca_system_score_gemma":0.00028265736,"threshold_uncertainty_score":0.9999523},"labels":[],"label_agreement":null},{"id":"W3004545975","doi":"","title":"On the hitting times of quantum versus random walks","year":2008,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institut Périmètre de physique théorique; Centre for Quantum Technologies; Industry Canada; Agence Nationale de la Recherche; National Research Foundation; European Commission; Government of Canada","keywords":"Hitting time; Quantum walk; Mathematics; Markov chain; Random walk; Discrete mathematics; Quantum algorithm; Ergodic theory; Quantum; Statistical physics; Combinatorics; Quantum mechanics; Pure mathematics; Physics; Statistics","score_opus":0.013383888771208845,"score_gpt":0.21137301353695437,"score_spread":0.1979891247657455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004545975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39157987,0.00028028328,0.56500757,0.0152922785,0.00031017093,0.00020956289,0.0000041632215,0.00023367547,0.027082453],"genre_scores_gemma":[0.96743894,0.000045978737,0.031482264,0.000113072165,0.000016486027,0.0000073924807,0.0000052910027,0.000012744102,0.0008778239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964191,0.0022437987,0.0003105697,0.00037419933,0.00038725443,0.00026508805],"domain_scores_gemma":[0.99227315,0.005459591,0.00025456626,0.0013967935,0.0005359956,0.000079903075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002959222,0.00016094321,0.00020315613,0.00009258375,0.0005783232,0.00009869628,0.0015266171,0.00005759754,0.000041450043],"category_scores_gemma":[0.0014994002,0.00011866845,0.00014135086,0.0004888007,0.00022072994,0.000096815274,0.00044297238,0.00027875128,0.000028761691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003346563,0.00025317748,0.00013581329,0.000014279034,0.0000407838,0.000007932891,0.010384166,0.00070450717,0.0009793912,0.93958825,0.0015319091,0.046326313],"study_design_scores_gemma":[0.0015938889,0.0000027561166,0.0011753542,0.0003586317,0.000008280917,0.00002577327,0.00005392111,0.94833374,0.034704894,0.010328367,0.0031651482,0.0002492152],"about_ca_topic_score_codex":0.00015272797,"about_ca_topic_score_gemma":0.000020200225,"teacher_disagreement_score":0.9476293,"about_ca_system_score_codex":0.000020879861,"about_ca_system_score_gemma":0.000100898294,"threshold_uncertainty_score":0.48391593},"labels":[],"label_agreement":null},{"id":"W3005437076","doi":"10.1073/pnas.2006337117","title":"Generation of thermofield double states and critical ground states with a quantum computer","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the National Academy of Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Basic Energy Sciences; Division of Physics; Air Force Office of Scientific Research; Intelligence Advanced Research Projects Activity; High Energy Physics; U.S. Army; Office of the Director of National Intelligence","keywords":"Physics; Quantum entanglement; Quantum simulator; Quantum mechanics; Quantum; Ising model; Statistical physics; Quantum computer; Open quantum system; Quantum information; Quantum state; Quantum network; Theoretical physics","score_opus":0.06467249614952789,"score_gpt":0.31006690008314053,"score_spread":0.24539440393361264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005437076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.975208,0.000253626,0.0065311603,0.017497078,0.00007629947,0.00024590248,0.000020229576,0.000031502164,0.0001361921],"genre_scores_gemma":[0.9378776,0.000049331218,0.061607912,0.0002979217,0.00015110373,0.0000058066416,4.8270107e-7,0.0000048659113,0.000004968106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777025,0.0000140428165,0.0004082639,0.00051385286,0.0011235299,0.00017007609],"domain_scores_gemma":[0.99873334,0.00025249616,0.00052378647,0.000022059596,0.00041490278,0.000053413725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007873958,0.00017664258,0.00030284145,0.00013900081,0.0001717406,0.00015671096,0.0014348276,0.00011087056,0.0000015796534],"category_scores_gemma":[0.00007020188,0.00010757793,0.000068445814,0.0004417821,0.00095056806,0.00029676594,0.0011990324,0.00040306113,1.4549038e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080175865,0.00020802565,0.0019504232,0.0016751704,0.00015026788,1.7781521e-7,0.0073624044,0.05106927,0.054337397,0.8748305,0.0013614589,0.006974719],"study_design_scores_gemma":[0.00015008818,0.00017649328,0.0044078105,0.0002502957,0.000011433418,0.000010361064,0.00004281093,0.7927563,0.02750643,0.17454624,0.000017502663,0.00012424098],"about_ca_topic_score_codex":0.000037388316,"about_ca_topic_score_gemma":1.3280446e-7,"teacher_disagreement_score":0.741687,"about_ca_system_score_codex":0.000012566264,"about_ca_system_score_gemma":0.00007859746,"threshold_uncertainty_score":0.43869004},"labels":[],"label_agreement":null},{"id":"W3006084474","doi":"10.1007/978-3-030-64834-3_22","title":"Improved Classical and Quantum Algorithms for Subset-Sum","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Quantum walk; Heuristics; Quantum algorithm; Quantum; Mathematics; Random walk; Heuristic; Tilde; Algorithm; Discrete mathematics; Combinatorics; Physics; Quantum mechanics; Mathematical optimization; Statistics","score_opus":0.023886456644541205,"score_gpt":0.27599954598195897,"score_spread":0.2521130893374178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006084474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010274524,0.00051223964,0.97253084,0.0112961475,0.0040101763,0.00093204854,0.000025473419,0.00041542793,0.0000031099935],"genre_scores_gemma":[0.39188653,0.000015509597,0.60581297,0.0013703929,0.0008364238,0.00004268637,0.00000763476,0.000027147757,6.881291e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942483,0.00012702079,0.0006705674,0.0030515094,0.00072230917,0.0011802936],"domain_scores_gemma":[0.9965875,0.0009515664,0.000325114,0.0014417138,0.00024218322,0.00045190912],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011396661,0.0007317615,0.00085321156,0.00050387287,0.0004506396,0.0015358259,0.004320759,0.00042240252,0.000001026624],"category_scores_gemma":[0.00038285094,0.0006402859,0.00022266373,0.0013766239,0.00073793094,0.00030889548,0.0067861914,0.0017337184,0.0000029030657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016634385,0.00008580661,0.00009791197,0.00021971771,0.000021483067,0.000047304355,0.0016385423,0.06822779,0.001274129,0.0019778244,0.000034920708,0.9263579],"study_design_scores_gemma":[0.00047901794,0.00032633686,0.0005489867,0.00017312758,0.000008940029,0.000051617728,4.4708202e-7,0.8895568,0.0018181371,0.10612905,0.00021344084,0.00069407583],"about_ca_topic_score_codex":0.000055541157,"about_ca_topic_score_gemma":0.000023307428,"teacher_disagreement_score":0.9256638,"about_ca_system_score_codex":0.00014530675,"about_ca_system_score_gemma":0.0008272561,"threshold_uncertainty_score":0.9996048},"labels":[],"label_agreement":null},{"id":"W3006412606","doi":"10.1103/prxquantum.2.010345","title":"Quantifying Quantum Speedups: Improved Classical Simulation From Tighter Magic Monotones","year":2021,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Nanyang Technological University; University of Sheffield; Government of Canada","keywords":"Computer science; Qubit; Quantum computer; MAGIC (telescope); Algorithm; Computation; Monotone polygon; Quantum; Scaling; Theoretical computer science; Mathematics; Quantum mechanics","score_opus":0.03191164419298244,"score_gpt":0.2826292697587371,"score_spread":0.25071762556575466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006412606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45166212,0.000751833,0.5413071,0.003413671,0.0019295303,0.00019531035,0.000015812499,0.00052916154,0.00019546515],"genre_scores_gemma":[0.9529052,0.000026269283,0.04557235,0.0006143462,0.0006415658,0.000008086048,0.000041299263,0.000044753415,0.00014612282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965993,0.0002867455,0.00063171063,0.0012135463,0.000530956,0.0007377389],"domain_scores_gemma":[0.99742204,0.00067893,0.00023870861,0.0011663239,0.00023160542,0.00026237324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032238621,0.00043061026,0.0005024503,0.00015677875,0.00033353092,0.0006367612,0.00096437393,0.00021040172,0.000079285644],"category_scores_gemma":[0.00020079505,0.00038575116,0.00026773504,0.0006836356,0.00008863721,0.0005077594,0.0006679347,0.0006101152,0.00028238734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027690514,0.0020798754,0.008113026,0.0003236581,0.000629617,0.0018197092,0.00881136,0.13963142,0.12041214,0.3971137,0.002653417,0.31813514],"study_design_scores_gemma":[0.0005529308,0.000108814274,0.0049974555,0.00008390242,0.00002131372,0.000028401582,0.00004729175,0.9478634,0.003224797,0.035917453,0.0066347527,0.0005194599],"about_ca_topic_score_codex":0.00010998309,"about_ca_topic_score_gemma":0.000022539134,"teacher_disagreement_score":0.808232,"about_ca_system_score_codex":0.000059786722,"about_ca_system_score_gemma":0.00019505162,"threshold_uncertainty_score":0.99985945},"labels":[],"label_agreement":null},{"id":"W3007636846","doi":"10.1103/physreva.102.012215","title":"Topological transition of a non-Markovian dissipative quantum walk","year":2020,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; European Commission; Villum Fonden","keywords":"Dissipative system; Transition (genetics); Quantum walk; Statistical physics; Topology (electrical circuits); Quantum; Physics; Theoretical physics; Quantum mechanics; Mathematics; Quantum computer; Combinatorics","score_opus":0.01572992022299696,"score_gpt":0.3346155929951761,"score_spread":0.31888567277217916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007636846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33844072,0.04798511,0.5521191,0.056361225,0.00024789915,0.002894809,0.000068000874,0.00044816054,0.0014349945],"genre_scores_gemma":[0.9702848,0.01637074,0.0036520797,0.009039765,0.0005439227,0.000063165964,0.000019037714,0.000023936136,0.0000025395516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963799,0.0005036008,0.000758762,0.000997686,0.0007963433,0.00056367693],"domain_scores_gemma":[0.99757814,0.0005418839,0.0004137182,0.0007789611,0.00017652972,0.00051078293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032656852,0.0005203913,0.0018460208,0.00003367964,0.00012398874,0.00004210049,0.0013406607,0.00004640805,0.00002596382],"category_scores_gemma":[0.0006096037,0.00036348114,0.0010651097,0.0013252547,0.00021805824,0.00026915278,0.00030446769,0.00068544305,0.00015488818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007840178,0.0026907085,0.000064898275,0.027553378,0.0002511139,0.00013392743,0.0034629975,0.0003678077,0.02259536,0.08454609,0.0036358116,0.8546195],"study_design_scores_gemma":[0.00048987503,0.0015723018,0.0013444345,0.013265968,0.0002750749,0.000013798913,0.000009869926,0.9235566,0.0040534562,0.049541812,0.0050039883,0.00087276666],"about_ca_topic_score_codex":0.000016115779,"about_ca_topic_score_gemma":4.923015e-7,"teacher_disagreement_score":0.92318887,"about_ca_system_score_codex":0.000025269983,"about_ca_system_score_gemma":0.00009004652,"threshold_uncertainty_score":0.99988174},"labels":[],"label_agreement":null},{"id":"W3007806070","doi":"10.1088/2058-9565/ab98a5","title":"Towards scalable bosonic quantum error correction","year":2020,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 European Research Council; Institut Périmètre de physique théorique; Industry Canada; QuantERA; Ministero dello Sviluppo Economico; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Government of Canada","keywords":"Qubit; Error detection and correction; Scalability; Quantum error correction; Decoding methods; Quantum computer; Quantum decoherence","score_opus":0.014017399931069485,"score_gpt":0.24538450320575872,"score_spread":0.23136710327468923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007806070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74499327,0.0005592727,0.19478251,0.055644117,0.0015171183,0.00026007168,0.0000019402692,0.0017335496,0.00050815195],"genre_scores_gemma":[0.9888201,0.000040321578,0.01000587,0.0010025945,0.000085186264,0.000010134005,3.7985785e-7,0.000010279453,0.000025139396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975282,0.000029741223,0.00026930938,0.0009614591,0.0005244339,0.0006868441],"domain_scores_gemma":[0.9988255,0.000041519474,0.00011878713,0.0005185696,0.00024716096,0.00024850044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000577704,0.0002128927,0.00027109156,0.00046889205,0.00069671066,0.00027009533,0.0017487885,0.00014390696,0.000007057999],"category_scores_gemma":[0.00048871926,0.00018085411,0.000037651273,0.0046828585,0.0010038734,0.00050803594,0.0009650484,0.00045831758,0.00006531482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010791366,0.00008987888,0.0008611964,0.00005049112,0.000015817925,0.000072334005,0.0010380581,0.00024059198,0.030601306,0.64376134,0.0019807427,0.32127747],"study_design_scores_gemma":[0.00020226536,0.0005022087,0.0004485856,0.000024671855,0.0000042059633,0.00015427743,0.0001660373,0.9535323,0.010734664,0.028795125,0.005183563,0.0002521387],"about_ca_topic_score_codex":0.000040895324,"about_ca_topic_score_gemma":0.000003825955,"teacher_disagreement_score":0.95329165,"about_ca_system_score_codex":0.00004564979,"about_ca_system_score_gemma":0.00046696616,"threshold_uncertainty_score":0.7375017},"labels":[],"label_agreement":null},{"id":"W3009023057","doi":"10.1145/3512751","title":"Quantum Distributed Complexity of Set Disjointness on a Line","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Upper and lower bounds; Combinatorics; Mathematics; Bounded function; Vertex (graph theory); Path (computing); Constant (computer programming); Qubit; Binary logarithm; Discrete mathematics; Omega; Quantum; Computer science; Graph; Physics","score_opus":0.040581357940703666,"score_gpt":0.28553384448068175,"score_spread":0.2449524865399781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009023057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066477396,0.000015891412,0.9300806,0.0019668953,0.0006590902,0.00020015766,0.00028083037,0.0002753295,0.00004381067],"genre_scores_gemma":[0.98074144,0.0000015433014,0.018705849,0.00036645745,0.000029025688,0.000029133613,0.000074960706,0.000016329972,0.000035268782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783283,0.00060309435,0.00037915292,0.00044642735,0.0004932931,0.00024519934],"domain_scores_gemma":[0.9980561,0.00085935945,0.00019668657,0.0007160202,0.0000884682,0.00008335034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006263256,0.00019999186,0.0002582298,0.00026758472,0.0007088485,0.000047616748,0.0010170552,0.000035735826,0.00008208127],"category_scores_gemma":[0.000040267536,0.00019472785,0.00016662892,0.00085428514,0.00014951904,0.000094022,0.00007955408,0.00048730674,0.000014331981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009684522,0.0004079163,0.0000020332866,0.0000146292305,0.000036087877,0.00000703477,0.00080678845,0.8211753,0.000058017195,0.089286946,0.00005543653,0.08805299],"study_design_scores_gemma":[0.000514579,0.00072423817,0.00030582887,0.00001967628,0.000010555852,0.00002755139,0.00013631376,0.73260564,0.0008117092,0.2644335,0.0002299078,0.00018049941],"about_ca_topic_score_codex":0.000016911112,"about_ca_topic_score_gemma":0.0000016286936,"teacher_disagreement_score":0.914264,"about_ca_system_score_codex":0.0000746245,"about_ca_system_score_gemma":0.00007227298,"threshold_uncertainty_score":0.7940771},"labels":[],"label_agreement":null},{"id":"W3009633650","doi":"10.48550/arxiv.1907.13022","title":"Efficient learning of quantum noise","year":2019,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office","keywords":"Qubit; Computer science; Quantum computer; Quantum error correction; Noise (video); Computer engineering; Quantum technology; Quantum noise; Quantum; Theoretical computer science; Topology (electrical circuits); Electronic engineering; Physics; Quantum mechanics; Open quantum system; Electrical engineering; Artificial intelligence; Engineering","score_opus":0.012918067747564394,"score_gpt":0.21647267800694328,"score_spread":0.20355461025937888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009633650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50297093,0.00007455303,0.4677472,0.00051817833,0.0002585372,0.00030833652,0.000012469842,0.0010513827,0.027058383],"genre_scores_gemma":[0.99701995,0.000005133383,0.0022876167,0.000040157523,0.00004613269,5.6870344e-9,0.000038858187,0.00030552802,0.0002565969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985338,0.0002358612,0.00020668095,0.00037290028,0.00035867735,0.00029210927],"domain_scores_gemma":[0.99897003,0.00003750997,0.00012036863,0.0004866901,0.00028595916,0.00009946217],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00060263794,0.00010557809,0.00014024103,0.00019041207,0.0007520023,0.0003310686,0.0014155444,0.000036967725,0.00090747635],"category_scores_gemma":[0.00018824828,0.00010158875,0.0000581642,0.0005929127,0.00006276266,0.00007177729,0.0015276741,0.000278673,0.0031287617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004647719,0.00038802242,0.000040059553,0.00021315731,0.00006308106,0.000021830185,0.0066377516,0.29845467,0.03156001,0.20781365,0.009168407,0.44559288],"study_design_scores_gemma":[0.00026355585,0.00025431378,0.0005746936,0.000034025543,0.0000021387934,0.0000484184,0.00006266825,0.78962934,0.00053723104,0.0001779319,0.20829722,0.00011845806],"about_ca_topic_score_codex":0.0000065706085,"about_ca_topic_score_gemma":5.4721863e-9,"teacher_disagreement_score":0.494049,"about_ca_system_score_codex":0.000034891713,"about_ca_system_score_gemma":0.0000037816098,"threshold_uncertainty_score":0.9976474},"labels":[],"label_agreement":null},{"id":"W3010243192","doi":"10.4230/oasics.parma-ditam.2026.5","title":"LAMINA: An MLIR-Based Translation Library for Heterogeneous Quantum-Classical Compilation","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":312,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Regional Municipality of Waterloo; University of Waterloo","funders":"","keywords":"Quantum machine learning; Computer science; Quantum computer; Quantum; Quantum algorithm; Quantum network; Reinforcement learning; Artificial intelligence; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.08288720027025945,"score_gpt":0.20480675272361545,"score_spread":0.121919552453356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010243192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16183041,0.0000450634,0.8350265,0.0012383325,0.00043849583,0.00046200253,0.00011401263,0.0007736985,0.00007149659],"genre_scores_gemma":[0.9545471,0.000009834024,0.0444228,0.00030806506,0.00025594435,0.000002190623,0.0003703843,0.000041978932,0.000041678457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997741,0.00021244863,0.00025538198,0.0013227942,0.00011784785,0.0003505345],"domain_scores_gemma":[0.99840504,0.00024129414,0.00023550472,0.0007984136,0.000066575354,0.0002531552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011869123,0.00037013608,0.0003791139,0.00019826292,0.00024348861,0.00025537235,0.0014403308,0.0003028352,0.00000785834],"category_scores_gemma":[0.000012068484,0.0004181327,0.00031617322,0.0004215563,0.00008057497,0.0004026188,0.00045331285,0.0005166198,0.000013004968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008966315,0.00013715905,0.00012622259,0.00012864111,0.00004073949,0.00012050678,0.0002137204,0.9572304,0.00009948022,0.0324565,0.00017244126,0.009184551],"study_design_scores_gemma":[0.0006345576,0.00030570308,0.00028607,0.000063439,0.000043090335,0.000003922294,0.000005433696,0.9556286,0.00038511102,0.04041,0.0017815462,0.00045254407],"about_ca_topic_score_codex":0.000007716851,"about_ca_topic_score_gemma":0.0000053696667,"teacher_disagreement_score":0.79271674,"about_ca_system_score_codex":0.00005135365,"about_ca_system_score_gemma":0.00025029408,"threshold_uncertainty_score":0.999827},"labels":[],"label_agreement":null},{"id":"W3011913491","doi":"10.22331/qv-2020-03-17-32","title":"A non-review of Quantum Machine Learning: trends and explorations","year":2020,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Creative Destruction Lab; University of Toronto; Perimeter Institute","funders":"","keywords":"Quantum machine learning; Quantum; Artificial intelligence; Computer science; Cognitive science; Psychology; Quantum computer; Physics; Quantum mechanics","score_opus":0.022298945737478617,"score_gpt":0.2531538082403321,"score_spread":0.2308548625028535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011913491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042766226,0.007039039,0.939155,0.047565375,0.00007118852,0.00007659744,0.00000211446,0.00019961386,0.0016144529],"genre_scores_gemma":[0.9305936,0.0023970583,0.06212272,0.004508209,0.00008975749,0.000006384905,0.00000847183,0.000012358129,0.00026144422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934787,0.000032329648,0.00017564578,0.00021252988,0.00012616989,0.00010544603],"domain_scores_gemma":[0.9996202,0.000038928254,0.00006586481,0.00014871274,0.0000325397,0.00009376311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010552548,0.00008568224,0.00017373647,0.000046334324,0.000064316984,0.000028784028,0.00026809573,0.000015689153,0.000028775741],"category_scores_gemma":[0.000037283215,0.00006429224,0.0000466174,0.00049134187,0.000023345232,0.00009365508,0.00019888929,0.00012809467,0.000006745104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059221734,0.000120929995,0.0011352623,0.0023177825,0.000056816563,0.000023550725,0.0046631,0.0029885431,0.0011531276,0.07804584,0.00838622,0.9011029],"study_design_scores_gemma":[0.000111539586,0.00017604907,0.00037807395,0.00019206651,0.0000043211685,0.000007058725,0.0000064117708,0.9891005,0.000116575444,0.00015338615,0.009671141,0.00008286064],"about_ca_topic_score_codex":0.000010518801,"about_ca_topic_score_gemma":7.86685e-7,"teacher_disagreement_score":0.986112,"about_ca_system_score_codex":0.0000017046065,"about_ca_system_score_gemma":0.000018529257,"threshold_uncertainty_score":0.26217613},"labels":[],"label_agreement":null},{"id":"W3011981544","doi":"10.1007/s11128-020-02632-6","title":"Coding in the entanglement domain","year":2020,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Quantum entanglement; Quantum computer; Computer science; Coding (social sciences); Theoretical computer science; Physics; Quantum mechanics; Quantum; Mathematics; Statistics","score_opus":0.015212304586149548,"score_gpt":0.23673335600843218,"score_spread":0.22152105142228262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011981544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050421577,0.00006114447,0.93230367,0.015400627,0.00009400066,0.00015794493,9.905615e-7,0.00015059875,0.0014094637],"genre_scores_gemma":[0.9730554,0.0000023976302,0.019391172,0.007474347,0.00006011617,0.000008752415,0.000004475735,0.0000026763473,6.210536e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895155,0.0000526838,0.00033554496,0.00011832639,0.00032739303,0.00021450025],"domain_scores_gemma":[0.99958897,0.00004210005,0.00014275766,0.00014327178,0.000036367175,0.000046526668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046648484,0.00009941063,0.00009003359,0.00007650085,0.00021616422,0.00053277204,0.00070455275,0.000026079926,0.0000037359284],"category_scores_gemma":[0.000039444254,0.00006858866,0.000029503586,0.00064947637,0.00001873452,0.001394102,0.00011751512,0.00019592048,0.000037075664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010970321,0.000038641992,0.00042881854,0.00024259154,0.000005332868,0.000015909083,0.17438717,0.00883775,0.00012530347,0.18384214,0.0011664188,0.63089895],"study_design_scores_gemma":[0.00024551118,0.00004472849,0.00048772962,0.000042310257,9.1556586e-7,0.000015528101,0.0015065538,0.9806507,0.00008696878,0.0038941572,0.012914011,0.00011086309],"about_ca_topic_score_codex":0.000003281231,"about_ca_topic_score_gemma":4.876136e-7,"teacher_disagreement_score":0.97181296,"about_ca_system_score_codex":0.000020569396,"about_ca_system_score_gemma":0.00005666904,"threshold_uncertainty_score":0.5137533},"labels":[],"label_agreement":null},{"id":"W3012933170","doi":"10.1103/physreva.103.052435","title":"Variationally scheduled quantum simulation","year":2021,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Quantum annealing; Quantum; Computer science; Quantum computer; Quantum simulator; Coherence (philosophical gambling strategy); Ising model; Eigenvalues and eigenvectors; Statistical physics; Quantum mechanics; Physics","score_opus":0.01581753342892157,"score_gpt":0.3543270231512226,"score_spread":0.33850948972230105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012933170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06430641,0.11709747,0.79549474,0.018817939,0.0006079833,0.0014004272,0.000020955176,0.00060871197,0.0016453736],"genre_scores_gemma":[0.9332556,0.0323659,0.017961176,0.014430692,0.0016206781,0.00013714725,0.000080231046,0.00006498311,0.00008358416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959423,0.00060633355,0.0007036908,0.0010922644,0.0010728205,0.0005825971],"domain_scores_gemma":[0.9963176,0.0011120681,0.0003715999,0.001343823,0.00052941166,0.00032547663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005613685,0.0004760014,0.0012745117,0.000043844004,0.00022065622,0.00015113347,0.0010684042,0.000041208496,0.000033336048],"category_scores_gemma":[0.0016602093,0.00038209007,0.00083946576,0.001626926,0.00006726734,0.0004037971,0.00058670674,0.00060332956,0.0006443991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073322803,0.002286385,0.00005961208,0.009038024,0.00019485407,0.0001130843,0.00021960249,0.008693708,0.010902032,0.7076105,0.0028308793,0.258044],"study_design_scores_gemma":[0.00021598148,0.000093323186,0.0006435648,0.006505649,0.0001311905,0.000016067084,6.670091e-7,0.8553995,0.0009505827,0.10809271,0.027458612,0.00049214455],"about_ca_topic_score_codex":0.0000040195387,"about_ca_topic_score_gemma":5.986111e-7,"teacher_disagreement_score":0.8689492,"about_ca_system_score_codex":0.00006273741,"about_ca_system_score_gemma":0.0002947678,"threshold_uncertainty_score":0.9998631},"labels":[],"label_agreement":null},{"id":"W3013795241","doi":"10.4230/dagrep.9.10.47","title":"Quantum Cryptanalysis (Dagstuhl Seminar 19421)","year":2020,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Illinois at Urbana-Champaign; National Institute of Standards and Technology; Universidad de León; Infineon Technologies; Ruhr-Universität Bochum; Université Paris Diderot; Université de Limoges; Universidad del Atlántico; University of Oxford; Sorbonne Université; University of Waterloo; Universidad Rey Juan Carlos; University of Cincinnati; Royal Holloway, University of London; Kungliga Tekniska Högskolan; Technische Universität Darmstadt; California Institute of Technology; University of South Florida; Immanuel Kant Baltic Federal University; Florida Atlantic University; Institut national de recherche en informatique et en automatique (INRIA); Microsoft","keywords":"Cryptanalysis; Computer science; Computer security; Cryptography","score_opus":0.009593295081138457,"score_gpt":0.2350014193117031,"score_spread":0.22540812423056464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013795241","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028892478,0.0010236041,0.8401135,0.0024670563,0.0045843534,0.0024356837,0.0018920657,0.0031609454,0.14403382],"genre_scores_gemma":[0.018162062,0.0012236865,0.7614091,0.014682579,0.008750619,0.00067709544,0.0050894725,0.003962043,0.18604335],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942238,0.00011101199,0.0017757467,0.0010766308,0.0012654355,0.001547403],"domain_scores_gemma":[0.995088,0.00022300702,0.001530973,0.0023223436,0.00017826995,0.00065743853],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.00056175195,0.0013832892,0.0017033323,0.0010632414,0.00047338242,0.0010272836,0.004331475,0.00087860145,0.00020084744],"category_scores_gemma":[0.00009079677,0.0012264915,0.001086913,0.0012999793,0.00021535734,0.0005777065,0.0016745647,0.0014421951,0.0008494031],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044131495,0.00036836433,0.0001473406,0.0021849226,0.0014270933,0.000104188905,0.0054713837,0.0005548862,0.000019559631,0.012986246,0.9274579,0.049233977],"study_design_scores_gemma":[0.0010526215,0.00024156878,0.000013720709,0.0005502747,0.00012322183,0.000073385316,0.00012041677,0.36770007,0.000047779264,0.0007730694,0.62823105,0.0010727996],"about_ca_topic_score_codex":0.00008552697,"about_ca_topic_score_gemma":0.000023929915,"teacher_disagreement_score":0.36714518,"about_ca_system_score_codex":0.00014437304,"about_ca_system_score_gemma":0.00023229963,"threshold_uncertainty_score":0.99992853},"labels":[],"label_agreement":null},{"id":"W3013823205","doi":"10.1103/physreva.103.062404","title":"Efficiently computing logical noise in quantum error-correcting codes","year":2021,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canada First Research Excellence Fund; Government of Ontario; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Quantum error correction; Computer science; Quantum computer; Error detection and correction; Qubit; Algorithm; Noise (video); Quantum noise; Quantum convolutional code; Quantum algorithm; Theoretical computer science; Quantum; Quantum mechanics; Physics","score_opus":0.021525357106878144,"score_gpt":0.3494987552559772,"score_spread":0.32797339814909904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013823205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7766431,0.10306818,0.11117072,0.00594773,0.00069129915,0.0011394719,0.000009753548,0.00049049384,0.00083926134],"genre_scores_gemma":[0.9744285,0.013687341,0.0049334727,0.0060429443,0.0007617605,0.000051987143,0.000021065534,0.000051706433,0.000021252274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99374706,0.0011392559,0.0011129508,0.0017116651,0.0010991708,0.0011898986],"domain_scores_gemma":[0.99567544,0.0016875035,0.00047610753,0.0014171038,0.00030471722,0.00043913623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011809956,0.00072745007,0.0022587234,0.000088442845,0.0002889279,0.0001905098,0.0016419119,0.000064503125,0.000013607569],"category_scores_gemma":[0.0021219116,0.00057263556,0.0010235299,0.0029164015,0.00016245244,0.00026549026,0.0013483352,0.0014025442,0.0003290957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001709948,0.0057620825,0.0012216441,0.018621283,0.00013212954,0.0009394878,0.001184492,0.0069875927,0.017730612,0.070476405,0.0030896463,0.87383753],"study_design_scores_gemma":[0.00041015216,0.00020706427,0.0019559518,0.024927618,0.00010664367,0.0001447753,0.000015644715,0.94789714,0.0030682387,0.014195055,0.006090396,0.0009813489],"about_ca_topic_score_codex":0.000024485313,"about_ca_topic_score_gemma":0.0000050987496,"teacher_disagreement_score":0.9409095,"about_ca_system_score_codex":0.00011626808,"about_ca_system_score_gemma":0.00022690502,"threshold_uncertainty_score":0.99967253},"labels":[],"label_agreement":null},{"id":"W3014422752","doi":"10.1080/03081087.2020.1748852","title":"Higher rank matricial ranges and hybrid quantum error correction","year":2020,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"University of Waterloo; Mitacs; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; African Institute for Mathematical Sciences; Simons Foundation","keywords":"Hilbert space; Mathematics; Quantum; Quantum channel; Quantum error correction; Error detection and correction; Rank (graph theory); Dimension (graph theory); Operator (biology); SIC-POVM; Range (aeronautics); Pure mathematics; Discrete mathematics; Algorithm; Quantum information; Quantum operation; Quantum mechanics; Combinatorics; Physics","score_opus":0.016936862776109476,"score_gpt":0.24725654482730117,"score_spread":0.2303196820511917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014422752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83636147,0.0012343992,0.15279275,0.006753367,0.0018705677,0.0002786329,0.00001299173,0.0005803738,0.00011546791],"genre_scores_gemma":[0.97270125,0.00009297563,0.02440675,0.0014679314,0.0011442043,0.000004083704,0.0000068364684,0.000023566097,0.00015240614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871844,0.00006865343,0.00022508537,0.00052597385,0.00018707005,0.0002747672],"domain_scores_gemma":[0.9993559,0.00011519829,0.00007073433,0.00018105673,0.000048509268,0.00022856933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013451517,0.00020974352,0.00025510672,0.000063591244,0.00020502719,0.00013125585,0.00024185296,0.00006731556,0.000012691387],"category_scores_gemma":[0.00006326528,0.00017711859,0.000063003514,0.00021895426,0.00007354855,0.00015050003,0.00025745976,0.0002852453,0.000028790286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035245423,0.00024451336,0.0015526869,0.0003435947,0.00015029256,0.0002504284,0.0063553494,0.0027669398,0.009375753,0.0056562806,0.009535801,0.9634159],"study_design_scores_gemma":[0.00081801787,0.00017013389,0.0021997767,0.000015638796,0.000013289536,0.000044645833,0.000023136114,0.9792264,0.002413735,0.00025098998,0.014596216,0.00022801528],"about_ca_topic_score_codex":0.0000433001,"about_ca_topic_score_gemma":0.000002061076,"teacher_disagreement_score":0.97645944,"about_ca_system_score_codex":0.0000052794085,"about_ca_system_score_gemma":0.000024725243,"threshold_uncertainty_score":0.72226864},"labels":[],"label_agreement":null},{"id":"W3014455327","doi":"10.4230/lipics.tqc.2020.7","title":"Beyond Product State Approximations for a Quantum Analogue of Max Cut","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Maximum cut; Semidefinite programming; Hamiltonian (control theory); Qubit; Mathematics; Bounded function; Eigenvalues and eigenvectors; Relaxation (psychology); Quantum; Upper and lower bounds; Quantum computer; Graph; Product (mathematics); Discrete mathematics; Combinatorics; Quantum mechanics; Mathematical optimization; Mathematical analysis; Physics","score_opus":0.016616981657599762,"score_gpt":0.24280658669256847,"score_spread":0.2261896050349687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014455327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081760354,0.00005400921,0.9111961,0.0028991026,0.0005753734,0.0017203339,0.0011660438,0.00026894806,0.00035970222],"genre_scores_gemma":[0.6774178,0.000014720355,0.31955397,0.0019040114,0.00030851088,0.00017717428,0.00046697265,0.000057968122,0.000098852266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718314,0.000038022703,0.0012082647,0.0004186828,0.00044589085,0.0007059925],"domain_scores_gemma":[0.9977794,0.00016228908,0.00063079223,0.0007440741,0.00042011126,0.0002632756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000503216,0.00038060432,0.0005699281,0.00022371042,0.00032949634,0.00027561226,0.0014449606,0.00009416576,0.00000451546],"category_scores_gemma":[0.0002079612,0.00033080083,0.00033360577,0.0006364783,0.00012074241,0.0008551753,0.000472593,0.0003333647,0.000021689564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066336425,0.0023482074,0.002806056,0.015628729,0.0017196668,0.00002344952,0.20874795,0.067246325,0.0022062098,0.35328287,0.062444136,0.28288305],"study_design_scores_gemma":[0.0016327404,0.00052997057,0.00018081743,0.00007815306,0.000024288773,0.000023814087,0.00024636058,0.9649373,0.0022200928,0.007906501,0.021801038,0.00041888963],"about_ca_topic_score_codex":0.0000096136255,"about_ca_topic_score_gemma":0.0000053908016,"teacher_disagreement_score":0.897691,"about_ca_system_score_codex":0.000036535246,"about_ca_system_score_gemma":0.00014925278,"threshold_uncertainty_score":0.9999144},"labels":[],"label_agreement":null},{"id":"W3015507510","doi":"10.1103/physrevlett.122.220501","title":"Novel Technique for Robust Optimal Algorithmic Cooling","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Sharif University of Technology; Canada Foundation for Innovation; Government of Canada","keywords":"Computer science; Limit (mathematics); Mathematical optimization; Algorithm; Mathematics","score_opus":0.015960434908540426,"score_gpt":0.2693623157633232,"score_spread":0.25340188085478277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015507510","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076956437,0.00068224006,0.98552203,0.00460548,0.00022374436,0.0010807156,0.000005122948,0.00015544037,0.000029598983],"genre_scores_gemma":[0.037934378,0.00013213695,0.9412147,0.019873079,0.0005616952,0.00022313911,0.0000079363845,0.000035662062,0.000017300164],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862033,0.000036476606,0.00022061009,0.0005078565,0.00022872763,0.00038597273],"domain_scores_gemma":[0.99899167,0.00022685734,0.00011275585,0.00053610327,0.000046731944,0.000085909625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030893495,0.00020970489,0.00039690838,0.000043082408,0.00008011921,0.00006904036,0.0008396929,0.000013473729,0.0000030698316],"category_scores_gemma":[0.000033122404,0.00017079854,0.00026257313,0.00030154682,0.000029408233,0.00015305182,0.00021261547,0.00024317025,0.000059695853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016880233,0.00060968776,0.000028140457,0.005526956,0.00014688753,0.000026772439,0.00043234008,0.27028564,0.52382535,0.01638849,0.009660285,0.17305258],"study_design_scores_gemma":[0.00022238812,0.00008052683,0.000038224185,0.0009600411,0.000014768485,0.00003194576,4.9849564e-7,0.9904628,0.0016286987,0.00014258908,0.0061507174,0.00026683928],"about_ca_topic_score_codex":0.0000034131006,"about_ca_topic_score_gemma":3.8772416e-8,"teacher_disagreement_score":0.7201771,"about_ca_system_score_codex":0.000027878466,"about_ca_system_score_gemma":0.000027722388,"threshold_uncertainty_score":0.6964962},"labels":[],"label_agreement":null},{"id":"W3015528244","doi":"10.1007/978-3-030-36744-2_20","title":"Spin Chains, Graphs and State Revival","year":2020,"lang":"en","type":"book-chapter","venue":"Tutorials, schools, and workshops in the mathematical sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Kravchuk polynomials; Mathematics; Quantum walk; Relation (database); Recurrence relation; Combinatorics; Spin (aerodynamics); Spin network; Quantum; Orthogonal polynomials; Quantum mechanics; Discrete mathematics; Pure mathematics; Physics; Discrete orthogonal polynomials; Computer science; Quantum computer; Macdonald polynomials; Quantum gravity; Loop quantum gravity","score_opus":0.023465540032783914,"score_gpt":0.25805154535079433,"score_spread":0.2345860053180104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015528244","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027371883,0.07143988,0.21905008,0.15858245,0.018005187,0.009985437,0.00015581622,0.0028286905,0.4925806],"genre_scores_gemma":[0.3950893,0.023316916,0.48936328,0.01560567,0.014671313,0.0002678852,0.00003234742,0.0004351829,0.0612181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969017,0.00016185515,0.0006394338,0.000932934,0.0008891338,0.00047493033],"domain_scores_gemma":[0.9980841,0.00088051317,0.00026916192,0.0005102877,0.000035698475,0.0002202248],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002945058,0.00045583086,0.00070627674,0.00016309036,0.00047210758,0.0011600823,0.0017438873,0.00019116426,0.000019428413],"category_scores_gemma":[0.00040087488,0.0002726131,0.000115344665,0.0003144142,0.0006289419,0.00021577775,0.0007326622,0.0009621267,0.00002968075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039179595,0.000014865497,0.0000048838024,0.00009391045,0.000012200468,0.000037192924,0.0010517524,0.000029519217,0.0000029727425,0.9667095,0.0009101636,0.031129098],"study_design_scores_gemma":[0.00018001125,0.0001486465,0.00004168307,0.0008328603,0.000018307317,0.000071348564,0.00006752301,0.021717926,0.0000023748346,0.9703705,0.006145988,0.00040285068],"about_ca_topic_score_codex":0.000007815978,"about_ca_topic_score_gemma":0.000004084759,"teacher_disagreement_score":0.43136248,"about_ca_system_score_codex":0.00001889946,"about_ca_system_score_gemma":0.00010953618,"threshold_uncertainty_score":0.9999726},"labels":[],"label_agreement":null},{"id":"W3016409050","doi":"10.1038/s41598-021-81138-2","title":"Cellular automaton decoders for topological quantum codes with noisy measurements and beyond","year":2021,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Simons Foundation","keywords":"Computer science; Algorithm; Toric code; Cellular automaton; Quantum; Theoretical computer science; Qubit; Quantum error correction; Low-density parity-check code; Lattice (music); Decoding methods; Topology (electrical circuits); Quantum computer; Mathematics; Physics; Quantum mechanics","score_opus":0.020022396463969944,"score_gpt":0.24430441446563364,"score_spread":0.2242820180016637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016409050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5910603,0.0003869097,0.40414846,0.0009453444,0.0028196848,0.00021543534,0.0000014906401,0.00018089582,0.00024148876],"genre_scores_gemma":[0.83986664,0.0000017922788,0.1595549,0.00017333019,0.00005075345,0.00001666698,0.000019987407,0.000011614963,0.0003043319],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754274,0.000063414904,0.00032141854,0.0011083889,0.00055433146,0.0004097076],"domain_scores_gemma":[0.9985138,0.00007443809,0.000176722,0.0007960484,0.00027389888,0.00016509395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011965359,0.00017380838,0.00022946786,0.000087012195,0.00061564316,0.00077351124,0.000259874,0.00006160522,0.000007519162],"category_scores_gemma":[0.00011925322,0.00012897346,0.000071827824,0.0004320247,0.00023708408,0.00016020298,0.00022779554,0.000105739164,0.0000019704623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014459336,0.0029130897,0.04657636,0.0012177834,0.00094823714,0.023422422,0.018838078,0.043789167,0.43368015,0.102644295,0.06893458,0.25689125],"study_design_scores_gemma":[0.0005899503,0.00026166992,0.001116789,0.00009988931,0.000036789967,0.002415755,0.00017935969,0.73896235,0.1235747,0.10853536,0.02356134,0.0006660553],"about_ca_topic_score_codex":0.000006692914,"about_ca_topic_score_gemma":0.000015698868,"teacher_disagreement_score":0.6951732,"about_ca_system_score_codex":0.000021843176,"about_ca_system_score_gemma":0.0002113428,"threshold_uncertainty_score":0.7458987},"labels":[],"label_agreement":null},{"id":"W3016847581","doi":"10.1103/physrevlett.125.170504","title":"Effective Gaps Are Not Effective: Quasipolynomial Classical Simulation of Obstructed Stoquastic Hamiltonians","year":2020,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Laboratory; Air Force Research Laboratory; Air Force Office of Scientific Research; U.S. Department of Energy; Advanced Scientific Computing Research; Multidisciplinary University Research Initiative; Army Research Office; Basic Energy Sciences; Institut Périmètre de physique théorique; Booz Allen Hamilton; Industry Canada; Ontario Ministry of Economic Development and Innovation; National Science Foundation; Government of Canada; Ministero dello Sviluppo Economico","keywords":"Homogeneous space; Hamiltonian (control theory); Subspace topology; Eigenvalues and eigenvectors; Quantum computer; Computation; Adiabatic process; Physics; Qubit; Discrete mathematics; Quantum mechanics; Mathematics; Combinatorics; Pure mathematics; Quantum; Algorithm; Mathematical analysis","score_opus":0.011344215862762347,"score_gpt":0.27222747885434295,"score_spread":0.2608832629915806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016847581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5478406,0.00090950564,0.43229973,0.017406922,0.00024103507,0.0010610676,0.000013294826,0.00021479084,0.000013052096],"genre_scores_gemma":[0.98625886,0.00003178935,0.0022525506,0.010911204,0.000486067,0.000035966274,0.0000034431175,0.00001963415,4.8176173e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785024,0.00043644075,0.00034067789,0.00060970295,0.00043829117,0.00032462875],"domain_scores_gemma":[0.997682,0.001366349,0.0002965493,0.00039084387,0.00007209144,0.00019216661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014907535,0.00028800982,0.0007362724,0.000041813848,0.00009120565,0.00004323745,0.0006150301,0.000022780418,0.0000024082049],"category_scores_gemma":[0.0004735286,0.00023628963,0.00032964267,0.0006363005,0.00012421852,0.00015207136,0.000234923,0.00043810782,0.000041409225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011733522,0.00046389867,0.00035673,0.005005849,0.00022860889,0.00008294047,0.0022616235,0.46308264,0.076305404,0.001839223,0.0014612981,0.44879445],"study_design_scores_gemma":[0.00041167616,0.00026074442,0.01258087,0.00095684634,0.00005623285,0.0000030601545,0.0000015955043,0.9830717,0.001352263,0.0000936604,0.00094014057,0.0002712014],"about_ca_topic_score_codex":0.000004704737,"about_ca_topic_score_gemma":3.0243328e-7,"teacher_disagreement_score":0.5199891,"about_ca_system_score_codex":0.00004720407,"about_ca_system_score_gemma":0.000023332203,"threshold_uncertainty_score":0.9635612},"labels":[],"label_agreement":null},{"id":"W3018379723","doi":"10.22331/q-2020-11-30-366","title":"Fast optimization of parametrized quantum optical circuits","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Quantum computer; Dimension (graph theory); Quantum gate; Quantum algorithm; Curse of dimensionality; Quantum circuit; Gradient descent; Photon; Quantum information","score_opus":0.02012748382313374,"score_gpt":0.23780966601996295,"score_spread":0.21768218219682922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018379723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086768806,0.000120423225,0.90923625,0.002761143,0.00034501168,0.00015224153,0.000004859466,0.00028397443,0.00032726442],"genre_scores_gemma":[0.916684,0.000010003438,0.08264054,0.0004939289,0.0001368199,0.0000037701943,0.000005390074,0.000018035782,0.0000075508497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981232,0.00009606809,0.0004488221,0.0005217843,0.0004373577,0.00037275354],"domain_scores_gemma":[0.9987741,0.0002253234,0.00018424074,0.00045017304,0.00011996181,0.00024618456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023076317,0.0002065676,0.0003724924,0.00012042284,0.00010082631,0.000102956954,0.0009667611,0.00009662277,0.00002156861],"category_scores_gemma":[0.00030194028,0.0001857017,0.00014121976,0.0010587955,0.000085630214,0.00018838361,0.0002861215,0.0002658054,0.000040622675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028046217,0.00023330719,0.00032955056,0.00012593363,0.00006575369,0.000050548806,0.002176753,0.63360584,0.006146012,0.2948994,0.0007783511,0.061560508],"study_design_scores_gemma":[0.00046362646,0.00033103846,0.000401098,0.00003013163,0.0000086498085,0.000012177947,0.0000270402,0.9943973,0.0015180488,0.002385535,0.00020480763,0.00022054174],"about_ca_topic_score_codex":0.0000074538543,"about_ca_topic_score_gemma":1.2344731e-7,"teacher_disagreement_score":0.82991517,"about_ca_system_score_codex":0.000014048749,"about_ca_system_score_gemma":0.000075853306,"threshold_uncertainty_score":0.75726956},"labels":[],"label_agreement":null},{"id":"W3019236876","doi":"10.22331/q-2021-04-15-432","title":"Combining hard and soft decoders for hypergraph product codes","year":2021,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; QuantERA; Agence Nationale de la Recherche","keywords":"Block code; Low-density parity-check code; Decoding methods; Ideal (ethics); BCJR algorithm; Tornado code; Concatenated error correction code; Turbo code; Context (archaeology); Encoding (memory)","score_opus":0.016649688031949033,"score_gpt":0.2445355190752923,"score_spread":0.22788583104334328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019236876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42886174,0.0017812529,0.5632266,0.0046989955,0.00088086684,0.00017227017,0.000007169392,0.00026658105,0.00010452011],"genre_scores_gemma":[0.8508782,0.000033808523,0.14815772,0.0006021375,0.00013955834,0.000015459767,0.000007012689,0.000017816055,0.00014832296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987325,0.000050970673,0.0001771845,0.0005585919,0.00014883626,0.00033189767],"domain_scores_gemma":[0.99910295,0.00022400227,0.00005956579,0.00041268885,0.0001051936,0.00009561178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026510863,0.00014793924,0.00020833345,0.00006406852,0.0002820349,0.00022082408,0.00032001914,0.000036531466,0.0000020137852],"category_scores_gemma":[0.00013995316,0.00013491987,0.000077050034,0.00025649753,0.00005944839,0.000124577,0.00019807545,0.00013236671,0.0000038828966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004226101,0.00031513016,0.0036664717,0.000341083,0.00019360957,0.00015209071,0.0043682638,0.0033501212,0.015771586,0.36942607,0.009102071,0.59327126],"study_design_scores_gemma":[0.000520382,0.00016284644,0.0020250035,0.00005949161,0.000011211491,0.00013807455,0.00006998933,0.943195,0.004824698,0.03695388,0.011738643,0.00030081323],"about_ca_topic_score_codex":0.000008007197,"about_ca_topic_score_gemma":0.000006095397,"teacher_disagreement_score":0.93984485,"about_ca_system_score_codex":0.0000071371915,"about_ca_system_score_gemma":0.00008626199,"threshold_uncertainty_score":0.5501873},"labels":[],"label_agreement":null},{"id":"W3021618250","doi":"","title":"Quantum computing: challenges and opportunities.","year":2019,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Quantum computer; Quantum; Physics; Quantum mechanics","score_opus":0.16007858408706188,"score_gpt":0.3763222587454258,"score_spread":0.21624367465836392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021618250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82670313,0.037437674,0.0068557826,0.11427185,0.003429752,0.005476431,0.0001264797,0.00022166091,0.005477257],"genre_scores_gemma":[0.99138504,0.0040374924,0.0035815001,0.000073106945,0.000043297056,0.00001801614,8.2306804e-7,0.000012933965,0.00084778515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776876,0.00039708166,0.000270881,0.0005380899,0.0005453302,0.00047984978],"domain_scores_gemma":[0.9951303,0.0017255188,0.000182688,0.0006221365,0.002252407,0.00008697206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010412472,0.00019840887,0.00040518606,0.00013328534,0.0004051854,0.00006773425,0.00096218096,0.000048354334,0.0000017309909],"category_scores_gemma":[0.0005925163,0.00012953271,0.00006213647,0.0004090861,0.00045474875,0.00013579249,0.0009863825,0.00030363302,0.0000036221538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076623866,0.000084634106,0.000027393857,0.00027188254,0.00011054082,0.000002367073,0.013782421,0.0014717517,0.0007475687,0.8014529,0.0004917802,0.18148018],"study_design_scores_gemma":[0.004902863,0.004345072,0.0015853986,0.0034910338,0.000023384473,0.000009459514,0.08998239,0.5978277,0.026336916,0.18703984,0.08325711,0.0011988782],"about_ca_topic_score_codex":9.76563e-7,"about_ca_topic_score_gemma":0.000008949872,"teacher_disagreement_score":0.614413,"about_ca_system_score_codex":0.0000556939,"about_ca_system_score_gemma":0.0002711842,"threshold_uncertainty_score":0.52821904},"labels":[],"label_agreement":null},{"id":"W3021819917","doi":"10.26434/chemrxiv.9991976","title":"On the Design of Molecular Excitonic Circuits for Quantum Computing: The Universal Quantum Gates","year":2019,"lang":"en","type":"preprint","venue":"ChemRxiv","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Chemistry; Natural Sciences and Engineering Research Council of Canada; Research Corporation for Scientific Advancement; National Science Foundation","keywords":"Electronic circuit; Unitary state; Quantum gate; Quantum computer; Logic gate; Computer science; Quantum; Unitary transformation; Encoding (memory); Quantum network; Physics; Topology (electrical circuits); Quantum mechanics; Mathematics; Algorithm","score_opus":0.026872947571372346,"score_gpt":0.24298023474111038,"score_spread":0.21610728716973804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021819917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16942881,0.00047288483,0.82388544,0.0033458327,0.0013788582,0.0012216553,0.0000046224923,0.0001515504,0.00011032631],"genre_scores_gemma":[0.9942798,0.000021642585,0.0049534095,0.00045586,0.00016717869,0.000024013218,0.000007626652,0.000048941336,0.000041541483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971696,0.0003415406,0.00046661135,0.0009426747,0.0005000761,0.00057949766],"domain_scores_gemma":[0.99408054,0.0028847856,0.00058935623,0.0021419348,0.00022376716,0.00007962362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012877194,0.0005033654,0.00055767887,0.00012816886,0.00030166082,0.00023380452,0.0042447643,0.00026414188,0.0000047764256],"category_scores_gemma":[0.00023516695,0.00030224884,0.0004482797,0.00034271978,0.00023342056,0.00004145677,0.0015608424,0.0009995458,0.000017596647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002019987,0.00013366816,0.000011650166,0.00027534054,0.00023826677,0.000014564698,0.001806173,0.5846334,0.0047109146,0.40130788,0.0024005189,0.004447411],"study_design_scores_gemma":[0.0002771934,0.00018653947,0.00007836576,0.00033655838,0.0000324449,0.000008522042,0.000046756508,0.90383464,0.012120595,0.082424596,0.00029849407,0.0003553082],"about_ca_topic_score_codex":0.000019672038,"about_ca_topic_score_gemma":1.9609396e-7,"teacher_disagreement_score":0.824851,"about_ca_system_score_codex":0.000062318955,"about_ca_system_score_gemma":0.00040944814,"threshold_uncertainty_score":0.99994296},"labels":[],"label_agreement":null},{"id":"W3021952315","doi":"10.1103/prxquantum.1.020304","title":"Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets","year":2020,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Sherbrooke","funders":"Army Research Office; National Center of Competence in Research Quantum Science and Technology; Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; NIH Office of the Director; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Horizon 2020 Framework Programme; Intelligence Advanced Research Projects Activity; Eidgenössische Technische Hochschule Zürich; Office of the Director of National Intelligence","keywords":"Quantum gate; Quantum computer; Set (abstract data type); Qubit; Controlled NOT gate; Quantum circuit; Quantum algorithm; Quantum","score_opus":0.009035573809416834,"score_gpt":0.20511580182033448,"score_spread":0.19608022801091765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021952315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26780385,0.00022003075,0.729206,0.0020366544,0.0002155243,0.0002522011,0.0000032836688,0.00021156698,0.00005082839],"genre_scores_gemma":[0.91383374,0.000022478172,0.08544635,0.0005279247,0.00012093526,0.000011458534,0.0000045007864,0.000025946363,0.000006648991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809545,0.00011077939,0.00038776622,0.0005179679,0.00045199567,0.00043603953],"domain_scores_gemma":[0.99866533,0.00013830107,0.00034769383,0.00053720997,0.00017181746,0.00013965726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034550272,0.00025848925,0.00031950348,0.000061170766,0.00028599167,0.00015412933,0.0011431512,0.00006212045,0.000007674143],"category_scores_gemma":[0.000061800034,0.00016320263,0.00007924546,0.0006671627,0.00012924481,0.00030361564,0.00034489552,0.00033800432,0.000011355918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005616728,0.00006893099,0.00051980704,0.0001510315,0.000052049192,0.00002573724,0.003971992,0.8993389,0.00065529457,0.0050747045,0.000062770705,0.090022616],"study_design_scores_gemma":[0.00043036562,0.00072517333,0.00047899215,0.000048180296,0.000016006274,0.000046311518,0.000076893455,0.996343,0.001334867,0.00010392844,0.00014569963,0.00025058963],"about_ca_topic_score_codex":0.000039944192,"about_ca_topic_score_gemma":0.0000014884374,"teacher_disagreement_score":0.6460299,"about_ca_system_score_codex":0.000015245796,"about_ca_system_score_gemma":0.00008595394,"threshold_uncertainty_score":0.665521},"labels":[],"label_agreement":null},{"id":"W3022034496","doi":"10.1109/bicame45512.2018.1570506382","title":"Towards Optimal Search: An Efficient Search Algorithm for Arabic Text using Secant Method","year":2018,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Binary search algorithm; Computer science; Full text search; Convergence (economics); Secant method; Search algorithm; Binary number; Property (philosophy); Beam search; Best-first search; Algorithm; Search engine; Mathematics; Information retrieval; Newton's method; Nonlinear system","score_opus":0.052533089480421534,"score_gpt":0.350852816028367,"score_spread":0.2983197265479455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022034496","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10187554,0.000031059888,0.8960037,0.00042924253,0.00054018106,0.00041632238,0.000012837741,0.000307962,0.0003831123],"genre_scores_gemma":[0.06877511,7.7215464e-7,0.9299585,0.00029045448,0.00079483294,0.0000080940035,0.0000035608784,0.00003077508,0.00013787852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967567,0.00028842452,0.00032862826,0.0009841901,0.0006481425,0.0009939374],"domain_scores_gemma":[0.9980901,0.00019559485,0.000056853005,0.0008481654,0.00044166992,0.00036762538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020335328,0.00029128356,0.00031480138,0.00028057938,0.00064835424,0.00043551167,0.0014315594,0.00010650569,0.00004076074],"category_scores_gemma":[0.000028735945,0.00022906788,0.00015721668,0.0007402617,0.00016650061,0.00019415081,0.00075656147,0.00030183952,0.000028685989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008302497,0.0001272213,0.000002927891,0.000013653394,0.000023256616,0.000010697971,0.0020418677,0.11576651,0.0012844524,0.004814325,0.000052150353,0.8758546],"study_design_scores_gemma":[0.00043963824,0.0007734871,0.00012701457,0.000023700208,0.000007628729,0.00012525696,0.00012052674,0.97783303,0.019091927,0.00026981081,0.0008426107,0.00034537585],"about_ca_topic_score_codex":0.00032466857,"about_ca_topic_score_gemma":0.000005456454,"teacher_disagreement_score":0.87550926,"about_ca_system_score_codex":0.00006544547,"about_ca_system_score_gemma":0.0003853857,"threshold_uncertainty_score":0.9341117},"labels":[],"label_agreement":null},{"id":"W3022718148","doi":"10.1103/physrevresearch.2.023116","title":"Topological wormholes: Nonlocal defects on the toric code","year":2020,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Canadian Institute for Advanced Research","keywords":"Wormhole; Toric code; Qubit; Locality; Computation; Quantum computer; Quantum; Code (set theory); Computer science; Topology (electrical circuits); Theoretical computer science; Theoretical physics; Lattice (music); Physics; Algorithm; Mathematics; Quantum mechanics; Combinatorics","score_opus":0.14204272156416164,"score_gpt":0.40586890953900273,"score_spread":0.2638261879748411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022718148","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14102572,0.03545919,0.1702751,0.62324864,0.0006946914,0.0036481773,0.000015730606,0.0010822347,0.024550486],"genre_scores_gemma":[0.9853682,0.0012760692,0.00089656486,0.011497563,0.00084761955,0.000054199838,0.0000010063596,0.000012441826,0.00004636126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968436,0.00080440164,0.00017779064,0.0005622552,0.0010474498,0.0005645021],"domain_scores_gemma":[0.99730116,0.0016319454,0.000037371432,0.0006340258,0.00011526581,0.00028020446],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010090981,0.00016028892,0.00030752408,0.000027991206,0.00032842992,0.00013481086,0.0019063654,0.000028392786,0.000020413814],"category_scores_gemma":[0.0012928508,0.00008275044,0.00018506532,0.0013275469,0.00019161038,0.000060381662,0.0008733672,0.0011994436,0.0008054783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001647349,0.0003731264,0.000021483671,0.00054643856,0.00002354092,0.00010273674,0.0006735074,0.00023130815,0.00047034424,0.5657508,0.0368072,0.39498308],"study_design_scores_gemma":[0.00019365443,0.0013191669,0.00032824717,0.0010756867,0.000008188004,0.000010599521,0.00001585011,0.8283231,0.0009187925,0.030176697,0.1372999,0.0003301193],"about_ca_topic_score_codex":0.000003917701,"about_ca_topic_score_gemma":3.6963382e-7,"teacher_disagreement_score":0.84434247,"about_ca_system_score_codex":0.000031524978,"about_ca_system_score_gemma":0.00007580862,"threshold_uncertainty_score":0.9999725},"labels":[],"label_agreement":null},{"id":"W3022853917","doi":"10.26421/qic20.3-4-3","title":"A local model of quantum Turing machines","year":2020,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Turing machine; Universal Turing machine; Super-recursive algorithm; Turing machine examples; Computer science; NSPACE; Quantum Turing machine; Time hierarchy theorem; Theoretical computer science; Description number; Tensor product; Non-deterministic Turing machine; Quantum computer; Locality; Turing; Computation; Quantum; Algorithm; Mathematics; Quantum network; Pure mathematics; Physics; Quantum mechanics","score_opus":0.015649194445625188,"score_gpt":0.23368452211394825,"score_spread":0.21803532766832306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022853917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15210952,0.00003965219,0.8459414,0.0014495829,0.000086108244,0.00009259021,0.0000041651074,0.00016020513,0.00011676423],"genre_scores_gemma":[0.96003914,0.000008601946,0.03901104,0.0008964292,0.000024245413,0.0000024013639,0.000012913742,0.000004271123,9.657648e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899524,0.000032260734,0.0004287014,0.00015063505,0.00024543755,0.00014770338],"domain_scores_gemma":[0.99941206,0.00004953147,0.00022119905,0.000107303,0.00010313459,0.00010674362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014407422,0.00013014354,0.00017121743,0.00012088352,0.000112448084,0.00011755424,0.00023839348,0.000046330286,0.000001244114],"category_scores_gemma":[0.000028161912,0.00011658839,0.000048045902,0.00030471454,0.00004530419,0.00090321223,0.00015133042,0.00012842129,0.000011776976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009220618,0.000011189163,0.000032201202,0.000096354685,0.0000073081223,4.6681993e-7,0.0059609604,0.6938405,0.00010283168,0.077562295,0.00011400776,0.22226268],"study_design_scores_gemma":[0.0003375452,0.00010309303,0.00044294537,0.000021888476,0.0000027779254,0.00000852487,0.00012568846,0.9879433,0.00018350544,0.010544169,0.0001516708,0.0001349156],"about_ca_topic_score_codex":0.000015920754,"about_ca_topic_score_gemma":2.3032109e-7,"teacher_disagreement_score":0.80792964,"about_ca_system_score_codex":0.000008939536,"about_ca_system_score_gemma":0.0000497009,"threshold_uncertainty_score":0.47543365},"labels":[],"label_agreement":null},{"id":"W3024114784","doi":"10.48550/arxiv.2005.08396","title":"A tutorial introduction to quantum circuit programming in dependently typed Proto-Quipper","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Programming language; Quantum circuit; Type (biology); Quantum; Theoretical computer science; Qubit; Quantum computer; Quantum network; Physics","score_opus":0.047645754478946756,"score_gpt":0.19775453636669763,"score_spread":0.15010878188775087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024114784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35734406,0.000019939076,0.6353663,0.0016459948,0.0034022043,0.0015771696,0.0000052883393,0.0005123346,0.00012668307],"genre_scores_gemma":[0.9918199,0.000005243229,0.005887073,0.000112100475,0.001984702,0.000009903648,0.000011241944,0.000028040986,0.00014174769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970001,0.00019664243,0.00029342723,0.0017917575,0.00018513677,0.00053295936],"domain_scores_gemma":[0.99839514,0.000048331534,0.00019085934,0.0009825785,0.00012174561,0.000261361],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035106414,0.0003767931,0.00041953067,0.0004081847,0.00013569804,0.00027182716,0.0017794702,0.00026379703,0.000010477805],"category_scores_gemma":[0.00010978995,0.00042905088,0.00017643168,0.0012762392,0.000045307104,0.00020547227,0.0023392222,0.0010737191,0.00009880856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020896175,0.0003901758,0.002191348,0.0003300997,0.00014247213,0.0014446611,0.004011988,0.7808882,0.00047912527,0.17242523,0.0010307363,0.036457],"study_design_scores_gemma":[0.00064352853,0.00022965127,0.00097234466,0.00013037652,0.000026083593,0.000015500847,0.00005781535,0.9597898,0.00010617546,0.02993616,0.0073980144,0.00069451344],"about_ca_topic_score_codex":0.00023143306,"about_ca_topic_score_gemma":0.00004815707,"teacher_disagreement_score":0.6344759,"about_ca_system_score_codex":0.0002568484,"about_ca_system_score_gemma":0.000293841,"threshold_uncertainty_score":0.9998161},"labels":[],"label_agreement":null},{"id":"W3025310339","doi":"10.1007/s42452-020-2847-4","title":"Quantum and classical machine learning for the classification of non-small-cell lung cancer patients","year":2020,"lang":"en","type":"article","venue":"SN Applied Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Toronto","funders":"Queen's University","keywords":"Computer science; Feature selection; Machine learning; Artificial intelligence; Quantum machine learning; Lung cancer; Adenocarcinoma; Quantum annealing; Dimensionality reduction; Cancer; Data mining; Quantum; Medicine; Oncology; Quantum computer; Internal medicine; Physics","score_opus":0.020808933968388517,"score_gpt":0.25593812214639644,"score_spread":0.23512918817800793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025310339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4399351,0.00034711647,0.5540622,0.004613989,0.0001814123,0.000433634,0.000004542864,0.000056891018,0.00036513916],"genre_scores_gemma":[0.98869616,0.000018874434,0.01091159,0.00025537077,0.00007219255,0.000029858804,0.0000011927732,0.0000046994537,0.000010074288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989441,0.00002445846,0.00017891634,0.00039293995,0.00024877695,0.00021077624],"domain_scores_gemma":[0.9993189,0.00029728003,0.00015394042,0.00011567192,0.000042990352,0.00007122357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032278796,0.000104694205,0.00013187353,0.000037191232,0.000469191,0.00011723586,0.00071363396,0.00003148628,0.0000016754842],"category_scores_gemma":[0.000030215195,0.00006491817,0.00003579766,0.00043875503,0.00021001523,0.000058576454,0.00020822149,0.00015758429,8.62865e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009419377,0.0003823931,0.057973664,0.00060161913,0.000077910845,0.0000011240247,0.024649547,0.12488485,0.07762649,0.13166018,0.0019479165,0.5801001],"study_design_scores_gemma":[0.0002598731,0.00013209305,0.010334694,0.00000940451,0.000007701131,1.7469408e-7,0.000072626324,0.98687005,0.0011629371,0.00035936778,0.00069952296,0.000091553266],"about_ca_topic_score_codex":0.00001598022,"about_ca_topic_score_gemma":0.0000043199675,"teacher_disagreement_score":0.8619852,"about_ca_system_score_codex":0.000007219935,"about_ca_system_score_gemma":0.000071643284,"threshold_uncertainty_score":0.36086854},"labels":[],"label_agreement":null},{"id":"W3026839285","doi":"10.1103/physrevlett.127.010504","title":"Designing Codes around Interactions: The Case of a Spin","year":2021,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Qubit; Computer science; Encoding (memory); Clifford algebra; Spin (aerodynamics); Angular momentum; Gaussian; Quadratic equation; Set (abstract data type); Quantum computer; Quantum; Quantum mechanics; Topology (electrical circuits); Physics; Mathematics; Algebra over a field; Pure mathematics; Combinatorics","score_opus":0.022737974882003454,"score_gpt":0.3131516172887436,"score_spread":0.2904136424067401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026839285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32727498,0.0097238775,0.6233668,0.039011594,0.00026241012,0.00019609077,0.0000019409579,0.00007020651,0.00009213311],"genre_scores_gemma":[0.949732,0.0004177347,0.03265922,0.016942788,0.00021895852,0.000014700944,0.0000010965445,0.0000076619635,0.000005821652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913967,0.00020475817,0.00017703231,0.00022129252,0.000111823276,0.00014545512],"domain_scores_gemma":[0.99893105,0.00045101758,0.00009970416,0.00043494097,0.000046440397,0.000036854857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018960415,0.0000970379,0.00022014539,0.00001548558,0.00010646935,0.000059800645,0.00033307442,0.000003105243,0.000002897597],"category_scores_gemma":[0.0000974291,0.000061971354,0.00015401357,0.00037951162,0.000051749335,0.00009967206,0.00017559594,0.0001956383,0.00001208636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004213105,0.00053491985,0.00005254246,0.002487901,0.00025658123,0.0050681047,0.0033083628,0.013226492,0.14117312,0.036503866,0.011363991,0.7860199],"study_design_scores_gemma":[0.00018750752,0.000057962818,0.00010899219,0.0037937872,0.000086606495,0.0037010193,0.0000702971,0.96612704,0.010748121,0.0037229878,0.0110433,0.00035240207],"about_ca_topic_score_codex":0.000018918197,"about_ca_topic_score_gemma":0.0000023869006,"teacher_disagreement_score":0.9529005,"about_ca_system_score_codex":0.000011624785,"about_ca_system_score_gemma":0.00002666295,"threshold_uncertainty_score":0.25271183},"labels":[],"label_agreement":null},{"id":"W3027809170","doi":"10.22331/q-2021-08-09-521","title":"New perspectives on covariant quantum error correction","year":2021,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Army Research Office; Multidisciplinary University Research Initiative; Institut Périmètre de physique théorique; Industry Canada; National Science Foundation; Government of Canada; U.S. Department of Energy; Air Force Office of Scientific Research; David and Lucile Packard Foundation","keywords":"Quantum error correction; Covariant transformation; Quantum operation; Quantum; Quantum metrology; Quantum capacity; Quantum algorithm; Open quantum system; Quantum process","score_opus":0.014559613249073202,"score_gpt":0.25368227353628964,"score_spread":0.23912266028721643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027809170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06260447,0.0008275096,0.92130715,0.005958392,0.0067307744,0.00013400256,0.0000034631782,0.00065312523,0.001781109],"genre_scores_gemma":[0.9507935,0.00007883032,0.04421767,0.00087196036,0.0010225124,0.0000071016952,0.000008160939,0.00004163755,0.002958641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978158,0.00017103317,0.00026889052,0.00084924255,0.0004290798,0.00046594962],"domain_scores_gemma":[0.998455,0.00021668401,0.00011536705,0.00084796414,0.00014754728,0.00021744733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023286883,0.00026257976,0.00027329332,0.00014234836,0.00030975408,0.0002893685,0.00062416645,0.00010049512,0.00008444595],"category_scores_gemma":[0.00018458819,0.00023682568,0.00016785487,0.0007563609,0.000038230995,0.00018937544,0.00023742151,0.00044909108,0.00025737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003754349,0.00037156,0.00008012658,0.000020638097,0.00007649348,0.00051108457,0.006414717,0.007837647,0.0020474098,0.8110624,0.05028088,0.12125953],"study_design_scores_gemma":[0.000475732,0.0003687404,0.0020182985,0.00008934532,0.000009339386,0.00029789473,0.00093220704,0.9618806,0.0023159157,0.014135858,0.017070161,0.00040586246],"about_ca_topic_score_codex":0.00012065821,"about_ca_topic_score_gemma":0.000015350086,"teacher_disagreement_score":0.954043,"about_ca_system_score_codex":0.00007552601,"about_ca_system_score_gemma":0.0003837182,"threshold_uncertainty_score":0.9657471},"labels":[],"label_agreement":null},{"id":"W3028056599","doi":"10.1109/qce49297.2020.00045","title":"Digital zero noise extrapolation for quantum error mitigation","year":2020,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":178,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Extrapolation; Noise (video); Quantum error correction; Quantum computer; Qubit; Quantum noise; Scaling; Error detection and correction; Quantum","score_opus":0.01962549543790076,"score_gpt":0.24446114654320608,"score_spread":0.22483565110530532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028056599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045109116,0.000021607166,0.9455016,0.008093025,0.00019220499,0.00018485716,0.000007126276,0.00034604085,0.00054440857],"genre_scores_gemma":[0.9088444,4.5851104e-7,0.08985743,0.0009825451,0.00017422489,0.000006935054,0.000013802816,0.000008657839,0.000111562535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991719,0.000012071281,0.00016747571,0.00031384974,0.00014884565,0.00018586381],"domain_scores_gemma":[0.99951684,0.0000889744,0.00005727254,0.0001657097,0.00005440835,0.00011677068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006243955,0.000104404906,0.000098232464,0.000034295026,0.00011497815,0.00026951637,0.00034506762,0.000036886075,0.0000042548045],"category_scores_gemma":[0.00006301207,0.00008902663,0.00007928825,0.00021598327,0.000017527438,0.00040948298,0.00008446772,0.0000711322,0.000027526481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027455604,0.0000858388,0.0005354774,0.00008279628,0.000028664756,0.000006373514,0.002319209,0.014881725,0.0058507863,0.16950592,0.009225297,0.7974504],"study_design_scores_gemma":[0.00024014142,0.00013829126,0.0005872616,0.0000062686463,0.0000019269396,0.0000036274012,0.000012299215,0.9807288,0.0009374986,0.011040485,0.006171675,0.00013173299],"about_ca_topic_score_codex":0.0000017731791,"about_ca_topic_score_gemma":3.977703e-7,"teacher_disagreement_score":0.9658471,"about_ca_system_score_codex":0.000008030636,"about_ca_system_score_gemma":0.00003041354,"threshold_uncertainty_score":0.3630401},"labels":[],"label_agreement":null},{"id":"W3029059735","doi":"10.1007/jhep10(2020)103","title":"Remarks on black hole complexity puzzle","year":2020,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministero dello Sviluppo Economico; Innovation, Science and Economic Development Canada","keywords":"Firewall (physics); Wormhole; Quantum; Gravitation; Black hole (networking); Computational complexity theory; Black hole information paradox; Quantum gravity","score_opus":0.020517809287636603,"score_gpt":0.23014339189162256,"score_spread":0.20962558260398595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029059735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033892285,0.000038811104,0.9571599,0.007598661,0.00044085647,0.000016725446,0.0000021680855,0.000046024965,0.0008045753],"genre_scores_gemma":[0.9563164,0.000011253728,0.03973274,0.002536768,0.0013621647,1.8202257e-7,9.98461e-7,0.000011420908,0.000028072322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987983,0.00008051341,0.00029648584,0.0001982784,0.00042233375,0.00020410537],"domain_scores_gemma":[0.9990093,0.000085596854,0.00033317227,0.00025788826,0.00012437273,0.00018967885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112878355,0.00014860947,0.0002848707,0.000036500045,0.000107337975,0.000101236095,0.0008546341,0.000038556587,0.0000046352548],"category_scores_gemma":[0.000022322187,0.000116029616,0.00016626857,0.00032395215,0.00006742549,0.00017918769,0.00017935518,0.00033766904,0.000011655316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028333281,0.00013805216,0.000007286735,0.000010275721,0.000048551068,0.00010182855,0.00046840755,0.20603216,0.00021353134,0.73936474,0.0065596327,0.047027186],"study_design_scores_gemma":[0.0007567336,0.00093327806,0.00048496772,0.0000712845,0.000013339939,0.000027411146,0.000012135989,0.70411,0.0072048134,0.26998588,0.0161165,0.0002836165],"about_ca_topic_score_codex":0.000011532431,"about_ca_topic_score_gemma":8.716441e-7,"teacher_disagreement_score":0.92242414,"about_ca_system_score_codex":0.000021711276,"about_ca_system_score_gemma":0.00005628687,"threshold_uncertainty_score":0.47315502},"labels":[],"label_agreement":null},{"id":"W3029282397","doi":"","title":"Efficient compression of SIDH public keys.","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Computer science; Key exchange; Public-key cryptography; Code (set theory); Key (lock); Relation (database); Theoretical computer science; Computer security; Mathematics; Encryption; Data mining; Elliptic curve; Programming language","score_opus":0.015825634968233023,"score_gpt":0.2524301338346112,"score_spread":0.2366044988663782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029282397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1476442,0.00023156544,0.841932,0.0045802416,0.0018640753,0.00040729187,0.000052389456,0.0003117346,0.002976482],"genre_scores_gemma":[0.5355124,0.000020705424,0.46402255,0.00015016398,0.00021056044,0.00003737073,0.000014240909,0.000029368097,0.0000026654589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573416,0.00064519705,0.0008329506,0.0014406233,0.0005182766,0.00082878006],"domain_scores_gemma":[0.99569637,0.0008691078,0.0007954395,0.0021570064,0.00020356331,0.00027852578],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00053338567,0.0005636635,0.00093956036,0.00055690005,0.00020035674,0.0000974882,0.0033761053,0.0003838181,0.000040549727],"category_scores_gemma":[0.00019246919,0.00042323896,0.00043713354,0.00021322083,0.000606428,0.00003660017,0.010277218,0.0013000421,0.00009966827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000230233,0.00026720075,0.0008633838,0.00015046244,0.00013970377,0.00006906097,0.0017817592,0.024176579,0.0027319647,0.9111807,0.0005419965,0.058074214],"study_design_scores_gemma":[0.0004379053,0.0000911233,0.0041791936,0.00039193552,0.000013019447,0.00006140805,0.000010164558,0.3848108,0.0015135587,0.6067566,0.0012872254,0.00044705757],"about_ca_topic_score_codex":0.000021063173,"about_ca_topic_score_gemma":0.000005415728,"teacher_disagreement_score":0.3878682,"about_ca_system_score_codex":0.00005622653,"about_ca_system_score_gemma":0.0003894766,"threshold_uncertainty_score":0.99982196},"labels":[],"label_agreement":null},{"id":"W3030249620","doi":"10.1039/d0cp01707h","title":"On the order problem in construction of unitary operators for the variational quantum eigensolver","year":2020,"lang":"en","type":"article","venue":"Physical Chemistry Chemical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto; Toronto Public Health","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Unitary state; Lie algebra; Connection (principal bundle); Quantum; Algebra over a field; Order (exchange); Lie group; Special unitary group","score_opus":0.013334638014099733,"score_gpt":0.22238098151572627,"score_spread":0.20904634350162654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030249620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67403275,0.000020228297,0.31146294,0.013548339,0.00007110317,0.0004096411,0.000036544814,0.00008635486,0.00033212634],"genre_scores_gemma":[0.99011624,8.0517486e-7,0.008736455,0.00058857974,0.0005056265,0.000028330824,0.000010619692,0.000011074288,0.0000022664035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990123,0.000022169057,0.00018924009,0.00031430557,0.00026266286,0.00019932451],"domain_scores_gemma":[0.99854743,0.00091270544,0.00008993079,0.00028131378,0.00010974444,0.000058853257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007648426,0.00015887865,0.00018227383,0.000003938513,0.00008717661,0.000034939392,0.00067967526,0.00004328964,0.0000040853433],"category_scores_gemma":[0.00012147899,0.00009513309,0.00011038899,0.0004747547,0.00014969363,0.00006093395,0.00016744969,0.00036256955,0.0000025670442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070609494,0.0005070823,0.000023814036,0.00017453606,0.00009192446,0.0000014105892,0.001866179,0.067544,0.44325292,0.47726524,0.0010954624,0.008106826],"study_design_scores_gemma":[0.0002004897,0.000022514918,0.000008741907,0.0000147628025,0.0000063609964,7.740196e-7,0.000017702741,0.7111764,0.20211394,0.08625846,0.00008091761,0.00009890445],"about_ca_topic_score_codex":0.0000045941633,"about_ca_topic_score_gemma":2.256075e-8,"teacher_disagreement_score":0.6436324,"about_ca_system_score_codex":0.000020220039,"about_ca_system_score_gemma":0.000079260455,"threshold_uncertainty_score":0.38794148},"labels":[],"label_agreement":null},{"id":"W3030399669","doi":"10.1109/qce49297.2020.00058","title":"Noise Mitigation with Delay Pulses in the IBM Quantum Experience","year":2020,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extrapolation; Noise (video); Quantum computer; Computation; Qubit; IBM; Quantum; Quantum noise; Function (biology)","score_opus":0.012995035003700167,"score_gpt":0.22899457839847565,"score_spread":0.21599954339477548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030399669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5326771,0.00007057048,0.4578779,0.008718562,0.00005851183,0.00010496332,3.075606e-7,0.00010491835,0.00038716636],"genre_scores_gemma":[0.97683895,0.0000035744858,0.020299282,0.0027632308,0.00007322565,0.000010878934,6.9021434e-7,0.0000042763886,0.0000058845517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990427,0.00007089373,0.00013193596,0.00030062813,0.00025606356,0.00019780557],"domain_scores_gemma":[0.99951553,0.00009455408,0.00003812853,0.00026578177,0.000025629994,0.000060377966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011815743,0.00010329853,0.00008685735,0.000030672854,0.00010142605,0.0001636545,0.00084033044,0.000018603683,0.0000055874393],"category_scores_gemma":[0.000026997908,0.0000558415,0.000024182398,0.00060013373,0.000047081747,0.00019865565,0.000101655394,0.00017081261,0.000015413103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068041554,0.00036407707,0.012825318,0.00010403865,0.000023188784,0.0005192526,0.23850235,0.05632427,0.0032848686,0.28968158,0.0029909348,0.39531207],"study_design_scores_gemma":[0.00018075602,0.00014491635,0.0057498175,0.000018794624,0.0000013466871,0.000035555968,0.0003533754,0.9899032,0.0006259574,0.0010845048,0.0017633516,0.0001384414],"about_ca_topic_score_codex":0.000033466502,"about_ca_topic_score_gemma":0.000011444286,"teacher_disagreement_score":0.9335789,"about_ca_system_score_codex":0.000005880376,"about_ca_system_score_gemma":0.000036049838,"threshold_uncertainty_score":0.22771503},"labels":[],"label_agreement":null},{"id":"W3033312235","doi":"10.1038/s41467-023-38332-9","title":"Quantum process tomography with unsupervised learning and tensor networks","year":2023,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Flatiron Health; Canadian Institute for Advanced Research; Kavli Institute for Theoretical Physics, University of California, Santa Barbara; Instituto Serrapilheira; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Compute Canada; Simons Foundation; National Science Foundation","keywords":"Computer science; Qubit; Quantum circuit; Quantum computer; Quantum; Quantum error correction; Quantum tomography; Theoretical computer science; Quantum state; Computer engineering; Algorithm; Physics; Quantum mechanics","score_opus":0.01048905909330177,"score_gpt":0.26932450725485646,"score_spread":0.2588354481615547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033312235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66936916,0.028429216,0.23455854,0.054494657,0.00077266316,0.0013816799,0.000013197347,0.0077736625,0.003207237],"genre_scores_gemma":[0.97158086,0.0003409476,0.027686104,0.0002490073,0.000039943385,0.000024663253,0.000021207416,0.00001575545,0.00004153616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898,0.0001294052,0.00013504986,0.00030012507,0.00018346301,0.0002719501],"domain_scores_gemma":[0.9982975,0.0003620498,0.00006886429,0.0010457606,0.00013777611,0.00008802468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025853317,0.00014290519,0.00014037454,0.00020665144,0.0007218875,0.0001729631,0.0014982095,0.00013977128,8.82659e-7],"category_scores_gemma":[0.00005396851,0.000110660556,0.00003886786,0.0020009207,0.00013096283,0.00013629624,0.0005916788,0.0013183341,0.0000050746157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006022477,0.0005462521,0.15584186,0.00020729503,0.00046727285,0.00008692784,0.014869264,0.16763525,0.00043099615,0.3230396,0.005620533,0.33119452],"study_design_scores_gemma":[0.00019033828,0.00006890388,0.02074813,0.00005213081,0.0000073820415,0.000026488187,0.00011037287,0.96879536,0.000009329222,0.0009308241,0.008885976,0.00017474435],"about_ca_topic_score_codex":0.000005574247,"about_ca_topic_score_gemma":0.000022735832,"teacher_disagreement_score":0.8011601,"about_ca_system_score_codex":0.0000059136796,"about_ca_system_score_gemma":0.00003502973,"threshold_uncertainty_score":0.5727579},"labels":[],"label_agreement":null},{"id":"W3033494641","doi":"10.1103/physrevapplied.16.044042","title":"Quantum Computer-Aided Design: Digital Quantum Simulation of Quantum Processors","year":2021,"lang":"en","type":"article","venue":"Physical Review Applied","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Canadian Institute for Advanced Research; University of Toronto","funders":"Government of Ontario; University of Toronto; Office of Naval Research; Canada Foundation for Innovation; Google; U.S. Department of Energy","keywords":"Transmon; Quantum; Quantum computer; Quantum algorithm; Energy (signal processing); Quantum circuit; Quantum simulator; Topology (electrical circuits)","score_opus":0.02443471200187494,"score_gpt":0.2893007555648766,"score_spread":0.2648660435630017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033494641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038058784,0.002568147,0.95746076,0.0006720514,0.00021030875,0.00056140765,0.000007871946,0.0002662736,0.0001943723],"genre_scores_gemma":[0.98528445,0.00029188892,0.013527771,0.0005245749,0.0002760829,0.000032430515,0.000021893557,0.000032248332,0.000008657794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712265,0.00013969702,0.00070412393,0.00085795403,0.0006882127,0.00048738215],"domain_scores_gemma":[0.99741477,0.00081409165,0.00040659087,0.0009037053,0.00027299873,0.0001878696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034708524,0.00039115996,0.0009425846,0.000067327164,0.00013863013,0.00018791617,0.000916285,0.000056703462,0.000006349761],"category_scores_gemma":[0.00015297154,0.00032988752,0.000306796,0.0011821267,0.000095948184,0.00028230587,0.0004987099,0.0003275655,0.000081573664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029111308,0.0013235114,0.000015576114,0.0033334624,0.000121966616,0.000050587612,0.0007355479,0.3052192,0.003391497,0.39459962,0.0005584455,0.29062146],"study_design_scores_gemma":[0.0003000914,0.00013592732,0.00014573625,0.0008534311,0.00003159468,0.000011279464,0.0000051359093,0.942204,0.0015327357,0.052842267,0.0015720171,0.00036578169],"about_ca_topic_score_codex":0.0000021087099,"about_ca_topic_score_gemma":9.6439436e-8,"teacher_disagreement_score":0.9472257,"about_ca_system_score_codex":0.000029427058,"about_ca_system_score_gemma":0.00019699206,"threshold_uncertainty_score":0.9999153},"labels":[],"label_agreement":null},{"id":"W3034516837","doi":"10.3390/app10114040","title":"Quantum Dilation and Erosion","year":2020,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Quantum computer; Computer science; Quantum information; Quantum network; Quantum error correction; Qubit; Quantum algorithm; Dilation (metric space); Theoretical computer science; Quantum; Algorithm; Computer engineering; Quantum mechanics; Physics; Mathematics; Geometry","score_opus":0.02069565425030436,"score_gpt":0.23274273921619343,"score_spread":0.21204708496588906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034516837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48430994,0.00009377387,0.5052195,0.008114034,0.00012468178,0.00009649603,4.1845615e-7,0.00022191061,0.0018192187],"genre_scores_gemma":[0.96058494,0.0000041937715,0.038213983,0.0011220623,0.00006814852,0.0000018566172,2.3587094e-7,0.0000019574454,0.000002645479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915177,0.000013838359,0.00009354051,0.0003616409,0.00021929134,0.0001599348],"domain_scores_gemma":[0.99970436,0.00006037864,0.00004131721,0.00009506024,0.000009078219,0.00008982706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020226713,0.0000725788,0.00007622624,0.00003239469,0.0003196389,0.00020221616,0.0004414878,0.000020858384,0.0000022180468],"category_scores_gemma":[0.000014308851,0.00005461406,0.000013510584,0.00045641093,0.00012511235,0.00013464085,0.00023132637,0.00007371053,0.000017440869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041157095,0.00001904066,0.00081926095,0.000015977559,0.0000031774293,0.0000034589434,0.0042533157,0.0056485482,0.04050857,0.77395827,0.0005994504,0.17416681],"study_design_scores_gemma":[0.00008918104,0.00008184759,0.0028412573,0.000004413439,9.2192477e-7,0.0000033691304,0.000039593295,0.98108184,0.0018693008,0.0129923355,0.0008903673,0.00010556866],"about_ca_topic_score_codex":0.000004358371,"about_ca_topic_score_gemma":4.3271584e-7,"teacher_disagreement_score":0.9754333,"about_ca_system_score_codex":0.0000025361428,"about_ca_system_score_gemma":0.000022807584,"threshold_uncertainty_score":0.24584363},"labels":[],"label_agreement":null},{"id":"W3035542151","doi":"10.22331/q-2022-05-30-725","title":"A device-independent protocol for XOR oblivious transfer","year":2022,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Institut Périmètre de physique théorique; University of Waterloo; QuantERA; National Research Foundation; National University of Singapore; Eidgenössische Technische Hochschule Zürich; Ministero dello Sviluppo Economico; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation; Government of Canada; Ministry of Education - Singapore; Centre for Quantum Technologies; Innovation, Science and Economic Development Canada","keywords":"Oblivious transfer; Computer science; Protocol (science); Alice (programming language); Adversary; Task (project management); Function (biology); Alice and Bob; Quantum; Quantum cryptography; Theoretical computer science; Cryptography; Value (mathematics); Transfer (computing); Computer security; Quantum information; Physics; Quantum mechanics; Parallel computing; Programming language","score_opus":0.02742532512818136,"score_gpt":0.2930701387579489,"score_spread":0.26564481362976755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035542151","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011337603,0.000018174262,0.8952541,0.0024862334,0.0006881881,0.08934647,0.000026232687,0.0005449171,0.00029808498],"genre_scores_gemma":[0.36736557,2.475454e-7,0.03688561,0.0017510009,0.00035259975,0.59302646,0.000007707507,0.00006188637,0.00054892176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810624,0.00012018147,0.00028279313,0.0005409409,0.0004725166,0.00047732325],"domain_scores_gemma":[0.99915314,0.0001301886,0.000052358897,0.0005032528,0.000051546747,0.000109529945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049067213,0.00019096624,0.00019940297,0.00012908428,0.00065532146,0.00013886165,0.0012136456,0.000036417234,0.000068912545],"category_scores_gemma":[0.000015095512,0.00017174329,0.00017080914,0.00038324637,0.000022629962,0.000106826075,0.00034981227,0.00031173322,0.000018435088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043759544,0.002331902,0.00036110153,0.00059127336,0.00018877618,0.0003564564,0.010406607,0.046691224,0.0036790227,0.56810087,0.030311128,0.33654404],"study_design_scores_gemma":[0.0014393673,0.00070082454,0.00019423496,0.000014977354,0.0000046326772,0.00010227989,0.000042187847,0.77450174,0.0004336216,0.012408946,0.20985821,0.00029896636],"about_ca_topic_score_codex":0.000024822837,"about_ca_topic_score_gemma":0.00000430382,"teacher_disagreement_score":0.85836846,"about_ca_system_score_codex":0.000058854836,"about_ca_system_score_gemma":0.0001538309,"threshold_uncertainty_score":0.7003488},"labels":[],"label_agreement":null},{"id":"W3035968252","doi":"10.1088/2058-9565/ac2d3a","title":"A polynomial time and space heuristic algorithm for T-count","year":2021,"lang":"en","type":"preprint","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Government of Canada","keywords":"Dimension (graph theory); Gate count; Mathematics; Heuristic; Quantum computer; Discrete mathematics; Polynomial; Integer (computer science); Combinatorics; Time complexity; Algorithm; Computer science; Quantum; Physics; Mathematical optimization; Quantum mechanics","score_opus":0.007198735408062885,"score_gpt":0.2370207292869873,"score_spread":0.22982199387892444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035968252","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4586325,0.0036827254,0.52144015,0.012753161,0.0017433548,0.0007960426,0.000049140817,0.0008351109,0.00006781297],"genre_scores_gemma":[0.41724938,0.000278754,0.5814634,0.00039487684,0.0003153445,0.00010658531,0.000011923422,0.00004036854,0.00013935578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967371,0.000031004343,0.0003193265,0.0017062841,0.00044350862,0.00076273654],"domain_scores_gemma":[0.9980139,0.00016137434,0.00021253318,0.0009870044,0.00044550313,0.00017965506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009497199,0.0003783326,0.0005477313,0.00083212147,0.00063651364,0.0008411365,0.0017543751,0.0004107424,0.0000018122442],"category_scores_gemma":[0.0003430686,0.00034607988,0.000062514024,0.001236128,0.0015247616,0.00019638176,0.0044296705,0.0007153026,0.0000041883586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004979327,0.000117142365,0.0000637248,0.00014454278,0.000048004837,0.00013546643,0.0007219275,0.00010254751,0.010300125,0.015863687,0.0011767674,0.9713211],"study_design_scores_gemma":[0.00027968973,0.00024510495,0.00012503547,0.00012425978,0.000016954718,0.0003319518,0.000050302002,0.9809942,0.002204569,0.013073588,0.002106,0.0004483108],"about_ca_topic_score_codex":0.000056448367,"about_ca_topic_score_gemma":0.0000044181415,"teacher_disagreement_score":0.9808917,"about_ca_system_score_codex":0.000068163026,"about_ca_system_score_gemma":0.00095974485,"threshold_uncertainty_score":0.99989915},"labels":[],"label_agreement":null},{"id":"W3036863718","doi":"10.1088/2632-2153/ac362b","title":"Attention-based quantum tomography","year":2021,"lang":"en","type":"article","venue":"Machine Learning Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Waterloo","funders":"Basic Energy Sciences; Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Quantum tomography; Quantum; Quantum state; Quantum process; Quantum entanglement; Quantum network; Quantum operation; Quantum information; Density matrix","score_opus":0.004414754458693062,"score_gpt":0.22053186793040316,"score_spread":0.21611711347171011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036863718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78019977,0.0009800527,0.19482817,0.022198133,0.0003323328,0.000067034445,8.2854643e-7,0.0010128071,0.00038088337],"genre_scores_gemma":[0.96359766,0.000008895728,0.035979487,0.00032180946,0.000018166102,0.000003821258,0.0000013263291,0.0000055229816,0.00006334331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984497,0.000043969383,0.00014064465,0.0006252975,0.00034217327,0.00039821188],"domain_scores_gemma":[0.99910295,0.00006373158,0.00006734071,0.00042062026,0.0002661672,0.000079199745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056193594,0.00012431966,0.0001443301,0.0006682614,0.0007665217,0.00023432757,0.0007733963,0.00007105915,0.000005807614],"category_scores_gemma":[0.00037621422,0.00010891866,0.000035823912,0.004339156,0.0005809652,0.00014947324,0.0004926789,0.0004594369,0.0000098692135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002695635,0.00015429179,0.13315167,0.0000348859,0.000017999198,0.00027774685,0.00020772024,0.0031265188,0.06939357,0.2668345,0.00006169538,0.52673674],"study_design_scores_gemma":[0.00021232669,0.00012912734,0.006526366,0.000023068746,0.0000028822863,0.0001369104,0.000026300675,0.97282195,0.005236792,0.008811785,0.005898732,0.0001737338],"about_ca_topic_score_codex":0.000016297068,"about_ca_topic_score_gemma":0.0000047310223,"teacher_disagreement_score":0.96969545,"about_ca_system_score_codex":0.000014284992,"about_ca_system_score_gemma":0.00022441398,"threshold_uncertainty_score":0.5895543},"labels":[],"label_agreement":null},{"id":"W3037039307","doi":"10.1039/d0cp03593a","title":"Quantum algorithm for simulating molecular vibrational excitations","year":2020,"lang":"en","type":"article","venue":"Physical Chemistry Chemical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada); Toronto Public Health","funders":"","keywords":"Excited state; Dissociation (chemistry); Molecule; Quantum; Molecular vibration; Excitation; Vibronic spectroscopy; Vibrational partition function; Physics; Hot band; Chemistry; Quantum mechanics; Physical chemistry","score_opus":0.015399005890520815,"score_gpt":0.25420448293653003,"score_spread":0.2388054770460092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037039307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051448975,0.0000132135565,0.94598943,0.0018551276,0.000032778433,0.00013257781,0.000034759112,0.0002851099,0.00020802865],"genre_scores_gemma":[0.78162616,1.9814455e-7,0.21602273,0.000724437,0.0014874473,0.00002926779,0.000079272984,0.000026574067,0.000003882455],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984354,0.000014327884,0.00022719533,0.0006144701,0.00034475708,0.00036386494],"domain_scores_gemma":[0.99884737,0.0003520265,0.000106800144,0.00029650392,0.0001332054,0.00026412017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00003641055,0.0002540107,0.00027187465,0.0000053163812,0.00012902392,0.00012298222,0.00068741926,0.0000639093,0.0000029098292],"category_scores_gemma":[0.00011372357,0.00025666697,0.00026370684,0.00035986732,0.000073912284,0.00017964718,0.0002575508,0.00030815045,0.000012001143],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037377743,0.00016805048,7.5852796e-7,0.00007060336,0.000031532163,0.0000037160444,0.0003951689,0.0214949,0.92075044,0.011489259,0.00019617204,0.045395635],"study_design_scores_gemma":[0.00022612333,0.000018327577,7.3357245e-7,0.000007639259,0.000006403953,0.0000010008354,0.000004592181,0.5894142,0.36648273,0.043544706,0.000104322484,0.0001892438],"about_ca_topic_score_codex":8.981599e-7,"about_ca_topic_score_gemma":2.4233466e-9,"teacher_disagreement_score":0.7301772,"about_ca_system_score_codex":0.000025320205,"about_ca_system_score_gemma":0.000069083144,"threshold_uncertainty_score":0.99998856},"labels":[],"label_agreement":null},{"id":"W3037267122","doi":"10.1007/978-0-387-30440-3_432","title":"Quantum Cryptography","year":2009,"lang":"en","type":"preprint","venue":"Encyclopedia of Complexity and Systems Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum cryptography; Cryptography; Post-quantum cryptography; Computer science; Computer security; Quantum; Physics; Encryption; Public-key cryptography; Quantum information; Quantum mechanics","score_opus":0.026446561783356765,"score_gpt":0.2644885996389149,"score_spread":0.23804203785555814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037267122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39571285,0.005565238,0.5679457,0.0009566851,0.005786391,0.00090152264,0.000040415558,0.000485118,0.022606056],"genre_scores_gemma":[0.8964631,0.000552603,0.102475315,0.00008847982,0.00034907422,0.000014157617,0.000004458601,0.000013310523,0.000039502684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959864,0.00019905627,0.0007582704,0.0012446659,0.0011701725,0.00064141396],"domain_scores_gemma":[0.99715453,0.00016246045,0.00060263387,0.0014238936,0.0003357778,0.00032067543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019599933,0.0004233899,0.00076702534,0.0006554154,0.00049236114,0.0006036244,0.0034608396,0.00018528508,0.0000018631647],"category_scores_gemma":[0.00010960801,0.00036807416,0.00017217518,0.0011579006,0.0014823261,0.00033988844,0.0024842853,0.00071323954,0.0000041135822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004750673,0.00011828159,0.0004591895,0.00042399578,0.00002059619,0.000017695584,0.0020655321,0.004320878,0.00014541412,0.97004104,0.00040123376,0.021981398],"study_design_scores_gemma":[0.00017000224,0.0001797749,0.0158646,0.0004977013,0.000008855035,0.000060628954,0.000047910136,0.7368304,0.00003806897,0.2416622,0.0040841615,0.0005556572],"about_ca_topic_score_codex":0.00032038387,"about_ca_topic_score_gemma":0.000005474912,"teacher_disagreement_score":0.73250955,"about_ca_system_score_codex":0.000033291148,"about_ca_system_score_gemma":0.00054938195,"threshold_uncertainty_score":0.9998771},"labels":[],"label_agreement":null},{"id":"W3037557713","doi":"","title":"Uncloneable Quantum Encryption via Oracles","year":2019,"lang":"en","type":"article","venue":"IACR Cryptology ePrint Archive","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Encryption; Computer science; Theoretical computer science; Pseudorandom function family; Probabilistic encryption; Quantum cryptography; Random oracle; Cryptography; Quantum; Quantum information; Algorithm; Computer security; Public-key cryptography; Physics; Quantum mechanics","score_opus":0.005727296969806965,"score_gpt":0.21571699691288027,"score_spread":0.2099896999430733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037557713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3479948,0.00005006329,0.6481479,0.0010170736,0.000744172,0.00018511967,0.0000022064817,0.0002706713,0.0015880292],"genre_scores_gemma":[0.5185095,0.000011708048,0.4809702,0.0003558636,0.000108144486,0.000012993019,0.0000071108934,0.00001715688,0.0000072875596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997785,0.0002351112,0.00033460264,0.0007792224,0.00025390598,0.0006121981],"domain_scores_gemma":[0.9983562,0.0003629136,0.0001632976,0.00091195595,0.000059802216,0.00014578947],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033033936,0.00026375955,0.0003504739,0.00021344524,0.00018971071,0.00008655668,0.0011221695,0.000110760426,0.00009583382],"category_scores_gemma":[0.000040442897,0.0002349433,0.00014653864,0.0002899403,0.00013857268,0.00019928574,0.0008240806,0.00048662233,0.001877021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017440923,0.00007658951,0.0033685581,0.000019318855,0.000033210155,0.0000393328,0.0011398353,0.0047662654,0.0098858895,0.9464896,0.00019767214,0.033966288],"study_design_scores_gemma":[0.00029815643,0.00014523466,0.00858627,0.000021566284,0.0000039935376,0.00013361724,0.00002317959,0.44127095,0.0010020509,0.5453279,0.0029497398,0.00023733472],"about_ca_topic_score_codex":0.00005344695,"about_ca_topic_score_gemma":0.000012181148,"teacher_disagreement_score":0.4365047,"about_ca_system_score_codex":0.000031035004,"about_ca_system_score_gemma":0.00008033739,"threshold_uncertainty_score":0.9989001},"labels":[],"label_agreement":null},{"id":"W3037687232","doi":"10.1103/physrevlett.87.167902","title":"Quantum Fingerprinting","year":2001,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1207,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum entanglement; String (physics); Fingerprint (computing); Quantum; Computer science; Scheme (mathematics); Exponential growth; Quantum cryptography; Uncorrelated; Exponential function; Algorithm; Statistical physics; Theoretical computer science; Quantum information; Mathematics; Physics; Quantum mechanics; Artificial intelligence; Statistics","score_opus":0.014569518652965041,"score_gpt":0.27363486587950747,"score_spread":0.25906534722654245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037687232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48359233,0.004943919,0.44762188,0.0620991,0.00039090932,0.00024607958,4.257127e-7,0.00047885103,0.000626514],"genre_scores_gemma":[0.9252791,0.0014457555,0.014045556,0.05856145,0.0006187776,0.00001625497,0.0000012796038,0.000018524986,0.000013348709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881303,0.00007352425,0.00017717559,0.0003586991,0.0002469988,0.00033059472],"domain_scores_gemma":[0.99918765,0.00013572833,0.0000818717,0.0004846869,0.000020684738,0.000089403555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020002143,0.00015048381,0.00025921979,0.00003117799,0.000104622544,0.00007221469,0.0007294673,0.0000050603585,0.0000060099605],"category_scores_gemma":[0.000056121895,0.00011879164,0.00017024761,0.00043175512,0.00003045203,0.00013935397,0.00023949204,0.00021763575,0.00018054243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028256034,0.00029632545,0.0006007946,0.00095016,0.000058878595,0.00028124056,0.0007047885,0.0050034276,0.015173047,0.05120263,0.016427176,0.9092987],"study_design_scores_gemma":[0.00011004915,0.00003366848,0.0013511295,0.0012013767,0.000012953575,0.00006509053,8.738221e-7,0.92523474,0.00010675532,0.002445767,0.06909928,0.00033834658],"about_ca_topic_score_codex":0.0000067432607,"about_ca_topic_score_gemma":1.2638233e-7,"teacher_disagreement_score":0.9202313,"about_ca_system_score_codex":0.000014192374,"about_ca_system_score_gemma":0.000011428343,"threshold_uncertainty_score":0.48441827},"labels":[],"label_agreement":null},{"id":"W3038086750","doi":"10.1103/physreva.75.042313","title":"Hamiltonian oracles","year":2007,"lang":"en","type":"article","venue":"Physical Review A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Geodesic; Oracle; Unitary state; Mathematics; Hamiltonian (control theory); Upper and lower bounds; Limit (mathematics); Simple (philosophy); Hamiltonian path; Algorithm; Discrete mathematics; Computer science; Mathematical optimization; Mathematical analysis","score_opus":0.010848379488637441,"score_gpt":0.3012946121156237,"score_spread":0.29044623262698627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038086750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11199499,0.029868737,0.83914334,0.0077860234,0.00043364242,0.00042186046,0.0000010530729,0.0006862488,0.009664128],"genre_scores_gemma":[0.94671655,0.000937405,0.046026982,0.0057133376,0.0005227719,0.000005210549,8.604166e-7,0.000013211924,0.000063695734],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910206,0.00003109546,0.00014456002,0.00024932544,0.000208787,0.0002641988],"domain_scores_gemma":[0.9992725,0.00013054226,0.000051904717,0.00040208956,0.000032712553,0.00011023224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003512745,0.00010501009,0.00020111664,0.000023977122,0.000070343056,0.00003702781,0.0005593522,0.000010460908,0.000002908208],"category_scores_gemma":[0.000057376146,0.00007603505,0.000115581504,0.00038420327,0.000026265014,0.00008236634,0.00017701359,0.00014714725,0.0001367807],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.10639e-7,0.00007820162,0.000027641332,0.00017335902,0.0000059136005,0.000024100937,0.00011522878,0.00001882582,0.00030875482,0.059866548,0.0007932789,0.93858767],"study_design_scores_gemma":[0.00045339682,0.00036714834,0.024575317,0.0041865557,0.00004721305,0.00013238145,0.000005821901,0.2462705,0.003829078,0.132912,0.5860211,0.0011994633],"about_ca_topic_score_codex":0.000004977888,"about_ca_topic_score_gemma":0.0000010713298,"teacher_disagreement_score":0.9373882,"about_ca_system_score_codex":0.000010448202,"about_ca_system_score_gemma":0.000019294439,"threshold_uncertainty_score":0.31006193},"labels":[],"label_agreement":null},{"id":"W3038572776","doi":"10.22331/q-2020-11-17-364","title":"Operational, gauge-free quantum tomography","year":2020,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; TRIUMF","funders":"Pacific Northwest National Laboratory; National Nuclear Security Administration; Office of Science; Government of Canada; Advanced Scientific Computing Research; Sandia National Laboratories; Laboratory Directed Research and Development; U.S. Department of Energy","keywords":"Tomography; Computer science; Benchmarking; Set (abstract data type); Parameterized complexity; Ambiguity; Representation (politics); Gauge (firearms); Observable; Algorithm; Process (computing); Computer engineering; Theoretical computer science; Physics; Optics","score_opus":0.01639338014628364,"score_gpt":0.22895984600088615,"score_spread":0.2125664658546025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038572776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19491246,0.0010318827,0.72882986,0.07029403,0.0014498007,0.00035478247,0.000041433963,0.0014523142,0.0016334164],"genre_scores_gemma":[0.95507145,0.000019255202,0.036387004,0.0077690417,0.00065316376,0.000013405728,0.00001329341,0.000029604817,0.000043805998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792415,0.00009892534,0.00033893163,0.0006830529,0.00049455435,0.00046041474],"domain_scores_gemma":[0.9985356,0.00011760933,0.000094250485,0.0008406088,0.0000969296,0.000315005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020135804,0.00025938806,0.00026335556,0.000116756906,0.0002973519,0.00032275697,0.0020907638,0.000079525875,0.000049311628],"category_scores_gemma":[0.00013447936,0.00022741221,0.00018321448,0.00091850694,0.00007336568,0.00031427285,0.00064957363,0.0003352907,0.00020069558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015858574,0.00011161072,0.0004765911,0.000042019135,0.000051491046,0.00010372955,0.0017948807,0.001978563,0.0013109192,0.91677296,0.065646775,0.011694581],"study_design_scores_gemma":[0.00055587967,0.00028087074,0.0012018796,0.00002136163,0.000005562686,0.00002822969,0.000025126566,0.92207414,0.0005139346,0.032527447,0.042412,0.00035356914],"about_ca_topic_score_codex":0.000032126376,"about_ca_topic_score_gemma":0.000001934412,"teacher_disagreement_score":0.92009556,"about_ca_system_score_codex":0.000012218187,"about_ca_system_score_gemma":0.00009841364,"threshold_uncertainty_score":0.9273601},"labels":[],"label_agreement":null},{"id":"W3040080135","doi":"10.1016/j.laa.2020.06.025","title":"Perfect state transfer on oriented graphs","year":2020,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Adjacency matrix; Laplacian matrix; Combinatorics; State (computer science); Transfer (computing); Graph; Characterization (materials science); Discrete mathematics; Computer science; Algorithm","score_opus":0.011192666295729476,"score_gpt":0.22678111481636937,"score_spread":0.21558844852063988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040080135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2237806,0.00018696419,0.7685729,0.006454545,0.000041471816,0.00032479138,0.00001836174,0.00029294405,0.00032741626],"genre_scores_gemma":[0.99008673,0.00005785434,0.0072103655,0.0024027203,0.00012051876,0.000045235203,0.000008760044,0.000012631211,0.000055196946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915016,0.000025776113,0.0001368101,0.00038460465,0.00012982562,0.00017284192],"domain_scores_gemma":[0.99949735,0.00006434552,0.000018311097,0.00021375268,0.00003828517,0.0001679591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000052817173,0.000120086894,0.00011172532,0.00004330861,0.00020339062,0.000053930624,0.0002875045,0.00002958827,0.0000075091543],"category_scores_gemma":[0.0000076165666,0.0000996446,0.000047067955,0.00046404585,0.00002353891,0.000067487344,0.000064681284,0.00017408552,0.00007519248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001728733,0.00016860243,0.00008021231,0.000059394755,0.00004743737,0.0000065692266,0.0038409932,0.0018481255,0.0043791453,0.7302112,0.00050948974,0.25883153],"study_design_scores_gemma":[0.00037661794,0.00027332158,0.0005469078,0.000011567224,0.000008270985,0.0000075864778,0.000011994009,0.9237096,0.004485295,0.0049227574,0.06540007,0.0002460201],"about_ca_topic_score_codex":0.0000019578822,"about_ca_topic_score_gemma":4.2843163e-7,"teacher_disagreement_score":0.92186147,"about_ca_system_score_codex":0.000003035103,"about_ca_system_score_gemma":0.000019270117,"threshold_uncertainty_score":0.4063389},"labels":[],"label_agreement":null},{"id":"W3040214011","doi":"10.1088/2632-2153/aba220","title":"A path towards quantum advantage in training deep generative models with quantum annealers","year":2020,"lang":"en","type":"article","venue":"Machine Learning Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; D-Wave Systems (Canada)","funders":"Air Force Research Laboratory; Intelligence Advanced Research Projects Activity","keywords":"Computer science; MNIST database; Quantum; Autoencoder; Quantum annealing; Boltzmann machine; Inference; Artificial intelligence; Quantum computer; Artificial neural network; Physics; Quantum mechanics","score_opus":0.014796486295433366,"score_gpt":0.23483964151451517,"score_spread":0.2200431552190818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040214011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6283392,0.00043676878,0.35545278,0.014821043,0.00006286383,0.0001532051,0.0000012073044,0.00052589877,0.00020707693],"genre_scores_gemma":[0.94598705,0.000029954334,0.053315066,0.0006096526,0.000026971793,0.000010839926,0.0000011123975,0.000013271836,0.0000060565844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997615,0.000071936236,0.00023943072,0.0009508376,0.0004464431,0.0006763894],"domain_scores_gemma":[0.99925846,0.000049492315,0.00012438193,0.00028027792,0.00011511572,0.00017226998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006591091,0.00024874296,0.0003329057,0.00056262227,0.00050695386,0.00018734258,0.0011254686,0.00009633296,0.0000021120186],"category_scores_gemma":[0.0002469005,0.00019159766,0.000023697537,0.0034142588,0.00071419135,0.0004930627,0.000570833,0.00092135044,0.0000031587988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003829281,0.000079261634,0.0071008923,0.000051244515,0.00002048945,0.0005444906,0.033328496,0.27562654,0.009014443,0.21432365,0.000008499584,0.4598637],"study_design_scores_gemma":[0.0004470171,0.0007895116,0.00034968686,0.000037437836,0.0000026287594,0.00010453338,0.001070203,0.9896232,0.00037049272,0.006673615,0.0002624181,0.0002692518],"about_ca_topic_score_codex":0.0000587501,"about_ca_topic_score_gemma":0.000018748533,"teacher_disagreement_score":0.71399665,"about_ca_system_score_codex":0.00003654748,"about_ca_system_score_gemma":0.000273564,"threshold_uncertainty_score":0.7813126},"labels":[],"label_agreement":null},{"id":"W3040915699","doi":"10.22323/1.372.0047","title":"Quantum Computing Future-Proofing What Lies Beyond SuperComputing","year":2020,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Joseph’s Healthcare Hamilton","funders":"","keywords":"Supercomputer; Computer science; Quantum computer; Power consumption; Green computing; Footprint; Quantum; Power (physics); Distributed computing; Cloud computing; Parallel computing; Operating system","score_opus":0.013488007915228067,"score_gpt":0.2265825718775243,"score_spread":0.21309456396229626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040915699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13613483,0.0013869036,0.8325532,0.025079692,0.0022505478,0.00019046162,9.0721437e-7,0.0015470941,0.0008563721],"genre_scores_gemma":[0.76801074,0.00002942423,0.2210952,0.008208308,0.002599944,0.0000013121138,0.0000050417143,0.000032270433,0.000017742841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713326,0.00014312788,0.0005064832,0.00096306845,0.00049117755,0.00076287973],"domain_scores_gemma":[0.9985787,0.00029851845,0.00013398695,0.0005320933,0.0001017305,0.0003549321],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043673185,0.00038172657,0.0004144437,0.00011439588,0.00059311505,0.0015780423,0.0016448814,0.00010770379,0.000018568226],"category_scores_gemma":[0.00006369564,0.00032782592,0.00019079717,0.00089187094,0.00006307159,0.0010924083,0.0012897453,0.000546949,0.00010649852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073620913,0.00006533195,0.00043716969,0.00010246473,0.000058409372,0.000116607756,0.016188119,0.024366867,0.0012223101,0.121504486,0.003514976,0.8324159],"study_design_scores_gemma":[0.00029512818,0.00013725243,0.0003690916,0.00007096289,0.000005217664,0.00005722306,0.00091171876,0.9881514,0.0009530624,0.002409192,0.006174663,0.00046512025],"about_ca_topic_score_codex":0.000019466072,"about_ca_topic_score_gemma":0.0000020218142,"teacher_disagreement_score":0.9637845,"about_ca_system_score_codex":0.000025133306,"about_ca_system_score_gemma":0.000075447286,"threshold_uncertainty_score":0.9999174},"labels":[],"label_agreement":null},{"id":"W3041200982","doi":"10.1007/978-3-030-52482-1_13","title":"Search-Based Transformation Synthesis for 3-Valued Reversible Circuits","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Victoria","funders":"","keywords":"Computer science; Transformation (genetics); Key (lock); Bounded function; Electronic circuit; Function (biology); Algorithm; Theoretical computer science; Mathematics; Electrical engineering","score_opus":0.02403921534280661,"score_gpt":0.2443682799480961,"score_spread":0.22032906460528948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041200982","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005894555,0.00015015231,0.9920734,0.004537314,0.0010239757,0.0008339903,0.0000293716,0.00032196718,0.00097086147],"genre_scores_gemma":[0.1986849,0.000011121274,0.79733956,0.0030576566,0.00071976066,0.000033298835,0.000017333748,0.00007178242,0.00006458645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959049,0.00005872976,0.00057241495,0.0015917807,0.0010931636,0.0007789825],"domain_scores_gemma":[0.9971897,0.0010144069,0.0002230138,0.001021459,0.00027446667,0.0002769299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010848114,0.0005800686,0.0006428423,0.00082162255,0.00047682758,0.0005885166,0.0033352864,0.00031363542,0.00001078661],"category_scores_gemma":[0.00017248117,0.0005428265,0.00030341785,0.0007906401,0.00043046614,0.0004317361,0.00042053885,0.00081623,0.0000305387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008449427,0.000021062282,0.0000022865609,0.00018574011,0.000013587592,0.000025900612,0.0008300809,0.22588392,0.00016728489,0.014944297,0.000028441267,0.757889],"study_design_scores_gemma":[0.0003481402,0.00023916214,0.000011614571,0.00049170793,0.000013951739,0.000020979036,1.8615795e-7,0.9499669,0.0069835195,0.040043097,0.0012690158,0.0006117387],"about_ca_topic_score_codex":0.000011079619,"about_ca_topic_score_gemma":0.000007985704,"teacher_disagreement_score":0.7572772,"about_ca_system_score_codex":0.00024580883,"about_ca_system_score_gemma":0.00095686055,"threshold_uncertainty_score":0.99970233},"labels":[],"label_agreement":null},{"id":"W3041379827","doi":"10.1103/physreva.105.062404","title":"Measurement error mitigation in quantum computers through classical bit-flip correction","year":2022,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Research and Innovation Foundation; Industry Canada; Government of Canada","keywords":"Qubit; Error detection and correction; Computer science; Quantum computer; Overhead (engineering); Quantum error correction; Operator (biology); Algorithm; Quantum; Quantum mechanics; Physics","score_opus":0.027402420182830498,"score_gpt":0.33214905536330636,"score_spread":0.30474663518047584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041379827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34166116,0.14934856,0.43111086,0.059990045,0.0071227797,0.007549739,0.000039913302,0.0015208379,0.0016561338],"genre_scores_gemma":[0.97730494,0.009062585,0.002444711,0.009649463,0.0007886011,0.0006351048,0.000031437583,0.00006250044,0.000020644233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99332404,0.0013997656,0.0009409904,0.0013446818,0.0021714189,0.00081907836],"domain_scores_gemma":[0.9974383,0.0004202664,0.0005063611,0.0011580263,0.00020735468,0.00026967554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001332446,0.0006013669,0.0015157198,0.00010189442,0.0004271813,0.00009786836,0.0015914709,0.000035367335,0.000014770741],"category_scores_gemma":[0.00049314584,0.00051321986,0.00083139085,0.002371862,0.00013062822,0.0004271502,0.0010178107,0.0014089302,0.00013986761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056983296,0.007855365,0.0002748167,0.008883812,0.0002204285,0.00017805262,0.0019150131,0.012791417,0.010389299,0.10713084,0.07320023,0.7771037],"study_design_scores_gemma":[0.0004696258,0.0005955589,0.0011227806,0.008414613,0.000102474,0.00004274073,0.000009969938,0.90263903,0.0005709052,0.022885526,0.062378846,0.00076794357],"about_ca_topic_score_codex":0.00005002998,"about_ca_topic_score_gemma":0.0000055873875,"teacher_disagreement_score":0.8898476,"about_ca_system_score_codex":0.0004780682,"about_ca_system_score_gemma":0.00022491913,"threshold_uncertainty_score":0.99973196},"labels":[],"label_agreement":null},{"id":"W3042833497","doi":"10.1016/j.laa.2020.07.018","title":"Complex Hadamard diagonalisable graphs","year":2020,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Victoria; University of Manitoba; University of Regina; York University","funders":"University Research Committee, Emory University; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canada Foundation for Innovation; Brandon University","keywords":"Hadamard transform; Mathematics; Complex Hadamard matrix; Hadamard three-lines theorem; Hadamard's inequality; Laplacian matrix; Hadamard matrix; Combinatorics; Discrete mathematics; Eigenvalues and eigenvectors; Hadamard three-circle theorem; Vertex (graph theory); Indifference graph; Chordal graph; Graph; Quantum mechanics","score_opus":0.02440982208039354,"score_gpt":0.24831994568753613,"score_spread":0.22391012360714257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042833497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02684416,0.0006982,0.94271624,0.02730434,0.00005354848,0.000428305,0.000026050317,0.00049981585,0.0014293148],"genre_scores_gemma":[0.8855269,0.0000884572,0.10715126,0.0066187754,0.0003846377,0.00007555313,0.000029942637,0.000018329483,0.00010613024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991374,0.000021686932,0.00015500886,0.00036729046,0.00013118214,0.0001874321],"domain_scores_gemma":[0.9993938,0.00007651943,0.000047166883,0.00023838997,0.000048220092,0.00019588039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005669782,0.000115001516,0.00012915913,0.00003212541,0.00025232715,0.000096935924,0.0004611271,0.000036197234,0.00002020541],"category_scores_gemma":[0.000012526457,0.00010238998,0.000046008365,0.00044517504,0.000034472734,0.000103510356,0.00023016454,0.00013654273,0.000096012634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003044531,0.00007816612,0.00017313633,0.000051308813,0.000032255815,0.000003456709,0.0009396324,0.00055368844,0.0028891675,0.876257,0.005041665,0.11397749],"study_design_scores_gemma":[0.0001513192,0.00004130067,0.00076638715,0.0000038328176,0.0000052579862,0.000008458167,0.000009137543,0.81329894,0.00043012755,0.011763797,0.17336853,0.0001528821],"about_ca_topic_score_codex":0.0000043534196,"about_ca_topic_score_gemma":6.1548707e-7,"teacher_disagreement_score":0.8644932,"about_ca_system_score_codex":0.000003008871,"about_ca_system_score_gemma":0.000022393331,"threshold_uncertainty_score":0.41753423},"labels":[],"label_agreement":null},{"id":"W3045111343","doi":"","title":"Hermitian dual-containing constacyclic BCH codes and related quantum codes of length (q 2m -1)/(q+1).","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"BCH code; Hermitian matrix; Dimension (graph theory); Integer (computer science); Prime power; Mathematics; Combinatorics; Quantum; Discrete mathematics; Physics; Prime (order theory); Quantum mechanics; Algorithm; Computer science; Decoding methods","score_opus":0.040348682691492214,"score_gpt":0.19392793831236887,"score_spread":0.15357925562087665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045111343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88098663,0.00033281345,0.11565285,0.0005545776,0.00050124316,0.00027724772,0.0000472133,0.00041693266,0.0012304639],"genre_scores_gemma":[0.99650514,0.00023655323,0.002932639,0.00011234663,0.000053946682,4.8112094e-7,0.00002455793,0.000027579252,0.000106749794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972975,0.000308568,0.00042775256,0.0013667409,0.0001491634,0.00045023288],"domain_scores_gemma":[0.99777544,0.00038757187,0.0005171159,0.00089275895,0.00014618243,0.00028093637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035148603,0.00045908935,0.000756417,0.00027617408,0.00023820804,0.0001400192,0.0011391523,0.00033556417,0.00001096357],"category_scores_gemma":[0.000082973565,0.0005036666,0.00022980337,0.00061072595,0.00038607218,0.00018179843,0.0025445493,0.0010613551,0.000012146208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012878844,0.00023235849,0.0056057987,0.00064915617,0.00086185447,0.0033466679,0.006639866,0.40264815,0.000582487,0.5701701,0.0002840068,0.008850735],"study_design_scores_gemma":[0.00066365226,0.00019109884,0.0015467246,0.00031535,0.00007985884,0.00006170092,0.0002713939,0.94439566,0.0001944389,0.051555946,0.00018995268,0.000534235],"about_ca_topic_score_codex":0.00030091166,"about_ca_topic_score_gemma":0.000024790992,"teacher_disagreement_score":0.5417475,"about_ca_system_score_codex":0.00006331451,"about_ca_system_score_gemma":0.00024014832,"threshold_uncertainty_score":0.9997415},"labels":[],"label_agreement":null},{"id":"W3046038196","doi":"10.1103/physrevlett.126.090401","title":"Operational Resource Theory of Imaginarity","year":2021,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Key Research and Development Program of China; European Regional Development Fund; National Natural Science Foundation of China; Uniwersytet Warszawski; Chinese Academy of Sciences; Fundamental Research Funds for the Central Universities; Pacific Institute for the Mathematical Sciences; University of Calgary","keywords":"Computer science; Resource (disambiguation); Quantum; Resource dependence theory; Statistical physics; Theoretical physics; Physics; Mathematical economics; Quantum mechanics; Mathematics; Computer network; Economics; Microeconomics","score_opus":0.011740414004740138,"score_gpt":0.2673456294431981,"score_spread":0.255605215438458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046038196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15722072,0.021175524,0.67739236,0.14200574,0.00024233582,0.00025821617,0.000008258658,0.00016245269,0.0015344145],"genre_scores_gemma":[0.7824545,0.0006905502,0.07541282,0.14072736,0.0005970961,0.000017298622,0.000018906883,0.000021213631,0.000060271646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990142,0.00022026026,0.00014841996,0.00025097563,0.00023127491,0.00013488303],"domain_scores_gemma":[0.9992411,0.0002041852,0.000055564153,0.00039906387,0.000053276046,0.000046789984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024079556,0.000088446,0.00021904428,0.000013459262,0.00005111152,0.000030455974,0.00039624772,0.000003843668,0.000010216838],"category_scores_gemma":[0.00008308474,0.000070642454,0.00013394983,0.0002742278,0.000056784356,0.00008280419,0.00021865842,0.0001463598,0.000016198564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052608616,0.0005876789,0.00016273315,0.001713973,0.00009864529,0.00015411882,0.000972939,0.00501928,0.053386502,0.54277194,0.029211761,0.36591515],"study_design_scores_gemma":[0.0007498416,0.00014024551,0.0068599554,0.0047845542,0.000108749264,0.00023733036,0.0000135229875,0.68705744,0.018378602,0.06054762,0.21998769,0.0011344695],"about_ca_topic_score_codex":0.0000011764389,"about_ca_topic_score_gemma":4.849614e-8,"teacher_disagreement_score":0.6820381,"about_ca_system_score_codex":0.000008096691,"about_ca_system_score_gemma":0.000039323935,"threshold_uncertainty_score":0.28807157},"labels":[],"label_agreement":null},{"id":"W3046716817","doi":"10.3389/fphy.2020.589504","title":"Qudits and High-Dimensional Quantum Computing","year":2020,"lang":"en","type":"article","venue":"Frontiers in Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":481,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada; Government of Alberta; National Science Foundation","keywords":"Quantum computer; Qubit; Computer science; Controlled NOT gate; Quantum gate; Quantum Fourier transform; Quantum circuit; Quantum algorithm; Algorithm; Quantum network; Quantum; Physics; Quantum mechanics","score_opus":0.009272681603446829,"score_gpt":0.20593440221146206,"score_spread":0.19666172060801523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046716817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13307396,0.0002009949,0.86316484,0.0024672914,0.0008484494,0.00007120951,0.0000022227955,0.00012538783,0.000045651184],"genre_scores_gemma":[0.74158174,0.000004075193,0.25677678,0.001226404,0.00039490932,6.9097916e-7,0.0000023847213,0.00000953214,0.0000034623904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989038,0.00005215073,0.00016725036,0.0004126303,0.0001991435,0.0002650128],"domain_scores_gemma":[0.9995663,0.000047364185,0.000065976055,0.00018044843,0.000024530893,0.00011537058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009585127,0.0001451973,0.00022238007,0.000035069028,0.00010657515,0.00007478235,0.00038336037,0.000039216127,5.2185464e-7],"category_scores_gemma":[0.000019796322,0.00013934675,0.000035075922,0.0003957559,0.000053893604,0.00013834696,0.000373071,0.00025942567,0.0000050186077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017836,0.00010611583,0.008052799,0.000073225434,0.000047451067,0.00010011434,0.0043734605,0.11462304,0.00023189354,0.05580252,0.029080585,0.78749096],"study_design_scores_gemma":[0.00031387256,0.000056526595,0.0031112258,0.00002613359,0.0000021565313,0.0000039260367,0.000015605354,0.9696679,0.00013908585,0.026051886,0.00044165098,0.00017003926],"about_ca_topic_score_codex":0.00001213116,"about_ca_topic_score_gemma":3.2562707e-7,"teacher_disagreement_score":0.85504484,"about_ca_system_score_codex":0.000014889339,"about_ca_system_score_gemma":0.00003500524,"threshold_uncertainty_score":0.56823957},"labels":[],"label_agreement":null},{"id":"W3047180424","doi":"10.1103/physrevresearch.3.023092","title":"Quantum-optimal-control-inspired ansatz for variational quantum algorithms","year":2021,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Sherbrooke","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Ansatz; Quantum; Quantum algorithm; Quantum control; Algorithm; Optimal control; Computer science; Mathematics; Physics; Mathematical optimization; Quantum mechanics; Mathematical physics","score_opus":0.05539146404889738,"score_gpt":0.3838026292654731,"score_spread":0.3284111652165757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047180424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040018386,0.022189086,0.953195,0.018671498,0.0003904238,0.0010297633,0.000052660063,0.00021404772,0.00025571024],"genre_scores_gemma":[0.6356962,0.010085486,0.33840472,0.007021541,0.005937994,0.0015300532,0.00019406412,0.00020338036,0.0009265627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532354,0.00077334227,0.00045622198,0.0010369562,0.0014121042,0.0009978164],"domain_scores_gemma":[0.99512327,0.0022591501,0.00010899513,0.0010416062,0.0011546306,0.00031232327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002307126,0.0002728048,0.0006579069,0.000118223325,0.00053379365,0.0003011658,0.0013409127,0.000059095993,0.000025731033],"category_scores_gemma":[0.0013455992,0.000226449,0.0004369069,0.0015180113,0.00012851234,0.00026099436,0.00049495004,0.00071124797,0.00015212515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025739664,0.0010650825,0.000015689255,0.0016504927,0.00015264713,0.00011795644,0.0003346697,0.0023353635,0.0032636214,0.7073588,0.012355284,0.2713247],"study_design_scores_gemma":[0.00056495564,0.00023746965,0.00024702176,0.0005691225,0.00001726839,0.000026404845,0.000004441235,0.8981951,0.0003527285,0.059517648,0.040009603,0.00025824422],"about_ca_topic_score_codex":0.000019378704,"about_ca_topic_score_gemma":0.0000013482772,"teacher_disagreement_score":0.8958597,"about_ca_system_score_codex":0.00007738453,"about_ca_system_score_gemma":0.00060272473,"threshold_uncertainty_score":0.92343223},"labels":[],"label_agreement":null},{"id":"W3048801116","doi":"10.1103/physreva.103.042405","title":"Improving Hamiltonian encodings with the Gray code","year":2021,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; TRIUMF","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Gray (unit); Gray code; Computer science; Programming language; Mathematics; Algorithm; Medicine","score_opus":0.00956348489008665,"score_gpt":0.3003099071900789,"score_spread":0.29074642229999226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048801116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16792235,0.2997561,0.42406714,0.09891661,0.0006157616,0.003368213,0.000040122184,0.0010896467,0.004224065],"genre_scores_gemma":[0.86249113,0.07260915,0.019005869,0.042976473,0.0020506133,0.00039831872,0.000027799115,0.0001432874,0.00029734333],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960835,0.00050062896,0.00047546736,0.0011682091,0.0009904512,0.0007817401],"domain_scores_gemma":[0.9964925,0.0006917219,0.0003806923,0.0017969172,0.0003097796,0.00032840707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060596893,0.0005698622,0.0013447925,0.000027750259,0.00039482152,0.00023126935,0.0018134214,0.000030213583,0.0000094461175],"category_scores_gemma":[0.00049280806,0.0003117331,0.00070778094,0.0016548533,0.00020480478,0.00030227588,0.0008235466,0.0009201241,0.00021141062],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000857549,0.0011811865,0.00007266301,0.011014246,0.00019101182,0.00028072624,0.00073798234,0.0001246472,0.028239988,0.09969791,0.011473066,0.846978],"study_design_scores_gemma":[0.0010025541,0.0009679314,0.0011684971,0.043544665,0.0010011257,0.00043846222,0.00002256549,0.4066026,0.023605525,0.039224178,0.47955498,0.0028669292],"about_ca_topic_score_codex":0.000019046625,"about_ca_topic_score_gemma":0.000009362653,"teacher_disagreement_score":0.8441111,"about_ca_system_score_codex":0.000053765012,"about_ca_system_score_gemma":0.00025031462,"threshold_uncertainty_score":0.9999335},"labels":[],"label_agreement":null},{"id":"W3049070297","doi":"10.1103/physreva.103.012405","title":"Estimating the gradient and higher-order derivatives on quantum hardware","year":2021,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":154,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Defense Advanced Research Projects Agency","keywords":"Hessian matrix; Estimator; Metric (unit); Applied mathematics; Quantum circuit; Computer science; Quantum; Hyperparameter; Simple (philosophy); Tensor (intrinsic definition); Divergence (linguistics); Quantum algorithm; Algorithm; Quantum phase estimation algorithm; Quantum computer; Mathematical optimization; Mathematics; Quantum error correction; Pure mathematics; Quantum mechanics; Statistics; Physics","score_opus":0.018759171317931925,"score_gpt":0.33342295140831973,"score_spread":0.3146637800903878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049070297","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3489019,0.3554708,0.18368632,0.10432418,0.0014428688,0.002765133,0.000030788404,0.0007345868,0.0026434436],"genre_scores_gemma":[0.8696813,0.058673788,0.032263972,0.036283113,0.0024174908,0.0003807225,0.000032105236,0.00011637912,0.00015109946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655324,0.0006187936,0.0004889482,0.0010343931,0.0007282031,0.00057640846],"domain_scores_gemma":[0.99689174,0.0010700236,0.0002884576,0.001253304,0.00023767802,0.00025880168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042444616,0.00050017465,0.0011251544,0.000025407628,0.00039547263,0.00017726325,0.0009733669,0.000025962967,0.000010029176],"category_scores_gemma":[0.0009899527,0.00029821266,0.00045471167,0.0012141679,0.00019634527,0.00019711266,0.0007498002,0.0007114377,0.000117917836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046670416,0.0010436744,0.000039977946,0.007367083,0.00013626931,0.00009749549,0.00063541887,0.00037151494,0.002379464,0.33124605,0.0053166575,0.65136176],"study_design_scores_gemma":[0.00040166674,0.00050743285,0.0027844063,0.033148065,0.0002616522,0.0000745757,0.000007763236,0.7172245,0.002240691,0.16122593,0.08096451,0.0011588562],"about_ca_topic_score_codex":0.0000059455833,"about_ca_topic_score_gemma":5.6112526e-7,"teacher_disagreement_score":0.71685296,"about_ca_system_score_codex":0.000033944743,"about_ca_system_score_gemma":0.00009666355,"threshold_uncertainty_score":0.999947},"labels":[],"label_agreement":null},{"id":"W3049203993","doi":"10.1038/s41598-020-80070-1","title":"Hybrid quantum-classical approach to enhanced quantum metrology","year":2021,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"National Science Fund for Distinguished Young Scholars; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Quantum metrology; Metrology; Protocol (science); Unitary state; Noise (video); Scheme (mathematics); Quantum; Quantum sensor","score_opus":0.013166155337061669,"score_gpt":0.2409065069642018,"score_spread":0.22774035162714013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049203993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.318509,0.00013944054,0.6667897,0.0014058687,0.010353426,0.00016706577,0.0000013244827,0.00030410444,0.0023300108],"genre_scores_gemma":[0.9133021,0.0000010558837,0.084442526,0.00040289728,0.00020337506,0.00002395999,0.000022848593,0.000019514666,0.0015816978],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951546,0.00020441522,0.0006711289,0.0022409887,0.0008923902,0.0008364815],"domain_scores_gemma":[0.9965105,0.000109352375,0.00023656855,0.0023674923,0.00034914713,0.0004269589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015748973,0.00028132412,0.00043250676,0.0003056797,0.00057710434,0.00095074513,0.0008931096,0.000081022146,0.000022449432],"category_scores_gemma":[0.00044900042,0.0002477604,0.0002189935,0.0015505957,0.00019753318,0.00021922293,0.0009500393,0.00034867882,0.00010376092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029501049,0.002472842,0.0002756687,0.00015918836,0.00022205348,0.011813419,0.0050086053,0.043458153,0.4004641,0.2192857,0.15294059,0.16387019],"study_design_scores_gemma":[0.00022099582,0.00012435645,0.0003156001,0.00003822629,0.000015368007,0.0042091007,0.0000487007,0.67705303,0.13348892,0.096372485,0.08743469,0.0006785435],"about_ca_topic_score_codex":0.0000091183065,"about_ca_topic_score_gemma":0.000002646455,"teacher_disagreement_score":0.6335949,"about_ca_system_score_codex":0.00005488742,"about_ca_system_score_gemma":0.00046009044,"threshold_uncertainty_score":0.99999744},"labels":[],"label_agreement":null},{"id":"W3081061531","doi":"10.1103/prxquantum.2.030334","title":"Simulating 2D Effects in Lattice Gauge Theories on a Quantum Computer","year":2021,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Horizon 2020; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Ministerio de Ciencia, Innovación y Universidades; Natural Sciences and Engineering Research Council of Canada; European Commission; Universitat Autònoma de Barcelona; Alexander von Humboldt-Stiftung; American Friends of the Alexander von Humboldt Foundation; European Regional Development Fund; Alfred P. Sloan Foundation","keywords":"Quantum simulator; Quantum computer; Open quantum system; Observable; Quantum; Quantum information; Quantum technology; Quantum algorithm; Quantum network; Quantum process","score_opus":0.009694532647738886,"score_gpt":0.24957506377867236,"score_spread":0.23988053113093347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081061531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69270086,0.0003693128,0.3021409,0.0019200017,0.0017127517,0.00023572537,0.0000036649828,0.0003967222,0.0005200696],"genre_scores_gemma":[0.9584983,0.000008516035,0.039514877,0.0015033506,0.00036428394,0.000012609293,0.0000064818378,0.000032474814,0.000059128997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698174,0.00047325031,0.00044808246,0.00089599995,0.00047469002,0.00072622724],"domain_scores_gemma":[0.9968614,0.0018561543,0.00014573806,0.0008778724,0.000107979904,0.00015086199],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000591436,0.00036130863,0.0004544567,0.00019904083,0.00025510433,0.00034678384,0.0008039557,0.00012152105,0.0000099560975],"category_scores_gemma":[0.0002922224,0.0003210764,0.00015140715,0.0009401677,0.00006841213,0.00023861902,0.00060814724,0.0006117166,0.00009747104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017181823,0.00026750847,0.0007494543,0.00013765863,0.000027786426,0.00078571436,0.002139341,0.02567572,0.00034738626,0.9229348,0.00020377556,0.046713706],"study_design_scores_gemma":[0.00063609437,0.00024375177,0.0061770068,0.00032415835,0.000005897361,0.000054616416,0.00002461879,0.8757044,0.00091330457,0.11433906,0.0012020598,0.00037503033],"about_ca_topic_score_codex":0.000039784,"about_ca_topic_score_gemma":0.000014716427,"teacher_disagreement_score":0.8500287,"about_ca_system_score_codex":0.00005380508,"about_ca_system_score_gemma":0.00012420595,"threshold_uncertainty_score":0.9999241},"labels":[],"label_agreement":null},{"id":"W3081124664","doi":"10.1007/s11128-020-02758-7","title":"Quantum walk inspired algorithm for graph similarity and isomorphism","year":2020,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph isomorphism; Quantum walk; Quantum computer; Computer science; Quantum algorithm; Isomorphism (crystallography); Quantum; Graph; Algorithm; Theoretical computer science; Line graph; Physics; Quantum mechanics; Crystallography; Crystal structure","score_opus":0.016827082850405253,"score_gpt":0.23555613522079563,"score_spread":0.21872905237039036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081124664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012665141,0.00028585034,0.9803064,0.005518092,0.00023880308,0.00034939774,0.000025853773,0.00051270134,0.00009776085],"genre_scores_gemma":[0.69823515,0.000024911502,0.29517356,0.006275836,0.00019384339,0.00002477911,0.00005248536,0.000016280537,0.00000316057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983142,0.000035300298,0.0005666396,0.00033652972,0.00033846227,0.00040884514],"domain_scores_gemma":[0.9988745,0.00008799771,0.00033969252,0.0002214567,0.00023879671,0.00023759948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033441282,0.0002600717,0.00028219578,0.00016642234,0.0005944306,0.0007453243,0.00055533386,0.00011596874,0.000003109261],"category_scores_gemma":[0.00011994675,0.00023878664,0.000085208805,0.00060569483,0.000080757396,0.002668103,0.00017866165,0.000266145,0.000012616039],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009416526,0.000015983695,0.000040286828,0.00025273205,0.00001114928,0.0000020935893,0.0045632515,0.0008896278,0.000037218128,0.009641135,0.00036325838,0.98417383],"study_design_scores_gemma":[0.0006896091,0.00019334497,0.00046481317,0.000058892314,0.000009080884,0.000027289116,0.000140496,0.976614,0.00023390018,0.0141372355,0.0071056713,0.00032568024],"about_ca_topic_score_codex":0.000012777743,"about_ca_topic_score_gemma":4.8320044e-7,"teacher_disagreement_score":0.98384815,"about_ca_system_score_codex":0.000015637874,"about_ca_system_score_gemma":0.000134168,"threshold_uncertainty_score":0.9737436},"labels":[],"label_agreement":null},{"id":"W3081696210","doi":"10.4230/lipics.mfcs.2020.26","title":"Span Programs and Quantum Time Complexity.","year":2020,"lang":"en","type":"article","venue":"UvA-DARE (University of Amsterdam)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"QuantERA; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Quantum complexity theory; Computer science; Quantum algorithm; Time complexity; Quantum phase estimation algorithm; Span (engineering); Algorithm; Computational complexity theory; Quantum computer; Worst-case complexity; Quantum; Theoretical computer science; Average-case complexity; Quantum error correction; Physics; Quantum mechanics","score_opus":0.02141957794863317,"score_gpt":0.18814059084277543,"score_spread":0.16672101289414226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081696210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7336387,0.0001119961,0.24887213,0.015038576,0.00012442592,0.00027754816,0.000014328593,0.0004587376,0.0014635654],"genre_scores_gemma":[0.93488383,0.0000062822437,0.064505585,0.0003443035,0.000060390255,8.169101e-8,0.000010122769,0.000009804535,0.00017958939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890226,0.000066280816,0.00010779149,0.00043245166,0.00023353506,0.00025766867],"domain_scores_gemma":[0.99925834,0.000039485803,0.00011347613,0.00029930926,0.00006721055,0.00022220245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000095364274,0.00015217155,0.0002689309,0.00006981979,0.00023107808,0.000071031456,0.000831794,0.000057841193,0.00003846784],"category_scores_gemma":[0.000009395113,0.00016972658,0.000089399386,0.00035735746,0.00023416663,0.0002398134,0.0008073391,0.00017503249,0.000062825326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014955841,0.0004050744,0.0051604076,0.00043082677,0.0002475304,0.00057702087,0.046234835,0.00071920775,0.0029788818,0.044878893,0.0070865657,0.8911312],"study_design_scores_gemma":[0.0007759647,0.00060945854,0.00956422,0.00007764844,0.000017646076,0.000035586072,0.0005113554,0.9704967,0.00005420835,0.0021844942,0.015335508,0.00033717387],"about_ca_topic_score_codex":0.00010431293,"about_ca_topic_score_gemma":0.000012726256,"teacher_disagreement_score":0.9697775,"about_ca_system_score_codex":0.000012109272,"about_ca_system_score_gemma":0.00003908847,"threshold_uncertainty_score":0.6921249},"labels":[],"label_agreement":null},{"id":"W3081775422","doi":"10.1109/embc44109.2020.9175415","title":"A Hamiltonian Engine for Radiotherapy Optimization","year":2020,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"HERO; Quadratic unconstrained binary optimization; Computer science; Software; Mathematical optimization; Radiation treatment planning; Radiation therapy; Artificial intelligence; Mathematics; Quantum computer; Physics; Programming language; Quantum; Medicine","score_opus":0.012020847475757362,"score_gpt":0.2249598053536623,"score_spread":0.21293895787790496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081775422","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038124638,0.00007262441,0.9793966,0.019413255,0.00010894534,0.00013373992,9.855786e-7,0.0003214701,0.00017114544],"genre_scores_gemma":[0.020849794,0.0000057911957,0.9748769,0.0039846622,0.00020441556,0.0000056833587,0.0000017735754,0.000007706375,0.00006328908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994812,0.000010891679,0.00008741818,0.00021275009,0.00007197833,0.00013573628],"domain_scores_gemma":[0.9996945,0.00004103372,0.000022762939,0.00013749245,0.000026030799,0.00007814758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005417338,0.00007122289,0.00008214735,0.000023556993,0.00006489362,0.000080369406,0.00033495852,0.000021999103,0.00001264605],"category_scores_gemma":[0.000016308499,0.000057830704,0.00004511032,0.0001923906,0.0000072635244,0.000075499076,0.00003956988,0.00004390518,0.0000026758057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031421919,0.000009160232,0.0000050080625,0.000006763011,0.000007626956,0.0000010782709,0.0006009421,0.8837669,0.0001657299,0.00552811,0.001225612,0.10867992],"study_design_scores_gemma":[0.0002962814,0.00013180623,0.000021577822,0.00000239243,8.2590066e-7,0.000002909978,0.0000021745857,0.9839506,0.00030007013,0.00016787476,0.015038972,0.00008448705],"about_ca_topic_score_codex":0.0000016186144,"about_ca_topic_score_gemma":1.7762973e-7,"teacher_disagreement_score":0.10859543,"about_ca_system_score_codex":0.000005838504,"about_ca_system_score_gemma":0.000019112098,"threshold_uncertainty_score":0.23582676},"labels":[],"label_agreement":null},{"id":"W3082756794","doi":"10.4230/lipics.itcs.2021.32","title":"Bounds on the QAC$^0$ Complexity of Approximating Parity","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Toffoli gate; Upper and lower bounds; Electronic circuit; Parity (physics); Qubit; Mathematics; Physics; Discrete mathematics; Quantum; Combinatorics; Quantum gate; Quantum mechanics; Mathematical analysis","score_opus":0.0579366486334525,"score_gpt":0.2758983058560783,"score_spread":0.21796165722262578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082756794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1481175,0.00006524517,0.8322081,0.0076844334,0.002499097,0.0026538263,0.0012328713,0.00060771656,0.004931204],"genre_scores_gemma":[0.8043574,0.000013306729,0.19210747,0.0025104438,0.00041686857,0.0001272493,0.00037037386,0.000061785,0.00003509775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953706,0.00016494385,0.0019450944,0.00064375723,0.0010195115,0.0008560466],"domain_scores_gemma":[0.99497294,0.00057392224,0.001743423,0.00212248,0.00034666277,0.00024054361],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013726121,0.0007713476,0.0010880802,0.00021279955,0.000668664,0.0009039167,0.0044458965,0.00041528622,0.000011594008],"category_scores_gemma":[0.0003547558,0.0005557802,0.0006953281,0.0004212023,0.0004728296,0.0003306949,0.0047209924,0.0023361025,0.00004248416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026130793,0.0016278726,0.0016070487,0.011663879,0.001552654,0.000024474799,0.08102262,0.027769465,0.000097385535,0.7843111,0.020433772,0.069628425],"study_design_scores_gemma":[0.0007293167,0.00026527277,0.00047286446,0.0006328529,0.000034266475,0.000020746564,0.0002681498,0.93598086,0.00054342847,0.054258958,0.0061752344,0.00061805994],"about_ca_topic_score_codex":0.00004866764,"about_ca_topic_score_gemma":0.000007180254,"teacher_disagreement_score":0.9082114,"about_ca_system_score_codex":0.00011225348,"about_ca_system_score_gemma":0.0002475869,"threshold_uncertainty_score":0.99996555},"labels":[],"label_agreement":null},{"id":"W3083435740","doi":"10.22331/q-2024-02-12-1251","title":"Fast simulation of planar Clifford circuits","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Planar; Electronic circuit; Computer science; Parallel computing; Computer graphics (images); Electrical engineering; Engineering","score_opus":0.01671935625166259,"score_gpt":0.2652837022031829,"score_spread":0.24856434595152033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083435740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1314141,0.00041743132,0.86585736,0.00037184102,0.0009527435,0.00006997241,0.0000058683654,0.00032211834,0.00058856216],"genre_scores_gemma":[0.9957913,0.0000039726747,0.003900489,0.00006287974,0.00014690969,0.0000014264008,0.0000029122123,0.00000997164,0.00008014287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990382,0.000033969365,0.00021520733,0.0002898924,0.00022411121,0.00019860356],"domain_scores_gemma":[0.9993607,0.00019787786,0.00004441351,0.0003095657,0.000034775017,0.000052674328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018579855,0.00010593053,0.00013388185,0.00013745952,0.000060710965,0.00010525289,0.00041255777,0.000047290738,0.000007441127],"category_scores_gemma":[0.000021140462,0.00008882988,0.00007814402,0.000414708,0.000029201952,0.00014864605,0.000067817586,0.00014165093,0.00005247065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024682358,0.00005449633,0.00015866487,0.00016737434,0.000038342463,0.00007007334,0.0020983992,0.15866432,0.0017637319,0.3605941,0.00079817465,0.47558984],"study_design_scores_gemma":[0.000060611237,0.00008820963,0.0007085235,0.00009350018,0.0000036381402,0.000012979529,0.000008488848,0.96871233,0.00020601178,0.026568893,0.0034302557,0.000106552754],"about_ca_topic_score_codex":0.000009410794,"about_ca_topic_score_gemma":7.1710735e-7,"teacher_disagreement_score":0.8643772,"about_ca_system_score_codex":0.000012592361,"about_ca_system_score_gemma":0.0000429014,"threshold_uncertainty_score":0.36223775},"labels":[],"label_agreement":null},{"id":"W3084142775","doi":"10.22331/q-2022-08-11-774","title":"Mitiq: A software package for error mitigation on noisy quantum computers","year":2022,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; University of Waterloo","funders":"Advanced Scientific Computing Research; Los Alamos National Laboratory; National Nuclear Security Administration; National Aeronautics and Space Administration; Office of Science; Fundación Bancaria Caixa d'Estalvis i Pensions de Barcelona; Laboratory Directed Research and Development; U.S. Department of Energy","keywords":"Quantum computer; Computer science; IBM; Software; Overhead (engineering); Noise (video); Computer engineering; Extrapolation; Quantum; Computation; Computational science; Code (set theory); Error detection and correction; Algorithm; Operating system; Artificial intelligence; Programming language; Physics; Mathematics","score_opus":0.01563792829627739,"score_gpt":0.25168649604884763,"score_spread":0.23604856775257024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084142775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18814316,0.0001231304,0.8030298,0.0044194637,0.0028487593,0.00057956914,0.00010508399,0.0006996773,0.000051369552],"genre_scores_gemma":[0.9188181,0.0000028270829,0.07711256,0.0031406544,0.0003883225,0.00021608552,0.00009860699,0.00006146443,0.00016135184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972049,0.00021808494,0.00040315386,0.0008671904,0.0006349053,0.00067178713],"domain_scores_gemma":[0.998022,0.0006196143,0.00022792039,0.0008681261,0.00008705946,0.00017525544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005433896,0.00032752563,0.00033544877,0.00026135685,0.0011178113,0.00020313305,0.0014543462,0.00006505776,0.000024333669],"category_scores_gemma":[0.00010452847,0.000323777,0.0002752678,0.0005786999,0.00006372865,0.00017430143,0.00056561,0.0004691308,0.000041282306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020882058,0.0011776792,0.00039614274,0.00025415787,0.00018121571,0.00026838505,0.0067921146,0.08303798,0.0022633811,0.60263926,0.0900641,0.21271677],"study_design_scores_gemma":[0.00085962313,0.001227742,0.0007272941,0.00004473999,0.000010092211,0.00006582347,0.00009794577,0.9358228,0.00045985152,0.029104978,0.031101242,0.00047789994],"about_ca_topic_score_codex":0.000024026771,"about_ca_topic_score_gemma":0.0000019179613,"teacher_disagreement_score":0.8527848,"about_ca_system_score_codex":0.00012099885,"about_ca_system_score_gemma":0.00012791627,"threshold_uncertainty_score":0.99992144},"labels":[],"label_agreement":null},{"id":"W3084982751","doi":"10.1103/physrevapplied.14.034034","title":"Analog-Quantum Feature Mapping for Machine-Learning Applications","year":2020,"lang":"en","type":"article","venue":"Physical Review Applied","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Feature (linguistics); Computer science; Quantum; Artificial intelligence; Pattern recognition (psychology); Physics; Quantum mechanics; Linguistics; Philosophy","score_opus":0.020134093589291448,"score_gpt":0.27206314113720076,"score_spread":0.2519290475479093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084982751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026223838,0.005660546,0.97856754,0.0131591745,0.000033367218,0.0010875358,0.000008315848,0.00040608525,0.00081519724],"genre_scores_gemma":[0.7426493,0.0021395378,0.22438909,0.026601959,0.00240115,0.0015285725,0.00014117679,0.00009261917,0.000056552766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986361,0.000040306895,0.0002035425,0.0005849651,0.00021670797,0.00031835173],"domain_scores_gemma":[0.99903053,0.0002241611,0.00014294525,0.00034793,0.00006095808,0.00019346407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015485469,0.00021766094,0.00043818878,0.000025628633,0.00024037309,0.00007916044,0.0008201711,0.000029360537,0.000002563696],"category_scores_gemma":[0.00007104166,0.0001770597,0.00018902717,0.0008733537,0.000027939328,0.000055415436,0.0002591718,0.00040902998,0.00007599836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056291356,0.00010361828,0.000009630817,0.002134438,0.000049875827,0.0000022869206,0.00051253854,0.0013794586,0.004637533,0.4449767,0.0040465747,0.54214174],"study_design_scores_gemma":[0.0001537938,0.00004483194,0.000028064986,0.00012669773,0.000018578234,0.000002053152,0.0000032808405,0.682252,0.0001400897,0.010652321,0.30636585,0.00021244501],"about_ca_topic_score_codex":9.574972e-7,"about_ca_topic_score_gemma":9.4058194e-8,"teacher_disagreement_score":0.75417846,"about_ca_system_score_codex":0.0000121437,"about_ca_system_score_gemma":0.00003513947,"threshold_uncertainty_score":0.72202855},"labels":[],"label_agreement":null},{"id":"W3088153896","doi":"10.1103/prxquantum.2.020340","title":"Single-Shot Error Correction of Three-Dimensional Homological Product Codes","year":2021,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Ministry of Colleges and Universities; QuantERA; Bundesministerium für Bildung und Forschung; Deutsche Forschungsgemeinschaft; European Commission; Government of Canada; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada","keywords":"Error detection and correction; Robustness (evolution); Product (mathematics); Coding theory; Algebra over a field","score_opus":0.04069394506398267,"score_gpt":0.2614316899921308,"score_spread":0.22073774492814813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088153896","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9194962,0.0007448001,0.07463977,0.0016466307,0.0027110807,0.00012536731,0.000004020509,0.00023862712,0.00039351752],"genre_scores_gemma":[0.9737062,0.000002331762,0.02584256,0.00015367186,0.00016358765,0.0000042609013,0.000008253075,0.000009573647,0.00010956665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983788,0.00012704096,0.00029505647,0.00055433623,0.00034760544,0.00029713288],"domain_scores_gemma":[0.99886256,0.00019892553,0.00013577972,0.0005030433,0.00022130852,0.0000783912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002864739,0.00016368645,0.00026772788,0.00007326096,0.000148231,0.00006151742,0.0004009232,0.00006250746,0.000027377268],"category_scores_gemma":[0.00022646345,0.00013451173,0.00011034593,0.00050626934,0.00010083479,0.000110718975,0.00034241806,0.00024485085,0.000016165483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019644429,0.0044073868,0.007753138,0.0002750654,0.00027428765,0.0010801465,0.0019456332,0.097084224,0.2846026,0.05988039,0.011805306,0.5306954],"study_design_scores_gemma":[0.0002156891,0.00036996382,0.0069361934,0.00007322625,0.000009334769,0.00036540706,0.000010020087,0.927929,0.05515736,0.00733337,0.0013682721,0.00023216252],"about_ca_topic_score_codex":0.000027578768,"about_ca_topic_score_gemma":0.000028445771,"teacher_disagreement_score":0.83084476,"about_ca_system_score_codex":0.000021391197,"about_ca_system_score_gemma":0.00012768513,"threshold_uncertainty_score":0.54852295},"labels":[],"label_agreement":null},{"id":"W3088577080","doi":"10.21468/scipostphys.10.3.066","title":"Local optimization on pure Gaussian state manifolds","year":2021,"lang":"en","type":"article","venue":"SciPost Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Deutsche Forschungsgemeinschaft; European Commission; Government of Canada; Ontario Ministry of Research, Innovation and Science; Imperial College London; Foundational Questions Institute; Heinrich Böll Stiftung; Villum Fonden","keywords":"Gaussian; Symplectic geometry; Parametrization (atmospheric modeling); Quantum entanglement; Gradient descent; Context (archaeology); Covariance; Gaussian random field","score_opus":0.008169946732536161,"score_gpt":0.22407677521468822,"score_spread":0.21590682848215206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088577080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007768913,0.0000410428,0.9881066,0.0016561401,0.0004930763,0.000059326263,0.0000058106407,0.00018895829,0.0016801336],"genre_scores_gemma":[0.8802738,0.000013643561,0.11727969,0.0014384707,0.0003713594,0.0000043255714,0.000031896005,0.000030277819,0.0005565038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987515,0.000065652996,0.00013921659,0.00043750333,0.00031352538,0.00029255264],"domain_scores_gemma":[0.9991572,0.00004077159,0.00006147073,0.0005472423,0.00009495459,0.00009836965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087528075,0.0001539959,0.00013483866,0.000031248866,0.00019533912,0.00023039899,0.0004334446,0.000038928625,0.000010282396],"category_scores_gemma":[0.000008451797,0.00013968792,0.00007184317,0.0005545397,0.00003998017,0.00017078828,0.00025359803,0.0002035281,0.00006953097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023909224,0.00007960317,0.000011145781,0.000009108826,0.000011821327,0.00007249484,0.00035497677,0.8365076,0.00009388417,0.027515624,0.0003291687,0.13501216],"study_design_scores_gemma":[0.00018132942,0.00008817832,0.00022436042,0.0000412272,0.0000034281618,0.000019528303,0.0000122152,0.97768736,0.005823109,0.014859579,0.0008680795,0.00019157847],"about_ca_topic_score_codex":0.000003876823,"about_ca_topic_score_gemma":0.0000026258188,"teacher_disagreement_score":0.8725049,"about_ca_system_score_codex":0.000030917934,"about_ca_system_score_gemma":0.000112247886,"threshold_uncertainty_score":0.56963086},"labels":[],"label_agreement":null},{"id":"W3089297555","doi":"10.1038/s41598-020-72469-7","title":"Quantum circuit optimization using quantum Karnaugh map","year":2020,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"Air Force Office of Scientific Research; Institute for Information and Communications Technology Promotion; Iran Telecommunication Research Center; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning; National Research Foundation; Air Force Research Laboratory; Asian Office of Aerospace Research and Development","keywords":"Quantum circuit; Quantum gate; Quantum computer; Quantum algorithm; Computer science; Toffoli gate; Quantum error correction; Qubit; Quantum network; Quantum; Quantum Fourier transform; Electronic circuit; Algorithm; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.028912757039172083,"score_gpt":0.242180876242328,"score_spread":0.21326811920315591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089297555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06725743,0.00019510594,0.91889006,0.0018979021,0.0107312,0.00023144834,0.0000012442563,0.0005148611,0.00028074952],"genre_scores_gemma":[0.9095911,0.0000015637686,0.08936935,0.0004459281,0.00038875907,0.000004232999,0.000018596715,0.000030377443,0.00015011862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965526,0.00009406919,0.0006214643,0.0013930578,0.0008034478,0.0005353959],"domain_scores_gemma":[0.9978894,0.00004091309,0.00042344615,0.0011161073,0.00020055502,0.0003296039],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00093107874,0.00023990925,0.00026858653,0.0001684381,0.0007008922,0.001216586,0.0006861906,0.000081783975,0.000030570154],"category_scores_gemma":[0.00016886262,0.00022176308,0.0001482406,0.0013308515,0.00015246426,0.0005003174,0.00045278767,0.00024730628,0.000041002826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002529709,0.000062420055,0.00036926474,0.0000524071,0.00001985841,0.0009495252,0.0021171216,0.9727653,0.005212685,0.0078186635,0.006350877,0.004279331],"study_design_scores_gemma":[0.000086124375,0.000038938502,0.000041741496,0.000037418613,0.000007828419,0.00030203976,0.000023821289,0.9665705,0.0010171455,0.02290197,0.008687823,0.0002846556],"about_ca_topic_score_codex":0.000022239035,"about_ca_topic_score_gemma":6.080328e-7,"teacher_disagreement_score":0.8423337,"about_ca_system_score_codex":0.00004266785,"about_ca_system_score_gemma":0.00027254334,"threshold_uncertainty_score":0.99982023},"labels":[],"label_agreement":null},{"id":"W3089428152","doi":"10.1063/1.4757665","title":"Levinson's theorem for graphs II","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Hilbert space; Hamiltonian (control theory); Combinatorics; Vertex (graph theory); Upper and lower bounds; Bound state; Discrete mathematics; Graph; Pure mathematics; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.019625166276050085,"score_gpt":0.2636357199806543,"score_spread":0.24401055370460423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089428152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052596696,0.000113836235,0.9455425,0.0008598663,0.00034947201,0.00007157022,9.024931e-7,0.000024599643,0.00044051552],"genre_scores_gemma":[0.6536531,0.0000026206617,0.34545815,0.00016383086,0.00068021007,0.0000012329996,1.0939018e-7,0.000009428361,0.000031349555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902326,0.000034452485,0.00030548242,0.00007745629,0.0002835485,0.00027580818],"domain_scores_gemma":[0.99887466,0.00037872107,0.00025970888,0.00022020384,0.00011794099,0.00014874164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006943534,0.00011047346,0.00025517526,0.000038995342,0.00012758095,0.00005056721,0.0005532783,0.000034282843,0.000004297717],"category_scores_gemma":[0.00010950004,0.00007243322,0.00025396128,0.00015341869,0.000039544495,0.00031286178,0.00013618763,0.00018970114,0.00000773674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004417633,0.0003105145,0.000010503577,0.000046716923,0.000031002695,0.0000013829591,0.00118393,0.00019196121,0.0002355762,0.94740653,0.0012112639,0.04936619],"study_design_scores_gemma":[0.0002448742,0.00020486693,0.000051664312,0.000067181616,0.000016974904,0.000096209646,0.000014849345,0.08093167,0.0011302884,0.9153604,0.0017786227,0.00010241401],"about_ca_topic_score_codex":6.056431e-8,"about_ca_topic_score_gemma":5.5774394e-9,"teacher_disagreement_score":0.6010564,"about_ca_system_score_codex":0.000012455716,"about_ca_system_score_gemma":0.000028476219,"threshold_uncertainty_score":0.29537413},"labels":[],"label_agreement":null},{"id":"W3089711852","doi":"10.1103/physreva.104.012619","title":"Improving nonstoquastic quantum annealing with spin-reversal transformations","year":2021,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia; D-Wave Systems (Canada); TRIUMF","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum annealing; Hamiltonian (control theory); Adiabatic process; Qubit; Quantum; Physics; Quantum Monte Carlo; Simulated annealing; Statistical physics; Quantum mechanics; Quantum computer; Monte Carlo method; Mathematics; Algorithm; Mathematical optimization","score_opus":0.010091955296775838,"score_gpt":0.31103220333802784,"score_spread":0.300940248041252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089711852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069894955,0.076515675,0.8431488,0.0076457458,0.00028753173,0.0011904036,0.00002535365,0.0004457925,0.0008457059],"genre_scores_gemma":[0.9168372,0.04177047,0.030229585,0.009501366,0.0012317557,0.00020488621,0.00006908303,0.000110019086,0.000045639947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614286,0.0003899493,0.00071148796,0.0010266085,0.00091778295,0.0008112803],"domain_scores_gemma":[0.99708027,0.00055384246,0.0003506199,0.0012408148,0.00034834832,0.00042611358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045936153,0.00058143743,0.0014426262,0.00005744008,0.00032347976,0.0001804445,0.0010864255,0.000036671932,0.000011700677],"category_scores_gemma":[0.0005022536,0.0004234509,0.00074371154,0.0018166344,0.00013355559,0.00058159226,0.00032505413,0.0008253805,0.00025992637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018782806,0.0022580982,0.00005404354,0.03306351,0.00030591412,0.00038962258,0.0010954399,0.0017942145,0.02096718,0.19158372,0.0029289643,0.7455405],"study_design_scores_gemma":[0.00052526087,0.00044158872,0.00018137158,0.02467849,0.00046347405,0.00018015172,0.000009660672,0.940326,0.0034540654,0.012533626,0.016098278,0.0011080308],"about_ca_topic_score_codex":0.000019433488,"about_ca_topic_score_gemma":0.0000036502602,"teacher_disagreement_score":0.9385318,"about_ca_system_score_codex":0.00006698551,"about_ca_system_score_gemma":0.00036904225,"threshold_uncertainty_score":0.9998217},"labels":[],"label_agreement":null},{"id":"W3090738362","doi":"10.1088/2058-9565/abda8e","title":"<i>A posteriori</i> corrections to the iterative qubit coupled cluster method to minimize the use of quantum resources in large-scale calculations","year":2021,"lang":"en","type":"preprint","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; OTI Lumionics (Canada)","funders":"","keywords":"Qubit; Hamiltonian (control theory); Coupled cluster; Quantum; Quantum computer; A priori and a posteriori; Iterative method; Quantum mechanics; Flux qubit; Perturbation theory (quantum mechanics); Computer science; Physics; Mathematics; Algorithm; Mathematical optimization; Molecule","score_opus":0.02081236919721957,"score_gpt":0.2855154360736758,"score_spread":0.26470306687645623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090738362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41775775,0.0001324506,0.5482281,0.0324318,0.00072284567,0.0006016007,0.000023799972,0.000094413284,0.000007257024],"genre_scores_gemma":[0.77221835,0.000022074559,0.22467346,0.0027627447,0.0000770693,0.00015351531,0.0000039568017,0.000020948835,0.000067848065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965233,0.00026568864,0.0006186355,0.0012735688,0.0006398221,0.0006789569],"domain_scores_gemma":[0.99649966,0.0007504663,0.00026960732,0.0016913834,0.00065143924,0.00013744418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020937677,0.0003385978,0.00054946006,0.0010621463,0.0009028285,0.00074877724,0.0026755913,0.00026078642,0.0000029189077],"category_scores_gemma":[0.00079714885,0.00021364224,0.00009609055,0.0054014036,0.0006677648,0.0002212065,0.005763178,0.0010348338,0.000004123069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016403833,0.0011603711,0.011780654,0.00022773436,0.00022384971,0.00015393784,0.20287947,0.49636373,0.036616508,0.12020096,0.0021083234,0.12812042],"study_design_scores_gemma":[0.00017769804,0.00013647719,0.004653251,0.00021126599,0.000014830019,0.00006407321,0.0017818821,0.9847678,0.00091513194,0.0018501418,0.005142284,0.0002851637],"about_ca_topic_score_codex":0.00063982746,"about_ca_topic_score_gemma":0.00076127995,"teacher_disagreement_score":0.48840407,"about_ca_system_score_codex":0.000078960045,"about_ca_system_score_gemma":0.00049947004,"threshold_uncertainty_score":0.8712078},"labels":[],"label_agreement":null},{"id":"W3091860955","doi":"10.1109/dsd51259.2020.00074","title":"Geometric Refactoring of Quantum and Reversible Circuits: Quantum Layout","year":2020,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Qubit; Quantum circuit; Computer science; Quantum gate; Quantum computer; Quantum; Algorithm; Theoretical computer science; Quantum algorithm; Noise (video); Topology (electrical circuits); Quantum error correction; Computer engineering; Electronic engineering; Electrical engineering; Quantum mechanics; Physics; Engineering; Artificial intelligence","score_opus":0.02543345113694763,"score_gpt":0.231376609046893,"score_spread":0.20594315790994538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091860955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29618502,0.00046994633,0.7001237,0.0018636773,0.000253136,0.00009387821,0.0000031284476,0.00023922171,0.0007682388],"genre_scores_gemma":[0.98788494,0.000028451712,0.011561877,0.0003854689,0.00008955873,8.435151e-7,6.944313e-7,0.000009654961,0.0000385015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868125,0.000042834366,0.0002712656,0.00043978784,0.0002817863,0.00028306828],"domain_scores_gemma":[0.9991486,0.00015754126,0.00011334076,0.00032321314,0.00006283635,0.00019443911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020460854,0.00015148184,0.00026267563,0.00019204649,0.0000957811,0.00008033156,0.0006192148,0.000054728996,0.000013234676],"category_scores_gemma":[0.00013849349,0.00012806126,0.00006344647,0.0013109873,0.000042301534,0.00021025786,0.0004439932,0.0001954434,0.000013003243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003448483,0.00036422367,0.025722299,0.0012008128,0.00029114177,0.0002022978,0.016648624,0.015303684,0.021605724,0.49415118,0.008150177,0.41632536],"study_design_scores_gemma":[0.000350362,0.0003023046,0.004671197,0.000040153445,0.0000070616884,0.00001903937,0.000087412554,0.98664427,0.0029803705,0.0018276196,0.00281661,0.00025359646],"about_ca_topic_score_codex":0.00006203238,"about_ca_topic_score_gemma":4.795957e-7,"teacher_disagreement_score":0.9713406,"about_ca_system_score_codex":0.0000110490255,"about_ca_system_score_gemma":0.00004534558,"threshold_uncertainty_score":0.5222187},"labels":[],"label_agreement":null},{"id":"W3092171027","doi":"10.1139/cjp-2020-0245","title":"Quantum search with an ensemble of single-query search processes","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University; Redeemer University","funders":"Japan Society for the Promotion of Science; McMaster University","keywords":"Physics; Quantum; Quantum algorithm; Algorithm; Statistical physics; Quantum mechanics; Computer science","score_opus":0.03401442478994003,"score_gpt":0.23716657250776857,"score_spread":0.20315214771782852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092171027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66922176,0.00017259881,0.32869062,0.0016300577,0.000089600115,0.00005953987,0.0000066867788,0.000014143171,0.00011501964],"genre_scores_gemma":[0.9818325,0.0000027094522,0.017501706,0.00026561675,0.00037675127,2.0224297e-7,8.521762e-7,0.000014743594,0.000004933986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880785,0.00006018415,0.00023579758,0.00018482309,0.00036337008,0.00034798845],"domain_scores_gemma":[0.9981798,0.000074061485,0.0001380744,0.00021161803,0.0006024753,0.0007940025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020001497,0.00012322159,0.00024128446,0.000100815545,0.00012030009,0.00013810502,0.0008787015,0.000032855896,0.0000032500375],"category_scores_gemma":[0.000040857954,0.000098418925,0.000053772717,0.0008023541,0.00010980787,0.0003577641,0.00003879045,0.0003517244,0.0000024996739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000176213,0.00047480027,0.006074462,0.0013718178,0.0003515733,0.0023658057,0.08318531,0.35084477,0.03426904,0.054428097,0.0015749348,0.46488318],"study_design_scores_gemma":[0.0016087659,0.011188893,0.0017813621,0.00084766536,0.000050223884,0.00075341004,0.0013816953,0.79660076,0.17102925,0.011731483,0.0020593654,0.00096712064],"about_ca_topic_score_codex":0.0007778613,"about_ca_topic_score_gemma":0.0006739592,"teacher_disagreement_score":0.46391603,"about_ca_system_score_codex":0.00003519738,"about_ca_system_score_gemma":0.0031989804,"threshold_uncertainty_score":0.5674854},"labels":[],"label_agreement":null},{"id":"W3092353817","doi":"10.1103/physreva.102.062608","title":"Optical quantum communication complexity in the simultaneous-message-passing model","year":2020,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum information science; Qubit; Computer science; Communication complexity; Communications protocol; Protocol (science); Quantum; Upper and lower bounds; Optical communication; Communications system; Theoretical computer science; Topology (electrical circuits); Mathematics; Quantum mechanics; Computer network; Physics; Quantum entanglement; Optics","score_opus":0.05199992778988157,"score_gpt":0.36367487043307223,"score_spread":0.3116749426431907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092353817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12342593,0.09240398,0.61086756,0.16667539,0.000112973255,0.0033705162,0.000024636855,0.0006161844,0.0025028507],"genre_scores_gemma":[0.94362634,0.019068414,0.011976227,0.024888925,0.0002868388,0.0000975897,0.000019150662,0.000033584714,0.0000029471585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955595,0.0010544294,0.00078149023,0.00091892056,0.0010163178,0.000669336],"domain_scores_gemma":[0.9956227,0.0018791452,0.00032393407,0.0017027372,0.00014296007,0.0003285384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090255245,0.0005193403,0.0013869721,0.000031159798,0.00029542763,0.00019080321,0.003386973,0.000042113104,0.000004028905],"category_scores_gemma":[0.0014685497,0.00034015396,0.0006280572,0.001479611,0.00030937995,0.00032599902,0.00093044405,0.001379485,0.00018754932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021710111,0.0023790933,0.000026896178,0.008963046,0.000068939386,0.00010233051,0.0029888405,0.015919944,0.003516828,0.68166536,0.0050839777,0.27926302],"study_design_scores_gemma":[0.00017514132,0.00012786305,0.00006515691,0.004342359,0.00007081629,0.000010795292,0.000006061712,0.91422284,0.00012087619,0.07655848,0.0039130715,0.00038655408],"about_ca_topic_score_codex":0.0000127003,"about_ca_topic_score_gemma":0.0000024627375,"teacher_disagreement_score":0.8983029,"about_ca_system_score_codex":0.000055981905,"about_ca_system_score_gemma":0.00011612538,"threshold_uncertainty_score":0.99990505},"labels":[],"label_agreement":null},{"id":"W3092581746","doi":"10.22331/q-2021-02-04-392","title":"Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer","year":2021,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":278,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada); Perimeter Institute; University of Waterloo; University of Toronto","funders":"Ministry of Colleges and Universities; Mitacs; Government of Canada; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Compute Canada","keywords":"Quantum computer; Qubit; Photonics; Scalability; Exploit; Quantum; Cluster state; Quantum information; Quantum teleportation","score_opus":0.01427927189269435,"score_gpt":0.24687634301284606,"score_spread":0.2325970711201517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092581746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18550903,0.00041727297,0.8079521,0.0031366409,0.0020022457,0.00031985284,0.000014544702,0.00046391747,0.00018440871],"genre_scores_gemma":[0.7374047,0.000031902324,0.2594281,0.0019347618,0.00064572843,0.00007303753,0.000024224908,0.000058688445,0.00039881002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969699,0.00012989988,0.0005215209,0.0010910018,0.00041414917,0.0008735564],"domain_scores_gemma":[0.9977756,0.00032733922,0.00016106328,0.0012020605,0.00029264958,0.00024129283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004994565,0.00035923874,0.0005044044,0.00012542277,0.00041555575,0.00044492245,0.0011416032,0.00013604897,0.00003316131],"category_scores_gemma":[0.00006015249,0.00032652423,0.0003353832,0.0005973083,0.00007332469,0.00021072978,0.00067603757,0.00035806056,0.00012963629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006246775,0.001080242,0.00022070816,0.00038671982,0.0002593104,0.0006170526,0.0028222273,0.04710929,0.011409021,0.7244416,0.014931779,0.19665956],"study_design_scores_gemma":[0.0007975778,0.00020560653,0.00039951465,0.00010198227,0.000011615198,0.00018979528,0.000025636202,0.9253801,0.005757944,0.02156612,0.045122962,0.00044110417],"about_ca_topic_score_codex":0.000034805176,"about_ca_topic_score_gemma":0.0000086523505,"teacher_disagreement_score":0.87827086,"about_ca_system_score_codex":0.00005805159,"about_ca_system_score_gemma":0.00031869268,"threshold_uncertainty_score":0.9999187},"labels":[],"label_agreement":null},{"id":"W3093123653","doi":"10.1364/cleopr.2020.c10c_3","title":"Demonstration of an Exponential Advantage in Communication Complexity via the Quantum Switch","year":2020,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Canadian Institute for Advanced Research; Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Computer science; Exponential function; Quantum; Communication complexity; Distributed computing; Theoretical computer science; Mathematics; Physics; Quantum mechanics","score_opus":0.027882377920023984,"score_gpt":0.2631837060363929,"score_spread":0.23530132811636892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093123653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40055898,0.000028326178,0.59391665,0.004994785,0.000039425246,0.00010423955,8.319209e-7,0.00006422452,0.000292499],"genre_scores_gemma":[0.93880785,0.000003491727,0.06077875,0.0003681629,0.000028174067,0.0000023009416,0.000005718198,0.0000036730976,0.0000018595733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901474,0.00021304218,0.00026034037,0.0002000533,0.00018228835,0.00012951717],"domain_scores_gemma":[0.9992342,0.00008696007,0.00010015376,0.0004913075,0.000035252633,0.0000521292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029582434,0.000083634426,0.00012065855,0.000032943255,0.000087734355,0.000054025757,0.0009981806,0.000029859215,0.0000072119105],"category_scores_gemma":[0.00001386502,0.00005890519,0.000036124286,0.0003209795,0.00008215274,0.00024099069,0.00025103326,0.00018620683,0.0000042603597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007519269,0.00057401403,0.0028688014,0.00006190983,0.000027626853,0.000015129124,0.018668283,0.022241082,0.04596291,0.6218099,0.00023147487,0.28746367],"study_design_scores_gemma":[0.00019938778,0.000097145574,0.0064119394,0.000007805496,0.0000014206354,0.000006151635,0.00014592617,0.98139364,0.0026301087,0.008971968,0.000059356287,0.000075158896],"about_ca_topic_score_codex":0.00018589642,"about_ca_topic_score_gemma":0.00012226122,"teacher_disagreement_score":0.9591526,"about_ca_system_score_codex":0.000006992051,"about_ca_system_score_gemma":0.000026477332,"threshold_uncertainty_score":0.24020839},"labels":[],"label_agreement":null},{"id":"W3094133489","doi":"10.1016/j.disc.2022.112971","title":"Laplacian pretty good fractional revival","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; York University","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Laplace operator; Hamiltonian (control theory); Fractional Laplacian; Laplacian matrix; Quantum; Combinatorics; Discrete mathematics; Mathematical analysis; Quantum mechanics; Physics; Mathematical optimization","score_opus":0.010851490317494947,"score_gpt":0.24079228523005067,"score_spread":0.22994079491255573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094133489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03067867,0.00013809046,0.95201033,0.002966659,0.000795893,0.00026111293,0.00003364143,0.00043436576,0.012681237],"genre_scores_gemma":[0.58796734,0.000004316166,0.40914267,0.0008211928,0.0002913218,0.00006178452,0.000021504693,0.00003698346,0.0016528626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861825,0.00007633343,0.00023598137,0.0002825264,0.00053288735,0.00025405182],"domain_scores_gemma":[0.9991072,0.0001384171,0.00013568811,0.00051928614,0.000025412719,0.00007404238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037872116,0.0001370821,0.00016851962,0.00006783231,0.00050148077,0.00011882099,0.0008584926,0.000023004628,0.00010249078],"category_scores_gemma":[0.000039388924,0.00012225412,0.00010568275,0.0003122369,0.000025910398,0.000111170084,0.0007229367,0.00033836614,0.0000368638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064412316,0.00038138495,0.00019299258,0.0001548874,0.000085657884,0.00008501742,0.0076084123,0.019588351,0.0003213494,0.9431202,0.006116111,0.022339202],"study_design_scores_gemma":[0.00017489814,0.00009786617,0.00019177854,0.000019718216,0.0000078951925,0.00016797968,0.00015656097,0.91164094,0.00006806523,0.0557772,0.031460002,0.00023708341],"about_ca_topic_score_codex":0.0000030302085,"about_ca_topic_score_gemma":4.2330126e-7,"teacher_disagreement_score":0.8920526,"about_ca_system_score_codex":0.000041106225,"about_ca_system_score_gemma":0.00005282747,"threshold_uncertainty_score":0.4985378},"labels":[],"label_agreement":null},{"id":"W3094151347","doi":"10.1145/3406325.3451047","title":"Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Degree (music); Adjacency matrix; Mathematics; Conjecture; Quartic function; Monotone polygon; Boolean function; Discrete mathematics; Graph; Vertex (graph theory); Omega; Physics; Pure mathematics; Quantum mechanics","score_opus":0.03506070547461842,"score_gpt":0.26073395067575816,"score_spread":0.22567324520113974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094151347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21307765,0.00033261898,0.78180176,0.0024213379,0.00036709942,0.0002673098,0.000027358534,0.00026119815,0.0014436832],"genre_scores_gemma":[0.8068794,0.000059908576,0.19267465,0.00020236582,0.00008143265,0.000013609541,0.000021052085,0.00002038058,0.000047209596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975962,0.00020420137,0.00045287056,0.0010621031,0.00029300922,0.00039160994],"domain_scores_gemma":[0.99716353,0.0003614496,0.00032475835,0.0017293673,0.00026596343,0.00015491083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007485552,0.00038416905,0.000614844,0.00016522265,0.00017453816,0.0003165086,0.00084512355,0.00024918126,0.0000073495144],"category_scores_gemma":[0.00008740208,0.00032578397,0.00020828377,0.0003118397,0.0001845767,0.00010525518,0.004316756,0.0006721034,0.0000022122101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001298103,0.00034709694,0.001912294,0.000766767,0.00025249153,0.00009354945,0.0030328718,0.005533002,0.003567873,0.479321,0.0005212662,0.5046388],"study_design_scores_gemma":[0.00017808533,0.00004923084,0.043931145,0.00020677266,0.000028121469,0.00019504796,0.000048043526,0.89845735,0.0021637094,0.054200962,0.000063968655,0.00047754435],"about_ca_topic_score_codex":0.00026730687,"about_ca_topic_score_gemma":0.000091953014,"teacher_disagreement_score":0.89292437,"about_ca_system_score_codex":0.000026509939,"about_ca_system_score_gemma":0.00023830202,"threshold_uncertainty_score":0.9999194},"labels":[],"label_agreement":null},{"id":"W3094172572","doi":"10.1364/josab.431752","title":"Readout of quantum information spreading using a disordered quantum walk","year":2021,"lang":"en","type":"article","venue":"Journal of the Optical Society of America B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Quantum walk; Quantum; Quantum information; Quantum network; Quantum error correction; Fisher information; Quantum algorithm; Quantum discord; Quantum operation; Amplitude damping channel","score_opus":0.01083895808928437,"score_gpt":0.2400794597029061,"score_spread":0.22924050161362172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094172572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32630095,0.00015080787,0.6701769,0.0029354577,0.00032483973,0.000039269158,0.0000022638612,0.000008418554,0.00006106],"genre_scores_gemma":[0.68279225,0.00005026438,0.31684363,0.0002443419,0.000060574122,9.276748e-8,3.254372e-7,0.0000043040454,0.0000041979006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983648,0.00008713347,0.0006882368,0.000101415506,0.0005466386,0.00021174109],"domain_scores_gemma":[0.9980648,0.00023285164,0.0009176901,0.0003245875,0.00037901968,0.00008106385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036774,0.00011766618,0.0003766944,0.00003507658,0.00011522546,0.00006315021,0.0007144826,0.000060593124,0.000005753113],"category_scores_gemma":[0.00022690448,0.00007901148,0.0005678137,0.0006106328,0.00019016764,0.00035553204,0.0003011769,0.00035074685,8.842129e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012851742,0.0010665177,0.0042178063,0.00079181866,0.001115658,0.00002515012,0.025952885,0.36052153,0.06298485,0.02567264,0.0037022482,0.5138204],"study_design_scores_gemma":[0.00029671987,0.00017971265,0.0016323196,0.00022561557,0.00003135646,0.0001726236,0.0005930757,0.9896562,0.0034054136,0.003101483,0.0006059845,0.000099471334],"about_ca_topic_score_codex":0.000039164766,"about_ca_topic_score_gemma":1.6730411e-7,"teacher_disagreement_score":0.6291347,"about_ca_system_score_codex":0.00003395362,"about_ca_system_score_gemma":0.00023663374,"threshold_uncertainty_score":0.32219946},"labels":[],"label_agreement":null},{"id":"W3094290504","doi":"10.3929/ethz-b-000464528","title":"Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets","year":2020,"lang":"en","type":"article","venue":"Repository for Publications and Research Data (ETH Zurich)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Sherbrooke","funders":"Army Research Office; National Center of Competence in Research Quantum Science and Technology; Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Horizon 2020 Framework Programme; Intelligence Advanced Research Projects Activity; Eidgenössische Technische Hochschule Zürich; Office of the Director of National Intelligence","keywords":"Qubit; Quantum computer; Computer science; Quantum gate; Algorithm; Quantum circuit; Controlled NOT gate; Gate count; Quantum algorithm; Set (abstract data type); Quantum; Quantum error correction; Quantum mechanics; Physics","score_opus":0.047313987981791504,"score_gpt":0.3011016902074216,"score_spread":0.25378770222563013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094290504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027443191,0.00051997515,0.9634902,0.0074781165,0.00007883832,0.0006942442,0.0000550931,0.00011248449,0.0001278951],"genre_scores_gemma":[0.75101733,0.000098823235,0.24818765,0.00010823314,0.00021626183,0.00008950872,0.00015779698,0.000025412419,0.000098968034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981002,0.00018554767,0.0002855605,0.00060519174,0.00047371504,0.0003497474],"domain_scores_gemma":[0.99732643,0.000462231,0.00017734544,0.0012279869,0.00064323295,0.00016278279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013399716,0.00012042217,0.00016056147,0.00012397605,0.0009961687,0.0005377872,0.0019513791,0.000051889565,0.0000010884049],"category_scores_gemma":[0.00027801716,0.000074440846,0.000026091213,0.0009456657,0.00024292876,0.00074035046,0.001026281,0.0003157561,7.5718776e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025424032,0.00075832254,0.003028189,0.0016263742,0.00046689625,0.000018902447,0.00924404,0.26459578,0.00664461,0.046379145,0.0119374655,0.65504605],"study_design_scores_gemma":[0.00024501403,0.00040488967,0.0005483056,0.000020782905,0.0000088972,0.00004138918,0.000087358145,0.99313015,0.00056051294,0.00003285309,0.0048129573,0.00010687684],"about_ca_topic_score_codex":0.000054403732,"about_ca_topic_score_gemma":0.0000015542055,"teacher_disagreement_score":0.7285344,"about_ca_system_score_codex":0.000014299558,"about_ca_system_score_gemma":0.00017261166,"threshold_uncertainty_score":0.7661825},"labels":[],"label_agreement":null},{"id":"W3095412784","doi":"10.1103/physrevresearch.3.033098","title":"Unified approach to data-driven quantum error mitigation","year":2021,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Los Alamos National Laboratory; Laboratory Directed Research and Development; Office of Science; Advanced Scientific Computing Research; U.S. Department of Energy","keywords":"Extrapolation; Benchmark (surveying); Noise (video); Quantum; Quantum computer; Scalability; Observable; Energy (signal processing); Overhead (engineering)","score_opus":0.150142549680507,"score_gpt":0.4273807972146394,"score_spread":0.2772382475341324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095412784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07474583,0.03285739,0.8112742,0.059949074,0.0006604752,0.0028183705,0.00007670545,0.000703765,0.01691425],"genre_scores_gemma":[0.7996114,0.0031058136,0.19105454,0.0036047227,0.0014496694,0.00016820943,0.00030140666,0.00006192789,0.00064235076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962196,0.0008483832,0.0002427081,0.000982472,0.0011326137,0.00057426014],"domain_scores_gemma":[0.99659836,0.00044213174,0.000041892297,0.002182912,0.00043011358,0.00030459612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013704064,0.00015181958,0.00035862415,0.00008303175,0.00024723678,0.00022142776,0.002529169,0.000026516556,0.000008041383],"category_scores_gemma":[0.00089312263,0.00012224744,0.00009305993,0.0022097148,0.00007242371,0.00023085384,0.0027286801,0.0006363759,0.000335657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071520735,0.0014871409,0.000020162099,0.0032740308,0.000074633506,0.000115801566,0.0010133877,0.0020949263,0.005662031,0.40944993,0.08202414,0.49477667],"study_design_scores_gemma":[0.000085060376,0.00006110085,0.00027819563,0.0006217712,0.0000060555535,0.000016051314,0.000012905841,0.94833606,0.00038358584,0.010638498,0.03939146,0.0001692803],"about_ca_topic_score_codex":0.000018789022,"about_ca_topic_score_gemma":0.000002277836,"teacher_disagreement_score":0.9462411,"about_ca_system_score_codex":0.000037550373,"about_ca_system_score_gemma":0.00029133746,"threshold_uncertainty_score":0.4985106},"labels":[],"label_agreement":null},{"id":"W3095846505","doi":"10.1002/spe.3039","title":"Quantum computing: A taxonomy, systematic review and future directions","year":2021,"lang":"en","type":"preprint","venue":"Software Practice and Experience","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Seneca Polytechnic","funders":"","keywords":"Quantum computer; Computer science; Quantum technology; Theoretical computer science; Quantum algorithm; Quantum information science; Quantum network; Qubit; Quantum information; Quantum entanglement; Quantum; Computational science; Computer engineering; Open quantum system; Physics; Quantum mechanics","score_opus":0.018336070322545223,"score_gpt":0.2798761817055284,"score_spread":0.26154011138298316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095846505","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005237558,0.5518037,0.427513,0.010514884,0.0021374214,0.0019078514,0.000009630432,0.0007781817,0.0000977472],"genre_scores_gemma":[0.045436986,0.20072588,0.7375122,0.013876458,0.0011864983,0.0010179082,0.000035089233,0.000091626425,0.00011737593],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9968448,0.0004883463,0.000619859,0.0012624634,0.00037609725,0.00040837884],"domain_scores_gemma":[0.99667436,0.000869276,0.0006711912,0.0012315678,0.00031339115,0.00024020564],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006678338,0.00047836467,0.0010202319,0.00010392101,0.00055384415,0.0011394595,0.00084995443,0.00021646112,0.0000054717893],"category_scores_gemma":[0.0014117892,0.00041250527,0.00013423534,0.00043024938,0.00012965254,0.00065981684,0.002823636,0.0010688906,0.000004083519],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018481536,0.0007185829,0.00021794555,0.74021417,0.00090795703,0.0010375982,0.11635882,0.00025129024,0.00001587205,0.008423553,0.0015942153,0.13024154],"study_design_scores_gemma":[0.0013043978,0.0007294372,0.00086532417,0.39152136,0.004348894,0.019859158,0.031048136,0.3151889,0.00007652742,0.0029003196,0.2240395,0.0081180455],"about_ca_topic_score_codex":0.00010599112,"about_ca_topic_score_gemma":0.000003740365,"teacher_disagreement_score":0.35107782,"about_ca_system_score_codex":0.000038356666,"about_ca_system_score_gemma":0.00021290708,"threshold_uncertainty_score":0.9998975},"labels":[],"label_agreement":null},{"id":"W3095851612","doi":"10.1103/physrevresearch.2.043163","title":"Verifying the output of quantum optimizers with ground-state energy lower bounds","year":2020,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Creative Destruction Lab; University of Toronto; Perimeter Institute","funders":"H2020 Marie Skłodowska-Curie Actions; Institut Périmètre de physique théorique; European Commission; Industry Canada; Ontario Ministry of Economic Development and Innovation; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Generalitat de Catalunya; Government of Canada; Ministero dello Sviluppo Economico; Centres de Recerca de Catalunya; Nvidia","keywords":"Quantum; Energy (signal processing); Benchmark (surveying); Quantum system; Upper and lower bounds; Quantum algorithm; Quantum computer","score_opus":0.061793124314915224,"score_gpt":0.3417131048776727,"score_spread":0.27991998056275746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095851612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08227351,0.0403731,0.8014614,0.07142897,0.00030424717,0.0011697453,0.000011051846,0.0003288219,0.0026491494],"genre_scores_gemma":[0.99156606,0.00306491,0.0033381693,0.0016872264,0.00022385038,0.000032455297,0.0000015497868,0.000023329025,0.000062468294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970722,0.000502199,0.0002515375,0.00049408607,0.0011485132,0.0005314387],"domain_scores_gemma":[0.9981133,0.00064406026,0.000095674906,0.00068567914,0.00025191082,0.00020942911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008322564,0.00017570906,0.0004152331,0.000043045704,0.00025677087,0.00015035759,0.0016850012,0.000016903754,0.0000050453305],"category_scores_gemma":[0.00019364229,0.00009573091,0.000161511,0.0014467484,0.00035564415,0.00014776895,0.00072727154,0.00062211923,0.000026111118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017943037,0.0007041965,0.000041958872,0.0035112442,0.00026221262,0.00021363671,0.00520075,0.013028466,0.001760249,0.25767973,0.012540437,0.7048777],"study_design_scores_gemma":[0.00023210773,0.0008019313,0.00010063552,0.0009560346,0.000011403824,0.0000095502355,0.000016089649,0.9488039,0.00037634562,0.0063768723,0.042108655,0.00020645175],"about_ca_topic_score_codex":0.00011284781,"about_ca_topic_score_gemma":0.0000012619485,"teacher_disagreement_score":0.93577546,"about_ca_system_score_codex":0.000022875975,"about_ca_system_score_gemma":0.0001701118,"threshold_uncertainty_score":0.3903793},"labels":[],"label_agreement":null},{"id":"W3096302665","doi":"","title":"Verifying the output of quantum optimizers with ground-state energy lower bounds","year":2020,"lang":"en","type":"article","venue":"MPG.PuRe (Max Planck Society)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; H2020 Marie Skłodowska-Curie Actions; Ontario Ministry of Economic Development and Innovation","keywords":"Benchmark (surveying); Ground state; State (computer science); Quantum; Energy (signal processing); Computer science; Upper and lower bounds; Mathematical optimization; Mathematics; Algorithm; Physics; Quantum mechanics","score_opus":0.01186560665318258,"score_gpt":0.19311840431902666,"score_spread":0.18125279766584407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096302665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09264234,0.0005934924,0.89610636,0.008351475,0.0008351879,0.00019394448,0.000022860218,0.00040087185,0.0008534514],"genre_scores_gemma":[0.9533022,0.000065551336,0.041511912,0.0043697213,0.00040989966,0.000012581385,0.000011016255,0.000048934653,0.00026816057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773675,0.00009600678,0.00035512992,0.00064046576,0.00059267035,0.0005789654],"domain_scores_gemma":[0.99861574,0.00020733749,0.00025695728,0.00063268497,0.000099809564,0.00018744238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024535277,0.00035272478,0.00041580255,0.000033702694,0.000401025,0.00027206863,0.0014299407,0.000114144525,0.000009414826],"category_scores_gemma":[0.000020055102,0.00023094197,0.00030117197,0.000802573,0.000249118,0.0002242654,0.000411111,0.0005060404,0.000008397904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058420235,0.0006835627,0.002368925,0.0007352446,0.0020510976,0.0005985065,0.09871717,0.58640426,0.0037811655,0.10127489,0.12145423,0.08134673],"study_design_scores_gemma":[0.00090750965,0.0005459949,0.00047212065,0.000085737716,0.000029500883,0.000049077917,0.00032384426,0.9497363,0.00039273896,0.001605822,0.045351695,0.00049965637],"about_ca_topic_score_codex":0.00010169619,"about_ca_topic_score_gemma":0.0000073388223,"teacher_disagreement_score":0.8606599,"about_ca_system_score_codex":0.000035257508,"about_ca_system_score_gemma":0.00016877321,"threshold_uncertainty_score":0.941754},"labels":[],"label_agreement":null},{"id":"W3098032907","doi":"","title":"2012 Quantum polar codes for arbitrary channels","year":2012,"lang":"en","type":"preprint","venue":"Civil War Book Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polar; Computer science; Quantum; Physics; Quantum mechanics","score_opus":0.02456584445603996,"score_gpt":0.2771823256828306,"score_spread":0.2526164812267906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098032907","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017774742,0.7108191,0.2802026,0.003880214,0.002728727,0.0014362658,0.00006947004,0.00035369696,0.00049212266],"genre_scores_gemma":[0.0016045145,0.8100978,0.1263401,0.04967573,0.0067601358,0.0011699478,0.00042839412,0.00031797355,0.0036053562],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99641436,0.0002704645,0.0008087688,0.0011176409,0.00044368563,0.00094507163],"domain_scores_gemma":[0.99662185,0.0002714266,0.0005833284,0.0019963498,0.00017167539,0.00035537445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014325173,0.0007112095,0.0013557215,0.0001395453,0.00025329305,0.0001573634,0.0026225564,0.00032236936,0.00009897054],"category_scores_gemma":[0.000106117135,0.00059672474,0.0008232669,0.0002137006,0.00008375996,0.00035074752,0.0021005464,0.0010571775,0.00017891296],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059714866,0.0002858295,0.000011110612,0.04031965,0.0003022269,0.000029825627,0.0006700229,0.0003649291,0.00001912509,0.02133759,0.7505084,0.18614529],"study_design_scores_gemma":[0.00014836105,0.000057288955,0.000019327077,0.014322476,0.00013072729,0.00006135063,8.662109e-7,0.047642678,0.000043361906,0.013795834,0.9229572,0.0008205289],"about_ca_topic_score_codex":0.000013619596,"about_ca_topic_score_gemma":0.0000019562212,"teacher_disagreement_score":0.18532476,"about_ca_system_score_codex":0.00005924379,"about_ca_system_score_gemma":0.00029501348,"threshold_uncertainty_score":0.9996484},"labels":[],"label_agreement":null},{"id":"W3098074752","doi":"10.1137/1.9781611973105.106","title":"Nested Quantum Walks with Quantum Data Structures","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Quantum; Theoretical computer science; Computer science; Graph; Upper and lower bounds; Logarithm; Simple (philosophy); Quantum algorithm; Random walk; Mathematics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.03116897440204137,"score_gpt":0.26325542578359673,"score_spread":0.23208645138155537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098074752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13883676,0.00054120674,0.85123724,0.0033811093,0.0025918335,0.0008125641,0.00006573739,0.0015982003,0.0009353772],"genre_scores_gemma":[0.65747,0.0000406842,0.33989045,0.0008708106,0.0007791181,0.00003452961,0.00036314895,0.00009555545,0.00045572908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99508667,0.00020143577,0.0005931241,0.0024100228,0.0008645785,0.00084417564],"domain_scores_gemma":[0.9917281,0.00020936846,0.00043633376,0.0070806504,0.00022977902,0.00031577089],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0004034059,0.000824493,0.00076925854,0.0002789167,0.00028154626,0.0014543217,0.009747853,0.0004226032,0.00009203097],"category_scores_gemma":[0.000056357283,0.0005461337,0.00011984031,0.00042072375,0.00016229461,0.00043167738,0.013585518,0.0017172932,0.00010977778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004579705,0.00036868072,0.0007538683,0.00084420736,0.00078985345,0.0004908365,0.002487263,0.083360784,0.00019132161,0.62954867,0.06508213,0.21603656],"study_design_scores_gemma":[0.00027215836,0.00012125793,0.002996014,0.00016993616,0.000026852324,0.000119918404,0.000023459379,0.9204936,0.000048981547,0.07083771,0.004038093,0.0008519905],"about_ca_topic_score_codex":0.0012666014,"about_ca_topic_score_gemma":0.000049207512,"teacher_disagreement_score":0.8371329,"about_ca_system_score_codex":0.000040048948,"about_ca_system_score_gemma":0.0004996723,"threshold_uncertainty_score":0.999699},"labels":[],"label_agreement":null},{"id":"W3098163611","doi":"","title":"Minimal-memory requirements for pearl-necklace encoders of quantum convolutional codes","year":2012,"lang":"en","type":"article","venue":"Civil War Book Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Ministère du Développement Économique, de l’Innovation et de l’Exportation","keywords":"Encoder; Computer science; Theoretical computer science; Controlled NOT gate; Convolutional code; Algorithm; Quantum; Quantum computer; Quantum error correction; Decoding methods; Physics; Quantum mechanics","score_opus":0.026979300421897362,"score_gpt":0.28707816560655913,"score_spread":0.26009886518466174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098163611","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077009463,0.687083,0.30734196,0.0017428042,0.0007485562,0.0008306087,0.00002223736,0.00012211685,0.0013386008],"genre_scores_gemma":[0.30287662,0.21687682,0.41595826,0.049091186,0.003280646,0.0007652599,0.00017229219,0.00029776347,0.010681167],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981535,0.00012699486,0.0005116989,0.0003457177,0.00036539993,0.0004966988],"domain_scores_gemma":[0.9986,0.00023515809,0.0002988095,0.0005569992,0.00014503908,0.00016397802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010630339,0.00021630348,0.00047721874,0.00006379991,0.0001407821,0.000016952426,0.0007285195,0.00005389049,0.00006539162],"category_scores_gemma":[0.00016799143,0.00018380354,0.0002516947,0.00020456867,0.00011015326,0.00033233274,0.00022856815,0.00012697195,0.000043219927],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003553856,0.000917638,0.0007511926,0.02004445,0.00034366062,0.000009381181,0.002847988,0.00042707974,0.0014564709,0.06452185,0.75997406,0.1486707],"study_design_scores_gemma":[0.00094705663,0.00036574705,0.00094504375,0.007909202,0.0001282206,0.000078360295,0.000033781755,0.13722736,0.00077440543,0.0018058727,0.8489825,0.000802446],"about_ca_topic_score_codex":0.0000068762297,"about_ca_topic_score_gemma":9.1903576e-7,"teacher_disagreement_score":0.4702062,"about_ca_system_score_codex":0.000039509843,"about_ca_system_score_gemma":0.0001248633,"threshold_uncertainty_score":0.7495291},"labels":[],"label_agreement":null},{"id":"W3098366347","doi":"","title":"Matchgate and space-bounded quantum computations are equivalent","year":2010,"lang":"en","type":"article","venue":"Cambridge University Engineering Department Publications Database","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"","keywords":"Quantum computer; Bounded function; Polynomial; Mathematics; Logarithm; Discrete mathematics; Quantum circuit; Qubit; Computation; Unitary state; Quantum; Space (punctuation); Topology (electrical circuits); Quantum mechanics; Combinatorics; Physics; Quantum error correction; Computer science; Mathematical analysis; Algorithm","score_opus":0.009010265783410833,"score_gpt":0.20190781326960877,"score_spread":0.19289754748619795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098366347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31445372,0.00003587174,0.68032944,0.0036599191,0.00034917897,0.00019173657,0.00022806112,0.0005979787,0.00015406782],"genre_scores_gemma":[0.80385655,0.000034374338,0.19491047,0.0001025433,0.000105579056,0.000006028891,0.00040322606,0.000021385706,0.000559821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988611,0.00002766297,0.00013950789,0.0004673017,0.00018865614,0.00031582435],"domain_scores_gemma":[0.99860173,0.000114657996,0.00009211239,0.0007919927,0.00011965051,0.0002798356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018480729,0.00018411872,0.00014474042,0.00035489176,0.00036807675,0.00026672787,0.0006504226,0.00004923528,0.000003923479],"category_scores_gemma":[0.00006817265,0.00020811163,0.00005115863,0.00063104386,0.00006430196,0.000643873,0.0005539314,0.00031429797,0.000023024562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026715416,0.00015279715,0.0005926468,0.000043695072,0.000049929233,0.000042579875,0.00007845173,0.005488136,0.0019279347,0.9831226,0.0075759687,0.0009225795],"study_design_scores_gemma":[0.00036086136,0.000020138274,0.013265883,0.000021217613,0.000018172783,0.00007191457,0.000023300263,0.8656807,0.00019230152,0.000033861932,0.12003279,0.00027889552],"about_ca_topic_score_codex":0.000023814378,"about_ca_topic_score_gemma":0.000008118777,"teacher_disagreement_score":0.98308873,"about_ca_system_score_codex":0.000052749463,"about_ca_system_score_gemma":0.00007514854,"threshold_uncertainty_score":0.84865457},"labels":[],"label_agreement":null},{"id":"W3098636779","doi":"","title":"On a measure of distance for quantum strategies","year":2016,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Norm (philosophy); Mathematics; Quantum state; Quantum; Convex optimization; Duality (order theory); Operator (biology); Regular polygon; Discrete mathematics; Applied mathematics; Mathematical optimization; Quantum mechanics; Physics","score_opus":0.012886071489273225,"score_gpt":0.24137061774935364,"score_spread":0.2284845462600804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098636779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018756418,0.00003207841,0.978167,0.0015037077,0.00017703536,0.000094746356,0.0000052758046,0.0001021738,0.0011615654],"genre_scores_gemma":[0.96116763,0.0000012998744,0.038532894,0.00007321693,0.00003425033,0.0000057797843,1.3596008e-7,0.0000046860314,0.00018012025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930155,0.00001861339,0.00013006176,0.00022301813,0.00015756636,0.00016917184],"domain_scores_gemma":[0.99921936,0.00029290532,0.000057718433,0.00032605554,0.0000679663,0.000035974375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015089323,0.00008469059,0.00011448341,0.00003855363,0.000048638383,0.00003680039,0.0004496534,0.00002539535,0.00000426574],"category_scores_gemma":[0.000044606106,0.000044122447,0.000063904474,0.00010388034,0.00003684329,0.00010935558,0.000047002664,0.0000308875,0.000004842471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009345837,0.000023528652,0.000007664497,0.000009795831,0.000005299013,6.141179e-7,0.00008104037,0.0001469212,0.0015014125,0.9126387,0.0005254176,0.08505021],"study_design_scores_gemma":[0.00092594285,0.0007783965,0.0005408352,0.00023930885,0.0000032748674,0.000005626294,0.000034166787,0.3437671,0.00956545,0.6379222,0.005932475,0.00028514504],"about_ca_topic_score_codex":0.000004067838,"about_ca_topic_score_gemma":0.000004196953,"teacher_disagreement_score":0.9424112,"about_ca_system_score_codex":0.0000076088136,"about_ca_system_score_gemma":0.0000512199,"threshold_uncertainty_score":0.17992611},"labels":[],"label_agreement":null},{"id":"W3098637671","doi":"","title":"T-count optimization and Reed-Muller codes","year":2016,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Decoding methods; Reed–Muller code; Gate count; Discrete mathematics; Controlled NOT gate; Qubit; Integer (computer science); Combinatorics; Binary number; Quantum computer; Upper and lower bounds; Quantum gate; Algorithm; Arithmetic; Concatenated error correction code; Quantum; Block code; Computer science; Physics; Quantum mechanics","score_opus":0.004974841512009469,"score_gpt":0.1593804419895893,"score_spread":0.15440560047757984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098637671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54038507,0.00006980098,0.45870373,0.00040998432,0.00007947625,0.00005635631,0.000014744736,0.000081235456,0.0001996321],"genre_scores_gemma":[0.95180553,0.0000951309,0.04769128,0.0000426393,0.000021257334,9.104198e-8,0.0000010118107,0.0000049141095,0.0003381198],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992643,0.000034861176,0.000069162495,0.00031865877,0.00015336239,0.00015963304],"domain_scores_gemma":[0.9994681,0.00005493352,0.00007109322,0.00023396804,0.00009449394,0.00007740417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012907227,0.000031516578,0.00013127792,0.000032648735,0.00018817706,0.000113130474,0.00037356775,0.000051317278,0.000018527702],"category_scores_gemma":[0.000015042922,0.00008008802,0.00004007128,0.00016420377,0.00014821683,0.00029232618,0.00025485407,0.00004968455,0.00000510038],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015193194,0.000028854123,0.0016361444,0.00001421715,0.000013120279,0.000044894627,0.00014560414,0.0007659025,0.00019326567,0.000026909118,0.0010248306,0.9961047],"study_design_scores_gemma":[0.00091302634,0.00010340673,0.7812013,0.00021911142,0.000009084229,0.00012666872,0.00007145279,0.21542095,0.0000027247224,0.0010245419,0.0006816814,0.00022607391],"about_ca_topic_score_codex":0.006573347,"about_ca_topic_score_gemma":0.007288834,"teacher_disagreement_score":0.99587864,"about_ca_system_score_codex":0.000019852916,"about_ca_system_score_gemma":0.000032017433,"threshold_uncertainty_score":0.9936978},"labels":[],"label_agreement":null},{"id":"W3099009952","doi":"","title":"Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly","year":2019,"lang":"en","type":"article","venue":"OakTrust (Texas A&M University Libraries)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"Office of the Director of National Intelligence; Intelligence Advanced Research Projects Activity; National Science Foundation","keywords":"Speedup; Quantum; Computer science; Spin glass; Spin (aerodynamics); Physics; Condensed matter physics; Quantum mechanics; Parallel computing","score_opus":0.006264254326506512,"score_gpt":0.18494428889955186,"score_spread":0.17868003457304535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099009952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6476596,0.0016316031,0.15975694,0.112554595,0.0032493526,0.00201444,0.000029854284,0.00083939754,0.07226418],"genre_scores_gemma":[0.9864557,0.0001177948,0.0061507965,0.002968486,0.00031080208,7.10925e-7,0.000004035806,0.000026786227,0.003964936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782044,0.00044392387,0.00019939693,0.00059165386,0.00042721664,0.00051736634],"domain_scores_gemma":[0.9973256,0.0010605287,0.00019695325,0.001283918,0.00004868745,0.00008432244],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00056380173,0.00030013866,0.00030188967,0.000062369574,0.0013627912,0.000977566,0.0030837539,0.00010767913,0.000062205094],"category_scores_gemma":[0.000042720545,0.00015486602,0.0001715307,0.00084282574,0.0007950223,0.0011018208,0.002171335,0.00069137366,0.00012473452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055478213,0.000022624383,0.0016819122,0.000014256974,0.00006925883,0.000022041706,0.003944424,0.0006882167,0.00001175079,0.9873595,0.001733956,0.004396536],"study_design_scores_gemma":[0.002047843,0.00013432477,0.010777312,0.00007723966,0.000055030236,0.00008758464,0.002658863,0.47876987,0.00006914124,0.032685388,0.47216445,0.00047294793],"about_ca_topic_score_codex":0.0003680129,"about_ca_topic_score_gemma":0.000020567428,"teacher_disagreement_score":0.9546742,"about_ca_system_score_codex":0.00003192149,"about_ca_system_score_gemma":0.00017363648,"threshold_uncertainty_score":0.9999373},"labels":[],"label_agreement":null},{"id":"W3099249897","doi":"10.1039/d0sc06627c","title":"A feasible approach for automatically differentiable unitary coupled-cluster on quantum computers","year":2021,"lang":"en","type":"article","venue":"Chemical Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Public Health","funders":"Office of Naval Research; Government of Ontario; University of Toronto; Google; U.S. Department of Energy","keywords":"Parameterized complexity; Differentiable function; Unitary state; Quantum; Computation; Algebra over a field; Decomposition","score_opus":0.01438397427711646,"score_gpt":0.24333183353797516,"score_spread":0.2289478592608587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099249897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22831677,0.00003291001,0.7684602,0.001942383,0.0002966238,0.00018690796,0.000002817574,0.00023423266,0.0005271381],"genre_scores_gemma":[0.5872722,0.000001533759,0.41129953,0.001196208,0.00010585217,0.000018659546,0.000009403417,0.000010439665,0.0000861556],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973714,0.000035243575,0.000264868,0.0009610722,0.00064415764,0.00072330463],"domain_scores_gemma":[0.9982656,0.00039615933,0.00007190847,0.00073602196,0.00021250741,0.00031780702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047273128,0.00022025374,0.0002655024,0.00009817465,0.00039495985,0.00045278773,0.0017783721,0.000071634604,0.0000063194666],"category_scores_gemma":[0.00022942445,0.00017621338,0.00011953166,0.0012172512,0.0003559455,0.00024640973,0.00082000147,0.00025080642,0.000012782189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091620415,0.003648882,0.00023538714,0.00069515134,0.00010557359,0.00010498599,0.0023784486,0.082074866,0.41723794,0.39946195,0.019447938,0.07451726],"study_design_scores_gemma":[0.00041110197,0.00007483896,0.00017980485,0.00005018844,0.00000472154,0.000047167763,0.000011886988,0.96948457,0.023062026,0.006076177,0.00034437567,0.0002531309],"about_ca_topic_score_codex":0.0000057449624,"about_ca_topic_score_gemma":2.2682755e-7,"teacher_disagreement_score":0.88740975,"about_ca_system_score_codex":0.000078371144,"about_ca_system_score_gemma":0.0002873015,"threshold_uncertainty_score":0.7185773},"labels":[],"label_agreement":null},{"id":"W3099497530","doi":"","title":"Selecting Efficient Phase Estimation With Constant-Precision Phase Shift Operators","year":2014,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Reduction (mathematics); Phase (matter); Constant (computer programming); Logarithm; Factor (programming language); Computer science; Algorithm; Mathematics; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.007843301805527522,"score_gpt":0.26730312132395095,"score_spread":0.25945981951842345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099497530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37205198,0.000010802611,0.626408,0.00025841902,0.00013628225,0.0001122091,6.9323767e-7,0.00026280832,0.00075882225],"genre_scores_gemma":[0.73435634,2.2355336e-7,0.265391,0.00017573261,0.000047830974,0.0000029379853,0.0000021549774,0.000008560737,0.000015209176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984888,0.00011175919,0.00024200219,0.000481985,0.00034717354,0.00032829144],"domain_scores_gemma":[0.9990021,0.0002594087,0.00009379578,0.0004239572,0.00007850099,0.00014225645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056810264,0.00018748669,0.0001834213,0.00012617093,0.00033880147,0.000310296,0.0004617351,0.000041959196,0.000014958451],"category_scores_gemma":[0.00009376613,0.00012748664,0.000039018818,0.00054803304,0.00005278784,0.00014217269,0.00014020583,0.00018086733,0.000029870913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027801041,0.00037760643,0.000021242151,0.00001025456,0.000011307651,0.000011062166,0.0009896983,0.21895611,0.00081631093,0.01952056,0.00010253538,0.7591555],"study_design_scores_gemma":[0.0023500468,0.00075652194,0.00001618381,0.000056971097,0.000004969111,0.00004531683,0.000012275923,0.99003905,0.0054758443,0.00064555387,0.00038259357,0.00021464773],"about_ca_topic_score_codex":0.000018180792,"about_ca_topic_score_gemma":0.0000033049298,"teacher_disagreement_score":0.77108294,"about_ca_system_score_codex":0.000029823224,"about_ca_system_score_gemma":0.00008993293,"threshold_uncertainty_score":0.5198754},"labels":[],"label_agreement":null},{"id":"W3099659608","doi":"","title":"Quantum algorithms for connectivity and related problems","year":2018,"lang":"en","type":"article","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministero dello Sviluppo Economico; Institut Périmètre de physique théorique; Industry Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Government of Canada","keywords":"Algorithm; Graph; Algebraic connectivity; Connectivity; Mathematics; Quantum algorithm; Computer science; Discrete mathematics; Quantum; Line graph","score_opus":0.06621621003293754,"score_gpt":0.3452414115479689,"score_spread":0.27902520151503135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099659608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10258176,0.000077727236,0.8862806,0.007455919,0.0007060409,0.0019519413,0.000027428609,0.000069133195,0.0008494374],"genre_scores_gemma":[0.8699755,0.000045993198,0.12875468,0.000577303,0.0003935075,0.00019711778,0.0000070380106,0.000014534739,0.000034356253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636114,0.00010231456,0.000570664,0.00045086676,0.0016692712,0.0008457517],"domain_scores_gemma":[0.9957692,0.002337371,0.00019711314,0.00047338833,0.0010716273,0.00015128014],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.014785724,0.00023129076,0.00026110926,0.00038164313,0.0021570523,0.0013505174,0.0022837566,0.00009024119,0.0000015522824],"category_scores_gemma":[0.0010594252,0.00013112788,0.000073397736,0.0013180324,0.0021673588,0.000977378,0.00078049203,0.00044550694,0.0000048437328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000177106,0.00018848837,0.000031742726,0.00022592545,0.00003456388,0.000001114891,0.025374258,0.0026886545,0.000047842354,0.89181685,0.0012384526,0.078334376],"study_design_scores_gemma":[0.00052451494,0.00035959092,0.00034787232,0.00009512892,0.0000034492084,0.000101309284,0.00013724215,0.702967,0.000031284097,0.29119188,0.0041061076,0.00013466176],"about_ca_topic_score_codex":0.000017480457,"about_ca_topic_score_gemma":0.000017932422,"teacher_disagreement_score":0.7673937,"about_ca_system_score_codex":0.00010964916,"about_ca_system_score_gemma":0.00047495484,"threshold_uncertainty_score":0.9996862},"labels":[],"label_agreement":null},{"id":"W3099748545","doi":"","title":"Quantum query complexity of minor-closed graph properties","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minor (academic); Mathematics; Combinatorics; Upper and lower bounds; Vertex (graph theory); Graph; Quantum; Graph minor; Planar graph; Discrete mathematics; Line graph; Graph power; Physics","score_opus":0.07387360906020861,"score_gpt":0.22650068892589903,"score_spread":0.1526270798656904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099748545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6690616,0.00015991044,0.32133204,0.00031226207,0.00039217048,0.0001575463,0.0000018992669,0.00035039103,0.00823217],"genre_scores_gemma":[0.8883931,0.0000026979585,0.11131983,0.00013677037,0.000028373668,0.0000026483829,4.36247e-7,0.0000065885492,0.00010953488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988525,0.00007230883,0.00027441644,0.000309292,0.00022091542,0.000270548],"domain_scores_gemma":[0.9991481,0.000025564847,0.00010220108,0.0005570211,0.00008713682,0.00007999429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002006551,0.00014863083,0.00021883141,0.00011989925,0.000096287484,0.000030936735,0.0008982786,0.000044471693,0.000033292985],"category_scores_gemma":[0.000016367634,0.00010358116,0.000108289445,0.000306116,0.00025501128,0.00014335454,0.00029984437,0.00012309356,0.000021055217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039013696,0.0005987868,0.002653657,0.00014811687,0.000085193955,0.000031212163,0.009956727,0.00015047991,0.0070742667,0.91592985,0.0010330623,0.06229965],"study_design_scores_gemma":[0.00062383036,0.00058192824,0.04163421,0.00011736413,0.0000122985075,0.00004968876,0.00017564943,0.7146604,0.06665484,0.17423806,0.00059546455,0.0006562612],"about_ca_topic_score_codex":0.0006350618,"about_ca_topic_score_gemma":0.000022843924,"teacher_disagreement_score":0.74169177,"about_ca_system_score_codex":0.00000586547,"about_ca_system_score_gemma":0.000046082252,"threshold_uncertainty_score":0.4223917},"labels":[],"label_agreement":null},{"id":"W3099799105","doi":"10.48550/arxiv.0711.2964","title":"Optimal Algorithmic Cooling of Spins","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Spins; Quantum; Computer science; Entropy (arrow of time); Algorithm; Quantum computer; Identification (biology); Physics; Theoretical computer science; Statistical physics; Quantum mechanics; Condensed matter physics","score_opus":0.029157340945374803,"score_gpt":0.2762558368266151,"score_spread":0.24709849588124028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099799105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5506376,0.000408229,0.44715548,0.00015772959,0.0010428408,0.00015386965,0.0000074926165,0.0002030638,0.00023369878],"genre_scores_gemma":[0.7560583,0.000042159663,0.24287528,0.00018992105,0.00068317377,0.0000066186512,0.000013958414,0.000033421886,0.00009716389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972651,0.00008009884,0.0006466846,0.0009422019,0.00046495235,0.00060095714],"domain_scores_gemma":[0.997668,0.00013660135,0.00045791053,0.0013810302,0.00018703211,0.00016936842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068112474,0.00042269076,0.000580217,0.00031494885,0.00013744058,0.000095034164,0.0022367674,0.00034183022,0.000011325158],"category_scores_gemma":[0.00006537234,0.0004036296,0.0003065542,0.00040241372,0.00012275214,0.000092258866,0.0030279614,0.0012457238,0.000051487616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055776745,0.0007035311,0.043657754,0.001022539,0.00055383355,0.00074520335,0.005796534,0.6852978,0.0031533898,0.0038160007,0.0010435105,0.25415415],"study_design_scores_gemma":[0.00037904858,0.00015187227,0.057109863,0.00042379258,0.000029253697,0.000066763685,0.000019940446,0.9322939,0.006086162,0.00087082636,0.0018292458,0.00073935237],"about_ca_topic_score_codex":0.000127531,"about_ca_topic_score_gemma":0.0000031236393,"teacher_disagreement_score":0.25341478,"about_ca_system_score_codex":0.000055459015,"about_ca_system_score_gemma":0.0002404658,"threshold_uncertainty_score":0.9998416},"labels":[],"label_agreement":null},{"id":"W3099913548","doi":"10.46586/tches.v2022.i1.1-27","title":"Quantum Period Finding against Symmetric Primitives in Practice","year":2021,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Clarendon Fund; University of Oxford","keywords":"Block cipher; Cryptanalysis; Computer science; Qubit; NIST; Symmetric-key algorithm; Linear cryptanalysis; Collision attack; Key (lock); Theoretical computer science; Cryptography; Quantum; Algorithm; Public-key cryptography; Computer security; Cryptographic hash function; Encryption; Quantum mechanics; Physics","score_opus":0.015204854378747086,"score_gpt":0.2564273949056573,"score_spread":0.24122254052691022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099913548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06754048,0.0025970158,0.92491996,0.001108782,0.0013960117,0.00032179963,0.00002158436,0.00030125878,0.0017931017],"genre_scores_gemma":[0.98370296,0.00058886164,0.015210762,0.00027712013,0.00008785492,0.000053550724,0.00000560135,0.00002626589,0.00004705407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970934,0.00057158177,0.0005073852,0.0008321138,0.00046957037,0.0005259792],"domain_scores_gemma":[0.9982187,0.0006452,0.00014632306,0.0005954049,0.0001976561,0.00019669576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006988372,0.0003204696,0.00043088043,0.0009593135,0.0004931375,0.0006061615,0.00037164724,0.00017070725,0.0000048703596],"category_scores_gemma":[0.000108186505,0.00030621994,0.00019142941,0.002947959,0.000071863076,0.0005065224,0.000025524596,0.0006617269,0.000012414734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016288043,0.003129488,0.0013408529,0.0011865672,0.0012310898,0.004272743,0.0406268,0.17106146,0.0037244307,0.21982944,0.00033035103,0.5531039],"study_design_scores_gemma":[0.0021264076,0.00044668457,0.002506009,0.0014195255,0.00009069002,0.0014521601,0.011454146,0.9591479,0.00066340907,0.0011089545,0.01823318,0.001350936],"about_ca_topic_score_codex":0.00005752207,"about_ca_topic_score_gemma":0.000019676865,"teacher_disagreement_score":0.91616243,"about_ca_system_score_codex":0.000042932294,"about_ca_system_score_gemma":0.00015205888,"threshold_uncertainty_score":0.99993896},"labels":[],"label_agreement":null},{"id":"W3100372201","doi":"","title":"","year":2014,"lang":"en","type":"article","venue":"Aberystwyth Research portal (Aberystwyth University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Imperial College London; Iowa State University","keywords":"Boolean circuit; Forcing (mathematics); Electronic circuit; Computer science; Quantum computer; Computation; Theory of computation; Mathematics; Boolean function; Topology (electrical circuits); Quantum; Theoretical computer science; Algorithm; Physics; Quantum mechanics","score_opus":0.023351492659644747,"score_gpt":0.26619236061549256,"score_spread":0.2428408679558478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100372201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67734486,0.00019673727,0.28017142,0.006903889,0.00086840143,0.0011774905,0.000016912809,0.001997697,0.03132256],"genre_scores_gemma":[0.9668036,0.000088520654,0.028885042,0.0005212201,0.00057952444,0.000009597648,0.000025732214,0.00008545279,0.0030012873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9846038,0.0033843946,0.0009576308,0.003156184,0.0037400296,0.0041579404],"domain_scores_gemma":[0.9892133,0.0028354425,0.00044502618,0.003919253,0.0015623679,0.0020246434],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.007610098,0.00096998276,0.0011207015,0.0035585852,0.0034577402,0.0011302042,0.008473453,0.0004917378,0.000038342478],"category_scores_gemma":[0.0010660797,0.0009921669,0.0006047159,0.009268119,0.0011428308,0.003007459,0.0049246894,0.0028672393,0.00012443366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019677306,0.0009706232,0.006605568,0.00019829469,0.00032498274,0.0048389547,0.003174599,0.016945094,0.0037126483,0.86931777,0.0049200766,0.08879464],"study_design_scores_gemma":[0.0056444416,0.0027160533,0.015864627,0.00041894618,0.000050794268,0.001153047,0.0016632836,0.69420964,0.002448661,0.017773489,0.25527704,0.0027799846],"about_ca_topic_score_codex":0.0010133131,"about_ca_topic_score_gemma":0.00040347275,"teacher_disagreement_score":0.85154426,"about_ca_system_score_codex":0.00026015038,"about_ca_system_score_gemma":0.00073021447,"threshold_uncertainty_score":0.9999067},"labels":[],"label_agreement":null},{"id":"W3100514473","doi":"","title":"Quantum rate-distortion coding with auxiliary resources","year":2013,"lang":"en","type":"article","venue":"Civil War Book Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum capacity; Quantum channel; Mathematics; Quantum information; Qubit; Rate–distortion theory; Quantum information science; Quantum entanglement; Quantum; Topology (electrical circuits); Quantum network; Discrete mathematics; Quantum mechanics; Algorithm; Physics; Data compression; Combinatorics","score_opus":0.00901752510502642,"score_gpt":0.21903384592680808,"score_spread":0.21001632082178165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100514473","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069232527,0.73761755,0.2372347,0.011491993,0.0005334814,0.0013589002,0.000002105646,0.00087813946,0.003959851],"genre_scores_gemma":[0.33559158,0.41784003,0.08266521,0.14549778,0.002428478,0.0009756867,0.00006350496,0.00040278689,0.014534899],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983892,0.00018666583,0.00033038796,0.00047862923,0.00026566174,0.00034948654],"domain_scores_gemma":[0.9987762,0.00010101704,0.00018710791,0.0006940815,0.00009708663,0.00014450525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046386351,0.0002257046,0.00035815107,0.000061307706,0.00022219693,0.00010522805,0.0007134237,0.000041873922,0.00015718827],"category_scores_gemma":[0.000049512306,0.00015534769,0.000102815895,0.00034039473,0.000066005545,0.00037962935,0.00019195663,0.00023385392,0.000362705],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006443125,0.00015903193,0.00026337107,0.005055061,0.0000946705,0.0001097298,0.0013737292,0.00046542508,0.00033255384,0.005738122,0.5303469,0.456055],"study_design_scores_gemma":[0.00025600108,0.0002094325,0.0015996275,0.008139951,0.000036106816,0.00012867338,0.000008507746,0.10176024,0.000118897864,0.0011810716,0.88598317,0.00057833194],"about_ca_topic_score_codex":0.00003007467,"about_ca_topic_score_gemma":0.000004247043,"teacher_disagreement_score":0.45547664,"about_ca_system_score_codex":0.000034139935,"about_ca_system_score_gemma":0.000052431067,"threshold_uncertainty_score":0.6334895},"labels":[],"label_agreement":null},{"id":"W3100566623","doi":"","title":"Quantum gradient descent and Newton’s method for constrained polynomial optimization","year":2019,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Army Research Office; Ministry of Education - Singapore; National Research Foundation Singapore","keywords":"Gradient descent; Maxima and minima; Quantum phase estimation algorithm; Quantum; Quantum algorithm; Mathematical optimization; Descent direction; Convergence (economics); Dimension (graph theory); Newton's method in optimization; Polynomial; Applied mathematics; Algorithm; Iterative method; Physics; Local convergence; Quantum error correction; Mathematics; Computer science; Mathematical analysis; Quantum mechanics","score_opus":0.008808084638841113,"score_gpt":0.24382433616009572,"score_spread":0.2350162515212546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100566623","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08484306,0.00025829606,0.89975834,0.012606188,0.0011869707,0.0007698167,0.000031750158,0.0004674461,0.00007814269],"genre_scores_gemma":[0.26206142,0.00002467423,0.73760694,0.00013297392,0.000049995313,0.000026368707,0.000008733534,0.000019705873,0.00006917456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806553,0.000037241974,0.00042295558,0.0007412078,0.00022927028,0.0005038223],"domain_scores_gemma":[0.99857515,0.0000831196,0.00031156326,0.00077458104,0.0001448783,0.000110698784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035600114,0.00031349852,0.00049684424,0.000615742,0.0001871446,0.000079226425,0.00089229457,0.00031553712,0.000004341473],"category_scores_gemma":[0.0001416778,0.0002881693,0.00012994144,0.00066361873,0.00028976527,0.0002753539,0.00043083637,0.0003069946,0.0000037424436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013840408,0.0005088517,0.0043169814,0.00044979088,0.00047770847,0.0000441805,0.001174881,0.19513868,0.021443596,0.4340547,0.0029872814,0.33926493],"study_design_scores_gemma":[0.0015803976,0.00046361552,0.00022761087,0.00011023578,0.000029803077,0.0000885399,0.000037526912,0.9575862,0.0053510917,0.0027528312,0.03138837,0.000383745],"about_ca_topic_score_codex":0.000027333472,"about_ca_topic_score_gemma":0.000008447039,"teacher_disagreement_score":0.76244754,"about_ca_system_score_codex":0.000064249274,"about_ca_system_score_gemma":0.00015278172,"threshold_uncertainty_score":0.999957},"labels":[],"label_agreement":null},{"id":"W3100642416","doi":"","title":"Enhanced Feedback Iterative Decoding of Sparse Quantum Codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Decoding methods; Sequential decoding; Algorithm; Computer science; List decoding; Belief propagation; Overhead (engineering); Qubit; Theoretical computer science; Channel (broadcasting); Code (set theory); Berlekamp–Welch algorithm; Concatenated error correction code; Quantum; Block code; Telecommunications; Set (abstract data type); Physics","score_opus":0.014737131894675905,"score_gpt":0.24643048378806726,"score_spread":0.23169335189339135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100642416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28398702,0.000025546438,0.7136827,0.00076523743,0.00019349996,0.00005096384,0.0000020472028,0.00010343542,0.001189551],"genre_scores_gemma":[0.90882367,0.000011427143,0.0906218,0.00013574368,0.000052335112,0.0000022072356,3.0564115e-7,0.0000057905713,0.00034669717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895185,0.000057205005,0.00023676583,0.00031915415,0.00018242202,0.00025261246],"domain_scores_gemma":[0.9990691,0.00028494274,0.000108035514,0.00037539267,0.00009083658,0.000071682574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018533663,0.0001296945,0.0001951917,0.000080818034,0.00007485127,0.000049619077,0.0005720127,0.00003675212,0.000038571416],"category_scores_gemma":[0.00005418468,0.00007357292,0.000070890586,0.00022334921,0.00006781704,0.00019324689,0.0002274627,0.000059468042,0.00004450249],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017190428,0.00011519881,0.00022330691,0.000026341084,0.00005096365,0.000012662246,0.0029850833,0.00077010266,0.19918706,0.3010495,0.00096565014,0.49459696],"study_design_scores_gemma":[0.0006806765,0.00024407468,0.0012711175,0.00023670387,0.000003886366,0.00001684074,0.000042637323,0.53329515,0.44319004,0.019960271,0.0007279378,0.00033066844],"about_ca_topic_score_codex":0.000013733137,"about_ca_topic_score_gemma":0.000005315385,"teacher_disagreement_score":0.6248367,"about_ca_system_score_codex":0.000014349458,"about_ca_system_score_gemma":0.000034126828,"threshold_uncertainty_score":0.30002168},"labels":[],"label_agreement":null},{"id":"W3100707651","doi":"10.1103/prxquantum.2.040345","title":"Fault-Tolerant Qubit from a Constant Number of Components","year":2021,"lang":"en","type":"preprint","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Australian Research Council; Canadian Institute for Advanced Research; Adolph C. and Mary Sprague Miller Institute for Basic Research in Science, University of California Berkeley; Simons Foundation; National Science Foundation","keywords":"Quantum computer; Quantum error correction; Qubit; Computer science; Fault tolerance; Computation; Coherence time; Error detection and correction; Coherence (philosophical gambling strategy); Overhead (engineering); Quantum; Algorithm; Topology (electrical circuits); Quantum mechanics; Physics; Mathematics; Distributed computing","score_opus":0.0203825415793998,"score_gpt":0.2630896423541278,"score_spread":0.24270710077472799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100707651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72009856,0.0011534516,0.2736996,0.0006979315,0.003016466,0.00032253834,0.00014237643,0.0002848116,0.00058425847],"genre_scores_gemma":[0.9206938,0.00007031899,0.0785139,0.00024290149,0.00023403561,0.000020919822,0.00014615292,0.000040679395,0.00003728993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959431,0.00032951636,0.00094417913,0.0013498986,0.0008504289,0.00058286247],"domain_scores_gemma":[0.9965224,0.00035290906,0.00067804166,0.0019343874,0.0002926579,0.00021957564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036103048,0.0005779666,0.0011166416,0.00012923402,0.00014185534,0.00037767147,0.002336201,0.0003636318,0.00009247708],"category_scores_gemma":[0.00007042901,0.0005365888,0.00045814898,0.00032721186,0.0001686022,0.00011748418,0.004080378,0.0012333309,0.00005741745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049762626,0.009632523,0.03349734,0.0059437905,0.0069993436,0.0076638474,0.07561628,0.16532353,0.04192796,0.3756376,0.010571742,0.26668844],"study_design_scores_gemma":[0.00058432884,0.00003729443,0.0030361982,0.0010264204,0.00004362414,0.000067123794,0.00006762928,0.9538919,0.0012576687,0.03817787,0.001104649,0.00070529745],"about_ca_topic_score_codex":0.0017000083,"about_ca_topic_score_gemma":0.000021043514,"teacher_disagreement_score":0.7885684,"about_ca_system_score_codex":0.000060530954,"about_ca_system_score_gemma":0.00042042544,"threshold_uncertainty_score":0.9997086},"labels":[],"label_agreement":null},{"id":"W3101038858","doi":"10.1088/2058-9565/abe567","title":"TEQUILA: a platform for rapid development of quantum algorithms","year":2021,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Canadian Institute for Advanced Research; The Scarborough Hospital; University of Toronto","funders":"Mitacs; University of Toronto; Lawrence Berkeley National Laboratory; Canadian Institute for Advanced Research; Deutscher Akademischer Austauschdienst; Government of Ontario; Office of Naval Research; Google; U.S. Department of Energy","keywords":"Heuristics; Development (topology); Quantum algorithm; Quantum; Quantum computer; Software deployment; Field (mathematics); State (computer science)","score_opus":0.018339063720599225,"score_gpt":0.2590197631350548,"score_spread":0.24068069941445558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101038858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.425431,0.0008283412,0.5697164,0.0029613639,0.00049095525,0.00020500635,0.000004198711,0.0002624382,0.00010030468],"genre_scores_gemma":[0.66940224,0.000028783963,0.33036655,0.00011590618,0.000029357938,0.000025992342,0.000001588706,0.000008773096,0.000020783662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768627,0.000011409095,0.00041965186,0.0007876448,0.00045920312,0.00063580804],"domain_scores_gemma":[0.9983131,0.0001242022,0.000167254,0.000632208,0.000649071,0.00011414331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009983105,0.00019188372,0.00032896962,0.0006020821,0.00059557357,0.000109432694,0.001275789,0.00013448708,0.0000030243978],"category_scores_gemma":[0.00035670635,0.00016423054,0.000046173373,0.0027580373,0.000815402,0.00029758192,0.0009074437,0.0001957106,0.0000039667666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031208572,0.00008104324,0.00007707062,0.00003952209,0.000013425168,0.000016307355,0.00060105807,0.000010603874,0.036724005,0.43516773,0.000056685523,0.52720946],"study_design_scores_gemma":[0.00054757943,0.00034764234,0.000383481,0.000070361566,0.0000062661557,0.00024266727,0.0003535314,0.70068157,0.20634769,0.07911983,0.011558193,0.00034121348],"about_ca_topic_score_codex":0.000003865758,"about_ca_topic_score_gemma":0.000003357555,"teacher_disagreement_score":0.70067096,"about_ca_system_score_codex":0.000042254596,"about_ca_system_score_gemma":0.0012453821,"threshold_uncertainty_score":0.6697127},"labels":[],"label_agreement":null},{"id":"W3101167844","doi":"","title":"Enhancing quantum control by bootstrapping a quantum processor of 12 qubits","year":2017,"lang":"en","type":"article","venue":"MPG.PuRe (Max Planck Society)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Computer science; Quantum computer; Sequence (biology); Quantum; Quantum error correction; Quantum mechanics; Physics","score_opus":0.010305398955433366,"score_gpt":0.2336717490414465,"score_spread":0.22336635008601313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101167844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34509093,0.0012941258,0.64639175,0.003351115,0.0016134519,0.0006324845,0.000100527315,0.0005231946,0.001002422],"genre_scores_gemma":[0.99102986,0.000038081736,0.0076385243,0.0005224091,0.00043089682,0.000024416613,0.0000104680275,0.00004146898,0.00026389153],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967679,0.000086533364,0.00065239304,0.0008951227,0.000680222,0.0009178576],"domain_scores_gemma":[0.9971228,0.00026363067,0.0008561186,0.0013498951,0.00017679566,0.00023075295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006995439,0.00046848413,0.00073203177,0.0000708967,0.0011156388,0.00052852824,0.0025132694,0.00028294406,0.000010898495],"category_scores_gemma":[0.00017663781,0.000420852,0.00042770783,0.00022227892,0.0002298591,0.0005462506,0.0004171385,0.00066472456,0.000019186593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000320259,0.0024290308,0.026234169,0.0050410996,0.0027833115,0.0003748516,0.055330727,0.009941156,0.5733987,0.09420776,0.16421893,0.06571997],"study_design_scores_gemma":[0.003074511,0.00045081542,0.004373795,0.0007909958,0.00006680731,0.00007675822,0.0003229544,0.95169616,0.016629465,0.0077293846,0.013546916,0.0012414176],"about_ca_topic_score_codex":0.00010879398,"about_ca_topic_score_gemma":0.000029134897,"teacher_disagreement_score":0.941755,"about_ca_system_score_codex":0.000047356985,"about_ca_system_score_gemma":0.00023283961,"threshold_uncertainty_score":0.99982435},"labels":[],"label_agreement":null},{"id":"W3101168705","doi":"","title":"Quantum interference channels","year":2011,"lang":"en","type":"preprint","venue":"Civil War Book Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Communication source; Computer science; Interference (communication); Quantum; Channel (broadcasting); Quantum channel; Quantum capacity; Topology (electrical circuits); Generalization; Amplitude damping channel; Mathematics; Quantum entanglement; Telecommunications; Quantum network; Physics; Quantum mechanics; Combinatorics","score_opus":0.03273753460511851,"score_gpt":0.2668033910902985,"score_spread":0.23406585648517997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101168705","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028995444,0.73201483,0.2577163,0.0020619496,0.0031517444,0.00073277904,0.0000073955584,0.00051212515,0.0037738613],"genre_scores_gemma":[0.008078257,0.931016,0.024361888,0.031284653,0.0013980533,0.00033962203,0.000051304974,0.00015252625,0.0033176385],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99663854,0.0002858649,0.0007592874,0.0013414683,0.0003729648,0.00060187076],"domain_scores_gemma":[0.9964444,0.00008701497,0.0005318958,0.0025229629,0.00016910744,0.00024460716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000748058,0.0006396886,0.0011312205,0.00014130784,0.00013402851,0.00014569625,0.0041216966,0.00024086371,0.00026546145],"category_scores_gemma":[0.0001054999,0.00052454026,0.00051327125,0.0002562801,0.000093765004,0.00016079303,0.004988939,0.0013571281,0.0005514148],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043239825,0.00025196024,0.000007362792,0.027575118,0.00023447297,0.00023840336,0.00210135,0.00041956408,0.000011603102,0.02225773,0.4961879,0.4507102],"study_design_scores_gemma":[0.00016761373,0.0001850868,0.000026499749,0.069977425,0.00011358272,0.00016413209,0.0000019006804,0.112527706,0.00012340638,0.04799784,0.7671102,0.0016045928],"about_ca_topic_score_codex":0.000026201267,"about_ca_topic_score_gemma":0.0000026025104,"teacher_disagreement_score":0.44910562,"about_ca_system_score_codex":0.00005171495,"about_ca_system_score_gemma":0.0002699418,"threshold_uncertainty_score":0.99972063},"labels":[],"label_agreement":null},{"id":"W3101258530","doi":"","title":"Stabilizer Formalism for Generalized Concatenated Quantum Codes","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Calgary","funders":"","keywords":"Formalism (music); Computer science; Quantum; Concatenated error correction code; Physics; Theoretical computer science; Algorithm; Quantum mechanics; Block code; Decoding methods","score_opus":0.022831852397428617,"score_gpt":0.2722592561416761,"score_spread":0.2494274037442475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101258530","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029943006,0.00030750013,0.95847565,0.005743525,0.002708475,0.00093029276,0.00013349806,0.001020677,0.000737402],"genre_scores_gemma":[0.43004233,0.00012805987,0.56230646,0.0028455688,0.0012727963,0.0004560236,0.00021871971,0.0001307067,0.0025993462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703157,0.00012728503,0.00060208375,0.0011222877,0.00035956982,0.0007572194],"domain_scores_gemma":[0.9974357,0.00036815568,0.00032647394,0.0013463628,0.0003220411,0.00020126162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006131934,0.0005254001,0.0006683422,0.00018460296,0.00023362055,0.00042989635,0.0022389367,0.00037852526,0.00003919795],"category_scores_gemma":[0.000078713114,0.000338589,0.00040937972,0.0001408153,0.00010022419,0.00014463672,0.00232392,0.00040489453,0.00002435532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007651608,0.00018260995,0.000043573924,0.00062896614,0.0003699928,0.000028461547,0.0017303083,0.010567573,0.0020940716,0.8824695,0.03543831,0.06637017],"study_design_scores_gemma":[0.0008772572,0.00008020129,0.000035820347,0.000107752014,0.000018255332,0.000012906258,0.0000053187273,0.752372,0.0023532617,0.22677712,0.016818976,0.00054107705],"about_ca_topic_score_codex":0.00007915734,"about_ca_topic_score_gemma":0.000007189479,"teacher_disagreement_score":0.7418045,"about_ca_system_score_codex":0.00006923999,"about_ca_system_score_gemma":0.00023533768,"threshold_uncertainty_score":0.9999066},"labels":[],"label_agreement":null},{"id":"W3101636216","doi":"","title":"Efficient Quantum Algorithms for Simulating Sparse Hamiltonians","year":2007,"lang":"en","type":"article","venue":"Queensland's institutional digital repository (The University of Queensland)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":384,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sublinear function; Qubit; Scaling; Hamiltonian (control theory); Constant (computer programming); Bounded function; Quantum computer; Quantum; Matrix (chemical analysis); Integer (computer science); Algorithm; Quantum algorithm; Mathematics; Combinatorics; Discrete mathematics; Computer science; Quantum mechanics; Physics; Mathematical optimization; Geometry; Mathematical analysis","score_opus":0.013765090740635566,"score_gpt":0.2212022731587069,"score_spread":0.20743718241807135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101636216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24840008,0.000079361664,0.7452631,0.00026667948,0.00059467426,0.00030539435,0.000038172573,0.00015405215,0.00489849],"genre_scores_gemma":[0.9810859,0.0000020189714,0.018071132,0.000060060887,0.00022890672,4.8160314e-7,0.00001608158,0.000011439678,0.00052395475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980727,0.000043707587,0.00037326428,0.00051045424,0.00052417564,0.0004757085],"domain_scores_gemma":[0.9981664,0.00061428966,0.00026486206,0.0004980522,0.00028952904,0.00016686857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042623386,0.0002549123,0.00029066397,0.00016616505,0.0011731514,0.00013952902,0.00093670824,0.0001225346,0.0000025631089],"category_scores_gemma":[0.00008903332,0.00021166829,0.0002919058,0.00034123223,0.00047823353,0.00022463685,0.00029105396,0.00025085377,0.000014837102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043044455,0.0006656534,0.008162332,0.00015148189,0.00032918615,0.0006980643,0.004521225,0.7680734,0.0008114854,0.14246577,0.0015470469,0.07214395],"study_design_scores_gemma":[0.001136424,0.00023111633,0.015522279,0.00013301031,0.000028811673,0.0002409405,0.00026192662,0.96106565,0.00035134095,0.0018651319,0.018770237,0.0003931253],"about_ca_topic_score_codex":0.00015450027,"about_ca_topic_score_gemma":0.00001674583,"teacher_disagreement_score":0.73268586,"about_ca_system_score_codex":0.00009564286,"about_ca_system_score_gemma":0.00024931593,"threshold_uncertainty_score":0.9023051},"labels":[],"label_agreement":null},{"id":"W3101716590","doi":"10.3929/ethz-b-000058359","title":"Strong Resilience of Topological Codes to Depolarization","year":2012,"lang":"en","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Ministerio de Ciencia e Innovación; Industry Canada; Eidgenössische Technische Hochschule Zürich; European Commission; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Division of Materials Research; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Toric code; Quantum decoherence; Ising model; Vertex (graph theory); Statistical physics; Quantum; Physics; Noise (video); Quantum error correction; Quantum computer; Topology (electrical circuits); Mathematics; Quantum mechanics; Computer science; Discrete mathematics; Combinatorics; Artificial intelligence","score_opus":0.016036107033811524,"score_gpt":0.26911447966545243,"score_spread":0.2530783726316409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101716590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2563391,0.00021745673,0.74071217,0.00027377522,0.0015498252,0.00010812643,0.00004765909,0.00010131042,0.00065055746],"genre_scores_gemma":[0.8528019,0.0000036614351,0.14654377,0.00009785532,0.0004821835,0.0000074058557,0.000032351083,0.000003834038,0.000026995633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99842083,0.00007484674,0.00032137753,0.00032769502,0.0005136603,0.00034157382],"domain_scores_gemma":[0.998859,0.0001455083,0.000110775756,0.0005345767,0.00014432386,0.00020583118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031687785,0.00014633632,0.0001682194,0.00009825208,0.0003799365,0.00008720135,0.00063203205,0.000057637462,0.000004769365],"category_scores_gemma":[0.00032176802,0.00012356293,0.000050449114,0.0004879115,0.00020146937,0.00083362614,0.0005511105,0.00015852989,0.000013957556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002006401,0.00019144522,0.029576441,0.000031314397,0.000019124032,0.000026479056,0.00048151982,0.009538174,0.016713642,0.93854046,0.0002860974,0.0045752195],"study_design_scores_gemma":[0.001381215,0.001032444,0.41188738,0.0009785054,0.000078613695,0.0019092787,0.0002699889,0.17694226,0.3205735,0.0042165644,0.078423366,0.0023068902],"about_ca_topic_score_codex":0.00016290398,"about_ca_topic_score_gemma":0.000008288883,"teacher_disagreement_score":0.9343239,"about_ca_system_score_codex":0.00005896426,"about_ca_system_score_gemma":0.0001677431,"threshold_uncertainty_score":0.503875},"labels":[],"label_agreement":null},{"id":"W3101733808","doi":"","title":"Efficient Algorithms for Universal Quantum Simulation","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Quantum simulator; Quantum algorithm; Qubit; Quantum computer; Quantum; Quantum dynamics; Theoretical computer science; Algorithm; Computational science; Quantum mechanics; Physics","score_opus":0.020649268457794353,"score_gpt":0.251543106781065,"score_spread":0.23089383832327065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101733808","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000131892275,0.000086555854,0.9008842,0.00059253,0.0010506179,0.00040233918,0.00003457897,0.0004143533,0.09652161],"genre_scores_gemma":[0.012285936,0.000012734241,0.19282576,0.00044022125,0.0017112094,0.000011130329,0.000024635865,0.00014251229,0.79254586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813825,0.000013593693,0.0003271229,0.0007741473,0.00036738112,0.00037952428],"domain_scores_gemma":[0.9982666,0.00050867646,0.00021911149,0.00068002346,0.00019303436,0.00013258315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021698893,0.00038689203,0.00034330864,0.00023364717,0.00020474565,0.00011296061,0.0008574004,0.0002664754,0.00005293051],"category_scores_gemma":[0.000018416582,0.0002824942,0.0002828056,0.000042587388,0.000064218235,0.000048086727,0.00033093625,0.00020326108,0.000124225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005130236,0.000010039922,7.111464e-8,0.000014991625,0.000028760529,0.00000826604,0.00005981723,0.09138451,0.000005440141,0.7595001,0.0003746576,0.14860821],"study_design_scores_gemma":[0.00033373435,0.00012844421,0.0000013880604,0.0001034133,0.000011882675,0.0000058608525,8.663684e-7,0.8119326,0.000009192178,0.059044424,0.12805565,0.00037254195],"about_ca_topic_score_codex":0.0000022378513,"about_ca_topic_score_gemma":7.012531e-7,"teacher_disagreement_score":0.7205481,"about_ca_system_score_codex":0.000089560905,"about_ca_system_score_gemma":0.00012158804,"threshold_uncertainty_score":0.99996275},"labels":[],"label_agreement":null},{"id":"W3101874719","doi":"","title":"Experimental demonstration of quantum fully homomorphic encryption with application in a two-party secure protocol","year":2018,"lang":"en","type":"article","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Gordon and Betty Moore Foundation; National Science Foundation","keywords":"Homomorphic encryption; Computer science; Protocol (science); Quantum; Encryption; Quantum computer; Computer security; Computer network; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.039789517393529296,"score_gpt":0.35910170178378453,"score_spread":0.3193121843902552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101874719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16364482,0.000007655705,0.82347804,0.0013552231,0.00009393542,0.010898978,0.0000060998786,0.000033536715,0.00048170198],"genre_scores_gemma":[0.9398913,0.0000016762937,0.05644739,0.00013033499,0.00014099498,0.0033756122,0.0000033831393,0.0000073545484,0.0000019563697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966359,0.000106332656,0.000573268,0.00031668664,0.0018620689,0.000505706],"domain_scores_gemma":[0.99801695,0.00050417695,0.00025172898,0.00041112662,0.0007376094,0.00007841616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071965167,0.0001783784,0.00019818885,0.00040988188,0.00071163167,0.00049810205,0.001732368,0.00004929912,0.0000013671138],"category_scores_gemma":[0.00014061837,0.000099292716,0.000040553085,0.0016244164,0.0014544056,0.0009116962,0.00033454513,0.00034975717,0.0000038457338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001063807,0.00055562187,0.000230606,0.0002187239,0.000014951753,0.0000018144472,0.028351242,0.014176043,0.0007524001,0.92987126,0.00017023635,0.025550736],"study_design_scores_gemma":[0.00091588125,0.00052976504,0.00050956674,0.00015642749,0.0000017741742,0.000068184716,0.0003715337,0.9396341,0.0009297259,0.0561477,0.0006108022,0.00012454556],"about_ca_topic_score_codex":0.0000375308,"about_ca_topic_score_gemma":0.000079199126,"teacher_disagreement_score":0.9254581,"about_ca_system_score_codex":0.00013654401,"about_ca_system_score_gemma":0.0006192853,"threshold_uncertainty_score":0.54733676},"labels":[],"label_agreement":null},{"id":"W3102240750","doi":"10.4230/lipics.mfcs.2020.24","title":"PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"Agence Nationale de la Recherche","keywords":"Quantum; Computer science; Computation; Semantics (computer science); Syntax; Calculus (dental); Quantum computer; Algebra over a field; Theoretical computer science; Mathematics; Programming language; Quantum mechanics; Pure mathematics; Physics","score_opus":0.04000701658217539,"score_gpt":0.20680596221331435,"score_spread":0.16679894563113895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102240750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11232623,0.00010283175,0.88538665,0.00081219076,0.00041471474,0.00053820893,0.00012061276,0.00024192722,0.000056617533],"genre_scores_gemma":[0.99092084,0.000011768987,0.008682388,0.00019058821,0.00011284679,0.0000025538586,0.00002992393,0.000019388419,0.000029722425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814606,0.00015015875,0.00030604945,0.0009445155,0.000119889606,0.0003333433],"domain_scores_gemma":[0.998197,0.00036121486,0.0003434626,0.0007074468,0.000188086,0.00020279508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018494015,0.00030690277,0.0005404182,0.0002114258,0.0001438357,0.000074610056,0.0015286778,0.00020934541,0.0000049938794],"category_scores_gemma":[0.00004986548,0.0003210327,0.0004699818,0.00054063485,0.00017756554,0.000075898046,0.00093148166,0.00054421724,0.00000799984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004286657,0.0001374603,0.00013381931,0.0001968597,0.00017457776,0.00009795025,0.00073684216,0.60398376,0.000118594966,0.39264616,0.0001970188,0.0015340822],"study_design_scores_gemma":[0.0010308145,0.0001678023,0.00035448888,0.000101668724,0.000080340185,0.0000038784,0.0000643778,0.9406026,0.00005971936,0.05706273,0.00016387366,0.0003077118],"about_ca_topic_score_codex":0.00008032366,"about_ca_topic_score_gemma":0.000008682225,"teacher_disagreement_score":0.8785946,"about_ca_system_score_codex":0.000044468878,"about_ca_system_score_gemma":0.00018824944,"threshold_uncertainty_score":0.9999242},"labels":[],"label_agreement":null},{"id":"W3102338202","doi":"10.1016/j.jctb.2015.12.009","title":"Quantum homomorphisms","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Homomorphism; Graph homomorphism; Mathematics; Discrete mathematics; Combinatorics; Quantum; Graph; Line graph; Graph power; Quantum mechanics","score_opus":0.006803118382228696,"score_gpt":0.2154634902829134,"score_spread":0.2086603719006847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102338202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26881793,0.00056543306,0.6929932,0.0062674657,0.029646575,0.000117934826,0.0000036599304,0.00016572539,0.0014220927],"genre_scores_gemma":[0.9916044,0.00004277437,0.006842621,0.00010770511,0.0011560033,7.476011e-7,7.1573325e-8,0.000013668534,0.00023203254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839854,0.00027404018,0.00046677535,0.00016450055,0.00042121697,0.0002749206],"domain_scores_gemma":[0.9982779,0.0004632411,0.0004436622,0.0003880718,0.00027064478,0.00015646717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013196322,0.00016278356,0.0003151989,0.00014554967,0.0001374345,0.00011456361,0.0012321108,0.00007060626,0.000035509787],"category_scores_gemma":[0.00028945605,0.00009242236,0.00018494042,0.0002446619,0.00013807527,0.0007238897,0.00021427115,0.00021098471,0.00001743084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011632215,0.000057717207,0.00001957339,0.0000034472364,0.00003401148,0.000090209105,0.00019301196,0.000016386435,0.0018359447,0.96239316,0.0006199359,0.034620292],"study_design_scores_gemma":[0.0010894263,0.00089195673,0.00014462731,0.000092646915,0.000008344765,0.0005838381,0.00001930161,0.00022915997,0.005490836,0.96672094,0.024563126,0.00016579838],"about_ca_topic_score_codex":4.8586935e-7,"about_ca_topic_score_gemma":4.4741363e-8,"teacher_disagreement_score":0.7227865,"about_ca_system_score_codex":0.000040196654,"about_ca_system_score_gemma":0.00014049993,"threshold_uncertainty_score":0.37688744},"labels":[],"label_agreement":null},{"id":"W3102615112","doi":"","title":"Parallelizing quantum circuit synthesis","year":2015,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Quantum circuit; Qubit; Quantum computer; Quantum gate; Speedup; Pseudorandom number generator; Electronic circuit; Adder; Parallel computing; Quantum algorithm; Set (abstract data type); Algorithm; Quantum; Topology (electrical circuits); Theoretical computer science; Mathematics; Quantum error correction; Quantum mechanics; Physics","score_opus":0.042229344672917175,"score_gpt":0.24547774376596584,"score_spread":0.20324839909304868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102615112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027547797,0.0001427617,0.9536698,0.0019197867,0.00051600084,0.000059661284,3.8578645e-7,0.00060949253,0.0155343525],"genre_scores_gemma":[0.92238647,0.000002523403,0.07674149,0.00046596705,0.00013923753,0.000006080293,2.5594113e-7,0.000008794823,0.00024919113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889135,0.000059459486,0.00015617038,0.00032066889,0.00027234323,0.0003000115],"domain_scores_gemma":[0.9990808,0.00013746959,0.000042928066,0.0004813389,0.000057711597,0.00019975545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036925334,0.00011982527,0.0001403545,0.000077169265,0.00008924366,0.00016842697,0.000823027,0.000040195086,0.00001076247],"category_scores_gemma":[0.00012343164,0.00009404012,0.000058481026,0.00026943148,0.000023564118,0.00016870855,0.00025385755,0.00011338711,0.00019500907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030212268,0.000087038265,0.00042544605,0.000011625394,0.00002909857,0.000085934495,0.001725167,0.00688771,0.00021036131,0.6588794,0.01059451,0.3210607],"study_design_scores_gemma":[0.00013549763,0.000046639278,0.00034108662,0.000017004817,0.0000027168298,0.00006464465,0.000046486104,0.94428325,0.0005869743,0.041871116,0.0123822745,0.00022230351],"about_ca_topic_score_codex":0.000050814688,"about_ca_topic_score_gemma":0.0000020961936,"teacher_disagreement_score":0.9373956,"about_ca_system_score_codex":0.00002134794,"about_ca_system_score_gemma":0.00007618711,"threshold_uncertainty_score":0.38348448},"labels":[],"label_agreement":null},{"id":"W3102640842","doi":"","title":"1Dualities and Identities for Entanglement-Assisted Quantum Codes","year":2014,"lang":"en","type":"article","venue":"Civil War Book Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum entanglement; Block code; Discrete mathematics; Mathematics; Upper and lower bounds; Linear code; Computer science; Quantum; Algorithm; Physics; Quantum mechanics; Decoding methods","score_opus":0.015613830125674454,"score_gpt":0.2635492779201547,"score_spread":0.24793544779448023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102640842","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074200094,0.648717,0.34271938,0.00520398,0.00052818365,0.00070343766,0.000018003557,0.00030167948,0.0010663714],"genre_scores_gemma":[0.05105108,0.6705506,0.13261601,0.1270152,0.0019507803,0.0008113268,0.00016508384,0.000210394,0.015629563],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986801,0.00013603139,0.00033220148,0.00036277497,0.00019879296,0.00029011426],"domain_scores_gemma":[0.9990236,0.00025782257,0.00013751393,0.00042204792,0.00007049627,0.00008849957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069270947,0.00018467558,0.0003864613,0.00005130342,0.00022003059,0.00011861213,0.00046193766,0.000031523392,0.000026090354],"category_scores_gemma":[0.000109876506,0.00014967035,0.00012238475,0.00010671128,0.000075673335,0.00018468879,0.0002263511,0.000083138926,0.000013451246],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004042346,0.00008286637,0.000071009796,0.01191948,0.00010317117,0.0000075311923,0.0011976383,0.000021347876,0.00007218818,0.17220724,0.40385875,0.41045472],"study_design_scores_gemma":[0.0002695464,0.00013994472,0.00013488275,0.0026887914,0.000039269726,0.000051112722,0.00001616939,0.034823127,0.000071141076,0.0119166775,0.94956684,0.0002825092],"about_ca_topic_score_codex":0.0000063904577,"about_ca_topic_score_gemma":0.0000062512086,"teacher_disagreement_score":0.54570806,"about_ca_system_score_codex":0.000014783282,"about_ca_system_score_gemma":0.000025432904,"threshold_uncertainty_score":0.610338},"labels":[],"label_agreement":null},{"id":"W3102821223","doi":"","title":"Quantum rate distortion, reverse shannon theorems, and source-channel separation","year":2013,"lang":"en","type":"article","venue":"Civil War Book Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum capacity; Classical capacity; Quantum channel; Mathematics; Quantum information; Rate–distortion theory; Amplitude damping channel; Quantum entanglement; Topology (electrical circuits); Discrete mathematics; Quantum; Algorithm; Quantum network; Quantum mechanics; Physics; Data compression; Combinatorics","score_opus":0.009350585408848769,"score_gpt":0.23902363576526642,"score_spread":0.22967305035641766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102821223","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017802215,0.48144192,0.50545186,0.008641411,0.00048189404,0.0010143939,0.000002725475,0.00035530594,0.0008302677],"genre_scores_gemma":[0.16817617,0.6744921,0.017042628,0.116914734,0.0019350894,0.0006689738,0.000122391,0.00025114103,0.020396786],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984842,0.00021926276,0.0003578362,0.00046850895,0.0001838696,0.00028634633],"domain_scores_gemma":[0.99892974,0.0000817301,0.00018629486,0.0005511386,0.00010660697,0.00014448822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964816,0.00021747316,0.0003258051,0.00005373735,0.00022340324,0.00010321169,0.0004055999,0.000052227013,0.000102316255],"category_scores_gemma":[0.000078763354,0.00016844751,0.000093978466,0.00022467316,0.00006959312,0.0004214874,0.00021166743,0.00017641512,0.0003021157],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033822264,0.00009966375,0.00003473678,0.0026091498,0.000052883013,0.000017823722,0.00167173,0.0004530334,0.0002900476,0.009416722,0.6964684,0.2888824],"study_design_scores_gemma":[0.00020560664,0.00010602293,0.00034529832,0.0026368825,0.00003086802,0.00007648719,0.000008028817,0.22828051,0.00007085211,0.011074949,0.75670743,0.0004570519],"about_ca_topic_score_codex":0.000027413986,"about_ca_topic_score_gemma":0.0000029020136,"teacher_disagreement_score":0.48840925,"about_ca_system_score_codex":0.000023775681,"about_ca_system_score_gemma":0.000036285066,"threshold_uncertainty_score":0.686909},"labels":[],"label_agreement":null},{"id":"W3103335547","doi":"","title":"Multi-error-correcting amplitude damping codes","year":2010,"lang":"en","type":"preprint","venue":"UTS ePRESS (University of Technology Sydney)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"","keywords":"Luby transform code; Tornado code; Online codes; Computer science; Fountain code; Amplitude; Concatenated error correction code; Block code; Degenerate energy levels; Turbo code; Erasure; Algorithm; Physics; Electronic engineering; Quantum mechanics; Decoding methods; Engineering","score_opus":0.01804232824015962,"score_gpt":0.24154446295461046,"score_spread":0.22350213471445085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103335547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37507868,0.00022867565,0.62007535,0.0019108675,0.0011754209,0.00023007285,0.000020822703,0.0011017241,0.00017838062],"genre_scores_gemma":[0.5478539,0.000019742469,0.45188668,0.000031692925,0.000042242096,8.663724e-7,0.000008181196,0.000017557737,0.00013911987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975353,0.00007903987,0.00027604436,0.0012510439,0.0002926755,0.00056590926],"domain_scores_gemma":[0.9969282,0.00013402566,0.000603954,0.0019854514,0.00022454456,0.00012383751],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00034315157,0.00042823664,0.0007472865,0.0010726744,0.00049484044,0.00008298394,0.005087718,0.0012821069,0.00001575284],"category_scores_gemma":[0.00015679978,0.0005038889,0.00028061224,0.0005847173,0.00057026884,0.000165682,0.009040073,0.002897881,0.00001825896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055271335,0.0011016935,0.02183754,0.00121481,0.0011698543,0.0010494675,0.016190512,0.047708705,0.025450317,0.022996586,0.0011206088,0.8601046],"study_design_scores_gemma":[0.0008059834,0.00008451766,0.0046895915,0.0007507337,0.00008022065,0.00014779728,0.0007253831,0.9734854,0.0039153006,0.010641689,0.0036480732,0.0010253211],"about_ca_topic_score_codex":0.00071666547,"about_ca_topic_score_gemma":0.00023154463,"teacher_disagreement_score":0.92577666,"about_ca_system_score_codex":0.00005702272,"about_ca_system_score_gemma":0.00016509203,"threshold_uncertainty_score":0.99974126},"labels":[],"label_agreement":null},{"id":"W3103489693","doi":"","title":"Generalized graph states based on Hadamard matrices","year":2015,"lang":"en","type":"article","venue":"UTS ePRESS (University of Technology Sydney)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Voltage graph; Discrete mathematics; Symmetric graph; Line graph; Null graph; Distance-regular graph; Complement graph; Combinatorics; Graph","score_opus":0.010710668648968306,"score_gpt":0.2030884075045575,"score_spread":0.1923777388555892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103489693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5350785,0.0002773922,0.4494035,0.012970268,0.00031975383,0.00016251444,0.000015370031,0.00094250275,0.00083017873],"genre_scores_gemma":[0.73413837,0.000028095059,0.2653227,0.00023655969,0.000020488193,5.075306e-7,0.000006807114,0.000011443429,0.00023502603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886084,0.000058606183,0.000107808366,0.00042472512,0.0002660991,0.00028194897],"domain_scores_gemma":[0.9988299,0.000058990518,0.00014631968,0.00072420907,0.00012639476,0.00011420729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017659966,0.00015986316,0.00026611786,0.00080684276,0.00015897743,0.000025087915,0.0016435833,0.00017758053,0.000009519009],"category_scores_gemma":[0.000033090662,0.00016123979,0.000095560965,0.00090725697,0.00024645793,0.000137291,0.00048782854,0.00023931972,0.000020355936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043690338,0.001387744,0.024562793,0.00020870082,0.00046052705,0.0014119617,0.0051634763,0.31862473,0.001949027,0.21520942,0.058046654,0.37253806],"study_design_scores_gemma":[0.0016032263,0.00040398093,0.000896788,0.00006712884,0.000021711194,0.000016132675,0.00025681235,0.9493667,0.0017513568,0.026505286,0.01878251,0.00032837823],"about_ca_topic_score_codex":0.00021319817,"about_ca_topic_score_gemma":0.000015094062,"teacher_disagreement_score":0.63074195,"about_ca_system_score_codex":0.000027027249,"about_ca_system_score_gemma":0.00007030775,"threshold_uncertainty_score":0.6575168},"labels":[],"label_agreement":null},{"id":"W3104064455","doi":"","title":"Partially smoothed information measures","year":2021,"lang":"en","type":"article","venue":"UTS ePRESS (University of Technology Sydney)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Australian Research Council; Science and Engineering Research Board; National Research Foundation Singapore","keywords":"Smoothing; Information theory; Quantum information; Computer science; Mathematics; Quantum; Cryptography; Theoretical computer science; Quantum cryptography; Statistical physics; Algorithm; Quantum mechanics; Statistics; Physics","score_opus":0.0066953755625533155,"score_gpt":0.1814540553908721,"score_spread":0.17475867982831877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104064455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1581006,0.00016878212,0.8299619,0.009210524,0.00022194072,0.00007397031,0.0000058751466,0.00052882987,0.0017275695],"genre_scores_gemma":[0.8890043,0.00002863354,0.11067594,0.00012242865,0.000012043152,2.1598368e-7,0.0000041934713,0.0000036161582,0.00014864944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992598,0.00003608685,0.0001099061,0.0002149842,0.00018119026,0.00019801779],"domain_scores_gemma":[0.9990433,0.000027682518,0.000116810326,0.0005724969,0.00019261742,0.0000471223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104042294,0.00009627685,0.0001779304,0.00029242315,0.00017555877,0.000028565546,0.0009646506,0.00015905563,0.00001884152],"category_scores_gemma":[0.00006833513,0.00010783029,0.00007313708,0.00064558355,0.00014846495,0.0003938572,0.0006467439,0.00019651417,0.000028820676],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016835336,0.00013169597,0.0033610316,0.000053981756,0.00013784194,0.00019834765,0.0028382933,0.0037358804,0.004485411,0.15915084,0.0019564482,0.8239334],"study_design_scores_gemma":[0.0027837534,0.00030858698,0.019942703,0.0002484981,0.00008038753,0.0003188757,0.0019416575,0.52685666,0.06211582,0.05807662,0.32627434,0.0010520876],"about_ca_topic_score_codex":0.000045216217,"about_ca_topic_score_gemma":0.00003143158,"teacher_disagreement_score":0.8228813,"about_ca_system_score_codex":0.000015606442,"about_ca_system_score_gemma":0.00009225238,"threshold_uncertainty_score":0.43971914},"labels":[],"label_agreement":null},{"id":"W3104089163","doi":"10.4230/lipics.tqc.2013.270","title":"The Quantum Entropy Cone of Stabiliser States","year":2013,"lang":"en","type":"article","venue":"ASEP","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre for Quantum Technologies; Grantová Agentura České Republiky; National Science Foundation; National University of Singapore; National Research Foundation; European Commission; Banff International Research Station for Mathematical Innovation and Discovery; Leverhulme Trust","keywords":"Von Neumann entropy; Stabiliser; Subadditivity; Mathematics; Inequality; Quantum relative entropy; Entropy (arrow of time); Monotonic function; Pure mathematics; Quantum; Discrete mathematics; Mathematical analysis; Physics; Quantum mechanics; Quantum discord; Quantum entanglement","score_opus":0.005348292671427776,"score_gpt":0.20809512064734775,"score_spread":0.20274682797591997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104089163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91009665,0.0004258886,0.08436432,0.004271209,0.00040768675,0.00018217991,0.0000030166275,0.00009955572,0.00014951255],"genre_scores_gemma":[0.9922327,0.000022845214,0.007416694,0.00015529519,0.00004668394,0.00000791695,0.0000011639645,0.000005542764,0.00011119763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991835,0.000060752136,0.0001765226,0.0001682613,0.00018042409,0.00023058928],"domain_scores_gemma":[0.99897796,0.0003417146,0.00007979338,0.00045526915,0.00008930387,0.000055953384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017522767,0.00008273113,0.000102097714,0.000023075952,0.00013708012,0.000110377514,0.000627581,0.000019865498,0.000025820522],"category_scores_gemma":[0.000037363017,0.00004804602,0.000049324546,0.00015186761,0.00008352535,0.00010433991,0.0001875024,0.000097252625,0.00006968795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015864618,0.0003170194,0.0026533585,0.00006315557,0.00013796434,0.000018217532,0.0064569404,0.007932391,0.013016111,0.44196144,0.038735278,0.48869225],"study_design_scores_gemma":[0.00019660984,0.00012286076,0.0055688415,0.000013278418,0.000002370566,0.000005343371,0.00009897024,0.92682207,0.0037032992,0.05406386,0.009285302,0.000117225696],"about_ca_topic_score_codex":0.00014923487,"about_ca_topic_score_gemma":0.0000045623933,"teacher_disagreement_score":0.91888964,"about_ca_system_score_codex":0.00000614341,"about_ca_system_score_gemma":0.0000277943,"threshold_uncertainty_score":0.19592598},"labels":[],"label_agreement":null},{"id":"W3104119396","doi":"10.4086/toc.2005.v001a005","title":"","year":2005,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Mathematics; Quantum Fourier transform; Bounded function; Qubit; Logarithm; Constant (computer programming); Discrete mathematics; Quantum algorithm; Quantum; Polynomial; Quantum gate; Mathematical analysis; Computer science; Quantum mechanics; Physics","score_opus":0.009385687952812326,"score_gpt":0.2337069938772732,"score_spread":0.22432130592446087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104119396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4938823,0.00014683614,0.50445807,0.00077222363,0.0001360688,0.00008140418,3.5022546e-7,0.0003469806,0.00017577995],"genre_scores_gemma":[0.6826904,0.0000014748299,0.31651554,0.00046615378,0.00030245245,6.591369e-7,4.2530553e-7,0.000012516914,0.00001039075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682254,0.0005012828,0.00079420203,0.00064656377,0.0005053988,0.00072999747],"domain_scores_gemma":[0.99683005,0.0012948407,0.0004568062,0.0010776125,0.00015978048,0.00018091795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029942526,0.00031938558,0.0004970244,0.00026844686,0.00040478617,0.00012191932,0.0026497692,0.00007473755,0.0000028099357],"category_scores_gemma":[0.00014608786,0.00028894143,0.0002218209,0.00073531555,0.00019189733,0.0004724647,0.0012107481,0.00036749925,0.0000055716678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011911835,0.0000880843,0.00024365715,0.000016448032,0.000023946177,0.000004998654,0.007839154,0.18582164,0.002050123,0.26444933,0.000006075826,0.5394446],"study_design_scores_gemma":[0.0006606753,0.00016655456,0.0067933784,0.00011135672,0.000006709543,0.00011137002,0.000102534956,0.9140917,0.017536279,0.059925996,0.00015446267,0.0003389846],"about_ca_topic_score_codex":0.000007491425,"about_ca_topic_score_gemma":0.0000013421078,"teacher_disagreement_score":0.72827005,"about_ca_system_score_codex":0.000030838553,"about_ca_system_score_gemma":0.000068883455,"threshold_uncertainty_score":0.99995625},"labels":[],"label_agreement":null},{"id":"W3104428150","doi":"10.17169/refubium-28427","title":"Stochastic gradient descent for hybrid quantum-classical optimization","year":2020,"lang":"en","type":"article","venue":"Refubium (Universitätsbibliothek der Freien Universität Berlin)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":204,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Freie Universität Berlin; Deutsche Forschungsgemeinschaft; Alexander von Humboldt-Stiftung; John Templeton Foundation","keywords":"Stochastic gradient descent; Gradient descent; Stochastic optimization; Quantum circuit; Parameterized complexity; Quantum; Computer science; Mathematical optimization; Convergence (economics); Context (archaeology); Quantum machine learning; Hamiltonian (control theory); Mathematics; Quantum algorithm; Applied mathematics; Algorithm; Artificial intelligence; Quantum error correction; Artificial neural network; Quantum mechanics; Physics","score_opus":0.01765926947071176,"score_gpt":0.21237841917809056,"score_spread":0.1947191497073788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104428150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0108466875,0.00016258765,0.97640485,0.010423557,0.00049745204,0.00059835275,0.000056811154,0.00061241176,0.00039726848],"genre_scores_gemma":[0.791928,0.00004858351,0.20541407,0.0016000574,0.00041516818,0.000004412284,0.000093425275,0.00007669774,0.00041957604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700725,0.0001277619,0.00030221842,0.0011815679,0.00054945203,0.0008317288],"domain_scores_gemma":[0.9978349,0.00025232352,0.00025719876,0.00066910614,0.00029397206,0.0006924764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019460414,0.00045410532,0.00047729677,0.0013213321,0.00075298984,0.0003146285,0.0019998017,0.00014291641,0.000062124665],"category_scores_gemma":[0.00006076799,0.00048859656,0.00034092876,0.0032973296,0.00016357435,0.0026114087,0.00075123034,0.00040453498,0.00005670322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002231789,0.00026552068,0.000020438882,0.00010110779,0.00030740668,0.000282782,0.0029194998,0.8352098,0.00045434674,0.14177893,0.0075447666,0.010892267],"study_design_scores_gemma":[0.0018662805,0.0005178223,0.00003163918,0.000047952035,0.00011490902,0.00005510892,0.00031144926,0.9814355,0.00014867996,0.0011101313,0.013757082,0.00060344813],"about_ca_topic_score_codex":0.000018518029,"about_ca_topic_score_gemma":0.0000032303549,"teacher_disagreement_score":0.7810813,"about_ca_system_score_codex":0.00023871125,"about_ca_system_score_gemma":0.00024687135,"threshold_uncertainty_score":0.9997566},"labels":[],"label_agreement":null},{"id":"W3104437746","doi":"","title":"Minimal-memory, noncatastrophic, polynomial-depth quantum convolutional encoders","year":2013,"lang":"en","type":"article","venue":"Civil War Book Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Convolutional code; Quantum convolutional code; Encoder; Computer science; Algorithm; Quantum channel; Quantum; Quantum error correction; Turbo code; Theoretical computer science; Quantum algorithm; Quantum information; Linear code; Block code; Decoding methods; Physics; Quantum mechanics","score_opus":0.010214438926551477,"score_gpt":0.23125690927221623,"score_spread":0.22104247034566477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104437746","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017033813,0.8609436,0.10054868,0.026548622,0.0015908328,0.0017851923,0.000022803304,0.0007429816,0.006113878],"genre_scores_gemma":[0.14109424,0.36806226,0.23260278,0.23286174,0.0060376255,0.001392186,0.0002959859,0.0004966932,0.01715648],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975175,0.00017089062,0.0005566289,0.00070063345,0.00044533503,0.0006090127],"domain_scores_gemma":[0.99823815,0.00013910886,0.00023979272,0.00095359504,0.00014716384,0.00028218504],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003792793,0.0003456961,0.00053097686,0.000092489085,0.000240615,0.0001065768,0.0013669176,0.00007827659,0.0005393069],"category_scores_gemma":[0.00008581154,0.00028626213,0.00026940234,0.00033103256,0.00015513747,0.00043071897,0.00042663794,0.00035841303,0.0018450203],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015770208,0.00007920128,0.000030066038,0.0007442532,0.00003945703,0.000024518593,0.00014544178,0.00012195305,0.0001977172,0.0009750753,0.89200413,0.10563661],"study_design_scores_gemma":[0.000514555,0.00019256756,0.0014336555,0.0029457875,0.000040603612,0.0002472762,0.000008859112,0.16229203,0.000110728106,0.0007710885,0.8306682,0.0007746246],"about_ca_topic_score_codex":0.00005613815,"about_ca_topic_score_gemma":0.000004649098,"teacher_disagreement_score":0.49288136,"about_ca_system_score_codex":0.000058529073,"about_ca_system_score_gemma":0.0002227087,"threshold_uncertainty_score":0.99995893},"labels":[],"label_agreement":null},{"id":"W3104521383","doi":"","title":"The Minimum Size of Qubit Unextendible Product Bases","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Product (mathematics); Cardinality (data modeling); Combinatorics; Mathematics; Dimension (graph theory); Basis (linear algebra); Graph; Computer science; Data mining","score_opus":0.03307960407792535,"score_gpt":0.17995292016012757,"score_spread":0.14687331608220222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104521383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87839687,0.0005717261,0.11497954,0.0011811526,0.001821384,0.00065345934,0.00001706661,0.00034091694,0.0020378537],"genre_scores_gemma":[0.99229884,0.000156215,0.004548339,0.000060135935,0.00015546085,0.0000011790906,0.0000023628202,0.000016629461,0.0027608648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979769,0.00019087257,0.0002618363,0.0010051187,0.0001414437,0.00042384103],"domain_scores_gemma":[0.9967417,0.0006282266,0.00038649412,0.0018958333,0.00022446961,0.00012324817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034531587,0.00031415778,0.0003433033,0.000115771,0.0003106231,0.00017115512,0.0029786678,0.00012567599,0.000014136595],"category_scores_gemma":[0.00014058061,0.0002470012,0.00025134595,0.0005707859,0.00024368335,0.000119022065,0.0027958564,0.000585389,0.000040321287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004123185,0.00029286926,0.0011211907,0.00031023202,0.00030354914,0.00021254903,0.0007518155,0.76376206,0.00035936732,0.19714496,0.004211668,0.031488534],"study_design_scores_gemma":[0.00023091589,0.0000743601,0.0014371829,0.00012817577,0.000033635275,0.000008256785,0.000037749556,0.9417198,0.0006648774,0.052173022,0.0031152929,0.00037675528],"about_ca_topic_score_codex":0.00031625206,"about_ca_topic_score_gemma":0.000021625809,"teacher_disagreement_score":0.17795774,"about_ca_system_score_codex":0.00004918845,"about_ca_system_score_gemma":0.00024837523,"threshold_uncertainty_score":0.9999982},"labels":[],"label_agreement":null},{"id":"W3105007988","doi":"","title":"Classical communication over a quantum interference channel","year":2012,"lang":"en","type":"article","venue":"Civil War Book Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Classical capacity; Quantum capacity; Amplitude damping channel; Quantum channel; Computer science; Communication source; Channel (broadcasting); Topology (electrical circuits); Quantum; Quantum information; Channel capacity; Decoding methods; Unitary state; Mathematics; Quantum network; Telecommunications; Physics; Quantum mechanics; Combinatorics","score_opus":0.021879472059504988,"score_gpt":0.27355297987731114,"score_spread":0.2516735078178062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105007988","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029169413,0.8628676,0.12516098,0.0073715397,0.00046218603,0.00033829297,0.0000018565524,0.00027637603,0.0032294653],"genre_scores_gemma":[0.46482608,0.44173205,0.022838965,0.06623983,0.0010628868,0.00019436736,0.00003078315,0.000098459044,0.0029766008],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855477,0.0002330588,0.00031858325,0.0002736383,0.00021606087,0.0004039005],"domain_scores_gemma":[0.9983821,0.00013409367,0.0001469034,0.001105955,0.000050805756,0.00018016389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006203321,0.00018984682,0.00032052555,0.000044254095,0.00014776367,0.00004545952,0.0012150841,0.000053848227,0.00010098753],"category_scores_gemma":[0.000080084435,0.00014866194,0.0001379677,0.00023708359,0.00006705852,0.0003272782,0.0006462515,0.00033646802,0.0002759815],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003915952,0.00041721138,0.000114504415,0.0020746829,0.00005288984,0.00000807908,0.0019007346,0.000028902385,0.00006478772,0.07315568,0.660515,0.2616636],"study_design_scores_gemma":[0.00013503373,0.000058068155,0.0005331751,0.004488502,0.000021054495,0.000063845146,0.0000027287451,0.07815391,0.000038002676,0.0015997429,0.91457766,0.00032829525],"about_ca_topic_score_codex":0.000004805432,"about_ca_topic_score_gemma":0.0000021359451,"teacher_disagreement_score":0.46453437,"about_ca_system_score_codex":0.000033319167,"about_ca_system_score_gemma":0.000036731028,"threshold_uncertainty_score":0.6062258},"labels":[],"label_agreement":null},{"id":"W3105031876","doi":"","title":"Symmetries of Codeword Stabilized Quantum Codes ∗","year":2014,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Carleton University; University of Waterloo","funders":"","keywords":"Quantum convolutional code; Linear code; Discrete mathematics; Block code; Mathematics; Reed–Muller code; Permutation (music); Expander code; Toric code; Combinatorics; Quantum; Quantum computer; Quantum mechanics; Physics; Algorithm; Decoding methods","score_opus":0.008445467003048896,"score_gpt":0.22633104839821971,"score_spread":0.2178855813951708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105031876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1447773,0.000065058615,0.8510011,0.0013554422,0.000246142,0.000068005,0.0000014052312,0.00022022537,0.002265347],"genre_scores_gemma":[0.8742294,0.0000056472445,0.12530436,0.00032080428,0.000041577176,0.00000179946,9.643177e-7,0.0000059998615,0.00008948228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887496,0.000096459466,0.00024819226,0.00027294407,0.00024767112,0.0002597975],"domain_scores_gemma":[0.9987183,0.000439362,0.000094216004,0.0005296622,0.00014847737,0.0000699506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052428816,0.00011856651,0.00024568776,0.00011268123,0.000104449704,0.0000633,0.00072341756,0.00004074695,0.000013661971],"category_scores_gemma":[0.00024288836,0.000087715,0.00007641713,0.00044019351,0.00008239975,0.00009193564,0.0002849316,0.00010224258,0.000012768727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075289813,0.00008283313,0.00048440587,0.00004306453,0.00001931829,0.0000013262776,0.0009529196,0.0022020536,0.0009640209,0.90745527,0.0010269221,0.08676034],"study_design_scores_gemma":[0.0002733397,0.0001718986,0.00064683333,0.000019072051,0.0000027911115,0.0000058984733,0.000036820664,0.95848167,0.0062981327,0.026861405,0.00705912,0.00014303158],"about_ca_topic_score_codex":0.00010506165,"about_ca_topic_score_gemma":0.00001612803,"teacher_disagreement_score":0.9562796,"about_ca_system_score_codex":0.000007940785,"about_ca_system_score_gemma":0.000031075775,"threshold_uncertainty_score":0.35769138},"labels":[],"label_agreement":null},{"id":"W3105234417","doi":"","title":"Recursive quantum convolutional encoders are catastrophic: A simple proof","year":2013,"lang":"en","type":"article","venue":"Civil War Book Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum convolutional code; Convolutional code; Quantum algorithm; Qubit; Quantum error correction; Computer science; Quantum information; Discrete mathematics; Quantum capacity; Theoretical computer science; Turbo code; Algorithm; Mathematics; Quantum; Decoding methods; Quantum mechanics; Quantum network; Physics","score_opus":0.010612821167451566,"score_gpt":0.23367448647270278,"score_spread":0.2230616653052512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105234417","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069769105,0.7468041,0.22708502,0.021786323,0.00057996716,0.0018631014,0.000029188595,0.00038216618,0.00077244313],"genre_scores_gemma":[0.17738505,0.3282929,0.19049668,0.28868377,0.004339466,0.003212101,0.00056969054,0.0005248787,0.0064954455],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790764,0.00016893742,0.0004214716,0.000601431,0.00039376834,0.0005067817],"domain_scores_gemma":[0.99837136,0.00010914055,0.0002828393,0.00079315726,0.00022578907,0.00021771416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002927562,0.0002764025,0.00045626968,0.000067783454,0.00022430769,0.00007491496,0.0010260189,0.000060996495,0.0003240356],"category_scores_gemma":[0.00013291484,0.0002213509,0.00019722179,0.0003516807,0.00011045949,0.00035776294,0.0003394913,0.00032283025,0.00056401425],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014784438,0.00011317793,0.00009290108,0.0016367624,0.000055259537,0.000041342784,0.00023136527,0.00035792423,0.000028402043,0.007774336,0.91924053,0.07042652],"study_design_scores_gemma":[0.00033346814,0.00018056387,0.000795509,0.004799296,0.000035977817,0.00014506595,0.000016704373,0.1227104,0.0000656614,0.018248918,0.8520031,0.0006653504],"about_ca_topic_score_codex":0.000034883007,"about_ca_topic_score_gemma":0.0000072261273,"teacher_disagreement_score":0.41851118,"about_ca_system_score_codex":0.000056265664,"about_ca_system_score_gemma":0.00015895952,"threshold_uncertainty_score":0.9026428},"labels":[],"label_agreement":null},{"id":"W3105716828","doi":"","title":"The quantum locker puzzle","year":2009,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cheating; Quantum; Mathematical economics; Coin flipping; Computer science; Mathematics; Physics; Quantum mechanics; Psychology; Statistics; Social psychology","score_opus":0.010400317161176908,"score_gpt":0.24051067291660075,"score_spread":0.23011035575542385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105716828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035505993,0.0013689736,0.9606805,0.02173527,0.0028577745,0.00027630845,0.0000019738293,0.000816806,0.008711806],"genre_scores_gemma":[0.5484317,0.0005454986,0.43498692,0.0049236557,0.0026048995,0.000056295332,0.00001642004,0.00008030327,0.008354312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979994,0.00011925558,0.00030840738,0.0006882147,0.00040289492,0.00048177963],"domain_scores_gemma":[0.9976756,0.00019657993,0.00015237775,0.0017820009,0.00008411303,0.000109317174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005338833,0.0003020905,0.00023903989,0.00006480383,0.000571184,0.0009823439,0.003374582,0.00017995047,0.00000569441],"category_scores_gemma":[0.000038623348,0.00017417107,0.00020623078,0.00018681792,0.00006324818,0.000050801053,0.0027571293,0.0009772176,0.00009212867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002767452,0.00005677812,0.000011021277,0.000020149011,0.000041270163,0.000037679943,0.00033159315,0.016109694,0.000009412926,0.37227598,0.02925076,0.5818529],"study_design_scores_gemma":[0.00005648011,0.000028151178,0.00033121055,0.000036537534,0.000003129443,0.000018205572,0.0000039542506,0.75992286,0.00006085188,0.18032327,0.058977548,0.00023778986],"about_ca_topic_score_codex":0.00004829857,"about_ca_topic_score_gemma":0.000016197448,"teacher_disagreement_score":0.74381316,"about_ca_system_score_codex":0.00002901123,"about_ca_system_score_gemma":0.00013396329,"threshold_uncertainty_score":0.9472765},"labels":[],"label_agreement":null},{"id":"W3105735460","doi":"10.22331/q-2022-07-14-766","title":"Quantum XYZ Product Codes","year":2022,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"QuantERA; Agence Nationale de la Recherche","keywords":"Hypergraph; Product (mathematics); Block code; Expander code; Mathematics; Code (set theory); Linear code; Discrete mathematics; Computer science; Algorithm; Decoding methods; Set (abstract data type)","score_opus":0.013265001696447495,"score_gpt":0.2366214633604379,"score_spread":0.22335646166399042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105735460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71603066,0.0023923924,0.25107825,0.015266204,0.0078247795,0.00077998475,0.000048250702,0.002498485,0.0040810253],"genre_scores_gemma":[0.99027276,0.000013964905,0.008038481,0.000774749,0.00028884344,0.000049596598,0.000009310883,0.00002729943,0.0005249831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975226,0.00024699038,0.0003017022,0.00074788486,0.00061550864,0.00056531164],"domain_scores_gemma":[0.9985774,0.00011909848,0.00013489852,0.0009901652,0.0000511098,0.00012731977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006521009,0.00022956655,0.00025737993,0.00017730084,0.00089512655,0.00016511565,0.0017087618,0.000024595649,0.00009299335],"category_scores_gemma":[0.000052686846,0.00021375075,0.00012855502,0.0008037865,0.00005959658,0.00016760097,0.0012154074,0.0005294549,0.000083467006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003526408,0.0004954776,0.0005318525,0.000048923932,0.00006560785,0.00029389744,0.00271919,0.025701229,0.0019213845,0.78182274,0.019483043,0.1668814],"study_design_scores_gemma":[0.00024484267,0.0003788259,0.0008724682,0.000008479709,0.0000049439923,0.00020578779,0.00006496121,0.8539316,0.00035974753,0.028301768,0.115268104,0.00035847983],"about_ca_topic_score_codex":0.000058601785,"about_ca_topic_score_gemma":0.000002295319,"teacher_disagreement_score":0.8282304,"about_ca_system_score_codex":0.00005879884,"about_ca_system_score_gemma":0.00013486732,"threshold_uncertainty_score":0.8716503},"labels":[],"label_agreement":null},{"id":"W3105847235","doi":"10.4230/lipics.tqc.2013.157","title":"Towards Efficient Decoding of Classical-Quantum Polar Codes","year":2013,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; McGill University","funders":"","keywords":"Decoding methods; Quantum; Computer science; Algorithm; Mathematics; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.010599403116544951,"score_gpt":0.23325226414103026,"score_spread":0.2226528610244853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105847235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33795774,0.00006105934,0.65693986,0.0023797802,0.00025338604,0.000103468126,0.0000010999365,0.00017019839,0.0021334048],"genre_scores_gemma":[0.8558989,0.0000022178413,0.14372139,0.00019232571,0.000049407605,0.0000035203373,4.9935613e-7,0.000006475702,0.00012526668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987627,0.000051051757,0.00026470542,0.0003086896,0.00029321885,0.00031963398],"domain_scores_gemma":[0.9991377,0.0001158749,0.00008519286,0.0004405465,0.000101757105,0.00011895674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021129377,0.00013537596,0.00020587814,0.00010591971,0.00010093549,0.00011973367,0.00076756923,0.000049603306,0.000058224887],"category_scores_gemma":[0.000046429854,0.00009733375,0.00009635158,0.00033394623,0.00006525659,0.00009341691,0.0003755038,0.00014223973,0.00007970905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031238105,0.0003398875,0.00057284406,0.00006454181,0.000050611085,0.000012572532,0.0014263701,0.01941686,0.0150192715,0.4684954,0.0058233943,0.48877513],"study_design_scores_gemma":[0.00012878522,0.000075622665,0.0032433502,0.000024529438,0.000002124894,0.000011637932,0.000018868612,0.9835842,0.006138888,0.005874334,0.00076003326,0.00013761436],"about_ca_topic_score_codex":0.0001728119,"about_ca_topic_score_gemma":0.000001754095,"teacher_disagreement_score":0.96416736,"about_ca_system_score_codex":0.00001553012,"about_ca_system_score_gemma":0.00005250871,"threshold_uncertainty_score":0.39691553},"labels":[],"label_agreement":null},{"id":"W3106006271","doi":"","title":"Nonlocal quantum information in bipartite quantum error correction","year":2010,"lang":"en","type":"article","venue":"Civil War Book Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum computer; Quantum error correction; Quantum information; Qubit; Quantum algorithm; Computer science; Controlled NOT gate; Quantum capacity; Theoretical computer science; Quantum gate; Quantum; Algorithm; Quantum network; Quantum mechanics; Physics","score_opus":0.008872160502894614,"score_gpt":0.24836447207489762,"score_spread":0.239492311572003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106006271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022817524,0.19787267,0.73647213,0.015786868,0.01899155,0.002548421,0.000010995527,0.0015144922,0.0039853295],"genre_scores_gemma":[0.6509683,0.18020307,0.042174052,0.120872155,0.0029638456,0.00070057064,0.00022277907,0.00023938096,0.0016558302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983076,0.000112067304,0.0005792606,0.00031561538,0.00030723977,0.0003782103],"domain_scores_gemma":[0.998814,0.00009050312,0.00021714719,0.00065864867,0.00009160651,0.00012809342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007777026,0.00021983436,0.0003533296,0.00016662097,0.00012909953,0.000086236054,0.0006708931,0.00009621902,0.00009305839],"category_scores_gemma":[0.00019625567,0.00018526697,0.0001287839,0.0006136203,0.00005461421,0.0009298664,0.00014937235,0.0006505365,0.0004593339],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008056793,0.00016959698,0.00022898686,0.0020448042,0.00001826577,0.000031155974,0.0011555934,0.0007215112,0.0004571829,0.009031526,0.16817155,0.81796175],"study_design_scores_gemma":[0.00012998912,0.000047594745,0.00030201767,0.0010479047,0.0000054614193,0.00006670587,0.0000037991624,0.59265167,0.000131306,0.0002505689,0.40517375,0.00018924264],"about_ca_topic_score_codex":0.000037377537,"about_ca_topic_score_gemma":0.00009387862,"teacher_disagreement_score":0.8177725,"about_ca_system_score_codex":0.000029849372,"about_ca_system_score_gemma":0.00011575327,"threshold_uncertainty_score":0.75549674},"labels":[],"label_agreement":null},{"id":"W3106015846","doi":"10.1007/s10589-016-9844-y","title":"Building an iterative heuristic solver for a quantum annealer","year":2016,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Mitacs","keywords":"Quadratic unconstrained binary optimization; Solver; Quantum annealing; Heuristic; Quantum; Quadratic equation; Tabu search; Optimization problem; Quantum computer","score_opus":0.013357220778580144,"score_gpt":0.27697900528041125,"score_spread":0.2636217845018311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106015846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011238676,0.00004831346,0.9959854,0.0021321487,0.000058957066,0.00040454904,0.000032570442,0.00017390345,0.000040314113],"genre_scores_gemma":[0.23872852,0.00000625503,0.76049876,0.00037906095,0.0001327519,0.00016941654,0.00003210111,0.000011305617,0.000041811632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904513,0.000035109784,0.00021073953,0.00041419922,0.00012943416,0.00016538479],"domain_scores_gemma":[0.99898547,0.00036085994,0.00009975904,0.000194365,0.00024459662,0.00011496905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012496335,0.00012494202,0.000111274196,0.000103549384,0.00038413136,0.00016533342,0.0002555379,0.000039480805,0.000005881625],"category_scores_gemma":[0.000021275517,0.00009479954,0.000036668545,0.00023235651,0.00006273309,0.0003266815,0.0000721818,0.000041426727,0.0000042378156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023421303,0.000041703937,0.000014966401,0.000005426281,0.000006815571,1.739937e-7,0.00008657094,0.576525,0.00006430232,0.37721732,0.000112653186,0.045922752],"study_design_scores_gemma":[0.00038311086,0.000056424946,0.00021379231,0.000015818528,0.000004480259,0.000010590982,0.0000042554348,0.91196257,0.000023912253,0.08408295,0.0030977735,0.00014432597],"about_ca_topic_score_codex":9.345927e-7,"about_ca_topic_score_gemma":2.502413e-7,"teacher_disagreement_score":0.33543757,"about_ca_system_score_codex":0.000018824792,"about_ca_system_score_gemma":0.000052074713,"threshold_uncertainty_score":0.38658133},"labels":[],"label_agreement":null},{"id":"W3106210707","doi":"","title":"Polar codes for degradable quantum channels","year":2013,"lang":"en","type":"article","venue":"Civil War Book Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum capacity; Amplitude damping channel; Quantum channel; Classical capacity; Computer science; Topology (electrical circuits); Quantum; Binary erasure channel; Quantum network; Quantum information science; Quantum information; Quantum entanglement; Physics; Channel (broadcasting); Quantum mechanics; Mathematics; Channel capacity; Computer network","score_opus":0.014764105154741393,"score_gpt":0.2478316072510938,"score_spread":0.2330675020963524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106210707","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014016431,0.6580531,0.33119395,0.008059023,0.00057875516,0.0011955849,0.0000061339197,0.00028607732,0.00048718316],"genre_scores_gemma":[0.018587297,0.4506264,0.33561063,0.16971491,0.0029825317,0.0023764034,0.00009976485,0.00033294424,0.019669095],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983842,0.00008488592,0.00035093247,0.00047370562,0.00021343624,0.0004928846],"domain_scores_gemma":[0.99868214,0.00016378929,0.00013998452,0.00071204745,0.00013901314,0.0001630267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044019317,0.00023515944,0.00045882267,0.00005620989,0.00022483834,0.00011854901,0.0009926059,0.000052896958,0.000118819895],"category_scores_gemma":[0.000096063726,0.00017708434,0.0002240283,0.0002567628,0.00004018384,0.000333246,0.00021295597,0.00015542937,0.000333856],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.662447e-7,0.00007395993,0.000011236691,0.002891815,0.000042195483,0.0000062006757,0.00016785269,0.00009170889,0.00009873723,0.012009418,0.7826006,0.20200545],"study_design_scores_gemma":[0.00014191202,0.00010102028,0.000023169114,0.0021013736,0.000016522241,0.000033833938,0.0000016830255,0.15665464,0.00014857479,0.006963946,0.83352864,0.0002846784],"about_ca_topic_score_codex":0.000035021872,"about_ca_topic_score_gemma":0.0000020727923,"teacher_disagreement_score":0.20742671,"about_ca_system_score_codex":0.000021153523,"about_ca_system_score_gemma":0.00006660406,"threshold_uncertainty_score":0.722129},"labels":[],"label_agreement":null},{"id":"W3106278932","doi":"10.1145/3055399.3055468","title":"A quantum linearity test for robustly verifying entanglement","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Air Force Office of Scientific Research; Institute for Quantum Information and Matter, California Institute of Technology; California Institute of Technology; Institut Périmètre de physique théorique; Gordon and Betty Moore Foundation; National Science Foundation","keywords":"Quantum entanglement; Robustness (evolution); Soundness; Tensor product; Linearity; Discrete mathematics; Mathematics; Quantum computer; Qubit; Quantum; Computer science; Quantum mechanics; Pure mathematics; Physics","score_opus":0.042924586323073055,"score_gpt":0.30064706240746336,"score_spread":0.2577224760843903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106278932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012476599,0.0002492559,0.97822666,0.0033260775,0.0036572092,0.00080009084,0.00005724964,0.0005496032,0.00065726665],"genre_scores_gemma":[0.39996374,0.000026947351,0.5978134,0.0003952986,0.0010948601,0.0001242844,0.00003316275,0.000039896822,0.00050835445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975012,0.000041266685,0.00041183655,0.0011054773,0.0003718929,0.00056831114],"domain_scores_gemma":[0.9968858,0.00033646668,0.00039655532,0.0020433946,0.00017704154,0.00016074178],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00065281347,0.000417206,0.00046926664,0.00009183343,0.0006151323,0.0012374667,0.0031840988,0.00025602177,0.000009118715],"category_scores_gemma":[0.00027981753,0.00036067463,0.00034237118,0.00006177734,0.000056180546,0.00011391603,0.004265198,0.0007472585,0.000016662232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004757579,0.0017991031,0.0061749546,0.0027939908,0.000574951,0.0002205824,0.0035946078,0.11293127,0.0006591315,0.15205535,0.031782802,0.6873657],"study_design_scores_gemma":[0.00034595988,0.00014072948,0.0010761872,0.00020700933,0.000017093274,0.000011609248,0.0000059680456,0.9662686,0.00033029524,0.021821009,0.009298446,0.0004770643],"about_ca_topic_score_codex":0.00023521604,"about_ca_topic_score_gemma":0.000026005302,"teacher_disagreement_score":0.85333735,"about_ca_system_score_codex":0.00008644786,"about_ca_system_score_gemma":0.0003234822,"threshold_uncertainty_score":0.99988455},"labels":[],"label_agreement":null},{"id":"W3106453919","doi":"","title":"Sequential decoding of a general classical-quantum channel","year":2013,"lang":"en","type":"article","venue":"Civil War Book Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Communication source; Computer science; Algorithm; Quantum; Quantum capacity; Sequence (biology); Quantum channel; Mathematics; Theoretical computer science; Quantum entanglement; Telecommunications; Quantum mechanics; Quantum network; Physics","score_opus":0.017197870108443616,"score_gpt":0.2549170821621154,"score_spread":0.23771921205367177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106453919","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036903988,0.65113395,0.32543522,0.01182125,0.0012851576,0.001282953,0.000005406842,0.00042347366,0.0049221897],"genre_scores_gemma":[0.163362,0.4732123,0.24152336,0.1002487,0.0045146244,0.0006809415,0.00005132098,0.0003402095,0.016066555],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983581,0.00012877831,0.00045930783,0.00040474415,0.0002796359,0.00036944784],"domain_scores_gemma":[0.99884415,0.00006535148,0.00020815547,0.00062794547,0.000107982756,0.00014641974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003132901,0.00020229815,0.00046151388,0.000064580694,0.00009953201,0.00004736286,0.0008620372,0.000053391515,0.0002073958],"category_scores_gemma":[0.00005564081,0.00015773316,0.00023023377,0.00026934533,0.0000659747,0.0001964684,0.00038379928,0.0002020466,0.00019486058],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016997485,0.00018001816,0.000015637517,0.004306964,0.000090367015,0.00004273981,0.00045046027,0.00046886737,0.0021019706,0.022931762,0.567842,0.4015675],"study_design_scores_gemma":[0.00026339915,0.0001310177,0.00010680867,0.004445081,0.00003478935,0.0000966421,0.0000017013591,0.70350474,0.00086271146,0.005712326,0.28438884,0.0004519531],"about_ca_topic_score_codex":0.000019578563,"about_ca_topic_score_gemma":0.0000013585726,"teacher_disagreement_score":0.70303583,"about_ca_system_score_codex":0.000021347925,"about_ca_system_score_gemma":0.00006907466,"threshold_uncertainty_score":0.64321715},"labels":[],"label_agreement":null},{"id":"W3106467701","doi":"10.1103/physrevlett.125.210501","title":"Optimal Universal Programming of Unitary Gates","year":2020,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Air Force Office of Scientific Research; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Croucher Foundation; National Natural Science Foundation of China; Foundational Questions Institute","keywords":"Unitary state; Quantum circuit; Quantum; Computer science; Quantum information; Quantum gate; Quantum Fourier transform; Quantum computer; Limit (mathematics); Quantum error correction; Discrete mathematics; Quantum mechanics; Physics; Mathematics","score_opus":0.014185402426283956,"score_gpt":0.2516760210829402,"score_spread":0.23749061865665622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106467701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.604223,0.0047740284,0.2808682,0.10921794,0.00011176003,0.0004178295,0.0000030835586,0.00030874793,0.0000753986],"genre_scores_gemma":[0.8760326,0.00029721303,0.09666531,0.026703393,0.00027743826,0.0000050151816,0.000003851862,0.000014087614,0.0000010873304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914426,0.000066675675,0.00014843218,0.00025204252,0.00019814457,0.00019042926],"domain_scores_gemma":[0.9994883,0.00008679493,0.00008165115,0.00020915968,0.000025560892,0.00010855481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007042381,0.000117840806,0.00026870015,0.000016856871,0.00003780353,0.000019910289,0.0005996859,0.0000046670216,0.000002245072],"category_scores_gemma":[0.00003185662,0.00009496242,0.00014161336,0.00043107598,0.000058037924,0.00011153242,0.00022384227,0.00016380308,0.000016413873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019219035,0.00045168996,0.00025679974,0.006294911,0.00022014228,0.00026491645,0.0070171608,0.06610547,0.032835256,0.02036172,0.009334424,0.8568383],"study_design_scores_gemma":[0.00019767068,0.00021975521,0.00017231226,0.00095557474,0.00003577311,0.000007570187,0.000010432586,0.970906,0.0009767166,0.000090584115,0.026142081,0.00028552415],"about_ca_topic_score_codex":0.0000053209824,"about_ca_topic_score_gemma":3.218346e-8,"teacher_disagreement_score":0.90480053,"about_ca_system_score_codex":0.000006754838,"about_ca_system_score_gemma":0.000016092947,"threshold_uncertainty_score":0.3872455},"labels":[],"label_agreement":null},{"id":"W3106718099","doi":"10.1088/2632-2153/abf3ac","title":"Natural evolutionary strategies for variational quantum computation","year":2021,"lang":"en","type":"article","venue":"Machine Learning Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Canadian Institute for Advanced Research; University of Toronto","funders":"Office of Naval Research; Office of Science; Canada Research Chairs; Google","keywords":"Gradient descent; Evolutionary computation; Evolutionary algorithm; Quantum; Optimization problem; Computer science; Estimator; Mathematical optimization; Electronic circuit; Quantum circuit; Quantum computer; Applied mathematics; Mathematics; Algorithm; Artificial intelligence; Artificial neural network; Physics; Quantum mechanics; Quantum network; Statistics","score_opus":0.006219557225293274,"score_gpt":0.24822755891903733,"score_spread":0.24200800169374406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106718099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1383002,0.0008285907,0.8491349,0.010714768,0.00040016358,0.00008740578,0.0000018889124,0.0004258546,0.00010622532],"genre_scores_gemma":[0.82652134,0.0000041804024,0.17327052,0.00011511926,0.000029126333,0.000006519893,0.0000069805155,0.0000037554762,0.00004244394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987945,0.000031259457,0.00013656939,0.00047827445,0.000270925,0.00028846157],"domain_scores_gemma":[0.99915504,0.000131033,0.00007323606,0.00015169255,0.00045035532,0.000038640093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041725134,0.000101271915,0.00011650993,0.00032033643,0.0008469903,0.00025008092,0.00041833438,0.000057672525,0.0000015739024],"category_scores_gemma":[0.00038651505,0.00009140981,0.00002220998,0.0015107116,0.00032535984,0.00034881712,0.00034178348,0.00030892802,0.0000024530004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001815963,0.000029996161,0.0011908202,0.000013066421,0.0000074913187,0.000011739789,0.00023446768,0.012063605,0.009359854,0.8998032,0.000050400886,0.077233516],"study_design_scores_gemma":[0.00017475686,0.000086026506,0.003001656,0.0000085252395,0.0000019576264,0.00012655536,0.00007854425,0.85536647,0.00026893753,0.13932315,0.0014604708,0.00010297596],"about_ca_topic_score_codex":0.000010768885,"about_ca_topic_score_gemma":0.000003494786,"teacher_disagreement_score":0.84330285,"about_ca_system_score_codex":0.000029518125,"about_ca_system_score_gemma":0.0004974796,"threshold_uncertainty_score":0.65144503},"labels":[],"label_agreement":null},{"id":"W3106830139","doi":"10.1038/s41598-021-98297-x","title":"Hybrid quantum investment optimization with minimal holding period","year":2021,"lang":"en","type":"preprint","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Social Innovation","funders":"Eusko Jaurlaritza","keywords":"Computer science; Quantum; Portfolio optimization; Constraint (computer-aided design); Efficient frontier; Mathematical optimization; Portfolio; Investment (military); Period (music); Simple (philosophy); Finance; Mathematics; Economics","score_opus":0.012610913979294345,"score_gpt":0.22643254663644963,"score_spread":0.21382163265715529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106830139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4027231,0.0004747621,0.5809282,0.0005262064,0.014203244,0.00040470372,0.0000025654601,0.00037490847,0.00036228492],"genre_scores_gemma":[0.60557675,0.0000054660413,0.39337942,0.00013880692,0.00022482015,0.000045137604,0.00018879492,0.000040628,0.00040017226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944902,0.00014199186,0.0007596904,0.0027366162,0.00125397,0.000617551],"domain_scores_gemma":[0.99543244,0.000032227174,0.0008416548,0.002943557,0.00048072063,0.00026941742],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013874305,0.00047710113,0.0005049258,0.00037025835,0.0006876148,0.004906173,0.0009917831,0.00013597093,0.000027763384],"category_scores_gemma":[0.00010928938,0.0004014708,0.00021502124,0.0006212001,0.00026332992,0.00034394147,0.0025003317,0.00066444476,0.0000039888255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002983379,0.00012650147,0.0001744232,0.00011984781,0.000059727983,0.0058215894,0.0018456589,0.9859479,0.0003624064,0.00043460715,0.0018089851,0.0032953636],"study_design_scores_gemma":[0.000103056474,0.000060273127,0.00012660371,0.00047862867,0.000025144924,0.002641867,0.000053272615,0.98747456,0.0024094142,0.003965706,0.0020748414,0.00058660615],"about_ca_topic_score_codex":0.000029515111,"about_ca_topic_score_gemma":0.0000036023707,"teacher_disagreement_score":0.20285366,"about_ca_system_score_codex":0.00012149432,"about_ca_system_score_gemma":0.0012835312,"threshold_uncertainty_score":0.9998437},"labels":[],"label_agreement":null},{"id":"W3107968153","doi":"10.22331/q-2021-03-29-422","title":"Dimensional Expressivity Analysis of Parametric Quantum Circuits","year":2021,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Research and Innovation Foundation; Industry Canada; Government of Canada","keywords":"Quantum circuit; Quantum; Electronic circuit; Parametric statistics; Ansatz; Homogeneous space; Quantum algorithm; Topology (electrical circuits)","score_opus":0.016369472942122237,"score_gpt":0.25227964446896634,"score_spread":0.2359101715268441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107968153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77266425,0.0006337774,0.22553827,0.00031656542,0.0005017541,0.000051851886,0.00001619276,0.000122889,0.00015446698],"genre_scores_gemma":[0.9919595,0.000010279021,0.007701971,0.00018264439,0.000054092023,0.0000037102811,0.000016627691,0.00001087267,0.000060316688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758685,0.00022371409,0.0004522907,0.0006853158,0.00063604466,0.0004157704],"domain_scores_gemma":[0.99769497,0.0005881833,0.00024242573,0.0010520748,0.000264395,0.000157973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040333686,0.00021158594,0.00056469627,0.00062982953,0.00016000953,0.0000976244,0.0007639032,0.0000936099,0.000050306466],"category_scores_gemma":[0.00026964955,0.00019098113,0.00039482542,0.0055029374,0.00007723304,0.00016059227,0.0004663153,0.0002536809,0.000019004068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018937391,0.002142549,0.024535665,0.00018127408,0.0035211835,0.0010392334,0.0021456482,0.26041234,0.047474645,0.53708214,0.002909575,0.11853683],"study_design_scores_gemma":[0.00018774721,0.0000595574,0.048521318,0.000027847298,0.00013310087,0.000025069861,0.0000131619545,0.9394164,0.0030807457,0.007978208,0.00032279638,0.00023406293],"about_ca_topic_score_codex":0.00004140696,"about_ca_topic_score_gemma":0.000004745062,"teacher_disagreement_score":0.679004,"about_ca_system_score_codex":0.000023664077,"about_ca_system_score_gemma":0.00015309504,"threshold_uncertainty_score":0.7787984},"labels":[],"label_agreement":null},{"id":"W3108171681","doi":"10.1109/qce49297.2020.00046","title":"Educational Resources for Promoting Talent in Quantum Computing","year":2020,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Novelty; Workforce; Quantum computer; Computer science; Relevance (law); Quantum; Data science; Knowledge management; Political science; Economic growth; Physics; Psychology; Economics","score_opus":0.01611420401055132,"score_gpt":0.2575067469171236,"score_spread":0.24139254290657228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108171681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5108277,0.00006710859,0.4558899,0.032435954,0.00017311833,0.0002165994,0.0000010621546,0.00014379805,0.00024476583],"genre_scores_gemma":[0.8729124,4.022922e-7,0.12553024,0.001198068,0.00032323954,0.0000056523277,0.0000015320505,0.000007444686,0.000021016127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889123,0.000038214483,0.00024557958,0.00039543927,0.0001540917,0.00027541534],"domain_scores_gemma":[0.99937534,0.0002711671,0.00007272194,0.00014276951,0.00003823571,0.00009977605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002484587,0.0001082131,0.00013323456,0.000060017133,0.0001265955,0.00012721363,0.00057158776,0.000028373213,0.000004986973],"category_scores_gemma":[0.00012932606,0.000094291936,0.000055493616,0.0003363572,0.000018312496,0.00009146889,0.00024190891,0.00013148779,0.000010947282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035437697,0.00060155534,0.0139256315,0.000569063,0.00005341619,0.000025724989,0.10570047,0.108833365,0.004009398,0.26549947,0.0059033977,0.49484304],"study_design_scores_gemma":[0.00022979912,0.0000881108,0.0033612114,0.000035873487,7.8067893e-7,0.000006207269,0.000054301596,0.9900495,0.00016987605,0.003473614,0.0024015126,0.00012922242],"about_ca_topic_score_codex":0.000014172606,"about_ca_topic_score_gemma":0.0000026000223,"teacher_disagreement_score":0.8812161,"about_ca_system_score_codex":0.000015383996,"about_ca_system_score_gemma":0.000058837006,"threshold_uncertainty_score":0.38451135},"labels":[],"label_agreement":null},{"id":"W3108564656","doi":"10.1109/qce49297.2020.00047","title":"Quantum Computing for High-School Students An Experience Report","year":2020,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Quantum computer; Quantum; Mathematics education; Multimedia; Psychology; Physics; Quantum mechanics","score_opus":0.025040285092312185,"score_gpt":0.304586522501602,"score_spread":0.2795462374092898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108564656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44293925,0.000010086753,0.554872,0.0012255386,0.00033282684,0.00017375922,8.401639e-7,0.00039287825,0.000052832096],"genre_scores_gemma":[0.7674885,5.1457033e-7,0.22994761,0.0020948178,0.00038798677,0.000008648162,0.000004564117,0.000013123711,0.000054252912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784976,0.000049353443,0.000405258,0.00082682475,0.00045607844,0.00041274866],"domain_scores_gemma":[0.99865025,0.00009731021,0.00014928913,0.00058651785,0.00010265913,0.00041398752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030178958,0.00019958816,0.00024254259,0.00004308572,0.0002911872,0.00041608323,0.0018065097,0.0000511018,0.00001281406],"category_scores_gemma":[0.00015696,0.00016915449,0.000077454955,0.00032952873,0.000033422588,0.00032800497,0.0006315409,0.00016794405,0.000021083717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018625526,0.0019516563,0.10233973,0.00037770913,0.00033385263,0.0031710125,0.07279054,0.07821472,0.01813504,0.39408687,0.017424485,0.31098813],"study_design_scores_gemma":[0.00042651166,0.00036646918,0.008886787,0.000014802516,0.000003265971,0.000084713676,0.00013028529,0.9855491,0.0011457818,0.0017054484,0.001388761,0.0002980855],"about_ca_topic_score_codex":0.000044463897,"about_ca_topic_score_gemma":0.0000013688898,"teacher_disagreement_score":0.9073344,"about_ca_system_score_codex":0.000017250413,"about_ca_system_score_gemma":0.00006396456,"threshold_uncertainty_score":0.689792},"labels":[],"label_agreement":null},{"id":"W3108643865","doi":"10.26421/qic20.13-14-4","title":"Analysis of lackadaisical quantum walks","year":2020,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum walk; Mathematics; Vertex (graph theory); Random walk; Torus; Discrete mathematics; Quantum; Regular graph; Combinatorics; Quantum algorithm; Quadratic growth; Graph; Line graph; Quantum mechanics; Voltage graph; Physics; Mathematical analysis; Statistics","score_opus":0.013670073262340852,"score_gpt":0.24632133007508691,"score_spread":0.23265125681274607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108643865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27404252,0.000029261506,0.7236672,0.0018372085,0.00007869892,0.00007169282,0.0000058341816,0.0001247378,0.00014280256],"genre_scores_gemma":[0.9898315,0.000009262933,0.008945186,0.001137741,0.000025313244,0.0000019311547,0.00004524625,0.0000029821779,8.160145e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884135,0.000054543118,0.0004829171,0.00017070418,0.00030176883,0.00014872706],"domain_scores_gemma":[0.999246,0.00010510052,0.00025935448,0.00013621633,0.0001270495,0.00012627384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018165093,0.00012289073,0.0002630182,0.00029492722,0.00010014301,0.00014828904,0.00025362012,0.00005280233,0.0000055951987],"category_scores_gemma":[0.000053070788,0.00011057682,0.00009988243,0.0013653392,0.000041126626,0.00074846495,0.00012977395,0.00012150862,0.000017323635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034915618,0.00005410082,0.0011835084,0.000121956655,0.0003217325,0.000002726068,0.016838387,0.2846505,0.00012892784,0.30582672,0.00052078255,0.39031574],"study_design_scores_gemma":[0.00025420426,0.00014224519,0.01149173,0.000007438004,0.000050136874,0.0000029306973,0.00012797072,0.9851554,0.000047354784,0.001733127,0.0008592817,0.00012816691],"about_ca_topic_score_codex":0.000018295594,"about_ca_topic_score_gemma":7.036067e-7,"teacher_disagreement_score":0.715789,"about_ca_system_score_codex":0.000008551925,"about_ca_system_score_gemma":0.000038183272,"threshold_uncertainty_score":0.45091918},"labels":[],"label_agreement":null},{"id":"W3109258702","doi":"","title":"Scaling up Simhash","year":2020,"lang":"en","type":"article","venue":"Asian Conference on Machine Learning","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Scaling; Computer science; Mathematics; Geometry","score_opus":0.025365176558408746,"score_gpt":0.2523355812988393,"score_spread":0.22697040474043056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109258702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0361581,0.00009645266,0.8860505,0.051377624,0.00051530823,0.00017675015,0.0000027001722,0.0013370684,0.024285458],"genre_scores_gemma":[0.9813383,0.000006575407,0.016205622,0.0019880258,0.00021065855,0.000002424593,0.0000053234917,0.000019046152,0.00022402618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983038,0.0001737049,0.00022053538,0.00059519743,0.0003180351,0.00038874912],"domain_scores_gemma":[0.99918026,0.000105017265,0.00011494433,0.00029664594,0.00005215958,0.0002509566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019229694,0.00022928686,0.00023411356,0.000074934935,0.00031862772,0.00035634782,0.0009437639,0.000063604864,0.000079457015],"category_scores_gemma":[0.00023504703,0.00020419277,0.000087696266,0.00038486416,0.000036419046,0.00014213145,0.00032749784,0.00094897277,0.00028109664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001013407,0.000018189032,0.000673386,0.000017583896,0.000015280144,0.00005272736,0.003847993,0.015837528,0.0004133406,0.044249695,0.00011855726,0.9347456],"study_design_scores_gemma":[0.00029288314,0.00021179212,0.000746392,0.00004835226,0.0000030017084,0.000012090206,0.00007096229,0.9881257,0.00020209148,0.0010594164,0.008971668,0.0002556805],"about_ca_topic_score_codex":0.000017878829,"about_ca_topic_score_gemma":0.0000014159825,"teacher_disagreement_score":0.97228813,"about_ca_system_score_codex":0.000012320782,"about_ca_system_score_gemma":0.00006897982,"threshold_uncertainty_score":0.8326739},"labels":[],"label_agreement":null},{"id":"W3109310169","doi":"10.36227/techrxiv.19742422.v1","title":"Reducing the CNOT count for Clifford+T circuits on NISQ architectures","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Dalhousie University; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Controlled NOT gate; Computer science; Qubit; Quantum computer; Quantum circuit; Quantum gate; Topology (electrical circuits); Quantum error correction; Mathematics; Quantum; Physics; Quantum mechanics","score_opus":0.02561943034344787,"score_gpt":0.2750424976970341,"score_spread":0.24942306735358621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109310169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08338784,0.00046409247,0.8820809,0.01628493,0.0071295123,0.002192505,0.00011203873,0.0010483784,0.007299805],"genre_scores_gemma":[0.8974626,0.00003102322,0.08937615,0.00787582,0.0022847077,0.0007845992,0.00007094238,0.00012380906,0.0019903479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965818,0.00021060226,0.00046931056,0.0013407108,0.0007368692,0.0006607178],"domain_scores_gemma":[0.9961851,0.0011772184,0.00031204565,0.0021295627,0.00008192853,0.00011409284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010731107,0.00049842516,0.00043896938,0.0002109794,0.0010358853,0.00061052054,0.0040402305,0.00016016737,0.000054992674],"category_scores_gemma":[0.0001427984,0.00032274862,0.00043750438,0.0002686531,0.00008386122,0.000023385264,0.0033534828,0.001785629,0.000008613969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094253,0.00007983444,0.000007049934,0.00010058254,0.000078699966,0.000011213543,0.002098162,0.6005717,0.00003152917,0.03176643,0.0059127044,0.35933268],"study_design_scores_gemma":[0.00027187465,0.0003159333,0.0003803569,0.000121343706,0.000019672607,0.00004068936,0.000043303142,0.8746764,0.00027822753,0.092693694,0.030561939,0.0005965894],"about_ca_topic_score_codex":0.00017081517,"about_ca_topic_score_gemma":0.000013623241,"teacher_disagreement_score":0.81407475,"about_ca_system_score_codex":0.00012249856,"about_ca_system_score_gemma":0.00033595497,"threshold_uncertainty_score":0.99992245},"labels":[],"label_agreement":null},{"id":"W3109744881","doi":"10.1109/qce49297.2020.00057","title":"In Situ Noise Characterization of the D-Wave Quantum Annealer","year":2020,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Qubit; Flux qubit; Physics; Quantum annealing; Superposition principle; Coherence (philosophical gambling strategy); Quantum mechanics; Quantum computer; Noise (video); Quantum; Quantum noise; Hamiltonian (control theory); Quantum error correction; Statistical physics; Computer science; Mathematics","score_opus":0.01573011264531773,"score_gpt":0.21082827798557688,"score_spread":0.19509816534025914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109744881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8018987,0.0000059335784,0.18165202,0.015701037,0.00021604105,0.000091387294,0.0000011812349,0.000045289256,0.00038838922],"genre_scores_gemma":[0.9946743,0.0000015321488,0.0027759636,0.0024314763,0.00006584868,0.0000010542866,7.0754163e-7,0.0000036534063,0.000045458182],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993522,0.00004762503,0.00016061492,0.0001826323,0.00013782988,0.000119055585],"domain_scores_gemma":[0.99962425,0.000023481763,0.00006571002,0.00022332274,0.000024588906,0.00003866951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007369429,0.000067994406,0.00009737815,0.000027169886,0.00003255798,0.000027236369,0.0004110912,0.000025640988,0.000009378212],"category_scores_gemma":[0.00002080664,0.00004317284,0.000041261846,0.0004659394,0.000021101429,0.000120526005,0.00024322633,0.00010394786,0.0000061504297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012337541,0.00012696843,0.001801252,0.00006270125,0.000012137943,0.000023623441,0.010094538,0.0030862798,0.8984289,0.05420012,0.00057171826,0.031579383],"study_design_scores_gemma":[0.00013479171,0.00003549022,0.042910963,0.000013876087,8.017891e-7,0.0000036862505,0.000006572046,0.92676693,0.028634258,0.00059124565,0.0008296731,0.000071701026],"about_ca_topic_score_codex":0.000009279942,"about_ca_topic_score_gemma":0.0000021560086,"teacher_disagreement_score":0.92368066,"about_ca_system_score_codex":0.0000048104034,"about_ca_system_score_gemma":0.000026852167,"threshold_uncertainty_score":0.17605373},"labels":[],"label_agreement":null},{"id":"W3110207320","doi":"10.1109/tqe.2021.3050449","title":"Benchmarking Hamiltonian Noise in the D-Wave Quantum Annealer","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Quantum Engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamiltonian (control theory); Qubit; Quantum annealing; Quantum noise; Flux qubit; Degenerate energy levels; Quantum; Gaussian noise","score_opus":0.013720938137127716,"score_gpt":0.21180110817339454,"score_spread":0.19808017003626682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110207320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1292319,0.00016054834,0.86751,0.0011045265,0.0015674046,0.00012261089,0.0000055576,0.00022733519,0.000070113514],"genre_scores_gemma":[0.98459023,0.000030673425,0.014764473,0.00039808374,0.00013534722,0.000028402288,0.0000016304967,0.000026948212,0.000024195635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980703,0.000107003514,0.00034454954,0.000538764,0.00039453583,0.0005448375],"domain_scores_gemma":[0.9987293,0.00035752027,0.000048928694,0.0007149869,0.00005176525,0.00009752161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039548083,0.00028475103,0.00024197515,0.0002696758,0.00024344056,0.00023616421,0.0005892123,0.00009807699,0.000015945026],"category_scores_gemma":[0.0000125863335,0.0002406459,0.00017307584,0.0011678744,0.00002586747,0.00021893436,0.00000854542,0.0007801282,0.000016590555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039467527,0.00015695534,0.000006608636,0.000034292218,0.00002485126,0.00038204412,0.0017841891,0.96213156,0.0032722468,0.004874603,0.000055368375,0.027273348],"study_design_scores_gemma":[0.00027823105,0.000077054094,0.0011875442,0.00012954751,0.000007915739,0.00024389006,0.00006144888,0.9926646,0.0035259684,0.00027513833,0.0012465921,0.0003021116],"about_ca_topic_score_codex":0.000033717086,"about_ca_topic_score_gemma":0.000027743183,"teacher_disagreement_score":0.85535836,"about_ca_system_score_codex":0.000060522874,"about_ca_system_score_gemma":0.000080002595,"threshold_uncertainty_score":0.98132545},"labels":[],"label_agreement":null},{"id":"W3110599976","doi":"","title":"Quantum Programming with Inductive Datatypes","year":2020,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Computer science; Programming language; Quantum; Physics; Quantum mechanics","score_opus":0.016614418508840424,"score_gpt":0.22969170766922534,"score_spread":0.2130772891603849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110599976","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032193955,0.00041917965,0.941014,0.021593098,0.00026888133,0.00047910717,0.000025600953,0.00077765214,0.0032285512],"genre_scores_gemma":[0.4269688,0.00004835023,0.5721854,0.00015384892,0.000056043315,0.000047877904,0.00015110275,0.000045266086,0.0003433062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944522,0.002685368,0.00041912516,0.0013896602,0.00057738635,0.00047625706],"domain_scores_gemma":[0.99461484,0.0007885256,0.00052538485,0.0026110269,0.0011911453,0.00026907647],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022060582,0.00044512312,0.00044808898,0.00016937348,0.00041607747,0.001093502,0.0033345856,0.00020986566,0.00001014164],"category_scores_gemma":[0.0005477202,0.0003955586,0.0001505759,0.00068730616,0.00023641085,0.00022843339,0.004177161,0.0012728041,0.000030347868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018036582,0.00058308005,0.00062383385,0.00031236254,0.00024306952,0.00008063341,0.030883841,0.0010660117,0.00053744303,0.37723693,0.00080864155,0.5876061],"study_design_scores_gemma":[0.00067785283,0.0000036118165,0.001994538,0.0028054658,0.00005560668,0.00006117459,0.00015210695,0.92572755,0.009081378,0.02835669,0.029885918,0.0011981123],"about_ca_topic_score_codex":0.00066312857,"about_ca_topic_score_gemma":0.0002374723,"teacher_disagreement_score":0.9246615,"about_ca_system_score_codex":0.00006321432,"about_ca_system_score_gemma":0.0004768749,"threshold_uncertainty_score":0.99994344},"labels":[],"label_agreement":null},{"id":"W3111936173","doi":"10.1038/s41598-021-82303-3","title":"Correlation minor norms, entanglement detection and discord","year":2021,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"PAZY Foundation; Foundational Questions Institute; Institut Périmètre de physique théorique; University of Ottawa; Fetzer Institute; Yükseköğretim Kurulu; Israel Innovation Authority; Silicon Valley Community Foundation","keywords":"Quantum entanglement; Correlation; Minor (academic); Quantum discord; Quantum; Entropy (arrow of time); Norm (philosophy); Separable space","score_opus":0.007286595619599722,"score_gpt":0.2171095175500545,"score_spread":0.2098229219304548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111936173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5705421,0.00023330515,0.41961607,0.00034697997,0.008721867,0.0000963303,4.0800984e-7,0.000105474435,0.00033748648],"genre_scores_gemma":[0.9842632,0.0000022604138,0.014265769,0.000041259536,0.00007271135,0.0000046729356,0.000009050064,0.0000048264405,0.0013362927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845904,0.000040221606,0.00025811646,0.0006974635,0.00034307927,0.00020210093],"domain_scores_gemma":[0.9990425,0.000025534102,0.00013968558,0.0006049067,0.00009935592,0.000087991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005004306,0.00009421535,0.00009426555,0.0000856382,0.00040808538,0.00063491875,0.00011183119,0.000029596817,0.000013144808],"category_scores_gemma":[0.00005390143,0.00008181628,0.00004334137,0.00047900097,0.000062863,0.0002254254,0.00024908138,0.00009267966,0.0000072384837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031697555,0.0001593775,0.009743663,0.000045218072,0.000027902091,0.0018659345,0.0021756745,0.0037832842,0.05808806,0.001707048,0.0021148382,0.9202858],"study_design_scores_gemma":[0.00023015917,0.000076879354,0.018951546,0.00006657512,0.000016326121,0.0036493514,0.00010097438,0.8189459,0.06455411,0.032868423,0.060115024,0.00042476974],"about_ca_topic_score_codex":0.000012403216,"about_ca_topic_score_gemma":0.00004049477,"teacher_disagreement_score":0.9198611,"about_ca_system_score_codex":0.00002608461,"about_ca_system_score_gemma":0.000075434415,"threshold_uncertainty_score":0.6122536},"labels":[],"label_agreement":null},{"id":"W3112220912","doi":"10.22331/q-2022-05-24-721","title":"Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code","year":2022,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Australian Research Council; Ministry of Colleges and Universities; University College London; Government of Canada; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Compute Canada","keywords":"Decoding methods; Lattice (music); Code (set theory); Dimension (graph theory); Algorithm; Set (abstract data type); Computer science; Surface (topology); Bounded function; Mathematics; Geometry; Combinatorics; Mathematical analysis; Physics; Acoustics","score_opus":0.027208110034329807,"score_gpt":0.2989181311256012,"score_spread":0.2717100210912714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112220912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95228285,0.0001393405,0.04429896,0.002717808,0.00027315484,0.0001858624,0.000014286639,0.000043968834,0.000043749664],"genre_scores_gemma":[0.9717511,0.0000011531549,0.027770853,0.00041413854,0.00002745095,0.000009153146,0.0000046136474,0.000009860731,0.000011713639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829906,0.00015181482,0.000376423,0.00035085407,0.0005041651,0.00031769753],"domain_scores_gemma":[0.999,0.00046283865,0.00016811334,0.00031552542,0.000026035808,0.000027476779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007377737,0.00012858068,0.00019911936,0.00006606643,0.00022339838,0.000049934693,0.0008807984,0.00002338239,0.000053766213],"category_scores_gemma":[0.0000167657,0.0001029851,0.00005772666,0.00075540674,0.000037531277,0.0001707681,0.0005402234,0.00032586436,0.000006618103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003929482,0.00045827052,0.017602747,0.00003436394,0.00003213656,0.000048075377,0.011897534,0.8813362,0.0040606265,0.07591033,0.0004122983,0.008168124],"study_design_scores_gemma":[0.00050662033,0.000110765206,0.017166618,0.000016355636,0.0000033551312,0.000028360615,0.0002503367,0.9772284,0.0003676621,0.0036324672,0.0005545973,0.00013443272],"about_ca_topic_score_codex":0.0015228868,"about_ca_topic_score_gemma":0.00016441208,"teacher_disagreement_score":0.095892236,"about_ca_system_score_codex":0.000070993265,"about_ca_system_score_gemma":0.00012789777,"threshold_uncertainty_score":0.41996104},"labels":[],"label_agreement":null},{"id":"W3112788325","doi":"10.48550/arxiv.2012.09540","title":"A note on diagonal gates in SZX-calculus","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Diagonal; Calculus (dental); Mathematics; Algebra over a field; Computer science; Pure mathematics; Geometry; Medicine","score_opus":0.04605353563939374,"score_gpt":0.19279763940456288,"score_spread":0.14674410376516914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112788325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42062226,0.00004931692,0.57427573,0.0019939349,0.00084253197,0.00026916116,0.000016238062,0.00039647543,0.0015343556],"genre_scores_gemma":[0.9959991,0.000031497537,0.0031653268,0.00047747465,0.00015839607,6.4578063e-7,0.000008548156,0.000017749919,0.00014126734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776065,0.00015364411,0.00019821603,0.0013415072,0.00012761612,0.00041835598],"domain_scores_gemma":[0.99854964,0.00021250923,0.00015398783,0.00083236553,0.000046765803,0.00020470825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016659092,0.0003533124,0.00037375465,0.00027439828,0.000103934224,0.00012802234,0.0019554486,0.00023268281,0.000010756955],"category_scores_gemma":[0.00005367243,0.00037730476,0.00022002171,0.0007317393,0.00007530699,0.000100680816,0.0024390798,0.0012095072,0.00013770127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030825173,0.000114701856,0.00053307926,0.000052840056,0.000029172616,0.0016548028,0.0005889213,0.8795567,0.000026951298,0.111446634,0.00018162047,0.0057837404],"study_design_scores_gemma":[0.0003877132,0.00009094326,0.0025344105,0.00015282507,0.000009986392,0.0000046804703,0.000008802395,0.9516222,0.000088463865,0.04409338,0.0006063227,0.00040030526],"about_ca_topic_score_codex":0.00012480805,"about_ca_topic_score_gemma":0.00003116355,"teacher_disagreement_score":0.5753768,"about_ca_system_score_codex":0.00014059836,"about_ca_system_score_gemma":0.00019415386,"threshold_uncertainty_score":0.9998679},"labels":[],"label_agreement":null},{"id":"W3113247661","doi":"10.1145/3414622.3431913","title":"Building a quantum computer (invited)","year":2020,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum computer; Computer science; Quantum; Computational science; Physics; Quantum mechanics","score_opus":0.015801779596109688,"score_gpt":0.23193422717463535,"score_spread":0.21613244757852568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113247661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026125137,0.000037480793,0.93729657,0.03518125,0.0003039876,0.000068200716,5.349568e-7,0.0007537096,0.00023315521],"genre_scores_gemma":[0.32280996,0.0000012452335,0.6588814,0.017835582,0.0004501584,0.0000014293561,4.3552018e-7,0.000009592941,0.000010145222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987932,0.000042918327,0.0001812947,0.00045971439,0.00021812665,0.00030478847],"domain_scores_gemma":[0.9993309,0.00007572151,0.000046273384,0.00029830664,0.000033104552,0.00021568712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102187085,0.00014767646,0.00016020166,0.000050257404,0.00011955627,0.00021400349,0.00094226236,0.000039575374,0.000012469966],"category_scores_gemma":[0.000016453487,0.0001193769,0.00008371574,0.00047447177,0.000023484301,0.00016325772,0.0005610069,0.00019526259,0.00008639373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060302527,0.00006566389,0.0001823128,0.00003926226,0.00004038289,0.00014131375,0.0020492787,0.027660778,0.0031813933,0.42676562,0.041813463,0.4980545],"study_design_scores_gemma":[0.00016338573,0.00011891181,0.00025427534,0.0000097680395,0.0000014445731,0.00002224211,0.0000027388296,0.9665672,0.00056828663,0.003235966,0.028878672,0.00017709043],"about_ca_topic_score_codex":0.000008998212,"about_ca_topic_score_gemma":2.3707813e-7,"teacher_disagreement_score":0.93890643,"about_ca_system_score_codex":0.000007822328,"about_ca_system_score_gemma":0.00001771927,"threshold_uncertainty_score":0.48680487},"labels":[],"label_agreement":null},{"id":"W3113312744","doi":"10.36227/techrxiv.13377674.v1","title":"Quantum Computing and the AEC Industry: Trends, Challenges, Near Term Practical Opportunities and Future Outlook","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"George Brown College","funders":"","keywords":"Extant taxon; Underpinning; Quantum computer; Computer science; Quantum; Telecommunications; Engineering; Physics","score_opus":0.07156996168176198,"score_gpt":0.29692886008836417,"score_spread":0.22535889840660217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113312744","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018021068,0.014472768,0.04616503,0.9094243,0.0026961952,0.0006332582,0.000026270549,0.0011011679,0.007459926],"genre_scores_gemma":[0.68768674,0.0179711,0.2723158,0.009859723,0.01089121,0.000052575175,0.00006131518,0.00020153617,0.0009599685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687964,0.0004782406,0.00047830874,0.0012104632,0.0004625408,0.00049080024],"domain_scores_gemma":[0.9977556,0.00056272687,0.0003504633,0.0009077524,0.00007334201,0.00035010494],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00087226054,0.0005672244,0.00072926015,0.000117322714,0.00052328105,0.0013782948,0.0009997732,0.0006585515,0.0000135187],"category_scores_gemma":[0.00006433515,0.00036499067,0.00013589946,0.0001518466,0.00055625674,0.00015137816,0.0056199376,0.0034672006,0.0000024443498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023631892,0.000038392805,0.000027637743,0.00017767971,0.00012851016,0.00018056571,0.008932423,0.00012242119,5.999405e-7,0.34148034,0.0019988478,0.646889],"study_design_scores_gemma":[0.0008276777,0.000105101535,0.0018595752,0.00014446015,0.000051286966,0.00048126033,0.0011171561,0.93292665,0.0000020377463,0.011016594,0.050899222,0.00056895573],"about_ca_topic_score_codex":0.00006814652,"about_ca_topic_score_gemma":0.000007620932,"teacher_disagreement_score":0.9328042,"about_ca_system_score_codex":0.00001867677,"about_ca_system_score_gemma":0.00028440088,"threshold_uncertainty_score":0.9998802},"labels":[],"label_agreement":null},{"id":"W3115084667","doi":"10.1142/s021974992150043x","title":"Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits","year":2022,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum walk; Quantum circuit; Quantum computer; Qubit; Computer science; Quantum algorithm; Quantum gate; Quantum error correction; Adder; Quantum network; Quantum; Random walk; Physics; Quantum mechanics; Statistical physics; Topology (electrical circuits); Mathematics; Telecommunications","score_opus":0.03868888175281759,"score_gpt":0.2708130052793682,"score_spread":0.2321241235265506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115084667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21516405,0.00006410598,0.7747512,0.0039677625,0.0053918352,0.00036249385,0.00006670349,0.000110412184,0.00012147535],"genre_scores_gemma":[0.99222964,0.000007819727,0.0051990603,0.0019572568,0.00046942217,0.000039802744,0.00006578601,0.000021621936,0.000009614205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960091,0.00024655147,0.0014142733,0.00025009876,0.00165272,0.00042725916],"domain_scores_gemma":[0.9963017,0.0008280356,0.0013421298,0.00032845518,0.0010398754,0.00015976859],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021544546,0.00029867966,0.00040382353,0.0010119677,0.0005864438,0.0005037281,0.0020848273,0.00007927994,0.00005153499],"category_scores_gemma":[0.0005716219,0.00027308744,0.0004221407,0.00040504686,0.00004818561,0.0019539534,0.00022212614,0.0006722331,0.000019089124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013560227,0.0004882224,0.000122025034,0.000078969635,0.00035073434,0.00008887285,0.006452789,0.62006897,0.0023973638,0.2635451,0.0046304762,0.100420445],"study_design_scores_gemma":[0.004497869,0.0011826564,0.0001983742,0.00011468254,0.00001935761,0.00036687203,0.0004429148,0.96401685,0.001125308,0.013814537,0.013892288,0.00032829918],"about_ca_topic_score_codex":0.00002962634,"about_ca_topic_score_gemma":0.0000010422775,"teacher_disagreement_score":0.7770656,"about_ca_system_score_codex":0.00033703222,"about_ca_system_score_gemma":0.00050988566,"threshold_uncertainty_score":0.9999721},"labels":[],"label_agreement":null},{"id":"W3116995319","doi":"10.1140/epjqt/s40507-021-00100-3","title":"Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles","year":2020,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"Defense Advanced Research Projects Agency","keywords":"Electric field; Field (mathematics); Quantum; Computer science; Engineering physics; Engineering; Physics; Mathematics; Quantum mechanics","score_opus":0.16368109182836243,"score_gpt":0.22245508322659285,"score_spread":0.05877399139823042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116995319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5792874,0.000011556662,0.42016637,0.00017710788,0.00001958526,0.00031126518,9.901552e-7,0.000018470624,0.0000072610937],"genre_scores_gemma":[0.99799407,0.0000024375208,0.0018982891,0.00006382663,0.00003243221,0.0000013057913,7.2670474e-7,0.000005210272,0.0000016769701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903345,0.00019297833,0.00020946939,0.00032593438,0.00007252562,0.0001656396],"domain_scores_gemma":[0.9990488,0.00046032836,0.00017945991,0.00022987551,0.00004475575,0.00003675745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000445512,0.00010282943,0.00018763231,0.000137213,0.00009737654,0.00002831366,0.0005460686,0.000052931835,7.2087664e-7],"category_scores_gemma":[0.00011758927,0.00008844625,0.000069528294,0.0011684081,0.000019755746,0.00013605785,0.00012386129,0.00018060846,1.7671405e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045354092,0.00016258255,0.00560228,0.0000453056,0.000023897364,0.00012153951,0.00652338,0.9785681,0.000051121744,0.0062072854,0.000019510739,0.0026296952],"study_design_scores_gemma":[0.0008444444,0.0006449944,0.0001046463,0.000018660487,0.000018825362,0.000011770698,0.0019666676,0.9955169,0.00022800562,0.00054291665,0.0000068338068,0.000095335825],"about_ca_topic_score_codex":0.00020931946,"about_ca_topic_score_gemma":0.000018515499,"teacher_disagreement_score":0.41870672,"about_ca_system_score_codex":0.000012108894,"about_ca_system_score_gemma":0.000053912925,"threshold_uncertainty_score":0.36067334},"labels":[],"label_agreement":null},{"id":"W3117337916","doi":"10.48550/arxiv.1910.03551","title":"Quantum encryption with certified deletion","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Plaintext; Ciphertext; Computer science; Encryption; Theoretical computer science; Qubit; Key (lock); Ciphertext indistinguishability; String (physics); Quantum; Algorithm; Computer security; Physics; Quantum mechanics; Malleability","score_opus":0.013383264591479996,"score_gpt":0.23587631870421338,"score_spread":0.2224930541127334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117337916","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20042765,0.000097414035,0.79355395,0.002001211,0.0016109098,0.0006330651,0.000013486804,0.00051511044,0.0011471972],"genre_scores_gemma":[0.43504807,0.000042277617,0.56413513,0.0003042311,0.00026288425,0.00007861982,0.00007900943,0.000045157918,0.0000046215528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582434,0.0005028839,0.0005870657,0.001784359,0.00048544843,0.00081591343],"domain_scores_gemma":[0.99664783,0.00041485004,0.0005555184,0.0020217902,0.00016180456,0.00019820817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042170868,0.0006670438,0.0007908172,0.00044611655,0.00023087864,0.0002261072,0.0021261405,0.00044448333,0.000026517115],"category_scores_gemma":[0.00006085239,0.0005572928,0.0002736496,0.00024395701,0.00028081055,0.00012495047,0.003270471,0.0020923817,0.00038461087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009813563,0.00014017701,0.0013020205,0.00014034186,0.00018177279,0.00013229136,0.0028657771,0.109906286,0.00078750384,0.8606899,0.0004099335,0.023345904],"study_design_scores_gemma":[0.00041186908,0.00021990812,0.006572138,0.00020091498,0.000025226433,0.00016682367,0.000025880774,0.51865625,0.00031255092,0.47197282,0.000873182,0.0005624277],"about_ca_topic_score_codex":0.00007672027,"about_ca_topic_score_gemma":0.000038895454,"teacher_disagreement_score":0.40874997,"about_ca_system_score_codex":0.00009110928,"about_ca_system_score_gemma":0.00040316876,"threshold_uncertainty_score":0.99968785},"labels":[],"label_agreement":null},{"id":"W3118428100","doi":"10.1109/tqe.2021.3140152","title":"A Low-Complexity Quantum Principal Component Analysis Algorithm","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Quantum Engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Principal component analysis; Superposition principle; Algorithm; Computer science; Quantum computer; Dimension (graph theory); Quantum; Quantum algorithm; Quantum superposition; Key (lock); Computational complexity theory; State (computer science); Matrix (chemical analysis); Quantum state; Mathematics; Physics; Artificial intelligence; Quantum mechanics","score_opus":0.014076955789968435,"score_gpt":0.2228729151554189,"score_spread":0.20879595936545048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118428100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097526655,0.00005557322,0.89917356,0.00029744327,0.0017639885,0.00021089822,0.00007460328,0.0008843695,0.00001288772],"genre_scores_gemma":[0.9499769,0.000007950117,0.049608074,0.00014480145,0.00007522866,0.00010165834,0.000009068295,0.000040255574,0.000036029887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703586,0.0001369587,0.0004993863,0.0008140084,0.0008125579,0.0007012283],"domain_scores_gemma":[0.9985091,0.00018959244,0.0001186099,0.0008849611,0.000051570805,0.0002461663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046005988,0.0004054824,0.00048941415,0.0009916315,0.00086749584,0.00015655914,0.0012105433,0.000061551684,0.00008570689],"category_scores_gemma":[0.0000040977484,0.00043716546,0.00051361555,0.00263196,0.000046493726,0.0001868865,0.000040213836,0.0010271524,0.00002601677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000817823,0.00032213208,0.0000019129664,0.000019852634,0.00025658088,0.000060400314,0.0004151468,0.9758332,0.0008046062,0.003457046,0.00002089211,0.018800054],"study_design_scores_gemma":[0.00038445942,0.00022574633,0.00023505783,0.000014176191,0.00009529438,0.00007363467,0.000031803836,0.9949563,0.002055951,0.00030206525,0.0011170796,0.00050838833],"about_ca_topic_score_codex":0.00010704783,"about_ca_topic_score_gemma":0.0000067112223,"teacher_disagreement_score":0.85245025,"about_ca_system_score_codex":0.00022800945,"about_ca_system_score_gemma":0.00007001837,"threshold_uncertainty_score":0.999808},"labels":[],"label_agreement":null},{"id":"W3118723405","doi":"10.11575/cdm.v15i1.62606","title":"Pell Coding and Pell Decoding Methods with Some Applications","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Coding (social sciences); Coding theory; Mathematics; Combinatorics; Algorithm; Arithmetic; Computer science; Discrete mathematics; Statistics","score_opus":0.011925442076098415,"score_gpt":0.3222616855712542,"score_spread":0.31033624349515576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118723405","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046327566,0.00011595792,0.9918056,0.0019199795,0.000073155315,0.00045310892,0.000030183915,0.00022125877,0.00074797595],"genre_scores_gemma":[0.13296682,0.000007807644,0.8663838,0.0002209393,0.00021585288,0.000049043912,0.000003962992,0.000015097819,0.00013665414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871075,0.00006538902,0.00027099007,0.0003940952,0.00017308025,0.00038572316],"domain_scores_gemma":[0.99841917,0.00038970468,0.00011489216,0.00062223984,0.00023423399,0.00021979067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005809476,0.00019050529,0.00025208216,0.0001361844,0.0006021138,0.00030379798,0.0005334638,0.00005298094,0.0000064685796],"category_scores_gemma":[0.00015834639,0.00014762623,0.00004725902,0.00052684953,0.00014396859,0.00018284225,0.00039336816,0.0001530723,0.000061235725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003438419,0.00006471499,0.00002254682,0.000056432134,0.000050908726,0.0000034905618,0.0026340524,0.00022099752,0.0021749162,0.9571927,0.0003130714,0.03726271],"study_design_scores_gemma":[0.00036422248,0.00020273663,0.00010303432,0.00013417382,0.000043591164,0.00010383611,0.00012687297,0.89923555,0.0047764294,0.08531166,0.009206235,0.00039163243],"about_ca_topic_score_codex":0.0000034194838,"about_ca_topic_score_gemma":0.000003032849,"teacher_disagreement_score":0.8990146,"about_ca_system_score_codex":0.000044905082,"about_ca_system_score_gemma":0.00005786517,"threshold_uncertainty_score":0.60200226},"labels":[],"label_agreement":null},{"id":"W3119276036","doi":"10.1038/s41534-022-00624-1","title":"A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits","year":2022,"lang":"lv","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Algorithm; Computer science","score_opus":0.011841363675615512,"score_gpt":0.22745128418651778,"score_spread":0.21560992051090228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119276036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028699555,0.00030586455,0.962526,0.0014085781,0.003921236,0.0014254345,0.00051761087,0.0005663918,0.00062933506],"genre_scores_gemma":[0.90011454,0.000042557196,0.0929652,0.0027242785,0.0021112447,0.00056740415,0.00070447795,0.00014219045,0.000628087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951141,0.00033958,0.001391524,0.00068702875,0.0012098323,0.0012579409],"domain_scores_gemma":[0.99683565,0.00072099577,0.0009871051,0.00087656185,0.00027561598,0.00030406725],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018686812,0.00062784913,0.0006753883,0.00064736255,0.002407364,0.0010467548,0.0017778988,0.0001942155,0.00014110442],"category_scores_gemma":[0.00026155938,0.00069574296,0.0004365203,0.0009580463,0.00011443793,0.0018316722,0.0011007098,0.00092262065,0.0004797476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063136074,0.00031086494,0.000006436617,0.0001563915,0.00009666922,0.000023911294,0.0074505024,0.050624534,0.00007615035,0.0018603225,0.010698653,0.92863244],"study_design_scores_gemma":[0.0012101292,0.0016893776,0.00011160516,0.000086106214,0.00006276781,0.00048333989,0.00031986734,0.91465175,0.00008704193,0.0003675569,0.08014403,0.00078643556],"about_ca_topic_score_codex":0.00006403288,"about_ca_topic_score_gemma":9.711091e-7,"teacher_disagreement_score":0.927846,"about_ca_system_score_codex":0.00042850574,"about_ca_system_score_gemma":0.0006643399,"threshold_uncertainty_score":0.9999902},"labels":[],"label_agreement":null},{"id":"W3120068356","doi":"10.22331/q-2022-01-18-622","title":"Simulating Effective QED on Quantum Computers","year":2022,"lang":"en","type":"preprint","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"U.S. Department of Energy; Laboratory Directed Research and Development; Pacific Northwest National Laboratory; Basic Energy Sciences; Office of Science; National Science Foundation","keywords":"Physics; Wave function; Scaling; Lattice (music); Momentum (technical analysis); Speedup; Quantum mechanics; Quantum simulator; Electron; Exponential function; Quantum computer; Basis (linear algebra); Quantum; Statistical physics; Mathematical physics; Mathematics; Computer science; Mathematical analysis","score_opus":0.014552332812286505,"score_gpt":0.26961319506156356,"score_spread":0.25506086224927704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120068356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3731909,0.00047344025,0.60261875,0.0022880929,0.0155499745,0.0018362448,0.00007130838,0.002288215,0.0016830551],"genre_scores_gemma":[0.9726899,0.000013179919,0.02477482,0.0012667696,0.0008126225,0.00015591817,0.00007148632,0.00010842444,0.000106830215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99418443,0.00083591236,0.0007329456,0.002122247,0.0011377928,0.0009866775],"domain_scores_gemma":[0.9949795,0.0016977632,0.0006430691,0.0022954973,0.000113450486,0.0002707206],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010161517,0.0008908542,0.00096061523,0.00053773785,0.00081446936,0.000597964,0.0035832406,0.00032046207,0.000047271566],"category_scores_gemma":[0.00017868537,0.0008595944,0.0005799841,0.00065310684,0.00010238219,0.00012422762,0.006592722,0.0032161507,0.000095954376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037429767,0.00028562357,0.000111437774,0.00021640758,0.0001736805,0.00031700014,0.00235991,0.82614493,0.000056119232,0.07226018,0.0024506117,0.09558665],"study_design_scores_gemma":[0.0005032303,0.00065907364,0.0013413605,0.00034780183,0.000020333202,0.000023296141,0.000036628746,0.9574569,0.00006462705,0.0333803,0.005220759,0.00094569684],"about_ca_topic_score_codex":0.00014972236,"about_ca_topic_score_gemma":0.0000019960296,"teacher_disagreement_score":0.59949905,"about_ca_system_score_codex":0.00031020519,"about_ca_system_score_gemma":0.00023897426,"threshold_uncertainty_score":0.9993855},"labels":[],"label_agreement":null},{"id":"W3121312972","doi":"","title":"How Powerful is Adiabatic Quantum Computation","year":2001,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":205,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Adiabatic process; Adiabatic quantum computation; Quantum computer; Computation; Quantum; Computer science; Statistical physics; Physics; Algorithm; Quantum mechanics","score_opus":0.01646873801004822,"score_gpt":0.2506172998443119,"score_spread":0.2341485618342637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121312972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025336057,0.00036232706,0.95232224,0.016083136,0.0023263241,0.00033168177,0.000008861226,0.00079015706,0.002439227],"genre_scores_gemma":[0.6895085,0.000062346626,0.30390632,0.0024159886,0.0006756259,0.000013834687,0.00004414661,0.00005584877,0.003317399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726254,0.0001234411,0.00035504377,0.0011486275,0.000571006,0.0005393471],"domain_scores_gemma":[0.9980849,0.00014670286,0.00030272795,0.0010941486,0.00017352436,0.00019796703],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00027326748,0.00048401338,0.00048377964,0.00029759252,0.00015244853,0.0014856007,0.0017730561,0.00030203123,0.000026276017],"category_scores_gemma":[0.000037426827,0.00042245645,0.000269016,0.00041387376,0.000057794212,0.00018367819,0.0020846978,0.0009105565,0.000105216386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009580898,0.000444373,0.00037703736,0.000598658,0.00035320886,0.00036060988,0.0072515397,0.1422445,0.00008814465,0.05257183,0.07676601,0.7189345],"study_design_scores_gemma":[0.00016728068,0.000069894086,0.00031997525,0.0001238747,0.0000113373935,0.000051039147,0.000019433646,0.9205035,0.00008618047,0.07237938,0.0057597584,0.000508352],"about_ca_topic_score_codex":0.000088455294,"about_ca_topic_score_gemma":0.0000045072143,"teacher_disagreement_score":0.778259,"about_ca_system_score_codex":0.0000649949,"about_ca_system_score_gemma":0.00019654023,"threshold_uncertainty_score":0.99982274},"labels":[],"label_agreement":null},{"id":"W3121441853","doi":"10.1088/2058-9565/abdca4","title":"Mutual information-assisted adaptive variational quantum eigensolver","year":2021,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Canadian Institute for Advanced Research; University of Toronto","funders":"Office of Science; Advanced Scientific Computing Research; Google; U.S. Department of Energy","keywords":"Ansatz; Precomputation; Computer science; Qubit; Density matrix renormalization group; Quantum computer; Quantum; Electronic circuit; Algorithm; Theoretical computer science; Applied mathematics; Computational science; Mathematics; Quantum mechanics; Physics; Computation","score_opus":0.009374875786907214,"score_gpt":0.22438651453333502,"score_spread":0.2150116387464278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121441853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31912726,0.00043221674,0.65843195,0.018245243,0.0013089026,0.00021056736,0.000014991661,0.0009074006,0.0013215053],"genre_scores_gemma":[0.93327796,0.000018526802,0.066018164,0.0005966068,0.000041966814,0.000010337399,0.0000036881568,0.000004749828,0.000027980033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997969,0.000033616438,0.00030603324,0.00054480194,0.00062712317,0.0005194335],"domain_scores_gemma":[0.998206,0.00010429139,0.00013666779,0.00056528096,0.0008623566,0.00012540241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056057534,0.0001743241,0.00020156062,0.0006420339,0.00072916,0.00033366843,0.0010116518,0.0001383435,0.000012288952],"category_scores_gemma":[0.00043982387,0.00015508017,0.000034822166,0.0037840381,0.00075524347,0.001130012,0.0008281431,0.0003144353,0.00006947151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021552955,0.000036314752,0.00017383395,0.0000041523135,0.000008872978,0.000029703328,0.00031394584,0.000052275755,0.0023737918,0.92897344,0.00021118028,0.067820325],"study_design_scores_gemma":[0.00031599996,0.0001742346,0.005786321,0.000020475418,0.0000050000367,0.00053363625,0.00025007245,0.8885103,0.0032721942,0.09434029,0.0065193134,0.00027216485],"about_ca_topic_score_codex":0.00001568278,"about_ca_topic_score_gemma":0.000004746078,"teacher_disagreement_score":0.888458,"about_ca_system_score_codex":0.000056833353,"about_ca_system_score_gemma":0.0010889334,"threshold_uncertainty_score":0.63239855},"labels":[],"label_agreement":null},{"id":"W3123586422","doi":"10.1038/s41534-021-00498-9","title":"Machine learning of high dimensional data on a noisy quantum processor","year":2021,"lang":"en","type":"preprint","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fermilab; Laboratory Directed Research and Development; High Energy Physics; Office of Science; U.S. Department of Energy","keywords":"Kernel (algebra); Dimensionality reduction; Computer science; Ansatz; Benchmark (surveying); Dimension (graph theory); Kernel method; Curse of dimensionality; Quantum; Qubit; Algorithm; Artificial intelligence; Clustering high-dimensional data; Support vector machine; Pattern recognition (psychology); Mathematics; Cluster analysis; Physics; Quantum mechanics; Pure mathematics","score_opus":0.01861063776552662,"score_gpt":0.2509234237891507,"score_spread":0.2323127860236241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123586422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39068863,0.00055865146,0.60288864,0.0017413596,0.0025301091,0.00055879215,0.0002339028,0.0005258817,0.00027406268],"genre_scores_gemma":[0.9732105,0.00009681886,0.022888128,0.0003790914,0.00016395867,0.000017689528,0.0032005864,0.000022932276,0.000020264102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996467,0.00018402499,0.0010745167,0.0007034288,0.0011448094,0.00042620214],"domain_scores_gemma":[0.99597716,0.00022614677,0.0011912752,0.0020232904,0.00045604692,0.00012608457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009315577,0.00046914865,0.00062838034,0.0004384716,0.0002550555,0.00049914344,0.0026481834,0.00032547276,0.000019181702],"category_scores_gemma":[0.0004438098,0.00041648344,0.00014557928,0.0005059851,0.00006316618,0.001363939,0.004731812,0.0015573413,0.00004876415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011870307,0.0003240119,0.00015670026,0.001534625,0.00017991527,0.000037182446,0.004874579,0.71116674,0.000099820165,0.065596916,0.0008485395,0.21506225],"study_design_scores_gemma":[0.00042117352,0.00020303667,0.0008388577,0.0007028013,0.000020675709,0.000046478075,0.000036045214,0.9911536,0.00022107517,0.0033067907,0.0026091682,0.00044030402],"about_ca_topic_score_codex":0.00038410336,"about_ca_topic_score_gemma":0.0000064391297,"teacher_disagreement_score":0.5825219,"about_ca_system_score_codex":0.000063001964,"about_ca_system_score_gemma":0.0005476096,"threshold_uncertainty_score":0.9998287},"labels":[],"label_agreement":null},{"id":"W3123702653","doi":"10.1007/jhep08(2021)055","title":"Holographic quantum tasks with input and output regions","year":2021,"lang":"en","type":"preprint","venue":"Journal of High Energy Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Spacetime; Wedge (geometry); Quantum entanglement; Computation; Point (geometry); Boundary (topology); Quantum; Context (archaeology); Theoretical physics; Holography; Poincaré conjecture; Computer science; Mathematics; Topology (electrical circuits); Physics; Pure mathematics; Geometry; Quantum mechanics; Mathematical analysis; Algorithm; Combinatorics; Geography","score_opus":0.012519069763708698,"score_gpt":0.21870557806103483,"score_spread":0.20618650829732613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123702653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16494125,0.0012543245,0.8312823,0.0014152239,0.000984358,0.000029547007,0.0000032050614,0.00004530575,0.000044492393],"genre_scores_gemma":[0.9307099,0.00051220146,0.06755586,0.00033765996,0.0008191957,0.0000021404192,0.0000059999434,0.000026997766,0.000030040364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980463,0.00016709474,0.0004656587,0.0004852953,0.0005272504,0.0003084491],"domain_scores_gemma":[0.99760175,0.00012726596,0.0009404952,0.0007333136,0.0004049411,0.00019221858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002138528,0.0003636302,0.0006891255,0.00021502301,0.00015427399,0.0004136007,0.0010502193,0.00018823841,4.4582737e-7],"category_scores_gemma":[0.000014514467,0.00026787762,0.0002558968,0.00043049638,0.00014736137,0.00019987332,0.0011230527,0.0011989466,2.0424874e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040072864,0.00047779884,0.00027432267,0.00015325724,0.00089106004,0.0019603532,0.0016501099,0.18506673,0.00005757826,0.7063673,0.001360386,0.10170099],"study_design_scores_gemma":[0.0011784631,0.0010435247,0.0039276998,0.0015612992,0.00020507135,0.0024073478,0.0000682841,0.16260138,0.0006345468,0.82305884,0.0022286344,0.0010848735],"about_ca_topic_score_codex":0.00009655734,"about_ca_topic_score_gemma":0.000010125635,"teacher_disagreement_score":0.76576865,"about_ca_system_score_codex":0.000026084648,"about_ca_system_score_gemma":0.0003818045,"threshold_uncertainty_score":0.99997735},"labels":[],"label_agreement":null},{"id":"W3125090360","doi":"","title":"Quantum light : The puzzling predictions of entanglement are coming of age","year":2015,"lang":"en","type":"article","venue":"Archive ouverte UNIGE (University of Geneva)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum entanglement; Mainstream; Theoretical physics; Quantum; Physics; Property (philosophy); Quantum mechanics; Key (lock); Philosophy; Epistemology; Computer science; Computer security","score_opus":0.017904633970750334,"score_gpt":0.19781384864627732,"score_spread":0.17990921467552698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125090360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34932387,0.000100990095,0.64784867,0.0011453143,0.000243732,0.00015791507,0.000039247316,0.000041401036,0.0010988506],"genre_scores_gemma":[0.96460396,0.00002476288,0.03520958,0.000033189164,0.00002611365,1.4217822e-7,0.000004757764,0.000005972106,0.000091536705],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887747,0.00015747937,0.00018013747,0.00023269112,0.00035476388,0.00019745377],"domain_scores_gemma":[0.99879086,0.00012453493,0.00032273284,0.00052699447,0.00013163738,0.00010322198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031303213,0.00011410363,0.00024922425,0.00017287479,0.00021956321,0.000010030858,0.0011736334,0.000031966058,0.0000046815308],"category_scores_gemma":[0.000024447792,0.000103814564,0.00014109019,0.00034134003,0.00020061502,0.0001116951,0.0006931247,0.00014850915,0.0000019068616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039931043,0.0020021347,0.022500062,0.0006163944,0.0016930997,0.000521351,0.35617146,0.1905199,0.05180275,0.25492558,0.031252705,0.08759525],"study_design_scores_gemma":[0.0008296465,0.00030739882,0.011343021,0.00017044984,0.000050470186,0.000010001723,0.008028464,0.9666017,0.0013931512,0.0065623187,0.004525654,0.00017772344],"about_ca_topic_score_codex":0.00031262953,"about_ca_topic_score_gemma":0.00024550923,"teacher_disagreement_score":0.7760818,"about_ca_system_score_codex":0.000029105597,"about_ca_system_score_gemma":0.00010875449,"threshold_uncertainty_score":0.4233435},"labels":[],"label_agreement":null},{"id":"W3125652746","doi":"10.1088/2399-6528/ac1df7","title":"Generation and verification of 27-qubit Greenberger-Horne-Zeilinger states in a superconducting quantum computer","year":2021,"lang":"en","type":"article","venue":"Journal of Physics Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Qubit; Fidelity; Physics; Quantum entanglement; Quantum computer; Multipartite; Greenberger–Horne–Zeilinger state; Quantum mechanics; IBM; Measure (data warehouse); Quantum; Quantum state; Computer science; W state; Telecommunications; Optics","score_opus":0.05352527020091798,"score_gpt":0.2870703051777561,"score_spread":0.23354503497683812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125652746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6614811,0.0011066012,0.3343077,0.0028010095,0.00022307933,0.0000489647,0.000002482636,0.000010891687,0.000018185665],"genre_scores_gemma":[0.78608733,0.00041218384,0.21327777,0.00006426535,0.00013752595,9.766102e-7,0.000008726545,0.000006494581,0.000004739929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987991,0.00023986914,0.00052457437,0.00013993145,0.00017960444,0.000116931435],"domain_scores_gemma":[0.99815756,0.00025857025,0.0003563539,0.0007402126,0.00044072696,0.000046553552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046825004,0.00009293396,0.00022440708,0.00009844318,0.00011482703,0.0000848708,0.0006312866,0.000035591915,0.000001102431],"category_scores_gemma":[0.000042127675,0.00008852516,0.00007155802,0.00044642427,0.00007097247,0.00039823557,0.00033535034,0.00032684914,7.527156e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001236014,0.0015139087,0.006247139,0.00012669312,0.00020623689,0.000026749849,0.026324332,0.10462936,0.23687771,0.1887675,0.00075724575,0.43451077],"study_design_scores_gemma":[0.0002682693,0.00006400174,0.0024019827,0.00009503511,0.000010196356,0.00005393743,0.00014364395,0.98198,0.0060778214,0.008414088,0.00039146468,0.00009956163],"about_ca_topic_score_codex":0.00002257386,"about_ca_topic_score_gemma":0.000018002076,"teacher_disagreement_score":0.8773506,"about_ca_system_score_codex":0.000024620844,"about_ca_system_score_gemma":0.00013293755,"threshold_uncertainty_score":0.3609951},"labels":[],"label_agreement":null},{"id":"W3126033875","doi":"10.3847/1538-4357/abe6ac","title":"Toward Cosmological Simulations of Dark Matter on Quantum Computers","year":2021,"lang":"en","type":"article","venue":"The Astrophysical Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"National Aeronautics and Space Administration","keywords":"Dark energy; Physics; Dark matter; Quantum; Quantum computer; Statistical physics; Nonlinear system; Universe; Theoretical physics; Quantum algorithm; Classical mechanics; Quantum mechanics; Astrophysics; Cosmology","score_opus":0.01817902928475516,"score_gpt":0.2465043384994797,"score_spread":0.22832530921472455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126033875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44611058,0.000013313516,0.54823756,0.005210397,0.00032695095,0.000025513407,0.000002665367,0.000018574065,0.000054457258],"genre_scores_gemma":[0.947493,0.0000016021077,0.051332153,0.0008407122,0.00031121162,3.6582736e-7,0.0000010700329,0.0000061843252,0.000013701007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986695,0.0002527878,0.0002534034,0.00020328317,0.00036524833,0.00025576228],"domain_scores_gemma":[0.9988688,0.0004063963,0.00013611847,0.00037459537,0.00011414193,0.00009990904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012453346,0.00012710938,0.00021116115,0.00003768833,0.00022658985,0.0001503588,0.0007883443,0.000030117633,0.000017395423],"category_scores_gemma":[0.000028872602,0.00007520788,0.00017815435,0.00026797954,0.00010709024,0.00007325736,0.00029372942,0.0005454322,0.000040693754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007585444,0.0010451635,0.0003952272,0.000017160988,0.00019477216,0.00057425234,0.0013314473,0.72785044,0.02221938,0.154402,0.009529989,0.0823643],"study_design_scores_gemma":[0.0005101805,0.00049431913,0.037412908,0.00008111091,0.000015818052,0.0006572266,0.000027651224,0.8854237,0.0014036547,0.073489234,0.000291188,0.00019296852],"about_ca_topic_score_codex":0.0000014650424,"about_ca_topic_score_gemma":4.6902027e-8,"teacher_disagreement_score":0.5013824,"about_ca_system_score_codex":0.00001680278,"about_ca_system_score_gemma":0.00006561018,"threshold_uncertainty_score":0.30668882},"labels":[],"label_agreement":null},{"id":"W3126124413","doi":"","title":"Quantitative robustness analysis of quantum programs","year":2019,"lang":"en","type":"article","venue":"UTS ePRESS (University of Technology Sydney)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Wind Energy Technologies Office; Canadian Institute for Advanced Research","keywords":"Robustness (evolution); Qubit; Computer science; Quantum computer; Quantum; Theoretical computer science; Quantum error correction; Quantum logic; Algorithm; Computer engineering; Quantum mechanics; Physics","score_opus":0.009531933749755339,"score_gpt":0.21170194663491762,"score_spread":0.2021700128851623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126124413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6211614,0.00008789987,0.37737522,0.0007910807,0.00009203226,0.00012007665,0.000005960572,0.00018224971,0.00018408122],"genre_scores_gemma":[0.9028969,0.000010341435,0.0969572,0.0000072868374,0.0000024333954,2.514592e-7,0.0000053611607,0.000005307199,0.00011495542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987864,0.000051845374,0.00017474407,0.00048368966,0.00023292257,0.00027040904],"domain_scores_gemma":[0.9984619,0.000080456964,0.00031265945,0.00089395215,0.00020051486,0.00005054267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017197618,0.00015216606,0.0005602954,0.0014073154,0.00009203603,0.000012104454,0.0018022988,0.00020340497,0.000025215377],"category_scores_gemma":[0.000023706623,0.00015862683,0.0002346345,0.003368934,0.00035883242,0.00018795002,0.00074591115,0.00023680838,0.000010202415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089912486,0.00072084425,0.07675562,0.00020048762,0.003350944,0.000097501994,0.004022155,0.13868763,0.0045562717,0.65495867,0.00016296601,0.116397016],"study_design_scores_gemma":[0.00034024636,0.0003136883,0.007823359,0.000056174264,0.00017586918,0.0000045853667,0.00075517927,0.98767984,0.00059369294,0.0016805505,0.00039318987,0.00018364537],"about_ca_topic_score_codex":0.00019676017,"about_ca_topic_score_gemma":0.000033041804,"teacher_disagreement_score":0.84899217,"about_ca_system_score_codex":0.000017650158,"about_ca_system_score_gemma":0.000044164623,"threshold_uncertainty_score":0.6468615},"labels":[],"label_agreement":null},{"id":"W3126432833","doi":"10.48550/arxiv.2102.03133","title":"Graphical Language with Delayed Trace: Picturing Quantum Computing with\\n Finite Memory","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Programming language; Parallel computing; Theoretical computer science; Linguistics","score_opus":0.021043187638052567,"score_gpt":0.17726192548239147,"score_spread":0.1562187378443389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126432833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5144411,0.00013116784,0.48449528,0.00008373982,0.00020306384,0.00014543212,0.0000048065167,0.00034048109,0.0001549401],"genre_scores_gemma":[0.97882456,0.00002329171,0.02065906,0.00013126738,0.00016165282,6.0738716e-7,0.000022870752,0.00004611789,0.00013059775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967219,0.00026179562,0.00028038988,0.0017874356,0.00025593158,0.00069250714],"domain_scores_gemma":[0.99732167,0.00032921706,0.0003475218,0.0015213382,0.00019064725,0.00028963594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029965222,0.00060519174,0.00060801697,0.00035771393,0.0004031218,0.00040582372,0.0018784617,0.00031091148,0.000010859884],"category_scores_gemma":[0.000023389353,0.0005394325,0.00024599582,0.001134421,0.00020499577,0.00023965862,0.0019853,0.0017409158,0.000007688527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059206028,0.000108732995,0.0005706416,0.0001122666,0.00022602481,0.0053429496,0.0024715029,0.98435205,0.00004182259,0.0043403204,0.000012805873,0.0023616618],"study_design_scores_gemma":[0.0008216303,0.00021442432,0.001478173,0.00048661794,0.000090539506,0.00013976182,0.0005836291,0.9943857,0.00019115278,0.00077823154,0.000028322766,0.00080179947],"about_ca_topic_score_codex":0.00023823428,"about_ca_topic_score_gemma":0.00012490044,"teacher_disagreement_score":0.46438345,"about_ca_system_score_codex":0.00009062802,"about_ca_system_score_gemma":0.00032647152,"threshold_uncertainty_score":0.99970573},"labels":[],"label_agreement":null},{"id":"W3126461544","doi":"10.1137/23m1573975","title":"Symmetries, Graph Properties, and Quantum Speedups","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Waterloo","funders":"Army Research Office; U.S. Department of Defense; U.S. Department of Energy; Natural Sciences and Engineering Research Council of Canada; Samsung; National Science Foundation","keywords":"Permutation group; Adjacency list; Homogeneous space; Adjacency matrix; Speedup; Quantum algorithm; Mathematics; Combinatorics; Discrete mathematics; Quantum; Permutation (music); Computer science; Graph; Parallel computing; Quantum mechanics; Physics","score_opus":0.022882138199922932,"score_gpt":0.23874943412190666,"score_spread":0.21586729592198373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126461544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4114347,0.013261269,0.56119615,0.0070429244,0.0051901895,0.00016846534,0.0000016126037,0.0007643075,0.0009403665],"genre_scores_gemma":[0.9810745,0.00010925898,0.016936088,0.00071398047,0.001056881,4.2135693e-7,4.215563e-7,0.000027478667,0.000080959355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792516,0.0001463177,0.00041780312,0.0005085262,0.00047556983,0.00052661967],"domain_scores_gemma":[0.99897873,0.00026531282,0.00011086039,0.00028516995,0.00010348222,0.00025646976],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010456356,0.00026874707,0.00026460382,0.00050477666,0.00061852083,0.0017836924,0.00068333826,0.000072447845,0.00000381195],"category_scores_gemma":[0.00010826196,0.00019358742,0.00013472392,0.00090966054,0.00007528649,0.00027995673,0.0003620005,0.0010859434,0.000029545008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013154926,0.00007789156,0.00013670427,0.00015758294,0.00012573521,0.0010384516,0.0024937182,0.0108972555,0.00059623003,0.13078661,0.0037857736,0.8498909],"study_design_scores_gemma":[0.0002084096,0.00033822923,0.0003758461,0.0009314898,0.0000085197025,0.0029781307,0.000040534025,0.96657336,0.00030887392,0.010241897,0.017683754,0.00031095586],"about_ca_topic_score_codex":0.000007894602,"about_ca_topic_score_gemma":3.960859e-7,"teacher_disagreement_score":0.9556761,"about_ca_system_score_codex":0.0000517188,"about_ca_system_score_gemma":0.00014641584,"threshold_uncertainty_score":0.99925256},"labels":[],"label_agreement":null},{"id":"W3126803602","doi":"","title":"Machine learning framework for control in classical and quantum domains.","year":2020,"lang":"en","type":"article","venue":"The European Symposium on Artificial Neural Networks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Control (management); Quantum; Quantum control; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.01632866230140382,"score_gpt":0.23230637777177754,"score_spread":0.21597771547037373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126803602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039516788,0.00018534636,0.90478826,0.053892005,0.00055489235,0.0004348937,0.0000034322247,0.00029524224,0.00032911717],"genre_scores_gemma":[0.9901189,0.000016476104,0.0019066494,0.0064949184,0.0014071828,0.000005855946,0.0000025361705,0.000038208473,0.00000927683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747694,0.0009378258,0.00035691433,0.00055826316,0.00019124306,0.0004788464],"domain_scores_gemma":[0.998394,0.000982052,0.00012802213,0.0002993617,0.000022261007,0.00017431707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075552496,0.000245048,0.00026734878,0.00004439272,0.0003976796,0.00029837596,0.00073613663,0.000056206994,0.0000013171816],"category_scores_gemma":[0.00012364412,0.00016962626,0.000100564,0.00033396613,0.000109058165,0.000073137584,0.00026994734,0.0010069722,0.000012173009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023262853,0.000052049894,0.00018469167,0.000009309745,0.000014274603,0.00007454359,0.0011434972,0.81333244,0.0005018845,0.089201555,0.00018825867,0.09506487],"study_design_scores_gemma":[0.00041060548,0.0005120394,0.0004986079,0.000030421063,0.0000071706477,0.000010428507,0.000011747266,0.9922335,0.000015364867,0.0038924215,0.0021722182,0.0002054743],"about_ca_topic_score_codex":0.0000034712032,"about_ca_topic_score_gemma":0.0000022792615,"teacher_disagreement_score":0.9506021,"about_ca_system_score_codex":0.000009954148,"about_ca_system_score_gemma":0.00000800956,"threshold_uncertainty_score":0.69171584},"labels":[],"label_agreement":null},{"id":"W3126969099","doi":"10.1007/s40042-021-00065-7","title":"A new efficient model of quantum image cryptography based on sampled GNEQR storage presentation","year":2021,"lang":"en","type":"article","venue":"Journal of the Korean Physical Society","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Presentation (obstetrics); Quantum cryptography; Cryptography; Image (mathematics); Quantum; Theoretical computer science; Computer vision; Computer security; Physics; Quantum information; Quantum mechanics; Medicine","score_opus":0.010702770356335715,"score_gpt":0.2447387492356134,"score_spread":0.23403597887927768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126969099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2920873,0.000016453261,0.70495963,0.0026395633,0.00018690906,0.000051504336,0.0000047755298,0.000014034634,0.000039846545],"genre_scores_gemma":[0.8348393,0.0000018774788,0.16453917,0.0003288743,0.00026851924,4.1951745e-7,6.564945e-7,0.000009910377,0.000011253826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840105,0.00014422393,0.00030738759,0.00019997412,0.000743989,0.00020336494],"domain_scores_gemma":[0.9984506,0.00032733794,0.0004320687,0.00044153671,0.00022612124,0.00012238153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027646124,0.00014515093,0.0002793749,0.000033329317,0.00013952333,0.00008439279,0.0007634876,0.000037961454,0.000002855356],"category_scores_gemma":[0.000076050695,0.00009122782,0.0010377332,0.0005957483,0.00006990523,0.00008784655,0.00019109578,0.00040916557,6.9976477e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018105033,0.00045733913,0.000024475721,0.000022751188,0.000055664328,0.000003869026,0.0022009131,0.9562152,0.026198344,0.0070994096,0.002570504,0.0051334053],"study_design_scores_gemma":[0.0006041975,0.000110355024,0.00091102155,0.000080105885,0.000025723733,0.0000061019073,0.000039787494,0.96501446,0.012245118,0.02084634,0.000021267686,0.00009554298],"about_ca_topic_score_codex":0.000008995244,"about_ca_topic_score_gemma":2.1107195e-7,"teacher_disagreement_score":0.542752,"about_ca_system_score_codex":0.000038380276,"about_ca_system_score_gemma":0.00029023062,"threshold_uncertainty_score":0.37201625},"labels":[],"label_agreement":null},{"id":"W3127789031","doi":"10.22331/q-2021-02-08-394","title":"Exact and approximate continuous-variable gate decompositions","year":2021,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Decomposition; Cover (algebra); Boolean function; Quantum computer; Logic gate; Exact solutions in general relativity; Decomposition method (queueing theory)","score_opus":0.0075618735311323015,"score_gpt":0.227629853828559,"score_spread":0.2200679802974267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127789031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17337163,0.00079435913,0.82061416,0.001957375,0.0005182106,0.00008981573,0.00000851642,0.00033303644,0.0023128982],"genre_scores_gemma":[0.72890437,0.000058110854,0.26946965,0.00087245426,0.00016329416,0.000011072454,0.0000145131235,0.000022268594,0.0004842687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877477,0.00008815836,0.00019029503,0.00045035782,0.00015549059,0.00034091235],"domain_scores_gemma":[0.99912965,0.00012653346,0.000060566996,0.00046284607,0.00009240755,0.00012799744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001943624,0.0001479758,0.00020421554,0.000055952143,0.00027663153,0.00035358072,0.00030896976,0.000051649127,0.000021875872],"category_scores_gemma":[0.000037541016,0.00013668228,0.000049166112,0.00035070098,0.000045845438,0.00018288732,0.0003399209,0.00018454237,0.000023595801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070774427,0.00026799628,0.00047134064,0.00009861623,0.00007908643,0.0004258815,0.0011656561,0.004606964,0.0136956405,0.9379123,0.0025538423,0.038715594],"study_design_scores_gemma":[0.0002823346,0.00005497153,0.0007641099,0.000055798533,0.000007551577,0.00037151866,0.000030581832,0.9496209,0.0018054117,0.03835458,0.008429922,0.00022230735],"about_ca_topic_score_codex":0.0000184371,"about_ca_topic_score_gemma":0.0000018143676,"teacher_disagreement_score":0.94501394,"about_ca_system_score_codex":0.0000110636975,"about_ca_system_score_gemma":0.00007750935,"threshold_uncertainty_score":0.5573742},"labels":[],"label_agreement":null},{"id":"W3128080705","doi":"10.1140/epjqt/s40507-021-00091-1","title":"Commercial applications of quantum computing","year":2021,"lang":"en","type":"article","venue":"EPJ Quantum Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":223,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Creative Destruction Lab; Perimeter Institute; University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; University of Waterloo; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Canada; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; Social Sciences and Humanities Research Council of Canada; Alfred P. Sloan Foundation","keywords":"Quantum computer; Computer science; Quantum; Framing (construction); Computational science; Theoretical computer science; Engineering; Physics; Quantum mechanics","score_opus":0.00896993515348157,"score_gpt":0.25258843463775854,"score_spread":0.24361849948427697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128080705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1375028,0.0008399353,0.8549441,0.0052544973,0.00038153768,0.00014844855,0.0000057456605,0.000689699,0.00023321908],"genre_scores_gemma":[0.91110325,0.000032527856,0.088456094,0.00022295341,0.000114375056,0.000013780683,0.000006782132,0.000018137951,0.000032071184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980295,0.000088542656,0.0005105358,0.0006111306,0.000282859,0.00047747802],"domain_scores_gemma":[0.9979781,0.00019260451,0.00024981843,0.0012096952,0.00029451243,0.00007528197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029019805,0.00021303656,0.0004192423,0.00038770813,0.00027034225,0.000049549275,0.0014420629,0.00025833194,0.00001242685],"category_scores_gemma":[0.000084245694,0.00021560081,0.00012760988,0.0021433202,0.0002469083,0.00008172217,0.0007658621,0.0005533007,0.00004409986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016026866,0.00015854323,0.00052654557,0.00003059739,0.00002647891,0.00003996372,0.00021284563,0.0003484482,0.003945932,0.80779064,0.00027942235,0.18663898],"study_design_scores_gemma":[0.00051671616,0.00017601096,0.0012643073,0.0000785195,0.000014746551,0.00040097794,0.00014440717,0.7411016,0.031686656,0.19433601,0.029841835,0.0004381851],"about_ca_topic_score_codex":0.00002022735,"about_ca_topic_score_gemma":0.000006820635,"teacher_disagreement_score":0.77360046,"about_ca_system_score_codex":0.00002287621,"about_ca_system_score_gemma":0.00016849393,"threshold_uncertainty_score":0.8791946},"labels":[],"label_agreement":null},{"id":"W3128583303","doi":"10.1103/prxquantum.3.020361","title":"Fast Estimation of Outcome Probabilities for Quantum Circuits","year":2022,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Army Research Office; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Fundacja na rzecz Nauki Polskiej; Government of Canada; Australian Research Council; Ministry of Colleges and Universities","keywords":"Qubit; Quantum circuit; Quantum computer; Algorithm; Mathematics; Quantum gate; Rotation (mathematics); Electronic circuit; Computer science; Discrete mathematics; Quantum; Quantum error correction; Quantum mechanics; Physics","score_opus":0.02544168142698658,"score_gpt":0.26723658728888744,"score_spread":0.24179490586190086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128583303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27835146,0.00012684311,0.7183327,0.0012084129,0.0010278575,0.00056164275,0.00004987561,0.00024776557,0.0000934351],"genre_scores_gemma":[0.97287285,9.767673e-7,0.026635997,0.00013547587,0.00006119474,0.00015169111,0.000014379752,0.000019310195,0.00010810314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998054,0.00012911305,0.00052686356,0.00045683852,0.00044873517,0.00038443104],"domain_scores_gemma":[0.99866074,0.0003315401,0.00027112052,0.00057162234,0.00009537834,0.00006959153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079240225,0.00018450465,0.00031591646,0.00017520864,0.00042701868,0.00006942395,0.0009996496,0.00003525249,0.000016352265],"category_scores_gemma":[0.0001640852,0.00017631425,0.00016870348,0.00042476787,0.00006504246,0.00017684296,0.00048848387,0.00021982049,0.000004708137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015683674,0.0002792216,0.0008892954,0.00033662238,0.000034811357,0.000005204178,0.00419267,0.26520324,0.00038332446,0.63228756,0.000701345,0.09567101],"study_design_scores_gemma":[0.0003369295,0.00041383936,0.0009867401,0.000014571611,0.0000073959723,0.000026067833,0.00010862705,0.90650284,0.00022365876,0.08978853,0.0013892567,0.00020151923],"about_ca_topic_score_codex":0.000034621335,"about_ca_topic_score_gemma":0.0000018111921,"teacher_disagreement_score":0.6945214,"about_ca_system_score_codex":0.000059014896,"about_ca_system_score_gemma":0.00009752806,"threshold_uncertainty_score":0.71898866},"labels":[],"label_agreement":null},{"id":"W3129665236","doi":"10.21203/rs.3.rs-209059/v1","title":"Efficient and Accurate Electronic Structure Simulation Demonstrated on a Trapped-Ion Quantum Computer","year":2021,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"QLT (Canada)","funders":"","keywords":"Ion; Electronic structure; Quantum; Computer science; Statistical physics; Atomic physics; Physics; Quantum mechanics","score_opus":0.029332797496318213,"score_gpt":0.34122315047622226,"score_spread":0.31189035297990403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129665236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73875046,0.00067544385,0.2580443,0.000987203,0.0004610813,0.0007657915,0.000027645423,0.00025757277,0.000030515956],"genre_scores_gemma":[0.9945152,0.00006289931,0.004734394,0.000091261725,0.0004294345,0.000020618536,0.000090622176,0.000041225096,0.00001436011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99393886,0.0011718237,0.000456692,0.001699499,0.0014688398,0.0012642533],"domain_scores_gemma":[0.99682385,0.00085116393,0.00017942663,0.0012271776,0.00063054694,0.00028786715],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011802986,0.0005076659,0.00051467656,0.0006420333,0.00059565064,0.0014494158,0.0011456087,0.0004908377,0.000015012549],"category_scores_gemma":[0.00012596264,0.000441861,0.0001762988,0.0010841861,0.00015456196,0.000075689604,0.0021727392,0.0037121514,0.0000078486755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024029576,0.00011639628,0.00003793794,0.00027934983,0.000050707815,0.000087808985,0.00093611976,0.9546239,0.00028734916,0.0046947636,0.0000687407,0.038792934],"study_design_scores_gemma":[0.00038694148,0.00051949313,0.004033485,0.0008391525,0.000006941329,0.000029092327,0.00004864078,0.9891365,0.00030635373,0.003997387,0.00025998207,0.0004359894],"about_ca_topic_score_codex":0.00005569043,"about_ca_topic_score_gemma":0.00002055479,"teacher_disagreement_score":0.25576475,"about_ca_system_score_codex":0.00024030928,"about_ca_system_score_gemma":0.0008774972,"threshold_uncertainty_score":0.9998033},"labels":[],"label_agreement":null},{"id":"W3132055550","doi":"10.1038/s41598-021-84289-4","title":"Hamiltonian transformability, fast adiabatic dynamics and hidden adiabaticity","year":2021,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Eusko Jaurlaritza; Ministerio de Ciencia e Innovación; Canada Research Chairs","keywords":"Hilbert space; Adiabatic process; Adiabatic quantum computation; Hamiltonian (control theory); Unitary transformation; Unitary state; Computation; Quantum; Physics; Quantum computer; Classical mechanics; Mathematics; Computer science; Topology (electrical circuits); Quantum mechanics; Mathematical optimization; Algorithm; Combinatorics","score_opus":0.0065998426750433535,"score_gpt":0.21585659315951267,"score_spread":0.20925675048446932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132055550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8386392,0.00018396137,0.15412754,0.0009942219,0.0038427114,0.00016149218,0.0000034733505,0.00018806678,0.0018593429],"genre_scores_gemma":[0.9615963,0.0000028686575,0.037055753,0.00007666084,0.00004648343,0.0000057498155,0.000018032775,0.000010370365,0.0011877603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974535,0.00009131888,0.000450195,0.0010541739,0.0005180832,0.0004327337],"domain_scores_gemma":[0.9981237,0.00007119497,0.0001352527,0.0012590837,0.00016643785,0.00024430203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010567401,0.00018111515,0.00023479863,0.00011818952,0.00054983696,0.0009879463,0.00035114723,0.000064635606,0.000018158826],"category_scores_gemma":[0.00012892582,0.00016462589,0.00010146048,0.0008175536,0.0002826283,0.000317747,0.00032730706,0.00020291092,0.000007818802],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022040801,0.000304241,0.01621355,0.00021579764,0.000061150335,0.0033605983,0.010557805,0.0015393976,0.0049564033,0.013090773,0.0010724021,0.9486257],"study_design_scores_gemma":[0.00011212585,0.000039433085,0.012758199,0.00006305717,0.000014177645,0.0023871663,0.00013443311,0.92150134,0.005587441,0.055191364,0.0018475845,0.0003636727],"about_ca_topic_score_codex":0.0000257511,"about_ca_topic_score_gemma":0.00022579852,"teacher_disagreement_score":0.94826204,"about_ca_system_score_codex":0.000063522224,"about_ca_system_score_gemma":0.0003199296,"threshold_uncertainty_score":0.95267886},"labels":[],"label_agreement":null},{"id":"W3132847260","doi":"","title":"TEQUILA: a platform for rapid development of quantum algorithms","year":2021,"lang":"en","type":"article","venue":"Open MIND","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutscher Akademischer Austauschdienst; Mitacs; Canadian Institute for Advanced Research; Google","keywords":"Heuristics; Computer science; Algorithm; Python (programming language); Quantum computer; Software deployment; Quantum; Quantum algorithm; Field (mathematics); Computer engineering; Mathematics; Software engineering; Programming language; Physics","score_opus":0.05247340411771428,"score_gpt":0.3036647445002565,"score_spread":0.2511913403825422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132847260","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123857126,0.00018429717,0.8731866,0.0004582942,0.00042534253,0.00032759385,0.000012244641,0.000006540964,0.0015419436],"genre_scores_gemma":[0.058707155,0.0000022944305,0.9407414,0.0000573212,0.00005944209,0.000015712327,0.0000131789,0.000009227649,0.00039422803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868095,0.000020180158,0.00035421108,0.00044803368,0.0002040668,0.00029256445],"domain_scores_gemma":[0.9990659,0.00013066707,0.00013116207,0.00044466942,0.0001432207,0.00008438343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046599403,0.00013698648,0.00025436108,0.000055574306,0.00017378177,0.00021703284,0.0011830115,0.000052867414,0.000091786926],"category_scores_gemma":[0.00004663748,0.00011980617,0.000074230236,0.00029866977,0.000026932137,0.00020206124,0.0009501248,0.00009302474,0.000030738316],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005842428,0.000084435276,0.0000074501613,0.000012475992,0.000029982994,0.000013660878,0.0021849172,0.0001551987,0.0014314404,0.0010570701,0.00014906797,0.99486846],"study_design_scores_gemma":[0.0009867582,0.00015713368,0.00029236233,0.00011259892,0.000008593552,0.00006212283,0.00017081268,0.68249035,0.13933381,0.0021089767,0.17393468,0.00034180813],"about_ca_topic_score_codex":0.0000046238947,"about_ca_topic_score_gemma":0.000008056657,"teacher_disagreement_score":0.9945266,"about_ca_system_score_codex":0.00002197913,"about_ca_system_score_gemma":0.0005668473,"threshold_uncertainty_score":0.4885554},"labels":[],"label_agreement":null},{"id":"W3133457210","doi":"10.1103/physrevapplied.22.014006","title":"Hardware-efficient error-correcting codes for large nuclear spins","year":2024,"lang":"en","type":"article","venue":"Physical Review Applied","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Sherbrooke","funders":"Canada First Research Excellence Fund","keywords":"Qubit; Quantum error correction; Spins; Computer science; Quantum computer; Physics; Encoding (memory); Spin (aerodynamics); Quantum information; Error detection and correction; Scalability; Quantum network; Quantum; Quantum mechanics; Topology (electrical circuits); Algorithm; Electrical engineering; Engineering; Condensed matter physics","score_opus":0.016112781447033753,"score_gpt":0.3038186565925305,"score_spread":0.2877058751454967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133457210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018618954,0.011309051,0.96194386,0.0026024387,0.0008797877,0.0011751589,0.00002387107,0.0012172627,0.0022296333],"genre_scores_gemma":[0.97814596,0.00018663172,0.019253442,0.0016007859,0.0006319329,0.00009954716,0.000007205285,0.00004113592,0.000033351895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842805,0.000029273788,0.00023392044,0.0006163907,0.00025709168,0.0004352574],"domain_scores_gemma":[0.99911,0.00026226122,0.00005869412,0.00042575673,0.000034722303,0.00010859351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003932114,0.00021463218,0.00039373623,0.00004309587,0.00021096678,0.00019944356,0.0006121907,0.00002397421,0.000007129398],"category_scores_gemma":[0.00005187518,0.0001641371,0.00026943898,0.0004816823,0.000021360756,0.00004660517,0.0002963024,0.00026116084,0.00021238682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002688073,0.00016791867,3.7810253e-7,0.001999402,0.000031456664,0.0000067119718,0.0006597789,0.0010067096,0.00081750884,0.5337014,0.0033289033,0.4582771],"study_design_scores_gemma":[0.00009858623,0.000043463973,0.000013609473,0.0011319794,0.00002616842,0.000007759245,0.000006249715,0.8726325,0.0002510715,0.0049203155,0.120651826,0.00021644773],"about_ca_topic_score_codex":0.0000017476281,"about_ca_topic_score_gemma":2.8860333e-7,"teacher_disagreement_score":0.959527,"about_ca_system_score_codex":0.000030466113,"about_ca_system_score_gemma":0.000041823554,"threshold_uncertainty_score":0.66933167},"labels":[],"label_agreement":null},{"id":"W3133732393","doi":"10.1038/s41586-021-03202-1","title":"Quantum circuits with many photons on a programmable nanophotonic chip","year":2021,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":538,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Photonics; Photon; Quantum sensor; Quantum computer; Quantum optics; Quantum imaging; Quantum; Quantum technology; Chip","score_opus":0.007070385854394247,"score_gpt":0.2284477476469319,"score_spread":0.22137736179253767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133732393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9550477,0.0026497121,0.025291825,0.0066490774,0.0016625583,0.0005740152,0.000014681638,0.0010610529,0.007049375],"genre_scores_gemma":[0.9746261,0.000013887261,0.021758612,0.0026718222,0.00014029013,0.000022596334,0.000009457117,0.000028183418,0.0007290503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794936,0.000075056145,0.0001538897,0.00075697777,0.0005185194,0.00054620596],"domain_scores_gemma":[0.9986469,0.00008509482,0.000081622886,0.00089483906,0.00014152234,0.00014999464],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0001632023,0.0002565627,0.00023984895,0.000097021686,0.00026465702,0.0002979621,0.00078610296,0.00050767494,0.000017658069],"category_scores_gemma":[0.000040737374,0.00019098727,0.00010353839,0.0010262069,0.00004262699,0.00011308808,0.0001950278,0.0024997527,0.00004434775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099066325,0.0021648684,0.0010958202,0.0003713584,0.0004632185,0.007852668,0.003766577,0.009092756,0.03378432,0.44967306,0.01109466,0.48054165],"study_design_scores_gemma":[0.0027407266,0.0016076738,0.00747214,0.00080523855,0.0000426695,0.002156716,0.000082367624,0.6619644,0.09583048,0.013935949,0.21165136,0.0017102724],"about_ca_topic_score_codex":0.0000072777166,"about_ca_topic_score_gemma":0.000010727257,"teacher_disagreement_score":0.65287167,"about_ca_system_score_codex":0.000039183687,"about_ca_system_score_gemma":0.00028315122,"threshold_uncertainty_score":0.9998015},"labels":[],"label_agreement":null},{"id":"W3133963567","doi":"10.1038/s41534-021-00382-6","title":"Automated design of superconducting circuits and its application to 4-local couplers","year":2021,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Vector Institute; University of Toronto","funders":"Army Research Office; U.S. Air Force; Intelligence Advanced Research Projects Activity; Harvard University; Office of the Director of National Intelligence; FAS Division of Science, Harvard University; NIH Office of the Director; U.S. Department of Defense","keywords":"Computer science; Circuit design; Noise (video); Physical design; Electronic engineering; Sensitivity (control systems); Electronic circuit; Circuit complexity; Quantum computer; Set (abstract data type); Computer engineering; Quantum; Electrical engineering; Embedded system; Engineering; Physics","score_opus":0.01630443493496982,"score_gpt":0.241850500488186,"score_spread":0.22554606555321616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133963567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2781089,0.000046603727,0.72096485,0.00030676887,0.00011498691,0.00016350293,0.000002315047,0.00024508667,0.000047020778],"genre_scores_gemma":[0.98790103,0.000008957844,0.011761841,0.0002743423,0.000020197358,0.000011743283,0.000014434875,0.000004630059,0.000002818097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998984,0.000051641193,0.00035952576,0.00017016122,0.00024475498,0.00018994154],"domain_scores_gemma":[0.99919003,0.00009514383,0.0001224056,0.00023799679,0.0002678926,0.000086528504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003505434,0.00010920018,0.00014598873,0.00013750566,0.00012300437,0.00009616602,0.00023293588,0.00006284413,0.0000022495512],"category_scores_gemma":[0.0001100981,0.00010841866,0.000024702369,0.00057717925,0.000017558377,0.0009457929,0.00013552215,0.00009943265,0.000029851179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009207383,0.000048281538,0.00007075953,0.00018260893,0.000028325097,0.0000055681985,0.01139154,0.44252244,0.06003709,0.06332771,0.00026007104,0.4221164],"study_design_scores_gemma":[0.00017474982,0.00005876221,0.00078109367,0.00003621376,0.0000033559072,0.00006849267,0.0002049723,0.9851323,0.012570349,0.0004915869,0.00035252408,0.00012563403],"about_ca_topic_score_codex":0.000013956555,"about_ca_topic_score_gemma":8.5272904e-7,"teacher_disagreement_score":0.70979214,"about_ca_system_score_codex":0.000027271986,"about_ca_system_score_gemma":0.00010278553,"threshold_uncertainty_score":0.44211847},"labels":[],"label_agreement":null},{"id":"W3134132121","doi":"10.1007/978-3-030-88238-9_2","title":"Constructions for Quantum Indistinguishability Obfuscation","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada; University of Ottawa","funders":"","keywords":"Obfuscation; Probabilistic logic; Electronic circuit; Logarithm; Boolean circuit; Computer science; Function (biology); Boolean function; Hierarchy; Theoretical computer science; Discrete mathematics; Topology (electrical circuits); Mathematics; Algorithm; Combinatorics; Physics; Quantum mechanics","score_opus":0.0166103677544678,"score_gpt":0.2751060675227601,"score_spread":0.25849569976829234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134132121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12316751,0.00023672756,0.8672504,0.0016823672,0.0066958102,0.00065191544,0.000015326359,0.00029060314,0.000009333775],"genre_scores_gemma":[0.50475246,0.0000032416049,0.49452874,0.00025851675,0.00039321318,0.00003897962,0.000014251412,0.00001044099,1.7661228e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953263,0.00016181584,0.0006673229,0.0023257476,0.00068960903,0.0008292176],"domain_scores_gemma":[0.99573475,0.0010155009,0.00038107118,0.001992478,0.00068890594,0.0001872646],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001571536,0.00047960784,0.00057264784,0.00057399337,0.0005974521,0.0016220644,0.0034759887,0.00031928645,0.0000032010098],"category_scores_gemma":[0.0011496647,0.000466786,0.00024704222,0.001932614,0.00065797474,0.00030787793,0.0038057691,0.0011621615,0.0000018053275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025053585,0.00009361283,0.0010086782,0.00013999757,0.000010027408,0.000011295036,0.0019559013,0.43761376,0.00019137256,0.0014165385,0.0000055313008,0.5575508],"study_design_scores_gemma":[0.00021244283,0.00006969268,0.0037537613,0.00026262717,0.000006218408,0.00006191031,0.0000016254392,0.8917284,0.0016482986,0.10174701,0.0000388709,0.00046913812],"about_ca_topic_score_codex":0.00011744418,"about_ca_topic_score_gemma":0.00008260488,"teacher_disagreement_score":0.55708164,"about_ca_system_score_codex":0.0002964796,"about_ca_system_score_gemma":0.0017299195,"threshold_uncertainty_score":0.9997784},"labels":[],"label_agreement":null},{"id":"W3134144170","doi":"10.1103/physrevapplied.17.044005","title":"Customized Quantum Annealing Schedules","year":2022,"lang":"en","type":"article","venue":"Physical Review Applied","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Laboratory; Intelligence Advanced Research Projects Activity; University of Southern California; Defense Advanced Research Projects Agency; Office of the Director of National Intelligence; National Science Foundation","keywords":"Quantum annealing; Annealing (glass); Ising model; Qubit; Simulated annealing; Ground state; Hamiltonian (control theory); Computer science; Quantum; Physics; Quantum computer; Statistical physics; Quantum mechanics; Mathematics; Algorithm; Mathematical optimization; Thermodynamics","score_opus":0.011423181025865908,"score_gpt":0.267990267066891,"score_spread":0.25656708604102507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134144170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28741947,0.048405536,0.63295823,0.014769843,0.001474441,0.0029116569,0.000029211446,0.0025221556,0.009509438],"genre_scores_gemma":[0.97731966,0.00038459915,0.018150203,0.0036125507,0.0002627105,0.00022564053,0.000009044852,0.000021957352,0.000013607912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983176,0.00013288156,0.00024636675,0.00049406,0.00046748613,0.00034163156],"domain_scores_gemma":[0.9989541,0.000173853,0.00013477681,0.00060678483,0.0000227782,0.00010767779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046818375,0.00018732391,0.0004503236,0.00004338792,0.00041072548,0.0000565806,0.0011320497,0.000009933953,0.000027109447],"category_scores_gemma":[0.000028724937,0.00015804867,0.00018686929,0.00064337853,0.00003187214,0.00005311782,0.0009340549,0.00042433199,0.00008991002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007956094,0.00017015317,0.0000023140317,0.00026712258,0.00002151311,0.000009893837,0.0001814525,0.004667626,0.0014338067,0.8101671,0.0009814921,0.18208958],"study_design_scores_gemma":[0.000489744,0.00006419754,0.000042464344,0.00014315324,0.000023526,0.000013133465,0.000011169452,0.8685963,0.00032874825,0.080977015,0.048936617,0.00037392857],"about_ca_topic_score_codex":0.0000043857804,"about_ca_topic_score_gemma":6.9285946e-8,"teacher_disagreement_score":0.8639287,"about_ca_system_score_codex":0.000034488174,"about_ca_system_score_gemma":0.000052903546,"threshold_uncertainty_score":0.6445038},"labels":[],"label_agreement":null},{"id":"W3134524119","doi":"10.3390/app11052082","title":"An Intrusion Resistant SCADA Framework Based on Quantum and Post-Quantum Scheme","year":2021,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cistel Technology (Canada); Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Theoretical computer science; Quantum key distribution; Quantum network; Quantum cryptography; Quantum computer; Algorithm; Quantum information; Quantum; Physics; Quantum mechanics","score_opus":0.010367450121774218,"score_gpt":0.24953086704005262,"score_spread":0.2391634169182784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134524119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7803414,0.00017416019,0.2131327,0.0043508653,0.0004936734,0.00013518611,0.00000446428,0.00025590428,0.0011116547],"genre_scores_gemma":[0.82002014,0.000005936622,0.17752202,0.002323711,0.00010644297,0.0000058544038,0.000002551943,0.000008309657,0.0000050264243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973794,0.00010528802,0.000248835,0.0010559188,0.0007186758,0.0004918373],"domain_scores_gemma":[0.9984527,0.00042069063,0.00010584823,0.0007196203,0.00008630956,0.00021478694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008388684,0.0002292087,0.00022725915,0.00016471636,0.0009564289,0.00069184654,0.0010686085,0.00010455221,0.000022095484],"category_scores_gemma":[0.000117743955,0.00018000323,0.00004732555,0.001178435,0.0003475499,0.0001995119,0.00032545417,0.00034390477,0.000017010585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032214433,0.00019751719,0.00021877138,0.000024967168,0.000006148446,0.000067084235,0.00076342246,0.006341842,0.054995164,0.91013956,0.00015010737,0.027063185],"study_design_scores_gemma":[0.00018284784,0.00040976456,0.0035789777,0.0000882197,0.0000028081502,0.000013768592,0.00024462232,0.9382097,0.0059110057,0.050609525,0.00043878486,0.00030996324],"about_ca_topic_score_codex":0.000021710042,"about_ca_topic_score_gemma":0.0000052425457,"teacher_disagreement_score":0.9318679,"about_ca_system_score_codex":0.000019199395,"about_ca_system_score_gemma":0.00027791678,"threshold_uncertainty_score":0.73561746},"labels":[],"label_agreement":null},{"id":"W3134574964","doi":"10.1103/physreva.103.032404","title":"Lanczos recursion on a quantum computer for the Green's function and ground state","year":2021,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Canada First Research Excellence Fund; U.S. Department of State","keywords":"Lanczos resampling; Recursion (computer science); Wave function; Ground state; Quantum algorithm; Function (biology); Quantum; Quantum computer; Physics; Mathematics; Quantum mechanics; Applied mathematics; Statistical physics; Algorithm","score_opus":0.016402005289956806,"score_gpt":0.319144764303804,"score_spread":0.3027427590138472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134574964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11488941,0.13078758,0.7007934,0.048737824,0.0011200951,0.003119545,0.000042469906,0.00036529868,0.00014439439],"genre_scores_gemma":[0.60133946,0.28558898,0.018562919,0.08503268,0.007512063,0.0011095627,0.00011930133,0.0002343992,0.00050064485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971495,0.0003837187,0.0004264258,0.00095505774,0.0005766239,0.0005086406],"domain_scores_gemma":[0.99678206,0.0015038474,0.0002524172,0.0010267387,0.00022340045,0.00021153672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000527842,0.00042217236,0.00095837755,0.000028334474,0.00033368217,0.00014898615,0.00066098006,0.000027700728,0.0000035204366],"category_scores_gemma":[0.00022916298,0.00025703816,0.00056368153,0.00069966126,0.000109049615,0.00019811053,0.00043814868,0.0005080708,0.0000827397],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019371788,0.00049638737,0.0000072135185,0.004399881,0.00007976153,0.0000140122565,0.00013204885,0.000058674064,0.0006286137,0.07462977,0.004895831,0.91463846],"study_design_scores_gemma":[0.0004946662,0.0009591426,0.00157035,0.010317613,0.00023341448,0.00003242697,0.0000021733038,0.63202745,0.0003486,0.17258088,0.18085697,0.000576341],"about_ca_topic_score_codex":0.000013062996,"about_ca_topic_score_gemma":0.0000020084058,"teacher_disagreement_score":0.9140621,"about_ca_system_score_codex":0.00003431049,"about_ca_system_score_gemma":0.00007246581,"threshold_uncertainty_score":0.9999882},"labels":[],"label_agreement":null},{"id":"W3135843080","doi":"","title":"Simple ways to avoid leakage in qubit systems","year":2012,"lang":"de","type":"article","venue":"Verhandlungen der Deutschen Physikalischen Gesellschaft","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Leakage (economics); Simple (philosophy); Qubit; Computer science; Physics; Quantum; Economics; Quantum mechanics","score_opus":0.021477772701911212,"score_gpt":0.25386173670014434,"score_spread":0.23238396399823313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135843080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4200923,0.12943007,0.42189264,0.0019010109,0.016135063,0.004647733,0.00033181623,0.0011642877,0.004405083],"genre_scores_gemma":[0.9814947,0.00025434291,0.008815962,0.001522524,0.0066736345,0.0001773248,0.00009554388,0.00024725578,0.00071870873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99004006,0.00072407635,0.0015751439,0.002097352,0.0016792669,0.003884115],"domain_scores_gemma":[0.9941399,0.0005544424,0.00050010165,0.0026804253,0.00030276942,0.001822357],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002339886,0.0015437844,0.0016618869,0.00096914265,0.0006443017,0.0011167362,0.0032192853,0.0006675444,0.00012885602],"category_scores_gemma":[0.00014703984,0.0015152163,0.0005426122,0.0029101777,0.0001748262,0.0014373561,0.0023708264,0.0018115938,0.00431213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010405157,0.011900766,0.083292514,0.005003913,0.00855076,0.0012959375,0.1676277,0.3280574,0.048928548,0.10472296,0.1826235,0.056955475],"study_design_scores_gemma":[0.0032628311,0.0007243685,0.014310431,0.0010786806,0.00068264746,0.00009374199,0.00038214546,0.61150247,0.007988311,0.0010653976,0.35468307,0.004225903],"about_ca_topic_score_codex":0.0013898576,"about_ca_topic_score_gemma":0.000060601167,"teacher_disagreement_score":0.5614024,"about_ca_system_score_codex":0.00033229185,"about_ca_system_score_gemma":0.00033477283,"threshold_uncertainty_score":0.9999202},"labels":[],"label_agreement":null},{"id":"W3136521765","doi":"10.1007/s11128-021-03034-y","title":"Absolutely maximally entangled states in tripartite heterogeneous systems","year":2021,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Fundamental Research Funds for the Central Universities; Innovative Research Group Project of the National Natural Science Foundation of China","keywords":"Connection (principal bundle); Cluster state; Quantum computer; Homogeneous; MAGIC (telescope); Quantum; Construct (python library); Computer science; Mathematics; Combinatorics; Physics; Quantum mechanics; Computer network","score_opus":0.010221713328830677,"score_gpt":0.22850266331781707,"score_spread":0.2182809499889864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136521765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32305837,0.0011843728,0.67317253,0.000592923,0.00068868935,0.00019234032,0.000006656413,0.00038359678,0.0007205324],"genre_scores_gemma":[0.9878278,0.000034497654,0.011495194,0.00050611974,0.000048827595,0.000017426912,0.00003439584,0.000009115397,0.000026649182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826425,0.00007282357,0.00066051574,0.00023425235,0.00036455528,0.00040358547],"domain_scores_gemma":[0.99909526,0.000052307892,0.00026003804,0.0002942394,0.00020821052,0.00008996361],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003671891,0.00017670602,0.00022339736,0.0002520299,0.00019070136,0.0010510554,0.00042049427,0.000070279355,0.000005477285],"category_scores_gemma":[0.00004157707,0.00016656247,0.00005438556,0.0007814963,0.000024453288,0.0019269258,0.00017414078,0.00020446582,0.000059666665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030318488,0.00017053817,0.0004460259,0.00084014045,0.000029107568,0.00025779143,0.01820855,0.48791358,0.0003901225,0.017481374,0.00029962076,0.47393283],"study_design_scores_gemma":[0.00043223996,0.000036885634,0.00029381597,0.00017757247,0.00000239145,0.00023611437,0.0002587626,0.9901576,0.00074238586,0.0011614772,0.0062825596,0.00021818258],"about_ca_topic_score_codex":0.00003635651,"about_ca_topic_score_gemma":0.000007576054,"teacher_disagreement_score":0.6647694,"about_ca_system_score_codex":0.000067461915,"about_ca_system_score_gemma":0.00023888306,"threshold_uncertainty_score":0.99998593},"labels":[],"label_agreement":null},{"id":"W3138627590","doi":"10.1103/physrevd.104.034501","title":"SU(2) lattice gauge theory on a quantum annealer","year":2021,"lang":"en","type":"article","venue":"Physical review. D/Physical review. D.","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lattice gauge theory; Hamiltonian lattice gauge theory; Lattice field theory; Physics; Lattice QCD; Gauge fixing; Gauge theory; Theoretical physics; Quantum simulator; Lattice model (finance); Quantum annealing; Quantum mechanics; Quantum; Quantum chromodynamics; Gauge boson; Quantum computer","score_opus":0.01617066096798632,"score_gpt":0.3875132363573431,"score_spread":0.3713425753893568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138627590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60867774,0.29988018,0.014558338,0.044758465,0.0017325821,0.003063789,0.000099548146,0.0014955151,0.025733866],"genre_scores_gemma":[0.68311346,0.19526392,0.008720591,0.10610424,0.005292749,0.0004665774,0.0001375681,0.000293493,0.00060739444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994076,0.0013555967,0.00077274546,0.001590521,0.0012058513,0.000999275],"domain_scores_gemma":[0.99467003,0.0017761361,0.00029294085,0.0023624855,0.0003472512,0.00055114465],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009960926,0.0007662285,0.00185847,0.000059770115,0.00028947182,0.00019639733,0.0017932904,0.0000585488,0.000026340751],"category_scores_gemma":[0.0014588449,0.0005728576,0.0012714016,0.0017832478,0.00015889488,0.00031879914,0.0007959738,0.0011584338,0.0016952212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007714803,0.001193324,0.00003225726,0.0036958456,0.00007860979,0.00014841733,0.0001156221,0.000044459073,0.0016644486,0.85196155,0.008535287,0.13252246],"study_design_scores_gemma":[0.000621464,0.0007051681,0.0011725649,0.028519522,0.00046266144,0.000121158715,0.000006049804,0.10835443,0.0055840644,0.5629516,0.28962857,0.0018727086],"about_ca_topic_score_codex":0.0000059292383,"about_ca_topic_score_gemma":6.933735e-7,"teacher_disagreement_score":0.2890099,"about_ca_system_score_codex":0.00007017737,"about_ca_system_score_gemma":0.00021612727,"threshold_uncertainty_score":0.9996723},"labels":[],"label_agreement":null},{"id":"W3139445264","doi":"10.1103/prxquantum.3.020323","title":"Real-Time Evolution for Ultracompact Hamiltonian Eigenstates on Quantum Hardware","year":2022,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Air Force Research Laboratory; Chemical Sciences, Geosciences, and Biosciences Division; Advanced Scientific Computing Research; Basic Energy Sciences; National Aeronautics and Space Administration; Office of Science; Ames Research Center; U.S. Department of Energy","keywords":"Hamiltonian (control theory); Unitary transformation; Eigenvalues and eigenvectors; Ising model; Excited state; Quantum; Quantum phase estimation algorithm; Statistical physics; Physics; Algorithm; Computer science; Applied mathematics; Quantum mechanics; Quantum computer; Mathematics; Mathematical optimization; Quantum simulator","score_opus":0.011881073171087844,"score_gpt":0.24461018031613532,"score_spread":0.23272910714504746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139445264","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7366188,0.00029787168,0.25061965,0.004921752,0.0029893173,0.0013707239,0.00032611634,0.0018012564,0.001054491],"genre_scores_gemma":[0.983791,0.000012513567,0.01483807,0.00033255492,0.0002833974,0.00013962296,0.000066605506,0.00005837121,0.00047786263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691623,0.00026265578,0.00043812854,0.0008997354,0.0006513573,0.000831904],"domain_scores_gemma":[0.99806046,0.0004953779,0.000248297,0.0008882373,0.00010688312,0.0002007678],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007882672,0.00036341435,0.00038847353,0.00029931404,0.0013377924,0.00020372539,0.0013855345,0.0000630751,0.00005843977],"category_scores_gemma":[0.00009676114,0.00034442724,0.0002722469,0.00062967837,0.0000613901,0.00020513027,0.00038986377,0.00045169634,0.0001052045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004110181,0.0014390865,0.0007843314,0.00018932829,0.00023553697,0.00021437988,0.0059511904,0.21919766,0.030871613,0.65268373,0.05117512,0.03684701],"study_design_scores_gemma":[0.00058020453,0.0011778772,0.003724043,0.000033181255,0.000012034836,0.00008025273,0.000080382604,0.9468244,0.00051982934,0.03408841,0.012393072,0.00048631863],"about_ca_topic_score_codex":0.0001383468,"about_ca_topic_score_gemma":0.000003723176,"teacher_disagreement_score":0.72762674,"about_ca_system_score_codex":0.0002586088,"about_ca_system_score_gemma":0.0002062486,"threshold_uncertainty_score":0.99996233},"labels":[],"label_agreement":null},{"id":"W3139827858","doi":"","title":"Quantum Distributed Consensus","year":2007,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Impossibility; Computer science; Consensus; Theoretical computer science; Asynchronous communication; Notation; Distributed algorithm; Quantum computer; Distributed computing; Uniform consensus; Byzantine fault tolerance; Quantum; Fault tolerance; Mathematics; Multi-agent system; Quantum mechanics; Artificial intelligence; Physics","score_opus":0.011167425647714578,"score_gpt":0.24422558522184848,"score_spread":0.2330581595741339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139827858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10709042,0.00003658997,0.8879582,0.00148768,0.00039153008,0.00004700693,0.0000019071801,0.00045359047,0.0025330426],"genre_scores_gemma":[0.8999011,5.3303546e-7,0.09948572,0.0003932153,0.00008571749,3.8110866e-7,0.0000021709661,0.0000045413035,0.0001266543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990258,0.000019379382,0.0001762879,0.00025569918,0.00017388951,0.0003489402],"domain_scores_gemma":[0.99923515,0.00018827812,0.000040791863,0.00036847574,0.0000477474,0.00011953764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041742352,0.000099469085,0.000097680764,0.00006263152,0.000117953154,0.00007466397,0.0004856292,0.000039400053,0.000010905564],"category_scores_gemma":[0.000038714017,0.00007741176,0.000049440918,0.00035960946,0.000038533046,0.000033340628,0.00017344553,0.00012655022,0.00006598234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000951639,0.00011310934,0.0007708501,0.000009288333,0.000024213869,0.00031704843,0.00035547905,0.0015914725,0.001444633,0.77716786,0.010189839,0.20800668],"study_design_scores_gemma":[0.00028008304,0.00007625755,0.009897065,0.000008791975,0.0000017935199,0.00015128954,0.000024791147,0.94975024,0.0027463676,0.014917866,0.021903632,0.00024182213],"about_ca_topic_score_codex":0.000026534919,"about_ca_topic_score_gemma":0.0000063875837,"teacher_disagreement_score":0.94815874,"about_ca_system_score_codex":0.000013693366,"about_ca_system_score_gemma":0.000027079674,"threshold_uncertainty_score":0.31567597},"labels":[],"label_agreement":null},{"id":"W3145165864","doi":"10.1109/date.2009.5090863","title":"Debugging of Toffoli networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Debugging; Toffoli gate; Computer science; Algorithmic program debugging; Reversible computing; Boolean satisfiability problem; Background debug mode interface; Programming language; Logic gate; Parallel computing; Theoretical computer science; Computer engineering; Algorithm; Quantum; Quantum computer; Quantum gate","score_opus":0.00568152527599272,"score_gpt":0.21634329048689255,"score_spread":0.21066176521089983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145165864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014102533,0.00012690872,0.9789016,0.0012160938,0.0001303987,0.00002841486,5.801329e-8,0.00019132478,0.0053026523],"genre_scores_gemma":[0.8736066,0.0000028052718,0.12571521,0.00053735555,0.000060870832,1.6360148e-7,1.5410407e-7,0.0000015211887,0.00007528814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994686,0.00001531752,0.00011497511,0.00014423527,0.00009631842,0.00016054249],"domain_scores_gemma":[0.99959844,0.00004745258,0.00003686575,0.00025523355,0.000021974327,0.000040025912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010284145,0.000060235,0.00008982656,0.000041237075,0.000042975073,0.000031074163,0.0004166871,0.00002288926,0.000005307459],"category_scores_gemma":[0.000008741689,0.00004600682,0.00004212647,0.00021656185,0.000010378168,0.00006599274,0.000068137866,0.00006942099,0.0000027920523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.246793e-7,0.000027238657,0.000058054207,0.000001429035,0.000003932588,0.0000053703893,0.00013456344,0.056517,0.00017962464,0.0837766,0.0007138319,0.85858154],"study_design_scores_gemma":[0.00006457264,0.00006412817,0.0024765613,0.000010433331,9.0301256e-7,0.000010291131,0.0000012538309,0.9894925,0.0005653858,0.0065988805,0.00065025775,0.000064870255],"about_ca_topic_score_codex":0.00000605059,"about_ca_topic_score_gemma":5.350707e-7,"teacher_disagreement_score":0.9329755,"about_ca_system_score_codex":0.0000033531594,"about_ca_system_score_gemma":0.000013257507,"threshold_uncertainty_score":0.18761036},"labels":[],"label_agreement":null},{"id":"W3145237045","doi":"10.1103/physrevlett.90.249804","title":"Wu<i>et al.</i>Reply:","year":2003,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Physics; Theoretical physics; Philosophy; Mathematical physics","score_opus":0.012237412770975344,"score_gpt":0.2762652595466065,"score_spread":0.2640278467756312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145237045","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050098833,0.011816718,0.44040322,0.4936529,0.00075806683,0.00053889066,0.0000022934155,0.00058088475,0.0021481833],"genre_scores_gemma":[0.06894427,0.0008322369,0.021395365,0.90872616,0.00006153822,0.000014821117,0.0000011199529,0.000013626164,0.000010864658],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857557,0.00022062454,0.00017339051,0.00043119735,0.0002895056,0.0003097191],"domain_scores_gemma":[0.9990117,0.0001572983,0.000076115975,0.00062462874,0.000020792178,0.000109496184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003462221,0.000173684,0.00028544644,0.0000249688,0.000076690805,0.000072463496,0.0005647462,0.0000020714265,0.0000072422695],"category_scores_gemma":[0.00008929704,0.00013368012,0.00018539994,0.00037380622,0.00003702404,0.00014287549,0.00011321005,0.00024274159,0.00016127974],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001865883,0.0004958087,0.00011442365,0.0007516373,0.00008729042,0.00013996412,0.0006363493,0.0038779136,0.012752234,0.117009886,0.712857,0.15127562],"study_design_scores_gemma":[0.00011900539,0.000034154087,0.000118223106,0.00049196644,0.000009523896,0.000030928706,4.407826e-7,0.043311622,0.00030885456,0.0018963375,0.9534112,0.00026771362],"about_ca_topic_score_codex":0.000003535226,"about_ca_topic_score_gemma":1.0184751e-7,"teacher_disagreement_score":0.41900787,"about_ca_system_score_codex":0.000014079929,"about_ca_system_score_gemma":0.000025509147,"threshold_uncertainty_score":0.54513174},"labels":[],"label_agreement":null},{"id":"W3145958631","doi":"10.1109/focs52979.2021.00079","title":"Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms","year":2022,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Computer science; Algorithm; Boolean function; Discrete mathematics; Combinatorics; Mathematics","score_opus":0.05733363830452176,"score_gpt":0.25411642980619165,"score_spread":0.19678279150166988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145958631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05734705,0.0003013609,0.9331958,0.0026461382,0.0007408075,0.00042542533,0.000041217492,0.0008396675,0.004462509],"genre_scores_gemma":[0.940822,0.0000035125056,0.0573479,0.0013481712,0.00010601566,0.000026932956,0.000023069375,0.000019384246,0.00030302367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974063,0.00017731717,0.00035681154,0.0006592315,0.00074641017,0.00065390323],"domain_scores_gemma":[0.99881274,0.00009919832,0.00012353745,0.0006795391,0.00006026564,0.00022472747],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00082678895,0.00025440843,0.00033973623,0.00016478046,0.0013046707,0.00025055543,0.0013043976,0.000033875298,0.000097564574],"category_scores_gemma":[0.00002134278,0.00023599125,0.00010648299,0.0005333923,0.00023861359,0.00039997583,0.002703254,0.00049023674,0.000013933743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002677558,0.00038183815,0.0008058887,0.000054572454,0.00011929004,0.00018242201,0.0027382746,0.0035669652,0.00040890477,0.61067015,0.0029239713,0.37812093],"study_design_scores_gemma":[0.00093002396,0.00021563814,0.009068593,0.000005701449,0.000009914647,0.00065924955,0.00006698962,0.9304486,0.000109009394,0.049293052,0.008759892,0.0004333316],"about_ca_topic_score_codex":0.0004804905,"about_ca_topic_score_gemma":0.000033644894,"teacher_disagreement_score":0.9268816,"about_ca_system_score_codex":0.00007297572,"about_ca_system_score_gemma":0.0000972561,"threshold_uncertainty_score":0.99999547},"labels":[],"label_agreement":null},{"id":"W3147201471","doi":"10.1002/qute.202000069","title":"Noise Robustness and Experimental Demonstration of a Quantum Generative Adversarial Network for Continuous Distributions","year":2021,"lang":"en","type":"article","venue":"Advanced Quantum Technologies","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Canadian Institute for Advanced Research; University of Toronto","funders":"Lawrence Berkeley National Laboratory; Office of Naval Research; University of Toronto; Canada Excellence Research Chairs, Government of Canada; Government of Ontario","keywords":"Robustness (evolution); Adversarial system; Generative grammar; Computer science; Quantum; Noise (video); Acoustics; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.010141767497041676,"score_gpt":0.2507777043854726,"score_spread":0.2406359368884309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147201471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29163557,0.0022326994,0.70420825,0.0008702459,0.00032298092,0.00023405408,0.000036227044,0.000450965,0.000009021956],"genre_scores_gemma":[0.7355565,0.000054539683,0.26423597,0.000014959763,0.000041533174,0.0000591644,0.000023472452,0.000008446136,0.0000054412803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998564,0.000047454614,0.0003401788,0.00052736053,0.00014905985,0.00037194043],"domain_scores_gemma":[0.99886215,0.0002478542,0.00020709098,0.00045155414,0.00019486445,0.0000364698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013193664,0.00021316166,0.00035216974,0.00006536619,0.00033136568,0.00007305952,0.00039921416,0.00014172877,6.8603777e-7],"category_scores_gemma":[0.0001971121,0.00019809161,0.000093559756,0.00047107614,0.0002614427,0.0002596265,0.000370852,0.0001775729,3.2909554e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005440228,0.00021970982,0.00017179322,0.000037502432,0.00005918028,0.000026927244,0.00025854065,0.10666772,0.043253835,0.79138947,0.00019614924,0.05766476],"study_design_scores_gemma":[0.00091706635,0.00033137985,0.00011920392,0.00006515027,0.000012008836,0.00004590883,0.0008251282,0.7690592,0.19278792,0.035236645,0.00035269806,0.00024771807],"about_ca_topic_score_codex":0.000004612228,"about_ca_topic_score_gemma":0.0000055208707,"teacher_disagreement_score":0.7561528,"about_ca_system_score_codex":0.000030613923,"about_ca_system_score_gemma":0.000100110374,"threshold_uncertainty_score":0.80779415},"labels":[],"label_agreement":null},{"id":"W3147471615","doi":"10.1109/date.2007.364652","title":"Reversible Circuit Technology Mapping from Non-reversible Specifications","year":2007,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"","keywords":"Construct (python library); Embedding; Computer science; Permutation (music); Reversible computing; Implementation; Electronic circuit; Logic gate; Theoretical computer science; Algorithm; Computer engineering; Engineering; Electrical engineering; Programming language; Artificial intelligence","score_opus":0.029655319356340575,"score_gpt":0.2330331639399194,"score_spread":0.20337784458357883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147471615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041306276,0.00008353736,0.9357753,0.002725407,0.00046605934,0.00010971061,0.0000022115657,0.00052384165,0.019007655],"genre_scores_gemma":[0.50178534,0.000007758102,0.49611542,0.00038106367,0.00020051148,0.000002035004,0.0000041816033,0.000010027548,0.0014937085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860626,0.000012572191,0.0002476972,0.0005065001,0.00019858866,0.0004283512],"domain_scores_gemma":[0.99878174,0.00013454504,0.00008338656,0.00082266936,0.00007331925,0.000104353836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031340856,0.00014294183,0.00015918865,0.0004412934,0.0002719544,0.000091462294,0.0012151535,0.00011512617,0.00007450215],"category_scores_gemma":[0.000025983047,0.00013596028,0.0000678647,0.0014887406,0.000060795002,0.00016881694,0.0003661934,0.00026855365,0.0003226786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005527197,0.00031616897,0.0065146447,0.000025165542,0.00013429632,0.00021048369,0.003442541,0.0016911291,0.054665644,0.32356948,0.023077725,0.5863472],"study_design_scores_gemma":[0.001457468,0.0001788213,0.03662638,0.00018402039,0.000020750895,0.0001315798,0.001280473,0.44977498,0.052100364,0.19572331,0.26100907,0.0015127603],"about_ca_topic_score_codex":0.00010137883,"about_ca_topic_score_gemma":0.000016572832,"teacher_disagreement_score":0.58483446,"about_ca_system_score_codex":0.000049543665,"about_ca_system_score_gemma":0.000054982655,"threshold_uncertainty_score":0.55442995},"labels":[],"label_agreement":null},{"id":"W3147898783","doi":"10.1109/date.2008.4484814","title":"Quantified Synthesis of Reversible Logic","year":2008,"lang":"en","type":"article","venue":"2008 Design, Automation and Test in Europe","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Toffoli gate; Boolean function; Boolean satisfiability problem; Reversible computing; Computer science; Satisfiability; And-inverter graph; Binary decision diagram; Generalization; Logic synthesis; Logic gate; Boolean circuit; Boolean algebra; True quantified Boolean formula; Quantum computer; Theoretical computer science; Quantum; Algorithm; Mathematics; Quantum gate","score_opus":0.029666124859444615,"score_gpt":0.2310510608777906,"score_spread":0.20138493601834598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147898783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31310567,0.00039309336,0.6820236,0.0011174692,0.00023068779,0.00030571275,0.000003744941,0.00044897298,0.0023710788],"genre_scores_gemma":[0.8446455,0.00012512378,0.15488224,0.0001589794,0.000017523122,0.0000031436532,7.196537e-7,0.0000078221055,0.0001589699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906904,0.00014756485,0.00024244454,0.00023750955,0.00015134849,0.00015208873],"domain_scores_gemma":[0.99882555,0.00070566917,0.00010881468,0.00023821888,0.00007764586,0.000044071945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031331068,0.00010245525,0.00016245621,0.00017538808,0.000104697734,0.000026899306,0.0002731031,0.00003622921,0.000007018246],"category_scores_gemma":[0.0005691934,0.000088748275,0.00002136712,0.00072095264,0.00006455554,0.00013992039,0.00007743409,0.000085133426,0.000025530584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008986821,0.00333001,0.0579687,0.00072294334,0.000097678916,0.0019275864,0.020424519,0.09357469,0.056347158,0.08493327,0.031049138,0.64953446],"study_design_scores_gemma":[0.00023822869,0.00011688435,0.08041419,0.000074132695,0.0000029007215,0.00015293436,0.0000047983294,0.912142,0.005212877,0.0005009009,0.0009726047,0.00016754789],"about_ca_topic_score_codex":0.000017870478,"about_ca_topic_score_gemma":7.1872967e-7,"teacher_disagreement_score":0.81856734,"about_ca_system_score_codex":0.000007354608,"about_ca_system_score_gemma":0.000055034096,"threshold_uncertainty_score":0.36190498},"labels":[],"label_agreement":null},{"id":"W3151992605","doi":"10.1109/mdat.2021.3069138","title":"Adaptive Integer Linear Programming Model for Optimal Qubit Permutation","year":2021,"lang":"en","type":"article","venue":"IEEE Design and Test","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Permutation (music); Integer programming; Qubit; Linear programming; Integer (computer science); Computer science; Quantum; Discrete mathematics; Mathematics; Algorithm; Physics; Quantum mechanics; Programming language","score_opus":0.035789568900248515,"score_gpt":0.2640906302935857,"score_spread":0.2283010613933372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151992605","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00963585,0.00011405846,0.9894603,0.00034692316,0.00011707984,0.00020034282,0.000003244519,0.00010909995,0.000013084142],"genre_scores_gemma":[0.38538057,0.0000024593032,0.61430824,0.00010560775,0.000071034774,0.000019601306,0.0000019649378,0.0000069797707,0.000103540224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992226,0.00003165767,0.000119829594,0.0003234565,0.00009964268,0.00020281743],"domain_scores_gemma":[0.9991972,0.0004161644,0.000041735428,0.00014705108,0.00013062634,0.000067228975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001773134,0.0001092021,0.00011285539,0.000037733447,0.00015551655,0.00013720141,0.00015037255,0.000043925276,5.630579e-7],"category_scores_gemma":[0.00008575795,0.00009667078,0.00004484583,0.00014406102,0.00002841339,0.0001189069,0.00004677479,0.0001063972,0.0000024429064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015330445,0.00013603445,0.000022282828,0.000026999194,0.00002150412,0.000045000485,0.0031781008,0.7340863,0.0028941897,0.0050955443,0.00028421034,0.25419456],"study_design_scores_gemma":[0.00024797404,0.0001785184,0.000017479866,0.000027065156,0.000006496278,0.00006141311,0.000027233942,0.99475306,0.0026542237,0.0017457025,0.00014760737,0.00013323754],"about_ca_topic_score_codex":0.000002863939,"about_ca_topic_score_gemma":9.5203023e-7,"teacher_disagreement_score":0.3757447,"about_ca_system_score_codex":0.000010469448,"about_ca_system_score_gemma":0.00009958274,"threshold_uncertainty_score":0.394212},"labels":[],"label_agreement":null},{"id":"W3156963889","doi":"10.1088/1751-8121/ac4393","title":"Universal quantum computation via quantum controlled classical operations","year":2021,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Austrian Science Fund; Österreichischen Akademie der Wissenschaften","keywords":"Quantum computer; Universal set; Quantum gate; Quantum Turing machine; Quantum circuit; Quantum algorithm; Quantum error correction; Quantum network; Quantum information; Qubit; Computer science; Hadamard transform; Theoretical computer science; Quantum; Mathematics; Set (abstract data type); Quantum mechanics; Physics","score_opus":0.007595072268111163,"score_gpt":0.23781375821222472,"score_spread":0.23021868594411357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156963889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16822094,0.000068255285,0.827249,0.0040239873,0.00017029123,0.000065673186,0.0000011664347,0.00002364877,0.00017706997],"genre_scores_gemma":[0.93236053,0.000009629171,0.067179985,0.00016461566,0.00026074718,0.0000010093086,9.379313e-7,0.000009654479,0.0000128946485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983723,0.00023665465,0.00053188903,0.00020905829,0.00042034965,0.00022970312],"domain_scores_gemma":[0.9983383,0.0007876562,0.00013640274,0.00017686795,0.00033775726,0.000223059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004654456,0.00016645995,0.0005479381,0.000050178707,0.0001536711,0.00023702077,0.00027780174,0.00007044993,0.000023861487],"category_scores_gemma":[0.0002252924,0.00011442102,0.0002252354,0.00023445494,0.00031605083,0.00020343115,0.00019003203,0.00040221764,0.000010618775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032779182,0.0003430482,0.0000017077195,0.000021325546,0.00006403626,0.00012276143,0.00037566476,0.0013595875,0.0007438685,0.989824,0.00003790672,0.0070733246],"study_design_scores_gemma":[0.0009205638,0.00013569676,0.0000096673475,0.000043488602,0.000026745027,0.00035343532,0.000029224402,0.5105614,0.0002376479,0.4875941,0.000014120437,0.00007389717],"about_ca_topic_score_codex":2.570289e-7,"about_ca_topic_score_gemma":8.647478e-8,"teacher_disagreement_score":0.7641396,"about_ca_system_score_codex":0.000018828829,"about_ca_system_score_gemma":0.00014349549,"threshold_uncertainty_score":0.46659538},"labels":[],"label_agreement":null},{"id":"W3157359181","doi":"10.18280/jesa.540218","title":"Numerical Simulation of Free Convection in a Three-Dimensional Enclosure Full of Nanofluid with the Existence a Magnetic Field","year":2021,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Robustness (evolution); Control theory (sociology); Computer simulation; Computer science; Enclosure; Control (management); Simulation; Artificial intelligence; Biology","score_opus":0.011440216600123156,"score_gpt":0.23196826117727035,"score_spread":0.2205280445771472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157359181","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7144921,0.0010607577,0.28335604,0.0007163544,0.00016830805,0.000085965854,0.0000014981516,0.00003216672,0.000086845714],"genre_scores_gemma":[0.96903807,0.0000073992987,0.030773593,0.000081390615,0.000057258836,0.000001839461,3.3172017e-7,0.000009505901,0.000030609168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820834,0.0003061137,0.00048950576,0.00021550005,0.00057449454,0.00020604472],"domain_scores_gemma":[0.9982238,0.00060284394,0.0003630618,0.00039605083,0.00035555183,0.000058681617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044043243,0.00014031486,0.0002795368,0.0001110081,0.00013545383,0.00008070922,0.00053573604,0.000050654446,0.000023587723],"category_scores_gemma":[0.00022072431,0.00008926807,0.00009661979,0.0007185556,0.00008813214,0.00015965672,0.00016838155,0.00032845078,0.0000018242533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010952589,0.00029130542,0.0037393149,0.00027182634,0.00008460867,0.0005332653,0.0031780973,0.6534581,0.0132988,0.0023373629,0.00022843588,0.32246935],"study_design_scores_gemma":[0.00042310992,0.0008351772,0.0993579,0.0004176061,0.000011201196,0.0013206257,0.000029208537,0.8915057,0.002657318,0.0033217082,0.000015913301,0.00010447993],"about_ca_topic_score_codex":0.00005231993,"about_ca_topic_score_gemma":0.0000425305,"teacher_disagreement_score":0.32236487,"about_ca_system_score_codex":0.000032168522,"about_ca_system_score_gemma":0.00020267759,"threshold_uncertainty_score":0.3640246},"labels":[],"label_agreement":null},{"id":"W3158452757","doi":"","title":"Quantum Tensor Networks, Stochastic Processes, and Weighted Automata","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Quantum; Automaton; Tensor (intrinsic definition); Theoretical computer science; Mathematics; Physics; Quantum mechanics; Pure mathematics","score_opus":0.051067220768320785,"score_gpt":0.30450299784057544,"score_spread":0.2534357770722547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158452757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025593722,0.00012359637,0.99337703,0.0027382956,0.0006414247,0.00007673455,0.00007312464,0.00009150254,0.00031893427],"genre_scores_gemma":[0.9055713,0.0002220259,0.09344657,0.0004172981,0.00016283104,0.0000070790747,0.00004012436,0.000010693036,0.00012207105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985381,0.00006656429,0.0003266093,0.000503506,0.00032125748,0.00024398896],"domain_scores_gemma":[0.9985175,0.0004880034,0.00010494108,0.00022403963,0.0005382592,0.00012723776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017155269,0.00018484329,0.00017808258,0.00009216658,0.00018798377,0.000596464,0.0003943782,0.0000616633,0.000049458245],"category_scores_gemma":[0.00040713974,0.0001687225,0.000018304785,0.00022446326,0.00014208333,0.00013554678,0.00023169453,0.00022793596,0.000020512563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014899109,0.000063982676,0.000006859074,0.00001192454,0.000017842447,0.000069316804,0.00024956066,0.0016503441,0.00005914039,0.75676405,0.000095305535,0.24099675],"study_design_scores_gemma":[0.00003100885,0.00009090041,0.00009480108,0.00007131253,0.0000049195733,0.000080467544,0.00009500596,0.7678317,0.0001750332,0.23123439,0.00013007123,0.00016042496],"about_ca_topic_score_codex":0.000020089255,"about_ca_topic_score_gemma":0.000045124667,"teacher_disagreement_score":0.9030119,"about_ca_system_score_codex":0.000015913643,"about_ca_system_score_gemma":0.0001770424,"threshold_uncertainty_score":0.6880304},"labels":[],"label_agreement":null},{"id":"W3159267549","doi":"10.22331/q-2022-05-30-727","title":"Quantum Machine Learning with SQUID","year":2022,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Pacific Northwest National Laboratory; Office of Science; University of Washington; Washington Research Foundation; Battelle; Laboratory Directed Research and Development; U.S. Department of Energy","keywords":"MNIST database; Quantum; Scalability; Squid; Variety (cybernetics); Binary number; Quantum computer; Quantum algorithm","score_opus":0.008859587795351396,"score_gpt":0.21295665889552082,"score_spread":0.20409707110016942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159267549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5240277,0.0009880633,0.46619675,0.004521754,0.0012474871,0.00028931026,0.000013056702,0.0014168487,0.0012990606],"genre_scores_gemma":[0.9896675,0.0000062800896,0.009217899,0.00049844035,0.00010664667,0.000028426606,0.000011899698,0.000032145253,0.0004307653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977545,0.00025733825,0.00023483901,0.000598497,0.0006237148,0.0005310679],"domain_scores_gemma":[0.9989677,0.0001294357,0.00014458988,0.0005853747,0.00004164073,0.00013124799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050553476,0.00023365812,0.00023970158,0.00017520483,0.0010838575,0.00014977549,0.0012215241,0.000027937567,0.00010341638],"category_scores_gemma":[0.00002486935,0.0001921141,0.000087469656,0.00077870477,0.00005325097,0.0001502335,0.000902888,0.0008399163,0.000044024608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015135824,0.00057938235,0.00466554,0.00006661719,0.00014089546,0.0011105078,0.005836926,0.36650935,0.001654145,0.5381072,0.0036278255,0.077550255],"study_design_scores_gemma":[0.0003998184,0.000972713,0.00044833205,0.000010711872,0.0000053283575,0.00032994887,0.00007853475,0.9275355,0.00008962798,0.0036385374,0.06617874,0.00031225733],"about_ca_topic_score_codex":0.000116746436,"about_ca_topic_score_gemma":0.0000047688413,"teacher_disagreement_score":0.5610261,"about_ca_system_score_codex":0.000052305193,"about_ca_system_score_gemma":0.00010119023,"threshold_uncertainty_score":0.83362657},"labels":[],"label_agreement":null},{"id":"W3159589884","doi":"10.1103/prxquantum.2.040203","title":"Grand Unification of Quantum Algorithms","year":2021,"lang":"en","type":"preprint","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Center for Ultracold Atoms, Massachusetts Institute of Technology; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Quantum phase estimation algorithm; Quantum algorithm; Algorithm; Quantum Fourier transform; Quantum computer; Quantum; Quantum operation; Computer science; Quantum error correction; Eigenvalues and eigenvectors; Mathematics; Open quantum system; Quantum mechanics; Physics","score_opus":0.020887551383725472,"score_gpt":0.26004171058816555,"score_spread":0.23915415920444008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159589884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1653338,0.002586854,0.82626593,0.0014483909,0.0032998344,0.0004067326,0.00003300119,0.00039240535,0.00023305677],"genre_scores_gemma":[0.91380304,0.000310641,0.085126765,0.00012261143,0.0003503703,0.000038458842,0.000117799726,0.000052184194,0.00007811809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960546,0.00032950338,0.0009233329,0.0013436995,0.00078049494,0.00056840165],"domain_scores_gemma":[0.9961038,0.00023974667,0.00076625485,0.0022377584,0.00046076594,0.00019167973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079453655,0.0005409531,0.00085436134,0.000340428,0.00018149908,0.0004070163,0.0024549277,0.00041532752,0.000016674763],"category_scores_gemma":[0.00014224676,0.0005162708,0.00042486555,0.00067255035,0.00014989375,0.00019079322,0.0024806208,0.001141136,0.000016191554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006736534,0.002315668,0.0008341474,0.0042048423,0.0010152138,0.00051825115,0.019073976,0.12080678,0.00834026,0.4420618,0.004420006,0.39634165],"study_design_scores_gemma":[0.00031266175,0.00010127328,0.0023371442,0.0004629935,0.000035610898,0.0000439067,0.000056206794,0.9659807,0.0025950868,0.026288249,0.0012002261,0.0005859169],"about_ca_topic_score_codex":0.00022344691,"about_ca_topic_score_gemma":0.00000614414,"teacher_disagreement_score":0.84517395,"about_ca_system_score_codex":0.000057739093,"about_ca_system_score_gemma":0.00052537123,"threshold_uncertainty_score":0.99972886},"labels":[],"label_agreement":null},{"id":"W3160288955","doi":"10.1103/physreva.107.062426","title":"Perturbative readout-error mitigation for near-term quantum computers","year":2023,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Oak Ridge National Laboratory; High Energy Physics; Office of Science; U.S. Department of Energy","keywords":"Qubit; Speedup; Quantum computer; Approximation error; Algorithm; Term (time); Matrix (chemical analysis); Round-off error; Word error rate; Error detection and correction; Quantum; Mathematics; Computer science; Quantum mechanics; Physics","score_opus":0.02386304318001796,"score_gpt":0.3627543381067342,"score_spread":0.3388912949267162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160288955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36694166,0.05344649,0.51843625,0.046399016,0.0021009748,0.009006681,0.00015668382,0.0028743173,0.0006379546],"genre_scores_gemma":[0.8632012,0.0596832,0.037736826,0.03119409,0.004629655,0.002290245,0.0006010184,0.00033507362,0.00032868204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574745,0.00041644802,0.000740923,0.0013042096,0.00086104736,0.00092992606],"domain_scores_gemma":[0.9959929,0.0015851036,0.00045963356,0.0012422791,0.00031087612,0.0004092167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071884395,0.00064186845,0.0016080261,0.00007788764,0.0004081986,0.00020502396,0.00161413,0.000050888153,0.0000044211174],"category_scores_gemma":[0.00083903526,0.0004894611,0.0011860966,0.001936121,0.0002066486,0.00040235516,0.0005939074,0.00054516306,0.0006360177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026425781,0.0012826,0.00007320552,0.023643177,0.0002849422,0.00006738131,0.0020223733,0.0006109591,0.0066459696,0.17116274,0.07285802,0.7213222],"study_design_scores_gemma":[0.0003624373,0.0004280857,0.00087555434,0.012313575,0.00015511921,0.000011783846,0.000003836415,0.894561,0.00061728124,0.05682347,0.033125363,0.00072248967],"about_ca_topic_score_codex":0.0000073157553,"about_ca_topic_score_gemma":5.875698e-7,"teacher_disagreement_score":0.89395005,"about_ca_system_score_codex":0.00007621277,"about_ca_system_score_gemma":0.00014796879,"threshold_uncertainty_score":0.9997557},"labels":[],"label_agreement":null},{"id":"W3160699543","doi":"10.1088/1751-8121/acc4f5","title":"Pretty good state transfer in discrete-time quantum walks","year":2023,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Quantum walk; Adjacency matrix; Mathematics; Eigenvalues and eigenvectors; Transfer matrix; Graph energy; Transfer (computing); State (computer science); Adjacency list; Hermitian matrix; Matrix (chemical analysis); Quantum; Discrete mathematics; Combinatorics; Graph; Pure mathematics; Quantum mechanics; Physics; Quantum algorithm; Computer science; Line graph; Algorithm","score_opus":0.005894718040870807,"score_gpt":0.22711241355016407,"score_spread":0.22121769550929327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160699543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7057818,0.00002194487,0.2920747,0.0017357769,0.000066419496,0.00007125903,0.000002828104,0.000039824063,0.0002054449],"genre_scores_gemma":[0.99347097,0.000013903955,0.006308886,0.000060731596,0.00010534722,0.0000014935532,3.8161244e-7,0.000012741612,0.00002553182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985069,0.000120487275,0.00046707407,0.00018878446,0.00038843544,0.00032833044],"domain_scores_gemma":[0.99895054,0.00057057803,0.00006258155,0.00019124533,0.000050746254,0.00017431995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083455927,0.00015719225,0.00039398894,0.00009198266,0.000053454973,0.00011700184,0.00041948608,0.00004916828,0.000014769002],"category_scores_gemma":[0.00007992296,0.00010164504,0.00013835484,0.00041582235,0.00024467413,0.00015832334,0.00015774611,0.00040654434,0.000036398877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017773153,0.00011502636,0.000010927013,0.000044877033,0.000019292524,0.00008934951,0.001110228,0.00018358225,0.00040199186,0.9882633,0.000019701018,0.009723956],"study_design_scores_gemma":[0.00024101973,0.00017727437,0.00012896265,0.00009822672,0.0000060286516,0.0000640981,0.00000995884,0.42418325,0.00029808958,0.5746997,0.000012885747,0.000080499245],"about_ca_topic_score_codex":2.7498666e-7,"about_ca_topic_score_gemma":4.7894456e-8,"teacher_disagreement_score":0.42399967,"about_ca_system_score_codex":0.000010409679,"about_ca_system_score_gemma":0.000038395094,"threshold_uncertainty_score":0.41449642},"labels":[],"label_agreement":null},{"id":"W3160766784","doi":"10.22331/q-2021-09-28-554","title":"Symmetry Protected Quantum Computation","year":2021,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Government of Canada; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Aspen Center for Physics","keywords":"Algorithm; Quantum computer; Conjecture; Computer science; Quantum; Mathematics; Physics; Quantum mechanics; Discrete mathematics","score_opus":0.013285003537232346,"score_gpt":0.24866113776978624,"score_spread":0.23537613423255388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160766784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18173236,0.00038370455,0.8128839,0.0025284295,0.0011134195,0.00016251605,0.0000035974417,0.0006655367,0.0005265528],"genre_scores_gemma":[0.8928236,0.000009857653,0.10615165,0.0005853469,0.00022814778,0.000013406716,0.000018224642,0.000025517431,0.00014427808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978698,0.00021268196,0.00034355815,0.0006714731,0.00042898458,0.0004734956],"domain_scores_gemma":[0.99870163,0.00016797359,0.00013207145,0.00061331067,0.00023431207,0.00015072084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002782578,0.00023013436,0.00026644528,0.00014174808,0.00028540366,0.000300195,0.00061466935,0.00010338234,0.000017041353],"category_scores_gemma":[0.00014102909,0.00021619286,0.00012952063,0.0011535696,0.000047452555,0.00022250114,0.00036722884,0.000371714,0.0001520543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001414143,0.00046437624,0.00032984128,0.00014512881,0.0000995803,0.00082523806,0.0013210351,0.006729182,0.011035331,0.75571793,0.0050093126,0.21830888],"study_design_scores_gemma":[0.00034099305,0.00010038787,0.0024493402,0.000058319314,0.0000056031354,0.00020477007,0.00003360106,0.92864734,0.002735243,0.061981283,0.003137869,0.00030523728],"about_ca_topic_score_codex":0.00002475144,"about_ca_topic_score_gemma":0.000002965729,"teacher_disagreement_score":0.92191815,"about_ca_system_score_codex":0.00003720648,"about_ca_system_score_gemma":0.00020248574,"threshold_uncertainty_score":0.88160884},"labels":[],"label_agreement":null},{"id":"W3161565660","doi":"10.1145/3466132.3466779","title":"The Complex Path to Quantum Resistance","year":2021,"lang":"en","type":"article","venue":"Queue","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Confidentiality; Computer science; Information and Communications Technology; Computer security; Cryptography; Quantum; Path (computing); Internet privacy; Telecommunications; World Wide Web; Computer network","score_opus":0.013823747462747659,"score_gpt":0.2449068541284198,"score_spread":0.23108310666567214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161565660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03874623,0.0011820119,0.893838,0.0578919,0.0014101545,0.00017920756,0.0000074879476,0.00040715962,0.006337855],"genre_scores_gemma":[0.8270464,0.0000324246,0.16284083,0.005060905,0.00039813985,0.000016135058,0.0000036168567,0.000021110573,0.004580466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988719,0.000103303144,0.00015298677,0.00033778025,0.00022740623,0.00030661374],"domain_scores_gemma":[0.9988122,0.00020267656,0.00003787602,0.0007488893,0.00009580038,0.00010253132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023715771,0.00010105995,0.00010601694,0.000020278063,0.0004401022,0.00028970587,0.00081012765,0.000024589282,0.00000632499],"category_scores_gemma":[0.000093920695,0.00007031933,0.000055420463,0.0004406214,0.000029887735,0.000046549227,0.00036316848,0.00014237463,0.000084943415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080470845,0.00005465741,0.0000703499,0.00002130793,0.000020800338,0.00023497865,0.0014808174,0.0010971092,0.004344163,0.8452507,0.07133529,0.07608177],"study_design_scores_gemma":[0.00016746874,0.000060190796,0.0047727213,0.000061034534,0.000002182238,0.00004485829,0.0000566833,0.23703477,0.0016240197,0.034223117,0.72166663,0.00028634886],"about_ca_topic_score_codex":0.000012166851,"about_ca_topic_score_gemma":0.000079917845,"teacher_disagreement_score":0.8110276,"about_ca_system_score_codex":0.000018977542,"about_ca_system_score_gemma":0.000092410904,"threshold_uncertainty_score":0.33849546},"labels":[],"label_agreement":null},{"id":"W3162246162","doi":"10.1016/j.cjph.2021.05.001","title":"Quantum computation: Algorithms and Applications","year":2021,"lang":"en","type":"article","venue":"Chinese Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and Technology, Taiwan","keywords":"Quantum computer; Computer science; Quantum algorithm; Quantum; Exploit; Quantum sort; Computation; Quantum information; Quantum technology; Algorithm; Theoretical computer science; Quantum network; Open quantum system; Quantum mechanics; Physics","score_opus":0.009882405269339123,"score_gpt":0.26307626592435435,"score_spread":0.2531938606550152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162246162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060057603,0.00083664013,0.93785185,0.0008202744,0.0002832318,0.00003325301,0.0000014125781,0.000023266359,0.00009249129],"genre_scores_gemma":[0.78998315,0.00006622521,0.20797919,0.00028825426,0.0016418159,0.0000015421313,0.0000023239525,0.000011838456,0.000025664784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992137,0.000045124318,0.00025186996,0.00015032453,0.00022281364,0.00011614979],"domain_scores_gemma":[0.99905974,0.00013521983,0.00021200148,0.0001754867,0.00032002645,0.00009749949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014631911,0.00011073335,0.00020557002,0.000039049206,0.00012512304,0.00013639861,0.00028400915,0.000024932062,0.0000010759384],"category_scores_gemma":[0.000022064456,0.000080727536,0.00008987754,0.00047786935,0.000035429515,0.00022200709,0.00015113008,0.0002193593,0.0000028653621],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000288363,0.00024249201,0.0006557156,0.00004817457,0.0000779386,0.00013039495,0.0013451074,0.025083577,0.001357842,0.048565853,0.0003817234,0.9221083],"study_design_scores_gemma":[0.00044366135,0.00007573309,0.0036287769,0.000037567785,0.000011548831,0.00090899423,0.000030610663,0.7648091,0.00046273478,0.22772413,0.0017113499,0.00015578796],"about_ca_topic_score_codex":7.346494e-7,"about_ca_topic_score_gemma":1.8951415e-7,"teacher_disagreement_score":0.9219525,"about_ca_system_score_codex":0.000010447787,"about_ca_system_score_gemma":0.00011145752,"threshold_uncertainty_score":0.32919732},"labels":[],"label_agreement":null},{"id":"W3163465248","doi":"10.1038/s42256-022-00509-0","title":"Neural Error Mitigation of Near-Term Quantum Simulations","year":2022,"lang":"en","type":"article","venue":"Nature Machine Intelligence","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Perimeter Institute; University of Waterloo","funders":"Mitacs; Innovation, Science and Economic Development Canada","keywords":"Quantum computer; Quantum; Computer science; Observable; Artificial neural network; Statistical physics; Quantum error correction; Algorithm; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.010014510924712169,"score_gpt":0.28256420385962877,"score_spread":0.2725496929349166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163465248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5085739,0.0010301593,0.48622036,0.002179588,0.0013756448,0.00022758578,0.000059087786,0.00020766705,0.00012601765],"genre_scores_gemma":[0.9823143,0.0000018319525,0.017099312,0.000434528,0.00006693487,0.0000064248698,0.000024232686,0.000012247563,0.000040214058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983413,0.00014958942,0.00033988917,0.00040608848,0.0005130252,0.00025009355],"domain_scores_gemma":[0.998854,0.00024776373,0.00019223629,0.0005378277,0.000098820725,0.00006939036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002485693,0.00016779247,0.00018443202,0.00014102845,0.00047356333,0.00007567045,0.0012534996,0.000074902586,0.000087564316],"category_scores_gemma":[0.0000973074,0.00015536539,0.00011469372,0.00087602483,0.000075357675,0.00014009207,0.0006346012,0.0011125227,0.0000044397525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013133788,0.00012858168,0.001674693,0.000022947806,0.000017943188,0.000022653809,0.0014849982,0.8479448,0.0011171554,0.03947407,0.00013278206,0.107966274],"study_design_scores_gemma":[0.00006172358,0.00015299466,0.0028446286,0.000009942818,0.000004828549,0.000054365788,0.000016684102,0.984172,0.002056233,0.00963166,0.00083045784,0.00016450221],"about_ca_topic_score_codex":0.00003947451,"about_ca_topic_score_gemma":0.000007780124,"teacher_disagreement_score":0.47374037,"about_ca_system_score_codex":0.000035673667,"about_ca_system_score_gemma":0.00007178842,"threshold_uncertainty_score":0.6335616},"labels":[],"label_agreement":null},{"id":"W3165059638","doi":"10.1142/s0219749921500088","title":"Discrete-time quantum walk on circular graph: Simulations and effect of gate depth and errors","year":2021,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"American Physical Society","keywords":"Controlled NOT gate; Quantum circuit; Quantum walk; Quantum gate; Quantum computer; Quantum error correction; Quantum algorithm; Qubit; Quantum Fourier transform; Quantum network; Quantum mechanics; Physics; Computer science; Topology (electrical circuits); Quantum; Mathematics","score_opus":0.006141066703199078,"score_gpt":0.25107060415430454,"score_spread":0.24492953745110546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165059638","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85508674,0.00013974072,0.14302455,0.0010242566,0.00053318596,0.00006397566,0.0000145234935,0.00001717391,0.00009586852],"genre_scores_gemma":[0.997229,0.00004970915,0.002485808,0.00014515096,0.00006794507,4.1930926e-7,0.000015117023,0.0000042017286,0.000002654041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984762,0.00011217717,0.0005924888,0.000109970715,0.0005828617,0.00012630977],"domain_scores_gemma":[0.9983877,0.00035236814,0.0005668621,0.00014777065,0.00045908324,0.00008623967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044496913,0.00013858314,0.00023381368,0.00037915492,0.00007860125,0.00018900375,0.0003397092,0.000053447347,0.000007171739],"category_scores_gemma":[0.00026236678,0.00010961259,0.00010418128,0.00020181244,0.000054675136,0.001095068,0.00010967921,0.00020779783,0.00000396021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005480059,0.00019636714,0.013161697,0.00031492277,0.0009319118,0.00023973122,0.0070825443,0.5686938,0.004586731,0.09032792,0.00029062523,0.31362572],"study_design_scores_gemma":[0.0008943296,0.0005117458,0.022058768,0.00019837353,0.000018472505,0.00046080284,0.000028622606,0.9666024,0.00212591,0.0067012846,0.00027650024,0.00012282956],"about_ca_topic_score_codex":0.000009904512,"about_ca_topic_score_gemma":0.0000012233248,"teacher_disagreement_score":0.39790854,"about_ca_system_score_codex":0.000023711113,"about_ca_system_score_gemma":0.00006671346,"threshold_uncertainty_score":0.44698718},"labels":[],"label_agreement":null},{"id":"W3165245770","doi":"","title":"Financial Portfolio Identification Using Graph Algorithms on a Quantum Annealern (Presentation Slides)","year":2018,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum annealing; Computer science; Algorithm; Finance; Quantum computer; Portfolio; Quantum algorithm; Quantum; Curse of dimensionality; Speedup; Graph; Theoretical computer science; Artificial intelligence; Parallel computing; Economics","score_opus":0.012666033516162538,"score_gpt":0.26811911640784303,"score_spread":0.2554530828916805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165245770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39760694,0.00020077052,0.6006829,0.00033392085,0.00094762543,0.00009246473,0.0000012483649,0.00008174979,0.000052409036],"genre_scores_gemma":[0.99213576,0.00015525705,0.0056873322,0.00020208095,0.0016550208,0.0000028727338,0.0000032374935,0.000023499697,0.00013496497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630666,0.00015861788,0.00046846576,0.00048471426,0.0005643609,0.0020171693],"domain_scores_gemma":[0.9987869,0.000051565523,0.00039210275,0.00042129328,0.00024420783,0.000103903614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018417959,0.00023173016,0.00019897566,0.00040318872,0.0008756905,0.00034546157,0.000904161,0.0000972968,0.000006766568],"category_scores_gemma":[0.00009028835,0.00020971814,0.00015908119,0.0007952754,0.00008680626,0.00045660353,0.00011867624,0.001267863,0.000047428774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008359034,0.00026747707,0.00037304792,0.000009877888,0.000117815136,0.00004189596,0.0012214275,0.0060587637,0.0041417987,0.5385799,0.0005221645,0.4485823],"study_design_scores_gemma":[0.000450633,0.0006605672,0.0022565883,0.000040451312,0.000014707971,0.0008381546,0.00009799588,0.5693228,0.0009774319,0.42479056,0.00027580446,0.00027428792],"about_ca_topic_score_codex":0.000092448136,"about_ca_topic_score_gemma":0.00005863382,"teacher_disagreement_score":0.59499556,"about_ca_system_score_codex":0.0003567125,"about_ca_system_score_gemma":0.0012442118,"threshold_uncertainty_score":0.8552058},"labels":[],"label_agreement":null},{"id":"W3165437982","doi":"10.1103/prxquantum.2.040332","title":"Fault-Tolerant Quantum Simulations of Chemistry in First Quantization","year":2021,"lang":"en","type":"preprint","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Australian Research Council; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Quantization (signal processing); Quantum; Quantum simulator; Algorithm; Computer science; Scaling; Statistical physics; Quantum computer; Quantum mechanics; Mathematics; Physics; Applied mathematics","score_opus":0.014910438349768278,"score_gpt":0.2518088448890032,"score_spread":0.2368984065392349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165437982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6767113,0.001049544,0.31938332,0.0010412872,0.0011030423,0.0003495737,0.000045424575,0.00021889046,0.000097608754],"genre_scores_gemma":[0.9857194,0.000098365694,0.013681371,0.00006224737,0.00017179316,0.000022421831,0.00016902569,0.00004424733,0.00003114573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962094,0.00018389984,0.0011427535,0.0012338489,0.00066020346,0.0005698899],"domain_scores_gemma":[0.99684715,0.0003836682,0.00067055,0.001632245,0.00032603048,0.00014037469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046772364,0.00052898814,0.0008637254,0.00028359977,0.00016901187,0.00030382414,0.0017327538,0.0004751409,0.00003873522],"category_scores_gemma":[0.00028041832,0.00054910907,0.0003031178,0.0009393409,0.000102798054,0.0001993958,0.001990659,0.0011508623,0.0000062291906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010294315,0.00042700677,0.0012427365,0.0010395659,0.000058595113,0.000077589386,0.0029682936,0.98554164,0.0014135345,0.0047979984,0.0000841145,0.0023386162],"study_design_scores_gemma":[0.00042266725,0.00003269188,0.002948347,0.001096252,0.000017856375,0.000018624583,0.00006457454,0.984874,0.0020761888,0.007566473,0.00032126292,0.000561061],"about_ca_topic_score_codex":0.00040622943,"about_ca_topic_score_gemma":0.00011031606,"teacher_disagreement_score":0.30900806,"about_ca_system_score_codex":0.00010299225,"about_ca_system_score_gemma":0.0005087184,"threshold_uncertainty_score":0.999696},"labels":[],"label_agreement":null},{"id":"W3165990809","doi":"10.14288/1.0103160","title":"Fast Decoders for Topological Quantum Codes","year":2009,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Discrete mathematics; Context (archaeology); Quantum; Topology (electrical circuits); Space (punctuation); Energy (signal processing); Combinatorics; Algorithm; Computer science; Physics; Quantum mechanics","score_opus":0.009003814289285195,"score_gpt":0.19389701805343865,"score_spread":0.18489320376415344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165990809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60583717,0.00006527281,0.39271727,0.0007529466,0.00012317448,0.00012700821,0.000026663167,0.00013596655,0.000214523],"genre_scores_gemma":[0.94956625,0.000022308046,0.049988657,0.00023524404,0.000036796027,1.853575e-7,0.0000060242346,0.0000039665465,0.00014057025],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989634,0.000038210106,0.000105159415,0.00042090772,0.00016886504,0.00030346098],"domain_scores_gemma":[0.99931604,0.000085606305,0.00008907405,0.00028751383,0.00010925761,0.00011249977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017152057,0.000046606827,0.00023020398,0.000036019774,0.00033087746,0.0001557953,0.0008357074,0.00008667795,0.000009215034],"category_scores_gemma":[0.000027095846,0.00014338877,0.00015450055,0.0002283983,0.00014164794,0.0001908648,0.00013219494,0.00011361988,0.000004884614],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004797178,0.000107416825,0.00024572085,0.00001419557,0.000013013724,0.00006339159,0.00023908999,0.0004580343,0.00008585565,0.00033355423,0.0027027295,0.9957322],"study_design_scores_gemma":[0.0007996588,0.0004668658,0.6642371,0.00006432882,0.000010947263,0.00010163509,0.0002881091,0.3122417,0.000002089431,0.020665351,0.0008670201,0.00025519158],"about_ca_topic_score_codex":0.004953173,"about_ca_topic_score_gemma":0.008313368,"teacher_disagreement_score":0.995477,"about_ca_system_score_codex":0.000023613276,"about_ca_system_score_gemma":0.000045694618,"threshold_uncertainty_score":0.7487749},"labels":[],"label_agreement":null},{"id":"W3166259024","doi":"10.1038/s41467-022-33923-4","title":"Single-shot quantum error correction with the three-dimensional subsystem toric code","year":2022,"lang":"en","type":"preprint","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Simons Foundation","keywords":"Error detection and correction; Lattice (music); Computer science; Code (set theory); Toric code; Parity (physics); Quantum; Algorithm; Quantum error correction; Generalization; Parity bit; Quantum computer; Arithmetic; Topology (electrical circuits); Mathematics; Physics; Combinatorics; Quantum mechanics; Mathematical analysis; Set (abstract data type)","score_opus":0.04013611466188823,"score_gpt":0.2888612632282098,"score_spread":0.24872514856632158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166259024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16140857,0.0915951,0.4006084,0.26338476,0.056865737,0.007761635,0.0006695908,0.006621638,0.01108459],"genre_scores_gemma":[0.96937335,0.00003602432,0.028778724,0.0008128665,0.00026848284,0.00021468362,0.00021661718,0.000048241036,0.00025102813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695575,0.0007042385,0.00039078493,0.0007729477,0.00080130657,0.00037494375],"domain_scores_gemma":[0.9915592,0.0010504056,0.0005377377,0.006416023,0.0003370785,0.00009955146],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00076386414,0.00041885808,0.00038227136,0.0002054655,0.0018607434,0.00037213924,0.007951506,0.00042505548,0.0000121405],"category_scores_gemma":[0.000079267076,0.0002891283,0.00020244894,0.0009778233,0.00019874457,0.00010779156,0.007785666,0.0065263594,0.0000095842515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001374595,0.0024345957,0.0025812257,0.0002915502,0.0010711218,0.00008062012,0.0073777074,0.5937581,0.0004518202,0.14397226,0.18407607,0.06376749],"study_design_scores_gemma":[0.00017305076,0.00013249603,0.002419632,0.00014183707,0.000048022946,0.00013777173,0.000081659644,0.89576495,0.000024605606,0.0010956725,0.09954386,0.00043642946],"about_ca_topic_score_codex":0.00016206013,"about_ca_topic_score_gemma":0.0028304257,"teacher_disagreement_score":0.80796474,"about_ca_system_score_codex":0.0002807192,"about_ca_system_score_gemma":0.00041596338,"threshold_uncertainty_score":0.9999561},"labels":[],"label_agreement":null},{"id":"W3166640914","doi":"10.1017/9781316848142.006","title":"Quantum Entropy and Source Coding","year":2018,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Coding (social sciences); Entropy (arrow of time); Quantum; Entropy encoding; Theoretical computer science; Telecommunications; Mathematics; Physics; Statistics; Quantum mechanics; Decoding methods","score_opus":0.014082426522270016,"score_gpt":0.18922553281193077,"score_spread":0.17514310628966076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166640914","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009624487,0.00019216286,0.23199089,0.000062196246,0.0005246551,0.00024984597,0.00003704498,0.0004685527,0.7655122],"genre_scores_gemma":[0.0018123386,0.000059755923,0.0034696383,0.00011353088,0.00033061556,1.7431945e-7,0.0000063739276,0.000036526344,0.994171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983967,0.000041807238,0.00016385286,0.00076622056,0.00027326832,0.00035816614],"domain_scores_gemma":[0.998664,0.000100924466,0.00021099769,0.0006972529,0.000109029796,0.00021774945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012356004,0.00038111545,0.00036533095,0.00019116091,0.00038137028,0.00018496826,0.0010540056,0.00025106355,0.000002270297],"category_scores_gemma":[0.0000075884186,0.00041442283,0.00014225634,0.000012011659,0.0003010115,0.00009483617,0.0014669565,0.00048254905,0.00001583796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011482337,0.0000041022145,7.0536544e-7,0.00004320892,0.000060451224,0.00016929246,0.00020449073,0.000008992841,0.00003862627,0.9803226,0.0119935,0.007142565],"study_design_scores_gemma":[0.00035107048,0.000102895836,0.0000071769077,0.00020063146,0.00004772395,0.00008690395,0.0000098808705,0.09169949,0.00012151627,0.00016711562,0.9067038,0.0005017686],"about_ca_topic_score_codex":0.000039727503,"about_ca_topic_score_gemma":3.9718373e-7,"teacher_disagreement_score":0.98015547,"about_ca_system_score_codex":0.00006596306,"about_ca_system_score_gemma":0.00007038767,"threshold_uncertainty_score":0.9998308},"labels":[],"label_agreement":null},{"id":"W3167778728","doi":"10.1088/2399-6528/ac3a43","title":"Composability of global phase invariant distance and its application to approximation error management","year":2021,"lang":"en","type":"preprint","venue":"Journal of Physics Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Government of Canada","keywords":"Unitary state; Invariant (physics); Tensor product; Mathematics; Bounded function; Norm (philosophy); Discrete mathematics; Computer science; Algorithm; Pure mathematics; Mathematical analysis; Mathematical physics","score_opus":0.028202249240686678,"score_gpt":0.3216259744495578,"score_spread":0.29342372520887117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167778728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05722745,0.0007424047,0.9376176,0.0037177037,0.0001282878,0.00038431006,0.000036682864,0.000019476942,0.00012608431],"genre_scores_gemma":[0.68020093,0.00009101483,0.31958866,0.000045270997,0.0000391578,0.000013486628,0.0000156353,0.0000045815846,0.0000012559248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983731,0.00023035188,0.0006814652,0.00025876073,0.00033478747,0.00012152294],"domain_scores_gemma":[0.9964137,0.00011245804,0.0009827602,0.0018481298,0.0005374104,0.00010553587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005302215,0.00016592754,0.00038000688,0.000048258447,0.00013757219,0.00012834724,0.0022674813,0.000060677994,3.7327598e-7],"category_scores_gemma":[0.000031875537,0.00016270742,0.0001347321,0.0004553061,0.000063024185,0.00017566209,0.0032281925,0.0004502506,6.419746e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026763606,0.00245714,0.00016367149,0.0006765882,0.00029668945,0.000004668737,0.0033251834,0.09774663,0.0016982792,0.5725628,0.00006685225,0.32097474],"study_design_scores_gemma":[0.00039675925,0.0000752806,0.0015844611,0.00037543435,0.000055495173,0.000015893653,0.00008258754,0.95708716,0.0003952008,0.03954554,0.00022065446,0.00016551196],"about_ca_topic_score_codex":0.000011704642,"about_ca_topic_score_gemma":0.0000074466448,"teacher_disagreement_score":0.85934055,"about_ca_system_score_codex":0.000114933246,"about_ca_system_score_gemma":0.00013880376,"threshold_uncertainty_score":0.6635016},"labels":[],"label_agreement":null},{"id":"W3167970125","doi":"10.1103/physreva.104.052602","title":"Phase-state duality in reversible circuit design","year":2021,"lang":"en","type":"preprint","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Toffoli gate; Duality (order theory); Electronic circuit; State (computer science); Qubit; Set (abstract data type); State space; Topology (electrical circuits); Mathematics; Computer science; Phase (matter); Arithmetic; Quantum gate; Algorithm; Discrete mathematics; Quantum mechanics; Combinatorics; Physics; Quantum","score_opus":0.0475357843209835,"score_gpt":0.37748053113333196,"score_spread":0.3299447468123485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167970125","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083319716,0.29212293,0.6110101,0.005642662,0.0010195023,0.0051845983,0.000076918725,0.000703534,0.0009200459],"genre_scores_gemma":[0.43139946,0.5168189,0.031463083,0.016071903,0.0021737404,0.0013449835,0.00027540498,0.0002716422,0.00018090644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99029666,0.0025115763,0.0015600302,0.002821836,0.001541707,0.0012681637],"domain_scores_gemma":[0.99335057,0.0011978338,0.0010008182,0.0034787932,0.0003835563,0.0005884469],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0022373444,0.0012768129,0.0041728443,0.00014337877,0.00017107108,0.00035308237,0.0035756116,0.00013377795,0.000021854243],"category_scores_gemma":[0.0012941718,0.0010899324,0.0019430843,0.0021945557,0.00018417934,0.00038396684,0.003722554,0.003136264,0.00024897404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025000154,0.009749225,0.000027372931,0.09007365,0.00044253547,0.00093457423,0.0016634188,0.0046887537,0.0054467986,0.012057074,0.011968955,0.8629226],"study_design_scores_gemma":[0.0015178755,0.00066756963,0.00018442125,0.15373342,0.0006032134,0.000054080294,0.0000050172703,0.57060623,0.004686923,0.2455977,0.019114187,0.0032293478],"about_ca_topic_score_codex":0.000083300765,"about_ca_topic_score_gemma":0.0000040281784,"teacher_disagreement_score":0.8596933,"about_ca_system_score_codex":0.0003341159,"about_ca_system_score_gemma":0.00094869395,"threshold_uncertainty_score":0.9999984},"labels":[],"label_agreement":null},{"id":"W3168738739","doi":"10.1103/physreva.104.012432","title":"Graph-state representation of the toric code","year":2021,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toric code; Topology (electrical circuits); Quantum convolutional code; Topological graph; Mathematics; Computer science; Topological order; Discrete mathematics; Graph; Quantum; Combinatorics; Algorithm; Linear code; Block code; Physics; Decoding methods; Quantum mechanics","score_opus":0.016804376900735194,"score_gpt":0.34598244991411503,"score_spread":0.3291780730133798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168738739","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44349036,0.3398028,0.16928147,0.037313998,0.0018218616,0.0035116822,0.00007410952,0.000526467,0.004177251],"genre_scores_gemma":[0.83450145,0.15096354,0.005130838,0.008178762,0.0007894213,0.00014905269,0.00001901718,0.000059293037,0.00020864714],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670124,0.0006688922,0.00059790706,0.0007599329,0.0008673582,0.00040468917],"domain_scores_gemma":[0.9968614,0.0005179187,0.00044175173,0.0016963336,0.00031522324,0.00016739406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032583333,0.00032128522,0.0010974684,0.000026148695,0.0001437702,0.000052294858,0.0013292092,0.000019713483,0.000005712535],"category_scores_gemma":[0.000823954,0.00020285476,0.0010526794,0.0025828765,0.000121856756,0.00019429544,0.0007449183,0.0004543797,0.0000671898],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074036116,0.002045484,0.00038622096,0.014434966,0.00022114931,0.000062465995,0.0006990459,0.0006336258,0.03916621,0.101786695,0.014401539,0.8261552],"study_design_scores_gemma":[0.00083342707,0.00039790568,0.008081998,0.04452804,0.0007289802,0.000110844696,0.0000083663945,0.19771574,0.14243008,0.51455045,0.08892591,0.001688264],"about_ca_topic_score_codex":0.00001327322,"about_ca_topic_score_gemma":0.0000023409946,"teacher_disagreement_score":0.82446694,"about_ca_system_score_codex":0.00003080772,"about_ca_system_score_gemma":0.00013770917,"threshold_uncertainty_score":0.8272177},"labels":[],"label_agreement":null},{"id":"W3168786891","doi":"10.17169/refubium-32119","title":"Single-Shot Error Correction of Three-Dimensional Homological Product Codes","year":2021,"lang":"en","type":"article","venue":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Government of Canada; Innovation, Science and Economic Development Canada","keywords":"Robustness (evolution); Algorithm; Computer science; Error detection and correction; Quantum; Computer engineering; Theoretical computer science; Reliability engineering; Physics; Engineering; Quantum mechanics","score_opus":0.061517846825881004,"score_gpt":0.25865149691839107,"score_spread":0.19713365009251005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168786891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.956762,0.00032990216,0.034665525,0.005867132,0.00022127356,0.00030281104,0.000100581216,0.00007609437,0.0016746917],"genre_scores_gemma":[0.9681645,0.00014039554,0.029343465,0.000013732573,0.000036181267,4.8646505e-9,0.000037302747,0.000008120533,0.002256272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712586,0.0006166845,0.00019829518,0.0006360715,0.00096878404,0.00045429717],"domain_scores_gemma":[0.9965574,0.0006634558,0.0003700367,0.0008863859,0.0013446196,0.00017810288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009569893,0.00020929851,0.00059026823,0.0004884667,0.00084119115,0.000014084757,0.0021937287,0.00022423109,0.00023506401],"category_scores_gemma":[0.00011806059,0.00023697273,0.00036786214,0.0016561585,0.0019028473,0.00030702053,0.0020658986,0.00085847673,0.0000059417507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008851555,0.019561373,0.025633344,0.002413513,0.0036461588,0.0044615236,0.10071278,0.2369254,0.16991396,0.0146715725,0.040384565,0.37282425],"study_design_scores_gemma":[0.0077660615,0.0053749895,0.075705305,0.0018427126,0.0004978718,0.00029561878,0.08393637,0.7816055,0.011731872,0.0016554816,0.028009411,0.0015788234],"about_ca_topic_score_codex":0.003194583,"about_ca_topic_score_gemma":0.0042007696,"teacher_disagreement_score":0.54468006,"about_ca_system_score_codex":0.00010835643,"about_ca_system_score_gemma":0.0005327285,"threshold_uncertainty_score":0.96634674},"labels":[],"label_agreement":null},{"id":"W3170233616","doi":"10.1088/1367-2630/ac4737","title":"Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes","year":2021,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Quantum computer; Quantum error correction; Valence bond theory; Qubit; Physics; Computation; Quantum algorithm; Quantum; Quantum mechanics; Computer science; Algorithm","score_opus":0.01561173110024905,"score_gpt":0.263959256360435,"score_spread":0.24834752526018594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170233616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32634372,0.001101394,0.67170614,0.00034938118,0.0003896933,0.00002686066,0.0000023975729,0.000017535249,0.00006286347],"genre_scores_gemma":[0.9298782,0.00008654604,0.069250874,0.00015469878,0.0005886135,6.529926e-8,6.184856e-7,0.0000121953235,0.000028197806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983695,0.00017915835,0.0005271984,0.00023074975,0.00043406678,0.0002592918],"domain_scores_gemma":[0.9981659,0.00046570253,0.000588162,0.00030160372,0.00031357247,0.00016504308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005670598,0.00017659176,0.00048042627,0.00006376302,0.00012460616,0.00011536144,0.0005668096,0.00004955398,0.000003288795],"category_scores_gemma":[0.00007746772,0.0001447153,0.00018414766,0.0003541537,0.00008421059,0.00022906424,0.0002582288,0.0004121339,0.000001411241],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031982796,0.0003841184,0.00049627735,0.00012289893,0.00017503732,0.00023361763,0.006572351,0.024812566,0.010860195,0.121241465,0.00067062076,0.83439887],"study_design_scores_gemma":[0.0012631859,0.00071089255,0.0024190915,0.0008497607,0.000058237387,0.0010608773,0.00036933407,0.76484096,0.03654304,0.19087945,0.00063420366,0.00037096773],"about_ca_topic_score_codex":0.000009244497,"about_ca_topic_score_gemma":7.790596e-7,"teacher_disagreement_score":0.8340279,"about_ca_system_score_codex":0.000015861488,"about_ca_system_score_gemma":0.00032647615,"threshold_uncertainty_score":0.5901319},"labels":[],"label_agreement":null},{"id":"W3170369836","doi":"10.22331/q-2021-12-20-606","title":"Improved upper bounds on the stabilizer rank of magic states","year":2021,"lang":"lv","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Stabilizer (aeronautics); MAGIC (telescope); Rank (graph theory); Mathematics; Combinatorics; Physics; Structural engineering; Engineering; Astronomy","score_opus":0.013619103403231757,"score_gpt":0.2393939132046164,"score_spread":0.22577480980138465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170369836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.945349,0.0029316258,0.026034763,0.021153517,0.0030779715,0.000374261,0.00008086824,0.00012729256,0.00087071495],"genre_scores_gemma":[0.99338573,0.0001852361,0.003044352,0.0016720209,0.0003193325,0.0000070166493,0.000012479997,0.000046559526,0.0013272666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964142,0.00056411827,0.0006794633,0.000900593,0.0006520649,0.00078955194],"domain_scores_gemma":[0.9962841,0.0011668478,0.00031771968,0.0017043471,0.0003658261,0.00016116067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008988501,0.00043891798,0.0005444976,0.00010678454,0.00037766475,0.0004289808,0.0012646543,0.00014506251,0.00034826342],"category_scores_gemma":[0.0002575445,0.00029400163,0.00037654335,0.0008913516,0.00036549405,0.00012237948,0.00065415434,0.00074303953,0.0001233933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003787943,0.00336558,0.0015045813,0.0010726317,0.00096595444,0.0006197305,0.033677414,0.012703193,0.04281824,0.7046796,0.022847744,0.17536654],"study_design_scores_gemma":[0.0006347063,0.0005964745,0.0013006077,0.00026056226,0.000035550638,0.000044868877,0.0004968452,0.9458313,0.0116382,0.02448188,0.014247526,0.00043147776],"about_ca_topic_score_codex":0.000116778254,"about_ca_topic_score_gemma":0.0000135286655,"teacher_disagreement_score":0.9331281,"about_ca_system_score_codex":0.000047523572,"about_ca_system_score_gemma":0.00047435943,"threshold_uncertainty_score":0.9999512},"labels":[],"label_agreement":null},{"id":"W3171254339","doi":"10.1016/j.patter.2021.100281","title":"Shattering cancer with quantum machine learning: A preview","year":2021,"lang":"en","type":"article","venue":"Patterns","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Queen's University","keywords":"Computer science; Machine learning; Artificial intelligence; Computation; Quantum; Quantum computer; Disease; Quantum machine learning; Order (exchange); Data science; Medicine; Algorithm","score_opus":0.015596696915421383,"score_gpt":0.24957217435659676,"score_spread":0.2339754774411754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171254339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34184638,0.004039973,0.6491095,0.0040541505,0.0003389504,0.00010349758,0.0000073537194,0.00030445907,0.00019574427],"genre_scores_gemma":[0.98832464,0.0004059099,0.009661327,0.000985819,0.00016542815,0.000023065495,0.0000070155816,0.000022670485,0.0004041321],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998781,0.00009409536,0.00015389107,0.00044459532,0.00021850881,0.00030785886],"domain_scores_gemma":[0.9993368,0.00004816373,0.00007563737,0.0003909082,0.000057372643,0.00009113212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010922388,0.00016448667,0.00020427235,0.00003830668,0.00013620332,0.00017700164,0.00043289037,0.000026282301,0.000114542876],"category_scores_gemma":[0.0000129385635,0.00012437014,0.000059897964,0.00026319028,0.000013868085,0.00010832995,0.0003253831,0.00028566143,0.000026394335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093964345,0.00021005709,0.20645201,0.00076880143,0.00018140336,0.0012789723,0.0037720515,0.0249073,0.0016073658,0.0031641005,0.0002477871,0.75740075],"study_design_scores_gemma":[0.00037887093,0.00012173367,0.018386934,0.00075767335,0.000016854177,0.00026546282,0.000017181756,0.9499988,0.0015517166,0.00020051358,0.027882086,0.0004222012],"about_ca_topic_score_codex":0.00014574378,"about_ca_topic_score_gemma":0.00008429039,"teacher_disagreement_score":0.92509145,"about_ca_system_score_codex":0.000018826508,"about_ca_system_score_gemma":0.00006532045,"threshold_uncertainty_score":0.50716674},"labels":[],"label_agreement":null},{"id":"W3172819695","doi":"10.22331/q-2022-05-13-711","title":"Connectivity constrains quantum codes","year":2022,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"National Science Foundation","keywords":"Low-density parity-check code; Discrete mathematics; Qubit; Computer science; Quantum; Quantum algorithm; Upper and lower bounds; Block code; Quantum computer; Mathematics; Theoretical computer science; Algorithm; Quantum mechanics; Decoding methods; Physics","score_opus":0.014285124567164777,"score_gpt":0.2396014767278608,"score_spread":0.22531635216069604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172819695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62204987,0.00028670317,0.36891514,0.004194874,0.0020788165,0.00023602428,0.000053692922,0.00085741957,0.0013274343],"genre_scores_gemma":[0.9937936,0.0000053179433,0.0049206796,0.0010110072,0.00011741767,0.000032336626,0.000010132104,0.00001854876,0.00009092575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768174,0.000334612,0.00027632085,0.0006334225,0.00052566046,0.0005482583],"domain_scores_gemma":[0.99860215,0.0003394069,0.00014106571,0.0007202502,0.0000489409,0.00014816754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072841434,0.00022653094,0.00028953893,0.0001565851,0.001001283,0.00015452155,0.0013243614,0.00003992785,0.00011058151],"category_scores_gemma":[0.000067154746,0.00022172228,0.00014646472,0.00062235026,0.00012285206,0.00015131787,0.0009879464,0.0005707143,0.000046403766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001386374,0.00031075772,0.00050056196,0.000019185421,0.00004624048,0.0002175368,0.001777603,0.014610392,0.0010828621,0.94210446,0.006264553,0.033051997],"study_design_scores_gemma":[0.00035780953,0.0003188937,0.001189778,0.0000073905244,0.000004866159,0.0002793903,0.00018068918,0.9223307,0.000202655,0.04107347,0.03371542,0.00033893978],"about_ca_topic_score_codex":0.000111109606,"about_ca_topic_score_gemma":0.0000057532898,"teacher_disagreement_score":0.9077203,"about_ca_system_score_codex":0.00007042653,"about_ca_system_score_gemma":0.00016117057,"threshold_uncertainty_score":0.9041572},"labels":[],"label_agreement":null},{"id":"W3174003336","doi":"10.1103/physreva.104.052402","title":"Variational quantum algorithm for molecular geometry optimization","year":2021,"lang":"en","type":"preprint","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Differentiable function; Hamiltonian (control theory); Quantum; Quantum algorithm; Physics; Electronic structure; Algorithm; Wave function; Molecule; Quantum mechanics; Mathematics; Geometry; Mathematical analysis; Mathematical optimization","score_opus":0.013100297649576539,"score_gpt":0.33167076519308153,"score_spread":0.318570467543505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174003336","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010835505,0.13853952,0.8532647,0.0035732798,0.00073096424,0.0023233737,0.00010302867,0.00027550294,0.00010610613],"genre_scores_gemma":[0.009547634,0.18730815,0.78451973,0.011579635,0.0033007348,0.0019442698,0.0015339048,0.00022998554,0.000035937046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99336183,0.0006796336,0.0011901206,0.0023324678,0.0015199921,0.00091595645],"domain_scores_gemma":[0.99437183,0.00091947464,0.001025575,0.0022986827,0.00092311495,0.00046131952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093492167,0.0010955312,0.0028611396,0.00013687764,0.00024447127,0.0004091599,0.0025626246,0.000167667,0.000020038757],"category_scores_gemma":[0.0011923867,0.0009491945,0.0023897623,0.0015052016,0.00010812132,0.00030571216,0.0025705863,0.0015325514,0.000057490637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056691174,0.0026582514,0.0000030179979,0.038117778,0.0006635341,0.000092985654,0.00016616781,0.08171238,0.001031805,0.07751511,0.0050797244,0.79295355],"study_design_scores_gemma":[0.00023733273,0.00014115045,0.000017700393,0.01865634,0.0004533891,0.000016618093,8.969146e-7,0.92646986,0.0005247326,0.04763966,0.0048608016,0.0009815352],"about_ca_topic_score_codex":0.0000141415185,"about_ca_topic_score_gemma":2.1950746e-7,"teacher_disagreement_score":0.84475744,"about_ca_system_score_codex":0.0001583502,"about_ca_system_score_gemma":0.0006171357,"threshold_uncertainty_score":0.99929583},"labels":[],"label_agreement":null},{"id":"W3174045614","doi":"10.1139/cjp-2020-0592","title":"A method to improve quantum state fidelity in circuits executed on IBM’s quantum computers","year":2021,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Universidade Estadual Paulista; Hebrew University of Jerusalem; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Electronic circuit; Quantum computer; Physics; Benchmark (surveying); Fidelity; IBM; Quantum; Quantum circuit; State (computer science); Limit (mathematics); Reduction (mathematics); Computer engineering; Computer science; Algorithm; Quantum error correction; Quantum mechanics; Mathematics; Telecommunications","score_opus":0.015595968143330596,"score_gpt":0.25713899203014856,"score_spread":0.24154302388681798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174045614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20260376,0.00009079367,0.7934027,0.0024291943,0.0012812661,0.00009435035,0.00002508302,0.000017450355,0.000055402936],"genre_scores_gemma":[0.9251836,0.0000031293541,0.0717482,0.0026554025,0.00035830025,0.0000015419662,0.000002301639,0.000023357243,0.000024160097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778783,0.00029988386,0.000546333,0.00041167618,0.0003368527,0.00061743974],"domain_scores_gemma":[0.9977394,0.00024789324,0.00025422173,0.00047941576,0.0003824368,0.00089666725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069769315,0.0002309193,0.00043659037,0.00029356833,0.00013635628,0.00026449125,0.0009227743,0.000057000812,0.0000037376399],"category_scores_gemma":[0.00009760217,0.00022604683,0.00017712508,0.0010778477,0.00003226103,0.00021126708,0.0000915539,0.0006511887,0.00001234469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010879992,0.00012094069,0.0002957995,0.000040321414,0.00008687825,0.0030473415,0.005646296,0.132066,0.003172615,0.03637844,0.003212468,0.815922],"study_design_scores_gemma":[0.001306891,0.0008210587,0.010294509,0.00055710203,0.000016660906,0.0003043994,0.00013545157,0.88524777,0.009322153,0.083287865,0.007941582,0.00076457876],"about_ca_topic_score_codex":0.0019312182,"about_ca_topic_score_gemma":0.001952351,"teacher_disagreement_score":0.8151575,"about_ca_system_score_codex":0.00024832494,"about_ca_system_score_gemma":0.002256365,"threshold_uncertainty_score":0.9217922},"labels":[],"label_agreement":null},{"id":"W3174272245","doi":"10.1109/icccs52626.2021.9449247","title":"Quantum Safe Lightweight Cryptography with Quantum Permutation Pad","year":2021,"lang":"en","type":"article","venue":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Qubit; Mathematics; Quantum computer; Permutation (music); Discrete mathematics; Algorithm; Computer science; Quantum; Quantum mechanics","score_opus":0.024404093474540315,"score_gpt":0.2592100902953238,"score_spread":0.2348059968207835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174272245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050517235,0.00068576535,0.93459296,0.006265359,0.0020404768,0.0002995925,0.000024019322,0.00020722357,0.005367392],"genre_scores_gemma":[0.9692737,0.00048727103,0.028986717,0.000525449,0.0003450475,0.000052849653,0.00009367518,0.000024281337,0.00021101328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969037,0.000552474,0.0006143969,0.00082145917,0.000765654,0.0003423126],"domain_scores_gemma":[0.9968149,0.00029990714,0.00036713984,0.0013167454,0.0010127794,0.00018853387],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004268853,0.00038092054,0.00041416913,0.00032243296,0.00046160855,0.001310885,0.0015844958,0.00012784457,0.00006518422],"category_scores_gemma":[0.000015334743,0.0003240376,0.000121537225,0.00057352224,0.00013034673,0.00046959982,0.0004498191,0.0005022964,0.00006564351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039385108,0.0002688241,0.00058961345,0.000045172663,0.00023137606,0.00006638187,0.0018616904,0.0069513414,0.0004947214,0.9541397,0.0012669852,0.03404478],"study_design_scores_gemma":[0.0007305404,0.00022794868,0.0018312713,0.0005411709,0.000013968258,0.00023087817,0.00020826871,0.98234725,0.00027566147,0.005570329,0.007568169,0.0004545204],"about_ca_topic_score_codex":0.00007226528,"about_ca_topic_score_gemma":0.000015632708,"teacher_disagreement_score":0.9753959,"about_ca_system_score_codex":0.000058784182,"about_ca_system_score_gemma":0.00021226023,"threshold_uncertainty_score":0.99992114},"labels":[],"label_agreement":null},{"id":"W3174770175","doi":"10.4204/eptcs.343.11","title":"Generators and Relations for the Group On(Z[1/2])","year":2021,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Integer (computer science); Mathematics; Group (periodic table); Prime power; Toffoli gate; Dimension (graph theory); Order (exchange); Discrete mathematics; Root of unity; Prime (order theory); Quantum gate; Physics; Quantum computer; Quantum; Quantum mechanics","score_opus":0.004478205023977122,"score_gpt":0.22328358715991878,"score_spread":0.21880538213594167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174770175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10302586,0.00035165402,0.88846934,0.007084263,0.00031361476,0.0002247454,5.4431314e-7,0.00010153837,0.0004284341],"genre_scores_gemma":[0.9104066,0.0000189018,0.08835824,0.0010154275,0.00015998755,0.000025107092,2.576306e-7,0.000007521361,0.00000796753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791765,0.00002057553,0.00020343215,0.0007649924,0.0003640834,0.00072928035],"domain_scores_gemma":[0.99887425,0.0005394328,0.000049686994,0.00027300886,0.00015710863,0.00010651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014133666,0.00015791367,0.0001439439,0.00012859618,0.000722575,0.000575451,0.0012022464,0.00004653749,0.0000031350269],"category_scores_gemma":[0.00021837966,0.00010877206,0.000048719,0.0014012669,0.0008294893,0.0002561955,0.00058492424,0.00041254872,0.0000028360607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032816035,0.000029867622,0.000051987452,0.0000037146265,0.0000033745373,0.000001795418,0.0002998242,0.00041251665,0.00029096176,0.9542026,0.000050359777,0.044649746],"study_design_scores_gemma":[0.00018736914,0.00019688609,0.00072390505,0.000019711179,0.0000024071749,0.000059253518,0.000007713099,0.70877045,0.0014001745,0.2878296,0.000681978,0.00012052369],"about_ca_topic_score_codex":7.012694e-7,"about_ca_topic_score_gemma":0.0000012418806,"teacher_disagreement_score":0.80738074,"about_ca_system_score_codex":0.000093056915,"about_ca_system_score_gemma":0.00022126551,"threshold_uncertainty_score":0.5557536},"labels":[],"label_agreement":null},{"id":"W3176269570","doi":"10.48550/arxiv.2106.09907","title":"The dihedral hidden subgroup problem","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Coset; Dihedral group; Dihedral angle; Mathematics; Quantum Fourier transform; Polynomial; Quantum; Combinatorics; Discrete mathematics; Quantum algorithm; Group (periodic table); Physics; Mathematical analysis; Quantum gate; Quantum mechanics","score_opus":0.030977474977031176,"score_gpt":0.17285805039155866,"score_spread":0.14188057541452748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176269570","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5066508,0.00037142093,0.48821348,0.0008918085,0.0013510594,0.00028665876,0.0000049699834,0.00043777924,0.0017920419],"genre_scores_gemma":[0.9882688,0.0001500585,0.009639427,0.000108689346,0.00019867583,0.0000010141771,0.00000970735,0.000019907398,0.0016037027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976859,0.00024337339,0.00021136357,0.0011848044,0.00014447795,0.0005300893],"domain_scores_gemma":[0.99755317,0.00022907878,0.00022576409,0.0016731715,0.0001541248,0.00016468286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003436428,0.0003414166,0.00029301704,0.000099372104,0.00060290965,0.0007197178,0.003286437,0.0002195406,0.000007889454],"category_scores_gemma":[0.000025293168,0.00028507647,0.00030681104,0.0006012215,0.00014834905,0.00018844701,0.0049591274,0.0010200561,0.000030897827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023614737,0.00018857674,0.0016721488,0.0001482218,0.00032929375,0.0020278296,0.0017959006,0.56303525,0.000054749424,0.37201494,0.001254142,0.057455327],"study_design_scores_gemma":[0.00021465312,0.000037751535,0.001197219,0.00010294398,0.000026659618,0.00002243374,0.000078082274,0.94807136,0.00004711393,0.047888804,0.001889469,0.00042348212],"about_ca_topic_score_codex":0.0001446187,"about_ca_topic_score_gemma":0.000078121855,"teacher_disagreement_score":0.48161802,"about_ca_system_score_codex":0.000107171734,"about_ca_system_score_gemma":0.0002986717,"threshold_uncertainty_score":0.9999601},"labels":[],"label_agreement":null},{"id":"W3176777462","doi":"10.22331/q-2022-06-20-742","title":"Universal quantum circuits for quantum chemistry","year":2022,"lang":"en","type":"preprint","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Qubit; Controlled NOT gate; Universal set; Quantum circuit; Quantum gate; Quantum computer; Toffoli gate; Quantum; Quantum mechanics; Computer science; Quantum algorithm; Physics; Set (abstract data type); Topology (electrical circuits); Algorithm; Quantum error correction; Mathematics; Combinatorics","score_opus":0.01939933209469431,"score_gpt":0.2548814274071303,"score_spread":0.23548209531243602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176777462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12339068,0.0017607899,0.8553894,0.0037927204,0.010130485,0.0015454212,0.00053594174,0.0020679904,0.0013865277],"genre_scores_gemma":[0.97852844,0.00012493662,0.015603351,0.0007328148,0.002042534,0.00043367108,0.0005822873,0.00028391904,0.0016680426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99396133,0.00024112692,0.00091149565,0.002456184,0.001038229,0.0013916285],"domain_scores_gemma":[0.995165,0.00058089825,0.00078027364,0.0027999096,0.00025828663,0.00041563538],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00102146,0.0010067959,0.0010819639,0.0003021747,0.0009037415,0.00059903535,0.0055622743,0.00058156566,0.00018881795],"category_scores_gemma":[0.00019289207,0.0010781164,0.00087479065,0.00063368893,0.00017198292,0.00020979403,0.0056045987,0.0024210815,0.00003958627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014701045,0.0015853887,0.00023415376,0.0043689115,0.0010934096,0.0009924012,0.006976266,0.12326723,0.00615654,0.72907823,0.058070038,0.068030395],"study_design_scores_gemma":[0.0006995569,0.00021978041,0.00012039159,0.0001696408,0.000053371004,0.00007014849,0.00014847706,0.85246783,0.00042021598,0.08462658,0.05977074,0.0012332705],"about_ca_topic_score_codex":0.0001519198,"about_ca_topic_score_gemma":0.0000021225705,"teacher_disagreement_score":0.85513777,"about_ca_system_score_codex":0.00036988137,"about_ca_system_score_gemma":0.0011148026,"threshold_uncertainty_score":0.9998804},"labels":[],"label_agreement":null},{"id":"W3178594889","doi":"10.1109/tqe.2021.3091648","title":"Reducing the Depth of Linear Reversible Quantum Circuits","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Quantum Engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"Agence Nationale de la Recherche","keywords":"Quantum computer; Electronic circuit; Qubit; Computer science; Quantum decoherence; Quantum; Controlled NOT gate; Algorithm; Quantum error correction; Quantum mechanics; Physics","score_opus":0.014849059087429608,"score_gpt":0.22315490175267447,"score_spread":0.20830584266524485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178594889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07816116,0.00022669455,0.91906273,0.00058745453,0.001563972,0.00009002933,0.000005899348,0.00024215273,0.000059880243],"genre_scores_gemma":[0.9849577,0.000047194262,0.014718046,0.00008106275,0.000089163026,0.00000817341,7.6874323e-7,0.000026052561,0.00007183833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850667,0.00005988604,0.00033541283,0.0004064336,0.00032865282,0.0003629305],"domain_scores_gemma":[0.99869734,0.00030631144,0.00007861219,0.0007179009,0.00010642088,0.000093387585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026964882,0.00021179393,0.0002444524,0.00016538416,0.0002602656,0.0000631503,0.0006041683,0.00007700759,0.000010393035],"category_scores_gemma":[0.000024385083,0.00017812755,0.00019698545,0.0009654019,0.000032513068,0.00016044351,0.000009821406,0.0005120161,0.000014924502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019292904,0.00007415917,0.000001301453,0.000053328877,0.000049140446,0.000029394458,0.00062376,0.9546189,0.021151777,0.0036340866,0.00004586133,0.019716408],"study_design_scores_gemma":[0.00017818726,0.00006564541,0.00006076839,0.00015003745,0.000015160113,0.0000989331,0.000038481045,0.88360065,0.114904836,0.00015071791,0.00055105035,0.0001855122],"about_ca_topic_score_codex":0.000034118326,"about_ca_topic_score_gemma":0.000004356166,"teacher_disagreement_score":0.9067965,"about_ca_system_score_codex":0.000037559836,"about_ca_system_score_gemma":0.0001150988,"threshold_uncertainty_score":0.7263831},"labels":[],"label_agreement":null},{"id":"W3179073579","doi":"","title":"Operator and Graph-Theoretic Techniques for Distinguishing Quantum States in the Local Operations and Classical Communication Framework","year":2021,"lang":"en","type":"dissertation","venue":"The Atrium (University of Guelph)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mitacs","keywords":"Operator (biology); Mathematics; Computer science; Theoretical computer science; Theoretical physics; Physics","score_opus":0.009323027198405371,"score_gpt":0.240512138888201,"score_spread":0.23118911168979564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179073579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5145069,0.002116562,0.47503138,0.0074953483,0.000119127166,0.00054687826,0.000024981658,0.00006576539,0.00009310494],"genre_scores_gemma":[0.95595324,0.00051179744,0.043254875,0.000089038294,0.000031651743,0.0000022423428,0.0001041042,0.000008640171,0.00004441524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989872,0.00028538494,0.00014386215,0.00027400162,0.00015971204,0.0001498121],"domain_scores_gemma":[0.998392,0.0008421515,0.00010312714,0.0004916872,0.00013826991,0.00003277576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062950456,0.00014370108,0.00022473678,0.00009275594,0.0006742393,0.00018396572,0.001017429,0.00014120791,0.000001304261],"category_scores_gemma":[0.00011499056,0.00010940527,0.00006720651,0.000321295,0.00027687338,0.0001175868,0.00024195,0.0004877974,1.818466e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010784969,0.00017781502,0.00018180755,0.00052055414,0.000108497145,0.000026184674,0.12739046,0.0016227659,0.00142203,0.786223,0.00068808376,0.081530936],"study_design_scores_gemma":[0.00037606564,0.0002447488,0.015623696,0.0009382064,0.00011514227,0.000026232687,0.040265754,0.8268391,0.00014166911,0.11391277,0.0010934607,0.0004231555],"about_ca_topic_score_codex":0.0003924841,"about_ca_topic_score_gemma":0.0007173832,"teacher_disagreement_score":0.82521635,"about_ca_system_score_codex":0.000015484675,"about_ca_system_score_gemma":0.00007153395,"threshold_uncertainty_score":0.51857716},"labels":[],"label_agreement":null},{"id":"W3179235454","doi":"10.1103/physrevapplied.19.044003","title":"Accurate Methods for the Analysis of Strong-Drive Effects in Parametric Gates","year":2023,"lang":"en","type":"article","venue":"Physical Review Applied","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Institut quantique; Université de Sherbrooke","funders":"Army Research Office","keywords":"Transmon; Floquet theory; Quantum gate; Qubit; Computer science; Computation; Parametric statistics; Quantum computer; Spurious relationship; Controlled NOT gate; Physics; Quantum; Topology (electrical circuits); Electronic engineering; Algorithm; Quantum mechanics; Mathematics; Engineering","score_opus":0.02764744537916712,"score_gpt":0.3897343576918962,"score_spread":0.36208691231272905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179235454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011877094,0.004301717,0.98199195,0.00066760276,0.00006950674,0.00092869735,0.000003206914,0.00009045175,0.00006980187],"genre_scores_gemma":[0.9181594,0.0012559812,0.07979979,0.00031849105,0.000064111984,0.00037585775,0.000008679663,0.0000121328385,0.0000055021314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882776,0.00014621326,0.00025835974,0.0003397937,0.0001647827,0.00026307502],"domain_scores_gemma":[0.9932964,0.0059693465,0.0001539471,0.0005037926,0.00003395872,0.000042545602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009014723,0.00013969428,0.0006350061,0.00021977357,0.000057375404,0.000029628545,0.00075309555,0.000016847596,6.478488e-7],"category_scores_gemma":[0.00028472222,0.00008282807,0.00030956525,0.007209158,0.00003909247,0.000030424477,0.00023346787,0.0001420198,0.000009270526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026352393,0.000058859387,0.000013106546,0.00054151524,0.0002479621,6.669707e-7,0.00016530267,0.045168605,0.00039671693,0.08773325,0.00007288875,0.8655985],"study_design_scores_gemma":[0.00011578046,0.00002849253,0.0043318123,0.00011698919,0.00026514093,9.499403e-8,0.000002643145,0.97960114,0.0005595166,0.014326089,0.0005559537,0.00009631988],"about_ca_topic_score_codex":0.0000069652974,"about_ca_topic_score_gemma":8.741913e-7,"teacher_disagreement_score":0.93443257,"about_ca_system_score_codex":0.000010866741,"about_ca_system_score_gemma":0.000019753297,"threshold_uncertainty_score":0.34637615},"labels":[],"label_agreement":null},{"id":"W3183593395","doi":"10.1103/physreva.105.022606","title":"Quantum private broadcasting","year":2022,"lang":"en","type":"preprint","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Air Force Office of Scientific Research; Ministerio de Ciencia e Innovación; Comunidad de Madrid","keywords":"Plaintext; Encryption; Ciphertext; Key (lock); Quantum cryptography; Broadcasting (networking); Unitary state; Computer science; Logarithm; Quantum; Public-key cryptography; Dimension (graph theory); Mathematics; Theoretical computer science; Discrete mathematics; Computer network; Computer security; Combinatorics; Quantum information; Physics; Quantum mechanics; Law; Political science","score_opus":0.023393533567034976,"score_gpt":0.3548960508667699,"score_spread":0.3315025172997349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183593395","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15950628,0.6134852,0.1871332,0.020326832,0.003851544,0.008473711,0.00020437293,0.0027226552,0.0042962222],"genre_scores_gemma":[0.3886782,0.536508,0.03129367,0.030567268,0.008317415,0.003271408,0.00047799063,0.0006165786,0.00026946256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9904289,0.0014179148,0.0015309849,0.0029639048,0.0022167154,0.0014415692],"domain_scores_gemma":[0.99237776,0.0010919945,0.0015029324,0.0041074473,0.00025720787,0.0006626706],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.0014615697,0.0015149451,0.003918933,0.00013851716,0.00052944495,0.00032372406,0.0060742665,0.00010674293,0.00006869048],"category_scores_gemma":[0.0014005229,0.0012423949,0.0026684948,0.0017871816,0.00019548416,0.00028524888,0.011807548,0.0045614853,0.00047302508],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016022688,0.0034827117,0.00008239459,0.10287593,0.00057835464,0.0004039419,0.00074056326,0.0040885215,0.0023381806,0.18958688,0.021059707,0.6747468],"study_design_scores_gemma":[0.00026882414,0.00036842318,0.00020655115,0.05129415,0.0005458665,0.0000511156,0.0000021361873,0.55009395,0.00039001193,0.2008362,0.19371574,0.0022270244],"about_ca_topic_score_codex":0.000036208407,"about_ca_topic_score_gemma":4.9910375e-7,"teacher_disagreement_score":0.67251974,"about_ca_system_score_codex":0.00023788313,"about_ca_system_score_gemma":0.00041697186,"threshold_uncertainty_score":0.9997599},"labels":[],"label_agreement":null},{"id":"W3183932173","doi":"10.48550/arxiv.2107.09809","title":"Simulating quantum chaos on a quantum computer","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Wilfrid Laurier University","keywords":"Quantum entanglement; Qubit; Quantum computer; Chaotic; Computer science; Quantum; Quantum chaos; Statistical physics; Physics; Theoretical computer science; Quantum mechanics; Quantum dynamics; Artificial intelligence","score_opus":0.04938491397541171,"score_gpt":0.19405435898089754,"score_spread":0.14466944500548584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183932173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4640464,0.000043189502,0.5332847,0.00022309936,0.0015298749,0.0001890521,0.0000068046656,0.00044822594,0.00022862139],"genre_scores_gemma":[0.98958564,0.000031677726,0.009121213,0.0004957898,0.00049736677,7.8439257e-7,0.000025036241,0.000044503344,0.0001980159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960901,0.0003487706,0.0003785567,0.0021986023,0.00024270946,0.0007412432],"domain_scores_gemma":[0.9966053,0.0004062699,0.00040264227,0.0020733653,0.00021951186,0.00029294475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035112153,0.00065259635,0.0006776897,0.00038475494,0.0004053057,0.00051673735,0.0025269417,0.00041169187,0.00002200171],"category_scores_gemma":[0.00004423461,0.0007089172,0.0005026809,0.0008445035,0.000106248306,0.00023014258,0.004245393,0.0015869581,0.00008035207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011960992,0.00014758212,0.00017833301,0.00008189047,0.000089879926,0.00116025,0.0005392829,0.9111265,0.000016123813,0.082183056,0.00015442132,0.0043107206],"study_design_scores_gemma":[0.0004725053,0.00017476118,0.000682339,0.00046868646,0.00003074053,0.000020052741,0.000046297886,0.9834463,0.000048290494,0.013465972,0.00036427355,0.00077977555],"about_ca_topic_score_codex":0.000120012664,"about_ca_topic_score_gemma":0.000010336533,"teacher_disagreement_score":0.5255392,"about_ca_system_score_codex":0.00017105494,"about_ca_system_score_gemma":0.00028413103,"threshold_uncertainty_score":0.9995362},"labels":[],"label_agreement":null},{"id":"W3183975412","doi":"10.1016/b978-0-323-88506-5.50319-3","title":"Building Knowledge Capacity for Quantum Computing in Engineering Education","year":2021,"lang":"en","type":"book-chapter","venue":"Computer-aided chemical engineering/Computer aided chemical engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Workforce; Exploit; Computer science; Subject (documents); Work (physics); Engineering ethics; Quantum computer; State (computer science); Knowledge management; Quantum; Engineering; Political science; Mechanical engineering; Physics; Computer security; World Wide Web","score_opus":0.010752576627347604,"score_gpt":0.21747301813330971,"score_spread":0.2067204415059621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183975412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014679596,0.0016051512,0.97434413,0.00018404235,0.0056903907,0.0009947225,0.000035501096,0.0022857033,0.00018078169],"genre_scores_gemma":[0.029514015,0.000027172062,0.9616811,0.00022843241,0.0072722156,0.000114004455,0.00022349274,0.0006236194,0.00031592877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99103296,0.000034604043,0.0024429732,0.0032659946,0.0008837797,0.0023396793],"domain_scores_gemma":[0.9943707,0.001673971,0.00053554244,0.0018912314,0.0005095046,0.0010190451],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.00068045733,0.002531244,0.002695799,0.0013072742,0.00013923262,0.0007110923,0.0033327362,0.0015962612,0.000011318219],"category_scores_gemma":[0.0002548764,0.0030598254,0.0012611725,0.00085707643,0.00009014524,0.00048491382,0.0028008462,0.0035581824,0.000022847873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016158703,0.00036312902,0.0000014306396,0.0042683263,0.0004413156,0.0001324321,0.0005643414,0.67425466,0.07582228,0.17582397,0.0009765252,0.06733546],"study_design_scores_gemma":[0.0012578128,0.00010723171,0.000006333145,0.00483923,0.00007463655,0.00037620572,8.8061995e-7,0.9467712,0.02470265,0.0010080852,0.017923594,0.0029321152],"about_ca_topic_score_codex":0.000012892651,"about_ca_topic_score_gemma":4.112343e-7,"teacher_disagreement_score":0.2725166,"about_ca_system_score_codex":0.0012508426,"about_ca_system_score_gemma":0.000442066,"threshold_uncertainty_score":0.9996999},"labels":[],"label_agreement":null},{"id":"W3184170950","doi":"10.1016/j.cpc.2021.108102","title":"Computational overhead of locality reduction in binary optimization problems","year":2021,"lang":"en","type":"preprint","venue":"Computer Physics Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"QLT (Canada)","funders":"","keywords":"Quadratic unconstrained binary optimization; Quantum annealing; Locality; Binary number; Computer science; Solver; Simulated annealing; Reduction (mathematics); Mathematical optimization; Optimization problem; Population; Quantum; Quantum computer; Ising model; Theoretical computer science; Algorithm; Mathematics; Statistical physics; Physics; Quantum mechanics","score_opus":0.03319884652111329,"score_gpt":0.2789812256709334,"score_spread":0.24578237914982012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184170950","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007856049,0.00070163334,0.9886702,0.0013397252,0.00064242503,0.000440869,0.000020145973,0.00018119658,0.00014780094],"genre_scores_gemma":[0.31751296,0.000120657634,0.68162876,0.000051681174,0.000118935146,0.000035757963,0.0005087031,0.000018882552,0.0000036645938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972209,0.0005774903,0.00082848495,0.00071030564,0.00039644475,0.00026638157],"domain_scores_gemma":[0.9951907,0.00024834144,0.00059320085,0.0033819994,0.00051040057,0.00007534817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039732645,0.00033129295,0.00054157304,0.00021906174,0.00019466017,0.00025453657,0.0029259587,0.00020421481,0.0000025507063],"category_scores_gemma":[0.000012526195,0.0003845828,0.00022183718,0.0009768407,0.00022229033,0.00030564444,0.007127636,0.0010873532,0.000002767528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013638402,0.00060865475,0.00008063389,0.00015009553,0.0000432661,0.0000015431488,0.0018607626,0.9624754,0.000021183141,0.010145268,0.0000889267,0.024522856],"study_design_scores_gemma":[0.00025820752,0.000032401244,0.0010248565,0.00061421125,0.000011977498,0.000011251718,0.000018692597,0.97387016,0.000017833063,0.023782196,0.000034477445,0.00032374187],"about_ca_topic_score_codex":0.00014762324,"about_ca_topic_score_gemma":0.000007294938,"teacher_disagreement_score":0.3096569,"about_ca_system_score_codex":0.00013392184,"about_ca_system_score_gemma":0.0004900445,"threshold_uncertainty_score":0.9998606},"labels":[],"label_agreement":null},{"id":"W3185109750","doi":"10.37236/10146","title":"Laplacian Fractional Revival on Graphs","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; York University","funders":"","keywords":"Mathematics; Combinatorics; Laplacian matrix; Laplace operator; Hamiltonian (control theory); Discrete mathematics; Graph; Mathematical analysis","score_opus":0.006271930519176048,"score_gpt":0.22671079615421216,"score_spread":0.22043886563503612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185109750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35736972,0.008405964,0.5986497,0.027409183,0.004784757,0.00012084188,0.0000010517513,0.000095933654,0.0031628665],"genre_scores_gemma":[0.9984266,0.00031933177,0.00029329793,0.0005612392,0.00018652667,4.6134562e-7,3.2074232e-7,0.000008534927,0.0002036441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983867,0.00020326336,0.00028948946,0.00014561166,0.000568702,0.00040622306],"domain_scores_gemma":[0.99869466,0.00031484445,0.0002782393,0.00036142807,0.00027750648,0.00007335123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008526306,0.00012307601,0.00019446276,0.00008941659,0.00023091842,0.00010701532,0.0009071446,0.000043424137,0.0000073286465],"category_scores_gemma":[0.00011178901,0.000081586004,0.00018107843,0.0006543963,0.000029823334,0.00012560087,0.000104483035,0.0010969922,0.00001012107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009400126,0.00010527582,0.00002974625,0.000002941496,0.00004857108,0.000054984794,0.00010572057,0.0012328938,0.000080841084,0.9921308,0.0007019735,0.0054968586],"study_design_scores_gemma":[0.00045902372,0.0005099553,0.0004098771,0.00003948837,0.00001431584,0.0012481267,0.000018590677,0.0070383367,0.0011827584,0.9639386,0.025023106,0.00011784755],"about_ca_topic_score_codex":9.183605e-7,"about_ca_topic_score_gemma":7.1603534e-7,"teacher_disagreement_score":0.64105695,"about_ca_system_score_codex":0.00012111874,"about_ca_system_score_gemma":0.0006523418,"threshold_uncertainty_score":0.4765946},"labels":[],"label_agreement":null},{"id":"W3186049801","doi":"10.22331/q-2022-03-30-677","title":"General parameter-shift rules for quantum gradients","year":2022,"lang":"en","type":"preprint","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Quantum algorithm; Quantum; Quantum Fourier transform; Quantum circuit; Computer science; Quantum gate; Algorithm; Quantum phase estimation algorithm; Quantum computer; Function (biology); Mathematics; Mathematical optimization; Quantum error correction; Applied mathematics; Quantum mechanics; Physics","score_opus":0.02561096261543227,"score_gpt":0.2777722477114761,"score_spread":0.2521612850960438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186049801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4655657,0.0009006525,0.5199599,0.001854469,0.009417782,0.0010136581,0.00034585525,0.000796059,0.000145887],"genre_scores_gemma":[0.6758505,0.00010750627,0.31804267,0.0013113514,0.0020348923,0.0010361552,0.0007502006,0.00022829376,0.00063840614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99506366,0.00030933056,0.0007925091,0.0019193949,0.00077811466,0.0011370144],"domain_scores_gemma":[0.99633807,0.0005297957,0.00055690075,0.002186021,0.000101244936,0.00028794323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008338843,0.00076470384,0.00086378836,0.00040281273,0.0007135965,0.0006599073,0.004185245,0.00031948817,0.00004490406],"category_scores_gemma":[0.0001542743,0.00073539437,0.0007537246,0.00031766892,0.00010893247,0.00014419004,0.0048271883,0.0014559898,0.000039826005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008292804,0.00081151846,0.0005027288,0.0008363976,0.00045693733,0.00021244849,0.0037489734,0.060532,0.00008129107,0.8343814,0.016868819,0.081484586],"study_design_scores_gemma":[0.00035128638,0.00027900992,0.0010714615,0.00006614522,0.000025793393,0.000018013598,0.000011931073,0.6825205,0.000036201476,0.29245597,0.022482628,0.0006810775],"about_ca_topic_score_codex":0.00021572324,"about_ca_topic_score_gemma":0.000005950388,"teacher_disagreement_score":0.6219885,"about_ca_system_score_codex":0.00015066954,"about_ca_system_score_gemma":0.0003288602,"threshold_uncertainty_score":0.9995097},"labels":[],"label_agreement":null},{"id":"W3186147327","doi":"10.22331/q-2022-05-09-709","title":"Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction","year":2022,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"University of Toronto; Government of Ontario","keywords":"Computer science; Electronic circuit; Tensor (intrinsic definition); Parallel computing; Contraction (grammar); Tensor contraction; Topology (electrical circuits); Mathematics; Physics; Exact solutions in general relativity; Mathematical analysis; Geometry; Quantum mechanics","score_opus":0.014252872045130134,"score_gpt":0.22668179197463897,"score_spread":0.21242891992950885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186147327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14464262,0.00017211783,0.85078895,0.0021505156,0.00097606366,0.00039784954,0.00003931017,0.00061231805,0.0002202452],"genre_scores_gemma":[0.98868257,0.0000016709432,0.00980013,0.0009934376,0.00029493915,0.000053324075,0.00004350646,0.00003895552,0.00009146597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971448,0.00029005125,0.0003876751,0.000742043,0.0007224961,0.0007129439],"domain_scores_gemma":[0.9981672,0.00042592685,0.0002843234,0.0008430981,0.0001099572,0.00016949982],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00040208027,0.00032292856,0.00034094174,0.00017641434,0.0014202467,0.00021474277,0.00093058415,0.00006190487,0.00008421948],"category_scores_gemma":[0.000030756324,0.00027845264,0.00013356034,0.001011048,0.000080427984,0.0002103677,0.000229932,0.00066932663,0.000033924993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003768934,0.00016753098,0.001593945,0.0000101250225,0.000036365458,0.00007946395,0.00029507696,0.93821526,0.00015102261,0.054178167,0.0012085432,0.0040268023],"study_design_scores_gemma":[0.00087662024,0.0005470266,0.004590393,0.000025008256,0.000018363813,0.00009016199,0.000049121725,0.9672424,0.00001500674,0.009816479,0.016307069,0.00042232533],"about_ca_topic_score_codex":0.00009775102,"about_ca_topic_score_gemma":0.000023087221,"teacher_disagreement_score":0.8440399,"about_ca_system_score_codex":0.00010607315,"about_ca_system_score_gemma":0.00023646385,"threshold_uncertainty_score":0.99996674},"labels":[],"label_agreement":null},{"id":"W3186988600","doi":"10.1140/epjqt/s40507-021-00109-8","title":"SpinQ Gemini: a desktop quantum computing platform for education and research","year":2021,"lang":"en","type":"article","venue":"EPJ Quantum Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum computer; Qubit; Computer science; Algorithm; Software; Quantum; Computational science; Physics; Quantum mechanics; Operating system","score_opus":0.035388462557425705,"score_gpt":0.3403950913603403,"score_spread":0.30500662880291457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186988600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6086606,0.0025469672,0.3775235,0.009131719,0.0010593708,0.000346261,0.000003777201,0.000583071,0.00014472914],"genre_scores_gemma":[0.83214474,0.000088087974,0.16701275,0.0002673903,0.00025551842,0.00004874997,0.000009842786,0.000029391415,0.00014356415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972906,0.000091098875,0.000428429,0.0009888369,0.00033011337,0.00087091676],"domain_scores_gemma":[0.9976455,0.00058546814,0.00013748863,0.00095827953,0.0005393796,0.00013387656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011041504,0.00024375535,0.00036090167,0.00069956103,0.0007339439,0.00024409218,0.001027989,0.00032623144,0.0000048601814],"category_scores_gemma":[0.0005848748,0.00023962598,0.000082547245,0.0017381443,0.00030563603,0.00017880478,0.00089046836,0.00076415914,0.00002304878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005363516,0.00015165527,0.00019064063,0.00006888169,0.000018539908,0.000026411451,0.00060968986,0.00003061428,0.0029301676,0.6445392,0.001162286,0.3502666],"study_design_scores_gemma":[0.0004575653,0.00037909654,0.0004861668,0.00016232468,0.000006799505,0.00063910993,0.0006428439,0.5603057,0.010048199,0.39638162,0.03014663,0.00034392648],"about_ca_topic_score_codex":0.000022265982,"about_ca_topic_score_gemma":0.000009538938,"teacher_disagreement_score":0.56027514,"about_ca_system_score_codex":0.00006547277,"about_ca_system_score_gemma":0.0005540587,"threshold_uncertainty_score":0.9771664},"labels":[],"label_agreement":null},{"id":"W3187258234","doi":"10.1103/physrevresearch.3.043192","title":"Finding the disjointness of stabilizer codes is NP-complete","year":2021,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Simons Foundation","keywords":"Mathematics; Transversal (combinatorics); Constant (computer programming); Hypergraph; Integer (computer science); Multiplicative function; Discrete mathematics; Code (set theory); Hierarchy; Combinatorics; Computer science; Set (abstract data type)","score_opus":0.11834226345369425,"score_gpt":0.4258721883360294,"score_spread":0.30752992488233516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187258234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51893765,0.16412774,0.12017111,0.18380405,0.00073059375,0.0025370554,0.000099060344,0.0003152651,0.009277502],"genre_scores_gemma":[0.98859924,0.0043684505,0.0049951687,0.0014329822,0.00028781206,0.000043911798,0.000003993532,0.00001935029,0.00024907629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970557,0.0007924018,0.00025539997,0.00044114675,0.001008553,0.00044679025],"domain_scores_gemma":[0.9967302,0.001620194,0.000065700675,0.0010532123,0.00043528783,0.0000954012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015636621,0.00012157332,0.00038101332,0.00004018415,0.00026776464,0.00010919073,0.0012931442,0.000016228525,0.00004339321],"category_scores_gemma":[0.0006248249,0.00007169265,0.00020887397,0.0014757,0.00023070628,0.000087353445,0.0011568067,0.0005602544,0.000066316265],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008625692,0.0008688596,0.00026170208,0.0056008734,0.00013189923,0.00009086217,0.004344373,0.00025494688,0.028290754,0.33817297,0.02358814,0.598386],"study_design_scores_gemma":[0.00046630716,0.0003190055,0.0030589348,0.0059631616,0.00003865294,0.00008366302,0.00009669488,0.5437898,0.03319215,0.16947716,0.24286568,0.00064880674],"about_ca_topic_score_codex":0.000020059446,"about_ca_topic_score_gemma":0.0000019207132,"teacher_disagreement_score":0.5977372,"about_ca_system_score_codex":0.000021316315,"about_ca_system_score_gemma":0.00016035707,"threshold_uncertainty_score":0.29235414},"labels":[],"label_agreement":null},{"id":"W3190466713","doi":"10.48550/arxiv.2108.02099","title":"2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Compiler; Qubit; Quantum circuit; Quantum computer; Parallel computing; Quantum gate; Quantum algorithm; Optimizing compiler; Controlled NOT gate; Algorithm; Quantum; Computer engineering; Quantum error correction; Quantum mechanics; Physics","score_opus":0.05758369456895992,"score_gpt":0.21293342265398743,"score_spread":0.1553497280850275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190466713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114543915,0.0001051855,0.8825209,0.00022733152,0.0014895854,0.0005142047,0.00003867936,0.0004260734,0.00013408795],"genre_scores_gemma":[0.96981347,0.0000242403,0.029155085,0.00022016265,0.00029451805,0.0000031010925,0.00008720639,0.000041332052,0.0003608953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967824,0.00020264144,0.00036170072,0.0018233522,0.00018316375,0.0006467417],"domain_scores_gemma":[0.99710834,0.00042501022,0.00033455604,0.0014808807,0.00038852257,0.00026270674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003462928,0.0005290279,0.0006078241,0.00029690334,0.0004055215,0.0003897552,0.0018983918,0.00044663428,0.00001460925],"category_scores_gemma":[0.000046183017,0.0006009588,0.00052852195,0.000670427,0.00015466062,0.00027956805,0.0022149277,0.0008482777,0.000020180953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019512729,0.00011213992,0.00008235726,0.000098773344,0.00009535731,0.0001962678,0.00039356286,0.9685581,0.000010145009,0.020219907,0.000101803904,0.010112126],"study_design_scores_gemma":[0.00073426287,0.0001143964,0.0006214815,0.00018284762,0.000058132537,0.0000105481695,0.00008963399,0.98028576,0.000047150672,0.015603593,0.0015602735,0.00069191214],"about_ca_topic_score_codex":0.00015396801,"about_ca_topic_score_gemma":0.000043976568,"teacher_disagreement_score":0.85526955,"about_ca_system_score_codex":0.00021518442,"about_ca_system_score_gemma":0.00037633395,"threshold_uncertainty_score":0.99964416},"labels":[],"label_agreement":null},{"id":"W3190883097","doi":"10.1364/cleo_at.2021.am1s.6","title":"A Scalable Design for Photonic Quantum Random Number Generators","year":2021,"lang":"en","type":"article","venue":"Conference on Lasers and Electro-Optics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Random number generation; Photonics; Computer science; Scalability; Quantum; Entropy (arrow of time); Quantum information; Algorithm; Physics; Optoelectronics; Quantum mechanics","score_opus":0.02141276961678463,"score_gpt":0.24837670988192406,"score_spread":0.22696394026513944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190883097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16057692,0.00020046973,0.8363586,0.0015881184,0.00032019516,0.00026316615,0.000006568524,0.00012531171,0.00056064845],"genre_scores_gemma":[0.84005636,0.00034676347,0.15779178,0.0010568418,0.00015963615,0.000046061472,0.000011242903,0.000027212043,0.00050409674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831265,0.00010353648,0.00022526585,0.00058175955,0.00019900566,0.00057777786],"domain_scores_gemma":[0.99884063,0.000283537,0.00008029327,0.00040975795,0.00020665023,0.00017915452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030154682,0.0002450338,0.00031678646,0.000051404884,0.00032044586,0.0004184739,0.00035120302,0.000102699865,0.000017989554],"category_scores_gemma":[0.000067126006,0.0002144122,0.000095281466,0.00029283675,0.000060571754,0.00010584025,0.000100077115,0.00024228991,0.000014615019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000326044,0.00044515874,0.000114057395,0.00014061278,0.00022058396,0.00016960867,0.00093985477,0.010362807,0.048679154,0.84153914,0.007515854,0.08954712],"study_design_scores_gemma":[0.0012576774,0.00032298325,0.000010334534,0.000042603082,0.00001680041,0.000053676795,0.000020325298,0.8964551,0.07041426,0.029753953,0.001367874,0.0002844064],"about_ca_topic_score_codex":0.000005090696,"about_ca_topic_score_gemma":0.000002873948,"teacher_disagreement_score":0.8860923,"about_ca_system_score_codex":0.000024784684,"about_ca_system_score_gemma":0.00039518057,"threshold_uncertainty_score":0.87434757},"labels":[],"label_agreement":null},{"id":"W3190942902","doi":"10.1109/te.2022.3144943","title":"Building a Quantum Engineering Undergraduate Program","year":2022,"lang":"en","type":"preprint","venue":"IEEE Transactions on Education","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Université de Sherbrooke","funders":"Accelerated Innovation Research Initiative Turning Top Science and Ideas into High-Impact Values; Division of Undergraduate Education; Institute for Quantum Information and Matter, California Institute of Technology; University of Colorado Boulder; Lincoln Laboratory, Massachusetts Institute of Technology; Office of Science; University of Illinois at Urbana-Champaign; Canada First Research Excellence Fund; University of Oregon; University of Waterloo; University of Southern California; Purdue University; Université de Sherbrooke; University of Sydney; Engineering Research Centers; Harvard University; San José State University; Canadian Institute for Advanced Research; University of Pittsburgh; University of Arizona; SPIE; University of Wisconsin-Madison; U.S. Department of Energy; California Institute of Technology; Massachusetts Institute of Technology; Colorado School of Mines; Ohio State University; National Institute of Standards and Technology; Harvey Mudd College; Imperial College London; National Science Foundation; Yale University","keywords":"Computer science; Quantum information science; Quantum technology; Quantum computer; Quantum; Engineering management; Engineering education; Quantum information; Engineering ethics; Mathematics education; Engineering; Quantum entanglement; Physics; Open quantum system; Mathematics; Quantum mechanics","score_opus":0.011951742626926096,"score_gpt":0.27917947261739917,"score_spread":0.26722772999047306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190942902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026242144,0.00013937964,0.95811355,0.0024583556,0.01139749,0.0006032224,0.000010851972,0.0009453449,0.000089679575],"genre_scores_gemma":[0.7360439,0.000041368494,0.2626481,0.00014013566,0.00023312223,0.0006968985,0.0000146336915,0.00004265547,0.00013920973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980631,0.000093433766,0.0003175715,0.00078237837,0.00039263966,0.000350911],"domain_scores_gemma":[0.99863666,0.00010259979,0.00016165398,0.0009037702,0.00006794278,0.00012735474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021677015,0.00033685745,0.00023778711,0.00049989065,0.00036672133,0.0003406082,0.001005589,0.00013468937,0.000026454783],"category_scores_gemma":[0.0000061341652,0.0003720491,0.00022445021,0.0005556948,0.000019084611,0.00012212883,0.000029534016,0.0014577109,0.000010439738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021409978,0.00051357545,4.9583963e-7,0.000077698955,0.000036254667,0.0000019212684,0.00031963724,0.6731286,0.00009587501,0.0033736154,0.00020059421,0.3222496],"study_design_scores_gemma":[0.00009231732,0.00013683028,0.000060403872,0.00016429051,0.000025747795,0.000025017667,0.000018056,0.9823488,0.00074763945,0.008275597,0.007683092,0.0004222192],"about_ca_topic_score_codex":0.00010666544,"about_ca_topic_score_gemma":0.000003060985,"teacher_disagreement_score":0.70980173,"about_ca_system_score_codex":0.0002822518,"about_ca_system_score_gemma":0.0006924168,"threshold_uncertainty_score":0.99987316},"labels":[],"label_agreement":null},{"id":"W3192652031","doi":"10.48550/arxiv.quant-ph/0504078","title":"Possibility, Impossibility and Cheat-Sensitivity of Quantum Bit String Commitment","year":2005,"lang":"en","type":"article","venue":"Data Archiving and Networked Services (DANS)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Impossibility; Sensitivity (control systems); String (physics); Bit (key); Computer science; Mathematics; Computer security; Political science; Theoretical physics; Physics; Law; Engineering; Electronic engineering","score_opus":0.014745404869167247,"score_gpt":0.25001783586400594,"score_spread":0.2352724309948387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192652031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8733477,0.00049321586,0.12519047,0.00037706963,0.000115219584,0.00017310298,0.00011418883,0.00013070073,0.000058330028],"genre_scores_gemma":[0.97048545,0.00010709404,0.028984139,0.00013134164,0.00020334931,0.0000019105655,0.00006778513,0.0000128651045,0.0000060839325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973959,0.00040966348,0.00045319938,0.0009898002,0.00028273452,0.00046869987],"domain_scores_gemma":[0.99703515,0.0007602826,0.00019324858,0.0017699326,0.000034346245,0.00020704459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001995683,0.00028663425,0.00040408215,0.00008519225,0.00036440458,0.00020014806,0.0012252642,0.0000614211,0.0000013054998],"category_scores_gemma":[0.000021120137,0.00023702782,0.000048016715,0.0002367036,0.00018301127,0.00048616063,0.0032909093,0.00032330916,0.0000014544675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008386442,0.00046713394,0.15893666,0.0009422083,0.00014951962,0.000033985678,0.013229821,0.01660963,0.0038076164,0.003634442,0.00006914951,0.802036],"study_design_scores_gemma":[0.00025344477,0.000066827706,0.17916772,0.0001729462,0.000015420777,0.000037551345,0.000070730224,0.8181821,0.00018860139,0.0014226356,0.00021505692,0.00020698641],"about_ca_topic_score_codex":0.0010822832,"about_ca_topic_score_gemma":0.00096386555,"teacher_disagreement_score":0.801829,"about_ca_system_score_codex":0.000019574454,"about_ca_system_score_gemma":0.000037537426,"threshold_uncertainty_score":0.9665714},"labels":[],"label_agreement":null},{"id":"W3193616061","doi":"10.3204/pubdb-2022-01005","title":"Simulating gauge theories with variational quantum eigensolvers in superconducting microwave cavities","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"QuantERA; Canada First Research Excellence Fund; Austrian Science Fund; Natural Sciences and Engineering Research Council of Canada; European Commission; Research and Innovation Foundation; Alfred P. Sloan Foundation","keywords":"Ansatz; Qubit; Hilbert space; Realization (probability); Quantum; Quantum computer; Computer science; Physics; Gauge theory; Topology (electrical circuits); Quantum mechanics; Theoretical physics; Statistical physics; Mathematics","score_opus":0.03659407030474714,"score_gpt":0.18336733861715074,"score_spread":0.14677326831240362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193616061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66228014,0.00006357926,0.3367242,0.00007888018,0.00036097478,0.000121991165,0.0000073792776,0.00012452484,0.0002383199],"genre_scores_gemma":[0.9773312,0.000016461427,0.022290615,0.00007949001,0.00011767199,6.848796e-7,0.000032429114,0.00002446549,0.00010697454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757314,0.00025762466,0.00027515937,0.0012356183,0.00015753871,0.0005009205],"domain_scores_gemma":[0.99826515,0.0004119795,0.00022804187,0.0007856511,0.00020182147,0.00010737325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036752902,0.00040316823,0.0004334612,0.00031125167,0.00028663772,0.00034682621,0.001063362,0.000224842,0.000015050065],"category_scores_gemma":[0.00006230784,0.00041720754,0.00015722954,0.00074943376,0.00014889736,0.00042811097,0.0015281973,0.0009854139,0.0000038905273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001273347,0.00004901007,0.0038403415,0.00006686186,0.000068671325,0.0006922512,0.0039948625,0.8365076,0.00015126797,0.15409245,0.0000034555178,0.00052050943],"study_design_scores_gemma":[0.00042127163,0.000044152323,0.0014387874,0.00031036476,0.000023817873,0.00002880414,0.0017619651,0.94810224,0.00028393074,0.04703609,0.00001282072,0.0005357722],"about_ca_topic_score_codex":0.0007469101,"about_ca_topic_score_gemma":0.00029676943,"teacher_disagreement_score":0.31505105,"about_ca_system_score_codex":0.00019479061,"about_ca_system_score_gemma":0.0004946526,"threshold_uncertainty_score":0.999828},"labels":[],"label_agreement":null},{"id":"W3194019724","doi":"10.1109/mitp.2021.3086917","title":"Hello Quantum! How Quantum Computing Will Change the World","year":2021,"lang":"en","type":"article","venue":"IT Professional","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Quantum computer; Quantum entanglement; Quantum information; IBM; Quantum technology; Quantum information science; Quantum; Open quantum system; Computer science; Quantum network; Physics; Quantum mechanics","score_opus":0.03323922754132991,"score_gpt":0.29096055353494765,"score_spread":0.25772132599361774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194019724","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17905495,0.0037398792,0.3049633,0.49128804,0.017547045,0.00085503235,0.000023569468,0.00097581267,0.0015523713],"genre_scores_gemma":[0.9573384,0.000017110318,0.021682933,0.01256384,0.0019054833,0.0000265708,0.000017511715,0.00003485391,0.0064133243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972804,0.00041071762,0.0002874583,0.0006836691,0.0006943785,0.000643347],"domain_scores_gemma":[0.9980173,0.0006434846,0.00018761067,0.0008065986,0.00019280265,0.00015218124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006382778,0.0002796962,0.00027474124,0.00011235989,0.00092440256,0.0003437453,0.001304798,0.000087233915,0.00005586973],"category_scores_gemma":[0.000091570866,0.00018155637,0.00017012951,0.0010023897,0.00010196739,0.0003707423,0.0014021854,0.00076184655,0.000056670568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023965447,0.00066245504,0.0018029858,0.00016413658,0.00013993535,0.0007971329,0.011621897,0.00108226,0.001973119,0.58193845,0.105471805,0.29432184],"study_design_scores_gemma":[0.00034185278,0.000041424446,0.0044061956,0.00038364457,0.0000070598894,0.00014694051,0.00026713804,0.8603713,0.000593042,0.010126944,0.12295348,0.00036095694],"about_ca_topic_score_codex":0.000012250898,"about_ca_topic_score_gemma":0.000033595075,"teacher_disagreement_score":0.85928905,"about_ca_system_score_codex":0.00003472141,"about_ca_system_score_gemma":0.00023425315,"threshold_uncertainty_score":0.74036545},"labels":[],"label_agreement":null},{"id":"W3194643087","doi":"10.3390/quantum4020012","title":"Assessing the Precision of Quantum Simulation of Many-Body Effects in Atomic Systems Using the Variational Quantum Eigensolver Algorithm","year":2022,"lang":"en","type":"article","venue":"Quantum Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Electronics and Information technology; Core Research for Evolutional Science and Technology; University of Toronto; Compute Canada; Department of Science and Technology, Ministry of Science and Technology, India; Government of Ontario","keywords":"Quantum computer; Coupled cluster; Full configuration interaction; Computer science; Quantum; Quantum algorithm; Qubit; Algorithm; Quantum simulator; Field (mathematics); Context (archaeology); Realization (probability); Computational science; Quantum mechanics; Physics; Mathematics; Configuration interaction","score_opus":0.018272943565676967,"score_gpt":0.2920363369461006,"score_spread":0.2737633933804236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194643087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46275675,0.00040611372,0.5346435,0.00007207506,0.0016159053,0.00045207035,0.0000039466177,0.000040292187,0.0000093693925],"genre_scores_gemma":[0.9933693,0.0000035294527,0.0063798493,0.00003617248,0.00013406813,0.00003106109,0.000009295815,0.000028929348,0.000007801171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496263,0.0011245289,0.0014117828,0.00066173094,0.0014028504,0.00043648828],"domain_scores_gemma":[0.9949632,0.0019669677,0.0016132711,0.0011882831,0.00021023201,0.00005804692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004064936,0.0002879658,0.0005177549,0.0003076839,0.0006642645,0.00020383483,0.00087795214,0.00008729225,0.0000069312114],"category_scores_gemma":[0.0002509264,0.00019398563,0.00020851001,0.0012320117,0.00011281054,0.0003735151,0.00076209067,0.00055537414,6.7420683e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008511278,0.00015450623,0.0015396227,0.00007102942,0.00004039728,0.00015852059,0.0011872522,0.9630337,0.0019747326,0.027405465,0.000023073038,0.004403199],"study_design_scores_gemma":[0.00024690782,0.00013084317,0.01613249,0.00016403603,0.00002677618,0.0004604905,0.00019997085,0.96704584,0.0001895551,0.015040287,0.00014576985,0.00021705739],"about_ca_topic_score_codex":0.0005457577,"about_ca_topic_score_gemma":8.4065687e-7,"teacher_disagreement_score":0.5306125,"about_ca_system_score_codex":0.00016108697,"about_ca_system_score_gemma":0.00035973804,"threshold_uncertainty_score":0.79105043},"labels":[],"label_agreement":null},{"id":"W3194659744","doi":"10.1145/3464905","title":"The complex path to quantum resistance","year":2021,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Path (computing); Computer science; Resistance (ecology); Quantum; Computer network; Physics; Quantum mechanics; Biology","score_opus":0.03888506530944093,"score_gpt":0.29137701178787145,"score_spread":0.25249194647843054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194659744","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02112726,0.005247809,0.033580218,0.93477607,0.00053752493,0.00028762483,0.000014841472,0.00014387496,0.0042848014],"genre_scores_gemma":[0.47913024,0.0001400594,0.5193228,0.0009431434,0.00002233701,0.000011119083,0.0000017486349,0.0000066703765,0.00042184803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990261,0.00027917724,0.00020336256,0.00015748269,0.00017974939,0.00015412306],"domain_scores_gemma":[0.9620036,0.00079572725,0.000101056976,0.036885362,0.00017573398,0.00003854314],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00035099412,0.000071296214,0.0000957731,0.000017772278,0.00091905537,0.00010604084,0.041799966,0.00001849223,0.0000012168869],"category_scores_gemma":[0.0036599964,0.00004296582,0.00008319942,0.00063316314,0.00015198403,0.0000388815,0.035560522,0.00018287664,0.000011877412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000467888,0.00014267169,0.00022317225,0.00001860193,0.000041825762,0.0000013613826,0.002327058,0.0008612751,0.0067887045,0.7990683,0.16777855,0.022743838],"study_design_scores_gemma":[0.00014405749,0.000023491593,0.014482925,0.00012741475,0.0000075958365,0.000013355199,0.00012621294,0.08494135,0.001738802,0.4661331,0.43208724,0.0001744706],"about_ca_topic_score_codex":0.0000125827055,"about_ca_topic_score_gemma":0.00010545073,"teacher_disagreement_score":0.9338329,"about_ca_system_score_codex":0.000017107026,"about_ca_system_score_gemma":0.00010180678,"threshold_uncertainty_score":0.9722397},"labels":[],"label_agreement":null},{"id":"W3194756826","doi":"10.48550/arxiv.2008.09252","title":"Towards simulating 2D effects in lattice gauge theories on a quantum computer","year":2020,"lang":"en","type":"article","venue":"UWSpace (University of Waterloo)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Horizon 2020; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Universitat Autònoma de Barcelona; Ministerio de Ciencia, Innovación y Universidades; American Friends of the Alexander von Humboldt Foundation; European Regional Development Fund; Alfred P. Sloan Foundation","keywords":"Quantum computer; Quantum simulator; Physics; Qubit; Quantum; Open quantum system; Observable; Quantum algorithm; Quantum technology; Quantum information; Gauge theory; Quantum mechanics; Theoretical physics; Computer science; Statistical physics","score_opus":0.009558078245434752,"score_gpt":0.19895367155544288,"score_spread":0.18939559331000813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194756826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9187638,0.000019909283,0.07210732,0.008540879,0.00017258753,0.00014944027,0.0000032019293,0.00016192159,0.00008089985],"genre_scores_gemma":[0.9315539,0.0000028074192,0.067504466,0.0005083791,0.000080596445,1.10549e-7,0.0000020922535,0.000010297714,0.000337378],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987026,0.00015640804,0.00011199731,0.00044366324,0.0002642756,0.0003210405],"domain_scores_gemma":[0.99918,0.00024145423,0.00010086159,0.00029962222,0.00004673135,0.00013133285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017804992,0.0001827359,0.00030675932,0.00013128768,0.00015377664,0.000051747324,0.00080054044,0.00007385803,0.000007369818],"category_scores_gemma":[0.000030223378,0.00018225162,0.00010246813,0.00046165177,0.00008466577,0.0002174082,0.0005101309,0.00027508658,0.000032545264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019560022,0.00028619848,0.0018602308,0.00053625944,0.00010012057,0.00095772906,0.4611839,0.11870698,0.0015117843,0.27163306,0.0005869354,0.14244118],"study_design_scores_gemma":[0.0008192427,0.0005394047,0.005288272,0.00013858006,0.00000798194,0.0000033405443,0.0014049172,0.98693705,0.0004019869,0.004036249,0.00019133194,0.00023166263],"about_ca_topic_score_codex":0.0023162125,"about_ca_topic_score_gemma":0.00020372389,"teacher_disagreement_score":0.86823004,"about_ca_system_score_codex":0.00002700215,"about_ca_system_score_gemma":0.000036594836,"threshold_uncertainty_score":0.74320054},"labels":[],"label_agreement":null},{"id":"W3194891683","doi":"10.1109/isvlsi51109.2021.00090","title":"Reproducibility in Quantum Computing","year":2021,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Office of Science; UT-Battelle","keywords":"Computer science; Reproducibility; Quantum computer; Noise (video); Fidelity; Computation; Hellinger distance; Computer engineering; Algorithm; Computational science; Theoretical computer science; Quantum; Mathematics; Artificial intelligence; Physics","score_opus":0.015904842496465846,"score_gpt":0.2583518145989931,"score_spread":0.24244697210252725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194891683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60608494,0.00015857341,0.38769433,0.0030804316,0.00043223987,0.000048045218,2.1284859e-7,0.00023538724,0.0022658615],"genre_scores_gemma":[0.8996106,0.000002015913,0.09964913,0.00052283175,0.000075623,5.4508524e-7,8.495178e-7,0.0000044074986,0.00013398725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777937,0.0001341404,0.00025617826,0.001377869,0.00016623322,0.00028620465],"domain_scores_gemma":[0.9976888,0.00013127012,0.00003860497,0.0020178698,0.00006636056,0.0000571415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012790879,0.00009911604,0.00016075825,0.00005892045,0.000075286385,0.00011145481,0.0004694044,0.000035207515,0.00001447768],"category_scores_gemma":[0.0003709488,0.000088342094,0.00005532662,0.00072558434,0.000020789745,0.00010218314,0.0005870125,0.0002092134,0.000022094444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043645723,0.0005795254,0.035708547,0.000064476946,0.00001995259,0.0009138331,0.0039242646,0.05342177,0.0032345462,0.2661722,0.0012407687,0.63471574],"study_design_scores_gemma":[0.00015144092,0.000015284184,0.03145191,0.000020509682,4.6186588e-7,0.000069325586,0.000022845941,0.95329154,0.0027969345,0.011184032,0.000864049,0.0001316805],"about_ca_topic_score_codex":0.00005322611,"about_ca_topic_score_gemma":0.000025843949,"teacher_disagreement_score":0.89986974,"about_ca_system_score_codex":0.000022510134,"about_ca_system_score_gemma":0.00009900074,"threshold_uncertainty_score":0.36024863},"labels":[],"label_agreement":null},{"id":"W3194905711","doi":"10.1051/epjconf/202125103023","title":"Quantum Gate Pattern Recognition and Circuit Optimization for Scientific Applications","year":2021,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Particle Physics","funders":"","keywords":"Qubit; Quantum circuit; Quantum computer; Quantum gate; Coherence (philosophical gambling strategy); Computer science; Quantum; ENCODE; Gate count; Electronic circuit; Algorithm; Quantum algorithm; Controlled NOT gate; Optimization problem; Reduction (mathematics); Quantum phase estimation algorithm; Quantum error correction; Computer engineering; Mathematics; Physics; Computer hardware; Quantum mechanics","score_opus":0.22428521473280302,"score_gpt":0.46924498307445744,"score_spread":0.24495976834165442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194905711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098851316,0.0037241403,0.8957416,0.0003733431,0.0005642,0.0004888595,0.00006419869,0.000063036896,0.00012935074],"genre_scores_gemma":[0.9392178,0.0022019243,0.056875143,0.0006251915,0.0004232235,0.00024340898,0.0001829866,0.000065441905,0.00016486383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979703,0.00014972509,0.00051845156,0.0006759037,0.00038167127,0.00030395057],"domain_scores_gemma":[0.9978976,0.0002945479,0.0004780802,0.00053019874,0.0006212088,0.00017832164],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009613339,0.00019472819,0.0003433542,0.0004328446,0.00065671385,0.003979938,0.0017162544,0.00006752386,0.00032076705],"category_scores_gemma":[0.00012375237,0.0001913502,0.000109896515,0.0012095359,0.000101791375,0.0014132241,0.0008764531,0.00020132358,0.000006197551],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012486802,0.0002831983,0.004980235,0.00020262231,0.00009359955,0.000017872115,0.0004451929,0.02060972,0.018074267,0.0005818255,0.0031734398,0.95152557],"study_design_scores_gemma":[0.0006906532,0.000016819404,0.019734483,0.0004349114,0.000055522745,0.00008754414,0.00003752442,0.8626465,0.012354697,0.09683836,0.00650794,0.00059503183],"about_ca_topic_score_codex":0.00004057969,"about_ca_topic_score_gemma":0.000008147145,"teacher_disagreement_score":0.95093054,"about_ca_system_score_codex":0.00003101722,"about_ca_system_score_gemma":0.00016206075,"threshold_uncertainty_score":0.99705404},"labels":[],"label_agreement":null},{"id":"W3195526152","doi":"10.1103/physrevresearch.4.043218","title":"Efficient diagnostics for quantum error correction","year":2022,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Australian Research Council; Canada First Research Excellence Fund","keywords":"Computer science; Error detection and correction; Quantum error correction; Overhead (engineering); Fidelity; Algorithm; Pauli exclusion principle; Scalability; Quantum computer; Quantum; Quantum mechanics; Physics; Telecommunications","score_opus":0.06823629576435508,"score_gpt":0.40947147318719845,"score_spread":0.34123517742284337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195526152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21754001,0.07685921,0.66133255,0.028953103,0.006471454,0.006788358,0.000073422525,0.00082332065,0.0011585878],"genre_scores_gemma":[0.99163884,0.0011532902,0.0040873582,0.00093158515,0.0005793195,0.0012310926,0.000014492292,0.000034516397,0.00032950632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997209,0.00055588194,0.00019221823,0.00048663825,0.0010206932,0.0005355377],"domain_scores_gemma":[0.9968893,0.0021642435,0.000057175053,0.0005479258,0.0002129777,0.00012837438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019558694,0.00011635497,0.00025347798,0.000099990466,0.00087971473,0.00007040672,0.0010687612,0.000010584681,0.000014303],"category_scores_gemma":[0.0010748052,0.00009745202,0.00017447073,0.0012103042,0.00006263072,0.000025787383,0.0010664521,0.000689958,0.000046377638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018806923,0.0016713234,0.00002739257,0.0014805371,0.000032102915,0.000030404417,0.00086004037,0.067187026,0.00044379878,0.1402632,0.13557576,0.6524096],"study_design_scores_gemma":[0.000105686166,0.00040882378,0.0000905609,0.00016943848,0.000004565494,0.000008017518,0.0000125401475,0.911678,0.0000624117,0.007813036,0.079534344,0.00011253549],"about_ca_topic_score_codex":0.000017093555,"about_ca_topic_score_gemma":5.9773123e-7,"teacher_disagreement_score":0.844491,"about_ca_system_score_codex":0.000098428696,"about_ca_system_score_gemma":0.00013589156,"threshold_uncertainty_score":0.67661434},"labels":[],"label_agreement":null},{"id":"W3196006293","doi":"10.1007/s11128-022-03681-9","title":"The average search probabilities of discrete-time quantum walks","year":2022,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Adjacency matrix; Quantum walk; Adjacency list; Mathematics; Combinatorics; Graph energy; Discrete mathematics; Vertex (graph theory); Stochastic matrix; Valency; Regular graph; Graph; Quantum algorithm; Quantum; Graph power; Line graph; Markov chain; Physics; Statistics; Quantum mechanics","score_opus":0.007385554830364144,"score_gpt":0.22446734061366716,"score_spread":0.217081785783303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196006293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.349808,0.00073751964,0.63715553,0.0056010294,0.00094150135,0.0008949248,0.00004254661,0.00074445695,0.004074497],"genre_scores_gemma":[0.995768,0.000005736164,0.003830235,0.00018612936,0.0000367784,0.000040198738,0.000015474789,0.000009479691,0.000107979715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976602,0.00018391751,0.0006564004,0.00019786955,0.0008768854,0.00042469738],"domain_scores_gemma":[0.99865174,0.00022985642,0.00036464835,0.0004783456,0.00020844839,0.00006697149],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014708883,0.00017044239,0.00019390346,0.00017437471,0.0019574899,0.000520056,0.0013236388,0.000033815595,0.00002159207],"category_scores_gemma":[0.000093638446,0.00012337818,0.000092044014,0.0007575792,0.00014524715,0.0014992215,0.00082504714,0.0004280938,0.000022529413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008122858,0.00009334472,0.00009467666,0.000476934,0.00003343878,0.000003949981,0.044148456,0.24914905,0.0002778689,0.2592939,0.0008669581,0.4454802],"study_design_scores_gemma":[0.00019252334,0.0001963435,0.00015493079,0.000032512122,0.000002540214,0.00003749613,0.0009435025,0.97519803,0.00025222404,0.014667864,0.008150324,0.00017171603],"about_ca_topic_score_codex":0.000022158152,"about_ca_topic_score_gemma":4.4991987e-7,"teacher_disagreement_score":0.72604895,"about_ca_system_score_codex":0.000073139556,"about_ca_system_score_gemma":0.00032614823,"threshold_uncertainty_score":0.99934185},"labels":[],"label_agreement":null},{"id":"W3198317698","doi":"10.22331/q-2022-08-17-780","title":"Hybridized Methods for Quantum Simulation in the Interaction Picture","year":2022,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Nuclear Physics; Office of Science; U.S. Department of Energy","keywords":"Algorithm; Hamiltonian (control theory); Computer science; Scaling; Statistical physics; Physics; Mathematics; Geometry; Mathematical optimization","score_opus":0.03213992960442573,"score_gpt":0.3608072854957785,"score_spread":0.32866735589135276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198317698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0850533,0.00013671679,0.91005427,0.0028606902,0.0012449736,0.00045788122,0.0000051779693,0.00012886076,0.000058103862],"genre_scores_gemma":[0.92221326,0.0000016334099,0.076425634,0.0010318889,0.00014910057,0.00012852192,0.000012763086,0.000013916021,0.000023312445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787414,0.00081347715,0.00031544358,0.00041507924,0.00026443368,0.00031741714],"domain_scores_gemma":[0.99768865,0.0015921838,0.00015034291,0.00049354736,0.000041782412,0.000033505177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001984426,0.00015835703,0.00018939919,0.00017660797,0.00052095583,0.00015250113,0.0010469178,0.000032717544,0.00001471487],"category_scores_gemma":[0.00013085807,0.00011788099,0.0001339462,0.0006054885,0.000019815721,0.00017072687,0.00026894532,0.0004705235,0.000003373759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067342546,0.00017259242,0.000037481812,0.00002215711,0.000016484744,0.00001324543,0.006191525,0.7060127,0.0006621877,0.08860195,0.00088939135,0.19731292],"study_design_scores_gemma":[0.00039994044,0.00021305821,0.00023634735,0.000006743681,0.0000046299133,0.000034595385,0.00032943682,0.89218116,0.00008625524,0.045980044,0.060382657,0.00014516035],"about_ca_topic_score_codex":0.000026140959,"about_ca_topic_score_gemma":0.0000020182026,"teacher_disagreement_score":0.83715993,"about_ca_system_score_codex":0.000065476976,"about_ca_system_score_gemma":0.000049780323,"threshold_uncertainty_score":0.48070472},"labels":[],"label_agreement":null},{"id":"W3198679198","doi":"10.1007/s42354-021-0402-0","title":"The Quantum What? Advantage, Utopia or Threat?","year":2021,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Quantum computer; Utopia; Enthusiasm; Computer science; Field (mathematics); The Internet; Computer security; Internet privacy; Quantum; Political science; Mathematics; World Wide Web; Law; Psychology; Social psychology; Physics","score_opus":0.00983791984946773,"score_gpt":0.23037823301367014,"score_spread":0.22054031316420242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198679198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049896605,0.0039626663,0.873431,0.059775334,0.00091426494,0.00021411257,0.000005169447,0.00051009335,0.011290717],"genre_scores_gemma":[0.58357,0.0058496078,0.34943202,0.0015041139,0.00014755219,0.000058487214,0.00006902645,0.00008394076,0.05928527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955374,0.0026483505,0.00034423597,0.0006187267,0.00040870113,0.000442598],"domain_scores_gemma":[0.99368846,0.0026256933,0.00018511666,0.0022524828,0.0010904019,0.00015783162],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028069378,0.00021028683,0.00019867331,0.00005739969,0.0010368328,0.0017973509,0.0018714935,0.00007852443,0.000039491242],"category_scores_gemma":[0.0009665799,0.00014885046,0.00013996326,0.0007757617,0.0001686402,0.0004569508,0.0010635739,0.0003435772,0.00005332135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039676,0.0001450729,0.00012575854,0.000013339198,0.000024499743,0.000040675728,0.0029501906,0.00005197975,0.000659458,0.55769,0.00051690696,0.43777815],"study_design_scores_gemma":[0.00083196984,0.0000018156859,0.0028700528,0.001028102,0.000018193105,0.00030249733,0.00057482434,0.68740046,0.04896773,0.032922585,0.22444001,0.0006417256],"about_ca_topic_score_codex":0.00007355003,"about_ca_topic_score_gemma":0.0005356829,"teacher_disagreement_score":0.6873485,"about_ca_system_score_codex":0.0000353861,"about_ca_system_score_gemma":0.00029990196,"threshold_uncertainty_score":0.9992389},"labels":[],"label_agreement":null},{"id":"W3198943914","doi":"10.1103/physrevb.104.094106","title":"Interacting Defects Generate Stochastic Fluctuations in Superconducting Qubits","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Qubit; Jitter; Superconductivity; Domino; Ideal (ethics); Physics; Quantum; Superconducting quantum computing; Quantum computer; Quantum mechanics; Computer science; Statistical physics; Theoretical physics; Telecommunications; Law","score_opus":0.045954617761394326,"score_gpt":0.19398797060331002,"score_spread":0.1480333528419157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198943914","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6211646,0.000030338235,0.3781072,0.00012715082,0.00030130014,0.000037356585,6.372436e-7,0.00007739041,0.00015401201],"genre_scores_gemma":[0.993642,0.0000037448249,0.005917241,0.0001212047,0.00007012009,2.443091e-7,0.000002929473,0.000008948782,0.00023358587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875706,0.00014009085,0.00014379746,0.00058438664,0.000057197412,0.00031745285],"domain_scores_gemma":[0.9990824,0.0002700438,0.000060729806,0.000392519,0.00010371754,0.00009057877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017328314,0.00013838346,0.00014943688,0.00017701661,0.00020987538,0.00011151497,0.00043689535,0.000049991897,0.000013824148],"category_scores_gemma":[0.0001824647,0.00015992878,0.00007184552,0.0012058009,0.0000276896,0.00045060547,0.0003749673,0.00029853958,0.000033983804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018807556,0.000044802546,0.000721256,0.000007589433,0.000011556342,0.00048976834,0.0007621544,0.96835583,0.0033179696,0.024243182,0.000015127774,0.0020288604],"study_design_scores_gemma":[0.0002924736,0.000017638971,0.0010327317,0.000057611476,0.0000066260127,0.000047664245,0.00025619846,0.9936041,0.0010993684,0.003351674,0.000044091885,0.0001897842],"about_ca_topic_score_codex":0.000053656313,"about_ca_topic_score_gemma":0.00013279569,"teacher_disagreement_score":0.37247735,"about_ca_system_score_codex":0.00007684238,"about_ca_system_score_gemma":0.0001272767,"threshold_uncertainty_score":0.65217066},"labels":[],"label_agreement":null},{"id":"W3199180021","doi":"10.1007/s40509-021-00253-x","title":"Dirac quantum walks with conserved angular momentum","year":2021,"lang":"en","type":"article","venue":"Quantum Studies Mathematics and Foundations","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dirac equation; Physics; Spinor; Dirac (video compression format); Mathematical physics; Dirac fermion; Angular momentum; Quantum mechanics; Quantum walk; Spacetime; Momentum (technical analysis); Fermion; Classical mechanics; Quantum; Quantum computer","score_opus":0.031124426120788005,"score_gpt":0.2814737139514185,"score_spread":0.2503492878306305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199180021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42222843,0.0030642822,0.5662306,0.006900326,0.00048656666,0.00027321294,0.000012479021,0.00030650973,0.0004975847],"genre_scores_gemma":[0.7757834,0.0007884559,0.22240008,0.00039556212,0.00013019748,0.00006148383,0.000019793828,0.00004203662,0.0003789871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837226,0.000054928478,0.00038463724,0.00049384584,0.00032636942,0.00036795647],"domain_scores_gemma":[0.998274,0.00044421502,0.00017995389,0.0006433374,0.00034469724,0.000113774804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028875947,0.00026752072,0.00042366667,0.00009296943,0.0007869139,0.00033894248,0.00031236143,0.000046705514,0.000010720248],"category_scores_gemma":[0.00016823666,0.00020230404,0.000075639946,0.00051375804,0.0001802203,0.00019797003,0.00046140168,0.00018796262,0.000018600684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030539918,0.00032768497,0.00013290344,0.00026592764,0.00040327566,0.000120042794,0.0075420393,0.00029691635,0.00058559893,0.9860293,0.0006329056,0.0036603413],"study_design_scores_gemma":[0.00063955557,0.00023578595,0.00048812138,0.0002810188,0.000080530524,0.00027462843,0.0028571628,0.8016992,0.00038251365,0.18842778,0.0041224556,0.0005112152],"about_ca_topic_score_codex":0.000008441438,"about_ca_topic_score_gemma":0.000027086899,"teacher_disagreement_score":0.80140233,"about_ca_system_score_codex":0.000029109868,"about_ca_system_score_gemma":0.000111305926,"threshold_uncertainty_score":0.824972},"labels":[],"label_agreement":null},{"id":"W3200537988","doi":"10.1103/physrevlett.129.050505","title":"Quantifying Nonlocality: How Outperforming Local Quantum Codes Is Expensive","year":2022,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"National Science Foundation","keywords":"Low-density parity-check code; Physics; Quantum nonlocality; Omega; Quantum; Dimension (graph theory); Code (set theory); Discrete mathematics; Quantum mechanics; Combinatorics; Decoding methods; Computer science; Quantum entanglement; Mathematics; Algorithm","score_opus":0.03146167953438782,"score_gpt":0.2916615374567209,"score_spread":0.2601998579223331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200537988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24388222,0.007191464,0.612168,0.13504696,0.00076519017,0.00053402106,0.000016691083,0.0003618096,0.000033631975],"genre_scores_gemma":[0.90252805,0.00033843255,0.00474586,0.09203247,0.00024462922,0.00006703128,0.000009581983,0.00002623064,0.000007694389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728894,0.00032641762,0.00028064815,0.00073744945,0.0007937529,0.0005727971],"domain_scores_gemma":[0.9985535,0.00028048607,0.00019563493,0.00076712086,0.000049256978,0.00015397623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048252576,0.00030702414,0.0005963392,0.00007018295,0.0006233998,0.0001494449,0.0012605999,0.000009232854,0.000016451293],"category_scores_gemma":[0.000046298228,0.0002656566,0.0003566768,0.00063324714,0.000115817835,0.0002345399,0.001106332,0.00066611083,0.000042435095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031072937,0.0009981155,0.0003777786,0.004237938,0.00038393965,0.00083702535,0.014284928,0.043739785,0.018137395,0.03874363,0.11873291,0.7594955],"study_design_scores_gemma":[0.00015194522,0.00009900278,0.000055011893,0.00040201758,0.000024453113,0.00006167484,0.000087830675,0.9532614,0.00029401918,0.00038314448,0.04478607,0.00039347302],"about_ca_topic_score_codex":0.000036691912,"about_ca_topic_score_gemma":6.560566e-7,"teacher_disagreement_score":0.9095216,"about_ca_system_score_codex":0.000095033836,"about_ca_system_score_gemma":0.000047199093,"threshold_uncertainty_score":0.99997956},"labels":[],"label_agreement":null},{"id":"W3200821764","doi":"10.4204/eptcs.343.2","title":"Generators and Relations for Real Stabilizer Operators","year":2021,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Stabilizer (aeronautics); Set (abstract data type); Operator (biology); Hadamard transform; Pauli exclusion principle; Electronic circuit; Real number; Tensor (intrinsic definition)","score_opus":0.004367914828980769,"score_gpt":0.23215168399816946,"score_spread":0.2277837691691887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200821764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4968693,0.00015166053,0.500252,0.0016710269,0.00021634313,0.00018510353,8.157671e-7,0.00012132444,0.0005324499],"genre_scores_gemma":[0.8102351,0.000023530583,0.18932791,0.00026489777,0.000111622336,0.000018597095,5.296453e-7,0.000009472371,0.000008370206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974125,0.000026373758,0.00028898998,0.001002175,0.00036817722,0.00090176094],"domain_scores_gemma":[0.99899274,0.00019094672,0.000054181855,0.00025521487,0.00031928104,0.00018762024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013605184,0.00019213614,0.0002170147,0.00019393454,0.0004938574,0.00060434506,0.00095808395,0.000069527174,0.0000056858385],"category_scores_gemma":[0.00020272104,0.00016941324,0.000049930062,0.0016589462,0.00079029414,0.0005029432,0.0007243237,0.00035616444,0.0000022033005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031674983,0.000035976078,0.00038259837,0.0000085005495,0.0000031408506,0.0000030552965,0.00060436537,0.0002418534,0.0015630341,0.9800988,0.000029061393,0.017026449],"study_design_scores_gemma":[0.00029635042,0.00019028141,0.0007941765,0.000024255361,0.000002752561,0.00007164695,0.000014509145,0.75247395,0.006706106,0.23894134,0.00027337595,0.00021127699],"about_ca_topic_score_codex":0.0000017630923,"about_ca_topic_score_gemma":0.0000023811963,"teacher_disagreement_score":0.7522321,"about_ca_system_score_codex":0.00015481199,"about_ca_system_score_gemma":0.000588044,"threshold_uncertainty_score":0.69084716},"labels":[],"label_agreement":null},{"id":"W3201604351","doi":"10.1049/qtc2.12022","title":"Guest editorial for special issue on selected extended papers from QCrypt 2020","year":2021,"lang":"en","type":"editorial","venue":"IET Quantum Communication","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Quantum cryptography; Computer science; Cryptography; Quantum key distribution; Quantum computer; Computer security; Confidentiality; Quantum; Quantum information","score_opus":0.006813367000517232,"score_gpt":0.25450667933464227,"score_spread":0.24769331233412503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201604351","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075920485,0.00063134014,0.0028632472,0.0018008118,0.9921565,0.0006584285,0.00048103614,0.00049685076,0.0008358666],"genre_scores_gemma":[0.00012643912,0.0006394921,0.017867126,0.00011248382,0.9748666,0.00013098017,0.0058823386,0.00010634793,0.00026816418],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945136,0.0008229913,0.0009030127,0.0014505268,0.0016026986,0.00070717506],"domain_scores_gemma":[0.9886719,0.005243964,0.00077593955,0.003860358,0.001227775,0.00022007874],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.00079075445,0.0007658491,0.0009495917,0.0001753259,0.0007879335,0.0008675427,0.0048534907,0.0014392219,0.000056699122],"category_scores_gemma":[0.0023789573,0.0007805729,0.00038093535,0.0008330987,0.00012578147,0.0002298473,0.001093122,0.0025086885,0.00010358598],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010890886,0.000232201,3.648412e-7,0.000037440943,0.000118991135,0.000007646178,0.0006117443,0.00014171377,0.00015672915,0.0006658152,0.9857388,0.012179652],"study_design_scores_gemma":[0.0012584883,0.0004502218,0.000021239755,0.00039828545,0.000063370244,0.0000014679672,0.000028545823,0.03353603,0.00019104518,0.0030830186,0.96015036,0.0008179143],"about_ca_topic_score_codex":0.00028637686,"about_ca_topic_score_gemma":0.00017341823,"teacher_disagreement_score":0.033394318,"about_ca_system_score_codex":0.00025911507,"about_ca_system_score_gemma":0.0009941413,"threshold_uncertainty_score":0.9998571},"labels":[],"label_agreement":null},{"id":"W3202161175","doi":"10.1038/s41534-022-00578-4","title":"Quantum causal unravelling","year":2022,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Government of Canada; Croucher Foundation; National Natural Science Foundation of China; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; John Templeton Foundation","keywords":"Multipartite; Quantum; Computer science; Causal structure; Quantum process; Process (computing); Dimension (graph theory); Bounded function; Algorithm; Statistical physics; Theoretical computer science; Mathematics; Quantum mechanics; Quantum entanglement; Physics; Quantum dynamics; Combinatorics","score_opus":0.010249574425239308,"score_gpt":0.22058989730380002,"score_spread":0.21034032287856072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202161175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1708051,0.00006871921,0.82366616,0.0014863927,0.001824936,0.00020691827,0.00001285793,0.0005706788,0.0013582498],"genre_scores_gemma":[0.99113256,0.000008396086,0.0074677807,0.0011546263,0.00010635827,0.000031585183,0.000048714526,0.000009803099,0.000040182655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981268,0.00010764778,0.0004686688,0.00021911714,0.00066805823,0.0004097324],"domain_scores_gemma":[0.99898565,0.00009077017,0.00024800445,0.0004971406,0.00008056487,0.000097872784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006720318,0.00017998804,0.00016582794,0.0003024153,0.0008952687,0.0002848007,0.0009747129,0.00004284347,0.00005728641],"category_scores_gemma":[0.000038320042,0.00017857098,0.00008982679,0.00071543397,0.000026008443,0.001260783,0.00061398925,0.00045448725,0.00016621691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002886791,0.00008241513,0.00016087409,0.000041571468,0.000026159349,0.000026300768,0.0092605995,0.21679334,0.00018609095,0.63917357,0.0044347383,0.12978546],"study_design_scores_gemma":[0.00026157586,0.0001602528,0.00053937716,0.000007298572,0.000002898962,0.00013717866,0.00020271099,0.9091806,0.000077193625,0.009127382,0.08007322,0.00023033119],"about_ca_topic_score_codex":0.00005934823,"about_ca_topic_score_gemma":9.145663e-7,"teacher_disagreement_score":0.82032746,"about_ca_system_score_codex":0.000096619384,"about_ca_system_score_gemma":0.00012607365,"threshold_uncertainty_score":0.7281913},"labels":[],"label_agreement":null},{"id":"W3202428649","doi":"10.1007/978-3-030-69318-3_17","title":"Implementing Two-Qubit Gates","year":2021,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Controlled NOT gate; Qubit; Quantum gate; Set (abstract data type); Topology (electrical circuits); Computer science; Physics; Quantum mechanics; Mathematics; Quantum; Combinatorics; Programming language","score_opus":0.039797584335207886,"score_gpt":0.31926936226425656,"score_spread":0.27947177792904865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202428649","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053796537,0.042034425,0.06761478,0.11857461,0.029538251,0.01711315,0.0031539644,0.0092230635,0.6589512],"genre_scores_gemma":[0.026136996,0.0032233687,0.054924097,0.00148753,0.008206221,0.00024223527,0.00042053836,0.00044057358,0.90491843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945742,0.000399727,0.0006984673,0.0011068431,0.0016096589,0.0016110863],"domain_scores_gemma":[0.9965826,0.00060760416,0.00029185117,0.0016694859,0.0006702269,0.00017821099],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0047404426,0.0005637842,0.00069814635,0.00009709712,0.002286902,0.00248895,0.0027404672,0.00030197197,0.0006244981],"category_scores_gemma":[0.000047524223,0.0004153264,0.00047070422,0.00024040478,0.00069548795,0.0003212582,0.005792746,0.0012031565,0.00015695248],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032592343,0.000058676418,0.0000050496546,0.0008101171,0.00091773085,0.00025797015,0.009361094,0.00014494902,0.05441321,0.84038585,0.05637145,0.037241295],"study_design_scores_gemma":[0.0003742722,0.00019293657,0.000013432699,0.0004937897,0.000024230965,0.0001499726,0.00040327234,0.0031163155,0.014971079,0.08994374,0.88947034,0.0008466362],"about_ca_topic_score_codex":0.00014220552,"about_ca_topic_score_gemma":0.000088765206,"teacher_disagreement_score":0.8330989,"about_ca_system_score_codex":0.00012332479,"about_ca_system_score_gemma":0.0005147651,"threshold_uncertainty_score":0.9998298},"labels":[],"label_agreement":null},{"id":"W3202697695","doi":"10.1016/j.bcra.2023.100141","title":"Conditions for advantageous quantum Bitcoin mining","year":2023,"lang":"en","type":"article","venue":"Blockchain Research and Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Calgary","funders":"Government of Alberta","keywords":"Quantum; Cryptocurrency; Computer science; Computer security; Physics; Quantum mechanics","score_opus":0.04759741029218796,"score_gpt":0.3668780768664082,"score_spread":0.3192806665742203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202697695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24134634,0.00029624143,0.73933613,0.015267777,0.00010717468,0.001914362,0.00014176307,0.0010000459,0.00059015374],"genre_scores_gemma":[0.9643259,0.000065990636,0.03076089,0.00018343906,0.00043993784,0.0024434316,0.00006794016,0.000028865481,0.0016835716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850124,0.00005539187,0.00016563373,0.0004571683,0.0002693542,0.0005512333],"domain_scores_gemma":[0.99804074,0.0011251683,0.00003256199,0.00044617144,0.00017171256,0.00018363152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008179758,0.00009904589,0.00011350815,0.0003636539,0.0011391169,0.00016852569,0.0005445209,0.000047625414,0.0000028040517],"category_scores_gemma":[0.00007196038,0.00009233688,0.00004163038,0.0014001688,0.00015313349,0.00003476253,0.0003356816,0.00018420714,0.00005739296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069085263,0.00016946507,0.00013921589,0.00009394488,0.000029662462,0.000016202612,0.00082501804,0.0023665784,0.004110929,0.80692804,0.020960543,0.16435349],"study_design_scores_gemma":[0.000239092,0.00013053272,0.00035115166,0.000017989983,0.0000015773381,0.000020261463,0.00023839793,0.81740427,0.00022485819,0.1211533,0.06009182,0.0001267583],"about_ca_topic_score_codex":0.000013531157,"about_ca_topic_score_gemma":0.000005918699,"teacher_disagreement_score":0.81503767,"about_ca_system_score_codex":0.000013332193,"about_ca_system_score_gemma":0.00007654331,"threshold_uncertainty_score":0.8761282},"labels":[],"label_agreement":null},{"id":"W3202793865","doi":"10.1007/s00023-024-01426-1","title":"Synchronous Values of Games","year":2024,"lang":"en","type":"article","venue":"Annales Henri Poincaré","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplicative function; Value (mathematics); Mathematics; Repeated game; Set (abstract data type); Matrix (chemical analysis); Computer science; Mathematical optimization; Game theory; Mathematical economics","score_opus":0.00911618291251079,"score_gpt":0.24964868328419149,"score_spread":0.2405325003716807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202793865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53070706,0.027822293,0.4280881,0.0040934165,0.0017768787,0.0002059045,0.000016357371,0.0012458484,0.006044172],"genre_scores_gemma":[0.9750562,0.00009849338,0.024018206,0.00017800483,0.00023644262,0.0000029346418,0.0000022002819,0.0000145323265,0.00039300168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988177,0.000056237153,0.0002285,0.00037387008,0.0002510098,0.00027271357],"domain_scores_gemma":[0.99921,0.00017739934,0.00004221563,0.0004441648,0.00005261704,0.00007361059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024572457,0.0001474754,0.00018968005,0.0001634328,0.00007234737,0.00014318585,0.0006514896,0.000047679558,0.000013244648],"category_scores_gemma":[0.000022488499,0.000119018216,0.0001488517,0.00040222082,0.000082592844,0.0001763642,0.00025127997,0.00016803195,0.00007985174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004626515,0.00009193944,0.00022235575,0.00035918978,0.00013292256,0.00025942188,0.0055845664,0.0025093677,0.0015693394,0.073882766,0.013101129,0.90228236],"study_design_scores_gemma":[0.00012386811,0.00026991154,0.0022343332,0.00036723347,0.000014760323,0.00018892143,0.000043940458,0.919133,0.0039303526,0.033010866,0.040356953,0.0003258318],"about_ca_topic_score_codex":0.000024926552,"about_ca_topic_score_gemma":0.0000016594778,"teacher_disagreement_score":0.91662365,"about_ca_system_score_codex":0.000013348478,"about_ca_system_score_gemma":0.00010999211,"threshold_uncertainty_score":0.4853422},"labels":[],"label_agreement":null},{"id":"W3203045962","doi":"10.1039/d1cs00932j","title":"A quantum computing view on unitary coupled cluster theory","year":2022,"lang":"en","type":"preprint","venue":"Chemical Society Reviews","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; The Scarborough Hospital; Vector Institute; University of Toronto","funders":"Vector Institute; Canadian Institute for Advanced Research; Deutscher Akademischer Austauschdienst; Ontario Ministry of Research, Innovation and Science; Canada Research Chairs; Google","keywords":"Ansatz; Unitary state; Quantum computer; Coupled cluster; Computer science; Context (archaeology); Perspective (graphical); Quantum; Field (mathematics); Cluster (spacecraft); Theoretical computer science; Theoretical physics; Algebra over a field; Mathematics; Quantum mechanics; Physics; Pure mathematics; Artificial intelligence; Programming language","score_opus":0.02761540840934104,"score_gpt":0.2844321284979508,"score_spread":0.2568167200886098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203045962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068702385,0.124485455,0.784429,0.008785685,0.005593522,0.0043432014,0.000052699746,0.0019048522,0.0017031995],"genre_scores_gemma":[0.089425564,0.047136795,0.7387166,0.112880364,0.00767043,0.0010338227,0.001197832,0.00064119924,0.0012973862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514896,0.0007771765,0.0010677463,0.0016029542,0.00066006783,0.0007431161],"domain_scores_gemma":[0.9961555,0.000842371,0.0006581526,0.0020207402,0.00007274432,0.00025049062],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0030879693,0.0007731981,0.0014113509,0.00004257157,0.00043613743,0.0002483885,0.0035213558,0.00037998607,0.00012632812],"category_scores_gemma":[0.00020740209,0.0006245268,0.0017323586,0.0005544418,0.00015409724,0.000059741422,0.007923627,0.003607928,0.00009189137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000427123,0.0011178007,0.00003422722,0.007662123,0.00064341736,0.00006241177,0.011111777,0.018742524,0.0015721084,0.040053327,0.1254584,0.7934992],"study_design_scores_gemma":[0.00030016122,0.000058558682,0.0000110996725,0.0012081905,0.00004892282,0.000021602269,0.00002615302,0.80196106,0.000075548385,0.017428149,0.17805944,0.0008011144],"about_ca_topic_score_codex":0.000011144545,"about_ca_topic_score_gemma":1.082482e-7,"teacher_disagreement_score":0.792698,"about_ca_system_score_codex":0.00027348028,"about_ca_system_score_gemma":0.00017898066,"threshold_uncertainty_score":0.9996206},"labels":[],"label_agreement":null},{"id":"W3203114343","doi":"","title":"High-fidelity universal quantum computation with symmetric qubit clusters","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Quantum computer; Quantum error correction; Qubit; Quantum decoherence; Physics; Quantum mechanics; Quantum algorithm; Quantum gate; Quantum circuit; Topology (electrical circuits); Computer science; Quantum; Mathematics","score_opus":0.029859322887333457,"score_gpt":0.18095230209445107,"score_spread":0.15109297920711762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203114343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4512409,0.00004930132,0.5472427,0.00016619932,0.0006308618,0.0001823658,0.000008460231,0.00031481846,0.00016443344],"genre_scores_gemma":[0.97449124,0.000046218047,0.024948303,0.00015255641,0.00011486305,5.0632684e-7,0.00006568161,0.00003163282,0.00014898575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966553,0.00036763656,0.00030500605,0.0018392099,0.00026293407,0.0005699195],"domain_scores_gemma":[0.99736106,0.00025464105,0.0004468493,0.0012492086,0.00040664565,0.00028160278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032549657,0.00053851324,0.00060054084,0.00062827696,0.0003379109,0.00041188035,0.0018269803,0.0003261436,0.000009526597],"category_scores_gemma":[0.000030787054,0.0005616537,0.00025825188,0.0021633608,0.00016607193,0.0004099194,0.002558068,0.0011403813,0.000021694537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003161582,0.00010985852,0.00033009765,0.000089898684,0.00014233311,0.0010489763,0.00030972058,0.9510986,0.000006706423,0.044344943,0.00009817913,0.0023890666],"study_design_scores_gemma":[0.0008488029,0.00015910633,0.002382983,0.00021747916,0.00008684711,0.000033060085,0.00018579258,0.9871989,0.000034324556,0.008109527,0.000056161673,0.00068699743],"about_ca_topic_score_codex":0.0011029902,"about_ca_topic_score_gemma":0.00009962006,"teacher_disagreement_score":0.52325034,"about_ca_system_score_codex":0.0003517448,"about_ca_system_score_gemma":0.00055546954,"threshold_uncertainty_score":0.9996835},"labels":[],"label_agreement":null},{"id":"W3203312918","doi":"10.1007/978-3-030-69318-3_19","title":"Nuclear Magnetic Resonance","year":2021,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Nuclear magnetic resonance; Molecule; Physics; Qubit; Spin (aerodynamics); Spin echo; Resonance (particle physics); Atomic physics; Magnetic resonance imaging; Quantum; Quantum mechanics","score_opus":0.028574771554622295,"score_gpt":0.2724691357042072,"score_spread":0.24389436414958493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203312918","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024938816,0.20851576,0.0074892947,0.10902941,0.026309794,0.011653887,0.0020764028,0.0076462915,0.60234034],"genre_scores_gemma":[0.0033812118,0.007659428,0.02584253,0.0013360662,0.0030635286,0.000064783635,0.00006032798,0.00028161684,0.9583105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99553704,0.00036331807,0.0005156271,0.0010611985,0.0015410506,0.0009817424],"domain_scores_gemma":[0.99681926,0.00037619675,0.00015679536,0.0019548608,0.000522811,0.00017007442],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002095639,0.0004917065,0.0006122671,0.00007296169,0.0014027962,0.001832833,0.0029906447,0.0004482979,0.00074146414],"category_scores_gemma":[0.000042988228,0.0003670855,0.00037690083,0.00023094295,0.0010523965,0.00023556477,0.0033495338,0.0012713847,0.00034851453],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051658175,0.000058385536,7.0770994e-7,0.0004990199,0.00016418583,0.00033476134,0.007679262,0.000037043057,0.01386029,0.73950905,0.14886859,0.08893704],"study_design_scores_gemma":[0.00015730744,0.00025652346,0.000022330647,0.0003493362,0.0000086274595,0.00011563926,0.00011256052,0.0017172081,0.000809441,0.03746906,0.95850724,0.0004747098],"about_ca_topic_score_codex":0.00004976087,"about_ca_topic_score_gemma":0.000018521085,"teacher_disagreement_score":0.8096387,"about_ca_system_score_codex":0.00011229714,"about_ca_system_score_gemma":0.00039951626,"threshold_uncertainty_score":0.99989724},"labels":[],"label_agreement":null},{"id":"W3204074965","doi":"10.1088/1751-8121/acbace","title":"Outcome determinism in measurement-based quantum computation with qudits","year":2023,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"Air Force Office of Scientific Research; Agence Nationale de la Recherche","keywords":"Algorithm; Computer science; Dimension (graph theory); Artificial intelligence; Mathematics; Combinatorics","score_opus":0.024941486130474196,"score_gpt":0.2658597005711094,"score_spread":0.24091821444063521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204074965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40963277,0.000008461685,0.58916163,0.0010204461,0.00004965211,0.000050496586,3.912421e-7,0.000026384501,0.00004974033],"genre_scores_gemma":[0.96619064,0.0000011214846,0.03364117,0.00008579592,0.00006967087,0.0000014478907,1.8361604e-7,0.000008988398,9.871255e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851304,0.000105028805,0.00042234617,0.00015206852,0.0005855684,0.00022193347],"domain_scores_gemma":[0.99905056,0.0004344109,0.00014772134,0.00012458666,0.0001246908,0.00011800761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010948728,0.0001308552,0.00031613806,0.00011300935,0.00004946411,0.000096440766,0.00025693342,0.000040788807,0.0000027434235],"category_scores_gemma":[0.0001318098,0.00008106001,0.00007180956,0.00038467484,0.00019033381,0.000101251324,0.00007995969,0.00028379232,0.000010503276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001630012,0.00012521948,0.000106766565,0.000067645735,0.000011776183,0.00010677923,0.00031970843,0.0019159801,0.00008519195,0.98311937,0.0000116329475,0.014113629],"study_design_scores_gemma":[0.00038530384,0.0001989191,0.0004579765,0.00013843182,0.00000634738,0.00005080496,0.000013442032,0.51993394,0.0001287202,0.47861767,0.0000023308105,0.000066128],"about_ca_topic_score_codex":2.1673583e-7,"about_ca_topic_score_gemma":1.345357e-7,"teacher_disagreement_score":0.55655783,"about_ca_system_score_codex":0.000016576412,"about_ca_system_score_gemma":0.000057804733,"threshold_uncertainty_score":0.3305531},"labels":[],"label_agreement":null},{"id":"W3204280520","doi":"10.26421/qic21.13-14-2","title":"On the extremal points of the Λ-polytopes and classical simulation of quantum computation with magic states","year":2021,"lang":"en","type":"article","venue":"Bilkent University Institutional Repository (Bilkent University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polytope; Lambda; Combinatorics; Mathematics; Quantum computer; Computation; Vertex (graph theory); Qubit; MAGIC (telescope); Regular polygon; Discrete mathematics; Quantum; Quantum mechanics; Physics; Geometry; Algorithm; Graph","score_opus":0.01041155962553626,"score_gpt":0.18404950856853364,"score_spread":0.1736379489429974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204280520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8275709,0.000022519993,0.16975513,0.0011411275,0.0001724762,0.00013875285,0.000011179497,0.000029715939,0.0011581767],"genre_scores_gemma":[0.99821645,0.000009336351,0.0012945393,0.000045566176,0.000016421167,3.7382144e-8,0.000004557834,0.0000030909703,0.00040997926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986899,0.00025618356,0.0001442932,0.0003276721,0.00044086855,0.00014109282],"domain_scores_gemma":[0.9987327,0.00041820994,0.00021151495,0.00030401014,0.00026990092,0.00006370708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010421214,0.00013696928,0.00015903002,0.00014743417,0.0006112397,0.00003402155,0.00045764502,0.00005345501,0.0000030418155],"category_scores_gemma":[0.000030149404,0.000094834184,0.00009939354,0.0006603457,0.00053068047,0.00021865347,0.00037505451,0.00017879665,9.025234e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120837954,0.0002219168,0.0023976238,0.00002918934,0.000068052774,0.00018946038,0.00043652963,0.62725043,0.0006329408,0.368033,0.00004699801,0.0005730059],"study_design_scores_gemma":[0.00088357774,0.00019785317,0.025660172,0.00021712972,0.000056670367,0.00007729758,0.0005957321,0.9650782,0.0025699076,0.001398343,0.0030732416,0.00019187004],"about_ca_topic_score_codex":0.000038617465,"about_ca_topic_score_gemma":0.000010642601,"teacher_disagreement_score":0.36663464,"about_ca_system_score_codex":0.0001247477,"about_ca_system_score_gemma":0.00036031942,"threshold_uncertainty_score":0.4701223},"labels":[],"label_agreement":null},{"id":"W3204653979","doi":"10.1103/physrevlett.129.050504","title":"Constant-Overhead Quantum Error Correction with Thin Planar Connectivity","year":2022,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Qubit; Low-density parity-check code; Quantum convolutional code; Computer science; Error detection and correction; Quantum computer; Quantum error correction; Parity bit; Planar; Quantum; Topology (electrical circuits); Algorithm; Discrete mathematics; Physics; Mathematics; Quantum mechanics; Decoding methods; Combinatorics","score_opus":0.014136393074104872,"score_gpt":0.25880042349915267,"score_spread":0.2446640304250478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204653979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.604262,0.0033765456,0.3387234,0.049425893,0.0021531435,0.00095576426,0.00002550902,0.00070984004,0.00036792803],"genre_scores_gemma":[0.9708539,0.00009278345,0.002027743,0.026750319,0.00016823687,0.00006721504,0.000007707281,0.00001915947,0.000012895014],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980718,0.0003574647,0.00018362039,0.00052500085,0.0005253979,0.00033675172],"domain_scores_gemma":[0.9988946,0.00032640249,0.0001614367,0.00049559865,0.000025296378,0.000096672185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034128776,0.00021091936,0.0003883994,0.000047048743,0.00040982058,0.000056880817,0.00062074425,0.0000056450313,0.000014732561],"category_scores_gemma":[0.000034883877,0.000163682,0.00013534876,0.0005745358,0.00007624466,0.00015302877,0.00022089845,0.0005558941,0.000023867371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023329901,0.0027156398,0.0016592694,0.0026922016,0.0005345561,0.0011846926,0.0058486923,0.21452537,0.014563983,0.13626495,0.31804913,0.30172822],"study_design_scores_gemma":[0.00030784216,0.00037006094,0.00057116343,0.00040779362,0.000030492474,0.00020690233,0.000021031145,0.9768126,0.00007353297,0.00103228,0.019769583,0.00039673966],"about_ca_topic_score_codex":0.000049754286,"about_ca_topic_score_gemma":0.000003738145,"teacher_disagreement_score":0.7622872,"about_ca_system_score_codex":0.00007893337,"about_ca_system_score_gemma":0.00006038761,"threshold_uncertainty_score":0.6674758},"labels":[],"label_agreement":null},{"id":"W3204929455","doi":"10.1109/aces53325.2021.00103","title":"Quantum Algorithms for the Solution of Matrix Equations in Electromagnetics","year":2021,"lang":"en","type":"article","venue":"2021 International Applied Computational Electromagnetics Society Symposium (ACES)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Scattering-matrix method; Electromagnetics; Computational electromagnetics; Matrix (chemical analysis); Mathematics; Method of moments (probability theory); Algorithm; Applied mathematics; Mathematical optimization; Mathematical analysis; Computer science; Maxwell's equations; Electromagnetic field; Physics; Quantum mechanics","score_opus":0.009460363540407787,"score_gpt":0.25792389767753265,"score_spread":0.24846353413712485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204929455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078150835,0.00083705276,0.9740152,0.01545845,0.00067218696,0.0005041814,0.000050355608,0.00007448626,0.00057301373],"genre_scores_gemma":[0.59578276,0.00025974738,0.40210193,0.0005841649,0.00043238836,0.00017555915,0.00027140998,0.000037702757,0.0003543231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699503,0.00007757203,0.0007692618,0.00070521614,0.0009056719,0.00054723735],"domain_scores_gemma":[0.9967465,0.0016621256,0.00034047788,0.00042234221,0.00074783893,0.0000807486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005367634,0.00030812417,0.0003267229,0.00013245744,0.00032068678,0.00024482523,0.001226896,0.00015059992,0.000033479362],"category_scores_gemma":[0.000074563635,0.00029287644,0.00035452275,0.0010404725,0.0001321624,0.00013810702,0.00035749105,0.00042972754,0.000008722725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023547975,0.000354248,0.000024409594,0.00003685517,0.00019259151,0.0000040545046,0.001027203,0.45174405,0.051827513,0.4829889,0.0013870638,0.0103895655],"study_design_scores_gemma":[0.0010187319,0.00024249457,0.0004200523,0.000022146147,0.000032908414,0.00003889805,0.000087135624,0.9274307,0.0034948802,0.06534636,0.0015795846,0.00028613006],"about_ca_topic_score_codex":0.000030171661,"about_ca_topic_score_gemma":0.000018945564,"teacher_disagreement_score":0.5879677,"about_ca_system_score_codex":0.00019137554,"about_ca_system_score_gemma":0.0006753296,"threshold_uncertainty_score":0.9999523},"labels":[],"label_agreement":null},{"id":"W3205637322","doi":"10.1098/rsta.2021.0062","title":"Towards quantum simulations in particle physics and beyond on noisy intermediate-scale quantum devices","year":2021,"lang":"en","type":"article","venue":"Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum; Scale (ratio); Quantum computer; Quantum circuit; Physics; Electronic circuit; Quantum simulator; Computer science; Quantum algorithm; Open quantum system; Quantum network; Quantum technology; Statistical physics; Theoretical physics; Quantum mechanics","score_opus":0.015341245974622993,"score_gpt":0.2407054919473694,"score_spread":0.2253642459727464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205637322","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72533625,0.000046842342,0.26833406,0.006040474,0.00007715926,0.00006711182,0.0000063269968,0.000044371372,0.000047377573],"genre_scores_gemma":[0.9916954,0.0000037062691,0.008072857,0.00014720026,0.00006645425,0.0000049822943,1.8082022e-7,0.0000057904845,0.000003406689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988916,0.00003719993,0.00020652644,0.0003173238,0.00031228983,0.00023504176],"domain_scores_gemma":[0.99919,0.0004529299,0.000037801823,0.0001946454,0.000028669407,0.000095955176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013822899,0.00014580385,0.00024333318,0.000015213207,0.00021642385,0.00008563107,0.00031602962,0.000046990226,0.0000028188501],"category_scores_gemma":[0.00004677052,0.00009745077,0.00015163675,0.00053251855,0.00035105302,0.00012873494,0.0000923704,0.0003019318,0.0000010223147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035258647,0.00071239355,0.00008115014,0.00021366868,0.00003446571,0.0000018104745,0.0031232361,0.59786123,0.0014214872,0.3906933,0.0000026043203,0.0058511198],"study_design_scores_gemma":[0.000117246535,0.000070578644,0.0012765805,0.0000787883,0.000009937942,0.0000023790108,0.000029498477,0.78849655,0.00095309387,0.20886402,0.000003897341,0.00009742204],"about_ca_topic_score_codex":0.000004410605,"about_ca_topic_score_gemma":7.5797897e-7,"teacher_disagreement_score":0.26635915,"about_ca_system_score_codex":0.000011468178,"about_ca_system_score_gemma":0.000030560142,"threshold_uncertainty_score":0.39739272},"labels":[],"label_agreement":null},{"id":"W3205762000","doi":"10.5281/zenodo.5358543","title":"Supplemental data for \"Large-scale quantum machine learning\"","year":2021,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scale (ratio); Computer science; Artificial intelligence; Machine learning; Cartography; Geography","score_opus":0.031125892195129522,"score_gpt":0.26558553900949344,"score_spread":0.23445964681436393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205762000","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001952854,0.00024438283,0.117886536,0.0009592244,0.00045021906,0.00047738914,0.87911326,0.00063538004,0.00021408642],"genre_scores_gemma":[0.00009132572,0.0001629122,0.0070095155,0.0002151273,0.0004885167,9.335322e-8,0.99097806,0.000799466,0.0002549559],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99612474,0.0005560495,0.00044872626,0.0014366815,0.0006552068,0.0007786105],"domain_scores_gemma":[0.9963182,0.00009153695,0.00027355424,0.002625288,0.00043763837,0.00025373735],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0014392592,0.00036469882,0.00038464362,0.00030004748,0.0034714832,0.0023265393,0.0077387695,0.00016357296,0.0044034645],"category_scores_gemma":[0.00071060855,0.00037457867,0.00012290337,0.000666661,0.00008177118,0.00031711638,0.014701778,0.00097564625,0.0015656544],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013412077,0.00019541338,1.1719796e-7,0.00015506412,0.00006118075,0.00003447831,0.00015271796,0.00011617986,0.00003978835,0.0003581291,0.98142934,0.01744416],"study_design_scores_gemma":[0.00054837734,0.0002783314,0.0000044080325,0.00005724481,0.00002442588,0.00017977113,0.00005150193,0.17405109,0.000014181275,0.00008228708,0.8243616,0.00034672418],"about_ca_topic_score_codex":0.000046215817,"about_ca_topic_score_gemma":0.000004422773,"teacher_disagreement_score":0.17393492,"about_ca_system_score_codex":0.00009946635,"about_ca_system_score_gemma":0.00002069986,"threshold_uncertainty_score":0.9998706},"labels":[],"label_agreement":null},{"id":"W3206042850","doi":"10.1007/s11128-021-03280-0","title":"A normal form for single-qudit Clifford+T operators","year":2021,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Science and Engineering Research Board; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Dimension (graph theory); Prime (order theory); Quantum computer; Clifford algebra; Operator (biology); Uniqueness; Polynomial; Mathematics; Discrete mathematics; Computer science; Combinatorics; Pure mathematics; Algebra over a field; Physics; Quantum mechanics; Quantum; Mathematical analysis","score_opus":0.013295752482137485,"score_gpt":0.2399768659684489,"score_spread":0.2266811134863114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206042850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03483317,0.00014658646,0.96047527,0.0012415181,0.0006091815,0.00019147752,0.000009383774,0.00036290215,0.0021305054],"genre_scores_gemma":[0.8499064,0.0000047364365,0.14778113,0.0019350705,0.00019844234,0.000037799204,0.00006374185,0.00001456485,0.000058145888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983952,0.000022498207,0.0005573276,0.00024360431,0.00032769307,0.00045367083],"domain_scores_gemma":[0.9987085,0.00007445494,0.00025627099,0.00031925912,0.0005249804,0.00011657686],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00034208162,0.0001989486,0.00020405011,0.0001557998,0.00061455363,0.0011492687,0.00050768023,0.00009116466,0.000008220997],"category_scores_gemma":[0.00016279683,0.00018170771,0.000107054926,0.00065300707,0.000033569762,0.0037695672,0.00020470763,0.00017533617,0.000032483666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014064923,0.000083060324,0.000060980605,0.0004013439,0.000017634722,0.000007634747,0.0060282876,0.003924585,0.0007978089,0.05043567,0.00088660436,0.93734235],"study_design_scores_gemma":[0.00054443034,0.000109174216,0.00006659656,0.00010516593,0.000006399765,0.00015956325,0.00029954343,0.9468528,0.006612523,0.00522249,0.039720383,0.0003009072],"about_ca_topic_score_codex":0.0000027366361,"about_ca_topic_score_gemma":0.0000012100758,"teacher_disagreement_score":0.94292825,"about_ca_system_score_codex":0.000055561522,"about_ca_system_score_gemma":0.00034515283,"threshold_uncertainty_score":0.99988765},"labels":[],"label_agreement":null},{"id":"W3206240087","doi":"10.1007/978-3-030-83098-4_9","title":"Potential Quantum Advantages","year":2021,"lang":"en","type":"book-chapter","venue":"Quantum science and technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Quantum; Computer science; Physics; Quantum mechanics","score_opus":0.006696341037394113,"score_gpt":0.22692636025985374,"score_spread":0.22023001922245963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206240087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06250678,0.065106824,0.44330984,0.10841567,0.023298625,0.0031969498,0.0001692507,0.013084877,0.28091118],"genre_scores_gemma":[0.69276404,0.0076231323,0.10653861,0.0030739643,0.0017054745,0.00006867944,0.00004628889,0.00037997233,0.18779986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959684,0.000016559608,0.0004503745,0.0017513081,0.0009632338,0.00085009617],"domain_scores_gemma":[0.9973884,0.00006577373,0.00029381484,0.0014616798,0.00057326973,0.00021703003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000642114,0.0005264954,0.0006223405,0.0014522033,0.0008160827,0.0004501498,0.002765961,0.0005608915,0.00003213469],"category_scores_gemma":[0.00014054992,0.0004728646,0.00010893682,0.00091699656,0.002304007,0.00035564756,0.0025304642,0.001058713,0.00006909918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011311355,0.000015360723,0.0000053553354,0.000020366571,0.000014707013,0.00040403055,0.000034119064,0.000009007197,0.0018602413,0.9157282,0.00025223623,0.08165525],"study_design_scores_gemma":[0.00034911933,0.0005030081,0.000047363763,0.00032338515,0.000036096117,0.0021240893,0.000056010376,0.2045389,0.0016007388,0.64273643,0.1464795,0.0012053612],"about_ca_topic_score_codex":0.0000070909327,"about_ca_topic_score_gemma":0.0000028304103,"teacher_disagreement_score":0.63025725,"about_ca_system_score_codex":0.00007332155,"about_ca_system_score_gemma":0.0008452732,"threshold_uncertainty_score":0.9997723},"labels":[],"label_agreement":null},{"id":"W3206309997","doi":"10.22331/q-2022-04-20-692","title":"New techniques for bounding stabilizer rank","year":2022,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Government of Ontario; Villum Fonden","keywords":"Rank (graph theory); Multiplicative function; Stabilizer (aeronautics); Mathematics; Bounding overwatch; Tensor product; Algebraic number; Product (mathematics); Discrete mathematics; Pure mathematics; Combinatorics; Computer science; Mathematical analysis; Geometry","score_opus":0.01449974620540161,"score_gpt":0.25951066003356954,"score_spread":0.24501091382816792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206309997","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121942405,0.00020448014,0.9824132,0.0027969342,0.0010476033,0.00034206212,0.000007818652,0.0006433042,0.00035035954],"genre_scores_gemma":[0.42846465,0.0000046788564,0.56874096,0.0009805871,0.0006633366,0.00014356384,0.000008353703,0.000039893097,0.00095394405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866736,0.00007140178,0.00020042491,0.00040929735,0.00028436427,0.00036718205],"domain_scores_gemma":[0.99915683,0.00017484862,0.000082072926,0.0004617235,0.000029623588,0.0000949173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051910075,0.00013609127,0.00016644868,0.00012259143,0.00063507765,0.00014781808,0.00096910313,0.000026031523,0.000051354415],"category_scores_gemma":[0.000036221125,0.00012929941,0.00011924881,0.0003620933,0.000017955574,0.000117221345,0.0005260658,0.00022281065,0.0000051668194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028331553,0.00008497401,0.000082872946,0.000032882497,0.000024294788,0.000019088291,0.0020002564,0.0013966201,0.0025954854,0.3836391,0.035580207,0.5745159],"study_design_scores_gemma":[0.0003056177,0.0003849445,0.000051289466,0.000009804948,0.0000043178134,0.000045399676,0.00004582569,0.5120348,0.0018502099,0.08408042,0.40093696,0.00025045482],"about_ca_topic_score_codex":0.000039524024,"about_ca_topic_score_gemma":0.0000014185187,"teacher_disagreement_score":0.5742654,"about_ca_system_score_codex":0.000059514816,"about_ca_system_score_gemma":0.00014689512,"threshold_uncertainty_score":0.5272677},"labels":[],"label_agreement":null},{"id":"W3206350857","doi":"10.1103/prxquantum.3.020364","title":"Nearly Optimal Quantum Algorithm for Generating the Ground State of a Free Quantum Field Theory","year":2022,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Calgary","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Government of Alberta","keywords":"Quantum algorithm; Quantum computer; Quantum Fourier transform; Algorithm; Ground state; Quantum phase estimation algorithm; Mathematics; Quantum; Computer science; Quantum mechanics; Quantum error correction; Physics","score_opus":0.012917447717409524,"score_gpt":0.2397666228348025,"score_spread":0.22684917511739297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206350857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18470319,0.0009040109,0.8094336,0.0024250073,0.00156032,0.0006133306,0.00011382859,0.0002156757,0.000031040385],"genre_scores_gemma":[0.74984926,0.000031871805,0.24583496,0.0025659536,0.00073390827,0.0004499193,0.000029772242,0.00011751635,0.00038684206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961794,0.00061473355,0.00074900105,0.00081257307,0.00079416437,0.00085010834],"domain_scores_gemma":[0.9957853,0.0019066235,0.00048435412,0.001489086,0.00017146199,0.00016319912],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0025594886,0.00039020038,0.000481652,0.000186851,0.0015000603,0.000298822,0.00326681,0.00006343792,0.000038878858],"category_scores_gemma":[0.00035105422,0.00030191793,0.00035298578,0.0006992045,0.0001622862,0.0002698106,0.001927838,0.00075770397,0.0000047379554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012225259,0.00038914126,0.000023102572,0.00009423523,0.00022029999,0.000058777023,0.009355081,0.06685016,0.0024426067,0.3543336,0.005605919,0.5605048],"study_design_scores_gemma":[0.0006492866,0.0011517791,0.000080939346,0.000021754198,0.000021442109,0.00008030844,0.00029634198,0.88153696,0.00088628853,0.11114285,0.0037669095,0.00036517123],"about_ca_topic_score_codex":0.00021268391,"about_ca_topic_score_gemma":0.000006545739,"teacher_disagreement_score":0.8146868,"about_ca_system_score_codex":0.000057131707,"about_ca_system_score_gemma":0.00029042875,"threshold_uncertainty_score":0.9999433},"labels":[],"label_agreement":null},{"id":"W3206451759","doi":"10.1007/978-3-030-83098-4","title":"Machine Learning with Quantum Computers","year":2021,"lang":"en","type":"book","venue":"Quantum science and technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":382,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Computer science; Quantum machine learning; Quantum computer; Quantum; Physics; Quantum mechanics","score_opus":0.006509453553476684,"score_gpt":0.20990750393431148,"score_spread":0.2033980503808348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206451759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026713395,0.035829347,0.77836394,0.0452136,0.007210154,0.0024072276,0.00004821935,0.011621872,0.09259224],"genre_scores_gemma":[0.34801388,0.0045498516,0.37720492,0.004887081,0.0017542607,0.00016789153,0.00018932615,0.00067267625,0.26256013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956926,0.00005158881,0.00039744843,0.0018358821,0.0010374553,0.0009849928],"domain_scores_gemma":[0.99745417,0.000172716,0.0003550066,0.0011928391,0.00059089204,0.00023436642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008219747,0.0005788965,0.0007322328,0.0015246011,0.0010509527,0.000575482,0.0028212504,0.00043635466,0.000007867075],"category_scores_gemma":[0.00015294063,0.0004600872,0.00006845863,0.0026446416,0.0024215986,0.0003286325,0.0021131795,0.0017895048,0.000028704348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046713963,0.00004999185,0.000114360184,0.00008028084,0.00004868931,0.0007063599,0.00026458758,0.00022273474,0.00035389117,0.8811719,0.0011393134,0.115843214],"study_design_scores_gemma":[0.00040497608,0.0009525657,0.00003116765,0.00047498112,0.000023564287,0.0014318629,0.00004118628,0.7813286,0.00028577613,0.05512443,0.15901458,0.00088627863],"about_ca_topic_score_codex":0.000018944767,"about_ca_topic_score_gemma":0.000008474618,"teacher_disagreement_score":0.8260475,"about_ca_system_score_codex":0.00015025862,"about_ca_system_score_gemma":0.0020998945,"threshold_uncertainty_score":0.99978507},"labels":[],"label_agreement":null},{"id":"W3207729735","doi":"10.1038/s41534-022-00651-y","title":"T-count and T-depth of any multi-qubit unitary","year":2022,"lang":"lv","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Innovation, Science and Economic Development Canada","keywords":"Gate count; Qubit; Mathematics; Unitary state; Quantum computer; Combinatorics; Discrete mathematics; Quantum gate; Quantum; Quantum mechanics; Physics; Computer science; Law","score_opus":0.013813185501065868,"score_gpt":0.22925991885755947,"score_spread":0.2154467333564936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207729735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8430047,0.0011189602,0.150893,0.0013900836,0.0020380865,0.00058303756,0.00016422615,0.0001920324,0.00061584736],"genre_scores_gemma":[0.9912406,0.00009459124,0.0077511985,0.00069228595,0.000075541466,0.000017097855,0.00006831946,0.000013668195,0.00004669275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974417,0.00019970498,0.0008548899,0.0002794341,0.00076924544,0.0004550245],"domain_scores_gemma":[0.998365,0.00013697444,0.00062007544,0.0005518459,0.00018399871,0.00014209312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009953091,0.00028763898,0.00034529364,0.00043657274,0.0007246369,0.00020108462,0.0007569764,0.00008927572,0.000046002624],"category_scores_gemma":[0.0000659231,0.00029225912,0.00010683408,0.0008052739,0.00012364026,0.0013073,0.0011233281,0.0006102976,0.000033212415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024876784,0.00062618125,0.0039886027,0.0011186376,0.00019938925,0.000050768787,0.083408855,0.14047432,0.00051128434,0.08740955,0.0039589535,0.6780047],"study_design_scores_gemma":[0.0009036994,0.0005637117,0.015227216,0.000061688464,0.00002005895,0.00017113428,0.0011535571,0.96092856,0.00007525586,0.0008712797,0.0196954,0.00032843894],"about_ca_topic_score_codex":0.00035918283,"about_ca_topic_score_gemma":0.000009742512,"teacher_disagreement_score":0.82045424,"about_ca_system_score_codex":0.00009374428,"about_ca_system_score_gemma":0.00023741595,"threshold_uncertainty_score":0.999953},"labels":[],"label_agreement":null},{"id":"W3207862145","doi":"10.1109/access.2021.3119588","title":"A Novel Efficient Quantum Random Access Memory","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Random access; Quantum; Random access memory; Quantum information; Theoretical computer science; Distributed computing; Parallel computing; Computer network; Computer hardware; Physics; Quantum mechanics","score_opus":0.027555171439893427,"score_gpt":0.2958802758361708,"score_spread":0.2683251043962774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207862145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27361083,0.00025831402,0.72087467,0.0013179028,0.0026700513,0.00013791124,0.000005090908,0.00027891793,0.00084632204],"genre_scores_gemma":[0.98712844,0.000012445939,0.010600075,0.0015361566,0.0004895583,0.000019844838,0.0000036059832,0.000024660663,0.00018522114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771017,0.00010282976,0.0003479206,0.0007942938,0.0005135003,0.0005312704],"domain_scores_gemma":[0.99816954,0.00028921716,0.00014483317,0.0010084213,0.0002085196,0.0001794498],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00037138013,0.00025278504,0.0003374982,0.00014502513,0.00030185288,0.0015397304,0.0031903589,0.00008334165,0.000029869108],"category_scores_gemma":[0.000093364266,0.00021831712,0.00017112562,0.0010965387,0.000059538568,0.0004965944,0.0013011214,0.0003233615,0.000039249375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075678676,0.0012974398,0.00041120418,0.00020248027,0.00018198753,0.0010316502,0.002110175,0.7738025,0.02378676,0.010914116,0.0073356237,0.17885038],"study_design_scores_gemma":[0.0016916136,0.000022830418,0.0017258915,0.000072366456,0.000010907889,0.00019283172,0.000010037408,0.96262103,0.030301942,0.001510716,0.0014666502,0.00037316742],"about_ca_topic_score_codex":0.00009379744,"about_ca_topic_score_gemma":0.000014351458,"teacher_disagreement_score":0.7135176,"about_ca_system_score_codex":0.000033151966,"about_ca_system_score_gemma":0.0002434773,"threshold_uncertainty_score":0.99949676},"labels":[],"label_agreement":null},{"id":"W3207920945","doi":"10.1103/physrevresearch.4.033217","title":"Toward reliability in the NISQ era: Robust interval guarantee for quantum measurements on approximate states","year":2022,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Canadian Institute for Advanced Research; University of Toronto","funders":"Office of Naval Research; Botnar Research Centre for Child Health, University of Basel; Horizon 2020; Eidgenössische Technische Hochschule Zürich; Innosuisse - Schweizerische Agentur für Innovationsförderung; European Commission; Shanghai Jiao Tong University; Cisco Systems; U.S. Department of Energy; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Robustness (evolution); Computer science; Observable; Quantum computer; Fidelity; Algorithm; Imperfect; Ideal (ethics); Quantum; Theoretical computer science; Mathematical optimization; Mathematics; Quantum mechanics","score_opus":0.1783482991860099,"score_gpt":0.4028264590358221,"score_spread":0.2244781598498122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207920945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4998551,0.030536924,0.22508842,0.22236125,0.0015678003,0.017964194,0.0001843381,0.00056027167,0.0018817027],"genre_scores_gemma":[0.991964,0.00068420183,0.0036700538,0.00213246,0.00018859553,0.0012947008,0.000016565082,0.000024390738,0.000025060088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943671,0.0020447716,0.00035664166,0.00071419775,0.0018090063,0.0007082589],"domain_scores_gemma":[0.997026,0.0016890051,0.00007498416,0.00095024693,0.00019727738,0.000062485255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008824557,0.0001869097,0.00040065788,0.00010393144,0.0005205067,0.00014580686,0.0025773677,0.00001457849,0.000008037645],"category_scores_gemma":[0.0007862694,0.0001180189,0.00022918824,0.0011991956,0.00010773024,0.00009826221,0.0009909093,0.0012949681,0.000017998851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004392887,0.008851888,0.00025408404,0.009024369,0.00012608,0.0001221959,0.015003652,0.08578159,0.0006165369,0.19289336,0.06651377,0.6203732],"study_design_scores_gemma":[0.00032515163,0.0009323884,0.00021797013,0.00047482646,0.0000049483465,0.0000066237308,0.00006877522,0.90054923,0.000058412334,0.08549606,0.011693506,0.00017212279],"about_ca_topic_score_codex":0.00005429054,"about_ca_topic_score_gemma":0.0000026533164,"teacher_disagreement_score":0.8147676,"about_ca_system_score_codex":0.00014657532,"about_ca_system_score_gemma":0.0001208326,"threshold_uncertainty_score":0.5626064},"labels":[],"label_agreement":null},{"id":"W3208141921","doi":"10.13001/ela.2022.6721","title":"Strong cospectrality and twin vertices in weighted graphs","year":2022,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Adjacency matrix; Combinatorics; Joins; Mathematics; Graph homomorphism; Graph; Algebraic properties; Adjacency list; Algebraic number; Discrete mathematics; Computer science; Graph power; Line graph","score_opus":0.006627293534976792,"score_gpt":0.23266641883297126,"score_spread":0.22603912529799447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208141921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9736632,0.003168843,0.02104374,0.0016830397,0.00030884167,0.00006434191,9.853203e-7,0.000025497746,0.00004151387],"genre_scores_gemma":[0.99510086,0.00007784818,0.004560978,0.0001464669,0.000081088154,0.0000013704498,5.129292e-7,0.0000081111175,0.000022781187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983116,0.00022555188,0.0003882888,0.00020500715,0.0003777109,0.0004918479],"domain_scores_gemma":[0.99937797,0.0000922604,0.00022673659,0.00018283649,0.000039736202,0.00008049051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001141762,0.00012088695,0.00023344364,0.00023847686,0.00018974958,0.000055586675,0.0006662053,0.000023703358,0.000019529334],"category_scores_gemma":[0.000020653162,0.000106157335,0.000084524414,0.00056157843,0.000033017666,0.00019265599,0.00023682868,0.0010503802,8.380387e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030206534,0.0010564646,0.017822225,0.00005855321,0.00042395506,0.00068346,0.0072520785,0.018494183,0.0026923514,0.8093308,0.00074202265,0.14114183],"study_design_scores_gemma":[0.0028313538,0.0029664862,0.017735098,0.000048097892,0.000030930805,0.001791444,0.00025163285,0.72211254,0.001214161,0.2431349,0.007368057,0.00051530055],"about_ca_topic_score_codex":0.00002551044,"about_ca_topic_score_gemma":0.000016285285,"teacher_disagreement_score":0.70361835,"about_ca_system_score_codex":0.00012227826,"about_ca_system_score_gemma":0.0002835517,"threshold_uncertainty_score":0.45634374},"labels":[],"label_agreement":null},{"id":"W3208651741","doi":"10.1109/ims19712.2021.9574852","title":"Quantum Method for Finite Element Simulation of Electromagnetic Problems","year":2021,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Finite element method; Smoothed finite element method; Mixed finite element method; Applied mathematics; Extended finite element method; Computer science; Quantum computer; hp-FEM; Quantum algorithm; Mathematical optimization; Computational science; Finite element limit analysis; Quantum; Mathematics; Algorithm; Boundary knot method; Physics; Quantum mechanics; Boundary element method","score_opus":0.017040442057868675,"score_gpt":0.2841682860502705,"score_spread":0.2671278439924018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208651741","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041661076,0.00012922447,0.9942952,0.0008110343,0.00012533921,0.00018987317,0.0000019892957,0.00008076656,0.0002004839],"genre_scores_gemma":[0.25790992,0.000002942994,0.74163574,0.00016884803,0.000039146264,0.000010752981,0.0000046110895,0.000006308566,0.00022169345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989637,0.00007391608,0.00026033082,0.00030459953,0.00017039069,0.00022706842],"domain_scores_gemma":[0.99879384,0.00057478447,0.00008947303,0.0003216373,0.00017952871,0.0000407448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032435605,0.00009564181,0.00015689096,0.000056918285,0.00006588165,0.00004910458,0.00026723594,0.000032234228,0.000016772658],"category_scores_gemma":[0.000083988525,0.00008162153,0.00008756477,0.00032668654,0.00000873206,0.00005939455,0.00011568363,0.00006426417,0.0000019890665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025817153,0.0000690739,0.000009502134,0.00005453448,0.000016096648,0.000001572107,0.00026965662,0.85679644,0.009264691,0.04459364,0.00007314159,0.08884908],"study_design_scores_gemma":[0.0002837427,0.00030745004,0.0000841886,0.000017017497,0.0000058124174,0.0000042983916,0.0000058943065,0.9542347,0.013870553,0.028421462,0.0026633407,0.00010149577],"about_ca_topic_score_codex":0.000008813636,"about_ca_topic_score_gemma":0.000004605705,"teacher_disagreement_score":0.25374383,"about_ca_system_score_codex":0.0000099627705,"about_ca_system_score_gemma":0.000078665034,"threshold_uncertainty_score":0.33284295},"labels":[],"label_agreement":null},{"id":"W3208651839","doi":"10.1049/qtc2.12042","title":"Surface code design for asymmetric error channels","year":2022,"lang":"en","type":"article","venue":"IET Quantum Communication","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Asymmetry; Qubit; Pauli exclusion principle; Code (set theory); Surface (topology); Channel (broadcasting); Physics; Mathematics; Pauli matrices; Algorithm; Computer science; Quantum; Quantum mechanics; Telecommunications; Geometry","score_opus":0.05245363103097397,"score_gpt":0.29201447590310964,"score_spread":0.23956084487213566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208651839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026363041,0.0013124553,0.9641987,0.006235819,0.0006596607,0.0006669136,0.000023240902,0.0004046655,0.00013548012],"genre_scores_gemma":[0.7737554,0.000031747768,0.22547174,0.00038412272,0.00003873462,0.00012556362,0.000032438285,0.00002336331,0.00013689991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977985,0.0007002571,0.00033318432,0.00041625858,0.0003707488,0.00038107272],"domain_scores_gemma":[0.9967978,0.0010600137,0.00023944714,0.001704591,0.00011573073,0.00008239073],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017287469,0.00018277562,0.00022059053,0.0001851812,0.0013077261,0.00017357251,0.0030121757,0.000046161284,0.000008841433],"category_scores_gemma":[0.000109296794,0.00019086932,0.00011833538,0.0011281064,0.00004525915,0.00019804032,0.0012331342,0.00039475778,0.00001398934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004370043,0.00032660377,0.000034871544,0.000025114787,0.00004275941,0.0000031890143,0.0026791256,0.84224814,0.0005854398,0.09826676,0.014167832,0.041576467],"study_design_scores_gemma":[0.00041295908,0.00031163564,0.00010112174,0.000010266446,0.0000069146136,0.000024567478,0.000079198144,0.9471834,0.00044948043,0.023526669,0.02765536,0.00023844143],"about_ca_topic_score_codex":0.000045400626,"about_ca_topic_score_gemma":0.0000023071268,"teacher_disagreement_score":0.74739236,"about_ca_system_score_codex":0.00009885773,"about_ca_system_score_gemma":0.00010572352,"threshold_uncertainty_score":0.99999243},"labels":[],"label_agreement":null},{"id":"W3208726560","doi":"10.1038/s41598-021-00502-4","title":"Neural networks can learn to utilize correlated auxiliary noise","year":2021,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Perimeter Institute; University of Waterloo","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Noise (video); Computer science; DECIPHER; Artificial neural network; Key (lock); Exploit; Process (computing); Quantum decoherence; Artificial intelligence; Machine learning; Quantum; Bioinformatics; Biology; Physics","score_opus":0.009918908438403146,"score_gpt":0.22767414791322188,"score_spread":0.21775523947481873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208726560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73725027,0.0004882205,0.21474575,0.0042402414,0.041108925,0.00031417573,0.000001641216,0.00070042635,0.0011503301],"genre_scores_gemma":[0.9814005,0.0000011592025,0.01190219,0.00066055206,0.000169098,0.000006649501,0.000022846307,0.000017659475,0.005819361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966718,0.00012316364,0.0004830833,0.0014249857,0.00059225404,0.00070474605],"domain_scores_gemma":[0.9972795,0.000064589076,0.00016949742,0.0017903303,0.00028145275,0.00041459376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009921339,0.00021054532,0.00023840478,0.00015707951,0.00060487003,0.0009979827,0.00058120664,0.00008493483,0.000034471726],"category_scores_gemma":[0.00022172417,0.00019261352,0.00014187153,0.0020192324,0.00010724226,0.00015032289,0.00079494197,0.00036349244,0.000025988753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057283414,0.0001790169,0.0035112982,0.000019159606,0.00003530122,0.014204079,0.001986317,0.69651026,0.004170307,0.00063643616,0.05571626,0.22302583],"study_design_scores_gemma":[0.00008053857,0.000028858387,0.0021970281,0.0000355857,0.000005966069,0.001454683,0.000020667563,0.96530455,0.0013907378,0.0018612605,0.027347388,0.00027276095],"about_ca_topic_score_codex":0.000042784046,"about_ca_topic_score_gemma":0.000026828444,"teacher_disagreement_score":0.26879427,"about_ca_system_score_codex":0.00004345229,"about_ca_system_score_gemma":0.00029896092,"threshold_uncertainty_score":0.962357},"labels":[],"label_agreement":null},{"id":"W3209108685","doi":"10.1103/physics.14.147","title":"Quantum Leap for Quantum Primacy","year":2021,"lang":"en","type":"article","venue":"Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum computer; Quantum; Quantum technology; Physics; Open quantum system; Quantum network; Computer science; Quantum mechanics; Theoretical physics","score_opus":0.021048358655815686,"score_gpt":0.26590469964191976,"score_spread":0.24485634098610407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209108685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028680135,0.000213636,0.9677005,0.0019119083,0.00083602086,0.00011433318,0.000007458941,0.0002363325,0.0002997067],"genre_scores_gemma":[0.817041,0.000017089471,0.18000576,0.001314679,0.0012181363,0.00002695406,0.00002292693,0.000038271406,0.00031523049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987582,0.000040733277,0.00017149061,0.00045416242,0.00020746686,0.00036793418],"domain_scores_gemma":[0.99890125,0.0001887779,0.00007456637,0.00059655623,0.00015553167,0.0000833035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012430007,0.00015734254,0.00019836456,0.00002108132,0.00020627977,0.0001806404,0.00056015764,0.00003624207,0.0000026870148],"category_scores_gemma":[0.000049151873,0.00014799852,0.0001584926,0.0003544988,0.000030117784,0.0001678951,0.00028328918,0.00015726424,0.00003419505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003503101,0.00015695195,0.00004173003,0.000052116346,0.00002778827,0.000020710642,0.00059772393,0.002791344,0.0029617446,0.8350399,0.0023555947,0.15595084],"study_design_scores_gemma":[0.00025911626,0.000053416745,0.0001583997,0.000020274016,0.0000055564556,0.0000141627515,0.000010545846,0.77635086,0.00788858,0.19817945,0.016866552,0.0001930692],"about_ca_topic_score_codex":0.000006759032,"about_ca_topic_score_gemma":8.9815995e-7,"teacher_disagreement_score":0.78836083,"about_ca_system_score_codex":0.000018279441,"about_ca_system_score_gemma":0.00016043601,"threshold_uncertainty_score":0.60352045},"labels":[],"label_agreement":null},{"id":"W3209677340","doi":"10.1109/icrc53822.2021.00024","title":"An Efficient Reversible Algorithm for Linear Regression","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Linear regression; Ridge; Regression; Matrix (chemical analysis); Inversion (geology); Computational complexity theory; Computer science; Regression analysis; Mathematics; Mathematical optimization; Applied mathematics; Statistics","score_opus":0.01680725312707202,"score_gpt":0.2837527585543116,"score_spread":0.26694550542723955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209677340","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011406165,0.0003415955,0.9838682,0.0006709739,0.0025431355,0.00043720694,0.000018612489,0.0005317152,0.00018242195],"genre_scores_gemma":[0.0082600275,0.000016066393,0.99019694,0.0003189316,0.0006276661,0.000030379477,0.00009222795,0.000028260903,0.0004295257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737805,0.00011741163,0.00033882976,0.001310571,0.00040111772,0.00045399484],"domain_scores_gemma":[0.9975177,0.00011977272,0.0001912542,0.0016793179,0.00028021584,0.00021176157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049824704,0.00036883936,0.0004245214,0.00016317397,0.0002681302,0.0004795462,0.0018121953,0.0003070254,0.000015821206],"category_scores_gemma":[0.00003098297,0.0002916895,0.0002969475,0.00025750755,0.00003303857,0.00008122173,0.0021241016,0.0006155261,0.000006857684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029413777,0.00027119057,0.0000037843656,0.00013328184,0.000038192647,0.00004857033,0.0008825322,0.29081044,0.00016891099,0.0009547302,0.0013045534,0.7053809],"study_design_scores_gemma":[0.0002481029,0.00011587208,0.00002642343,0.00030361733,0.000011044535,0.00002009709,0.00003710414,0.99376494,0.0023708441,0.0008851002,0.0018069309,0.0004099437],"about_ca_topic_score_codex":0.000050144085,"about_ca_topic_score_gemma":0.0000024870164,"teacher_disagreement_score":0.70497096,"about_ca_system_score_codex":0.00005252505,"about_ca_system_score_gemma":0.00032194794,"threshold_uncertainty_score":0.9999535},"labels":[],"label_agreement":null},{"id":"W3209874379","doi":"10.22331/q-2023-01-26-906","title":"Adaptive estimation of quantum observables","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Science; Canada First Research Excellence Fund; Engineering and Physical Sciences Research Council; Public Works and Government Services Canada; Bundesministerium für Bildung und Forschung; Government of Canada; Innovation, Science and Economic Development Canada; Alexander von Humboldt-Stiftung; U.S. Department of Energy","keywords":"Observable; Estimator; Computer science; Pauli exclusion principle; Algorithm; Mathematics; Statistics; Physics; Quantum mechanics","score_opus":0.02704053728617216,"score_gpt":0.25855031604600986,"score_spread":0.2315097787598377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209874379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35854298,0.00009511047,0.6389227,0.0008620959,0.0006284831,0.000120011195,0.0000072464054,0.0006177785,0.00020360961],"genre_scores_gemma":[0.97019774,0.000013871883,0.029553274,0.00006445421,0.000059596456,0.0000072960033,0.000007724571,0.0000138023,0.000082249644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985851,0.00007696811,0.00029983217,0.00035223502,0.0003424537,0.0003433999],"domain_scores_gemma":[0.9989417,0.00024328369,0.0001489046,0.0005148893,0.00007546523,0.00007571595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038720615,0.00015423192,0.00022825973,0.00020341348,0.00013402711,0.000055029646,0.0007274681,0.00006153691,0.0000056138],"category_scores_gemma":[0.00008575857,0.00013512399,0.00009569148,0.0011377637,0.00006174915,0.00021553414,0.0002767211,0.00014356655,0.00015237703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011672631,0.000074408905,0.00015001127,0.000063211046,0.00003442002,0.000041760788,0.0016478796,0.22182669,0.0008147106,0.6653452,0.003568028,0.10642199],"study_design_scores_gemma":[0.00015015168,0.00016664053,0.004132546,0.00005943683,0.0000037749844,0.0000083108525,0.000051009654,0.92585063,0.00086438697,0.06817082,0.00039276917,0.00014949641],"about_ca_topic_score_codex":0.0000624997,"about_ca_topic_score_gemma":0.0000014495896,"teacher_disagreement_score":0.70402396,"about_ca_system_score_codex":0.000015058759,"about_ca_system_score_gemma":0.00007180921,"threshold_uncertainty_score":0.55101967},"labels":[],"label_agreement":null},{"id":"W3210923981","doi":"10.1007/s11128-022-03792-3","title":"Local-dimension-invariant Calderbank–Shor–Steane codes with an improved distance promise","year":2023,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Industry Canada; Canada Excellence Research Chairs, Government of Canada","keywords":"Quantum computer; Dimension (graph theory); Qubit; Quadratic growth; Invariant (physics); Mathematics; Discrete mathematics; Block code; Computer science; Quantum; Algorithm; Quantum mechanics; Combinatorics; Physics","score_opus":0.008981571283426542,"score_gpt":0.23046886121868138,"score_spread":0.22148728993525482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210923981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07916964,0.000051377683,0.9179221,0.0008565562,0.00016817413,0.0003049602,0.000008296158,0.0013161345,0.00020281118],"genre_scores_gemma":[0.9576932,0.0000054369534,0.041568488,0.0005064198,0.00005356685,0.00003437461,0.00007146825,0.000019424446,0.000047629754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791026,0.000059784838,0.00058831024,0.00037678852,0.00050796417,0.0005569118],"domain_scores_gemma":[0.9985303,0.00006666033,0.0003783385,0.00053480256,0.0002916049,0.00019826731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062219356,0.000285972,0.00025998722,0.00025419384,0.0006725668,0.00082870224,0.0006837814,0.00009078008,0.0000033323909],"category_scores_gemma":[0.000055630357,0.00021422256,0.000042601474,0.0013698536,0.00011868416,0.0035913286,0.00018416719,0.00029049435,0.00006595097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016430407,0.00013994871,0.000098816876,0.00084527343,0.000038054044,0.000065146545,0.021199018,0.10231632,0.0010636082,0.025172986,0.00077931077,0.84811723],"study_design_scores_gemma":[0.00054014655,0.00026788487,0.00028556457,0.00021824721,0.0000068164914,0.000071117785,0.0005138607,0.99296415,0.0009781079,0.0018643788,0.0019168542,0.00037287196],"about_ca_topic_score_codex":0.000031912394,"about_ca_topic_score_gemma":0.000010209339,"teacher_disagreement_score":0.8906478,"about_ca_system_score_codex":0.000055162443,"about_ca_system_score_gemma":0.00029566613,"threshold_uncertainty_score":0.8735742},"labels":[],"label_agreement":null},{"id":"W3211353834","doi":"10.3204/pubdb-2022-00998","title":"Using classical bit-flip correction for error mitigation in quantum computations including 2-qubit correlations","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nuclear Physics; European Regional Development Fund; Office of Science; Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Research and Innovation Foundation; Industry Canada; European Commission; National Science Foundation; Government of Canada; U.S. Department of Energy","keywords":"Qubit; Computer science; Error detection and correction; Scheme (mathematics); Quantum; Algorithm; Quantum computer; Physics; Quantum mechanics; Mathematics","score_opus":0.12057036798976307,"score_gpt":0.2537203480048252,"score_spread":0.13314998001506212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211353834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42769217,0.00002481633,0.56970656,0.00018096359,0.0018849149,0.00030349905,0.000009432873,0.00014756464,0.000050088238],"genre_scores_gemma":[0.9619386,0.000009145549,0.037553858,0.00006397495,0.00017788111,0.0000032414994,0.0000990629,0.00002535829,0.00012884736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765086,0.00024967492,0.00038925308,0.0011677888,0.00012904785,0.00041337314],"domain_scores_gemma":[0.9980728,0.0005328023,0.00036794116,0.00060059875,0.00028748787,0.00013835228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032121362,0.00033047717,0.00040565126,0.0005938608,0.0005342595,0.00027406643,0.0007386231,0.00034726647,0.000004531929],"category_scores_gemma":[0.00013791917,0.00041697815,0.00027664783,0.0012995444,0.00009551859,0.000381297,0.001092944,0.0008868768,0.0000049705236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009296439,0.000105382234,0.0012588656,0.00004157402,0.00003283774,0.000051662533,0.00066898286,0.9778939,0.000073997544,0.018468972,0.00007513843,0.0013194182],"study_design_scores_gemma":[0.0005291517,0.000044499204,0.0032756901,0.00039487323,0.000049315826,0.000018560697,0.00021330587,0.98105973,0.000046811212,0.013872039,0.00006731172,0.0004287071],"about_ca_topic_score_codex":0.00020646496,"about_ca_topic_score_gemma":0.00019392328,"teacher_disagreement_score":0.53424644,"about_ca_system_score_codex":0.00045055203,"about_ca_system_score_gemma":0.00048165678,"threshold_uncertainty_score":0.9998282},"labels":[],"label_agreement":null},{"id":"W3211554344","doi":"10.48550/arxiv.2111.07992","title":"Query and Depth Upper Bounds for Quantum Unitaries via Grover Search","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley","keywords":"Toffoli gate; Qubit; Oracle; Mathematical proof; Unitary state; Constant (computer programming); Mathematics; Upper and lower bounds; Quantum circuit; Omega; Discrete mathematics; Class (philosophy); Combinatorics; Quantum; Computer science; Quantum gate; Quantum mechanics; Physics; Quantum error correction","score_opus":0.04622767538002632,"score_gpt":0.1982508627019541,"score_spread":0.1520231873219278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211554344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46067843,0.00019385126,0.53798884,0.00020096208,0.00049167447,0.00018165029,0.0000103065295,0.00013496356,0.00011932384],"genre_scores_gemma":[0.9854892,0.00010887686,0.013450107,0.00018695193,0.00015123615,0.0000013274744,0.000031896838,0.000028298735,0.00055212574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760675,0.00016825358,0.00019934024,0.0013536621,0.0001286357,0.00054335105],"domain_scores_gemma":[0.99806136,0.00032796338,0.00012370099,0.0010185237,0.0002508469,0.00021763149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033466466,0.00038210768,0.00042191643,0.000265875,0.0004430738,0.00052646775,0.0012305662,0.00029802448,0.0000076030537],"category_scores_gemma":[0.00004008843,0.0004122416,0.00024402526,0.0004640153,0.00022055018,0.0002970001,0.0030308806,0.0007516802,0.000005577863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011369725,0.000340558,0.0097448565,0.0009393565,0.0005953547,0.0010574365,0.0042668087,0.4775066,0.00018214092,0.48232928,0.00070176536,0.02222215],"study_design_scores_gemma":[0.0004039202,0.00009336411,0.002813701,0.00011200986,0.00004237051,0.000026771173,0.00015797223,0.95840454,0.00010642469,0.036510244,0.00083066087,0.00049803476],"about_ca_topic_score_codex":0.0004340508,"about_ca_topic_score_gemma":0.00011607014,"teacher_disagreement_score":0.5248108,"about_ca_system_score_codex":0.00009685213,"about_ca_system_score_gemma":0.00037826903,"threshold_uncertainty_score":0.9998329},"labels":[],"label_agreement":null},{"id":"W3211828003","doi":"10.1103/physrevlett.129.120604","title":"Field Theory of Charge Sharpening in Symmetric Monitored Quantum Circuits","year":2022,"lang":"en","type":"preprint","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Air Force Office of Scientific Research; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Physics; Charge (physics); Quantum phase transition; Phase transition; Quantum entanglement; Scaling; Quantum mechanics; Statistical physics; Quantum","score_opus":0.023090100070001812,"score_gpt":0.28879016695838117,"score_spread":0.2657000668883793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211828003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8116103,0.06108175,0.099600986,0.021693576,0.003013617,0.0020138335,0.0000442106,0.00037336524,0.0005684071],"genre_scores_gemma":[0.98404175,0.0023325,0.001679612,0.01137607,0.0003728242,0.00013601813,0.000018264782,0.00003598595,0.000006957583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969755,0.0005682362,0.00058154686,0.00083320594,0.0006118128,0.00042970208],"domain_scores_gemma":[0.99736625,0.0009561609,0.00045902806,0.0010979438,0.00003104095,0.000089552035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009029998,0.00036292846,0.0009958863,0.00029985336,0.00007235389,0.000058030233,0.0023090334,0.000033253993,0.000026275138],"category_scores_gemma":[0.00027624366,0.00032842436,0.00047140068,0.0011163837,0.00003940655,0.000082589846,0.0024631033,0.0015559023,0.000014064117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017030585,0.00091182406,0.0008823731,0.01657471,0.00025906353,0.00030940128,0.0031372993,0.0125917,0.0024036632,0.10293363,0.0049006296,0.8550787],"study_design_scores_gemma":[0.0004570473,0.00028494254,0.0029878877,0.012689514,0.000109480934,0.00001538777,0.0000100730795,0.9480676,0.000647848,0.030127957,0.0031974015,0.0014048739],"about_ca_topic_score_codex":0.000040454812,"about_ca_topic_score_gemma":1.18999004e-7,"teacher_disagreement_score":0.9354759,"about_ca_system_score_codex":0.00007149653,"about_ca_system_score_gemma":0.000077054014,"threshold_uncertainty_score":0.9999168},"labels":[],"label_agreement":null},{"id":"W3211962989","doi":"10.22323/1.396.0243","title":"Investigating the variance increase of readout error mitigation through classical bit-flip correction on IBM and Rigetti quantum computers","year":2022,"lang":"en","type":"article","venue":"Proceedings of The 38th International Symposium on Lattice Field Theory — PoS(LATTICE2021)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Nuclear Physics; European Regional Development Fund; Office of Science; Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Research and Innovation Foundation; Industry Canada; National Science Foundation; Government of Canada; U.S. Department of Energy","keywords":"Variance (accounting); Pauli exclusion principle; IBM; Observable; Computer science; Quantum; Algorithm; Quantum computer; Electronic engineering; Scale (ratio); Encoding (memory); Computer engineering; Physics; Artificial intelligence; Quantum mechanics; Engineering","score_opus":0.010722645211183567,"score_gpt":0.24391201492721726,"score_spread":0.23318936971603368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211962989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.931504,0.000055905468,0.01025338,0.04730076,0.004957933,0.00053801807,0.00002596883,0.0001252286,0.005238795],"genre_scores_gemma":[0.99092644,0.0000075907806,0.0046106153,0.0038251842,0.00028187278,0.000031155552,0.000003892098,0.00002175138,0.00029152198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974575,0.00021398634,0.00056806835,0.0005676969,0.0009098014,0.0002829599],"domain_scores_gemma":[0.99651587,0.0020283978,0.0007745717,0.00035130233,0.00025136067,0.00007850415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332875,0.00027322856,0.00028114894,0.00010849138,0.0006425885,0.00016700198,0.001727193,0.000088536384,0.00002050175],"category_scores_gemma":[0.0006584933,0.0001939649,0.00016253535,0.00045947084,0.0002937744,0.00033500444,0.0010013978,0.000872547,0.000002798484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023672712,0.00030513428,0.0014852231,0.0000829382,0.00016739641,0.0000025671757,0.0054393085,0.008079798,0.005884414,0.96955484,0.0016213637,0.00714028],"study_design_scores_gemma":[0.00087918347,0.0011530536,0.006113262,0.0006319505,0.000086008404,0.00013151047,0.0007457709,0.8545662,0.016234508,0.11686065,0.0021558527,0.0004420189],"about_ca_topic_score_codex":0.000097877455,"about_ca_topic_score_gemma":0.000001377664,"teacher_disagreement_score":0.8526942,"about_ca_system_score_codex":0.0000897002,"about_ca_system_score_gemma":0.00006224709,"threshold_uncertainty_score":0.7909659},"labels":[],"label_agreement":null},{"id":"W3212101168","doi":"10.1038/s41467-021-26825-4","title":"SU(2) hadrons on a quantum computer via a variational approach","year":2021,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":136,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; York University; University of Waterloo","funders":"Army Research Laboratory; QuantERA; Canada First Research Excellence Fund; Austrian Science Fund; Natural Sciences and Engineering Research Council of Canada; European Commission; Alexander von Humboldt-Stiftung","keywords":"Physics; Quantum computer; Hadron; Quantum chromodynamics; Gauge theory; Particle physics; Quantum simulator; Quantum; Theoretical physics; Quantum mechanics","score_opus":0.01715339587357017,"score_gpt":0.2670540432146092,"score_spread":0.249900647341039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212101168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007920099,0.0011114527,0.97320706,0.020528212,0.000562552,0.00013768874,0.000014212006,0.0003153081,0.0033314861],"genre_scores_gemma":[0.40782672,0.000025379259,0.58931905,0.0024040232,0.0001682606,0.000019388863,0.000101669844,0.000012965944,0.00012255373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827313,0.00033486282,0.00025728394,0.00048519918,0.0003646935,0.0002848075],"domain_scores_gemma":[0.99576455,0.00056969275,0.00010670051,0.0031830461,0.00026382678,0.00011219106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002807879,0.00019314667,0.00019846905,0.00013023503,0.0006208336,0.00036800047,0.002707175,0.00022990632,0.000005505131],"category_scores_gemma":[0.00006299443,0.00018046713,0.00013825177,0.0008672173,0.000081927334,0.00015833875,0.0013250302,0.0014749652,0.000036270856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018194609,0.00049327296,0.000075410004,0.000005923741,0.000044482324,0.0000073835104,0.00039207187,0.006218028,0.00008818325,0.9686601,0.003276131,0.02073718],"study_design_scores_gemma":[0.00022432336,0.000038978465,0.003827809,0.000020910822,0.0000072784865,0.00011450797,0.0000075691546,0.937173,0.00003836378,0.010833843,0.047506172,0.00020726232],"about_ca_topic_score_codex":0.0000074389322,"about_ca_topic_score_gemma":0.000015001885,"teacher_disagreement_score":0.95782626,"about_ca_system_score_codex":0.0000507878,"about_ca_system_score_gemma":0.00019835547,"threshold_uncertainty_score":0.7359236},"labels":[],"label_agreement":null},{"id":"W3212367205","doi":"10.22331/q-2021-11-08-572","title":"Encoding strongly-correlated many-boson wavefunctions on a photonic quantum computer: application to the attractive Bose-Hubbard model","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Agence Nationale de la Recherche","keywords":"Ansatz; Wave function; Quantum computer; Boson; Quantum; Physics; Hamiltonian (control theory); Statistical physics; Quantum mechanics; Quantum information; Computer science; Mathematics; Mathematical optimization","score_opus":0.03366002715469295,"score_gpt":0.1903116472778517,"score_spread":0.15665162012315875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212367205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.360629,0.000010069908,0.63759816,0.00071420585,0.00027739778,0.00017963722,0.000005856064,0.0001845288,0.00040114115],"genre_scores_gemma":[0.99360377,0.00001287726,0.005448242,0.00038995888,0.00010284141,0.0000025540594,0.000008737114,0.000016487924,0.00041453584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981666,0.000137641,0.00017689573,0.000956977,0.00014579216,0.0004160591],"domain_scores_gemma":[0.99834603,0.00020990147,0.000121482604,0.0009854614,0.00016049699,0.00017660712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019831827,0.00024086735,0.00020296815,0.00015176841,0.00069111463,0.00014207058,0.00092748547,0.00009727895,0.0000073958245],"category_scores_gemma":[0.00002050726,0.00021822572,0.00016045138,0.0012857039,0.0000454986,0.00022868988,0.00047012832,0.00049608113,0.00017663455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016779773,0.00009953737,0.00006741308,0.0000040595432,0.00003496879,0.00005600868,0.00041326167,0.8938157,0.00044787317,0.10115665,0.00022752098,0.0036602123],"study_design_scores_gemma":[0.00032949125,0.00012840233,0.00058808725,0.00003631432,0.00002524762,0.000020612159,0.00008745731,0.99149376,0.0008456135,0.005111564,0.0010730714,0.0002603801],"about_ca_topic_score_codex":0.00004227185,"about_ca_topic_score_gemma":0.000018976702,"teacher_disagreement_score":0.6329748,"about_ca_system_score_codex":0.00017348934,"about_ca_system_score_gemma":0.00014280232,"threshold_uncertainty_score":0.88989866},"labels":[],"label_agreement":null},{"id":"W3213147436","doi":"10.1038/s42005-021-00751-9","title":"Optimizing electronic structure simulations on a trapped-ion quantum computer using problem decomposition","year":2021,"lang":"en","type":"article","venue":"Communications Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"QLT (Canada)","funders":"","keywords":"Qubit; Ansatz; Computer science; Quantum computer; Quantum; Computational science; Trapped ion quantum computer; Coupled cluster; Decomposition; Pipeline (software); Electronic structure; Matrix decomposition; Quantum simulator; Statistical physics; Physics; Quantum mechanics; Chemistry; Molecule","score_opus":0.02480592418090155,"score_gpt":0.2974761170847195,"score_spread":0.27267019290381794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213147436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07684735,0.00024724926,0.9205325,0.0016274622,0.00015771764,0.00019314351,0.000019948184,0.00025076472,0.00012383291],"genre_scores_gemma":[0.6428581,0.000021401602,0.35659024,0.00028157848,0.00013030379,0.0000034964153,0.000093181174,0.000017141216,0.000004580076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983488,0.0002871234,0.00030403346,0.0004342897,0.00023556236,0.00039020376],"domain_scores_gemma":[0.99701774,0.00028145508,0.00017037794,0.002230447,0.00022389037,0.0000760868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009906317,0.00022676456,0.0002193748,0.00008666251,0.00092916534,0.00030139313,0.0013608519,0.00007932847,0.0000037869133],"category_scores_gemma":[0.00000810144,0.00023738646,0.00012435147,0.00090686866,0.00007032031,0.0003084275,0.00072000676,0.00060310366,0.000006255729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018891933,0.00022212388,0.000014562305,0.0000119062115,0.000038578044,0.0000020417558,0.0010064854,0.73966366,0.0072043943,0.21811418,0.00004847047,0.033671726],"study_design_scores_gemma":[0.00025028372,0.000068992646,0.00008140296,0.00009589679,0.000017249677,0.000029101668,0.000014332475,0.94539213,0.0026320682,0.04975262,0.001414906,0.00025104074],"about_ca_topic_score_codex":0.000009447766,"about_ca_topic_score_gemma":0.000012690763,"teacher_disagreement_score":0.5660107,"about_ca_system_score_codex":0.0001318359,"about_ca_system_score_gemma":0.00024878423,"threshold_uncertainty_score":0.96803385},"labels":[],"label_agreement":null},{"id":"W3213816425","doi":"10.21468/scipostphys.14.6.147","title":"Measurement-induced entanglement phase transitions in variational quantum circuits","year":2023,"lang":"en","type":"article","venue":"SciPost Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Shared Hierarchical Academic Research Computing Network; University of Toronto; Government of Ontario; Google; Compute Canada; Vector Institute; Canadian Institute for Advanced Research; U.S. Department of Energy; National Science Foundation","keywords":"Quantum entanglement; Ansatz; Quantum circuit; Quantum; Quantum algorithm; Quantum metrology; Statistical physics; Quantum phase transition; Quantum computer; Quantum mechanics; Physics; Quantum information; Hamiltonian (control theory); Computer science; Quantum network; Mathematics; Mathematical optimization","score_opus":0.044992048833859634,"score_gpt":0.28623508537101305,"score_spread":0.24124303653715343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213816425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38466546,0.0000335305,0.6070617,0.0056476356,0.0012108515,0.00039557074,0.00003406717,0.0006087867,0.00034237956],"genre_scores_gemma":[0.9980446,0.0000015396029,0.001473715,0.00019091471,0.0002247816,0.000022395434,0.000022816821,0.000012305094,0.000006938027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815017,0.000085065796,0.00024833917,0.0004065771,0.00070736726,0.00040250248],"domain_scores_gemma":[0.9993501,0.000033145585,0.00006408571,0.00035721785,0.00010587278,0.00008962464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055148563,0.00015371105,0.0001516776,0.00015000973,0.00020679265,0.00011475896,0.00050285645,0.000035882607,0.000005834398],"category_scores_gemma":[0.000019196788,0.00015558384,0.0000806152,0.0014867128,0.000019043871,0.00022895112,0.00011412611,0.0001922882,0.000110786765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000143460165,0.001825702,0.00019110314,0.0000742628,0.000119129065,0.00015192486,0.012219879,0.04361493,0.095071115,0.38447887,0.0013814345,0.4608573],"study_design_scores_gemma":[0.001152594,0.00016072515,0.0029474862,0.00006328622,0.0000060216403,0.0000041704534,0.000043962154,0.9544871,0.0017047892,0.038953964,0.0002459892,0.00022992838],"about_ca_topic_score_codex":0.000014641715,"about_ca_topic_score_gemma":0.00001233364,"teacher_disagreement_score":0.91087216,"about_ca_system_score_codex":0.00008930425,"about_ca_system_score_gemma":0.00017258794,"threshold_uncertainty_score":0.63445246},"labels":[],"label_agreement":null},{"id":"W3213900785","doi":"10.1109/tqe.2021.3127503","title":"Teaching Quantum Computing to High-School-Aged Youth: A Hands-On Approach","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Quantum Engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria; U.S. Department of Commerce","keywords":"Quantum computer; Computer science; Quantum algorithm; Quantum; Mainstream; Computational science; Mathematics education; Mathematics; Physics; Quantum mechanics","score_opus":0.012938847266210576,"score_gpt":0.21803593586168127,"score_spread":0.20509708859547068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213900785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28053337,0.000032616772,0.71643007,0.00040602955,0.0015180868,0.00016341645,0.000012605471,0.0008295874,0.00007422434],"genre_scores_gemma":[0.91056865,0.0000038501175,0.08849693,0.0004843163,0.0002726014,0.000015998168,0.000005618257,0.000068739755,0.00008327428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969144,0.00015103338,0.0004974064,0.0010504909,0.00057790754,0.0008087705],"domain_scores_gemma":[0.9981257,0.00033158308,0.000080776554,0.00093773106,0.000075660886,0.00044857129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049760815,0.0005081551,0.00047267356,0.0005002665,0.00063314993,0.000388408,0.0008275687,0.00014794512,0.000007833923],"category_scores_gemma":[0.000049536757,0.0005171473,0.00025677923,0.00096293597,0.000018484088,0.00021846224,0.00002536139,0.0014683367,0.000072493705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013275654,0.00023925462,0.0000017440295,0.000050819264,0.000061227525,0.000056552162,0.0025263738,0.97439504,0.004697695,0.0040035294,0.0000557267,0.013898755],"study_design_scores_gemma":[0.00068700436,0.00034443525,0.00015847087,0.00027432365,0.000022550981,0.00008016393,0.000118389,0.9884564,0.00895622,0.00011990061,0.0001643726,0.00061771745],"about_ca_topic_score_codex":0.00009733123,"about_ca_topic_score_gemma":0.0000040621135,"teacher_disagreement_score":0.6300353,"about_ca_system_score_codex":0.00013358361,"about_ca_system_score_gemma":0.00009560927,"threshold_uncertainty_score":0.999728},"labels":[],"label_agreement":null},{"id":"W3213969566","doi":"10.1088/2399-6528/ac3a43","title":"Composability of global phase invariant distance and its application to approximation error management","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Government of Canada","keywords":"Unitary state; Invariant (physics); Tensor product; Bounded function; Discrete mathematics; Mathematics; Computer science; Pure mathematics; Mathematical analysis","score_opus":0.02621957652524092,"score_gpt":0.20605036783766395,"score_spread":0.17983079131242302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213969566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4274587,0.000015611153,0.57195204,0.00019148318,0.000028331953,0.000113414324,0.0000061664828,0.00003206873,0.00020217692],"genre_scores_gemma":[0.9860761,0.0000046915584,0.01381074,0.000058377493,0.000009050263,5.7887524e-7,0.0000035844255,0.0000021532849,0.000034731696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991916,0.000056395478,0.000111199144,0.00045431888,0.00006031751,0.00012621096],"domain_scores_gemma":[0.9993709,0.000025092671,0.0000674571,0.00037017767,0.00008133456,0.000085042215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121188255,0.00008448587,0.00011275254,0.000026529238,0.000080975806,0.000024458195,0.00031165106,0.000025278112,0.0000016943536],"category_scores_gemma":[0.0000100005855,0.000093452196,0.000031405074,0.0007353896,0.000026318312,0.00013018872,0.00033818526,0.00004680622,0.0000052798787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024515719,0.00025417868,0.0008671659,0.00008435752,0.000021903777,0.00005276545,0.00016619991,0.1015961,0.0006183134,0.8811644,0.000013789827,0.015136351],"study_design_scores_gemma":[0.000479818,0.000042913187,0.0039539896,0.000019078916,0.000010222909,0.000005490614,0.000036965033,0.9834816,0.00072383427,0.010961044,0.00018280957,0.00010222426],"about_ca_topic_score_codex":0.000009319102,"about_ca_topic_score_gemma":0.00001121464,"teacher_disagreement_score":0.8818855,"about_ca_system_score_codex":0.000052647385,"about_ca_system_score_gemma":0.00002271739,"threshold_uncertainty_score":0.38108698},"labels":[],"label_agreement":null},{"id":"W3214129522","doi":"10.1103/physrevlett.129.240501","title":"Nearly Optimal Quantum Algorithm for Estimating Multiple Expectation Values","year":2022,"lang":"en","type":"preprint","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Beijing Academy of Quantum Information Sciences; U.S. Department of Energy; Kavli Institute for Theoretical Physics, University of California, Santa Barbara; Office of Science; National Science Foundation","keywords":"Observable; Scaling; Logarithm; Quantum; Mathematics; Flexibility (engineering); Value (mathematics); Algorithm; Quantum algorithm; Applied mathematics; Mathematical optimization; Computer science; Statistical physics; Statistics; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.02289260286265953,"score_gpt":0.30928067666354603,"score_spread":0.2863880738008865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214129522","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023760084,0.003529079,0.9633925,0.0059017846,0.0016468144,0.0013078981,0.00005006709,0.0004049296,0.000006868959],"genre_scores_gemma":[0.007568099,0.00020784292,0.9838555,0.0058707204,0.0014662151,0.00081526657,0.00014605766,0.00006368518,0.000006613392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967035,0.00029687057,0.00055309007,0.0012189617,0.00066522113,0.0005623552],"domain_scores_gemma":[0.9973833,0.0008511419,0.00052880874,0.0010060809,0.000089900524,0.0001407583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005406585,0.00051173044,0.00088128616,0.00009732177,0.00040821463,0.0002966395,0.0017879814,0.000030703024,0.0000070291694],"category_scores_gemma":[0.00022945102,0.00047524608,0.00071838184,0.00031341915,0.00006547349,0.00018104914,0.0018830097,0.0009836322,0.000013956204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035916516,0.00021314256,0.000006536672,0.0028355375,0.00012047854,0.000026842004,0.0020278757,0.38392082,0.00035923655,0.000514054,0.005649733,0.6043222],"study_design_scores_gemma":[0.00020573215,0.0001012964,0.00004799668,0.0013911464,0.00006225089,0.0000072924313,0.00000808029,0.9942907,0.000037404126,0.0017882296,0.0015236704,0.00053617585],"about_ca_topic_score_codex":0.0000332381,"about_ca_topic_score_gemma":1.2201434e-7,"teacher_disagreement_score":0.6103699,"about_ca_system_score_codex":0.00011492395,"about_ca_system_score_gemma":0.000102088634,"threshold_uncertainty_score":0.9997699},"labels":[],"label_agreement":null},{"id":"W3214912685","doi":"10.1021/acs.jctc.2c00974","title":"Quantum Simulation of Molecules in Solution","year":2022,"lang":"en","type":"article","venue":"Journal of Chemical Theory and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Dipartimenti di Eccellenza","keywords":"Solvation; Quantum; Quantum chemistry; Quantum computer; Statistical physics; Implicit solvation; Molecule; Qubit; Quantum mechanics; Polarizable continuum model; Atomic orbital; ONIOM; Physics; Chemistry; Computational chemistry","score_opus":0.01003365445248951,"score_gpt":0.2600356053477899,"score_spread":0.2500019508953004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214912685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5198028,0.00011508892,0.47989458,0.00009100747,0.00006342224,0.000017169015,2.9005943e-7,0.0000041662975,0.000011493589],"genre_scores_gemma":[0.99123514,0.0000019230984,0.008681798,0.00004654875,0.000030096524,4.513284e-7,7.290526e-7,0.0000024900794,8.242586e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991028,0.00023213215,0.0003086394,0.000083218365,0.00020089981,0.00007236807],"domain_scores_gemma":[0.99922764,0.00037684792,0.00026652566,0.000048616133,0.00005390955,0.000026448373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090065587,0.000051104587,0.00012712911,0.00012386426,0.000042259413,0.0000148363915,0.00016294993,0.000018196817,0.0000025172135],"category_scores_gemma":[0.000059972317,0.000046400637,0.000044661745,0.00021281828,0.000025991534,0.000105866,0.00010918841,0.00018403641,8.415311e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091186164,0.00008062215,0.000049472168,0.000011956132,0.000007690704,0.00000791911,0.0009196318,0.8833244,0.012566648,0.029108496,0.000006184103,0.07382582],"study_design_scores_gemma":[0.00027778596,0.00011905299,0.00032425122,0.000012811411,0.0000027520553,0.00004823188,0.00003663244,0.8165044,0.002500668,0.18011421,0.000018115425,0.000041053558],"about_ca_topic_score_codex":8.7279045e-7,"about_ca_topic_score_gemma":1.8816856e-8,"teacher_disagreement_score":0.47143236,"about_ca_system_score_codex":0.00002205364,"about_ca_system_score_gemma":0.000026662905,"threshold_uncertainty_score":0.1892163},"labels":[],"label_agreement":null},{"id":"W3215183963","doi":"10.1007/s00220-024-04958-z","title":"Random Quantum Circuits Transform Local Noise into Global White Noise","year":2024,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institute for Quantum Information and Matter, California Institute of Technology; Ministry of Colleges and Universities; National Science Foundation; Government of Canada; Aspen Center for Physics; Stanford University; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.021160986938615896,"score_gpt":0.2967149638686152,"score_spread":0.2755539769299993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215183963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021027627,0.0009046912,0.98321956,0.00678477,0.00017833775,0.00029957943,0.000007869131,0.0004319799,0.0060704486],"genre_scores_gemma":[0.89131266,0.00006505257,0.1082541,0.0001840159,0.00006952762,0.000054377277,0.000009828815,0.000020097415,0.000030361582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982161,0.0001690242,0.0005133602,0.00040494953,0.00033343295,0.0003631498],"domain_scores_gemma":[0.9968967,0.0006308471,0.00004914435,0.0022325087,0.00006419657,0.00012659929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005258057,0.00024712,0.00035008407,0.000075725686,0.0002295943,0.0003304907,0.002825506,0.00009310933,0.000008034211],"category_scores_gemma":[0.000058423426,0.00021487563,0.00018698229,0.0012940331,0.0003378248,0.000340158,0.00072490843,0.00057759316,0.00022662002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023323066,0.0003013913,0.000013325868,0.00017326152,0.00002290911,0.000009262419,0.0031379978,0.0037401349,0.000034169007,0.7113155,0.0002030343,0.28104666],"study_design_scores_gemma":[0.00021238165,0.000017912771,0.000038518298,0.00021447487,0.0000084019985,0.000013799215,0.000030732797,0.5476593,0.000020690073,0.45095566,0.0006871071,0.00014101923],"about_ca_topic_score_codex":0.000011321085,"about_ca_topic_score_gemma":0.000010365838,"teacher_disagreement_score":0.88920987,"about_ca_system_score_codex":0.00014583304,"about_ca_system_score_gemma":0.00014086236,"threshold_uncertainty_score":0.8762374},"labels":[],"label_agreement":null},{"id":"W3215186106","doi":"10.1109/epeps51341.2021.9609209","title":"Quantum Method of Moments for Characterization of Interconnects","year":2021,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Quantum; Hamiltonian (control theory); Computer science; Method of moments (probability theory); Quantum algorithm; Quantum computer; Algorithm; Mathematical optimization; Quantum mechanics; Mathematics; Physics","score_opus":0.015791174976884478,"score_gpt":0.27869377297230963,"score_spread":0.26290259799542515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215186106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.169088,0.000008426429,0.8301424,0.0003622591,0.0002276837,0.00006488876,0.000006402484,0.00002464599,0.00007529988],"genre_scores_gemma":[0.50837284,0.0000025299992,0.49133137,0.000103132756,0.000025654861,0.0000033893266,0.000008518357,0.000004608904,0.00014797896],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993452,0.000048722253,0.00021458401,0.00018581882,0.00010180694,0.0001039021],"domain_scores_gemma":[0.9993227,0.00012646428,0.00011627091,0.00024518024,0.00016375388,0.000025600057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018962267,0.00006130932,0.00016202022,0.000055434346,0.000021880038,0.000015993626,0.0002530986,0.000025951309,0.000007930747],"category_scores_gemma":[0.000053896318,0.0000521613,0.00006814286,0.0002260742,0.000009994014,0.00007911051,0.00014679224,0.0000324771,5.7766846e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005954562,0.000113275826,0.00006909687,0.00011508304,0.000034017725,0.0000018695642,0.0008494035,0.0003147718,0.7303331,0.12307629,0.000034102282,0.14505304],"study_design_scores_gemma":[0.00017550288,0.000071213326,0.0007100564,0.00003016616,0.0000026442233,0.000006212115,0.00001140112,0.60463446,0.38973433,0.0042731157,0.00030248906,0.00004842328],"about_ca_topic_score_codex":0.0000044098624,"about_ca_topic_score_gemma":5.640983e-7,"teacher_disagreement_score":0.6043197,"about_ca_system_score_codex":0.0000043509926,"about_ca_system_score_gemma":0.00004266157,"threshold_uncertainty_score":0.21270761},"labels":[],"label_agreement":null},{"id":"W3215379386","doi":"10.1109/qce52317.2021.00051","title":"Password authentication schemes on a quantum computer","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Air Force Office of Scientific Research","keywords":"Password; Computer science; Quantum computer; Quantum; Computer security; Authentication (law); Quantum cryptography; Quantum information; Physics; Quantum mechanics","score_opus":0.015845221748527493,"score_gpt":0.2514811492090641,"score_spread":0.23563592746053663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215379386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09302394,0.00010987881,0.8979861,0.004857074,0.002628836,0.00021022542,0.000002580461,0.00067210756,0.0005092198],"genre_scores_gemma":[0.58022296,0.00001792287,0.41738972,0.0013249007,0.0006434848,0.000023748444,0.00004071344,0.000027098482,0.00030946906],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973526,0.00015057172,0.0003848545,0.001213822,0.0005021314,0.0003960312],"domain_scores_gemma":[0.9976222,0.0001533981,0.00020304506,0.0017285208,0.00015596973,0.00013687409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027115206,0.00039432786,0.00039798082,0.00019474338,0.00015425427,0.00096596585,0.0016673369,0.00025234785,0.000032367163],"category_scores_gemma":[0.000026161748,0.0003348705,0.00026442844,0.00027920044,0.000042203104,0.00008898505,0.003024616,0.0009255513,0.00007737164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008461544,0.00069514575,0.00010347392,0.00030368325,0.00025522825,0.00017227186,0.0029148082,0.049776718,0.0002268153,0.3500353,0.007237651,0.5882704],"study_design_scores_gemma":[0.00013239367,0.00007421466,0.0010841818,0.00028911475,0.00000857578,0.000016176116,0.0000079053525,0.9857797,0.0004789605,0.00811283,0.003598343,0.0004175714],"about_ca_topic_score_codex":0.000027143878,"about_ca_topic_score_gemma":0.0000026452747,"teacher_disagreement_score":0.936003,"about_ca_system_score_codex":0.000050729035,"about_ca_system_score_gemma":0.00020655345,"threshold_uncertainty_score":0.99991035},"labels":[],"label_agreement":null},{"id":"W3215804282","doi":"10.22323/1.396.0603","title":"Model-Independent Error Mitigation in Parametric Quantum Circuits and Depolarizing Projection of Quantum Noise","year":2022,"lang":"en","type":"article","venue":"Proceedings of The 38th International Symposium on Lattice Field Theory — PoS(LATTICE2021)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"National Key Research and Development Program of China; Agencia Estatal de Investigación; Office of Science; Centres de Recerca de Catalunya; Government of Canada; Ministry of Colleges and Universities; Nuclear Physics; Institut Périmètre de physique théorique; Research and Innovation Foundation; Industry Canada; National Natural Science Foundation of China; Generalitat de Catalunya; Agència de Gestió d'Ajuts Universitaris i de Recerca; National Science Foundation; European Regional Development Fund; U.S. Department of Energy; Fundación Cellex","keywords":"Quantum computer; Quantum error correction; Quantum circuit; Quantum algorithm; Quantum; Computer science; Quantum network; Physics; Electronic engineering; Algorithm; Quantum mechanics; Engineering","score_opus":0.013504840585380607,"score_gpt":0.246515045040397,"score_spread":0.2330102044550164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215804282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97987044,0.00008475701,0.012816851,0.0042802864,0.0011190563,0.0004444798,0.000014644162,0.000058193727,0.0013113229],"genre_scores_gemma":[0.99741197,0.000013859632,0.0019242684,0.00042524934,0.00006920703,0.00003931336,0.0000021523883,0.000019620138,0.00009434434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975171,0.00010255441,0.00062434416,0.00055514165,0.00090461975,0.0002962548],"domain_scores_gemma":[0.99826765,0.00056225783,0.00063095597,0.0002475788,0.00022621083,0.000065359316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014298145,0.00023356926,0.00028432382,0.00043338968,0.0002663847,0.00011374492,0.0013324636,0.000097862845,0.000012045898],"category_scores_gemma":[0.00038493227,0.00020295808,0.00014121027,0.0007711916,0.00008420454,0.0003947328,0.00087938894,0.0007051243,0.000001045915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022181818,0.0005823127,0.0108453315,0.00022593164,0.00012713253,0.0000049346395,0.0049622306,0.04376195,0.034091584,0.89795816,0.00004112536,0.007177517],"study_design_scores_gemma":[0.0005166512,0.00034871587,0.0033888614,0.00016386295,0.000028793998,0.00006394525,0.00033760304,0.9239834,0.011600781,0.059313603,0.00003573717,0.00021803085],"about_ca_topic_score_codex":0.00007969257,"about_ca_topic_score_gemma":0.000002292604,"teacher_disagreement_score":0.8802215,"about_ca_system_score_codex":0.00012322943,"about_ca_system_score_gemma":0.00007318692,"threshold_uncertainty_score":0.82763904},"labels":[],"label_agreement":null},{"id":"W3215985406","doi":"10.48550/arxiv.2111.10867","title":"Qimaera: Type-safe (Variational) Quantum Programming in Idris","year":2021,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Computer science; Quantum; Quantum computer; Quantum algorithm; Programmer; Theoretical computer science; Programming language; Algorithm; Quantum mechanics; Physics","score_opus":0.0449361019842144,"score_gpt":0.19241674095915454,"score_spread":0.14748063897494013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215985406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55703384,0.00042051708,0.43807307,0.00046193952,0.0027784358,0.00055765454,0.00000962375,0.00020104783,0.00046387533],"genre_scores_gemma":[0.977457,0.0003171229,0.020927522,0.00016139855,0.0003375293,0.0000018031402,0.00005602115,0.000053795182,0.00068781053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993576,0.00073057663,0.0008070363,0.0032608525,0.00036079955,0.0012647246],"domain_scores_gemma":[0.99582636,0.0004517747,0.0006845218,0.0019850086,0.0006369019,0.00041540005],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009687989,0.0009079091,0.001003201,0.0007601565,0.00048253452,0.0007841174,0.0029394422,0.0006949082,0.00013969342],"category_scores_gemma":[0.00020590027,0.001122156,0.0005337942,0.0040455307,0.0002541881,0.00061901624,0.0043255775,0.0023427748,0.00013807464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058126057,0.00055518944,0.0035571435,0.00018502049,0.00017710125,0.0025910023,0.002313568,0.8983355,0.000045124518,0.07445133,0.00004517204,0.017685693],"study_design_scores_gemma":[0.0009522519,0.00016899206,0.005898426,0.0006636214,0.00007814522,0.00005089657,0.0002819287,0.9778035,0.000037109054,0.011121894,0.0017859504,0.0011572461],"about_ca_topic_score_codex":0.00090860337,"about_ca_topic_score_gemma":0.00017660737,"teacher_disagreement_score":0.42042315,"about_ca_system_score_codex":0.000550874,"about_ca_system_score_gemma":0.0014349559,"threshold_uncertainty_score":0.9999589},"labels":[],"label_agreement":null},{"id":"W3216216108","doi":"10.1109/qce52317.2021.00066","title":"Implementing the Simplex Method with Grover’s Search","year":2021,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Simplex; Algorithm; Mathematics; Combinatorics","score_opus":0.01785791535573846,"score_gpt":0.2965730413086798,"score_spread":0.27871512595294134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216216108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013078138,0.00004794958,0.973867,0.007286123,0.000072391565,0.00006756725,8.467736e-7,0.00014052221,0.0054394417],"genre_scores_gemma":[0.1881347,0.000002206729,0.808916,0.0018111839,0.00013230291,0.000003592652,0.0000017814672,0.000009894943,0.0009883397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851495,0.00018247067,0.00013063443,0.0003628033,0.00032378323,0.00048534534],"domain_scores_gemma":[0.99888223,0.00033247078,0.000031540185,0.00059131376,0.00010201259,0.000060435505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007802827,0.00010585764,0.00010528347,0.000028689428,0.00043336593,0.0003360867,0.0006702758,0.000018283376,0.00007188589],"category_scores_gemma":[0.00001872892,0.0000561218,0.000051239884,0.00054683106,0.00002333747,0.00009868889,0.00089347846,0.00020602952,0.0000136083145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002099205,0.000034900848,0.00031633239,0.000012239117,0.000053185653,0.00011101422,0.0015304919,0.005527737,0.0008892635,0.20062481,0.0012848221,0.7896131],"study_design_scores_gemma":[0.00023057759,0.00005451749,0.0013614469,0.000009947459,0.0000048132474,0.0002562721,0.0002652776,0.9282937,0.009640564,0.0031870473,0.056529984,0.00016584892],"about_ca_topic_score_codex":0.000088399065,"about_ca_topic_score_gemma":0.00006440495,"teacher_disagreement_score":0.922766,"about_ca_system_score_codex":0.000010436111,"about_ca_system_score_gemma":0.00012778207,"threshold_uncertainty_score":0.33331442},"labels":[],"label_agreement":null},{"id":"W3216395995","doi":"10.1103/physrevresearch.4.023237","title":"Tight bound for estimating expectation values from a system of linear equations ","year":2022,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Killam Trusts; Government of Alberta","keywords":"Invertible matrix; Upper and lower bounds; Mathematics; Hermitian matrix; Combinatorics; Matrix (chemical analysis); Function (biology); Block (permutation group theory); Polynomial; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.08595822101627063,"score_gpt":0.4194585419230088,"score_spread":0.3335003209067382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216395995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04025365,0.0060479916,0.9511497,0.0011905275,0.0001948659,0.00088584836,0.000037248086,0.0000966144,0.0001435629],"genre_scores_gemma":[0.7949586,0.000040869658,0.20390531,0.00005765061,0.0004674097,0.00048845634,0.000031351577,0.000015506865,0.000034871504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773616,0.0005481419,0.00026623247,0.00033815467,0.00085003336,0.00026127984],"domain_scores_gemma":[0.9968317,0.0023201758,0.00011258318,0.00042988852,0.00024175113,0.000063870946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013333369,0.000083659994,0.00027231764,0.0000810512,0.00065883057,0.000047423015,0.00064558565,0.000008708157,0.000006641843],"category_scores_gemma":[0.00063387287,0.000070757436,0.00013258506,0.0007770714,0.00004791824,0.00008443878,0.000523041,0.00029343145,0.000010483971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003302597,0.00115471,0.000026707303,0.009048275,0.00016796644,0.000023401564,0.01312548,0.059386108,0.010497313,0.3841112,0.0052008773,0.51722497],"study_design_scores_gemma":[0.00010524972,0.00016809761,0.000018406621,0.00059700734,0.000007665035,0.0000014615408,0.0000538091,0.98328215,0.00034497425,0.014631137,0.0007194092,0.00007063444],"about_ca_topic_score_codex":0.00006901702,"about_ca_topic_score_gemma":4.545146e-7,"teacher_disagreement_score":0.923896,"about_ca_system_score_codex":0.000072696006,"about_ca_system_score_gemma":0.0001309907,"threshold_uncertainty_score":0.50672585},"labels":[],"label_agreement":null},{"id":"W3216453180","doi":"10.1109/qce52317.2021.00042","title":"A Quantum Computing Programming Language for Transparent Experiment Descriptions","year":2021,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Compiler; Programming language; Quantum circuit; Abstraction layer; Computer architecture; Computer hardware; Quantum; Quantum computer; Software","score_opus":0.032696512634296425,"score_gpt":0.2962658568828584,"score_spread":0.263569344248562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216453180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06537798,0.00060346577,0.9316543,0.0011484595,0.0004510097,0.00020859929,0.000002262456,0.00039595636,0.00015797192],"genre_scores_gemma":[0.54184186,0.0000015254643,0.45770895,0.0002071729,0.00009811912,0.000018072107,0.000006768624,0.000008597155,0.00010894212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871916,0.00004656841,0.00022880758,0.00043948166,0.0001767478,0.00038922796],"domain_scores_gemma":[0.99929297,0.00010168918,0.00004618067,0.00037394013,0.000082348306,0.000102871774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017313588,0.00014350505,0.00016760416,0.000050968163,0.00027969616,0.00025779335,0.0003795201,0.000036020218,0.000009415036],"category_scores_gemma":[0.000023428971,0.00012628826,0.0001404956,0.00027598944,0.000020797856,0.00008895943,0.00014239487,0.00010280524,0.000005365693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004354196,0.00038906268,0.000045446573,0.00006501606,0.000045221495,0.000085084605,0.01532251,0.007473347,0.01796958,0.11926918,0.0005573896,0.8387738],"study_design_scores_gemma":[0.000382372,0.000086259395,0.000119537246,0.00004713406,0.0000059094036,0.000058006364,0.00078615395,0.9725988,0.017959198,0.00067666074,0.0070627183,0.00021727418],"about_ca_topic_score_codex":0.000022182814,"about_ca_topic_score_gemma":0.000012455551,"teacher_disagreement_score":0.96512544,"about_ca_system_score_codex":0.000027068148,"about_ca_system_score_gemma":0.00007744024,"threshold_uncertainty_score":0.5149886},"labels":[],"label_agreement":null},{"id":"W3216662891","doi":"10.1109/qce52317.2021.00053","title":"Pseudo Quantum Random Number Generator with Quantum Permutation Pad","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Random permutation; Quantum; Random number generation; Permutation (music); Generator (circuit theory); Computer science; Physics; Quantum mechanics; Mathematics; Algorithm; Discrete mathematics; Power (physics); Symmetric group","score_opus":0.010780642142434481,"score_gpt":0.24068660362579028,"score_spread":0.2299059614833558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216662891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36573905,0.00018107789,0.6301052,0.0012646258,0.0013800322,0.00030584916,0.000006250634,0.00051505625,0.0005028912],"genre_scores_gemma":[0.75865763,0.00004992222,0.23945104,0.00066641247,0.00057697645,0.000063785235,0.00008310924,0.00006117115,0.00038992421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592835,0.00036007975,0.0005925601,0.0016439551,0.0008280969,0.0006469552],"domain_scores_gemma":[0.99715155,0.0002124892,0.0003574834,0.0016072523,0.0004163184,0.00025491393],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004935973,0.00067820627,0.0007880195,0.00014667063,0.00031707907,0.0014302303,0.0015170189,0.0003477488,0.00013368724],"category_scores_gemma":[0.000053718573,0.00050601125,0.00031116372,0.00049832213,0.000091853355,0.00024561837,0.0017452228,0.0011753094,0.0000862974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036913418,0.0016569304,0.0045825383,0.0016377268,0.0018678925,0.0035690472,0.022042587,0.5924932,0.0031832494,0.23168562,0.013114262,0.12379782],"study_design_scores_gemma":[0.0012012938,0.000079012,0.0007100809,0.0002579628,0.000036508703,0.00025138923,0.00009531369,0.98989606,0.00074840174,0.005361433,0.0005255822,0.0008369633],"about_ca_topic_score_codex":0.00026012305,"about_ca_topic_score_gemma":0.000034258013,"teacher_disagreement_score":0.39740288,"about_ca_system_score_codex":0.00007443982,"about_ca_system_score_gemma":0.00072413846,"threshold_uncertainty_score":0.99973917},"labels":[],"label_agreement":null},{"id":"W3216902878","doi":"10.1103/physrevx.11.041039","title":"Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor","year":2020,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; National Defense Science and Engineering Graduate; U.S. Department of Energy","keywords":"Quantum computer; Computer science; Quantum error correction; Quantum algorithm; Quantum Fourier transform; Qubit; Quantum gate; Algorithm; Computer engineering; Quantum; Physics; Quantum mechanics","score_opus":0.07396372827062654,"score_gpt":0.20733369257074538,"score_spread":0.13336996430011883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216902878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46850982,0.00003611553,0.5294327,0.00085978507,0.00023896372,0.00042479695,0.0000037296836,0.00037619515,0.00011791002],"genre_scores_gemma":[0.98791945,0.000008446296,0.010797877,0.0009187642,0.00026440367,0.0000014425111,0.000005790254,0.00003095097,0.00005286814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973986,0.000242927,0.00037812404,0.0011774164,0.00014586686,0.0006570739],"domain_scores_gemma":[0.99761486,0.0011932248,0.00024088552,0.00045701387,0.00019785002,0.0002961609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077194563,0.00035684142,0.0007051037,0.00016171635,0.0006533297,0.00020402226,0.0012832778,0.000108643566,0.000006309168],"category_scores_gemma":[0.0004256965,0.0003434798,0.0003496804,0.0010288333,0.00014710355,0.0003959057,0.00040306055,0.0004190654,0.0000417228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030439724,0.00014267363,0.00012779409,0.00018277609,0.00010807288,0.00009858611,0.0023102327,0.68599784,0.00062211044,0.30464277,0.00017916513,0.002544022],"study_design_scores_gemma":[0.029107077,0.0002212031,0.000009870731,0.00010422397,0.000035336427,0.0000088769275,0.00022852788,0.9607358,0.00058055844,0.008219049,0.0003320326,0.00041741747],"about_ca_topic_score_codex":0.000034157336,"about_ca_topic_score_gemma":0.0000015047139,"teacher_disagreement_score":0.51940966,"about_ca_system_score_codex":0.000054060896,"about_ca_system_score_gemma":0.0001156884,"threshold_uncertainty_score":0.9999017},"labels":[],"label_agreement":null},{"id":"W3217227730","doi":"10.1103/physrevresearch.4.043210","title":"Efficient quantum computation of molecular forces and other energy gradients","year":2022,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Basic Energy Sciences; Chemical Sciences, Geosciences, and Biosciences Division; Australian Research Council; Office of Science; U.S. Department of Energy","keywords":"Quantum computer; Computer science; Context (archaeology); Quantum; Computation; Factorization; Algorithm; Computational science; Mathematical optimization; Statistical physics; Mathematics; Physics; Quantum mechanics","score_opus":0.03358486860772034,"score_gpt":0.3616324039813544,"score_spread":0.328047535373634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217227730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8455247,0.03291993,0.11922246,0.0013869171,0.0001065141,0.00037709676,0.0000076141437,0.00005798417,0.00039673888],"genre_scores_gemma":[0.99856824,0.00013035853,0.00095958594,0.00026304208,0.00002536518,0.000035022316,0.000001133954,0.000008550947,0.000008682697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977241,0.00059027935,0.00017482026,0.0003370579,0.00089154014,0.00028216254],"domain_scores_gemma":[0.99924767,0.00023008187,0.00006701925,0.00027652385,0.000094240015,0.000084436586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008790728,0.00008893018,0.00022956637,0.00010476873,0.00023155617,0.000029901523,0.00054632325,0.000007343198,0.0000037037996],"category_scores_gemma":[0.00006086739,0.000072677525,0.00007933424,0.000847111,0.00009879,0.000018597637,0.00091731164,0.00024899526,0.0000025457593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010227764,0.000669733,0.00004390908,0.0010269808,0.000038704446,0.000027222648,0.0009669018,0.04741211,0.0052521494,0.581117,0.00051932945,0.36291575],"study_design_scores_gemma":[0.00010447201,0.0002492857,0.000070484544,0.00021228763,0.0000033384147,0.0000103024595,0.000007884071,0.97060204,0.00045547637,0.024971258,0.003231473,0.00008170537],"about_ca_topic_score_codex":0.000072690586,"about_ca_topic_score_gemma":2.9986964e-7,"teacher_disagreement_score":0.92318994,"about_ca_system_score_codex":0.000023069078,"about_ca_system_score_gemma":0.00004079585,"threshold_uncertainty_score":0.29637033},"labels":[],"label_agreement":null},{"id":"W3217313236","doi":"10.22331/q-2022-06-13-734","title":"The Classification of Clifford Gates over Qubits","year":2022,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Basis (linear algebra); Controlled NOT gate; Standard basis; Mathematics; Qubit; Quantum circuit; Universal set; Quantum gate; Electronic circuit; Topology (electrical circuits); Computer science; Algorithm; Discrete mathematics; Pure mathematics; Set (abstract data type); Combinatorics; Quantum; Quantum mechanics; Quantum error correction; Physics","score_opus":0.014083662892441,"score_gpt":0.24595249181070733,"score_spread":0.23186882891826632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217313236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93496263,0.0005985634,0.05636557,0.005557952,0.0014189829,0.00017633749,0.000007755271,0.00017132527,0.00074089505],"genre_scores_gemma":[0.99828863,0.000009826565,0.001350443,0.00012519625,0.00005316148,0.000015088418,0.0000020733335,0.0000065845447,0.00014899764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892133,0.0001245821,0.00020973821,0.00021391622,0.0003297737,0.00020063919],"domain_scores_gemma":[0.99904907,0.00023838272,0.00014865735,0.00049566745,0.00003472084,0.000033495657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046516748,0.00007879252,0.00009346168,0.00004745595,0.0006089567,0.000060441234,0.0009589591,0.000015680373,0.000011056676],"category_scores_gemma":[0.000031308115,0.000055301378,0.00006589003,0.00036905968,0.00005483154,0.000058924375,0.00040637996,0.00019114961,0.000006272512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012169798,0.00008799821,0.00081455015,0.000010340406,0.00001900128,0.0000044378135,0.0009845159,0.0028277633,0.0036271678,0.88138765,0.005043464,0.10518093],"study_design_scores_gemma":[0.00011891868,0.00012669605,0.018216826,0.0000044519256,0.0000021088028,0.000011419809,0.000076386,0.90923643,0.0003371553,0.023564192,0.048217293,0.000088091976],"about_ca_topic_score_codex":0.000024261099,"about_ca_topic_score_gemma":0.000002627911,"teacher_disagreement_score":0.90640867,"about_ca_system_score_codex":0.000020562184,"about_ca_system_score_gemma":0.000052331867,"threshold_uncertainty_score":0.46836638},"labels":[],"label_agreement":null},{"id":"W3217505522","doi":"10.22323/1.396.0575","title":"Dimensional Expressivity Analysis, best-approximation errors, and automated design of parametric quantum circuits","year":2022,"lang":"en","type":"article","venue":"Proceedings of The 38th International Symposium on Lattice Field Theory — PoS(LATTICE2021)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Agencia Estatal de Investigación; Centres de Recerca de Catalunya; Government of Canada; Ministry of Colleges and Universities; Nuclear Physics; Institut Périmètre de physique théorique; Research and Innovation Foundation; Industry Canada; Generalitat de Catalunya; Agència de Gestió d'Ajuts Universitaris i de Recerca; National Science Foundation; Fundación Cellex; U.S. Department of Energy; Office of Science","keywords":"Computer science; Overhead (engineering); Dimension (graph theory); Quantum; Quantum computer; Electronic circuit; Quantum circuit; Parametric statistics; Algorithm; Theoretical computer science; Set (abstract data type); Computer engineering; Quantum error correction; Physics; Mathematics; Quantum mechanics","score_opus":0.01253737334641599,"score_gpt":0.2464566423561401,"score_spread":0.2339192690097241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217505522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9438121,0.00016460271,0.048474308,0.0046856725,0.0011899916,0.0005471698,0.00004460238,0.00020737482,0.00087422866],"genre_scores_gemma":[0.9931343,0.000009746544,0.006222122,0.00040203735,0.000056282013,0.00003099292,0.000005234818,0.000015289907,0.00012395316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735653,0.00018761962,0.0005785804,0.0005639811,0.001037425,0.0002758535],"domain_scores_gemma":[0.99707454,0.0013914516,0.0007899341,0.00032048358,0.0003410625,0.00008254843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015779012,0.00025034405,0.0003722373,0.0004481428,0.00037192265,0.00011433545,0.0016032003,0.00008684999,0.000047749625],"category_scores_gemma":[0.00047405245,0.00020207035,0.00021060671,0.001337793,0.00012806206,0.0003103487,0.0010933732,0.00047420972,0.0000018784569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042295532,0.0015106576,0.0057039065,0.0002404048,0.0021397,0.000008675944,0.0035696607,0.26672298,0.041298926,0.6705703,0.0006056254,0.0072061606],"study_design_scores_gemma":[0.00038990492,0.0004211438,0.0022565676,0.000083315055,0.0002299505,0.00003906175,0.000111153284,0.9651785,0.0114978105,0.01949178,0.00006836078,0.00023246638],"about_ca_topic_score_codex":0.0000289817,"about_ca_topic_score_gemma":2.2499535e-7,"teacher_disagreement_score":0.6984555,"about_ca_system_score_codex":0.000064989916,"about_ca_system_score_gemma":0.00005383711,"threshold_uncertainty_score":0.824019},"labels":[],"label_agreement":null},{"id":"W3217663389","doi":"10.1103/prxquantum.3.030319","title":"Morphing Quantum Codes","year":2022,"lang":"en","type":"preprint","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Simons Foundation","keywords":"Computer science; Morphing; Qubit; Code (set theory); Toric code; Algorithm; Reed–Muller code; Quantum; Theoretical computer science; Concatenated error correction code; Quantum computer; Decoding methods; Block code; Physics; Quantum mechanics; Programming language; Artificial intelligence","score_opus":0.02167480132444894,"score_gpt":0.2652634998279234,"score_spread":0.24358869850347448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217663389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24107806,0.0041930676,0.726881,0.008327257,0.013585653,0.0009919629,0.00014357435,0.0030524286,0.0017469655],"genre_scores_gemma":[0.92544204,0.00030679087,0.07031341,0.0016429687,0.0012269774,0.0002293768,0.00020173495,0.00016084922,0.0004758495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994864,0.00045995394,0.0007668262,0.0018083263,0.0011096603,0.0009912663],"domain_scores_gemma":[0.9961963,0.00038188233,0.0005726018,0.0024558646,0.000119639284,0.00027367746],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012131166,0.0007380347,0.00083735643,0.00044127277,0.00077192736,0.00082380156,0.0049832067,0.0002943001,0.0001442841],"category_scores_gemma":[0.00015006027,0.00072216016,0.00048157896,0.0005815155,0.000110017776,0.00018962946,0.010854487,0.002885804,0.00009055025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034724795,0.0006237598,0.00058391114,0.000863368,0.00040636113,0.0009812076,0.00821296,0.42003363,0.00034383286,0.49532807,0.021164926,0.05142325],"study_design_scores_gemma":[0.00019500105,0.00011375256,0.0005211217,0.00014017092,0.000021471093,0.000069990296,0.000055716646,0.84356165,0.00006083609,0.12466163,0.029798348,0.0008002951],"about_ca_topic_score_codex":0.00041488095,"about_ca_topic_score_gemma":0.0000062982704,"teacher_disagreement_score":0.68436396,"about_ca_system_score_codex":0.0001754753,"about_ca_system_score_gemma":0.00041452836,"threshold_uncertainty_score":0.9995229},"labels":[],"label_agreement":null},{"id":"W3217758127","doi":"10.1109/isocc53507.2021.9613918","title":"Solving Traveling Salesman Problems Using Ising Models with Simulated Bifurcation","year":2021,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Ising model; Solver; Simulated annealing; Hamiltonian (control theory); Computer science; Applied mathematics; Convergence (economics); Bifurcation; Benchmark (surveying); Mathematics; Mathematical optimization; Nonlinear system; Statistical physics; Physics; Quantum mechanics","score_opus":0.02793336687530808,"score_gpt":0.23493779911038687,"score_spread":0.20700443223507878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217758127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2917985,0.00009123437,0.70708776,0.00022323043,0.000083826024,0.0000670491,2.2460624e-7,0.00023141722,0.0004167419],"genre_scores_gemma":[0.63210315,0.0000020443365,0.36767274,0.00011918069,0.000045088615,3.811653e-7,0.0000020624325,0.000011787266,0.000043559296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986303,0.000058285783,0.00022715818,0.0004930501,0.00025981606,0.00033142616],"domain_scores_gemma":[0.9991806,0.000068363086,0.000084427054,0.0004046979,0.000183234,0.00007865314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001963675,0.00016132336,0.00016040771,0.00007498267,0.00031148078,0.0003637474,0.00030208746,0.000052762578,0.000004509665],"category_scores_gemma":[0.000011690093,0.00013099032,0.000045308316,0.0006765788,0.000022279863,0.00041848334,0.00016783808,0.00018180902,0.000002598046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.653126e-7,0.000024497695,0.00004857748,0.000016590824,0.000013412409,0.000023591441,0.0011139241,0.9731179,0.0060876273,0.004470357,0.0000018633297,0.015080731],"study_design_scores_gemma":[0.00023630507,0.000028006742,0.000065428896,0.00017037858,0.0000070251767,0.00013213101,0.000041558964,0.9892677,0.003924467,0.005884728,0.000023932327,0.00021835181],"about_ca_topic_score_codex":0.000058299705,"about_ca_topic_score_gemma":0.000014787628,"teacher_disagreement_score":0.34030464,"about_ca_system_score_codex":0.000035889832,"about_ca_system_score_gemma":0.00016436054,"threshold_uncertainty_score":0.53416306},"labels":[],"label_agreement":null},{"id":"W4200009586","doi":"10.1007/s11128-021-03357-w","title":"Security improvements for privacy-preserving quantum multiparty computation based on circular structure","year":2021,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Protocol (science); Quantum computer; Computation; Computer security; Private information retrieval; Quantum; Secure multi-party computation; Secure two-party computation; Oblivious transfer; Security parameter; Theoretical computer science; Cryptography; Algorithm; Physics; Quantum mechanics","score_opus":0.01172553634931154,"score_gpt":0.25852171970490223,"score_spread":0.2467961833555907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200009586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124656245,0.00006141802,0.8728459,0.0010140112,0.0005481013,0.00039752937,0.000035583325,0.00033554083,0.00010566279],"genre_scores_gemma":[0.9318332,0.0000011457835,0.06611252,0.001683202,0.00009665233,0.000025104828,0.00022720968,0.000017273704,0.000003668248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768025,0.000088020024,0.0006677661,0.0004412098,0.0006303778,0.0004923578],"domain_scores_gemma":[0.9980066,0.00016823348,0.00049067196,0.00054165913,0.00065865595,0.00013417874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004293026,0.00030208862,0.00027701803,0.00023552142,0.0007218408,0.0010042428,0.00073204003,0.0001398295,0.000008472964],"category_scores_gemma":[0.00038972293,0.00028531876,0.00012785898,0.00067819067,0.000033155415,0.002142096,0.00027762633,0.0002605109,0.000008999025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008136011,0.00028907097,0.00031170427,0.0027522524,0.00005542308,0.00001600569,0.009687371,0.58369505,0.0039190324,0.014982668,0.0013172522,0.3828928],"study_design_scores_gemma":[0.0011237303,0.00011145198,0.00040951837,0.00020382766,0.000009356075,0.000012671577,0.00012896689,0.96960706,0.0048306887,0.020792453,0.0024183006,0.0003519793],"about_ca_topic_score_codex":0.0000088507895,"about_ca_topic_score_gemma":0.0000011503226,"teacher_disagreement_score":0.807177,"about_ca_system_score_codex":0.00009169243,"about_ca_system_score_gemma":0.00039683716,"threshold_uncertainty_score":0.9999599},"labels":[],"label_agreement":null},{"id":"W4200392956","doi":"10.1109/qcs54837.2021.00012","title":"Large scale multi-node simulations of ℤ<sub>2</sub> gauge theory quantum circuits using Google Cloud Platform","year":2021,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum computer; Observable; Cloud computing; Quantum simulator; Qubit; Theoretical computer science; Computational science; Quantum information; Quantum; Field (mathematics); Computation; Computer engineering; Physics; Algorithm; Quantum mechanics; Mathematics","score_opus":0.02366924222866119,"score_gpt":0.26078552769355684,"score_spread":0.23711628546489566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200392956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.491871,0.00012468931,0.50718397,0.000052989177,0.0004018935,0.000066675886,0.000023737623,0.00011283679,0.00016221796],"genre_scores_gemma":[0.9412876,0.000005175295,0.058216397,0.0002565833,0.00012891182,0.0000012418416,0.00001261515,0.000021679507,0.00006980587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980442,0.00012580022,0.00043499505,0.0005367141,0.00034269178,0.00051560556],"domain_scores_gemma":[0.9984205,0.0003073425,0.00016209927,0.00077149185,0.00019869106,0.0001398914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044178593,0.0002248668,0.00031396086,0.00013102597,0.0003620642,0.00011428976,0.00057037815,0.00011070282,0.000022145929],"category_scores_gemma":[0.00009739361,0.00020502748,0.0001744462,0.0007214995,0.00006928326,0.0002693151,0.00050108664,0.00025751133,0.000017999926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010167472,0.0013174162,0.0013866642,0.00015239492,0.00014425929,0.000109896464,0.007958008,0.18835625,0.30743277,0.45431107,0.00021263908,0.038608458],"study_design_scores_gemma":[0.0005471458,0.000026157626,0.0006508853,0.000064279404,0.000012423697,0.000045515244,0.0001303841,0.90551376,0.07915893,0.013394478,0.00020566481,0.00025040345],"about_ca_topic_score_codex":0.000014316632,"about_ca_topic_score_gemma":0.00003874044,"teacher_disagreement_score":0.7171575,"about_ca_system_score_codex":0.000037442933,"about_ca_system_score_gemma":0.00020283132,"threshold_uncertainty_score":0.8360778},"labels":[],"label_agreement":null},{"id":"W4200501868","doi":"10.20944/preprints202112.0472.v1","title":"Post-Quantum Two-party Adaptor Signature Based on Coding Theory","year":2021,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cryptography; Hash function; Digital signature; Schnorr signature; Theoretical computer science; Ring signature; Blind signature; Computer security","score_opus":0.0454784904496383,"score_gpt":0.30051036167140777,"score_spread":0.25503187122176946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200501868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7556569,0.0003227992,0.23067042,0.003101696,0.0045193955,0.0008348114,0.00007155773,0.0013412427,0.0034811788],"genre_scores_gemma":[0.9840837,0.000016210657,0.012517032,0.0022717908,0.0005747488,0.000065402826,0.000076044445,0.00007648437,0.00031855755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99385136,0.0009625312,0.0006857441,0.0026503522,0.0009848322,0.0008651836],"domain_scores_gemma":[0.9940725,0.0007780268,0.0005028576,0.0039000127,0.00039891966,0.00034769415],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019310928,0.0008420814,0.0008126837,0.00035751204,0.00039257668,0.0003391701,0.0035849449,0.0005657394,0.00025631647],"category_scores_gemma":[0.0006294577,0.00078256085,0.0006247424,0.0004435374,0.00012733982,0.00016626224,0.00582282,0.003492912,0.00027848984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035886595,0.0018965888,0.015186347,0.0011350873,0.0007182725,0.0016802228,0.0076525463,0.7745732,0.05160207,0.105139755,0.0003605604,0.039696485],"study_design_scores_gemma":[0.0006738882,0.0000917747,0.017568773,0.0010775015,0.000047120197,0.00003143926,0.000066521294,0.9390057,0.029395102,0.00983394,0.0010022005,0.0012060873],"about_ca_topic_score_codex":0.00005903598,"about_ca_topic_score_gemma":0.0000053736812,"teacher_disagreement_score":0.22842683,"about_ca_system_score_codex":0.00016962973,"about_ca_system_score_gemma":0.0007277624,"threshold_uncertainty_score":0.99946254},"labels":[],"label_agreement":null},{"id":"W4200634137","doi":"10.1038/s41586-022-04566-8","title":"Realizing repeated quantum error correction in a distance-three surface code","year":2022,"lang":"en","type":"preprint","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Institut quantique; Université de Sherbrooke","funders":"","keywords":"Quantum error correction; Error detection and correction; Computer science; Quantum computer; Qubit; Algorithm; Quantum decoherence; Quantum; Quantum mechanics; Physics","score_opus":0.016062780606695935,"score_gpt":0.2807038146984789,"score_spread":0.26464103409178297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200634137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5746925,0.008831365,0.37345317,0.0072208187,0.030009968,0.0014167385,0.00020493838,0.0022368627,0.00193366],"genre_scores_gemma":[0.9758308,0.0000776968,0.0225304,0.00053690135,0.00032003826,0.000035926834,0.0001562643,0.000062803585,0.0004491642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964459,0.0002992353,0.00050438463,0.00145813,0.0007338117,0.00055856485],"domain_scores_gemma":[0.9977085,0.00019203192,0.00039863432,0.0014834986,0.00010928686,0.00010805268],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0008119009,0.00046052103,0.0005386923,0.00026078438,0.0002921918,0.00026927973,0.002076351,0.0016232516,0.000022411721],"category_scores_gemma":[0.00016565734,0.0004558654,0.00020847327,0.0010676736,0.00004429856,0.00011275877,0.002677025,0.013810916,0.0000051040965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085936714,0.0002317139,0.0038614601,0.00029640252,0.00007721201,0.00066691247,0.0024724216,0.92890275,0.00027678112,0.010518408,0.018728746,0.033881288],"study_design_scores_gemma":[0.0002796104,0.00005800968,0.005738741,0.00033771747,0.000008608541,0.00004663672,0.000058547605,0.9670591,0.00007793545,0.008591264,0.017214078,0.0005298046],"about_ca_topic_score_codex":0.00054033485,"about_ca_topic_score_gemma":0.0012411195,"teacher_disagreement_score":0.40113834,"about_ca_system_score_codex":0.00037655391,"about_ca_system_score_gemma":0.0002937687,"threshold_uncertainty_score":0.9997893},"labels":[],"label_agreement":null},{"id":"W4200634639","doi":"10.1103/physreva.105.042418","title":"Topological graph states and quantum error-correction codes","year":2022,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Alberta","keywords":"Qubit; Toric code; Mathematics; Bipartite graph; Quantum error correction; Discrete mathematics; Topology (electrical circuits); Quantum computer; Quantum; Quantum mechanics; Physics; Graph; Combinatorics","score_opus":0.014462789824953706,"score_gpt":0.3282931642753013,"score_spread":0.3138303744503476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200634639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7288969,0.1911682,0.060064025,0.015287784,0.0012963588,0.001957084,0.000044170316,0.0007890858,0.0004963906],"genre_scores_gemma":[0.88374835,0.10507709,0.0014225192,0.008705811,0.00051055633,0.00039876244,0.000036144134,0.00004250495,0.00005825162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959844,0.0008970006,0.0005405921,0.0010821299,0.00085391785,0.00064199144],"domain_scores_gemma":[0.99767256,0.00075643725,0.00031515793,0.0008434163,0.00009864619,0.0003137612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073430006,0.00047971457,0.0012872054,0.00006860228,0.0005959143,0.00009498237,0.0011206052,0.000024352887,0.00002939999],"category_scores_gemma":[0.0003485786,0.00035738442,0.00058244256,0.001297436,0.00020920234,0.00022691315,0.0012446902,0.0009861585,0.00006215063],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036767404,0.0033436916,0.0004522295,0.008430909,0.00020069227,0.00014434512,0.0009544661,0.001451108,0.0045729843,0.2258064,0.036832783,0.7177736],"study_design_scores_gemma":[0.0003174264,0.0012453303,0.0011141922,0.0031795225,0.00019676112,0.00015282835,0.000026617929,0.66025186,0.00054842856,0.26221824,0.0697494,0.0009994117],"about_ca_topic_score_codex":0.00004517747,"about_ca_topic_score_gemma":0.0000020242828,"teacher_disagreement_score":0.7167742,"about_ca_system_score_codex":0.00006109345,"about_ca_system_score_gemma":0.000065162705,"threshold_uncertainty_score":0.9998878},"labels":[],"label_agreement":null},{"id":"W4206143818","doi":"10.1109/icct52962.2021.9657891","title":"Entropy Transformation and Expansion with Quantum Permutation Pad for 5G Secure Networks","year":2021,"lang":"en","type":"article","venue":"2021 IEEE 21st International Conference on Communication Technology (ICCT)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Randomness; Random permutation; Pseudorandom permutation; Permutation (music); Entropy (arrow of time); Bit-reversal permutation; Computer science; Discrete mathematics; Mathematics; Theoretical computer science; Permutation graph; Algorithm; Symmetric group; Quantum mechanics","score_opus":0.017222823168202363,"score_gpt":0.2655164819587026,"score_spread":0.24829365879050022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206143818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12155934,0.00032353375,0.83516735,0.040709443,0.00044681292,0.00041959604,0.000024255609,0.00030015016,0.0010495359],"genre_scores_gemma":[0.9751504,0.00086486206,0.023216091,0.00032075951,0.00005058642,0.00010836956,0.000212865,0.000012475847,0.000063602034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854654,0.000120221834,0.0003501188,0.00046434105,0.00027911944,0.00023964369],"domain_scores_gemma":[0.99805915,0.00018766863,0.00022501635,0.00075830374,0.0007118626,0.000057990845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023744888,0.00021564234,0.00021721561,0.000269567,0.0003613068,0.00025488724,0.0009974304,0.00020806666,0.00003419366],"category_scores_gemma":[0.000057047386,0.00019862474,0.000057745954,0.00043048064,0.00015041507,0.00034011784,0.00010992923,0.00047814663,0.0000099662675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004030379,0.00012158248,0.0000930235,0.000016808204,0.000062621075,0.0000053221115,0.00090627343,0.0054133954,0.0027267346,0.8618446,0.0001459099,0.12862343],"study_design_scores_gemma":[0.0008389503,0.0002527967,0.0002115653,0.00019970584,0.0000120594705,0.000092667884,0.0005853024,0.95289695,0.0073265443,0.0353318,0.0019966078,0.00025502284],"about_ca_topic_score_codex":0.000009162981,"about_ca_topic_score_gemma":0.000028157481,"teacher_disagreement_score":0.9474836,"about_ca_system_score_codex":0.00006476381,"about_ca_system_score_gemma":0.00014208443,"threshold_uncertainty_score":0.8099682},"labels":[],"label_agreement":null},{"id":"W4206169446","doi":"10.1109/ccc.2004.1313850","title":"Quantum Arthur-Merlin games","year":2004,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Canada Research Chairs","keywords":"Soundness; Computer science; Quantum; Discrete mathematics; Quantum pseudo-telepathy; Completeness (order theory); Merlin (protein); Quantum information; Mathematics; Quantum channel; Quantum mechanics; Physics","score_opus":0.009482055724223072,"score_gpt":0.22693159221854164,"score_spread":0.21744953649431858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206169446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1663549,0.000103808816,0.8257265,0.00443278,0.00041667637,0.000058396363,3.922942e-7,0.00050668494,0.0023998888],"genre_scores_gemma":[0.85606706,0.000005626976,0.14266963,0.0009306706,0.00012094669,0.0000023511645,5.9197646e-7,0.000007177064,0.00019592009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989981,0.000019898614,0.000152913,0.00033356622,0.00019937786,0.00029611422],"domain_scores_gemma":[0.9993413,0.000036758945,0.00003769662,0.00045408215,0.0000305589,0.00009957855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013285699,0.00012427135,0.0001192068,0.00007302842,0.00011728358,0.00013603683,0.0006590857,0.000038471826,0.000015831802],"category_scores_gemma":[0.000016067035,0.00009501565,0.00007145165,0.00029391164,0.000034046912,0.00014255973,0.00019989673,0.00014495617,0.00022276328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014575555,0.0000859002,0.000062279854,0.000006263933,0.00001194454,0.000053762065,0.00084761216,0.0215849,0.0005250417,0.83407456,0.00058418023,0.14216213],"study_design_scores_gemma":[0.0007762286,0.00023236168,0.0028937291,0.00004455731,0.0000031458376,0.00015815692,0.00003251887,0.7195799,0.0054456284,0.25650597,0.013849943,0.00047790245],"about_ca_topic_score_codex":0.000035826073,"about_ca_topic_score_gemma":0.0000073528527,"teacher_disagreement_score":0.69799495,"about_ca_system_score_codex":0.000015587093,"about_ca_system_score_gemma":0.00006407036,"threshold_uncertainty_score":0.38746256},"labels":[],"label_agreement":null},{"id":"W4206193620","doi":"10.5802/alco.189","title":"Pretty good quantum fractional revival in paths and cycles","year":2022,"lang":"en","type":"article","venue":"Algebraic Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation; National Science Foundation","keywords":"Eigenvalues and eigenvectors; Adjacency matrix; Lemma (botany); Mathematics; Kronecker delta; Generalization; Characterization (materials science); Spectral properties; Combinatorics; Quantum; Graph; Quantum graph; Discrete mathematics; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.0075304557018013325,"score_gpt":0.2200925737900866,"score_spread":0.21256211808828526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206193620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785071,0.0014776912,0.013840925,0.0033584223,0.0017887616,0.00023451743,0.0000073223914,0.00023515144,0.0005500823],"genre_scores_gemma":[0.99820006,0.000029729843,0.0012883254,0.00032323413,0.00004806947,0.00002699814,0.000004260528,0.000013291814,0.00006601679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982425,0.00019591452,0.00026331,0.0004890243,0.00047854058,0.0003307035],"domain_scores_gemma":[0.9990741,0.0002973219,0.00010675511,0.0003955013,0.000030252764,0.000096054304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053878705,0.00016673576,0.00020606854,0.0001737277,0.00040774656,0.00009906,0.0006588024,0.000041713567,0.000017626098],"category_scores_gemma":[0.000060509083,0.00017385787,0.000055503755,0.000781879,0.000037757236,0.0001712215,0.001027696,0.00059305254,0.000005002485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055455616,0.00025592285,0.007917036,0.000021265554,0.00001286436,0.000093719325,0.0008667461,0.0009115732,0.000045065663,0.96424246,0.00060301094,0.0250248],"study_design_scores_gemma":[0.00077837973,0.00028975925,0.052198194,0.000020304406,0.0000050385065,0.00019439244,0.0000812132,0.4277808,0.000028292361,0.5051125,0.013136543,0.00037455076],"about_ca_topic_score_codex":0.000040266717,"about_ca_topic_score_gemma":0.0000022721372,"teacher_disagreement_score":0.45912993,"about_ca_system_score_codex":0.00008944469,"about_ca_system_score_gemma":0.00009704145,"threshold_uncertainty_score":0.7089718},"labels":[],"label_agreement":null},{"id":"W4206219836","doi":"10.1007/978-981-16-8896-6","title":"Communication, Networks and Computing","year":2021,"lang":"en","type":"book","venue":"Communications in computer and information science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.014781042505968331,"score_gpt":0.2655973228497469,"score_spread":0.25081628034377856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206219836","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020487263,0.005468624,0.94459426,0.001996459,0.0003510777,0.0003291131,0.0000045871056,0.00019038719,0.04686061],"genre_scores_gemma":[0.05831165,0.013084855,0.9222039,0.0041574463,0.0001721745,0.000023072167,0.00021087972,0.000028528937,0.0018075219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792314,0.0001432838,0.0007572392,0.00042461877,0.00039995584,0.0003517578],"domain_scores_gemma":[0.9953961,0.0005917013,0.0003909336,0.0030106704,0.00045649183,0.00015414182],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016394621,0.0002795862,0.00035918175,0.00073131244,0.0010494811,0.0016251996,0.004107721,0.00016382198,0.0000016801828],"category_scores_gemma":[0.00006940801,0.00028738249,0.000044589935,0.0010505847,0.0011723149,0.0035602744,0.008550522,0.0009084204,0.0000061343185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.9182524e-7,0.000028341732,0.000091039765,0.000051630068,0.000010473479,0.0000013593778,0.003418732,0.01115129,5.3911526e-7,0.30044967,0.0014482405,0.6833479],"study_design_scores_gemma":[0.00020156626,0.00002260901,0.0015468625,0.00036602374,0.0000037287666,0.00008548467,0.000020252324,0.9342341,9.669468e-7,0.0033539846,0.059867132,0.00029732802],"about_ca_topic_score_codex":0.000013055917,"about_ca_topic_score_gemma":0.0000082087,"teacher_disagreement_score":0.92308277,"about_ca_system_score_codex":0.0001290273,"about_ca_system_score_gemma":0.00058832415,"threshold_uncertainty_score":0.99995786},"labels":[],"label_agreement":null},{"id":"W4206342749","doi":"10.20935/al4635","title":"Are Symmetric Traveling Salesman Problems Well Suited to Benchmark Some Quantum Optimization Problems?","year":2022,"lang":"en","type":"article","venue":"Academia Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Travelling salesman problem; Benchmark (surveying); Mathematical optimization; Quantum; Computer science; 2-opt; Mathematics; Physics; Geography; Quantum mechanics; Cartography","score_opus":0.013066798575664883,"score_gpt":0.22098057103429825,"score_spread":0.20791377245863335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206342749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36021292,0.00033583125,0.5828033,0.053750135,0.0011592747,0.0009542046,0.000014924791,0.0006875864,0.000081801685],"genre_scores_gemma":[0.90593946,0.00002418737,0.05273495,0.0403682,0.00052543177,0.00018785085,0.00004409948,0.00007811523,0.00009772885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658316,0.00027274527,0.0005454923,0.000961373,0.0008246415,0.00081261055],"domain_scores_gemma":[0.99853814,0.00019723375,0.00040710875,0.00056413095,0.00004639406,0.00024701556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008894492,0.00033977578,0.0003347999,0.0006596932,0.000774734,0.00019560993,0.0018813863,0.00016522818,0.00003082248],"category_scores_gemma":[0.0000836744,0.000345697,0.00012894912,0.0027423436,0.000039000795,0.00035643618,0.0009880216,0.0018612173,0.000033946344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038831004,0.000039952927,0.0006023956,0.000041108,0.000022165126,0.00002788079,0.0010357131,0.9852688,0.0014023981,0.0014284704,0.006429543,0.0036977227],"study_design_scores_gemma":[0.00040066973,0.000115409326,0.0022001953,0.00007485314,0.000012256521,0.000056848847,0.000046968886,0.9831743,0.00017099752,0.0007576374,0.012459889,0.0005299659],"about_ca_topic_score_codex":0.000037676593,"about_ca_topic_score_gemma":9.945963e-7,"teacher_disagreement_score":0.54572654,"about_ca_system_score_codex":0.00020474447,"about_ca_system_score_gemma":0.00004906251,"threshold_uncertainty_score":0.9998995},"labels":[],"label_agreement":null},{"id":"W4210286649","doi":"","title":"Building a Quantum Engineering Undergraduate Program","year":2022,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Arizona; U.S. Department of Energy; Canada First Research Excellence Fund; SPIE; National Science Foundation","keywords":"Computer science; Systems engineering; Engineering physics; Engineering; Software engineering; Computational science","score_opus":0.007895291248051743,"score_gpt":0.23487852610196355,"score_spread":0.2269832348539118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210286649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4023493,0.0012479668,0.5569035,0.029981643,0.00301154,0.0009042274,0.00003421979,0.0053296764,0.00023796994],"genre_scores_gemma":[0.6122967,0.000011352209,0.3873979,0.00006726372,0.00004318826,0.00011350603,0.00000320531,0.000026656251,0.000040250987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974139,0.00004102791,0.00045761868,0.0007697446,0.0005796705,0.00073808973],"domain_scores_gemma":[0.99828684,0.00004158354,0.00029554116,0.0011862239,0.00008044404,0.000109354056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035071658,0.00036363554,0.000456424,0.0011311444,0.0005207572,0.000089450645,0.0025356305,0.00016003363,0.0000052043165],"category_scores_gemma":[0.00013394658,0.0003760964,0.00018807064,0.0027075135,0.00020750769,0.00029709307,0.002147824,0.0010314167,0.0000059295653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011334126,0.00050173776,0.0005690713,0.00010753098,0.0002283344,0.00031626638,0.00026763475,0.10706924,0.011392993,0.5989405,0.0012704504,0.27932492],"study_design_scores_gemma":[0.00060075213,0.00052890426,0.00019989758,0.00007479945,0.000020991904,0.00025913405,0.000021407574,0.61302865,0.004461624,0.015057724,0.3651949,0.00055124075],"about_ca_topic_score_codex":0.00002561621,"about_ca_topic_score_gemma":0.0000035404444,"teacher_disagreement_score":0.58388275,"about_ca_system_score_codex":0.00014534759,"about_ca_system_score_gemma":0.0001594491,"threshold_uncertainty_score":0.9998691},"labels":[],"label_agreement":null},{"id":"W4210694755","doi":"10.1103/physrevresearch.4.013092","title":"Universal fault-tolerant quantum computing with stabilizer codes","year":2022,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; University College London; Government of Canada; Australian Research Council; Ministry of Colleges and Universities","keywords":"Quantum computer; Universal set; Computer science; Quantum logic; Quantum gate; Theoretical computer science; Mathematics; Topology (electrical circuits); Set (abstract data type); Quantum; Quantum mechanics; Programming language; Physics","score_opus":0.04218106821831423,"score_gpt":0.3606849453337062,"score_spread":0.31850387711539196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210694755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7929085,0.025512107,0.15611511,0.018248565,0.00042163287,0.0024920749,0.000035399218,0.000842896,0.003423735],"genre_scores_gemma":[0.9947693,0.00029658238,0.0041954676,0.00043961292,0.00015944007,0.00003397588,0.0000059346694,0.00002413575,0.000075557145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519724,0.0012589555,0.0002349827,0.0007252506,0.001797759,0.00078584475],"domain_scores_gemma":[0.99771696,0.0009185843,0.0000836277,0.0008284906,0.00024488408,0.00020745226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019788046,0.00020128232,0.00045068172,0.00013158373,0.0010749351,0.00013694455,0.0018389085,0.00001299265,0.000040100145],"category_scores_gemma":[0.00010183449,0.0001481416,0.00013622061,0.001965575,0.00019904012,0.00013983823,0.002086827,0.0013495426,0.000048507212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010537173,0.0022375705,0.00032317825,0.0025373104,0.00017623829,0.0007854115,0.0059933723,0.054625414,0.0018776149,0.47642183,0.01189608,0.4430206],"study_design_scores_gemma":[0.00029106063,0.0006587172,0.00018349782,0.0004819807,0.000007705935,0.00005270063,0.00009359731,0.95208603,0.000071960894,0.004726515,0.041087393,0.00025884347],"about_ca_topic_score_codex":0.000081619146,"about_ca_topic_score_gemma":0.0000022690695,"teacher_disagreement_score":0.89746064,"about_ca_system_score_codex":0.00012983143,"about_ca_system_score_gemma":0.00027164986,"threshold_uncertainty_score":0.82676405},"labels":[],"label_agreement":null},{"id":"W4212894544","doi":"10.21468/scipost.report.2404","title":"Report on 2009.11884v2","year":2021,"lang":"en","type":"peer-review","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Deutsche Forschungsgemeinschaft; Foundational Questions Institute; Imperial College London; Government of Canada; European Commission; Heinrich Böll Stiftung","keywords":"Computer science","score_opus":0.021726551255231263,"score_gpt":0.2913885343582084,"score_spread":0.2696619831029771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212894544","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011718975,0.077917136,0.26828277,0.4003006,0.025825828,0.0007290407,0.000072989445,0.0013849589,0.22547497],"genre_scores_gemma":[0.0000074103227,0.0021619725,0.07513042,0.02936248,0.001691477,0.00002091542,0.00036024538,0.000044587447,0.8912205],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99661845,0.000119465025,0.0005863824,0.0012961217,0.0009145588,0.0004650212],"domain_scores_gemma":[0.9966603,0.00015634172,0.00032282967,0.0024216918,0.00026802087,0.00017080418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063657545,0.00045331448,0.0007576294,0.00013921734,0.00013476246,0.00024182694,0.001685892,0.00022438203,0.0003672828],"category_scores_gemma":[0.00023615529,0.00034704496,0.00039108624,0.00058789336,0.00002848364,0.000053030275,0.00084279745,0.00093580165,0.00026854005],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.7858129e-7,0.000036844434,4.0986197e-7,0.00035441451,0.000025315358,0.001912715,0.0000073421656,0.00007836489,3.472804e-7,0.0012434945,0.8883777,0.10796288],"study_design_scores_gemma":[0.000060695053,0.00006238227,0.000012546576,0.003364235,0.000017737253,0.0012476057,3.353092e-7,0.01217431,0.000021349819,0.00046320516,0.9821356,0.00043999977],"about_ca_topic_score_codex":0.00006907669,"about_ca_topic_score_gemma":0.000012136444,"teacher_disagreement_score":0.66574556,"about_ca_system_score_codex":0.00004184381,"about_ca_system_score_gemma":0.00047720718,"threshold_uncertainty_score":0.99989814},"labels":[],"label_agreement":null},{"id":"W4213212652","doi":"10.1103/revmodphys.94.015004","title":"Noisy intermediate-scale quantum algorithms","year":2022,"lang":"en","type":"article","venue":"Reviews of Modern Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1653,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Samsung; Ministry of Education - Singapore; National Research Foundation; UK Research and Innovation; Office of Naval Research; Google; U.S. Department of Energy","keywords":"Quantum computer; Computation; Scalability; Scale (ratio); Quantum; Quantum algorithm; Computational science; Noise (video); Physics; Computer science; Theoretical computer science; Algorithm; Computer engineering; Artificial intelligence; Quantum mechanics","score_opus":0.021748643673989602,"score_gpt":0.2586126982676553,"score_spread":0.23686405459366572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213212652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017116666,0.005146867,0.97586834,0.00044306827,0.0006830213,0.0003226887,0.000018770033,0.00012733988,0.00027325415],"genre_scores_gemma":[0.8432652,0.0019496178,0.15141705,0.0019109729,0.00088774716,0.00018760345,0.000038343525,0.00008478464,0.00025869592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981275,0.00022416495,0.00046738467,0.00044237106,0.00043064565,0.00030794137],"domain_scores_gemma":[0.9986116,0.00006995557,0.0003312241,0.0008568471,0.000046556168,0.00008381697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005326589,0.0002051693,0.00051595026,0.00005184399,0.0002082873,0.000037109763,0.0014901897,0.000023410517,0.000016349966],"category_scores_gemma":[0.000015253251,0.00018136737,0.00028471355,0.00044647124,0.000051061394,0.00014791462,0.0011434125,0.00036212872,0.000022680542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023159655,0.00018161001,0.000034066295,0.00008802337,0.000013588555,0.0000050884187,0.0012633563,0.010475551,0.0005905846,0.003962881,0.0011331656,0.9822498],"study_design_scores_gemma":[0.00017305778,0.00014471464,0.00008109352,0.000044877048,0.000009402481,0.000013660026,0.0000059080867,0.9268243,0.00034684537,0.032819293,0.039319295,0.00021759952],"about_ca_topic_score_codex":0.000009052241,"about_ca_topic_score_gemma":5.4112445e-7,"teacher_disagreement_score":0.9820322,"about_ca_system_score_codex":0.00003792861,"about_ca_system_score_gemma":0.000061952014,"threshold_uncertainty_score":0.7395947},"labels":[],"label_agreement":null},{"id":"W4213330506","doi":"10.1109/aps/ursi47566.2021.9703909","title":"Towards Solution of Integral Equations in Electromagnetics on Quantum Computers","year":2021,"lang":"en","type":"article","venue":"2021 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting (APS/URSI)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Electromagnetics; Scattering-matrix method; Computational electromagnetics; Integral equation; Matrix (chemical analysis); Matrix algebra; Computer science; Applied mathematics; Mathematics; Maxwell's equations; Algebra over a field; Computational science; Mathematical analysis; Electromagnetic field; Physics; Quantum mechanics; Eigenvalues and eigenvectors; Pure mathematics","score_opus":0.013656228861041645,"score_gpt":0.2589498185439777,"score_spread":0.24529358968293605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213330506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.785021,0.00025899097,0.18426447,0.024512729,0.0032025524,0.0003346648,0.000018004457,0.00008697717,0.0023006245],"genre_scores_gemma":[0.9876279,0.00019713877,0.011390902,0.00043743243,0.00018331507,0.000007301668,0.000014644686,0.000011848413,0.00012948467],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971234,0.00017128172,0.0005265351,0.0008397898,0.0008890158,0.0004499406],"domain_scores_gemma":[0.9985831,0.00022709648,0.00027330875,0.0003101251,0.00043350927,0.00017290295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011280945,0.00026067742,0.0002923666,0.0004695941,0.00038456992,0.00044443368,0.00067905645,0.00008593484,0.000008249004],"category_scores_gemma":[0.0002592349,0.0002367474,0.00008578818,0.0010128728,0.00035276974,0.00037832573,0.0001757131,0.00037060768,0.000004119079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001743162,0.0010374341,0.0018228213,0.000103100334,0.00008495337,0.0001406941,0.0060142865,0.028344197,0.43834028,0.2688508,0.00050726236,0.25457984],"study_design_scores_gemma":[0.0006339472,0.0005985078,0.0045076353,0.0004982748,0.000008832579,0.00008757722,0.00015121799,0.96387315,0.02737039,0.0017254971,0.00025609872,0.00028889446],"about_ca_topic_score_codex":0.00009918656,"about_ca_topic_score_gemma":0.000030413552,"teacher_disagreement_score":0.93552893,"about_ca_system_score_codex":0.00015111185,"about_ca_system_score_gemma":0.0003281043,"threshold_uncertainty_score":0.9654279},"labels":[],"label_agreement":null},{"id":"W4213431242","doi":"10.3390/e24030323","title":"Quantum Bitcoin Mining","year":2022,"lang":"en","type":"article","venue":"Entropy","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Cryptographic nonce; Quantum computer; Computer science; Qubit; Quantum entanglement; Quantum; Quantum algorithm; Theoretical computer science; Algorithm; Quantum mechanics; Physics; Computer security","score_opus":0.009382443106682844,"score_gpt":0.22189435471672544,"score_spread":0.2125119116100426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213431242","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5958404,0.0002758611,0.39636815,0.0042620003,0.0018935372,0.00010084167,0.000004172079,0.0004888607,0.0007662036],"genre_scores_gemma":[0.9510455,0.0000011814694,0.047632635,0.0008666505,0.00015641951,0.000012435429,0.000001929433,0.000009702544,0.00027353232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989089,0.00009977906,0.00012740184,0.00028963728,0.0002973909,0.00027689844],"domain_scores_gemma":[0.99944454,0.00006718358,0.000055620872,0.00035945768,0.000011403868,0.000061779225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021060425,0.000091197675,0.00009914696,0.00008543344,0.00043306086,0.00007732566,0.00079554284,0.0000114378,0.00009444326],"category_scores_gemma":[0.000015886748,0.00008642681,0.00006185704,0.00035549598,0.000015479616,0.00006339419,0.000715883,0.00020006184,0.000032783722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015271962,0.0002561475,0.0016760748,0.000013403055,0.00004614859,0.000438233,0.00685769,0.06796645,0.0041704657,0.7638822,0.039712377,0.114965536],"study_design_scores_gemma":[0.00021144804,0.00012769518,0.00062491663,0.0000028998404,0.0000015028953,0.00008093881,0.00006399101,0.9180346,0.00019976495,0.0050428095,0.075468,0.00014140071],"about_ca_topic_score_codex":0.000017686669,"about_ca_topic_score_gemma":4.0032728e-7,"teacher_disagreement_score":0.8500682,"about_ca_system_score_codex":0.000032360393,"about_ca_system_score_gemma":0.000041799773,"threshold_uncertainty_score":0.35243827},"labels":[],"label_agreement":null},{"id":"W4214520296","doi":"10.3390/electronics11050721","title":"Automated Detection of Alzheimer’s via Hybrid Classical Quantum Neural Networks","year":2022,"lang":"en","type":"article","venue":"Electronics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"King Saud University","keywords":"Computer science; Quantum; Artificial intelligence; Quantum machine learning; Artificial neural network; Transfer of learning; Deep learning; Feature (linguistics); Algorithm; Pattern recognition (psychology); Quantum computer; Physics; Quantum mechanics","score_opus":0.008863171803042084,"score_gpt":0.22965951061896372,"score_spread":0.22079633881592164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214520296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24890085,0.007317258,0.7408946,0.00065954606,0.0009960206,0.0001669559,0.0000029562298,0.0010360159,0.000025812882],"genre_scores_gemma":[0.9982261,0.000018941593,0.0014445763,0.00016166877,0.00010138838,0.000013472572,0.000006996048,0.00001748958,0.000009352161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982609,0.00020758978,0.00028532735,0.00037058257,0.0003535238,0.00052205875],"domain_scores_gemma":[0.9992286,0.00007157822,0.00016967504,0.00041905628,0.000040537576,0.000070529844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003202215,0.0001580691,0.00021041677,0.0001086866,0.00037129747,0.00004207077,0.00069533725,0.00003377072,0.000007710713],"category_scores_gemma":[0.000010916308,0.00015847289,0.000120397344,0.0005913564,0.00003746472,0.00008526924,0.00044296708,0.0006928848,0.0000020762454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021045691,0.00013372027,0.000013074767,0.0000047594317,0.00007384562,0.000028481018,0.000127271,0.5951213,0.006204061,0.0031693103,0.0007331342,0.39437],"study_design_scores_gemma":[0.00020607638,0.0006488439,0.00016216593,0.0000019155668,0.00001391377,0.0002222092,0.0000026718533,0.98757887,0.003917449,0.0014511568,0.0056233006,0.00017145058],"about_ca_topic_score_codex":0.000008925523,"about_ca_topic_score_gemma":0.0000051434376,"teacher_disagreement_score":0.7493253,"about_ca_system_score_codex":0.000077048026,"about_ca_system_score_gemma":0.00008557873,"threshold_uncertainty_score":0.64623374},"labels":[],"label_agreement":null},{"id":"W4214847524","doi":"10.1016/j.micpro.2022.104487","title":"Template-based mapping of reversible circuits to IBM quantum computers","year":2022,"lang":"en","type":"article","venue":"Microprocessors and Microsystems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Quantum computer; Toffoli gate; Quantum circuit; Realization (probability); Overhead (engineering); Quantum gate; Electronic circuit; IBM; Quantum algorithm; Quantum; Quantum network; Topology (electrical circuits); Computer engineering; Electrical engineering; Physics; Mathematics; Quantum mechanics","score_opus":0.01223140105240527,"score_gpt":0.212387204429228,"score_spread":0.20015580337682273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214847524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72275877,0.00093115494,0.27398124,0.0006651607,0.0011031341,0.00033177948,0.000042616633,0.0001367481,0.00004939375],"genre_scores_gemma":[0.9882453,0.0000031320305,0.010907071,0.00058496045,0.00008697097,0.00002006153,0.000006556748,0.000020636076,0.00012528857],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981443,0.00010338985,0.00042678617,0.00061150495,0.00029454604,0.00041941908],"domain_scores_gemma":[0.9990277,0.000081837265,0.00022833918,0.00041970523,0.00009806187,0.00014430677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005500595,0.00022286946,0.00038225017,0.00034578453,0.0005574646,0.00014023186,0.00094876473,0.00004432025,0.00000531541],"category_scores_gemma":[0.0000109576995,0.00022236019,0.00008817912,0.00096446567,0.000043443033,0.00008534464,0.00064621033,0.00022860186,0.000005490102],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042779455,0.00039573753,0.002883953,0.002098733,0.00012490778,0.00011416565,0.016363323,0.062204674,0.845389,0.0025533543,0.022708477,0.045120914],"study_design_scores_gemma":[0.002963184,0.0012144833,0.0013640304,0.00095755217,0.000026848204,0.00071963837,0.0014929882,0.66027856,0.065990515,0.00056693616,0.2626927,0.0017325797],"about_ca_topic_score_codex":0.00022351752,"about_ca_topic_score_gemma":0.0000032835665,"teacher_disagreement_score":0.77939844,"about_ca_system_score_codex":0.00005473678,"about_ca_system_score_gemma":0.000121578385,"threshold_uncertainty_score":0.90675855},"labels":[],"label_agreement":null},{"id":"W4214875055","doi":"10.20533/licej.2040.2589.2021.0468","title":"Asynchronous Lectures, View-Speed Effect","year":2021,"lang":"en","type":"article","venue":"Literacy Information and Computer Education Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Asynchronous communication; Computer science; Parallel computing; Mathematics education; Mathematics; Telecommunications","score_opus":0.003089016350428206,"score_gpt":0.24108851915525817,"score_spread":0.23799950280482995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214875055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06730372,0.0009702993,0.9253149,0.0026692967,0.0030181396,0.00009175643,0.0000011551689,0.00009905973,0.0005316489],"genre_scores_gemma":[0.5867226,0.00022025542,0.39004624,0.020453405,0.0023168859,0.00000812757,0.000074216754,0.000015467414,0.00014277738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874455,0.00016860706,0.0004487931,0.00016074466,0.0002511495,0.00022613257],"domain_scores_gemma":[0.9987642,0.00009913288,0.00022921863,0.00027339256,0.00037407663,0.00025994357],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003166723,0.00016949188,0.00017272001,0.000203879,0.00037905446,0.0023161313,0.0003373443,0.000052861138,0.000040729883],"category_scores_gemma":[0.00004239928,0.00013999232,0.00008037232,0.0003515415,0.000018919383,0.0021390985,0.00015301717,0.00036065257,0.0000432752],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031704815,0.000037068472,0.00018069074,0.00003202475,0.000014969739,0.0000054202665,0.0039881244,0.00067532714,0.000009482452,0.0048561646,0.0029459484,0.9872516],"study_design_scores_gemma":[0.00071837247,0.00022019574,0.010241632,0.0001769817,0.00000997929,0.007133194,0.000037275608,0.6496694,0.00034864098,0.0043050298,0.32679874,0.00034056357],"about_ca_topic_score_codex":0.0000022480324,"about_ca_topic_score_gemma":1.2974955e-7,"teacher_disagreement_score":0.98691106,"about_ca_system_score_codex":0.00003993116,"about_ca_system_score_gemma":0.0005269733,"threshold_uncertainty_score":0.9987196},"labels":[],"label_agreement":null},{"id":"W4220703779","doi":"10.1103/physreve.105.035305","title":"Comparison between a quantum annealer and a classical approximation algorithm for computing the ground state of an Ising spin glass","year":2022,"lang":"en","type":"article","venue":"Physical review. E","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Israel Science Foundation","keywords":"Ising model; Approximation algorithm; Bounded function; Quantum computer; Computer science; Algorithm; Degree (music); Ising spin; Mathematics; Quantum; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.031177204324364587,"score_gpt":0.3505240145030203,"score_spread":0.3193468101786557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220703779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40504965,0.0011134724,0.5919907,0.0011877853,0.000088363886,0.0004887364,0.000018727324,0.000055610213,0.0000069216067],"genre_scores_gemma":[0.94065243,0.000031401247,0.058622606,0.00033416983,0.000279449,0.000036387883,0.0000224682,0.000017738636,0.0000033291137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979321,0.00039838438,0.0004500282,0.00045997946,0.00043884706,0.00032066362],"domain_scores_gemma":[0.99844843,0.00062404416,0.0003483845,0.00041176745,0.00007059233,0.0000967514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009891408,0.00019012591,0.0005618342,0.000044448556,0.0005149569,0.000101343765,0.0006935805,0.000013689068,5.8289453e-7],"category_scores_gemma":[0.000049490285,0.0001380173,0.00014501825,0.00044568442,0.00010968768,0.00016199017,0.0005832962,0.00037334918,8.5624004e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003014308,0.00016696603,0.00004324835,0.00023844725,0.00002198257,0.0000010149316,0.0012219539,0.0017063734,0.00014861723,0.0044816853,0.00010673091,0.99186],"study_design_scores_gemma":[0.00023028982,0.00043066166,0.0020664276,0.0001640456,0.000030671756,0.000009177983,0.000029981995,0.97766143,0.00013162625,0.017164337,0.0019113582,0.00017000119],"about_ca_topic_score_codex":0.00001693964,"about_ca_topic_score_gemma":6.1707414e-7,"teacher_disagreement_score":0.99169,"about_ca_system_score_codex":0.00003230077,"about_ca_system_score_gemma":0.00004205322,"threshold_uncertainty_score":0.5628183},"labels":[],"label_agreement":null},{"id":"W4220864350","doi":"10.1109/tnnls.2022.3159713","title":"Fast-Converging Simulated Annealing for Ising Models Based on Integral Stochastic Computing","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Core Research for Evolutional Science and Technology; Precursory Research for Embryonic Science and Technology; Japan Science and Technology Agency; Japan Society for the Promotion of Science","keywords":"Quantum annealing; Simulated annealing; Ising model; Probabilistic logic; Quantum computer; Convergence (economics); Spins; Quantum","score_opus":0.013828785019253715,"score_gpt":0.22879394301927533,"score_spread":0.2149651580000216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220864350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08591363,0.00010508267,0.9109799,0.00015591535,0.0020558855,0.0003808325,0.000004794135,0.00039563543,0.000008293566],"genre_scores_gemma":[0.9976944,7.1658707e-7,0.0017629431,0.00023786078,0.00018258457,0.000020796477,0.0000047110343,0.00003938285,0.000056623343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773943,0.00044866372,0.00036492888,0.0006191828,0.00031407087,0.00051372655],"domain_scores_gemma":[0.99830025,0.0010921204,0.00018283325,0.000249565,0.00005607816,0.00011914692],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00066682784,0.00028205806,0.00032445378,0.00025094295,0.0024989494,0.00035278284,0.00034554006,0.00006529916,0.0000019378],"category_scores_gemma":[0.000007159951,0.00027015436,0.00015252916,0.00045594646,0.00003120511,0.00012916855,0.000012196695,0.0013421554,3.784174e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000493702,0.000032318076,0.0000022657985,0.000023617196,0.000018369215,0.000007185432,0.00059233524,0.9501388,0.000012687029,0.000067832196,0.0000068852055,0.049048316],"study_design_scores_gemma":[0.0006811689,0.00063875894,0.0000035773992,0.00016405772,0.000014848266,0.000044076474,0.00025686665,0.99783385,0.000004936488,0.00002816029,0.000036660796,0.00029303177],"about_ca_topic_score_codex":0.00006737415,"about_ca_topic_score_gemma":9.261733e-7,"teacher_disagreement_score":0.9117808,"about_ca_system_score_codex":0.000068654226,"about_ca_system_score_gemma":0.000025853395,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W4220946875","doi":"10.1145/3517341","title":"Authenticity, Integrity, and Replay Protection in Quantum Data Communications and Networking","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Quantum Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Quantum cryptography; Quantum network; Quantum teleportation; Quantum information science; Quantum channel; Quantum entanglement; Data integrity; Quantum; Computer network; Theoretical computer science; Quantum information; Computer security; Physics; Quantum mechanics","score_opus":0.07464641013812022,"score_gpt":0.30139690111907497,"score_spread":0.22675049098095473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220946875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26364636,0.0006203433,0.7294845,0.0049328855,0.0006407955,0.00036513692,0.00001511473,0.00027624625,0.000018638986],"genre_scores_gemma":[0.96743464,0.00010485728,0.032103807,0.00023216268,0.000058403013,0.000023344006,0.000011680035,0.00002257282,0.000008552241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972379,0.000588543,0.00048873073,0.0009053293,0.00034966966,0.00042980732],"domain_scores_gemma":[0.9962576,0.0007016054,0.0001871053,0.0027154097,0.000035429406,0.00010286599],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0017091838,0.00024537055,0.00028614965,0.0003928069,0.0018598802,0.00027935335,0.0027237243,0.000067096254,0.000004655127],"category_scores_gemma":[0.000042535215,0.0002628412,0.000045818277,0.00096149155,0.00013429759,0.00030364114,0.0018363192,0.0018926174,0.000001954566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026505371,0.0003982799,0.0007692095,0.000050289822,0.00004835651,0.000023713637,0.004123522,0.022088636,0.00017011042,0.006514258,0.000036111032,0.965751],"study_design_scores_gemma":[0.0004082591,0.00023645558,0.0010941982,0.00010069368,0.000012258054,0.00025774856,0.00030014952,0.9859102,0.000012273411,0.009855265,0.0015328606,0.00027965006],"about_ca_topic_score_codex":0.0005501704,"about_ca_topic_score_gemma":0.000082357255,"teacher_disagreement_score":0.9654714,"about_ca_system_score_codex":0.000077529934,"about_ca_system_score_gemma":0.000075750846,"threshold_uncertainty_score":0.99998236},"labels":[],"label_agreement":null},{"id":"W4221139462","doi":"10.1103/physreva.106.012439","title":"Algorithmic cooling for resolving state preparation and measurement errors in quantum computing","year":2022,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Quantum computer; Overhead (engineering); Benchmarking; State (computer science); Qubit; Imperfect; Protocol (science); Quantum; Computer engineering; Field (mathematics); Algorithm; Mathematics; Physics; Operating system; Quantum mechanics","score_opus":0.024663065296363057,"score_gpt":0.3453591231572859,"score_spread":0.3206960578609228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221139462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4554705,0.13886085,0.3951303,0.004241735,0.0004815275,0.0051979665,0.00002699438,0.0005193763,0.00007075481],"genre_scores_gemma":[0.9781142,0.0097087305,0.008948688,0.0023544368,0.00032925777,0.00046240777,0.000014099521,0.00006321461,0.0000049936766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560213,0.00071015436,0.00082407077,0.001072359,0.0010955601,0.0006957532],"domain_scores_gemma":[0.9978655,0.000593146,0.0004704486,0.00067965593,0.00018735135,0.00020388832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002569093,0.0004292221,0.0011901847,0.00009399,0.00041069687,0.00009724549,0.0008782842,0.000016684131,0.0000014167837],"category_scores_gemma":[0.00064802036,0.00037870256,0.000386084,0.0010345646,0.000063899475,0.00024352473,0.00089652115,0.000666976,0.0000066643875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099334175,0.0023738046,0.00015265062,0.022572221,0.00017845759,0.00006594222,0.0041904156,0.028861864,0.014357845,0.031312793,0.0035291547,0.8923055],"study_design_scores_gemma":[0.00036991225,0.000402969,0.00024155271,0.005443336,0.000058148726,0.00001724965,0.000007236198,0.9631697,0.00033315227,0.019667141,0.009835343,0.00045429336],"about_ca_topic_score_codex":0.000030329233,"about_ca_topic_score_gemma":0.0000042420393,"teacher_disagreement_score":0.9343078,"about_ca_system_score_codex":0.0002066737,"about_ca_system_score_gemma":0.00014837584,"threshold_uncertainty_score":0.9998665},"labels":[],"label_agreement":null},{"id":"W4221147137","doi":"10.48550/arxiv.2201.10672","title":"Efficiently improving the performance of noisy quantum computers","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Testbed; Noise (video); Qubit; Probabilistic logic; Quantum computer; Computer engineering; Electronic engineering; Quantum; Computer network; Physics; Artificial intelligence","score_opus":0.026296629830234387,"score_gpt":0.1704506912893443,"score_spread":0.14415406145910992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221147137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71285266,0.00006771936,0.28514743,0.00010607336,0.0013116094,0.00021093826,0.000009892352,0.0001570777,0.00013661977],"genre_scores_gemma":[0.9972609,0.00003269872,0.0023198384,0.000106781314,0.000081704966,8.7780245e-7,0.0000068670915,0.000018104058,0.00017222576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978583,0.00022423794,0.0002842491,0.0009968892,0.00021148809,0.000424867],"domain_scores_gemma":[0.99742377,0.00025686968,0.00047919762,0.0016388267,0.00010553612,0.000095804695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055409444,0.0003258804,0.00035858472,0.00023886118,0.00050666963,0.00010585113,0.004177598,0.00011655724,0.000015103671],"category_scores_gemma":[0.000017810331,0.00028456928,0.00028517577,0.0008349845,0.0001888558,0.00012404834,0.0065805223,0.0011032245,0.000009026673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011793627,0.000064311316,0.00064218696,0.00010940224,0.000042634016,0.000051143936,0.00056800887,0.9744278,0.000049111157,0.020886099,0.00007622151,0.0030712695],"study_design_scores_gemma":[0.00024413687,0.00015688826,0.0015515782,0.00006909906,0.000028875646,0.000009913369,0.000062307314,0.9961556,0.00012032721,0.00091329904,0.0003663305,0.00032165105],"about_ca_topic_score_codex":0.00016393725,"about_ca_topic_score_gemma":0.0000030210774,"teacher_disagreement_score":0.28440827,"about_ca_system_score_codex":0.00011923064,"about_ca_system_score_gemma":0.00024334733,"threshold_uncertainty_score":0.99996066},"labels":[],"label_agreement":null},{"id":"W4221159734","doi":"10.1103/physreva.106.022801","title":"Quantum annealing with pairs of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mrow><mml:msup><mml:mrow/><mml:mn>2</mml:mn></mml:msup><mml:mi mathvariant=\"normal\">Σ</mml:mi></mml:mrow></mml:math> molecules as qubits","year":2022,"lang":"lv","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum annealing; Zeeman effect; Annealing (glass); Simulated annealing; Ising model; Electric field; Algorithm; Qubit; Sigma; Physics; Condensed matter physics; Magnetic field; Quantum computer; Computer science; Quantum; Quantum mechanics; Thermodynamics","score_opus":0.014921253286854907,"score_gpt":0.2659593768304589,"score_spread":0.251038123543604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221159734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87244993,0.033280917,0.007813349,0.0035129408,0.0017231236,0.00022825305,0.0003714814,0.00038783695,0.08023216],"genre_scores_gemma":[0.9754503,0.01426706,0.0035116072,0.0031717177,0.0017432414,0.0009812323,0.000377366,0.00043113736,0.00006636505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9897574,0.0010131777,0.0018715842,0.0020910609,0.0031701422,0.0020966146],"domain_scores_gemma":[0.99202853,0.0017569592,0.002268364,0.0027225376,0.00022415898,0.0009994612],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001938457,0.0010199684,0.0009033373,0.00021831991,0.0013788207,0.00069910457,0.0031460572,0.00045862293,0.014010725],"category_scores_gemma":[0.0015069285,0.0014272479,0.0025493845,0.0020914297,0.0011064524,0.00089211954,0.0033038422,0.0022393076,0.0013771988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025300088,0.00074396585,0.000002366764,0.008011948,0.0007644716,0.0010457385,0.0013254387,0.0023326424,0.001461531,0.93355817,0.03391218,0.016588558],"study_design_scores_gemma":[0.0008579291,0.0030185932,0.000039887203,0.010779011,0.0016252645,0.0011360274,0.00024586142,0.777174,0.19055231,0.0009341992,0.012062721,0.0015742197],"about_ca_topic_score_codex":0.00050997944,"about_ca_topic_score_gemma":0.00004252758,"teacher_disagreement_score":0.932624,"about_ca_system_score_codex":0.000020663529,"about_ca_system_score_gemma":0.0013451979,"threshold_uncertainty_score":0.99992126},"labels":[],"label_agreement":null},{"id":"W4221159976","doi":"10.4230/lipics.tqc.2022.12","title":"Qutrit Metaplectic Gates Are a Subset of Clifford+T","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"MAGIC (telescope); Qutrit; Clifford algebra; Qubit; State (computer science); Topology (electrical circuits); Mathematics; Discrete mathematics; Physics; Combinatorics; Quantum mechanics; Quantum; Pure mathematics; Algorithm; Algebra over a field","score_opus":0.05235351671631452,"score_gpt":0.18844762382519792,"score_spread":0.1360941071088834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221159976","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77818537,0.00035614983,0.21875793,0.0002905224,0.00097378134,0.00032113714,0.00006478919,0.0003501604,0.0007001833],"genre_scores_gemma":[0.9952201,0.000090799476,0.003965046,0.000072866074,0.00006649372,0.0000012694197,0.000016801307,0.000021325635,0.000545268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773043,0.00026749916,0.00028675905,0.0011362173,0.00017470647,0.0004043568],"domain_scores_gemma":[0.9975042,0.0002216537,0.00056559575,0.0014313865,0.00013577692,0.00014142029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003613121,0.00034709918,0.00056243286,0.00041270617,0.00024614224,0.0000857557,0.0027831749,0.00016649996,0.00007890331],"category_scores_gemma":[0.00004843317,0.0003838049,0.000406711,0.001124872,0.000110646215,0.00012954639,0.0040870123,0.0009675338,0.00001284079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032683765,0.00025800208,0.0072165313,0.00028564793,0.00026149082,0.00055833085,0.00059173873,0.9230884,0.000031846033,0.0661053,0.00040860265,0.0011614482],"study_design_scores_gemma":[0.00039429797,0.000121632984,0.0032351585,0.0001004291,0.000081925115,0.000014200174,0.00010692899,0.94737685,0.0001481668,0.04650171,0.0014460573,0.00047266722],"about_ca_topic_score_codex":0.00022728335,"about_ca_topic_score_gemma":0.000036574384,"teacher_disagreement_score":0.21703479,"about_ca_system_score_codex":0.00009550823,"about_ca_system_score_gemma":0.00020787875,"threshold_uncertainty_score":0.99986136},"labels":[],"label_agreement":null},{"id":"W4225620835","doi":"10.48550/arxiv.2201.12459","title":"Gate-based Quantum Computing for Protein Design","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Compute Canada; Canadian Institutes of Health Research; Western Canada Research Grid; CMC Microsystems","keywords":"Quantum computer; Quantum gate; Electronic circuit; Quantum circuit; Computation; Quantum; Computer science; Quantum algorithm; Algorithm; Sequence (biology); Quadratic equation; Theoretical computer science; Computer engineering; Mathematics; Quantum error correction; Physics; Quantum mechanics","score_opus":0.07459465967289892,"score_gpt":0.2018558118408978,"score_spread":0.12726115216799888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225620835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14891168,0.000046986926,0.8481915,0.0002463782,0.0007262944,0.0011743905,0.000023374638,0.0005962696,0.00008309356],"genre_scores_gemma":[0.90623945,0.0000024621083,0.0931015,0.0001638695,0.00013444587,0.000007177862,0.000026594531,0.000040799165,0.0002836717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968267,0.00042487972,0.00029726845,0.0016353828,0.00016561513,0.0006501715],"domain_scores_gemma":[0.9975263,0.00037093755,0.00042333218,0.0013423415,0.00015095588,0.00018613774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008347973,0.00046617535,0.00046708767,0.00035302129,0.00069514744,0.00022853952,0.003018534,0.00021351117,0.000022447373],"category_scores_gemma":[0.000064140535,0.00053763576,0.00039781752,0.0006846284,0.00008893698,0.00010958278,0.002694995,0.00097135466,0.00001214473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004044687,0.00009506866,0.00005395397,0.00012989053,0.00004557137,0.00014893734,0.00013287175,0.9471937,0.000054824166,0.050601307,0.00017373245,0.0013297098],"study_design_scores_gemma":[0.0006795123,0.00023515671,0.0000745355,0.00012753428,0.000029342555,0.0000033626025,0.000022791355,0.9520341,0.00023992437,0.04513138,0.00081408996,0.0006082581],"about_ca_topic_score_codex":0.000069881215,"about_ca_topic_score_gemma":0.000002257982,"teacher_disagreement_score":0.7573278,"about_ca_system_score_codex":0.00023127571,"about_ca_system_score_gemma":0.0005673332,"threshold_uncertainty_score":0.9997075},"labels":[],"label_agreement":null},{"id":"W4225986500","doi":"10.1103/physrevlett.128.220503","title":"How to Simulate Quantum Measurement without Computing Marginals","year":2022,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada; International Business Machines Corporation","keywords":"Qubit; Quantum computer; Computer science; Quantum algorithm; Quantum state; One-way quantum computer; Quantum circuit; Quantum walk; Algorithm; Quantum; Quantum error correction; Quantum mechanics; Physics","score_opus":0.02892856593612689,"score_gpt":0.2818772989756332,"score_spread":0.25294873303950627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225986500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.155139,0.0038341593,0.6403958,0.19858505,0.00067032664,0.00092259346,0.000004604503,0.0003982314,0.000050217335],"genre_scores_gemma":[0.93947065,0.000034058423,0.008843018,0.051316634,0.00026858595,0.0000350013,0.0000015829888,0.000021918304,0.00000852601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970262,0.0003631453,0.00024406762,0.0006532076,0.001190573,0.0005227762],"domain_scores_gemma":[0.99877906,0.00011299714,0.00015367847,0.0006902577,0.000068140216,0.00019585987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090622046,0.000260716,0.00048870814,0.00007455455,0.00040634366,0.00018918111,0.001297608,0.0000043164914,0.000005247903],"category_scores_gemma":[0.00008563029,0.00022541129,0.00023360513,0.0007314425,0.000025121773,0.00011397684,0.0010977398,0.00040997562,0.000040815346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020752981,0.00070118206,0.0002187368,0.0017791863,0.0002156583,0.00021709723,0.0026807638,0.5359877,0.03070626,0.012475944,0.04890811,0.36608863],"study_design_scores_gemma":[0.00018440625,0.0001529698,0.00028508905,0.0005590969,0.000022235496,0.000019966892,0.0000052638225,0.890086,0.00009900171,0.00044103246,0.107728824,0.00041610785],"about_ca_topic_score_codex":0.0000065665454,"about_ca_topic_score_gemma":2.0762602e-7,"teacher_disagreement_score":0.7843317,"about_ca_system_score_codex":0.00012418313,"about_ca_system_score_gemma":0.000036493075,"threshold_uncertainty_score":0.9192006},"labels":[],"label_agreement":null},{"id":"W4226016191","doi":"10.48550/arxiv.2112.12435","title":"A Divide-and-Conquer Approach to Dicke State Preparation","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Qubit; Fidelity; Divide and conquer algorithms; State (computer science); Computer science; Quantum computer; IBM; Hamming code; Electronic circuit; Code (set theory); Algorithm; Topology (electrical circuits); Quantum; Mathematics; Physics; Quantum mechanics; Telecommunications; Decoding methods; Combinatorics","score_opus":0.0394092450936977,"score_gpt":0.18816111971724828,"score_spread":0.14875187462355058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226016191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41317433,0.00004894893,0.5853166,0.00010518276,0.00022148424,0.00019401725,0.000004991523,0.00015665872,0.0007777697],"genre_scores_gemma":[0.9813503,0.000038359452,0.017491389,0.00020748105,0.00007349613,0.0000017222786,0.00001792595,0.0000153764,0.00080393866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977684,0.00017048453,0.00018916761,0.0014157951,0.0001130249,0.00034309723],"domain_scores_gemma":[0.9984007,0.000070552785,0.00014584398,0.0010175217,0.00012603741,0.00023936234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000253438,0.00030325924,0.0003243736,0.00020675123,0.00018049145,0.00038814472,0.0010480551,0.00015092328,0.0000032388655],"category_scores_gemma":[0.000029285446,0.00032782697,0.00012818539,0.0005135107,0.000058379133,0.00021569354,0.0034765673,0.0005055933,0.000015134786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012282771,0.00009050694,0.0003424312,0.000072819654,0.000068620786,0.00011291334,0.0025321748,0.9766582,0.000027408205,0.014469941,0.00017570629,0.005436966],"study_design_scores_gemma":[0.00019521554,0.0000526127,0.0014286318,0.000078521436,0.000023075272,0.0000142938725,0.00002814851,0.9828005,0.00007816568,0.014352348,0.00053879153,0.00040971013],"about_ca_topic_score_codex":0.0001389118,"about_ca_topic_score_gemma":0.000018228027,"teacher_disagreement_score":0.568176,"about_ca_system_score_codex":0.00007536307,"about_ca_system_score_gemma":0.00016953163,"threshold_uncertainty_score":0.9999174},"labels":[],"label_agreement":null},{"id":"W4226048270","doi":"10.1063/5.0088821","title":"Quantum Gaussian process model of potential energy surface for a polyatomic molecule","year":2022,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Statistical physics; Quantum entanglement; Quantum; Qubit; Ansatz; Quantum computer; Gaussian; Quantum algorithm; Bayesian optimization; Computer science; Gaussian process; Quantum process; Quantum state; Quantum mechanics; Physics; Algorithm; Quantum dynamics; Artificial intelligence","score_opus":0.009583893164545285,"score_gpt":0.23147617876233756,"score_spread":0.22189228559779228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226048270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47060385,0.000068154295,0.5286403,0.0005573978,0.00007602929,0.000028673549,0.000005678183,0.000008113131,0.000011823706],"genre_scores_gemma":[0.9915602,0.000002227192,0.008109411,0.0001645434,0.00014132056,0.0000011475596,8.315707e-7,0.000011958483,0.000008340934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989164,0.00005802451,0.00030352196,0.00010871505,0.00041758252,0.00019579066],"domain_scores_gemma":[0.9990994,0.000091148075,0.00040746076,0.00022433209,0.000117816,0.00005986357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002979312,0.000106527645,0.00021879621,0.000022076565,0.00011714457,0.000019013652,0.0012231409,0.000020333979,0.0000010347424],"category_scores_gemma":[0.000010978179,0.000074484466,0.00017221301,0.00021818705,0.00005416321,0.00008249329,0.00026822806,0.0002797281,9.484999e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007310036,0.000121532496,8.155324e-7,0.00001528326,0.000029513005,0.0000016377589,0.00055961165,0.6942615,0.295631,0.007484892,0.0002107378,0.0016104234],"study_design_scores_gemma":[0.00026392317,0.00009873478,4.7853564e-7,0.000008605918,0.000016005497,0.00004670947,0.00001882041,0.72098523,0.17642304,0.10206106,0.000010873253,0.00006652057],"about_ca_topic_score_codex":0.0000042887414,"about_ca_topic_score_gemma":1.9974031e-8,"teacher_disagreement_score":0.52095634,"about_ca_system_score_codex":0.000025688863,"about_ca_system_score_gemma":0.00017397729,"threshold_uncertainty_score":0.30373883},"labels":[],"label_agreement":null},{"id":"W4226071615","doi":"10.1103/prxquantum.3.030317","title":"Holographic Simulation of Correlated Electrons on a Trapped-Ion Quantum Processor","year":2022,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of Tokyo; Alfred P. Sloan Foundation; U.S. Department of Energy; Division of Materials Research; Office of Science; Canada First Research Excellence Fund; National Science Foundation","keywords":"Holography; Quantum computer; Electron; Quantum; Computation; Computational science; Ion; Physics; Quantum simulator; Quantum memory; Parallel computing; Computer science; Quantum network; Statistical physics; Quantum mechanics; Algorithm","score_opus":0.012453383566317436,"score_gpt":0.24707511900630905,"score_spread":0.2346217354399916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226071615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8210351,0.000270265,0.17604883,0.0009122671,0.00070924626,0.00038872487,0.000012324737,0.00043374544,0.00018952168],"genre_scores_gemma":[0.9989001,0.000008088367,0.00072146277,0.00021023776,0.00005128316,0.00003907856,0.00001471125,0.000023184415,0.000031851618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976538,0.00026785428,0.00042216535,0.00058493426,0.0005955171,0.00047575225],"domain_scores_gemma":[0.9986559,0.00029988826,0.0003177586,0.00055021205,0.00008981593,0.000086423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054349407,0.00023214702,0.00029539954,0.00043822618,0.00047390538,0.00004838381,0.00092040276,0.000068918474,0.000021803178],"category_scores_gemma":[0.00007433491,0.00021757666,0.00015913302,0.0016138692,0.00006264329,0.00012712009,0.00027077683,0.000628548,0.0000086004375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011517012,0.0006058174,0.00038250937,0.00004636876,0.000047618993,0.000027089669,0.0015994292,0.90338486,0.002927805,0.07672728,0.000296227,0.013839827],"study_design_scores_gemma":[0.0004858726,0.0014750569,0.0020372525,0.00002773691,0.000011435928,0.000028962037,0.0000356271,0.9756508,0.0005846538,0.017947866,0.0014635212,0.00025125427],"about_ca_topic_score_codex":0.000021970833,"about_ca_topic_score_gemma":0.0000014645224,"teacher_disagreement_score":0.17786503,"about_ca_system_score_codex":0.00004295101,"about_ca_system_score_gemma":0.000121389414,"threshold_uncertainty_score":0.88725185},"labels":[],"label_agreement":null},{"id":"W4226083025","doi":"10.48550/arxiv.2202.08380","title":"The platypus of the quantum channel zoo","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Army Research Office; Multidisciplinary University Research Initiative; National Science Foundation","keywords":"Quantum channel; Channel (broadcasting); Qutrit; Quantum; Variety (cybernetics); Qubit; Quantum information; Computer science; Classical capacity; Amplitude damping channel; Information flow; Conjecture; Topology (electrical circuits); Physics; Mathematics; Theoretical physics; Theoretical computer science; Quantum mechanics; Pure mathematics; Quantum network; Telecommunications; Combinatorics; Artificial intelligence; Philosophy","score_opus":0.037332234172308555,"score_gpt":0.17482855177459686,"score_spread":0.1374963176022883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226083025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74693733,0.0004719725,0.24214222,0.0016964305,0.0060145264,0.000583121,0.0000383287,0.00028691787,0.0018291414],"genre_scores_gemma":[0.9982503,0.00008720433,0.00021222925,0.000087603345,0.00008327738,9.467514e-7,0.000002034076,0.000014315353,0.001262099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982214,0.0002986372,0.00021101035,0.0007264395,0.00018411927,0.00035836844],"domain_scores_gemma":[0.99716765,0.00031604522,0.0003942336,0.0019663502,0.00008243599,0.00007329232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042993797,0.000253459,0.00024809473,0.00009540141,0.00085981557,0.000095070085,0.0052249674,0.00012200587,0.00001125062],"category_scores_gemma":[0.00004299268,0.00017317043,0.00035146947,0.0007267945,0.00020595844,0.00006510709,0.0078548435,0.0010940693,0.000007287023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011720736,0.00004286866,0.00022977276,0.000027239774,0.00006510921,0.000045694254,0.00053985335,0.80959463,0.000006401055,0.1879354,0.00044167094,0.0010596263],"study_design_scores_gemma":[0.00015180533,0.00003972361,0.0012939601,0.000039746643,0.000020934436,0.000006843815,0.00009301985,0.91058546,0.000040522747,0.08466269,0.0028580907,0.00020718607],"about_ca_topic_score_codex":0.00015746136,"about_ca_topic_score_gemma":0.000021105192,"teacher_disagreement_score":0.25131294,"about_ca_system_score_codex":0.000089594374,"about_ca_system_score_gemma":0.0002449555,"threshold_uncertainty_score":0.97905004},"labels":[],"label_agreement":null},{"id":"W4226158585","doi":"10.3204/pubdb-2022-00995","title":"Model-Independent Error Mitigation in Parametric Quantum Circuits and Depolarizing Projection of Quantum Noise","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Agencia Estatal de Investigación; Office of Science; Centres de Recerca de Catalunya; Government of Canada; Ministry of Colleges and Universities; Nuclear Physics; Institut Périmètre de physique théorique; Research and Innovation Foundation; Industry Canada; National Natural Science Foundation of China; Generalitat de Catalunya; Agència de Gestió d'Ajuts Universitaris i de Recerca; National Science Foundation; European Regional Development Fund; U.S. Department of Energy; Fundación Cellex","keywords":"Quantum computer; Quantum error correction; Quantum circuit; Quantum; Quantum algorithm; Computer science; Quantum network; Physics; Statistical physics; Electronic engineering; Algorithm; Quantum mechanics; Engineering","score_opus":0.05745251270272352,"score_gpt":0.2058482669123679,"score_spread":0.14839575420964438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226158585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5532907,0.00012284727,0.4460297,0.000030083405,0.00023421616,0.00019372175,0.000003865027,0.000064425345,0.000030404033],"genre_scores_gemma":[0.995957,0.00010434663,0.0038327693,0.000021915617,0.000029956956,0.0000012849146,0.000012214103,0.000017997343,0.000022485696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976144,0.00023158274,0.00037544573,0.0012273623,0.00018953861,0.0003616803],"domain_scores_gemma":[0.9984227,0.00012907734,0.00041858348,0.000733579,0.00017175803,0.0001242977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042678468,0.000320683,0.00046153678,0.0008855879,0.0001268606,0.00015212945,0.00076393475,0.0003349844,0.0000011666025],"category_scores_gemma":[0.000082684855,0.00037757025,0.00016034246,0.0014783237,0.00008080778,0.00033867732,0.0013121619,0.00087445206,0.0000012109916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000794681,0.00013418692,0.007122889,0.00021393462,0.000036327954,0.0001614993,0.00093057135,0.97020215,0.0005176722,0.018276,0.0000017399071,0.002395054],"study_design_scores_gemma":[0.00041238512,0.000059017497,0.010403498,0.00031586087,0.000031427622,0.000020922982,0.00014374286,0.9718761,0.0003664751,0.016009798,0.0000011623594,0.0003596363],"about_ca_topic_score_codex":0.0006459101,"about_ca_topic_score_gemma":0.000106680716,"teacher_disagreement_score":0.4426663,"about_ca_system_score_codex":0.00016186995,"about_ca_system_score_gemma":0.00036313204,"threshold_uncertainty_score":0.9998676},"labels":[],"label_agreement":null},{"id":"W4226174339","doi":"10.20944/preprints202112.0472.v2","title":"Post-Quantum Two-party Adaptor Signature Based on Coding Theory","year":2021,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hash function; Cryptography; Digital signature; Schnorr signature; Ring signature; Theoretical computer science; Blind signature; Computer security","score_opus":0.0454784904496383,"score_gpt":0.30051036167140777,"score_spread":0.25503187122176946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226174339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7556569,0.0003227992,0.23067042,0.003101696,0.0045193955,0.0008348114,0.00007155773,0.0013412427,0.0034811788],"genre_scores_gemma":[0.9840837,0.000016210657,0.012517032,0.0022717908,0.0005747488,0.000065402826,0.000076044445,0.00007648437,0.00031855755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99385136,0.0009625312,0.0006857441,0.0026503522,0.0009848322,0.0008651836],"domain_scores_gemma":[0.9940725,0.0007780268,0.0005028576,0.0039000127,0.00039891966,0.00034769415],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019310928,0.0008420814,0.0008126837,0.00035751204,0.00039257668,0.0003391701,0.0035849449,0.0005657394,0.00025631647],"category_scores_gemma":[0.0006294577,0.00078256085,0.0006247424,0.0004435374,0.00012733982,0.00016626224,0.00582282,0.003492912,0.00027848984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035886595,0.0018965888,0.015186347,0.0011350873,0.0007182725,0.0016802228,0.0076525463,0.7745732,0.05160207,0.105139755,0.0003605604,0.039696485],"study_design_scores_gemma":[0.0006738882,0.0000917747,0.017568773,0.0010775015,0.000047120197,0.00003143926,0.000066521294,0.9390057,0.029395102,0.00983394,0.0010022005,0.0012060873],"about_ca_topic_score_codex":0.00005903598,"about_ca_topic_score_gemma":0.0000053736812,"teacher_disagreement_score":0.22842683,"about_ca_system_score_codex":0.00016962973,"about_ca_system_score_gemma":0.0007277624,"threshold_uncertainty_score":0.99946254},"labels":[],"label_agreement":null},{"id":"W4226232310","doi":"10.48550/arxiv.2111.11489","title":"Dimensional Expressivity Analysis, best-approximation errors, and automated design of parametric quantum circuits","year":2021,"lang":"en","type":"preprint","venue":"DESY (CERN, DESY, Fermilab, IHEP, and SLAC)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; Centres de Recerca de Catalunya; Government of Canada; Ministry of Colleges and Universities; Nuclear Physics; Institut Périmètre de physique théorique; Research and Innovation Foundation; Industry Canada; Generalitat de Catalunya; Agència de Gestió d'Ajuts Universitaris i de Recerca; National Science Foundation; Fundación Cellex; U.S. Department of Energy; Office of Science","keywords":"Computer science; Overhead (engineering); Dimension (graph theory); Quantum; Electronic circuit; Quantum circuit; Parametric statistics; Quantum computer; Algorithm; Set (abstract data type); Theoretical computer science; Computer engineering; Quantum error correction; Physics; Mathematics; Quantum mechanics","score_opus":0.028249380218088937,"score_gpt":0.25913842064847614,"score_spread":0.23088904043038722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226232310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6402127,0.0040607518,0.35432988,0.00012143252,0.00039483784,0.00041679983,0.00004447682,0.00039119387,0.000027919948],"genre_scores_gemma":[0.9586234,0.00048376032,0.04043265,0.00009391069,0.00008998815,0.000021432295,0.00016707316,0.00005018559,0.000037609327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949218,0.0007603925,0.0009775911,0.0017829625,0.0008989814,0.0006582712],"domain_scores_gemma":[0.99646497,0.000599725,0.0008249502,0.0013421121,0.00040912928,0.00035912544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010319551,0.0007555124,0.0014261771,0.001103142,0.00045651826,0.00072534516,0.0010279143,0.00059575075,0.000017342387],"category_scores_gemma":[0.00025814358,0.00071085035,0.00035149595,0.001937614,0.00027980786,0.0002969956,0.0021417437,0.0008884431,0.0000037177779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013999172,0.0024320027,0.017060405,0.002954805,0.005841899,0.0008634636,0.008899484,0.7480454,0.008159855,0.005068086,0.0011586538,0.19937596],"study_design_scores_gemma":[0.0005084076,0.00015040424,0.028022334,0.00035022103,0.00050246133,0.00012516293,0.000038688406,0.96558034,0.0009718073,0.0029694529,0.00003778395,0.0007429349],"about_ca_topic_score_codex":0.00035586845,"about_ca_topic_score_gemma":0.000015982172,"teacher_disagreement_score":0.3184107,"about_ca_system_score_codex":0.00007841365,"about_ca_system_score_gemma":0.00028980657,"threshold_uncertainty_score":0.99953425},"labels":[],"label_agreement":null},{"id":"W4226307947","doi":"10.1063/5.0084854","title":"Classical and quantum walks on paths associated with exceptional Krawtchouk polynomials","year":2022,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum walk; Kravchuk polynomials; Mathematics; Quantum; Orthogonal polynomials; Discrete orthogonal polynomials; Classical orthogonal polynomials; Wilson polynomials; Pure mathematics; Quantum algorithm; Physics; Quantum mechanics","score_opus":0.014715934505124503,"score_gpt":0.23333607593650282,"score_spread":0.2186201414313783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226307947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66658366,0.000034707125,0.3295879,0.003050323,0.00022653933,0.000095167794,0.000007996915,0.000044191067,0.00036952697],"genre_scores_gemma":[0.98672736,0.0000015138467,0.012554063,0.00037913336,0.00027033276,0.000002725263,8.056054e-7,0.000014093588,0.00004998393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826586,0.00017308035,0.00036010685,0.0001753776,0.0008078069,0.0002177738],"domain_scores_gemma":[0.9985306,0.000693652,0.00037215668,0.00018584833,0.00008154596,0.00013615891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006342253,0.00014588262,0.00034051045,0.000059634014,0.00024172598,0.00009747477,0.0004444025,0.000030867894,0.000021751097],"category_scores_gemma":[0.000106922584,0.000100109704,0.0001115824,0.00022584571,0.00007618516,0.000122054094,0.00023149441,0.000634436,0.0000046178598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017527466,0.0034914059,0.00014694431,0.00006736076,0.00035148748,0.00041661054,0.0036359911,0.024161702,0.0014651187,0.87334603,0.005812924,0.08692914],"study_design_scores_gemma":[0.0011178008,0.0021022714,0.0017441191,0.00015543205,0.000032290234,0.0004556532,0.000066526234,0.5213318,0.00011598269,0.47213477,0.00047651635,0.0002668551],"about_ca_topic_score_codex":2.5895835e-7,"about_ca_topic_score_gemma":5.4968105e-8,"teacher_disagreement_score":0.4971701,"about_ca_system_score_codex":0.00006600678,"about_ca_system_score_gemma":0.00009952859,"threshold_uncertainty_score":0.40823552},"labels":[],"label_agreement":null},{"id":"W4226332502","doi":"10.1103/physreva.105.042403","title":"Learning quantum dynamics with latent neural ordinary differential equations ","year":2022,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Vector Institute; University of Toronto","funders":"University of Toronto; Canada Foundation for Innovation; Government of Ontario","keywords":"Master equation; Curse of dimensionality; Ordinary differential equation; Ode; Physical law; Statistical physics; Von Neumann architecture; Quantum dynamics; Uncertainty principle; Quantum; Computer science; Open quantum system; Physics; Classical mechanics; Differential equation; Applied mathematics; Mathematics; Artificial intelligence; Quantum mechanics","score_opus":0.012612912500749661,"score_gpt":0.3024851060060439,"score_spread":0.28987219350529425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226332502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47218204,0.044811632,0.4672099,0.011468421,0.0006298719,0.0024025636,0.000042714964,0.0008875732,0.00036528206],"genre_scores_gemma":[0.99131614,0.0051364293,0.00080744736,0.0017992113,0.0003900918,0.00032912497,0.000084734726,0.000056564262,0.00008028045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955449,0.0009003252,0.0005541083,0.0010272181,0.0012350943,0.0007383586],"domain_scores_gemma":[0.9975378,0.0006020073,0.0004257956,0.0009914589,0.00013388097,0.0003090484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003735567,0.00054153,0.0012494655,0.00007128944,0.0007746435,0.000114408846,0.0015621299,0.000019234123,0.000034889763],"category_scores_gemma":[0.00024120322,0.00039639787,0.00068777986,0.0015274758,0.00011588523,0.0002556106,0.0014495214,0.0015259262,0.00008780424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050276896,0.0045521865,0.00041666563,0.00834689,0.00036900426,0.0002855545,0.00077705865,0.028849583,0.0023108309,0.36298513,0.0029682417,0.5880886],"study_design_scores_gemma":[0.0002499836,0.0010760659,0.00037769967,0.0020197167,0.00021402257,0.00004986728,0.0000050007507,0.98278576,0.000027588832,0.007617322,0.0050138356,0.00056316],"about_ca_topic_score_codex":0.000022479504,"about_ca_topic_score_gemma":0.0000016382348,"teacher_disagreement_score":0.95393616,"about_ca_system_score_codex":0.00013310125,"about_ca_system_score_gemma":0.00011824149,"threshold_uncertainty_score":0.9998488},"labels":[],"label_agreement":null},{"id":"W4226420754","doi":"10.1109/access.2022.3169137","title":"The “Cyber Security via Determinism” Paradigm for a Quantum Safe Zero Trust Deterministic Internet of Things (IoT)","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Internet of Things; Computer science; Computer security; Determinism; The Internet; Zero (linguistics); Internet privacy; World Wide Web; Physics; Quantum mechanics","score_opus":0.016821997888890182,"score_gpt":0.2760908644355752,"score_spread":0.259268866546685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226420754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34889388,0.0001373624,0.64703566,0.0008050137,0.0023845152,0.00046107726,0.000018298744,0.0001226897,0.00014151589],"genre_scores_gemma":[0.99563134,0.0000038224593,0.0032863843,0.00070375885,0.000116414696,0.00012196236,0.0000027359797,0.00002402643,0.00010957313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781954,0.00018043452,0.00051238283,0.0005456474,0.00044039942,0.0005016044],"domain_scores_gemma":[0.9977466,0.0008911889,0.00038011445,0.00082045485,0.00006107498,0.00010059709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007438834,0.00024083485,0.00031840036,0.00010405643,0.00070998404,0.00038080732,0.0038833218,0.000051642986,0.0000110506],"category_scores_gemma":[0.00006372276,0.00018364782,0.00020690677,0.00036446357,0.00013711183,0.0002496075,0.0011418188,0.0003837493,0.0000034332722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005339468,0.00096343964,0.0016034151,0.0005019266,0.0003910249,0.00030693627,0.035097033,0.014983881,0.0012772806,0.09444349,0.018165125,0.8317325],"study_design_scores_gemma":[0.0003913414,0.00032278392,0.00029305692,0.000020397449,0.00001501744,0.00010436797,0.000016807862,0.89338017,0.0013497658,0.09292409,0.010938158,0.00024404847],"about_ca_topic_score_codex":0.00012432039,"about_ca_topic_score_gemma":0.000008603011,"teacher_disagreement_score":0.8783963,"about_ca_system_score_codex":0.000048197893,"about_ca_system_score_gemma":0.00011197443,"threshold_uncertainty_score":0.7488941},"labels":[],"label_agreement":null},{"id":"W4226505890","doi":"10.3204/pubdb-2022-00999","title":"Investigating the variance increase of readout error mitigation through classical bit-flip correction on IBM and Rigetti quantum computers","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nuclear Physics; European Regional Development Fund; Office of Science; Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Research and Innovation Foundation; Industry Canada; National Science Foundation; Government of Canada; U.S. Department of Energy","keywords":"Pauli exclusion principle; Variance (accounting); IBM; Observable; Computer science; Quantum; Algorithm; Scale (ratio); Computer engineering; Electronic engineering; Physics; Quantum mechanics; Engineering; Optics","score_opus":0.04355604364850985,"score_gpt":0.2030388933958876,"score_spread":0.15948284974737775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226505890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60506517,0.00004531119,0.3925987,0.0006326443,0.0011916341,0.00017980713,0.0000059166255,0.00011816431,0.00016266313],"genre_scores_gemma":[0.9876613,0.00003625126,0.011618795,0.000394237,0.00016169323,9.772307e-7,0.00002006174,0.000017964721,0.00008872653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997487,0.0005419928,0.00032271363,0.0011400855,0.00019330514,0.00031489835],"domain_scores_gemma":[0.99747413,0.00066493027,0.00052380277,0.0010146636,0.0001800914,0.00014240654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039773423,0.00035795438,0.00041702518,0.00013581128,0.00037670392,0.0002144443,0.0010413595,0.00025214,0.0000023897471],"category_scores_gemma":[0.00016304373,0.00032130565,0.00017621563,0.0007007439,0.00038956298,0.0002587523,0.0014688626,0.0010621906,0.0000035800047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002674707,0.00016538711,0.0019034062,0.00015179906,0.00013436051,0.0001479169,0.003010121,0.88186383,0.00021084187,0.10620979,0.0005625616,0.0056132455],"study_design_scores_gemma":[0.0003239554,0.000114108036,0.008212709,0.0006611535,0.000045832057,0.000021103839,0.00015740738,0.9729072,0.0002699166,0.016858634,0.00009896461,0.00032905766],"about_ca_topic_score_codex":0.00056377077,"about_ca_topic_score_gemma":0.000033426437,"teacher_disagreement_score":0.3825961,"about_ca_system_score_codex":0.00009988311,"about_ca_system_score_gemma":0.00025252238,"threshold_uncertainty_score":0.9999239},"labels":[],"label_agreement":null},{"id":"W4229448848","doi":"10.18280/ts.390212","title":"A New Framework Containing Convolution and Pooling Circuits for Image Processing and Deep Learning Applications with Quantum Computing Implementation","year":2022,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Computer science; Quantum computer; Qubit; Computational science; Convolution (computer science); Quantum algorithm; Pooling; Electronic circuit; Quantum; Multiplication (music); Algorithm; Theoretical computer science; Computer engineering; Artificial intelligence; Mathematics; Artificial neural network; Physics; Quantum mechanics","score_opus":0.010592369895770313,"score_gpt":0.2623119484595231,"score_spread":0.25171957856375277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229448848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1170987,0.00039684752,0.88142043,0.00035273042,0.000030459823,0.000546079,0.000002379943,0.00014324037,0.000009130217],"genre_scores_gemma":[0.8096702,0.0000026917173,0.18995377,0.0001427968,0.00012549695,0.00007332482,0.000015345793,0.00001392326,0.0000024521041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864244,0.00007746584,0.00025741887,0.00045098856,0.00025181996,0.00031988107],"domain_scores_gemma":[0.9993402,0.0002142086,0.00020722809,0.00008903463,0.00004954256,0.0000997882],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005013714,0.00015766143,0.00016243233,0.000108700886,0.0014662105,0.00031281242,0.00019345852,0.000022988645,0.00000898211],"category_scores_gemma":[0.000007863608,0.00015775104,0.000026102076,0.0002700506,0.000034279336,0.00020699401,0.00018279356,0.0002708952,2.2779864e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020431731,0.000026371752,0.0016091319,0.00006466579,0.00002827912,0.0000039196075,0.00837709,0.016298834,0.0010851197,0.015475892,0.00000845924,0.9570018],"study_design_scores_gemma":[0.0010150291,0.00057253795,0.002447718,0.000050883897,0.000023648397,0.000077039775,0.0019614117,0.9892641,0.000071948365,0.0033895585,0.00089742756,0.00022875027],"about_ca_topic_score_codex":0.000029079709,"about_ca_topic_score_gemma":0.0000032472058,"teacher_disagreement_score":0.97296524,"about_ca_system_score_codex":0.000049734626,"about_ca_system_score_gemma":0.00008667068,"threshold_uncertainty_score":0.99983376},"labels":[],"label_agreement":null},{"id":"W4229857913","doi":"10.1007/978-3-030-69318-3_11","title":"Deutsch Algorithm","year":2021,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quantum computer; Computer science; Algorithm; Quantum; Mathematical physics; Physics; Quantum mechanics","score_opus":0.03675382813945829,"score_gpt":0.29674415103303486,"score_spread":0.2599903228935766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229857913","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004489585,0.044654332,0.37373924,0.08350797,0.035128392,0.011523092,0.003191015,0.0075029205,0.43626347],"genre_scores_gemma":[0.0009542779,0.0036723008,0.118098676,0.0009924024,0.004685375,0.00011934705,0.00020802584,0.00025018054,0.8710194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99466467,0.00042644228,0.0006229445,0.0012015424,0.0019144153,0.0011700023],"domain_scores_gemma":[0.99612504,0.0005418294,0.00022899892,0.0020631053,0.00081471173,0.0002263067],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003074591,0.0006134256,0.0007669716,0.00010481248,0.0016017754,0.0022223622,0.0032485535,0.0005870547,0.00043637984],"category_scores_gemma":[0.000037512928,0.00044347878,0.0005207223,0.00028004008,0.0009630727,0.00031835353,0.0038704402,0.001582626,0.00029048836],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003370563,0.00011319086,6.389201e-7,0.0007241135,0.0011774187,0.0006188099,0.008804488,0.00011620755,0.013768976,0.50784695,0.16931395,0.29748154],"study_design_scores_gemma":[0.00024554157,0.00023374768,0.000009771959,0.00037886325,0.000020051024,0.00025187113,0.00017739608,0.0058790813,0.005255941,0.070562825,0.9161822,0.00080270186],"about_ca_topic_score_codex":0.000071227914,"about_ca_topic_score_gemma":0.000019907411,"teacher_disagreement_score":0.74686825,"about_ca_system_score_codex":0.00014423236,"about_ca_system_score_gemma":0.00073649903,"threshold_uncertainty_score":0.9998017},"labels":[],"label_agreement":null},{"id":"W4230618229","doi":"10.26434/chemrxiv.9991976.v1","title":"On the Design of Molecular Excitonic Circuits for Quantum Computing: The Universal Quantum Gates","year":2019,"lang":"en","type":"preprint","venue":"ChemRxiv","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Chemistry; Natural Sciences and Engineering Research Council of Canada; Research Corporation for Scientific Advancement; National Science Foundation","keywords":"Electronic circuit; Unitary state; Quantum gate; Quantum computer; Computer science; Logic gate; Unitary transformation; Quantum; Encoding (memory); Transformation (genetics); Quantum network; Topology (electrical circuits); Physics; Quantum mechanics; Mathematics; Algorithm; Chemistry","score_opus":0.026872947571372346,"score_gpt":0.24298023474111038,"score_spread":0.21610728716973804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230618229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16942881,0.00047288483,0.82388544,0.0033458327,0.0013788582,0.0012216553,0.0000046224923,0.0001515504,0.00011032631],"genre_scores_gemma":[0.9942798,0.000021642585,0.0049534095,0.00045586,0.00016717869,0.000024013218,0.000007626652,0.000048941336,0.000041541483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971696,0.0003415406,0.00046661135,0.0009426747,0.0005000761,0.00057949766],"domain_scores_gemma":[0.99408054,0.0028847856,0.00058935623,0.0021419348,0.00022376716,0.00007962362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012877194,0.0005033654,0.00055767887,0.00012816886,0.00030166082,0.00023380452,0.0042447643,0.00026414188,0.0000047764256],"category_scores_gemma":[0.00023516695,0.00030224884,0.0004482797,0.00034271978,0.00023342056,0.00004145677,0.0015608424,0.0009995458,0.000017596647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002019987,0.00013366816,0.000011650166,0.00027534054,0.00023826677,0.000014564698,0.001806173,0.5846334,0.0047109146,0.40130788,0.0024005189,0.004447411],"study_design_scores_gemma":[0.0002771934,0.00018653947,0.00007836576,0.00033655838,0.0000324449,0.000008522042,0.000046756508,0.90383464,0.012120595,0.082424596,0.00029849407,0.0003553082],"about_ca_topic_score_codex":0.000019672038,"about_ca_topic_score_gemma":1.9609396e-7,"teacher_disagreement_score":0.824851,"about_ca_system_score_codex":0.000062318955,"about_ca_system_score_gemma":0.00040944814,"threshold_uncertainty_score":0.99994296},"labels":[],"label_agreement":null},{"id":"W4231383310","doi":"10.1109/focs.2007.4389507","title":"Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer","year":2007,"lang":"en","type":"article","venue":"Annual Symposium on Foundations of Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Latvijas Universitate; University of Waterloo; Mitacs; California Institute of Technology; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Quantum; Quantum computer; Computer science; Physics; Quantum mechanics","score_opus":0.012901820470101246,"score_gpt":0.2818570957638533,"score_spread":0.26895527529375207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231383310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7399383,0.0000073931114,0.25622037,0.00267218,0.0005045748,0.0003445715,0.000021225134,0.00009289802,0.00019846116],"genre_scores_gemma":[0.9177463,0.0000045497873,0.08126766,0.0008238076,0.00009285679,0.0000034383638,0.0000035733865,0.000011596662,0.000046205896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666184,0.00010234681,0.0007092345,0.0008042592,0.001113722,0.0006086213],"domain_scores_gemma":[0.99718714,0.0010243426,0.00030834507,0.0008314095,0.00043442022,0.0002143345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022782227,0.00027836507,0.00040817112,0.0007752622,0.00028411145,0.00019380994,0.0019499746,0.00007894332,0.000006891946],"category_scores_gemma":[0.00008808424,0.00022692334,0.000082269784,0.00223624,0.0005968265,0.00051318645,0.0007586308,0.0002456955,0.000008406351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006572689,0.0043554916,0.003653825,0.00023306992,0.00013686759,0.00016271725,0.03153083,0.23804596,0.029806456,0.21410096,0.0017047244,0.47561184],"study_design_scores_gemma":[0.00085692067,0.0023819965,0.026388591,0.000220273,0.0000059359377,0.00004426032,0.000015382151,0.96309394,0.004808755,0.0013322624,0.000523661,0.00032804802],"about_ca_topic_score_codex":0.000121748235,"about_ca_topic_score_gemma":0.00003212366,"teacher_disagreement_score":0.72504795,"about_ca_system_score_codex":0.00008506522,"about_ca_system_score_gemma":0.000355801,"threshold_uncertainty_score":0.9253665},"labels":[],"label_agreement":null},{"id":"W4232497724","doi":"10.1109/jstqe.2018.2864379","title":"IEEE Journal of Selected Topics in Quantum Electronics","year":2018,"lang":"en","type":"article","venue":"IEEE Journal of Selected Topics in Quantum Electronics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Standards Association","funders":"","keywords":"Computer science; Electronics; Quantum optics; Optoelectronics; Electrical engineering; Physics; Engineering; Quantum mechanics","score_opus":0.010346595388972733,"score_gpt":0.2534234252453558,"score_spread":0.2430768298563831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232497724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9130987,0.0049670073,0.07609372,0.0023337805,0.0031186116,0.00025302378,0.0000023303498,0.00006726789,0.00006554638],"genre_scores_gemma":[0.9777256,0.0023939954,0.015234606,0.00042848673,0.004020853,0.000003414378,0.0000021923538,0.00008173803,0.000109108325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99263614,0.00071069296,0.0027833695,0.0006092349,0.0013525196,0.0019080164],"domain_scores_gemma":[0.99299186,0.00040867226,0.0021213496,0.0007351095,0.0034074234,0.0003355792],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023652052,0.0006540545,0.0013615324,0.0016225503,0.00023728282,0.00028145788,0.0029769966,0.0005124684,0.000013073291],"category_scores_gemma":[0.00084327976,0.00059333676,0.0003426507,0.0049787094,0.0001923212,0.0007431261,0.00013669336,0.00424006,0.000006657303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039086347,0.010081646,0.02523357,0.0009459205,0.003024002,0.0057498533,0.027374158,0.122632354,0.23078193,0.15463491,0.0265439,0.3890891],"study_design_scores_gemma":[0.005591827,0.011545282,0.007019379,0.0007747994,0.000116640374,0.0051685907,0.000081766564,0.83857393,0.0577958,0.04647955,0.0254158,0.0014366101],"about_ca_topic_score_codex":0.000032888533,"about_ca_topic_score_gemma":0.0003991596,"teacher_disagreement_score":0.7159416,"about_ca_system_score_codex":0.0010556851,"about_ca_system_score_gemma":0.004085513,"threshold_uncertainty_score":0.9996518},"labels":[],"label_agreement":null},{"id":"W4232723179","doi":"10.1149/ma2005-02/13/569","title":"Efficient Calculation of Quasi-Bound StateTunneling through Stacked Dielectrics","year":2006,"lang":"en","type":"article","venue":"ECS Meeting Abstracts","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Dielectric; Computer science; Materials science; Engineering physics; Optoelectronics; Engineering","score_opus":0.011682200169395585,"score_gpt":0.24210673413480163,"score_spread":0.23042453396540605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232723179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90850085,0.00023479859,0.08328001,0.00020867056,0.00037642196,0.0001184785,0.0000022498714,0.00019887193,0.007079621],"genre_scores_gemma":[0.9321634,0.000002443404,0.06755998,0.000030849373,0.00016978303,0.0000016469486,0.0000059369595,0.00001511959,0.00005083137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802274,0.000072569565,0.0005773941,0.00040653598,0.0004808243,0.00043992474],"domain_scores_gemma":[0.9986693,0.0003534875,0.0004013155,0.00036866651,0.0001525892,0.00005462679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006768578,0.00018763576,0.00022825124,0.00010764171,0.00023187711,0.00013206189,0.00041579275,0.000076929035,0.0000010073202],"category_scores_gemma":[0.00015800387,0.00017500271,0.00008684702,0.0005339665,0.000045035955,0.000080987724,0.000116703064,0.00023777472,0.000010453002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034985994,0.0001334813,0.00011564214,0.000028628712,0.0000068856975,0.000013834257,0.00078471965,0.98669624,0.00883986,0.00060489203,0.00007853889,0.0026937532],"study_design_scores_gemma":[0.00026193832,0.00008260939,0.0049169427,0.00009882703,0.000006864076,0.000011522335,0.00001891537,0.9508051,0.04001389,0.0030775599,0.00048765662,0.00021812673],"about_ca_topic_score_codex":0.0009949157,"about_ca_topic_score_gemma":0.0000134295005,"teacher_disagreement_score":0.03589112,"about_ca_system_score_codex":0.00004811254,"about_ca_system_score_gemma":0.00008256137,"threshold_uncertainty_score":0.71364033},"labels":[],"label_agreement":null},{"id":"W4233153581","doi":"10.32920/ryerson.14655534.v1","title":"A quantum future: preparing Canada for the potential impacts of quantum computing","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum computer; Qubit; Computer science; Field (mathematics); Workforce; Quantum; Computation; Management science; Political science; Engineering; Mathematics; Physics; Quantum mechanics; Algorithm; Law","score_opus":0.00860865124893279,"score_gpt":0.2359607302834835,"score_spread":0.2273520790345507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233153581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14402981,0.001908085,0.843827,0.0024198466,0.006997235,0.0005966863,0.00002345587,0.00015480474,0.00004308663],"genre_scores_gemma":[0.9497598,0.000046417896,0.048566688,0.0003503354,0.0011950795,0.0000059265562,0.000022230577,0.00003419871,0.00001935394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996591,0.0001589436,0.00078421127,0.0010133253,0.0007219851,0.00073054037],"domain_scores_gemma":[0.99653774,0.0006204705,0.0006457913,0.0016487462,0.00037876228,0.00016848915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082103343,0.0004934949,0.00069804065,0.00009665754,0.00044221498,0.00052441517,0.0027626532,0.0002208187,0.0000048876814],"category_scores_gemma":[0.0001154757,0.0003455786,0.0004471486,0.000331861,0.000063416475,0.00008345892,0.0039845,0.0008779387,2.8555425e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034807486,0.00016417046,0.00010022239,0.001333193,0.0007890419,0.00008193242,0.005084733,0.86210746,0.00048606234,0.032172937,0.009761144,0.08788429],"study_design_scores_gemma":[0.00026427762,0.000053684606,0.0012040957,0.00025929877,0.000046699093,0.0000663245,0.00040628712,0.9943521,0.0005753548,0.0016430535,0.00070825417,0.00042056906],"about_ca_topic_score_codex":0.24681301,"about_ca_topic_score_gemma":0.08287923,"teacher_disagreement_score":0.80573,"about_ca_system_score_codex":0.00012057596,"about_ca_system_score_gemma":0.0028775372,"threshold_uncertainty_score":0.9998996},"labels":[],"label_agreement":null},{"id":"W4233923439","doi":"10.1038/nphoton.2013.28","title":"Erratum: Limits on classical communication from quantum entropy power inequalities","year":2013,"lang":"en","type":"erratum","venue":"Nature Photonics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Watson; Quantum; Computer science; Photon; Physics; Theoretical physics; Statistical physics; Quantum mechanics; Artificial intelligence","score_opus":0.012183674162875599,"score_gpt":0.25381569427329786,"score_spread":0.24163202011042226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233923439","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033196826,0.1575961,0.0335091,0.0834353,0.4547275,0.006226081,0.002156567,0.008318009,0.22083452],"genre_scores_gemma":[0.2868771,0.013863793,0.28724608,0.062333245,0.013959377,0.0006945792,0.01216954,0.0015523117,0.32130396],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99497426,0.0005514879,0.0007555606,0.0014330613,0.0013925385,0.00089310657],"domain_scores_gemma":[0.9940781,0.0008407254,0.0006840119,0.0037056657,0.00038678647,0.00030470945],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0004098105,0.000954893,0.001001169,0.000344603,0.0004664793,0.00093821605,0.0048307865,0.003089584,0.0000764468],"category_scores_gemma":[0.00032150344,0.0007978141,0.00043825814,0.0005737347,0.00017818563,0.00028433575,0.0010542368,0.01168199,0.0002986677],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015949166,0.00017014796,0.0000017368752,0.00003246765,0.00010506404,0.000026984171,0.00088629994,0.00010004796,0.000051546715,0.08645059,0.90989345,0.002265702],"study_design_scores_gemma":[0.0003461643,0.00025395543,0.00015246085,0.0005604151,0.000027880953,0.000012729833,0.00002997108,0.2845575,0.00013795472,0.034528654,0.67858016,0.0008121371],"about_ca_topic_score_codex":0.00014499135,"about_ca_topic_score_gemma":0.0000376874,"teacher_disagreement_score":0.44076812,"about_ca_system_score_codex":0.00024152802,"about_ca_system_score_gemma":0.00058143825,"threshold_uncertainty_score":0.9994473},"labels":[],"label_agreement":null},{"id":"W4234951113","doi":"10.32920/ryerson.14653518","title":"Learning programs for the quantum computer","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"GRASP; Genetic programming; Computer science; Quantum computer; Quantum; Evolutionary programming; Task (project management); Theoretical computer science; Quantum algorithm; Genetic algorithm; Mathematical optimization; Evolutionary algorithm; Artificial intelligence; Mathematics; Programming language; Machine learning; Quantum mechanics; Physics; Engineering","score_opus":0.02155592161544562,"score_gpt":0.2562856092082152,"score_spread":0.23472968759276958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234951113","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063313777,0.00053075707,0.983886,0.0047046402,0.003088704,0.0006765543,9.232124e-7,0.00066441763,0.00011662214],"genre_scores_gemma":[0.21553218,0.00004283435,0.7810883,0.0007661854,0.001551761,0.00019223003,0.000046840054,0.00004447964,0.00073517347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785745,0.00012706057,0.00031443586,0.0009038655,0.00032089718,0.00047630808],"domain_scores_gemma":[0.9979455,0.0005282723,0.00018357046,0.0010562452,0.00020281595,0.000083601684],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005609411,0.00033094318,0.0003429914,0.000059089372,0.000435519,0.0016900641,0.0021726221,0.0001884971,0.0000061156584],"category_scores_gemma":[0.00003464912,0.00020704142,0.00039816927,0.00020835098,0.000058989815,0.00006410694,0.0038722958,0.0011445661,0.0000064701903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016274365,0.000053244024,0.000037496706,0.000091967275,0.00009193774,0.000011067598,0.0011805113,0.1548177,0.000004499326,0.00765947,0.0011392182,0.8349113],"study_design_scores_gemma":[0.0001376391,0.0001200124,0.00022148836,0.00012445883,0.000014738587,0.000025471487,0.000048561706,0.97482884,0.000027702215,0.0029377034,0.021206496,0.00030686424],"about_ca_topic_score_codex":0.00006127112,"about_ca_topic_score_gemma":0.000008731919,"teacher_disagreement_score":0.8346044,"about_ca_system_score_codex":0.000023436329,"about_ca_system_score_gemma":0.00018941147,"threshold_uncertainty_score":0.99934626},"labels":[],"label_agreement":null},{"id":"W4235093468","doi":"10.1007/978-0-387-30440-3_423","title":"Quantum Algorithms","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Complexity and Systems Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute; St. Jerome's University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.0292652979509443,"score_gpt":0.25108278905182363,"score_spread":0.22181749110087934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235093468","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010271686,0.0050170883,0.06858965,0.00055692374,0.003208311,0.0006951724,0.000047971287,0.00035682364,0.9205009],"genre_scores_gemma":[0.1288758,0.00656901,0.24466047,0.0008658803,0.0045276177,0.000036968395,0.00004594121,0.00024122914,0.6141771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961061,0.000049942384,0.00079698674,0.0011391087,0.0013217034,0.00058618974],"domain_scores_gemma":[0.9973643,0.00017958943,0.0006269726,0.001156261,0.00033235797,0.0003405597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013188691,0.0004977628,0.00085511815,0.00051046076,0.00051456905,0.00033175477,0.002472955,0.0002144992,0.0000095678215],"category_scores_gemma":[0.000060260147,0.00043390554,0.00014899559,0.00030807118,0.0015969427,0.0004168719,0.0007686515,0.00054590445,0.000024424893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018866676,0.000018389555,0.000003949737,0.000079492085,0.000010502917,0.000022976164,0.00039371234,0.00011494909,0.000018399753,0.93335456,0.00031425356,0.065666944],"study_design_scores_gemma":[0.00028050374,0.0004608194,0.0006479301,0.00071488676,0.000017370689,0.0002988937,0.00001937313,0.45412007,0.000014892297,0.29637074,0.2460998,0.00095471286],"about_ca_topic_score_codex":0.00008342873,"about_ca_topic_score_gemma":0.0000043409245,"teacher_disagreement_score":0.6369838,"about_ca_system_score_codex":0.00005621434,"about_ca_system_score_gemma":0.00047066415,"threshold_uncertainty_score":0.9998113},"labels":[],"label_agreement":null},{"id":"W4235140742","doi":"10.26421/qic14.5-6-8","title":"Hardness of approximation for quantum problems","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Wolfson Family Charitable Trust; University of Waterloo; Agence Nationale de la Recherche","keywords":"Hierarchy; Mathematics; Hardness of approximation; Polynomial hierarchy; Quantum; Hamiltonian (control theory); Generalization; Quantum complexity theory; Set cover problem; Quantum algorithm; Polynomial; Discrete mathematics; Approximation algorithm; Combinatorics; Time complexity; Set (abstract data type); Quantum mechanics; Computer science; Mathematical optimization; Physics; Mathematical analysis","score_opus":0.011720818417310859,"score_gpt":0.23610893182818946,"score_spread":0.2243881134108786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235140742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05754204,0.000019147414,0.9409035,0.0004085313,0.00035082558,0.00034219486,0.0000042338916,0.00014410283,0.0002854515],"genre_scores_gemma":[0.93605655,0.000004526088,0.06365862,0.00015362796,0.000037964208,0.000025597985,0.000053574102,0.0000050806957,0.00000443444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989279,0.000052412473,0.0004847162,0.00015304594,0.00021655892,0.00016537645],"domain_scores_gemma":[0.9990364,0.00013443644,0.00036537362,0.0001595928,0.00024792965,0.000056324887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055218115,0.00012613421,0.00018511519,0.00019743817,0.00016360344,0.00016689372,0.00021210476,0.000058965816,5.8552513e-7],"category_scores_gemma":[0.000077242985,0.0001135923,0.000051961593,0.00025005112,0.00003658257,0.0010063101,0.00006392682,0.00006983817,0.0000059870204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011177952,0.000032472115,0.000048979484,0.00035313165,0.0000105377685,1.7104309e-8,0.0026901604,0.051799282,0.00011882908,0.55900496,0.00026728198,0.38566318],"study_design_scores_gemma":[0.0005592615,0.00021269632,0.0011970429,0.00004351869,0.0000044300846,0.0000071795653,0.00005338909,0.9361616,0.00021414003,0.05844665,0.002965046,0.00013507003],"about_ca_topic_score_codex":0.000012274304,"about_ca_topic_score_gemma":7.386576e-7,"teacher_disagreement_score":0.8843623,"about_ca_system_score_codex":0.000011322981,"about_ca_system_score_gemma":0.000031521624,"threshold_uncertainty_score":0.46321595},"labels":[],"label_agreement":null},{"id":"W4235225006","doi":"10.1145/780551.780552","title":"Exponential algorithmic speedup by a quantum walk","year":2003,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Speedup; Quantum walk; Computer science; Exponential function; Quantum; Quantum computer; Theoretical computer science; Parallel computing; Algorithm; Mathematics; Physics; Quantum mechanics","score_opus":0.0065032713123136,"score_gpt":0.2122744999559362,"score_spread":0.2057712286436226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235225006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050222065,0.00026121686,0.94179386,0.0007431501,0.001026274,0.00012661477,0.0000027671256,0.00041515348,0.0054089064],"genre_scores_gemma":[0.76489663,0.000012123315,0.2327741,0.00071216555,0.00015933563,0.0000044693406,0.000004352853,0.000018312208,0.0014185335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831223,0.000107980464,0.00023841368,0.00052438694,0.00032711076,0.0004898593],"domain_scores_gemma":[0.999104,0.00006698169,0.00006317073,0.0005564705,0.000040741397,0.00016862129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026770917,0.00020942312,0.00018485513,0.00008962156,0.00018462277,0.00021784249,0.00075481687,0.00006872165,0.00014813567],"category_scores_gemma":[0.00003091351,0.00017373728,0.00010533764,0.00037295453,0.00004228508,0.00018646334,0.00010858048,0.00021362895,0.00019449404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007310562,0.000469035,0.000310098,0.000029696599,0.00009572982,0.0001581163,0.0011156956,0.0017167978,0.007537262,0.3867102,0.059253037,0.54259706],"study_design_scores_gemma":[0.0005622542,0.0001379705,0.00026879171,0.000013005222,0.000004599772,0.00017566195,0.000025266078,0.9212966,0.00867913,0.0155863,0.052784204,0.00046622613],"about_ca_topic_score_codex":0.00006863355,"about_ca_topic_score_gemma":0.0000022928177,"teacher_disagreement_score":0.9195798,"about_ca_system_score_codex":0.000015578365,"about_ca_system_score_gemma":0.000059513073,"threshold_uncertainty_score":0.70848006},"labels":[],"label_agreement":null},{"id":"W4235510796","doi":"10.1080/09500340410001669390","title":"Propagating quantum walks: the origin of interference structures","year":2004,"lang":"en","type":"article","venue":"Journal of Modern Optics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum walk; Unitary state; Quantum interference; Interference (communication); Quantum; Statistical physics; Physics; Wavelength; Quantum mechanics; Computer science; Quantum computer; Telecommunications","score_opus":0.020353857688995287,"score_gpt":0.25955431617235086,"score_spread":0.23920045848335558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235510796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4386853,0.00019738264,0.559882,0.0008406525,0.00031548992,0.000034595363,5.6058843e-7,0.000010495894,0.000033544413],"genre_scores_gemma":[0.8537392,0.000018207333,0.14600055,0.00007191996,0.00015855418,2.156138e-7,6.586859e-8,0.0000065178065,0.0000047444214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987579,0.000051234925,0.00048496784,0.00012090443,0.00039437448,0.00019062699],"domain_scores_gemma":[0.99870205,0.000115621726,0.0005686267,0.0003046499,0.00024644594,0.000062586536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043059493,0.00012265246,0.00021946606,0.00008343921,0.000100180085,0.0001035256,0.0012140498,0.000041521293,9.979751e-7],"category_scores_gemma":[0.00010600143,0.00006889449,0.000111135036,0.0001827044,0.00007614155,0.00016317762,0.00019595123,0.00045203403,7.044616e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002330865,0.0001108436,0.0001546506,0.000057784222,0.00008806273,0.000072112605,0.0077400277,0.72883576,0.008301839,0.115744814,0.0000410906,0.1388297],"study_design_scores_gemma":[0.00035726346,0.0003702731,0.0005373907,0.00018674108,0.000012478608,0.0004477795,0.00006291311,0.7449299,0.0051843175,0.24776393,0.00003958851,0.00010743586],"about_ca_topic_score_codex":0.000007806218,"about_ca_topic_score_gemma":0.0000019727595,"teacher_disagreement_score":0.41505393,"about_ca_system_score_codex":0.000036735823,"about_ca_system_score_gemma":0.00021133077,"threshold_uncertainty_score":0.2809436},"labels":[],"label_agreement":null},{"id":"W4235737850","doi":"10.1080/0950034021000011428","title":"Combined error correction techniques for quantum computing architectures","year":2003,"lang":"en","type":"article","venue":"Journal of Modern Optics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoherence-free subspaces; Computer science; Dynamical decoupling; Quantum error correction; Quantum decoherence; Controllability; Quantum computer; Error detection and correction; Linear subspace; Quantum; Coherence (philosophical gambling strategy); Theoretical computer science; Algorithm; Mathematics; Quantum mechanics; Physics; Applied mathematics","score_opus":0.016628771145791692,"score_gpt":0.267445943721538,"score_spread":0.2508171725757463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235737850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11447703,0.00015273785,0.8828887,0.00043596592,0.0016518696,0.00015003646,9.831328e-7,0.00009492877,0.00014775744],"genre_scores_gemma":[0.60676914,0.0000048849597,0.39285463,0.00013990457,0.0001846424,9.1390046e-7,3.0252798e-7,0.000014443488,0.000031130083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848133,0.00011001286,0.00054606784,0.00020830175,0.00033393604,0.0003203508],"domain_scores_gemma":[0.9983533,0.00037846828,0.00053793396,0.0002728208,0.00033759023,0.000119885706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008620135,0.00018951032,0.0003295751,0.00022848508,0.00021943088,0.00015533823,0.00061190303,0.00008793448,8.2369223e-7],"category_scores_gemma":[0.0002929815,0.00015382201,0.000217569,0.00020480748,0.00004047876,0.00009719024,0.00007661993,0.00043178076,6.32426e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012673269,0.0005236507,0.0003602078,0.00010400246,0.00018038103,0.00006791545,0.0041064853,0.39335433,0.0044707255,0.040123604,0.0024846552,0.5540973],"study_design_scores_gemma":[0.00045421135,0.00078650704,0.00013944335,0.00009746019,0.000015830617,0.00044463677,0.000020250145,0.9387711,0.005684864,0.052462496,0.00094202836,0.0001811716],"about_ca_topic_score_codex":0.0000015697193,"about_ca_topic_score_gemma":8.399846e-7,"teacher_disagreement_score":0.55391616,"about_ca_system_score_codex":0.00005148846,"about_ca_system_score_gemma":0.00013704572,"threshold_uncertainty_score":0.62726796},"labels":[],"label_agreement":null},{"id":"W4236231899","doi":"10.1109/jstqe.2017.2772979","title":"IEEE Journal of Selected Topics in Quantum Electronics","year":2017,"lang":"en","type":"article","venue":"IEEE Journal of Selected Topics in Quantum Electronics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Standards Association","funders":"","keywords":"Quantum optics; Electronics; Computer science; Physics; Electrical engineering; Quantum mechanics; Engineering","score_opus":0.012862756768291267,"score_gpt":0.26430213890728826,"score_spread":0.25143938213899697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236231899","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9433823,0.005395656,0.043828312,0.0037838274,0.0032112263,0.00026568558,0.0000028054278,0.000053362866,0.000076771306],"genre_scores_gemma":[0.98319364,0.0035902145,0.0104044555,0.00023972394,0.0023679156,0.0000035695589,0.0000018230905,0.000074035735,0.00012461435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930463,0.0005671674,0.0026179412,0.000600638,0.0013389704,0.0018289884],"domain_scores_gemma":[0.99230695,0.00036264464,0.0033568046,0.0011848144,0.002451006,0.00033781023],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024641398,0.00065664074,0.001457937,0.0012654425,0.0004602727,0.00061941793,0.0047064107,0.00051759,0.0000073380174],"category_scores_gemma":[0.0013736372,0.0005979295,0.00038907572,0.0019210993,0.00017091805,0.0010886912,0.00019915157,0.004805691,0.000003764004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027859192,0.008298777,0.04883463,0.0010095378,0.0027447557,0.008895997,0.014788647,0.19746499,0.13422729,0.1470666,0.013984935,0.41989794],"study_design_scores_gemma":[0.00710834,0.00669574,0.024872512,0.0009964464,0.00013677482,0.0049521714,0.00006526985,0.8438366,0.035505954,0.05605016,0.018174946,0.0016050658],"about_ca_topic_score_codex":0.000053857693,"about_ca_topic_score_gemma":0.00043822083,"teacher_disagreement_score":0.64637166,"about_ca_system_score_codex":0.0009641954,"about_ca_system_score_gemma":0.0038992143,"threshold_uncertainty_score":0.9996472},"labels":[],"label_agreement":null},{"id":"W4236541507","doi":"10.26421/qic14.5-6-2","title":"Two-message quantum interactive proofs and the quantum separability problem","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dello Sviluppo Economico; Fonds Québécois de la Recherche sur la Nature et les Technologies; Office of Naval Research; Industry Canada; Canada Research Chairs; Institut Périmètre de physique théorique; Canadian Institute for Advanced Research","keywords":"Quantum computer; Quantum algorithm; Quantum complexity theory; Quantum information; Quantum circuit; Computer science; Quantum state; Discrete mathematics; Mathematics; Quantum network; Quantum; Quantum mechanics; Physics","score_opus":0.006194614309295666,"score_gpt":0.24351159771244923,"score_spread":0.23731698340315358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236541507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20115261,0.000080200036,0.7933575,0.0031483693,0.00032470239,0.0005618407,0.000003228849,0.00026431642,0.0011072685],"genre_scores_gemma":[0.9888385,0.0000151278045,0.010094871,0.00091006263,0.00006705224,0.00003763616,0.000020883923,0.00000829641,0.0000075551843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793965,0.00040514185,0.0006377674,0.0003389129,0.00036792934,0.00031062792],"domain_scores_gemma":[0.99828386,0.00063161657,0.0004272909,0.00032410398,0.0002124975,0.0001206409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015322273,0.00026590648,0.00031022675,0.00017053731,0.00055327144,0.0007849419,0.00037171523,0.00007168389,0.0000023389719],"category_scores_gemma":[0.0001433258,0.00018219589,0.000072342795,0.00036202167,0.00024588982,0.0017245985,0.00030552215,0.00034669403,0.000025908195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007837852,0.000036195943,0.00010791606,0.000094388044,0.00002300513,5.2853954e-7,0.008272541,0.0102038635,0.000010428079,0.7377074,0.00016487764,0.24330051],"study_design_scores_gemma":[0.0016535498,0.00015208068,0.002594048,0.00004603252,0.0000093225735,0.000053172633,0.00024372106,0.8337543,0.000020702078,0.15974969,0.0015123975,0.00021099606],"about_ca_topic_score_codex":0.000103869526,"about_ca_topic_score_gemma":0.000005610537,"teacher_disagreement_score":0.8235504,"about_ca_system_score_codex":0.000030622527,"about_ca_system_score_gemma":0.0000555266,"threshold_uncertainty_score":0.7569213},"labels":[],"label_agreement":null},{"id":"W4237215852","doi":"10.21468/scipost.report.815","title":"Report on 1812.09329v1","year":2019,"lang":"en","type":"peer-review","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique","keywords":"Computer science","score_opus":0.020809182786164247,"score_gpt":0.2898745764961588,"score_spread":0.26906539370999455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237215852","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022798165,0.020491047,0.23019287,0.3276608,0.03767423,0.0014998999,0.000056898196,0.001733982,0.38066748],"genre_scores_gemma":[0.000029120152,0.0007634409,0.035623528,0.02506975,0.001250739,0.000016728518,0.0001866132,0.000049295006,0.93701077],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99661356,0.000090301015,0.0005779022,0.0012842147,0.0009444699,0.00048957247],"domain_scores_gemma":[0.99627274,0.00019970305,0.00040109805,0.0027987086,0.00018527775,0.00014248048],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000720588,0.00048810578,0.00079371285,0.00017793651,0.00010167288,0.00018951375,0.0022612154,0.0002458788,0.00020844628],"category_scores_gemma":[0.00015074194,0.0003540431,0.00037090096,0.00040150367,0.000028083095,0.00006621892,0.0008082726,0.00095402566,0.0015106424],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.6876563e-7,0.00002829397,0.0000011155695,0.0005335778,0.00002294109,0.00033546716,0.000008785683,0.00013932641,3.3970701e-7,0.0020603132,0.9215128,0.07535666],"study_design_scores_gemma":[0.00008056046,0.00011600004,0.000023173154,0.0026882372,0.00001554752,0.00055864535,1.8713122e-7,0.022895874,0.00000870297,0.0005567236,0.9725821,0.00047426342],"about_ca_topic_score_codex":0.000070466005,"about_ca_topic_score_gemma":0.000004787941,"teacher_disagreement_score":0.5563433,"about_ca_system_score_codex":0.00004978956,"about_ca_system_score_gemma":0.0003498894,"threshold_uncertainty_score":0.99989116},"labels":[],"label_agreement":null},{"id":"W4237411905","doi":"10.21468/scipost.report.804","title":"Report on 1803.00026v3","year":2019,"lang":"en","type":"peer-review","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Gordon and Betty Moore Foundation","keywords":"Computer science","score_opus":0.02049479788039455,"score_gpt":0.28816619072850497,"score_spread":0.2676713928481104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237411905","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018158567,0.019541001,0.22225715,0.28555715,0.03615031,0.0014537094,0.000058756734,0.001684801,0.43327895],"genre_scores_gemma":[0.000025538327,0.00071946165,0.032841813,0.022285825,0.0012052692,0.000015358512,0.00017630166,0.00004772113,0.9426827],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966466,0.00008969045,0.00057378755,0.0012736984,0.00093214115,0.00048409877],"domain_scores_gemma":[0.9963295,0.00018541282,0.000395441,0.0027669934,0.00018134335,0.0001413117],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00070032873,0.00048409062,0.00078774715,0.00017579937,0.00010276657,0.00019044799,0.0022499622,0.00024351201,0.0002676184],"category_scores_gemma":[0.00014763234,0.00035142986,0.00036028694,0.00039958325,0.000027911357,0.00006379339,0.0007977862,0.0009441596,0.0017406261],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.5463736e-7,0.000027894308,9.4973956e-7,0.0005027199,0.000022409542,0.00033949845,0.000008285299,0.00012312495,2.9280105e-7,0.0022238446,0.9116246,0.085126],"study_design_scores_gemma":[0.00007834446,0.00011383489,0.000020856347,0.0026329993,0.000015330637,0.0005609848,1.8345447e-7,0.025490068,0.000007991249,0.0005426414,0.9700681,0.00046867956],"about_ca_topic_score_codex":0.000067894805,"about_ca_topic_score_gemma":0.0000043295913,"teacher_disagreement_score":0.50940377,"about_ca_system_score_codex":0.000049221486,"about_ca_system_score_gemma":0.00033230468,"threshold_uncertainty_score":0.9998938},"labels":[],"label_agreement":null},{"id":"W4240115847","doi":"10.1017/cbo9780511762789.037","title":"Other Letters","year":2011,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum; Quantum cryptography; Physicist; Field (mathematics); Theoretical physics; Computer science; Art history; Mathematics; Physics; Quantum information; Art; Quantum mechanics; Pure mathematics","score_opus":0.018312891049798698,"score_gpt":0.17851920616045308,"score_spread":0.1602063151106544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240115847","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005262287,0.00006920331,0.12553056,0.000048285794,0.00043542922,0.00016312137,0.000035929515,0.00036798013,0.87329686],"genre_scores_gemma":[0.00028595552,0.000010406761,0.0045052846,0.00045472741,0.00019346297,2.1426114e-7,0.000003907473,0.00004298072,0.9945031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985438,0.000034383967,0.00015119172,0.00068163115,0.00025013977,0.00033887767],"domain_scores_gemma":[0.9985529,0.000043727043,0.00019572455,0.00097516197,0.0000632324,0.00016924586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000084199986,0.00038485107,0.0003255092,0.00019722608,0.00019309143,0.0000817043,0.0017399375,0.00022247309,0.000003974008],"category_scores_gemma":[0.0000022990694,0.0004157066,0.000244925,0.000010258855,0.0001652837,0.000088652094,0.0009438784,0.00052388234,0.000045352797],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007506566,0.0000052622227,3.4791842e-7,0.000021010786,0.000072167095,0.0003102636,0.00009746415,0.000014202014,0.000036298523,0.96900785,0.020790912,0.009636701],"study_design_scores_gemma":[0.0002462613,0.000038439062,0.000007072375,0.00011471361,0.000038858303,0.0000373074,0.0000010707384,0.0024625426,0.00014106861,0.0001128626,0.9962731,0.0005267273],"about_ca_topic_score_codex":0.00011657789,"about_ca_topic_score_gemma":6.2991967e-7,"teacher_disagreement_score":0.97548217,"about_ca_system_score_codex":0.00006852176,"about_ca_system_score_gemma":0.000061131264,"threshold_uncertainty_score":0.9998295},"labels":[],"label_agreement":null},{"id":"W4241690906","doi":"10.1109/jstqe.2018.2866669","title":"IEEE Journal of Selected Topics in Quantum Electronics","year":2018,"lang":"en","type":"article","venue":"IEEE Journal of Selected Topics in Quantum Electronics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Standards Association","funders":"","keywords":"Quantum optics; Electronics; Computer science; Physics; Electrical engineering; Quantum mechanics; Engineering","score_opus":0.010346595388972733,"score_gpt":0.2534234252453558,"score_spread":0.2430768298563831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241690906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9130987,0.0049670073,0.07609372,0.0023337805,0.0031186116,0.00025302378,0.0000023303498,0.00006726789,0.00006554638],"genre_scores_gemma":[0.9777256,0.0023939954,0.015234606,0.00042848673,0.004020853,0.000003414378,0.0000021923538,0.00008173803,0.000109108325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99263614,0.00071069296,0.0027833695,0.0006092349,0.0013525196,0.0019080164],"domain_scores_gemma":[0.99299186,0.00040867226,0.0021213496,0.0007351095,0.0034074234,0.0003355792],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023652052,0.0006540545,0.0013615324,0.0016225503,0.00023728282,0.00028145788,0.0029769966,0.0005124684,0.000013073291],"category_scores_gemma":[0.00084327976,0.00059333676,0.0003426507,0.0049787094,0.0001923212,0.0007431261,0.00013669336,0.00424006,0.000006657303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039086347,0.010081646,0.02523357,0.0009459205,0.003024002,0.0057498533,0.027374158,0.122632354,0.23078193,0.15463491,0.0265439,0.3890891],"study_design_scores_gemma":[0.005591827,0.011545282,0.007019379,0.0007747994,0.000116640374,0.0051685907,0.000081766564,0.83857393,0.0577958,0.04647955,0.0254158,0.0014366101],"about_ca_topic_score_codex":0.000032888533,"about_ca_topic_score_gemma":0.0003991596,"teacher_disagreement_score":0.7159416,"about_ca_system_score_codex":0.0010556851,"about_ca_system_score_gemma":0.004085513,"threshold_uncertainty_score":0.9996518},"labels":[],"label_agreement":null},{"id":"W4242816727","doi":"10.21468/scipost.report.2615","title":"Report on 2009.11884v3","year":2021,"lang":"en","type":"peer-review","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Deutsche Forschungsgemeinschaft; Foundational Questions Institute; Imperial College London; Government of Canada; European Commission; Heinrich Böll Stiftung","keywords":"Computer science; Geography","score_opus":0.02187655166855826,"score_gpt":0.29158198916986694,"score_spread":0.2697054375013087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242816727","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010049525,0.100430466,0.2671232,0.40395483,0.025080478,0.00070585456,0.00007289507,0.0013442631,0.20127796],"genre_scores_gemma":[0.0000075086714,0.003054191,0.079473436,0.03125796,0.0017897785,0.0000217851,0.0003809996,0.000047160887,0.88396716],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966199,0.00011957438,0.0005863991,0.0012948146,0.0009143526,0.0004649581],"domain_scores_gemma":[0.99666035,0.00015943375,0.0003227651,0.0024190948,0.00026787329,0.00017050956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063541456,0.00045300747,0.0007573153,0.00014002167,0.00013449682,0.0002417972,0.0016857447,0.00022458083,0.00036717745],"category_scores_gemma":[0.00023356418,0.00034693466,0.0003910007,0.00059116224,0.00002834651,0.000053035554,0.0008431792,0.0009487944,0.0002671517],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.7756385e-7,0.000036747148,3.3882523e-7,0.00035448765,0.000024944582,0.001889713,0.0000072895073,0.00007572765,2.9682536e-7,0.00121751,0.87816846,0.1182243],"study_design_scores_gemma":[0.00006045896,0.00006291912,0.000012019413,0.0034734672,0.000017671327,0.0012478885,3.464944e-7,0.012191484,0.000020331876,0.00046498817,0.9820086,0.00043987812],"about_ca_topic_score_codex":0.000072200986,"about_ca_topic_score_gemma":0.0000123037125,"teacher_disagreement_score":0.68268925,"about_ca_system_score_codex":0.0000418704,"about_ca_system_score_gemma":0.00047761548,"threshold_uncertainty_score":0.99989825},"labels":[],"label_agreement":null},{"id":"W4242963412","doi":"10.1088/2058-7058/22/05/6","title":"CP violation estimated","year":2009,"lang":"en","type":"article","venue":"Physics World","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Antimatter; Physics; Parity (physics); Particle physics; CP violation; Statistical physics; Nuclear physics; Theoretical physics; Physics beyond the Standard Model; Positron; Electron","score_opus":0.017860831763939152,"score_gpt":0.26287858585270146,"score_spread":0.2450177540887623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242963412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02475648,0.000046344696,0.96769595,0.0018344886,0.00023551249,0.000067204535,6.2451835e-7,0.00045966823,0.0049037277],"genre_scores_gemma":[0.9162814,7.241084e-7,0.08280804,0.00054859486,0.0002149492,8.200061e-7,0.0000028250324,0.000003961873,0.00013868035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993564,0.000018550565,0.00009612789,0.00021021513,0.00013886546,0.00017985675],"domain_scores_gemma":[0.9995467,0.000034156852,0.000046834077,0.00029398236,0.000030973395,0.000047327005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006335939,0.00009174482,0.00008775413,0.00004524694,0.0001055149,0.00010582058,0.0003438569,0.0000118272,0.0000023960556],"category_scores_gemma":[0.000005182781,0.000082551225,0.000041581003,0.00058407243,0.0000097902075,0.00016239009,0.000052442163,0.00011799653,0.000051050552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013475121,0.000061999934,0.00014038822,0.0000021242513,0.0000042982842,0.0000048442394,0.00021416844,0.02775005,0.0013907626,0.15450054,0.00081265724,0.8151168],"study_design_scores_gemma":[0.00008739868,0.000027134467,0.007779676,0.000018676756,0.000001605584,0.0000018946607,3.047786e-7,0.8569317,0.0017524691,0.13252589,0.0007659927,0.000107261134],"about_ca_topic_score_codex":0.000004084369,"about_ca_topic_score_gemma":9.0999544e-7,"teacher_disagreement_score":0.8915249,"about_ca_system_score_codex":0.000012083286,"about_ca_system_score_gemma":0.000016453836,"threshold_uncertainty_score":0.33663413},"labels":[],"label_agreement":null},{"id":"W4243386666","doi":"10.26421/qic14.11-12-1","title":"The computational power of matchgates and the XY interaction on arbitrary graphs","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Qubit; Universal set; Quantum computer; Mathematics; Computation; Path (computing); Quantum; Discrete mathematics; Graph; Set (abstract data type); Combinatorics; Topology (electrical circuits); Computer science; Quantum mechanics; Algorithm; Physics","score_opus":0.004914132702145928,"score_gpt":0.22189516212647112,"score_spread":0.21698102942432518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243386666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33464995,0.000063638916,0.66016954,0.0037951567,0.0003679314,0.00018891823,0.000001603807,0.00007145897,0.0006917959],"genre_scores_gemma":[0.99514276,0.000022553173,0.0039501,0.00084564625,0.000017784962,0.0000060291045,0.0000095986,0.000003090406,0.00000246333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989999,0.00014809893,0.00036884687,0.00011318753,0.00025372772,0.00011622934],"domain_scores_gemma":[0.9984407,0.0009874516,0.00028399887,0.00013762944,0.00011301077,0.00003722276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006618447,0.00011176979,0.00012221509,0.00010697342,0.0004385825,0.00031902234,0.0001922839,0.00003300902,7.363314e-7],"category_scores_gemma":[0.000062612744,0.00006348261,0.000042174743,0.00019376821,0.00017214198,0.00051875354,0.00008167089,0.00015263032,0.0000069026187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004545431,0.00001013219,0.000025271778,0.000014466909,0.0000122687115,6.5981105e-8,0.0026548917,0.052459292,0.0000014333442,0.80065644,0.00014678683,0.14397347],"study_design_scores_gemma":[0.0005592205,0.00010830074,0.0033565972,0.00002297479,0.0000028140416,0.00001734622,0.00018237894,0.79422015,0.000015777727,0.2005832,0.0008666275,0.00006461955],"about_ca_topic_score_codex":0.00001780799,"about_ca_topic_score_gemma":8.0773094e-7,"teacher_disagreement_score":0.74176085,"about_ca_system_score_codex":0.0000066256916,"about_ca_system_score_gemma":0.00001777979,"threshold_uncertainty_score":0.33732662},"labels":[],"label_agreement":null},{"id":"W4244191272","doi":"10.1007/978-3-030-83098-4_3","title":"Quantum Computing","year":2021,"lang":"en","type":"book-chapter","venue":"Quantum science and technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Unitary state; Formalism (music); Observable; Quantum; Computer science; Quantum computer; Quantum walk; Algebra over a field; Theoretical computer science; Theoretical physics; Mathematics; Quantum mechanics; Physics; Pure mathematics; Law; Political science","score_opus":0.01170729508006542,"score_gpt":0.23436126057336917,"score_spread":0.22265396549330374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244191272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049238745,0.038432486,0.42662996,0.06814189,0.014756713,0.0024231002,0.00006163371,0.0118863145,0.38842916],"genre_scores_gemma":[0.7390843,0.002318447,0.1570913,0.0038232652,0.0015703833,0.000026688052,0.0000302789,0.0003630682,0.09569224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99581337,0.000018022904,0.00051362533,0.0018099863,0.00093652797,0.0009084949],"domain_scores_gemma":[0.9971147,0.00013556992,0.00034842783,0.0015008942,0.0006768185,0.0002235687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009426049,0.0005379351,0.00068224594,0.0014787937,0.00097213517,0.00050078775,0.0029013662,0.00055567065,0.000018098099],"category_scores_gemma":[0.0002096832,0.00049470674,0.00009921807,0.001228948,0.0022165158,0.0002700804,0.0030691356,0.0011975758,0.000066547815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.234466e-7,0.000011725967,0.0000073694805,0.000021148242,0.000012922565,0.00017921039,0.00006883184,0.000008281388,0.00055079866,0.88485616,0.00023803476,0.114044994],"study_design_scores_gemma":[0.00025098384,0.00031877635,0.000031135532,0.0004278323,0.000020301992,0.0011847225,0.00004394646,0.43606597,0.0008239572,0.44731638,0.11251632,0.000999677],"about_ca_topic_score_codex":0.000008728704,"about_ca_topic_score_gemma":0.0000032641728,"teacher_disagreement_score":0.68984556,"about_ca_system_score_codex":0.00009635466,"about_ca_system_score_gemma":0.000936644,"threshold_uncertainty_score":0.99975044},"labels":[],"label_agreement":null},{"id":"W4244516787","doi":"10.1109/jstqe.2019.2891035","title":"IEEE Journal of Selected Topics in Quantum Electronics","year":2019,"lang":"en","type":"article","venue":"IEEE Journal of Selected Topics in Quantum Electronics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Standards Association","funders":"","keywords":"Quantum optics; Computer science; Electronics; Optoelectronics; Electrical engineering; Physics; Quantum mechanics; Engineering","score_opus":0.007934062539361148,"score_gpt":0.23914208804934925,"score_spread":0.2312080255099881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244516787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.957107,0.00619795,0.031131081,0.0019957907,0.0031016073,0.00033854065,0.0000022695078,0.00006008067,0.000065647466],"genre_scores_gemma":[0.9855007,0.0027727329,0.009443385,0.00035358593,0.0016640048,0.0000032125727,0.0000027619847,0.000081806764,0.0001778451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99270475,0.0006796511,0.0027512056,0.0006191517,0.0014090193,0.001836203],"domain_scores_gemma":[0.9940202,0.0004809818,0.0021511451,0.00077404844,0.0022708967,0.00030268534],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0022351588,0.0006566218,0.0015020601,0.001591178,0.00013804331,0.00026601736,0.002910169,0.0005169947,0.000016058866],"category_scores_gemma":[0.00054810854,0.0005970787,0.00038637832,0.004432345,0.00008407795,0.0007889867,0.00013083282,0.004868015,0.000009829214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023859208,0.0066707744,0.04466759,0.001073478,0.0020738943,0.0035640334,0.01308169,0.4380557,0.19052769,0.11499418,0.008924059,0.17398098],"study_design_scores_gemma":[0.006280544,0.0077864877,0.008987968,0.00081522,0.00009482532,0.004147571,0.00008703218,0.8922082,0.029582905,0.03108081,0.017543353,0.001385041],"about_ca_topic_score_codex":0.00002869257,"about_ca_topic_score_gemma":0.0001775618,"teacher_disagreement_score":0.45415255,"about_ca_system_score_codex":0.0011029334,"about_ca_system_score_gemma":0.0039608236,"threshold_uncertainty_score":0.99964803},"labels":[],"label_agreement":null},{"id":"W4244868310","doi":"10.1109/ccc.1997.612299","title":"Reversible space equals deterministic space","year":2002,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Turing machine; Space (punctuation); Conjecture; Turing; Computation; Bounded function; Computer science; Time hierarchy theorem; Pebble; Mathematics; Discrete mathematics; Algorithm; Universal Turing machine; Mathematical analysis","score_opus":0.019958624318528656,"score_gpt":0.23126920748934826,"score_spread":0.2113105831708196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244868310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015249554,0.000240205,0.9290353,0.008297979,0.0006120831,0.00012508822,0.0000011811652,0.0006379889,0.045800604],"genre_scores_gemma":[0.7317838,0.000015164107,0.25346074,0.00077401736,0.00015976203,0.0000024784526,3.1580566e-7,0.00001221307,0.013791485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987924,0.00005109765,0.0001485884,0.00039735105,0.00023624663,0.0003743147],"domain_scores_gemma":[0.9990066,0.0001605703,0.000058107158,0.00060952746,0.00002829032,0.00013688124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001562467,0.0001503311,0.00015533785,0.00009005006,0.00017091958,0.00017820369,0.00076731795,0.000048593978,0.00018315986],"category_scores_gemma":[0.000052631505,0.00012508548,0.00007236878,0.0003885963,0.00003632947,0.00015166431,0.0003130838,0.00015174197,0.0005757641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047681183,0.0003749279,0.0004592196,0.00009289808,0.00006385628,0.0005675052,0.0045132856,0.0089283055,0.0023190454,0.45892012,0.13711452,0.38664153],"study_design_scores_gemma":[0.0001823443,0.000103409984,0.00014078026,0.000021094605,0.0000032109067,0.00007681365,0.000011817092,0.96319747,0.0008298173,0.003474155,0.0317262,0.00023290704],"about_ca_topic_score_codex":0.00001877373,"about_ca_topic_score_gemma":0.0000024148035,"teacher_disagreement_score":0.9542692,"about_ca_system_score_codex":0.000017519142,"about_ca_system_score_gemma":0.000013585853,"threshold_uncertainty_score":0.74004745},"labels":[],"label_agreement":null},{"id":"W4245021739","doi":"10.21468/scipost.report.2267","title":"Report on 2009.11884v2","year":2020,"lang":"en","type":"peer-review","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Deutsche Forschungsgemeinschaft; Foundational Questions Institute; Imperial College London; Government of Canada; European Commission; Heinrich Böll Stiftung","keywords":"Computer science","score_opus":0.024564399338095184,"score_gpt":0.28732203313231836,"score_spread":0.2627576337942232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245021739","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021258593,0.015948046,0.21880408,0.6200344,0.010896175,0.0006274866,0.00005893996,0.0014182583,0.13221046],"genre_scores_gemma":[0.000023999915,0.0020322802,0.11742677,0.11402451,0.0037950298,0.000035139743,0.0003944899,0.0000883307,0.76217943],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99675626,0.0000884763,0.000581201,0.0012665584,0.0008848097,0.00042272292],"domain_scores_gemma":[0.9974407,0.0001290802,0.00034877943,0.0016988168,0.00014018099,0.00024244291],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043012787,0.00046956597,0.0007455789,0.00011373445,0.00011910567,0.00018031934,0.002118512,0.00019133517,0.00018051265],"category_scores_gemma":[0.00023479176,0.00035034676,0.00034720282,0.0005487866,0.000029400997,0.0000536122,0.0007997042,0.0010234407,0.00076390646],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.2233503e-7,0.000020766569,3.0469664e-7,0.0003772957,0.000021680888,0.0010493943,0.00001143901,0.00006464717,2.758408e-7,0.00133772,0.9040744,0.0930417],"study_design_scores_gemma":[0.000063910506,0.00012700025,0.000008004915,0.0016702086,0.00001718844,0.00047756024,1.8623571e-7,0.03180902,0.000010855314,0.00067426916,0.96471334,0.0004284325],"about_ca_topic_score_codex":0.00004816893,"about_ca_topic_score_gemma":0.000004047795,"teacher_disagreement_score":0.629969,"about_ca_system_score_codex":0.000032843644,"about_ca_system_score_gemma":0.0003050899,"threshold_uncertainty_score":0.99989486},"labels":[],"label_agreement":null},{"id":"W4245671524","doi":"10.21468/scipost.report.2613","title":"Report on 2009.11884v3","year":2021,"lang":"en","type":"peer-review","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Deutsche Forschungsgemeinschaft; Foundational Questions Institute; Imperial College London; Government of Canada; European Commission; Heinrich Böll Stiftung","keywords":"Geography","score_opus":0.02187655166855826,"score_gpt":0.29158198916986694,"score_spread":0.2697054375013087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245671524","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010049525,0.100430466,0.2671232,0.40395483,0.025080478,0.00070585456,0.00007289507,0.0013442631,0.20127796],"genre_scores_gemma":[0.0000075086714,0.003054191,0.079473436,0.03125796,0.0017897785,0.0000217851,0.0003809996,0.000047160887,0.88396716],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966199,0.00011957438,0.0005863991,0.0012948146,0.0009143526,0.0004649581],"domain_scores_gemma":[0.99666035,0.00015943375,0.0003227651,0.0024190948,0.00026787329,0.00017050956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063541456,0.00045300747,0.0007573153,0.00014002167,0.00013449682,0.0002417972,0.0016857447,0.00022458083,0.00036717745],"category_scores_gemma":[0.00023356418,0.00034693466,0.0003910007,0.00059116224,0.00002834651,0.000053035554,0.0008431792,0.0009487944,0.0002671517],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.7756385e-7,0.000036747148,3.3882523e-7,0.00035448765,0.000024944582,0.001889713,0.0000072895073,0.00007572765,2.9682536e-7,0.00121751,0.87816846,0.1182243],"study_design_scores_gemma":[0.00006045896,0.00006291912,0.000012019413,0.0034734672,0.000017671327,0.0012478885,3.464944e-7,0.012191484,0.000020331876,0.00046498817,0.9820086,0.00043987812],"about_ca_topic_score_codex":0.000072200986,"about_ca_topic_score_gemma":0.0000123037125,"teacher_disagreement_score":0.68268925,"about_ca_system_score_codex":0.0000418704,"about_ca_system_score_gemma":0.00047761548,"threshold_uncertainty_score":0.99989825},"labels":[],"label_agreement":null},{"id":"W4247539104","doi":"10.3390/books978-3-03928-801-4","title":"Quantum Information and Symmetry","year":2020,"lang":"en","type":"book","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Social Fund; European Regional Development Fund; China Science and Technology Exchange Center; Univerzita Palackého v Olomouci; East China Normal University; Science and Technology Commission of Shanghai Municipality; Russian Foundation for Basic Research; Grantová Agentura České Republiky; York University; Centro de Investigación Científica y de Educación Superior de Ensenada, Baja California; National Natural Science Foundation of China; New York University Shanghai; Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie","keywords":"Theoretical physics; Quantum information; Context (archaeology); Symmetry (geometry); Quantum; Physics; Quantum information science; Field (mathematics); Quantum field theory; Quantum mechanics; Mathematics; Quantum entanglement; Pure mathematics; Geometry","score_opus":0.007121604929854702,"score_gpt":0.20020799220581645,"score_spread":0.19308638727596175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247539104","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019497873,0.00035073835,0.6126162,0.002703249,0.0005484327,0.00015420094,0.0000073872366,0.0005507369,0.38304958],"genre_scores_gemma":[0.0028666293,0.00044736985,0.39368555,0.02465835,0.0023029922,0.00001620958,0.00024297618,0.000101675294,0.5756782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991041,0.000015334725,0.0002334186,0.0002495266,0.00023647651,0.00016115828],"domain_scores_gemma":[0.9993494,0.00007064737,0.00012558639,0.00029739208,0.000038618997,0.00011833309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009124534,0.00019897646,0.00021546076,0.00013031349,0.00008256506,0.0003152643,0.0005458971,0.0001450673,0.000007795548],"category_scores_gemma":[0.000021113761,0.0001636843,0.0000559419,0.00010327628,0.000029880994,0.00031997188,0.0005620483,0.00037119313,0.00016823763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.585431e-7,0.000002606512,0.0000012151432,0.00008831223,0.000017513277,0.000008667967,0.00031688943,0.000025742067,5.95305e-7,0.63963556,0.09835746,0.2615446],"study_design_scores_gemma":[0.00007632241,0.000056804918,0.00001830639,0.000040100225,0.0000038377143,0.00002740602,0.0000021396927,0.44974595,0.0000033332815,0.041923236,0.507909,0.00019358037],"about_ca_topic_score_codex":0.0000045514867,"about_ca_topic_score_gemma":3.4702887e-7,"teacher_disagreement_score":0.59771234,"about_ca_system_score_codex":0.000021829079,"about_ca_system_score_gemma":0.00018421332,"threshold_uncertainty_score":0.6674852},"labels":[],"label_agreement":null},{"id":"W4248194322","doi":"10.1007/978-3-319-96424-9_5","title":"Information Encoding","year":2018,"lang":"en","type":"book-chapter","venue":"Quantum science and technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Computer science; Quantum; Recipe; Encoding (memory); Quantum computer; State (computer science); Quantum information; Theoretical computer science; Process (computing); Quantum memory; Algorithm; Artificial intelligence; Quantum network; Programming language; Physics; Quantum mechanics; Chemistry","score_opus":0.008822719395285332,"score_gpt":0.22051596968652545,"score_spread":0.21169325029124011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248194322","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017547347,0.001858941,0.22358997,0.02074966,0.0057002394,0.0012123815,0.000027983859,0.00512285,0.72419065],"genre_scores_gemma":[0.6977493,0.0017686168,0.20597087,0.006123627,0.0019793746,0.00007428515,0.00003128781,0.00018831673,0.08611429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982346,0.000004282254,0.00029931913,0.00047389927,0.00054809125,0.000439797],"domain_scores_gemma":[0.9984126,0.000036618447,0.00023898258,0.00075179356,0.0004583771,0.000101599944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062681735,0.00025756078,0.00025855738,0.0015140475,0.0005739279,0.0003421889,0.0018295598,0.00032644384,0.000021448242],"category_scores_gemma":[0.00013061677,0.0002213284,0.000033372977,0.0006106744,0.0017433161,0.00079057727,0.0012377677,0.000454777,0.0002334015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.4230273e-7,0.0000020888986,0.0000023056768,0.000009367611,0.0000036061688,0.0000054405614,0.00020794045,8.7360826e-7,0.00012431196,0.87461287,0.0004914922,0.124539234],"study_design_scores_gemma":[0.00011892454,0.00030875328,0.000009444368,0.000130649,0.00000645956,0.0002587247,0.00003191386,0.09767061,0.00065880566,0.5920877,0.30828607,0.000431947],"about_ca_topic_score_codex":0.0000031143632,"about_ca_topic_score_gemma":0.0000010552405,"teacher_disagreement_score":0.680202,"about_ca_system_score_codex":0.000057818404,"about_ca_system_score_gemma":0.00036814637,"threshold_uncertainty_score":0.902551},"labels":[],"label_agreement":null},{"id":"W4248586010","doi":"10.1002/9781119618232.ch7","title":"Quantum Cryptography","year":2019,"lang":"en","type":"other","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum cryptography; Quantum network; Quantum algorithm; Computer science; Quantum key distribution; Theoretical computer science; Quantum error correction; Quantum technology; Quantum information; Quantum computer; Open quantum system; Mathematics; Quantum; Physics; Quantum mechanics","score_opus":0.006940735652597173,"score_gpt":0.21849442420561538,"score_spread":0.2115536885530182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248586010","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012527297,0.000417556,0.43073922,0.00023030976,0.0010991372,0.000105629704,0.0000022217928,0.0009925951,0.5664121],"genre_scores_gemma":[0.000073525836,0.000042559543,0.1865507,0.0006261041,0.0004717602,0.000004140889,0.000004163191,0.00027414574,0.8119529],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987588,0.000032683944,0.00012694368,0.00053328514,0.0002498626,0.00029842142],"domain_scores_gemma":[0.9987554,0.000034060893,0.00010879274,0.0010144517,0.00001292483,0.00007438456],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000072146526,0.00025700056,0.00026570426,0.000391987,0.000030987812,0.00012788389,0.0013002745,0.00018758113,0.00028214717],"category_scores_gemma":[0.000004025011,0.00019646987,0.00015900738,0.0003560273,0.000027991715,0.000028863928,0.00033841984,0.00024152588,0.0014643524],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.5944077e-7,0.000014443415,0.0000060752054,0.000023176299,0.000024433384,0.000006654974,0.000020453703,0.000018919574,0.0000024611654,0.16835892,0.8129663,0.018558],"study_design_scores_gemma":[0.0001004743,0.000037244663,0.000013848852,0.00007759112,0.0000027948163,0.000008695049,0.0000012549085,0.08988966,0.000004906502,0.0028420535,0.9067323,0.00028913585],"about_ca_topic_score_codex":0.0000947898,"about_ca_topic_score_gemma":0.000005323797,"teacher_disagreement_score":0.24554083,"about_ca_system_score_codex":0.000004728233,"about_ca_system_score_gemma":0.00004442834,"threshold_uncertainty_score":0.9993131},"labels":[],"label_agreement":null},{"id":"W4248932258","doi":"10.1007/978-3-319-41192-7_17","title":"Quantum Computing","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Quantum computer; Quantum algorithm; Computer science; Quantum network; Quantum; Quantum sort; Theoretical computer science; Quantum technology; Open quantum system; Computational science; Quantum mechanics; Physics","score_opus":0.013909378712110232,"score_gpt":0.22532433360169057,"score_spread":0.21141495488958034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248932258","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006271543,0.0001728556,0.4765699,0.0008428296,0.0007672653,0.000079638005,0.000003162303,0.0005437697,0.52101433],"genre_scores_gemma":[0.0032423357,0.0000344302,0.05114328,0.00096318364,0.0012437701,8.6094644e-7,0.0000033484605,0.000081257465,0.94328755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99797153,0.000017068585,0.00037802724,0.00079743133,0.00040883105,0.00042710203],"domain_scores_gemma":[0.9983095,0.00021369761,0.00022994068,0.0010020625,0.00008925844,0.00015552586],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021832854,0.00043616103,0.00041332864,0.00019472766,0.00018511241,0.00017784073,0.0015495986,0.0002559556,0.00015841691],"category_scores_gemma":[0.000011060571,0.0002986143,0.00024016654,0.00003772744,0.0000756189,0.00009285078,0.00097254675,0.00043124513,0.0009585242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.6696104e-7,0.0000032176815,5.153183e-7,0.000009092187,0.000020891406,0.000036664173,0.000041690466,0.000025990494,0.000006080991,0.78610617,0.0025830592,0.21116616],"study_design_scores_gemma":[0.00019136399,0.00008543349,0.000007840217,0.00037881488,0.000007782639,0.000106598694,4.813028e-7,0.22062849,0.000023651754,0.36074919,0.41711137,0.000709001],"about_ca_topic_score_codex":0.00000249882,"about_ca_topic_score_gemma":9.1544103e-7,"teacher_disagreement_score":0.4254266,"about_ca_system_score_codex":0.000041832052,"about_ca_system_score_gemma":0.000098588534,"threshold_uncertainty_score":0.9999466},"labels":[],"label_agreement":null},{"id":"W4250831014","doi":"10.22215/etd/2014-10598","title":"Error Correction of Quantum Channels","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Quantum entanglement; Coherence (philosophical gambling strategy); Quantum; Quantum capacity; Quantum computer; Quantum information; Quantum error correction; Computer science; Quantum mechanics; Quantum network; Statistical physics; Physics; Theoretical physics","score_opus":0.010385286822033418,"score_gpt":0.25470972257054786,"score_spread":0.24432443574851445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250831014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07924865,0.00017763721,0.8641169,0.00015401206,0.031360004,0.0002943865,0.0000025647973,0.00054107996,0.024104781],"genre_scores_gemma":[0.96121955,0.0000133142585,0.012071683,0.00012112105,0.00059305417,0.000013783224,0.00017289151,0.00004278902,0.025751837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998676,0.000060887232,0.00032630915,0.00041736604,0.00030269177,0.00021676035],"domain_scores_gemma":[0.9989153,0.00010056172,0.00031440618,0.00048041684,0.00012924748,0.00006002339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002151811,0.00022242902,0.00033883296,0.00021809223,0.00008344988,0.00006617245,0.0007365745,0.00022321772,0.000023735105],"category_scores_gemma":[0.000043275482,0.00018698505,0.00012900292,0.00028165686,0.000013989882,0.000068503454,0.000057271092,0.00032124785,0.000036556772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045963974,0.0002399545,0.000020466401,0.00060992327,0.00013148606,0.000011728666,0.005600161,0.035053346,0.00135359,0.085086554,0.025257446,0.8465894],"study_design_scores_gemma":[0.000097212316,0.00014565191,0.00025231502,0.00014232709,0.000008189924,0.000005767581,0.00005206759,0.98900837,0.003939031,0.001919391,0.0041993475,0.00023030274],"about_ca_topic_score_codex":0.00012795924,"about_ca_topic_score_gemma":0.000026000993,"teacher_disagreement_score":0.95395505,"about_ca_system_score_codex":0.000012026129,"about_ca_system_score_gemma":0.0000768235,"threshold_uncertainty_score":0.76250297},"labels":[],"label_agreement":null},{"id":"W4250958665","doi":"10.4086/cjtcs.2013.011","title":"","year":2013,"lang":"en","type":"article","venue":"Chicago Journal of Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Computer science; Medicine","score_opus":0.005905725844956174,"score_gpt":0.22603585823432917,"score_spread":0.220130132389373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250958665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41642767,0.000065097025,0.5727812,0.009190085,0.0012529052,0.00014345844,2.0725099e-7,0.000082030936,0.000057330228],"genre_scores_gemma":[0.5820977,0.000005340148,0.41615954,0.0012725815,0.00045281753,0.000001986816,4.74847e-8,0.00000920332,7.430207e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99329615,0.0003737527,0.00148395,0.0009505656,0.0024737625,0.0014218284],"domain_scores_gemma":[0.99317896,0.0010005663,0.00085735985,0.0014869932,0.0020413878,0.0014347269],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0049013174,0.00046845697,0.00076480367,0.0009127215,0.0010621294,0.0026665295,0.012354019,0.00010782635,0.00002193155],"category_scores_gemma":[0.00061877555,0.00031544315,0.0004279914,0.0030853658,0.0048193275,0.0039475025,0.003073676,0.0012330239,0.00002174076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012238383,0.00023550617,0.00028379104,0.0000117318705,0.00002525605,0.000104062616,0.0015494911,0.010842976,0.0055776797,0.74591404,0.00009509011,0.23534814],"study_design_scores_gemma":[0.00060061197,0.0011128365,0.00833592,0.00010294147,0.000007077191,0.0022326831,0.000015162284,0.6981063,0.0057697664,0.28334403,0.0000394844,0.0003331915],"about_ca_topic_score_codex":0.0000057725124,"about_ca_topic_score_gemma":1.60597e-7,"teacher_disagreement_score":0.6872633,"about_ca_system_score_codex":0.00010658192,"about_ca_system_score_gemma":0.0004893154,"threshold_uncertainty_score":0.9999298},"labels":[],"label_agreement":null},{"id":"W4251985907","doi":"10.1007/978-3-642-35079-5_5","title":"Discussion and Conclusion","year":2013,"lang":"en","type":"book-chapter","venue":"Springer theses","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Isotope; Atomic physics; High resolution; Ground state; Binding energy; Spectroscopy; Chemistry; Physics; Materials science; Nuclear physics; Geology; Remote sensing","score_opus":0.012457958421647162,"score_gpt":0.21468054660663033,"score_spread":0.20222258818498318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251985907","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002203382,0.0046587326,0.05050871,0.007119643,0.0020440936,0.00073913485,0.00001110417,0.0010402584,0.93167496],"genre_scores_gemma":[0.049630657,0.00049982424,0.042220443,0.00057764153,0.0009692601,0.000009981918,0.0000051865777,0.00011221555,0.9059748],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987919,0.000015672194,0.00017934169,0.00050434156,0.00024934762,0.00025943437],"domain_scores_gemma":[0.9990791,0.000086365086,0.00012226657,0.00054315553,0.000036395937,0.00013272559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001366064,0.00028210235,0.00027609905,0.000105897794,0.00018706363,0.00021636879,0.00056330126,0.00015662884,0.00009548012],"category_scores_gemma":[0.000016584672,0.00016079366,0.000086415945,0.000020740366,0.00008410309,0.00011283279,0.0013807178,0.0003240823,0.0001891631],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001710868,0.000008114195,0.000008758634,0.000042893378,0.000027112459,0.000028540288,0.00051866355,0.000022678585,0.00013997487,0.29822618,0.00083466526,0.7001407],"study_design_scores_gemma":[0.0001928653,0.000135664,0.00037601206,0.0008710836,0.000019542409,0.00006886804,0.0000059293407,0.042447038,0.00020644884,0.23674966,0.7181373,0.0007895329],"about_ca_topic_score_codex":0.0000137288935,"about_ca_topic_score_gemma":0.0000013125401,"teacher_disagreement_score":0.7173027,"about_ca_system_score_codex":0.000019387397,"about_ca_system_score_gemma":0.0000315766,"threshold_uncertainty_score":0.6556975},"labels":[],"label_agreement":null},{"id":"W4252158316","doi":"10.32920/ryerson.14653518.v1","title":"Learning programs for the quantum computer","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"GRASP; Genetic programming; Computer science; Quantum computer; Quantum; Evolutionary programming; Task (project management); Theoretical computer science; Genetic algorithm; Quantum algorithm; Mathematical optimization; Evolutionary algorithm; Artificial intelligence; Mathematics; Programming language; Machine learning; Quantum mechanics; Physics; Engineering","score_opus":0.02155592161544562,"score_gpt":0.2562856092082152,"score_spread":0.23472968759276958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252158316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063313777,0.00053075707,0.983886,0.0047046402,0.003088704,0.0006765543,9.232124e-7,0.00066441763,0.00011662214],"genre_scores_gemma":[0.21553218,0.00004283435,0.7810883,0.0007661854,0.001551761,0.00019223003,0.000046840054,0.00004447964,0.00073517347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785745,0.00012706057,0.00031443586,0.0009038655,0.00032089718,0.00047630808],"domain_scores_gemma":[0.9979455,0.0005282723,0.00018357046,0.0010562452,0.00020281595,0.000083601684],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005609411,0.00033094318,0.0003429914,0.000059089372,0.000435519,0.0016900641,0.0021726221,0.0001884971,0.0000061156584],"category_scores_gemma":[0.00003464912,0.00020704142,0.00039816927,0.00020835098,0.000058989815,0.00006410694,0.0038722958,0.0011445661,0.0000064701903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016274365,0.000053244024,0.000037496706,0.000091967275,0.00009193774,0.000011067598,0.0011805113,0.1548177,0.000004499326,0.00765947,0.0011392182,0.8349113],"study_design_scores_gemma":[0.0001376391,0.0001200124,0.00022148836,0.00012445883,0.000014738587,0.000025471487,0.000048561706,0.97482884,0.000027702215,0.0029377034,0.021206496,0.00030686424],"about_ca_topic_score_codex":0.00006127112,"about_ca_topic_score_gemma":0.000008731919,"teacher_disagreement_score":0.8346044,"about_ca_system_score_codex":0.000023436329,"about_ca_system_score_gemma":0.00018941147,"threshold_uncertainty_score":0.99934626},"labels":[],"label_agreement":null},{"id":"W4252582166","doi":"10.1007/978-3-030-19658-5_7","title":"Conclusion and Future Work","year":2019,"lang":"en","type":"book-chapter","venue":"Springer theses","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Work (physics); Psychology; Sociology; Engineering; Mechanical engineering","score_opus":0.010446231025964396,"score_gpt":0.20735165236957875,"score_spread":0.19690542134361436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252582166","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024988216,0.017411282,0.012717126,0.0057095923,0.0056493874,0.00066509325,0.000013189307,0.0008986638,0.95443684],"genre_scores_gemma":[0.031440325,0.0023185126,0.054540142,0.0018633914,0.0077699334,0.0000062762037,0.00001064438,0.00023935841,0.9018114],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986603,0.000015998283,0.00017703304,0.0005799319,0.00027495853,0.0002917574],"domain_scores_gemma":[0.99888355,0.00012458983,0.00013591826,0.0007101856,0.000040341645,0.000105430736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017110232,0.00032388658,0.0003414388,0.00011458037,0.00014307979,0.00018819218,0.00069751596,0.00023097458,0.000049505594],"category_scores_gemma":[0.0000070365736,0.00025399763,0.000112377376,0.00004144787,0.00006308508,0.000074264644,0.0011457488,0.00046746538,0.0001553895],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006625182,0.0000074509894,0.00004182875,0.000060879614,0.000053775137,0.00005042686,0.0006128252,0.000033115706,0.000016946351,0.46644992,0.0007607288,0.5319055],"study_design_scores_gemma":[0.00012693687,0.00006567013,0.00041206068,0.00037357793,0.00001372791,0.00003349555,0.000003837321,0.0023514673,0.000032677683,0.021477565,0.97463393,0.0004750414],"about_ca_topic_score_codex":0.0000034706088,"about_ca_topic_score_gemma":8.469545e-7,"teacher_disagreement_score":0.9738732,"about_ca_system_score_codex":0.000022167023,"about_ca_system_score_gemma":0.0000657563,"threshold_uncertainty_score":0.99999124},"labels":[],"label_agreement":null},{"id":"W4253191952","doi":"10.1142/s0219749905001237","title":"ROBUST DYNAMICAL DECOUPLING: FEEDBACK-FREE ERROR CORRECTION","year":2005,"lang":"en","type":"article","venue":"International Journal of Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dynamical decoupling; Decoupling (probability); Quantum decoherence; Quantum error correction; Quantum; Error detection and correction; Computer science; Dynamical systems theory; Statistical physics; Control theory (sociology); Quantum computer; Physics; Quantum mechanics; Algorithm; Control engineering; Control (management)","score_opus":0.014534041145652165,"score_gpt":0.2512664225454594,"score_spread":0.23673238139980723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253191952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10857531,0.000036177313,0.87859255,0.0066555557,0.005538206,0.000052225092,0.0000035608339,0.00006685044,0.0004795939],"genre_scores_gemma":[0.9281441,0.000021284923,0.07013974,0.0007402076,0.00090654724,0.0000012236959,0.000009159963,0.0000064371507,0.00003130799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980564,0.000031051288,0.00080140505,0.00009761803,0.0008316856,0.00018182537],"domain_scores_gemma":[0.99799705,0.000110417444,0.0007384015,0.00022907826,0.00082278496,0.0001022887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005525171,0.00013551959,0.00015678571,0.00045950507,0.00009257357,0.00037429645,0.0016147858,0.00007399337,0.000020782736],"category_scores_gemma":[0.0003000591,0.000115687355,0.00014845243,0.00020133305,0.000030300242,0.0031477686,0.00022512052,0.0003611571,0.00006933207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006731552,0.00009635118,0.00023404237,0.000005880645,0.00007552948,0.000012406631,0.0013916874,0.5819055,0.00006048956,0.016604109,0.0082164835,0.3913302],"study_design_scores_gemma":[0.00072706677,0.00011384119,0.0026585157,0.00006441955,0.0000054785332,0.0008183572,0.000059314087,0.9782347,0.00023235774,0.001984526,0.014973256,0.00012815422],"about_ca_topic_score_codex":0.000009698966,"about_ca_topic_score_gemma":0.000003987794,"teacher_disagreement_score":0.81956875,"about_ca_system_score_codex":0.00019042831,"about_ca_system_score_gemma":0.00012480494,"threshold_uncertainty_score":0.47175932},"labels":[],"label_agreement":null},{"id":"W4253903832","doi":"10.1364/qim.2013.w4b.3","title":"A New Alphabet for Quantum Information","year":2013,"lang":"en","type":"article","venue":"The Rochester Conferences on Coherence and Quantum Optics and the Quantum Information and Measurement meeting","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum information; Quantum state; Computer science; Quantum probability; Quantum; Quantum algorithm; Quantum information science; Quantum operation; Quantum capacity; Mathematics; Theoretical physics; Theoretical computer science; Discrete mathematics; Quantum process; Quantum network; Open quantum system; Quantum mechanics; Physics; Quantum entanglement; Quantum dynamics","score_opus":0.02269880159512962,"score_gpt":0.22232379257626825,"score_spread":0.19962499098113862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253903832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20623529,0.0011470914,0.7589738,0.028007716,0.0007620281,0.0028286169,0.000012572045,0.00023036585,0.0018025498],"genre_scores_gemma":[0.99405706,0.00035684812,0.0033107721,0.0020490526,0.00008370533,0.00010910084,0.00000784724,0.0000069164994,0.000018722547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979659,0.00013900794,0.00069587724,0.00023589587,0.00053756975,0.00042574815],"domain_scores_gemma":[0.9980615,0.00049869803,0.0004720723,0.00036803467,0.00041583698,0.00018386522],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002121634,0.00033023543,0.00033251816,0.00012613444,0.0008978929,0.0018654334,0.00056288997,0.00009298121,0.00000440834],"category_scores_gemma":[0.00026512306,0.00018054842,0.00007076662,0.00017756416,0.00020456345,0.0016268509,0.00023696339,0.00028318717,0.000023403438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010361826,0.000019562032,0.00008234016,0.00017169083,0.0000722637,1.4750948e-7,0.011362278,0.00022035022,0.00010347129,0.73248196,0.00053594116,0.2548464],"study_design_scores_gemma":[0.0018829979,0.00033652794,0.0010561193,0.0002633062,0.00003538855,0.00001977939,0.0020511225,0.9332357,0.0001498644,0.054883268,0.0057578585,0.00032807418],"about_ca_topic_score_codex":0.00030263234,"about_ca_topic_score_gemma":0.000010741281,"teacher_disagreement_score":0.93301535,"about_ca_system_score_codex":0.00001569623,"about_ca_system_score_gemma":0.00017314493,"threshold_uncertainty_score":0.9991707},"labels":[],"label_agreement":null},{"id":"W4254089546","doi":"10.22215/etd/2019-13522","title":"An Analysis of Potential Standards for Post-Quantum Cryptosystems","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"McEliece cryptosystem; Cryptosystem; Computer science; Hybrid cryptosystem; Computer security; Cryptography; Public key cryptosystem; Public-key cryptography; Quantum; Theoretical computer science; Encryption; Physics; Quantum mechanics","score_opus":0.005146171097543665,"score_gpt":0.27334562496641235,"score_spread":0.2681994538688687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254089546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26933837,0.00011922318,0.7274723,0.000040835777,0.0017715625,0.00040038946,0.0004038081,0.00013136597,0.0003221299],"genre_scores_gemma":[0.9743538,0.0000053172207,0.02290084,0.000046929592,0.00014483568,0.000015014497,0.0016222234,0.00003244128,0.0008785803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975725,0.00007814125,0.0005504613,0.00071011396,0.0007690411,0.00031977904],"domain_scores_gemma":[0.9972559,0.000094097886,0.0004705781,0.0009670954,0.0011154772,0.00009682428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056393346,0.00030203108,0.0008199639,0.00083195843,0.00011349251,0.00020462408,0.0012895602,0.00025190593,0.000027641276],"category_scores_gemma":[0.000035048546,0.00024909255,0.0006195938,0.0008051102,0.000013331091,0.00015574922,0.00004954097,0.0001758005,0.0000025070308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007142835,0.0009803617,0.00028999484,0.0036698417,0.010197456,0.000032382122,0.013623631,0.4203892,0.03458818,0.24805732,0.0016241956,0.26583317],"study_design_scores_gemma":[0.00024107865,0.00050605263,0.0015583386,0.000064500084,0.0004754021,0.0000015817601,0.00032076897,0.9948271,0.00091411045,0.000412364,0.0003566021,0.00032208118],"about_ca_topic_score_codex":0.00022612851,"about_ca_topic_score_gemma":0.000114708084,"teacher_disagreement_score":0.7050154,"about_ca_system_score_codex":0.00004147675,"about_ca_system_score_gemma":0.00046898262,"threshold_uncertainty_score":0.9999961},"labels":[],"label_agreement":null},{"id":"W4254506466","doi":"10.26421/qic12.1-2-4","title":"Black-box Hamiltonian simulation and unitary implementation","year":2012,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Unitary matrix; Unitary state; Hamiltonian (control theory); Black box; Scaling; Bounded function; Mathematics; Matrix (chemical analysis); Quantum; Discrete mathematics; Combinatorics; Algorithm; Computer science; Physics; Quantum mechanics; Mathematical analysis; Mathematical optimization; Geometry","score_opus":0.014309334949249205,"score_gpt":0.28782148575831357,"score_spread":0.2735121508090644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254506466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4257982,0.000063131374,0.5732594,0.0003578197,0.00016147444,0.00012858245,0.000002355859,0.000118074364,0.00011093471],"genre_scores_gemma":[0.98268604,0.000015503581,0.016586848,0.0005687055,0.00006812784,0.0000041184835,0.00006299013,0.000004690788,0.000002976688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990466,0.000063832464,0.00032884203,0.00012042972,0.00020778467,0.00023250422],"domain_scores_gemma":[0.9994106,0.00009927074,0.00016783703,0.00011157938,0.000087058,0.00012364503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033814795,0.00013437287,0.00010589283,0.00020292556,0.00025434417,0.00025576566,0.00009608134,0.00005019079,0.0000039747906],"category_scores_gemma":[0.000015237783,0.00012759812,0.00002148603,0.00024956372,0.000040515566,0.002777072,0.000102466016,0.00009955458,0.000023831773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007509792,0.000026063286,0.0024890099,0.00005957601,0.000014988756,3.5728206e-7,0.015001685,0.08816031,0.000026568738,0.06801148,0.00018195952,0.8260205],"study_design_scores_gemma":[0.00037785355,0.00006751414,0.055507295,0.000010634657,0.00000535353,0.000015747843,0.00051182596,0.9381572,0.000032751803,0.00300089,0.0021568395,0.00015610881],"about_ca_topic_score_codex":0.000032530977,"about_ca_topic_score_gemma":0.0000018977182,"teacher_disagreement_score":0.84999686,"about_ca_system_score_codex":0.000022108114,"about_ca_system_score_gemma":0.000023131914,"threshold_uncertainty_score":0.52033},"labels":[],"label_agreement":null},{"id":"W4254912965","doi":"10.1007/978-1-4939-7131-2_100703","title":"Multiplex Network","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.014174884116560283,"score_gpt":0.21661227411206685,"score_spread":0.20243738999550656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254912965","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004675525,0.00021570807,0.33846906,0.0002738759,0.0011431222,0.000105312654,0.0000017548999,0.0004931615,0.65929335],"genre_scores_gemma":[0.00013078826,0.00001669551,0.23050861,0.00089568394,0.0026682825,0.0000013581292,0.0000051879206,0.00003659992,0.7657368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984919,0.0000110211095,0.00024187886,0.00061445136,0.00028029876,0.00036049442],"domain_scores_gemma":[0.99865574,0.00008959592,0.00013356713,0.00092415337,0.00007840921,0.000118519965],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016065977,0.0003225693,0.00028659037,0.00007202994,0.00016007345,0.00015617009,0.0012518782,0.00023327014,0.0006906573],"category_scores_gemma":[0.000006211329,0.00025909027,0.00016975071,0.00004240502,0.0000790629,0.0000555391,0.00075792434,0.00035809568,0.0013488943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015178404,0.0000060693055,0.0000014043086,0.000011220552,0.00005052515,0.000045404686,0.00012567319,0.0009846842,0.0000012268997,0.6962103,0.1638138,0.13874814],"study_design_scores_gemma":[0.00006774669,0.00006108186,0.0000074977816,0.000071823364,0.0000041353287,0.000025430698,1.7340513e-7,0.22616512,0.0000031797906,0.14502744,0.6282663,0.0003001019],"about_ca_topic_score_codex":0.000005066913,"about_ca_topic_score_gemma":0.00000900507,"teacher_disagreement_score":0.55118287,"about_ca_system_score_codex":0.000018490533,"about_ca_system_score_gemma":0.000058594425,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null},{"id":"W4255257784","doi":"10.26421/qic10.7-8-7","title":"Limitations on the simulation of non-sparse Hamiltonians","year":2010,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Hamiltonian (control theory); Norm (philosophy); Quantum; Mathematics; Running time; Discrete mathematics; Combinatorics; Computer science; Applied mathematics; Statistical physics; Physics; Quantum mechanics; Algorithm; Mathematical optimization","score_opus":0.024162931550990904,"score_gpt":0.2546455599317617,"score_spread":0.23048262838077077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255257784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37795496,0.0000025115028,0.6197376,0.0012188345,0.00025060165,0.0001366488,0.0000021435699,0.000059156962,0.0006375388],"genre_scores_gemma":[0.98824704,0.0000038030691,0.011120164,0.00057134527,0.0000311769,0.00000656918,0.000011936298,0.0000034166737,0.0000045632883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917614,0.000037323083,0.00032503912,0.00010792338,0.00023435704,0.000119235614],"domain_scores_gemma":[0.9988247,0.00052238815,0.0002280878,0.0002136064,0.00016716449,0.00004402311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031106148,0.000103833605,0.000095183284,0.0001598144,0.000252667,0.00016398067,0.0002276631,0.000052241627,0.0000026005537],"category_scores_gemma":[0.000109836816,0.000074507065,0.00003896161,0.0003200062,0.000057829275,0.0005960241,0.000055576817,0.0002088962,0.000028480777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005837034,0.00002860945,0.00003950903,0.000013628838,0.0000072026783,1.9785956e-7,0.0037460576,0.55668634,0.0002290591,0.16388662,0.00014409833,0.27521282],"study_design_scores_gemma":[0.00018962554,0.000103667946,0.009158424,0.000014511583,0.000002747711,0.000004373441,0.000094089766,0.98147076,0.00018237518,0.0073551135,0.0013353282,0.000088988934],"about_ca_topic_score_codex":0.0000100308725,"about_ca_topic_score_gemma":0.0000035012097,"teacher_disagreement_score":0.6102921,"about_ca_system_score_codex":0.0000057895018,"about_ca_system_score_gemma":0.000039836254,"threshold_uncertainty_score":0.30383098},"labels":[],"label_agreement":null},{"id":"W4255445288","doi":"10.32920/ryerson.14655534","title":"A quantum future: preparing Canada for the potential impacts of quantum computing","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum computer; Qubit; Computer science; Field (mathematics); Workforce; Quantum; Computation; Management science; Political science; Engineering; Physics; Mathematics; Quantum mechanics; Algorithm; Law","score_opus":0.00860865124893279,"score_gpt":0.2359607302834835,"score_spread":0.2273520790345507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255445288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14402981,0.001908085,0.843827,0.0024198466,0.006997235,0.0005966863,0.00002345587,0.00015480474,0.00004308663],"genre_scores_gemma":[0.9497598,0.000046417896,0.048566688,0.0003503354,0.0011950795,0.0000059265562,0.000022230577,0.00003419871,0.00001935394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996591,0.0001589436,0.00078421127,0.0010133253,0.0007219851,0.00073054037],"domain_scores_gemma":[0.99653774,0.0006204705,0.0006457913,0.0016487462,0.00037876228,0.00016848915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082103343,0.0004934949,0.00069804065,0.00009665754,0.00044221498,0.00052441517,0.0027626532,0.0002208187,0.0000048876814],"category_scores_gemma":[0.0001154757,0.0003455786,0.0004471486,0.000331861,0.000063416475,0.00008345892,0.0039845,0.0008779387,2.8555425e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034807486,0.00016417046,0.00010022239,0.001333193,0.0007890419,0.00008193242,0.005084733,0.86210746,0.00048606234,0.032172937,0.009761144,0.08788429],"study_design_scores_gemma":[0.00026427762,0.000053684606,0.0012040957,0.00025929877,0.000046699093,0.0000663245,0.00040628712,0.9943521,0.0005753548,0.0016430535,0.00070825417,0.00042056906],"about_ca_topic_score_codex":0.24681301,"about_ca_topic_score_gemma":0.08287923,"teacher_disagreement_score":0.80573,"about_ca_system_score_codex":0.00012057596,"about_ca_system_score_gemma":0.0028775372,"threshold_uncertainty_score":0.9998996},"labels":[],"label_agreement":null},{"id":"W4255997198","doi":"10.24908/iqurcp.7812","title":"A Comparison of Quantum Cryptography Protocols","year":2017,"lang":"en","type":"article","venue":"Inquiry Queen s Undergraduate Research Conference Proceedings","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"BB84; Quantum key distribution; Quantum cryptography; Computer science; Theoretical computer science; Quantum computer; Cryptography; Cryptographic protocol; Eavesdropping; Protocol (science); Key (lock); Encryption; Quantum; Quantum information; Computer security; Quantum mechanics; Physics","score_opus":0.1589706987060277,"score_gpt":0.44549375902126265,"score_spread":0.28652306031523495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255997198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25263166,0.00011153472,0.65945005,0.061058022,0.00075444794,0.013750595,0.000011447249,0.00089708075,0.011335132],"genre_scores_gemma":[0.9771662,0.00002920018,0.021422353,0.000027500993,0.00020442814,0.0010466535,0.000001434253,0.000029041072,0.00007320097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949778,0.00013630997,0.00074078876,0.0010420299,0.001912705,0.001190395],"domain_scores_gemma":[0.9950303,0.00025052286,0.00070212275,0.0013310695,0.0023078318,0.00037814435],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024838836,0.00036635427,0.0006910326,0.00070194993,0.0016427934,0.002418578,0.0058514965,0.00019320016,0.0000071741824],"category_scores_gemma":[0.0008249955,0.00031930296,0.00019901808,0.00078605645,0.0016953861,0.0012300985,0.0022315087,0.0012226399,0.00003717022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005401048,0.0003835898,0.0228466,0.0003492704,0.00006769303,0.000012874395,0.0056425775,0.000024329534,0.004618614,0.92045605,0.0035920176,0.041952386],"study_design_scores_gemma":[0.00095558976,0.0012891456,0.010527612,0.0010680336,0.000007916717,0.000018201728,0.0006919456,0.4435162,0.016939973,0.5187258,0.0056280512,0.00063149893],"about_ca_topic_score_codex":0.00024664673,"about_ca_topic_score_gemma":0.0000047183657,"teacher_disagreement_score":0.7245345,"about_ca_system_score_codex":0.00005738413,"about_ca_system_score_gemma":0.0004851137,"threshold_uncertainty_score":0.9999259},"labels":[],"label_agreement":null},{"id":"W4280494273","doi":"10.1021/acs.jctc.2c00162","title":"Toward Quantum Computing with Molecular Electronics","year":2022,"lang":"en","type":"article","venue":"Journal of Chemical Theory and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Canadian Institute for Advanced Research; University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Qubit; Molecular electronics; Quantum computer; Electronics; Construct (python library); Quantum gate; Quantum; Molecule; Computer science; Hydrogen molecule; Physics; Nanotechnology; Quantum mechanics; Materials science; Electrical engineering; Engineering","score_opus":0.006744675397894933,"score_gpt":0.2315238698281768,"score_spread":0.22477919443028185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280494273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48232692,0.0003673724,0.5168588,0.00031140939,0.00006769143,0.000024481446,2.2341264e-7,0.000017864251,0.000025229285],"genre_scores_gemma":[0.97263485,0.0000032752066,0.026969567,0.0003182667,0.00006335475,5.5332634e-7,9.58001e-7,0.0000075552994,0.0000016020172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987828,0.00025989406,0.00026713623,0.00016245423,0.00034896447,0.00017871255],"domain_scores_gemma":[0.99917406,0.00028561524,0.00028941227,0.00008628813,0.000087444765,0.00007720776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009389559,0.000106861546,0.00018593666,0.00008838797,0.00013812959,0.00007557901,0.00036277922,0.0000213946,0.0000024505948],"category_scores_gemma":[0.00002765293,0.00008512685,0.00006384213,0.00026615994,0.000041485422,0.00010663666,0.00021583585,0.00046230937,2.5743194e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038831515,0.0002209153,0.000037596175,0.00004271615,0.00014237851,0.00032102398,0.0033570826,0.28077316,0.026397198,0.40155062,0.00008780911,0.28668118],"study_design_scores_gemma":[0.0007804634,0.0008281235,0.000037868802,0.00003222143,0.000020195537,0.0026663102,0.00013880052,0.6850168,0.011173609,0.29883054,0.00027995044,0.00019513836],"about_ca_topic_score_codex":2.8399774e-7,"about_ca_topic_score_gemma":5.374338e-9,"teacher_disagreement_score":0.49030793,"about_ca_system_score_codex":0.000038417802,"about_ca_system_score_gemma":0.00007944475,"threshold_uncertainty_score":0.3471372},"labels":[],"label_agreement":null},{"id":"W4280506738","doi":"10.48550/arxiv.2205.07113","title":"Fidelity overhead for non-local measurements in variational quantum algorithms","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Compute Canada","keywords":"Pauli exclusion principle; Qubit; Fidelity; Observable; Algorithm; Quantum; Mathematics; Quantum algorithm; Estimator; Ising model; Unitary state; Computer science; Statistical physics; Quantum mechanics; Physics; Statistics","score_opus":0.08078720196837035,"score_gpt":0.22375215457321984,"score_spread":0.14296495260484948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280506738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07960846,0.000035199097,0.9175526,0.00021318052,0.0015333351,0.00057380507,0.000078298835,0.00015393631,0.00025117572],"genre_scores_gemma":[0.9731228,0.000012372074,0.026232291,0.00017588321,0.00015038265,0.000009470188,0.00007308545,0.000024831563,0.0001989079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997002,0.00022304879,0.00038101626,0.001541174,0.00029503435,0.000557704],"domain_scores_gemma":[0.99807805,0.0002504401,0.0003047425,0.0010286076,0.00017951804,0.00015865896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010206781,0.00038886158,0.00044863395,0.00037896188,0.00032490515,0.000119035925,0.0021878039,0.00023343264,0.0000373782],"category_scores_gemma":[0.000058930826,0.00046755295,0.00031100234,0.000704598,0.00007405564,0.00020174548,0.0026891122,0.00094454555,0.000010029502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036067697,0.00020205262,0.001322299,0.00006847799,0.000066653505,0.00006311828,0.0002698687,0.96571213,0.000008740742,0.028724177,0.0002832108,0.003243231],"study_design_scores_gemma":[0.0009237195,0.00009502541,0.0069098226,0.000060120507,0.00002089848,0.0000035909936,0.000033133572,0.9162633,0.000012894063,0.07466932,0.0005505359,0.0004576662],"about_ca_topic_score_codex":0.0004822143,"about_ca_topic_score_gemma":0.00005639503,"teacher_disagreement_score":0.89351434,"about_ca_system_score_codex":0.00058669783,"about_ca_system_score_gemma":0.000564783,"threshold_uncertainty_score":0.9997776},"labels":[],"label_agreement":null},{"id":"W4280542476","doi":"10.22323/1.396.0327","title":"Using classical bit-flip correction for error mitigation in quantum computations including 2-qubit correlations","year":2022,"lang":"en","type":"article","venue":"Proceedings of The 38th International Symposium on Lattice Field Theory — PoS(LATTICE2021)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Nuclear Physics; European Regional Development Fund; Office of Science; Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Research and Innovation Foundation; Industry Canada; European Commission; National Science Foundation; Government of Canada; U.S. Department of Energy","keywords":"Qubit; Quantum computer; Computer science; Error detection and correction; Quantum; Quantum error correction; Computation; Algorithm; Electronic engineering; Computer engineering; Theoretical computer science; Physics; Quantum mechanics; Engineering","score_opus":0.02773470482473975,"score_gpt":0.2968713207689064,"score_spread":0.2691366159441666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280542476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7724585,0.000042752086,0.18588012,0.026654264,0.010253307,0.0011647623,0.000052107225,0.00019701148,0.0032971716],"genre_scores_gemma":[0.9862095,0.000002224747,0.011972246,0.0009978118,0.00028933302,0.00008754523,0.000011373014,0.00002757084,0.00040241124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767005,0.0001129178,0.0006417657,0.0005532853,0.00068172294,0.00034022666],"domain_scores_gemma":[0.99717116,0.0016231161,0.00057424884,0.00022508476,0.000333834,0.000072558585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011588525,0.00024463268,0.00026210403,0.00033274008,0.00083585,0.00017832589,0.0013641546,0.00010202169,0.000033766195],"category_scores_gemma":[0.0005528419,0.00022458081,0.00022544562,0.0007443755,0.00009440599,0.0004301165,0.00077423785,0.0007211445,0.0000031703216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002451869,0.00046397588,0.002711164,0.000057469933,0.00011056504,0.0000020845437,0.0033118648,0.24056509,0.0068550487,0.7405542,0.00073693634,0.0043863878],"study_design_scores_gemma":[0.0006213509,0.00027361506,0.0013166841,0.00017577669,0.000038582657,0.000055173918,0.00042614742,0.9475776,0.0023337873,0.04605753,0.00087999867,0.00024377243],"about_ca_topic_score_codex":0.00003479538,"about_ca_topic_score_gemma":0.0000038485155,"teacher_disagreement_score":0.7070125,"about_ca_system_score_codex":0.0002891838,"about_ca_system_score_gemma":0.000094793606,"threshold_uncertainty_score":0.915814},"labels":[],"label_agreement":null},{"id":"W4280637162","doi":"10.21203/rs.3.rs-1626827/v1","title":"Retrodictive Quantum Computing","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.04784844941832926,"score_gpt":0.37096394609197714,"score_spread":0.32311549667364786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280637162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32191053,0.005603091,0.63143146,0.010591035,0.007674237,0.0035343554,0.00024068673,0.0032963234,0.015718268],"genre_scores_gemma":[0.9688822,0.000092463655,0.02919485,0.00013684138,0.0010411713,0.00009278102,0.000081105936,0.00007744534,0.0004011191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910597,0.0020408912,0.0005330281,0.0019135585,0.0029686068,0.00148419],"domain_scores_gemma":[0.99513334,0.0011326481,0.00023525575,0.0025576393,0.00059455534,0.00034656393],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00473599,0.00045849095,0.0005778852,0.0010092002,0.0016426442,0.0009808927,0.005224616,0.0002940802,0.00010837514],"category_scores_gemma":[0.00047633421,0.00044832163,0.00036486072,0.0016761122,0.00022162427,0.00012740036,0.024762828,0.00739275,0.00009292457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008992565,0.0012159519,0.0037607462,0.002783293,0.00049171504,0.0024598853,0.026738431,0.28819856,0.00026077274,0.33792704,0.038998384,0.29707527],"study_design_scores_gemma":[0.00022345482,0.00037131563,0.0050374563,0.00039619196,0.0000041070616,0.000028543483,0.00030100715,0.9368017,0.00003642208,0.04127342,0.015013168,0.00051326584],"about_ca_topic_score_codex":0.00032511988,"about_ca_topic_score_gemma":0.0000049960204,"teacher_disagreement_score":0.6486031,"about_ca_system_score_codex":0.00054110255,"about_ca_system_score_gemma":0.00096847286,"threshold_uncertainty_score":0.99979687},"labels":[],"label_agreement":null},{"id":"W4281693755","doi":"10.21203/rs.3.rs-1421702/v1","title":"Quantum Analysis of Squiggle Data","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Ministero dello Sviluppo Economico","keywords":"Computer science","score_opus":0.10828842728567879,"score_gpt":0.41357987010398517,"score_spread":0.3052914428183064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281693755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3710718,0.010131564,0.59458035,0.0072888522,0.0031829663,0.002649315,0.005145935,0.0011028645,0.0048463754],"genre_scores_gemma":[0.97017616,0.00024845492,0.02729808,0.0000451086,0.00026387128,0.00006754017,0.0015458618,0.00004349732,0.00031141602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928059,0.0013150672,0.0005756251,0.0017636353,0.0027373668,0.0008023906],"domain_scores_gemma":[0.9903528,0.0010070734,0.00026492815,0.0077131726,0.00045360054,0.00020841829],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0051959,0.00028467903,0.0007831533,0.002427156,0.00043491693,0.00035230038,0.0116581265,0.00018242304,0.0003086518],"category_scores_gemma":[0.00047593925,0.00026533374,0.0003803574,0.005565858,0.00018459944,0.00014525099,0.047988605,0.0027008199,0.000014400359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005469395,0.0014178375,0.006916549,0.002297641,0.0056490167,0.0005273701,0.006674863,0.74346536,0.00021912785,0.075585686,0.023826668,0.1333652],"study_design_scores_gemma":[0.00009688144,0.00014072968,0.006876788,0.000102384445,0.00009227932,0.0000022034533,0.00010909633,0.97592545,0.000024550445,0.006312451,0.010057258,0.0002599582],"about_ca_topic_score_codex":0.0010271714,"about_ca_topic_score_gemma":0.000052901138,"teacher_disagreement_score":0.5991044,"about_ca_system_score_codex":0.0001289148,"about_ca_system_score_gemma":0.00081994425,"threshold_uncertainty_score":0.9999799},"labels":[],"label_agreement":null},{"id":"W4281728941","doi":"10.1145/3470496.3527434","title":"EQC","year":2022,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"U.S. Department of Energy","keywords":"Computer science; Parameterized complexity; Quantum computer; Software deployment; Quantum; Computer engineering; Noise (video); Scale (ratio); Quantum circuit; Theoretical computer science; Computational science; Distributed computing; Algorithm; Artificial intelligence; Quantum error correction; Software engineering; Physics; Quantum mechanics","score_opus":0.007384821319176359,"score_gpt":0.20905499718375228,"score_spread":0.20167017586457592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281728941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035848368,0.00005685907,0.9386419,0.0043081087,0.0006300687,0.000045373035,6.9537583e-7,0.00047339735,0.01999523],"genre_scores_gemma":[0.90042526,2.5363494e-7,0.09617221,0.0016184888,0.000045276345,0.0000064037877,4.4951398e-7,0.0000030659503,0.0017285999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995133,0.000030366511,0.00004953579,0.00014354431,0.00014916164,0.00011406763],"domain_scores_gemma":[0.99970484,0.00002261347,0.000013062897,0.00022650375,0.0000055796504,0.000027427031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011566288,0.00003537821,0.000035979458,0.00003506867,0.00025050418,0.000036219368,0.0005947717,0.0000037877642,0.00014740645],"category_scores_gemma":[0.0000026763369,0.000030352498,0.000025144394,0.00021769681,0.000005360393,0.000034259996,0.0007229123,0.000102201586,0.00002225488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001103806,0.00007176929,0.00012586165,0.0000020349644,0.000007401033,0.000052014362,0.0008519077,0.042282656,0.000382254,0.49363557,0.018706106,0.44388133],"study_design_scores_gemma":[0.0000653018,0.0000531992,0.00022895755,2.817094e-7,2.5570046e-7,0.00005456647,0.000012663894,0.88063365,0.00011598024,0.008849146,0.10991852,0.00006746562],"about_ca_topic_score_codex":0.000009379624,"about_ca_topic_score_gemma":2.523392e-7,"teacher_disagreement_score":0.8645769,"about_ca_system_score_codex":0.0000094391135,"about_ca_system_score_gemma":0.000017808712,"threshold_uncertainty_score":0.1926701},"labels":[],"label_agreement":null},{"id":"W4281754476","doi":"10.5194/isprs-archives-xliii-b4-2022-419-2022","title":"EXPLORING QUANTUM COMPUTING POTENTIALS IN SOLVING A COMBINATORIAL OPTIMIZATION PROBLEM TO MINIMIZE EXPOSURE TO COVID-19 DURING A CITY JOURNEY","year":2022,"lang":"en","type":"article","venue":"˜The œinternational archives of the photogrammetry, remote sensing and spatial information sciences/International archives of the photogrammetry, remote sensing and spatial information sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Systems, Applications & Products in Data Processing (Canada); York University","funders":"","keywords":"Computer science; Quantum annealing; Solver; Queue; Quantum; Optimization problem; Mathematical optimization; Quantum computer; Set (abstract data type); Algorithm; Computer network; Mathematics","score_opus":0.03302786695647256,"score_gpt":0.2626302469108718,"score_spread":0.22960237995439922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281754476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050013907,0.000014133864,0.9370398,0.008509277,0.0027010085,0.00088879693,0.000051330586,0.000074923184,0.0007068381],"genre_scores_gemma":[0.9647924,0.000032002437,0.033293903,0.001689197,0.00014833904,0.0000013274009,0.0000144353935,0.000011907982,0.000016491795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942517,0.00061427813,0.0016380583,0.0005850756,0.0022438588,0.0006670098],"domain_scores_gemma":[0.99633133,0.0011409491,0.0014476822,0.0005371302,0.00023709197,0.0003058357],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027180654,0.00042211293,0.000480597,0.0016828431,0.002687407,0.0011469605,0.0028300253,0.000055746834,0.0000052951013],"category_scores_gemma":[0.00119851,0.00030507462,0.00030893012,0.0021273997,0.00084429735,0.0006223582,0.003363538,0.00061988,0.0000010890132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011830302,0.000022102417,0.0001641201,0.000029450277,0.00003271228,8.8431614e-7,0.009534777,0.36072138,0.00091410143,0.000017267244,0.000011095647,0.6284338],"study_design_scores_gemma":[0.0010395463,0.00021781707,0.0028137525,0.00029278547,0.000015760343,0.00019709852,0.0025816646,0.9859249,0.0015934185,0.0042106477,0.00075428945,0.00035830218],"about_ca_topic_score_codex":0.60460603,"about_ca_topic_score_gemma":0.03487593,"teacher_disagreement_score":0.9147785,"about_ca_system_score_codex":0.00013489334,"about_ca_system_score_gemma":0.00040113187,"threshold_uncertainty_score":0.99994016},"labels":[],"label_agreement":null},{"id":"W4281914514","doi":"10.1145/3470496.3527394","title":"2QAN","year":2022,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Compiler; Quantum circuit; Qubit; Quantum computer; Parallel computing; Quantum gate; Netlist; Optimizing compiler; Controlled NOT gate; Quantum; Computer engineering; Quantum error correction; Embedded system; Programming language","score_opus":0.007032538250798662,"score_gpt":0.20769024391939284,"score_spread":0.20065770566859417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281914514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049059037,0.00005318032,0.9203733,0.0049804896,0.00069086865,0.000051985222,7.801301e-7,0.00053497456,0.024255358],"genre_scores_gemma":[0.9047375,2.205025e-7,0.09210038,0.001471931,0.000042689822,0.0000059644617,4.5510677e-7,0.0000029811274,0.0016379268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999512,0.00003142417,0.000049829123,0.00014464484,0.0001478168,0.00011429356],"domain_scores_gemma":[0.9997022,0.000020391304,0.000013183277,0.0002299979,0.0000054180896,0.000028791006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011484187,0.000035809608,0.00003613781,0.00003630168,0.0002584603,0.000036921287,0.000597998,0.0000037681712,0.00012436182],"category_scores_gemma":[0.0000024547453,0.000030818857,0.000025136585,0.00021867878,0.0000054306256,0.00003283144,0.0006801076,0.000102902486,0.000016949354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.810376e-7,0.00006880486,0.00016567508,0.0000018399151,0.0000068637937,0.000045807265,0.0008940844,0.032649036,0.0002915054,0.50929046,0.013243189,0.44334176],"study_design_scores_gemma":[0.00006815219,0.00005920058,0.0003987767,2.9197295e-7,2.670583e-7,0.000057858782,0.000015126442,0.8735564,0.00011747395,0.008877609,0.11677718,0.00007169778],"about_ca_topic_score_codex":0.000010315035,"about_ca_topic_score_gemma":3.1613115e-7,"teacher_disagreement_score":0.8556784,"about_ca_system_score_codex":0.000009287249,"about_ca_system_score_gemma":0.000017683356,"threshold_uncertainty_score":0.19878936},"labels":[],"label_agreement":null},{"id":"W4283210744","doi":"10.48550/arxiv.2206.08581","title":"Optimal and robust experiment design for quantum state tomography of star-topology register","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum tomography; Topology (electrical circuits); Quantum state; Computer science; POVM; Algorithm; Robustness (evolution); Quantum computer; Quantum information; Hilbert space; One-way quantum computer; Quantum; Quantum algorithm; Quantum error correction; Quantum process; Physics; Mathematics; Quantum mechanics; Quantum dynamics","score_opus":0.06874215297289295,"score_gpt":0.20903134561727718,"score_spread":0.14028919264438422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283210744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37224284,0.00019443268,0.6266348,0.00008672531,0.00035842042,0.00035141606,0.000026923468,0.00007726985,0.00002719147],"genre_scores_gemma":[0.87965286,0.00008992969,0.11987957,0.000056319048,0.00003745822,0.000005465196,0.000010454674,0.000022331466,0.00024558586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792606,0.00023778382,0.00025759297,0.0010909948,0.00009821565,0.0003893426],"domain_scores_gemma":[0.998292,0.0002468815,0.00035167264,0.0008835687,0.00009891794,0.00012692857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039822405,0.00030770167,0.0004345859,0.0003546701,0.00022097933,0.00006390584,0.0012645553,0.00012479025,0.000015199948],"category_scores_gemma":[0.000013536501,0.0003374728,0.00022622201,0.00034342372,0.00022287254,0.000096967044,0.002444159,0.00041636403,5.793273e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098882396,0.00008749655,0.00013105404,0.00009176218,0.00010304017,0.00008271731,0.0010001675,0.97456485,0.000044160224,0.023133999,0.00017950796,0.00048234267],"study_design_scores_gemma":[0.0005446399,0.0004909237,0.00017158153,0.000038932925,0.000033062737,0.000008269486,0.00014968937,0.9811175,0.00030423983,0.016336076,0.00044793976,0.00035717015],"about_ca_topic_score_codex":0.000111987014,"about_ca_topic_score_gemma":0.000003638618,"teacher_disagreement_score":0.50741005,"about_ca_system_score_codex":0.00006387842,"about_ca_system_score_gemma":0.0001478179,"threshold_uncertainty_score":0.99990773},"labels":[],"label_agreement":null},{"id":"W4283584390","doi":"10.1038/s41534-022-00580-w","title":"Error measurements for a quantum annealer using the one-dimensional Ising model with twisted boundaries","year":2022,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; D-Wave Systems (Canada)","funders":"Engineering and Physical Sciences Research Council; University of Southern California; Lockheed Martin","keywords":"Physics; Qubit; Ising model; Quantum mechanics; Statistical physics; Quantum","score_opus":0.060124033131456193,"score_gpt":0.2700640119448669,"score_spread":0.2099399788134107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283584390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2870675,0.000040998777,0.71042794,0.0013133952,0.0004322311,0.00048138323,0.000028646029,0.00015839182,0.000049516722],"genre_scores_gemma":[0.9326995,3.5593698e-7,0.065847754,0.0012372442,0.000056126595,0.00006999456,0.00005979283,0.000016346008,0.0000129121545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977444,0.00010549508,0.00045695313,0.00024611558,0.001012027,0.00043503474],"domain_scores_gemma":[0.99872655,0.00009356254,0.00037369612,0.00046346753,0.0002740846,0.00006865129],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010089267,0.00021825575,0.00019913701,0.00018472728,0.0029792078,0.00071836996,0.00070082204,0.00004543581,0.0000061834708],"category_scores_gemma":[0.000045758356,0.00016059598,0.00008186338,0.00048144851,0.00011006262,0.0012795933,0.000346945,0.00033133765,0.000004006853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012476777,0.000051478015,0.000030835916,0.000032660573,0.000040635536,8.9035836e-7,0.0057137627,0.96690875,0.00030782187,0.022177799,0.00053521106,0.004075394],"study_design_scores_gemma":[0.00068825285,0.0001955254,0.00010987542,0.00003282838,0.000019534884,0.0000817316,0.00025032746,0.9893145,0.00009011532,0.0044883844,0.004475487,0.00025343164],"about_ca_topic_score_codex":0.00006905705,"about_ca_topic_score_gemma":0.000007416502,"teacher_disagreement_score":0.64563197,"about_ca_system_score_codex":0.00015908884,"about_ca_system_score_gemma":0.0005165871,"threshold_uncertainty_score":0.9983188},"labels":[],"label_agreement":null},{"id":"W4283766420","doi":"10.1103/physreva.105.032433","title":"Automatic depth optimization for a quantum approximate optimization algorithm","year":2022,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Optimization algorithm; Algorithm; Computer science; Quantum; Quantum algorithm; Mathematical optimization; Mathematics; Physics; Quantum mechanics","score_opus":0.014193623227811347,"score_gpt":0.3203485097594952,"score_spread":0.3061548865316838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283766420","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015125535,0.021905396,0.9702276,0.0026826197,0.00030863206,0.0026849837,0.00004360043,0.0005195779,0.00011505195],"genre_scores_gemma":[0.046636388,0.035148248,0.899057,0.011885664,0.0013803961,0.0051067304,0.0004963004,0.0002382799,0.000051022882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552715,0.0006452451,0.0008269582,0.0011654156,0.0010677443,0.00076746143],"domain_scores_gemma":[0.99706113,0.00057416904,0.0006418769,0.0011952106,0.00023531541,0.00029231678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009228996,0.0005788943,0.0014457724,0.00009884696,0.00065355614,0.00014414689,0.0016658668,0.000029745288,0.000042721498],"category_scores_gemma":[0.00039470755,0.00048701977,0.00087106397,0.0017987598,0.00007846263,0.0004010328,0.00089307275,0.00056883873,0.00003405275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005572127,0.001625134,0.0000023535176,0.007965053,0.00009192517,0.000012539211,0.0002001704,0.37419674,0.00013457834,0.02733941,0.0034538473,0.5849727],"study_design_scores_gemma":[0.0003529325,0.00041269732,0.0000062401887,0.0024490058,0.00018588193,0.000028197026,0.000004051404,0.97768706,0.00009822974,0.012495916,0.005701948,0.0005778126],"about_ca_topic_score_codex":0.0000066033017,"about_ca_topic_score_gemma":1.6731335e-7,"teacher_disagreement_score":0.60349035,"about_ca_system_score_codex":0.00014470228,"about_ca_system_score_gemma":0.00016526895,"threshold_uncertainty_score":0.9997581},"labels":[],"label_agreement":null},{"id":"W4285140607","doi":"10.4086/toc.2022.v018a011","title":"","year":2022,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"QuantERA; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Quantum phase estimation algorithm; Quantum computer; Span (engineering); Bounded function; Upper and lower bounds; Monotone polygon; Mathematics; Function (biology); Quantum algorithm; Logarithm; Discrete mathematics; Quantum; Quantum error correction; Mathematical analysis; Quantum mechanics","score_opus":0.009913898574620694,"score_gpt":0.22427593235993795,"score_spread":0.21436203378531726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285140607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5089544,0.00011735241,0.48973918,0.0003336504,0.00036123928,0.000102325976,0.0000015386499,0.00029336748,0.00009694968],"genre_scores_gemma":[0.9075083,4.972258e-7,0.0918052,0.0005543466,0.00009434019,0.000004815241,0.0000015353155,0.000017107634,0.000013865825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571276,0.0014445921,0.00068562606,0.00067041913,0.00082268054,0.0006639296],"domain_scores_gemma":[0.996784,0.0014039566,0.00052790786,0.0010691506,0.000088398396,0.00012660117],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004838035,0.0002632325,0.00045359888,0.00032746358,0.0015702937,0.00007836512,0.003717666,0.000025482044,0.000010459785],"category_scores_gemma":[0.000094454306,0.00027011696,0.0002264794,0.0012578012,0.00013912965,0.00019534829,0.005215824,0.0006285315,6.972823e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002536797,0.00012668363,0.00039437786,0.00001601652,0.000028861847,0.000026916834,0.012688394,0.46163464,0.0017381216,0.34554502,0.000009713724,0.17776589],"study_design_scores_gemma":[0.000618002,0.0004572922,0.004351058,0.000021434349,0.000005933466,0.00026707354,0.00068976893,0.8308975,0.002212883,0.16004129,0.00012944333,0.00030832583],"about_ca_topic_score_codex":0.000017075623,"about_ca_topic_score_gemma":2.3680099e-7,"teacher_disagreement_score":0.3985539,"about_ca_system_score_codex":0.00005159619,"about_ca_system_score_gemma":0.00010633762,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W4285390635","doi":"10.1103/prxquantum.3.030101","title":"Is Quantum Advantage the Right Goal for Quantum Machine Learning?","year":2022,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":199,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Computer science; Perspective (graphical); Quantum machine learning; Quantum; Narrative; Focus (optics); Artificial intelligence; Machine learning; Quantum computer; Cognitive science; Psychology; Physics","score_opus":0.010018543724149509,"score_gpt":0.24888405932460636,"score_spread":0.23886551560045685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285390635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19229376,0.0050215614,0.7476642,0.041748416,0.0076474138,0.002386158,0.00039004345,0.0020114544,0.0008369792],"genre_scores_gemma":[0.9889994,0.000049577597,0.0056364504,0.0031041547,0.00048440765,0.0002994218,0.000056863275,0.00009271814,0.0012770067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956225,0.00053655443,0.00063861755,0.0011397955,0.00094624265,0.0011162874],"domain_scores_gemma":[0.9970978,0.00090330304,0.00040112127,0.0012718984,0.000117828466,0.00020808502],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016608207,0.0005078634,0.00050321844,0.00023198531,0.003025312,0.00035057028,0.0031852957,0.000085051586,0.00021505498],"category_scores_gemma":[0.00016056621,0.00037091548,0.00045501353,0.00089991925,0.00015076406,0.00026284167,0.0017377612,0.0013604088,0.00007456575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021265245,0.0007199872,0.0013935646,0.00015977825,0.00023836488,0.00018675797,0.008387986,0.02101063,0.0013504552,0.9018527,0.036060754,0.028426362],"study_design_scores_gemma":[0.0005749598,0.0006031116,0.00025707192,0.000012283276,0.000018527693,0.0001408692,0.00012887499,0.66853404,0.00019744973,0.035727374,0.29340696,0.00039849462],"about_ca_topic_score_codex":0.00010736467,"about_ca_topic_score_gemma":0.000008409556,"teacher_disagreement_score":0.86612535,"about_ca_system_score_codex":0.000101568774,"about_ca_system_score_gemma":0.00018151398,"threshold_uncertainty_score":0.9998743},"labels":[],"label_agreement":null},{"id":"W4285800031","doi":"10.1103/physreva.106.012421","title":"Blind quantum factorization of 21","year":2022,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Australian Research Council; Indian Institute of Technology Kanpur; University of Calgary; Shastri Indo-Canadian Institute","keywords":"Factorization; Computer science; Integer factorization; Scheme (mathematics); Quantum; Verifiable secret sharing; Quantum computer; Theoretical computer science; Algebra over a field; Mathematics; Pure mathematics; Algorithm; Physics; Encryption; Quantum mechanics; Computer network; Public-key cryptography","score_opus":0.017736756505011577,"score_gpt":0.3379044504636678,"score_spread":0.32016769395865624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285800031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27596653,0.19159587,0.5121398,0.012273276,0.0014283675,0.0041321386,0.00011815088,0.0006914765,0.0016543958],"genre_scores_gemma":[0.9748901,0.02037038,0.0014050695,0.0025921043,0.00044845138,0.00018520652,0.000036926904,0.000039815048,0.000031945052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961025,0.0006374493,0.00070405117,0.00082126504,0.0012340761,0.0005006557],"domain_scores_gemma":[0.9973608,0.00046275687,0.000569715,0.001204436,0.00017472355,0.00022755611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006095188,0.00040363864,0.0013359307,0.000071874834,0.00026770742,0.000040805735,0.001727192,0.000019300458,0.000036889895],"category_scores_gemma":[0.0004167643,0.00032289405,0.0007703268,0.0019070752,0.00009061048,0.00022775229,0.0011058501,0.00069520425,0.000086588334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032953656,0.0046509686,0.00017410146,0.01792221,0.00021535107,0.000048689282,0.0010020296,0.0014902081,0.029937612,0.445131,0.011964145,0.48743072],"study_design_scores_gemma":[0.00090674567,0.0015085316,0.0007755254,0.009612859,0.00038030473,0.000046003537,0.000009831802,0.61464965,0.0054271095,0.19392167,0.17126776,0.0014940029],"about_ca_topic_score_codex":0.000013472882,"about_ca_topic_score_gemma":2.426753e-7,"teacher_disagreement_score":0.6989236,"about_ca_system_score_codex":0.00006702993,"about_ca_system_score_gemma":0.00014104444,"threshold_uncertainty_score":0.99992234},"labels":[],"label_agreement":null},{"id":"W4285814863","doi":"10.1109/icccas55266.2022.9824836","title":"Quantum Encrypted Communication between Two IBMQ Systems Using Quantum Permutation Pad","year":2022,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Controlled NOT gate; Computer science; Quantum computer; Qubit; Encryption; Theoretical computer science; Algorithm; Permutation (music); Quantum algorithm; Quantum cryptography; Quantum error correction; Quantum; Quantum information; Computer engineering; Computer network; Physics; Quantum mechanics","score_opus":0.029760961454855434,"score_gpt":0.2800938870794293,"score_spread":0.2503329256245739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285814863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50540286,0.0002966577,0.49252754,0.0005468486,0.00044882213,0.000214282,0.00000701472,0.00037772235,0.00017824155],"genre_scores_gemma":[0.9783972,0.0000039918,0.021220285,0.00012898135,0.000120590776,0.000023011225,0.00003912536,0.000020619516,0.000046194855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973563,0.00072435883,0.00045952667,0.00047839555,0.0005933749,0.0003880658],"domain_scores_gemma":[0.9983077,0.00031284796,0.00018936233,0.0009785031,0.000105787425,0.000105809646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008387475,0.00020762485,0.00027191875,0.00023046129,0.0012822562,0.00031399415,0.0015165397,0.0000396471,0.000023012248],"category_scores_gemma":[0.000029177998,0.00019935194,0.00009307071,0.00084381166,0.000049383772,0.00029727397,0.0010816691,0.00046601196,0.000015996467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009034631,0.00015317237,0.0036429625,0.00004799214,0.000083389015,0.000025434487,0.005032746,0.66630334,0.00250258,0.30565223,0.0005146049,0.016032534],"study_design_scores_gemma":[0.00034722596,0.000101600046,0.0014899097,0.000022975448,0.000011856959,0.00006903492,0.0003967835,0.99050987,0.00010877921,0.0055601443,0.0011051655,0.00027667455],"about_ca_topic_score_codex":0.0011487707,"about_ca_topic_score_gemma":0.0000042722677,"teacher_disagreement_score":0.47299433,"about_ca_system_score_codex":0.00014965946,"about_ca_system_score_gemma":0.00011930035,"threshold_uncertainty_score":0.9862208},"labels":[],"label_agreement":null},{"id":"W4286545584","doi":"10.48550/arxiv.2110.07482","title":"Large scale multi-node simulations of $\\\\mathbb{Z}_2$ gauge theory\\n quantum circuits using Google Cloud Platform","year":2021,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum computer; Observable; Cloud computing; Quantum simulator; Qubit; Quantum information; Quantum; Theoretical computer science; Field (mathematics); Computational science; Computer engineering; Topology (electrical circuits); Physics; Quantum mechanics; Mathematics","score_opus":0.07504576330190722,"score_gpt":0.22182095026625437,"score_spread":0.14677518696434716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286545584","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5039538,0.00019295204,0.4935417,0.000016797601,0.0014515622,0.0003655334,0.00020756436,0.00013342123,0.00013666645],"genre_scores_gemma":[0.98636067,0.0001157257,0.012463394,0.0000984914,0.0003126404,5.49142e-7,0.00008476109,0.00009345421,0.00047030888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99316317,0.00075817714,0.0011540736,0.0029526253,0.0004345027,0.0015374314],"domain_scores_gemma":[0.9932111,0.0008424175,0.0014337887,0.0031024925,0.0008246984,0.000585502],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012472495,0.0011425194,0.0014887669,0.0007415129,0.0013958623,0.00041849323,0.0033837087,0.0008585063,0.00015427233],"category_scores_gemma":[0.00018388784,0.0013635216,0.0011024072,0.0025796501,0.0005744445,0.00080265116,0.0050594243,0.0018804459,0.00004010913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035964975,0.0010157458,0.0014174023,0.00033149062,0.00030689433,0.00036744762,0.006299525,0.8962819,0.00078118447,0.09233277,0.000006913596,0.0008227808],"study_design_scores_gemma":[0.0019520959,0.000109813445,0.0013013588,0.0010458115,0.00032915422,0.00005331547,0.0013630908,0.9734452,0.000527179,0.018354725,0.00018786029,0.0013304178],"about_ca_topic_score_codex":0.00030826923,"about_ca_topic_score_gemma":0.00013880302,"teacher_disagreement_score":0.48240685,"about_ca_system_score_codex":0.00041380667,"about_ca_system_score_gemma":0.0010732994,"threshold_uncertainty_score":0.99990416},"labels":[],"label_agreement":null},{"id":"W4286566616","doi":"10.1016/j.laa.2022.07.009","title":"Quantum walks do not like bridges","year":2022,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Quantum walk; Lemma (botany); Combinatorics; Conjecture; Eigenvalues and eigenvectors; Interlacing; Vertex (graph theory); Discrete mathematics; Quantum; Graph; Quantum algorithm; Quantum mechanics","score_opus":0.011210407523637738,"score_gpt":0.2382020815660956,"score_spread":0.22699167404245785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286566616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26699758,0.0022160234,0.7153376,0.0126441065,0.0004919043,0.000795538,0.000088403096,0.000733183,0.0006956885],"genre_scores_gemma":[0.987857,0.000050444436,0.009827068,0.0014040254,0.00022675656,0.00020434297,0.000015339094,0.000015250033,0.0003998115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988675,0.0000475084,0.00017899105,0.0004445065,0.00023051533,0.00023094466],"domain_scores_gemma":[0.99924386,0.00010080264,0.00006871887,0.00044071797,0.00004009525,0.000105809595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017404227,0.00012436732,0.00012573619,0.00008343555,0.00080621406,0.000108047825,0.00065565144,0.000027569962,0.00003006398],"category_scores_gemma":[0.000006470175,0.000118949865,0.000050538234,0.0004101995,0.00002805714,0.00008581168,0.0006810169,0.00026884727,0.000043748383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049863356,0.00018815944,0.000079161175,0.000024803096,0.000025289735,0.000006888676,0.0011713553,0.0027344758,0.0014606097,0.80643,0.0020513998,0.18582286],"study_design_scores_gemma":[0.0001573382,0.00007084871,0.0008141663,0.0000031047814,0.0000056614904,0.000059099184,0.000040973777,0.7633834,0.00029666832,0.006133489,0.22884528,0.0001899983],"about_ca_topic_score_codex":0.0000109239545,"about_ca_topic_score_gemma":6.071947e-7,"teacher_disagreement_score":0.80029655,"about_ca_system_score_codex":0.000013871359,"about_ca_system_score_gemma":0.000041826133,"threshold_uncertainty_score":0.62008286},"labels":[],"label_agreement":null},{"id":"W4286750967","doi":"10.48550/arxiv.2207.10098","title":"The Gauge Theory of Measurement-Based Quantum Computation","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Introduction to gauge theory; Theoretical physics; Quantum gauge theory; Gauge theory; Lattice gauge theory; Gauge fixing; Physics; Gauge anomaly; BRST quantization; Quantum mechanics; Gauge boson","score_opus":0.0674941347439083,"score_gpt":0.19251754669856241,"score_spread":0.1250234119546541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286750967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13131535,0.00021215364,0.8663073,0.00021675686,0.00095035334,0.0002473247,0.000015356964,0.00018076281,0.0005546081],"genre_scores_gemma":[0.998023,0.000022196387,0.0017238845,0.000070329166,0.00004222152,0.000001164454,0.000010065726,0.00001586885,0.000091292706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976759,0.00069562957,0.0002635479,0.00073860836,0.00031444413,0.00031187377],"domain_scores_gemma":[0.99769914,0.00046221857,0.0004605143,0.0010488975,0.00024602524,0.00008317647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015302433,0.00026052227,0.00027212937,0.00017968341,0.0005504318,0.000101908445,0.0023030317,0.00010233644,0.000009798921],"category_scores_gemma":[0.00007142645,0.00022978181,0.0002726801,0.00056854903,0.00017065181,0.000069561305,0.0016839739,0.000698961,0.0000059419694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024530735,0.000053284602,0.000085870946,0.00003921287,0.00004978355,0.000029526474,0.00012062681,0.6588563,0.000017279397,0.33685675,0.00009922142,0.0037675945],"study_design_scores_gemma":[0.00027549104,0.000075268945,0.0006260404,0.000052883755,0.000028945564,0.0000013481956,0.00006225217,0.8432733,0.00006667597,0.15478542,0.00053599704,0.00021637708],"about_ca_topic_score_codex":0.00006568446,"about_ca_topic_score_gemma":0.0000107028845,"teacher_disagreement_score":0.8667076,"about_ca_system_score_codex":0.000173168,"about_ca_system_score_gemma":0.0004189764,"threshold_uncertainty_score":0.93702304},"labels":[],"label_agreement":null},{"id":"W4286908897","doi":"10.1016/j.physrep.2023.07.004","title":"Geometric and holonomic quantum computation","year":2023,"lang":"en","type":"article","venue":"Physics Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"LG Electronics; National Natural Science Foundation of China; Vetenskapsrådet; Ministry of Education - Singapore; National Research Foundation Singapore","keywords":"Holonomic; Quantum; Quantum algorithm; Quantum computer; Quantum operation; Open quantum system; Quantum network; Quantum error correction; Quantum process; Computer science; Topology (electrical circuits); Mathematics; Quantum dynamics; Physics; Quantum mechanics","score_opus":0.017349589841829764,"score_gpt":0.25680235395905016,"score_spread":0.23945276411722038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286908897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60766846,0.0000473772,0.39099085,0.00028678335,0.00043946787,0.000062110186,4.912564e-7,0.0003747547,0.00012968876],"genre_scores_gemma":[0.9932797,0.000010262529,0.0064626588,0.000058094076,0.00013581,0.0000037645436,0.0000071259633,0.000009560739,0.000033047116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990353,0.000022071967,0.00018613235,0.00036986888,0.0001729877,0.00021362948],"domain_scores_gemma":[0.99939704,0.00009185057,0.00013131351,0.0002787019,0.000035880385,0.00006519675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024858295,0.00010076243,0.0001298103,0.00015505821,0.00013410146,0.00013131216,0.00012995195,0.000024633257,3.6808893e-7],"category_scores_gemma":[0.000025439844,0.000095261894,0.00004014183,0.0011790518,0.0000267225,0.00014619392,0.00025272334,0.00010016097,0.000028291433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014286787,0.00006161432,0.0040727025,0.00004347282,0.000032890515,0.000756074,0.0009567404,0.0909068,0.00068827876,0.013226748,0.002927214,0.886326],"study_design_scores_gemma":[0.000058759095,0.000030174986,0.026778234,0.000008853722,0.0000024928072,0.00014959305,0.0000043505643,0.90268296,0.00023827722,0.069434114,0.0004829822,0.00012923121],"about_ca_topic_score_codex":0.000018309214,"about_ca_topic_score_gemma":1.8787985e-7,"teacher_disagreement_score":0.8861968,"about_ca_system_score_codex":0.000011767714,"about_ca_system_score_gemma":0.00003014581,"threshold_uncertainty_score":0.38846672},"labels":[],"label_agreement":null},{"id":"W4288027510","doi":"10.48550/arxiv.1911.02555","title":"Interactive shallow Clifford circuits: quantum advantage against NC$^1$\\n and beyond","year":2019,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Circuit complexity; Constant (computer programming); Quantum; Electronic circuit; Quantum circuit; Mathematics; Quantum computer; Computer science; Quantum algorithm; Qubit; Topology (electrical circuits); Quantum mechanics; Quantum error correction; Physics; Combinatorics","score_opus":0.02972334282536717,"score_gpt":0.19370045984564532,"score_spread":0.16397711702027815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288027510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63034517,0.0003705046,0.35893536,0.000257314,0.0035228843,0.0008893117,0.00010422757,0.00029767302,0.005277576],"genre_scores_gemma":[0.9941502,0.0015674126,0.0012233857,0.0007147403,0.00036636353,0.0000016412721,0.000051895535,0.00010090481,0.0018234119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99209696,0.0006324525,0.0008474961,0.0045231585,0.00036132114,0.0015385824],"domain_scores_gemma":[0.9939149,0.0008651863,0.0011857861,0.002801641,0.00044534027,0.00078714936],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0007736084,0.0014933374,0.0014973575,0.0008689629,0.0008105614,0.00075935054,0.0038515397,0.0008340224,0.00006441716],"category_scores_gemma":[0.0001130503,0.001703646,0.0007249826,0.0013246292,0.0006523466,0.0012176953,0.007416668,0.003180439,0.00032755933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025088707,0.00081373047,0.00929479,0.000816099,0.0009967826,0.0031380581,0.0068726745,0.79806,0.00035111431,0.09243369,0.0002629798,0.08670921],"study_design_scores_gemma":[0.0017042895,0.00049661973,0.0029842728,0.0008086869,0.00017483639,0.000081935934,0.0009768099,0.97093576,0.000064456704,0.017560039,0.0023545716,0.0018577273],"about_ca_topic_score_codex":0.00010337228,"about_ca_topic_score_gemma":0.000036390047,"teacher_disagreement_score":0.36380512,"about_ca_system_score_codex":0.00044359246,"about_ca_system_score_gemma":0.000612597,"threshold_uncertainty_score":0.99978155},"labels":[],"label_agreement":null},{"id":"W4288445479","doi":"10.1103/physreva.106.012439","title":"Algorithmic cooling for resolving state preparation and measurement errors in quantum computing","year":2022,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Quantum computer; Overhead (engineering); Benchmarking; State (computer science); Qubit; Imperfect; Protocol (science); Quantum; Computer engineering; Algorithm; Physics; Operating system; Quantum mechanics","score_opus":0.04857937713002796,"score_gpt":0.20099008989519423,"score_spread":0.15241071276516627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288445479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52043784,0.000052306736,0.47899687,0.00005483318,0.00014223528,0.00018957193,0.000002061863,0.000111200345,0.000013086009],"genre_scores_gemma":[0.99239236,0.000005779201,0.007468515,0.000066143664,0.000026126987,0.0000013997225,0.0000017521745,0.000013077203,0.000024873114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858874,0.00016649839,0.00018779923,0.0005922086,0.00013565234,0.0003290824],"domain_scores_gemma":[0.9993367,0.00012634943,0.00013224645,0.0002628137,0.000071400675,0.00007047652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010467162,0.00013630945,0.0001596818,0.0002210665,0.0004636497,0.00006658908,0.00045927195,0.000022948996,0.000001077122],"category_scores_gemma":[0.00003643367,0.00016445757,0.000051532723,0.000586037,0.000031183492,0.00019077818,0.0005301198,0.00021963654,6.151847e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000412394,0.00004097036,0.0005913255,0.000017224842,0.000011668721,0.000046079236,0.0014589548,0.98564094,0.00017834548,0.007977528,0.000030226693,0.003965472],"study_design_scores_gemma":[0.0006677262,0.00017298477,0.0012425431,0.000025224077,0.0000055191604,0.000012916128,0.00016907288,0.99075633,0.000063422915,0.0063010687,0.00038902293,0.00019415432],"about_ca_topic_score_codex":0.00009571976,"about_ca_topic_score_gemma":0.00004086124,"teacher_disagreement_score":0.4719545,"about_ca_system_score_codex":0.00019636661,"about_ca_system_score_gemma":0.00008284846,"threshold_uncertainty_score":0.6706385},"labels":[],"label_agreement":null},{"id":"W4289422646","doi":"","title":"Numerical estimate of the threshold for quantum expander codes","year":2018,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Quantum; Physics; Quantum mechanics","score_opus":0.02165442562664467,"score_gpt":0.25898404727036,"score_spread":0.23732962164371535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289422646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086214386,0.0011319834,0.87942004,0.025987238,0.0015142331,0.0007919837,0.00009171546,0.00017790037,0.004670526],"genre_scores_gemma":[0.75601524,0.00009397582,0.2389817,0.00018744305,0.00011864464,0.00007187376,0.000057226134,0.000061146704,0.0044127502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933,0.003162501,0.00091396354,0.0012341874,0.0006862432,0.0007030693],"domain_scores_gemma":[0.9889983,0.0028551193,0.0010565048,0.0037379297,0.0031248287,0.00022735039],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00592817,0.0005419806,0.00068601605,0.00011855449,0.00092407194,0.000574002,0.004454027,0.00036703533,0.000051890645],"category_scores_gemma":[0.0015512866,0.00044046174,0.0006232748,0.0006695977,0.0010166608,0.0001521917,0.0032995904,0.00080293324,0.000024566345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002817062,0.001076569,0.002398071,0.000583997,0.00020525213,0.0000033233478,0.017320046,0.01043777,0.001774491,0.8951192,0.0034120115,0.06764113],"study_design_scores_gemma":[0.00047069654,0.0000022527397,0.0048940065,0.0027498938,0.00005301596,0.00002874925,0.000024299845,0.89955926,0.030473737,0.050870683,0.010422619,0.0004507733],"about_ca_topic_score_codex":0.00089098385,"about_ca_topic_score_gemma":0.00022612425,"teacher_disagreement_score":0.88912153,"about_ca_system_score_codex":0.000093539966,"about_ca_system_score_gemma":0.0005944407,"threshold_uncertainty_score":0.99980474},"labels":[],"label_agreement":null},{"id":"W4289543899","doi":"10.48550/arxiv.1809.05523","title":"Postponing the orthogonality catastrophe: efficient state preparation\\n for electronic structure simulations on quantum devices","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Orthogonality; Rotation formalisms in three dimensions; Statistical physics; Ground state; Quantum; Hubbard model; Quantum state; Embedding; Electronic structure; Fock space; State (computer science); Computer science; Physics; Quantum mechanics; Topology (electrical circuits); Mathematics; Algorithm","score_opus":0.029346188040432552,"score_gpt":0.21844913084969875,"score_spread":0.1891029428092662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289543899","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56425226,0.000029866223,0.4344313,0.00017093973,0.0003654035,0.00044390303,0.000167398,0.00012345795,0.000015473863],"genre_scores_gemma":[0.99751073,0.0000040777927,0.0018603726,0.00023827667,0.00020189138,0.0000016099965,0.000088452645,0.000021809803,0.00007279121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974901,0.00023435212,0.0002806722,0.0012221776,0.0001722898,0.00060040323],"domain_scores_gemma":[0.9973369,0.00046892173,0.00043019137,0.001342298,0.0003111025,0.00011058661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003641061,0.0003906636,0.00028874425,0.0001585301,0.00086238445,0.0002844621,0.0018337872,0.00015952748,0.0000087722365],"category_scores_gemma":[0.0000610165,0.00032095122,0.00022042148,0.00050091837,0.00014386383,0.00010061301,0.0010256036,0.00073906133,0.0000094690395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004911886,0.000044424134,0.0001839246,0.00003242934,0.00007704146,0.0000062150425,0.00042614777,0.94266796,0.0000138454025,0.0560763,0.00007515209,0.00034746728],"study_design_scores_gemma":[0.00026559966,0.00023151132,0.0016231494,0.0000658308,0.000046984347,0.0000037541224,0.000014874031,0.9489316,0.00008673176,0.04756277,0.0008316542,0.00033558937],"about_ca_topic_score_codex":0.00006699981,"about_ca_topic_score_gemma":0.00017759496,"teacher_disagreement_score":0.43325847,"about_ca_system_score_codex":0.00020469837,"about_ca_system_score_gemma":0.00043266985,"threshold_uncertainty_score":0.99992424},"labels":[],"label_agreement":null},{"id":"W4289713053","doi":"10.1109/isit50566.2022.9834678","title":"The platypus of the quantum channel zoo","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Platypus; Channel (broadcasting); Computer science; Zoology; Telecommunications; Biology","score_opus":0.006056714379911874,"score_gpt":0.2162729846440621,"score_spread":0.21021627026415024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289713053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40813372,0.00025417263,0.40229708,0.06398042,0.06393196,0.002006585,0.000497862,0.00077107636,0.05812713],"genre_scores_gemma":[0.99688095,0.000013529501,0.000115399045,0.0019712797,0.00016222031,0.00006117908,0.00001434268,0.0000086424425,0.0007724686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978102,0.00027092887,0.00049250416,0.00017108503,0.0010346156,0.00022067646],"domain_scores_gemma":[0.998288,0.00048606147,0.0004638764,0.00058952917,0.00013047908,0.00004207003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012558415,0.00015116538,0.000114566734,0.00011911091,0.0010983297,0.000200715,0.0027843716,0.00003241296,0.000062275176],"category_scores_gemma":[0.00006799671,0.000096089214,0.0001687178,0.00040151726,0.00008259297,0.0004552386,0.00076934067,0.00043912698,0.000046770823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091275644,0.00005535201,0.000026035737,0.000006474193,0.00006591026,0.0000014368649,0.003973185,0.23291959,0.0002650329,0.7457549,0.0046484126,0.012192387],"study_design_scores_gemma":[0.0004221272,0.00016340755,0.00049310556,0.000019384202,0.0000055866954,0.00006639052,0.0004428797,0.88187164,0.0020772843,0.054862157,0.0593889,0.00018714248],"about_ca_topic_score_codex":0.000015624515,"about_ca_topic_score_gemma":0.0000011299844,"teacher_disagreement_score":0.69089276,"about_ca_system_score_codex":0.00013807866,"about_ca_system_score_gemma":0.00007435281,"threshold_uncertainty_score":0.8447575},"labels":[],"label_agreement":null},{"id":"W4292384740","doi":"10.1103/physreva.106.022418","title":"Spatial search via an interpolated memoryless walk","year":2022,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum walk; Vertex (graph theory); Mathematics; Lattice (music); Combinatorics; Self-avoiding walk; Discrete mathematics; Space (punctuation); Loop-erased random walk; Random walk; Graph; Computer science; Quantum computer; Physics; Quantum; Quantum mechanics; Statistics","score_opus":0.01509767038353867,"score_gpt":0.34463495521339094,"score_spread":0.3295372848298523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292384740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5895315,0.08114872,0.30696115,0.013739949,0.001359946,0.0044444194,0.00007940684,0.0013683425,0.001366569],"genre_scores_gemma":[0.98333585,0.0067449906,0.0017188228,0.006836052,0.0009054509,0.0002901851,0.000054644366,0.0000715121,0.000042496904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937541,0.0015825375,0.00072881207,0.0014146911,0.0015836547,0.0009362396],"domain_scores_gemma":[0.99665254,0.0003937306,0.0003155502,0.0018882744,0.00018956578,0.000560314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011036509,0.00060670736,0.0015860099,0.000092859314,0.0005610476,0.0001279886,0.0031813905,0.000028119703,0.00009017207],"category_scores_gemma":[0.00018493267,0.0004908061,0.00085061655,0.0017620045,0.00014030247,0.00037191776,0.0023478838,0.0015530979,0.00031195238],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017970982,0.0023800978,0.000032110584,0.0036260195,0.00009372892,0.00011156022,0.0006802745,0.00038605186,0.011254394,0.011276254,0.001956323,0.9681852],"study_design_scores_gemma":[0.0003723841,0.0011341539,0.00027513012,0.003329361,0.00015029057,0.00009150571,0.000006333044,0.94179964,0.0022660333,0.01925953,0.030346857,0.0009687634],"about_ca_topic_score_codex":0.00013870535,"about_ca_topic_score_gemma":0.000003664879,"teacher_disagreement_score":0.96721643,"about_ca_system_score_codex":0.0001431623,"about_ca_system_score_gemma":0.00017439119,"threshold_uncertainty_score":0.99975437},"labels":[],"label_agreement":null},{"id":"W4292976652","doi":"10.1103/physrevresearch.4.033140","title":"Leveraging randomized compiling for the quantum imaginary-time-evolution algorithm","year":2022,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Basic Energy Sciences; Office of Science; Advanced Scientific Computing Research; U.S. Department of Energy","keywords":"Computer science; Noise (video); Quantum computer; Benchmarking; Algorithm; Quantum; Reliability (semiconductor); Error detection and correction; Computer engineering; Artificial intelligence; Physics","score_opus":0.04374115761703236,"score_gpt":0.37312085277004386,"score_spread":0.3293796951530115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292976652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000855882,0.050057802,0.9265367,0.019317484,0.00032696905,0.0025226397,0.000011226836,0.00016516629,0.0002061425],"genre_scores_gemma":[0.83875805,0.008364716,0.13424484,0.004837621,0.003871179,0.00823338,0.000084430925,0.00020006744,0.0014057239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948993,0.0020726924,0.00034686187,0.00061716174,0.0013304679,0.0007335451],"domain_scores_gemma":[0.99212945,0.006541784,0.000112687754,0.00081429357,0.00028880525,0.00011301088],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008997617,0.00019044869,0.0006362196,0.00011934193,0.0020720968,0.00017500824,0.0020736253,0.000011761635,0.000027988484],"category_scores_gemma":[0.00066962343,0.00012399895,0.0004651776,0.0012897436,0.00028669677,0.0001363436,0.0017129838,0.0010611144,0.00005113928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005754703,0.0005540201,0.0000018902916,0.0007338589,0.0001504445,0.000023864188,0.001132369,0.00918621,0.00073033146,0.13152629,0.019162748,0.8362225],"study_design_scores_gemma":[0.004518185,0.00010320493,0.0000056413537,0.0001776362,0.000019064988,0.000021860038,0.000014801084,0.89513654,0.000023646431,0.08128946,0.018545434,0.00014454928],"about_ca_topic_score_codex":0.000059462614,"about_ca_topic_score_gemma":8.600257e-8,"teacher_disagreement_score":0.8859503,"about_ca_system_score_codex":0.00014970722,"about_ca_system_score_gemma":0.00019857001,"threshold_uncertainty_score":0.99922705},"labels":[],"label_agreement":null},{"id":"W4293868544","doi":"10.1109/ims37962.2022.9865495","title":"Quantum Method for Scaling the Finite Element Based Quantum Solutions of Electromagnetic Problems","year":2022,"lang":"en","type":"article","venue":"2022 IEEE/MTT-S International Microwave Symposium - IMS 2022","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Finite element method; Quantum; Computer science; Quantum computer; Electromagnetics; Electromagnetic field; Scaling; Applied mathematics; Algorithm; Mathematics; Physics; Quantum mechanics; Geometry","score_opus":0.014564748633355776,"score_gpt":0.2570931949500919,"score_spread":0.24252844631673615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293868544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016057407,0.00050490926,0.96195656,0.01555034,0.0040960326,0.0010403061,0.00037464433,0.00016074571,0.00025903867],"genre_scores_gemma":[0.86862034,0.0000634821,0.12527975,0.002442605,0.0006703116,0.0013317189,0.0003452709,0.00012148659,0.0011250159],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955642,0.0005865472,0.0009315484,0.0009573285,0.0011475589,0.0008128193],"domain_scores_gemma":[0.99694353,0.0011794396,0.0006022489,0.00086373795,0.00029719368,0.00011385387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024204648,0.0003980401,0.00040373296,0.00045418873,0.0012104866,0.00020888836,0.0029922787,0.00006763629,0.00022445424],"category_scores_gemma":[0.00008210124,0.00035647265,0.0004967229,0.0009244978,0.00011177259,0.00015369282,0.0011243692,0.00077419606,0.000008624159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008271141,0.00050416484,0.000041613977,0.00007134386,0.00025660486,0.000012925765,0.0015322261,0.3685804,0.55725247,0.06014159,0.0059263743,0.0055975597],"study_design_scores_gemma":[0.00090680365,0.0007020829,0.00003677428,0.00003579245,0.00004851011,0.00008191534,0.00015456125,0.9460394,0.020305226,0.011966782,0.019324493,0.0003976727],"about_ca_topic_score_codex":0.00016019194,"about_ca_topic_score_gemma":0.00002120402,"teacher_disagreement_score":0.85256296,"about_ca_system_score_codex":0.00032284905,"about_ca_system_score_gemma":0.00036261894,"threshold_uncertainty_score":0.9998887},"labels":[],"label_agreement":null},{"id":"W4295441343","doi":"10.1371/journal.pone.0274632","title":"Transit facility allocation: Hybrid quantum-classical optimization","year":2022,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"Ministry of Education, India","keywords":"Quantum annealing; Computer science; Public transport; Quantum; Mathematical optimization; Operations research; Quantum computer; Transport engineering; Engineering; Physics; Mathematics","score_opus":0.026932569941943697,"score_gpt":0.20580775362145204,"score_spread":0.17887518367950833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295441343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13040406,0.00007082801,0.86179113,0.006909845,0.000120729776,0.00017202024,0.00002329795,0.00033544458,0.00017267364],"genre_scores_gemma":[0.90096205,0.0000048996053,0.098303095,0.0004190786,0.00008198911,0.000037912687,0.000036574245,0.000007759824,0.00014665553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984104,0.00015416624,0.00020036408,0.0004126481,0.00059220043,0.00023020916],"domain_scores_gemma":[0.99927497,0.00006798576,0.00005877226,0.0004541074,0.000058896716,0.00008526768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026488895,0.00011536577,0.00016681642,0.00006951035,0.00043937057,0.00008460691,0.00066419656,0.000017904586,0.00012332475],"category_scores_gemma":[0.000027227867,0.00012041509,0.000056722194,0.0003460015,0.00003218463,0.00012642387,0.00027014362,0.0002978259,0.00002263713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017141314,0.0020856205,0.0000899726,0.000044885535,0.00009026787,0.0000324068,0.0010171087,0.9685554,0.0016501867,0.0059354776,0.0005077224,0.019973805],"study_design_scores_gemma":[0.00020342467,0.00014922231,0.00011997127,0.0000085287775,0.000011609617,0.00001406684,0.000009915813,0.9965468,0.0014171713,0.00085728045,0.00050846615,0.00015351278],"about_ca_topic_score_codex":0.000007588375,"about_ca_topic_score_gemma":4.999983e-7,"teacher_disagreement_score":0.770558,"about_ca_system_score_codex":0.00005342139,"about_ca_system_score_gemma":0.00006952365,"threshold_uncertainty_score":0.49103847},"labels":[],"label_agreement":null},{"id":"W4295689250","doi":"10.1145/3549036.3562061","title":"Using Quantum computers to speed up dynamic testing of software","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Speedup; Quantum computer; Software testing; Software; Parallel computing; Quantum; Operating system; Physics; Quantum mechanics","score_opus":0.04737854739981302,"score_gpt":0.299119823616864,"score_spread":0.251741276217051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295689250","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22323206,0.00006677295,0.77193713,0.00025344483,0.0035140817,0.00034102477,0.00003054107,0.000541752,0.00008321989],"genre_scores_gemma":[0.13353147,0.000001080835,0.8659175,0.0003134684,0.00009431301,0.0000039237043,0.000013402327,0.0000397541,0.000085090585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675685,0.0001712044,0.00066897273,0.0011710662,0.00067786034,0.0005540529],"domain_scores_gemma":[0.99727035,0.00047945624,0.00044009337,0.0014234784,0.00018852559,0.00019808102],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00053129514,0.00045557608,0.00066209905,0.0004929839,0.00027540157,0.00022816386,0.0030356897,0.00013631486,0.000031810087],"category_scores_gemma":[0.00019686134,0.00045136272,0.00024022769,0.0009552603,0.000050646726,0.00007366944,0.01105355,0.00096841797,0.000006238899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033727358,0.000045192344,0.00023561351,0.00016126965,0.000041896204,0.00003317964,0.00086769194,0.95188946,0.00036387262,0.0008371927,0.00018173484,0.045339532],"study_design_scores_gemma":[0.00014275261,0.00011915916,0.00059623,0.000297092,0.000013164605,0.000048672453,0.00003392281,0.99310136,0.00010982533,0.004746231,0.0002766636,0.000514926],"about_ca_topic_score_codex":0.0005426599,"about_ca_topic_score_gemma":0.0000103729135,"teacher_disagreement_score":0.093980394,"about_ca_system_score_codex":0.00017347455,"about_ca_system_score_gemma":0.00040970073,"threshold_uncertainty_score":0.9997938},"labels":[],"label_agreement":null},{"id":"W4296126438","doi":"10.1038/s43588-022-00311-3","title":"Challenges and opportunities in quantum machine learning","year":2022,"lang":"en","type":"review","venue":"Nature Computational Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":652,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Los Alamos National Laboratory; National Nuclear Security Administration; Office of Science; Verily Life Sciences; Advanced Scientific Computing Research; Laboratory Directed Research and Development; U.S. Department of Energy","keywords":"Quantum machine learning; Quantum; Intersection (aeronautics); Computer science; Focus (optics); Artificial intelligence; Quantum computer; Physics; Quantum mechanics; Engineering; Aerospace engineering","score_opus":0.08765781566270549,"score_gpt":0.33523982952755627,"score_spread":0.2475820138648508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296126438","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009536859,0.9951939,0.0026319802,0.0006804738,0.0005371522,0.00021125219,0.0000065703625,0.00013629252,0.0005928435],"genre_scores_gemma":[0.00056174,0.99074924,0.008369758,0.00015839098,0.00007586143,0.000022379967,0.000024832654,0.00001758566,0.00002021816],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966866,0.00032227748,0.0004185091,0.00108263,0.0010353308,0.00045465352],"domain_scores_gemma":[0.99787384,0.0013027044,0.00028971545,0.00031102667,0.0000669738,0.00015571772],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018038723,0.0003636041,0.0007189259,0.0009642062,0.00056914694,0.0002608289,0.0019066853,0.00018826207,0.000009633829],"category_scores_gemma":[0.00026843717,0.00030502706,0.00011783281,0.0011328314,0.00029285174,0.00033460636,0.0015820039,0.002347916,0.00000325727],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.40051e-7,0.00001907564,4.661702e-7,0.00046526518,0.0000051825123,0.00005745691,0.0002698688,0.0049316855,1.6357648e-8,0.090308875,0.0000049468968,0.9039368],"study_design_scores_gemma":[0.000059358423,0.000049717564,0.00004278378,0.00064639637,0.0000066174084,0.00026203526,0.000011116531,0.37053004,1.6417882e-8,0.0059497813,0.62217486,0.00026724447],"about_ca_topic_score_codex":0.000007535495,"about_ca_topic_score_gemma":0.0000044642807,"teacher_disagreement_score":0.9036696,"about_ca_system_score_codex":0.00014736174,"about_ca_system_score_gemma":0.00086535694,"threshold_uncertainty_score":0.9999537},"labels":[],"label_agreement":null},{"id":"W4296591980","doi":"10.1103/physrevlett.129.120501","title":"Coherence as a Resource for Shor’s Algorithm","year":2022,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Consejo Nacional de Investigaciones Científicas y Técnicas; Pacific Institute for the Mathematical Sciences","keywords":"Coherence (philosophical gambling strategy); Computer science; Algorithm; Quantum; Speedup; Quantum computer; Computation; Protocol (science); Factoring; Theoretical computer science; Quantum mechanics; Physics; Parallel computing","score_opus":0.013275803796854092,"score_gpt":0.27765114183413464,"score_spread":0.2643753380372805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296591980","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024063326,0.009829222,0.8597529,0.102859735,0.00060437544,0.0018260229,0.000042015494,0.0005737735,0.00044862664],"genre_scores_gemma":[0.12208561,0.00033019987,0.34271878,0.5297247,0.0021859317,0.0024040937,0.000078413635,0.00013343303,0.00033881096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983043,0.00016756395,0.00021862033,0.0005147262,0.00043006675,0.0003646876],"domain_scores_gemma":[0.99892265,0.00028690012,0.00011578309,0.00054928695,0.000022877584,0.000102515325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003878605,0.00017425124,0.0003168099,0.000036182642,0.00035012592,0.00006145357,0.0012380169,0.000004362368,0.00001633084],"category_scores_gemma":[0.000049286562,0.00015316787,0.00024681992,0.00044494512,0.0000393112,0.00007529935,0.0006090299,0.00030684078,0.000030684565],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004447045,0.0001892342,0.0000029336193,0.00034633998,0.000035487858,0.000051049687,0.00051413896,0.005700138,0.001771779,0.005110464,0.07526988,0.9110041],"study_design_scores_gemma":[0.00017345622,0.00019190203,0.000013879353,0.00017631413,0.000017098435,0.00005339548,0.0000044512212,0.5434211,0.00010833167,0.002475292,0.4531002,0.0002645704],"about_ca_topic_score_codex":0.000008095976,"about_ca_topic_score_gemma":6.913391e-8,"teacher_disagreement_score":0.91073954,"about_ca_system_score_codex":0.000043733093,"about_ca_system_score_gemma":0.000038694252,"threshold_uncertainty_score":0.6246004},"labels":[],"label_agreement":null},{"id":"W4297108347","doi":"10.26421/qic22.11-12-3","title":"Automated discovery of logical gates for quantum error correction (with Supplementary (153 pages))","year":2022,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Engineering and Physical Sciences Research Council; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; University College London; Government of Canada; Ministero dello Sviluppo Economico","keywords":"Computer science; Quantum error correction; Quantum computer; Algorithm; Qubit; Quantum decoherence; Error detection and correction; Theoretical computer science; Computer engineering; Arithmetic; Quantum; Mathematics; Quantum mechanics; Physics","score_opus":0.013544250009940872,"score_gpt":0.25321063392571447,"score_spread":0.2396663839157736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297108347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2564511,0.000024772988,0.74133104,0.0010099426,0.00047468048,0.00037286154,0.000048353515,0.00025279543,0.0000344378],"genre_scores_gemma":[0.98808855,0.0000049008377,0.0109622395,0.00040329955,0.000025215524,0.00006098364,0.00043957212,0.000006842633,0.00000837603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987359,0.000094049,0.0004600443,0.00019899436,0.0003029396,0.00020805918],"domain_scores_gemma":[0.9991273,0.00019373173,0.00036223925,0.000140215,0.00012842199,0.000048077825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035706977,0.00015468655,0.0001929874,0.00022798264,0.0004585986,0.00019295933,0.00022802546,0.000031715805,0.00000645772],"category_scores_gemma":[0.000018957635,0.00012949042,0.000055954482,0.00040255568,0.000046034624,0.0009356228,0.00017410684,0.00014452051,0.0000013108792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003910805,0.00029456554,0.0007611158,0.00035499092,0.000092622504,0.000004609593,0.0060930024,0.7264045,0.0002710053,0.12309505,0.012929304,0.12930816],"study_design_scores_gemma":[0.0008456041,0.0010934254,0.0022856607,0.000018615336,0.000010444991,0.0000670932,0.00089497375,0.98719376,0.00018913618,0.0046598064,0.0025582137,0.00018326721],"about_ca_topic_score_codex":0.000048840102,"about_ca_topic_score_gemma":0.000004032571,"teacher_disagreement_score":0.7316375,"about_ca_system_score_codex":0.000042792555,"about_ca_system_score_gemma":0.00006477172,"threshold_uncertainty_score":0.5280466},"labels":[],"label_agreement":null},{"id":"W4297109183","doi":"10.26421/qic22.13-14-2","title":"Of shadows and gaps in spatial search","year":2022,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; York University","funders":"","keywords":"Mathematics; Adjacency matrix; Combinatorics; Eigenvalues and eigenvectors; Vertex (graph theory); Hamming graph; Discrete mathematics; Graph; Algorithm; Decoding methods; Hamming code","score_opus":0.009212039835549723,"score_gpt":0.24137800458913003,"score_spread":0.2321659647535803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297109183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62799245,0.000049546892,0.37111473,0.0005001983,0.000094512536,0.00010299874,0.000003473343,0.00003198241,0.00011011979],"genre_scores_gemma":[0.9948067,0.0000074768477,0.004993988,0.00015977511,0.00000782134,0.000005977868,0.000014380676,0.0000019182373,0.0000019436286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919814,0.000078696416,0.00027701733,0.000102981176,0.00023226283,0.00011091444],"domain_scores_gemma":[0.99968904,0.00006195386,0.00009878419,0.00007767022,0.000038148046,0.0000343816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003771029,0.000065687236,0.00009871249,0.00026030926,0.00014502254,0.00006946449,0.00013347967,0.000017303262,0.0000036315218],"category_scores_gemma":[0.000010069183,0.00006657569,0.000014288379,0.0003022869,0.000026479674,0.00040744056,0.00025936216,0.0001406507,0.0000011520252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020018882,0.00003938573,0.0012985988,0.000085605505,0.000003854824,0.0000021072367,0.011966365,0.13554108,0.000060084185,0.06471102,0.00005555629,0.7862163],"study_design_scores_gemma":[0.00039541317,0.00015070553,0.02298699,0.0000070688216,7.7919475e-7,0.000027107955,0.00033629738,0.9715985,0.0000367873,0.0040070303,0.00037932963,0.00007400507],"about_ca_topic_score_codex":0.00015679402,"about_ca_topic_score_gemma":0.000004005678,"teacher_disagreement_score":0.8360574,"about_ca_system_score_codex":0.00001631459,"about_ca_system_score_gemma":0.000039895982,"threshold_uncertainty_score":0.2714878},"labels":[],"label_agreement":null},{"id":"W4297411627","doi":"10.48550/arxiv.2209.12889","title":"Characterizing a non-equilibrium phase transition on a quantum computer","year":2022,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Aspen Center for Physics; Alfred P. Sloan Foundation; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Quantum computer; Quantum; Open quantum system; Quantum phase transition; Computer science; Quantum error correction; Statistical physics; Qubit; Quantum process; Quantum circuit; Quantum simulator; Quantum algorithm; Quantum network; Quantum information; Quantum logic; Quantum phases; Phase transition; Quantum mechanics; Physics; Quantum dynamics","score_opus":0.028445968597974696,"score_gpt":0.275212677455205,"score_spread":0.24676670885723032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297411627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7449467,0.000046497575,0.24644098,0.0038578063,0.003575057,0.00041654473,0.000047265527,0.00054540863,0.0001237314],"genre_scores_gemma":[0.98290277,0.000013959781,0.012034594,0.00316219,0.0014921018,0.000082618586,0.00017586893,0.00006974939,0.00006617275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962257,0.00025455066,0.0005981217,0.0016010933,0.00061225134,0.000708284],"domain_scores_gemma":[0.9975745,0.00014515522,0.0003811039,0.0016083925,0.00007255652,0.0002182627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004951675,0.00062998355,0.0006581301,0.00036530852,0.00035907753,0.0003485781,0.0020845288,0.00023674699,0.00006559117],"category_scores_gemma":[0.000012650573,0.00062886026,0.00043593207,0.00041681086,0.00006475181,0.00021071079,0.002342633,0.001995381,0.00011112856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079922326,0.009268303,0.00409321,0.0026125533,0.0014226239,0.0055737807,0.06565474,0.34560394,0.0646404,0.0051475763,0.009178095,0.48600554],"study_design_scores_gemma":[0.0010039594,0.000749412,0.0062876916,0.00031570104,0.000023641329,0.000048926733,0.000017309036,0.9850988,0.00084388745,0.0005617212,0.0042807055,0.0007682926],"about_ca_topic_score_codex":0.000045568577,"about_ca_topic_score_gemma":7.0704493e-7,"teacher_disagreement_score":0.6394948,"about_ca_system_score_codex":0.000127137,"about_ca_system_score_gemma":0.00020178365,"threshold_uncertainty_score":0.99961627},"labels":[],"label_agreement":null},{"id":"W4297820909","doi":"10.48550/arxiv.2209.05523","title":"Generalization despite overfitting in quantum machine learning models","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada); Perimeter Institute; University of Waterloo","funders":"","keywords":"Overfitting; Artificial intelligence; Quantum; Generalization; Computer science; Machine learning; Artificial neural network; Mathematics; Physics; Quantum mechanics","score_opus":0.05877136541337432,"score_gpt":0.18946008101023026,"score_spread":0.13068871559685594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297820909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44447428,0.00014774797,0.55419695,0.00006256329,0.0004288499,0.0001343635,0.000005389694,0.0002487223,0.00030110453],"genre_scores_gemma":[0.99402255,0.00015250167,0.005156186,0.00009701146,0.000074352676,0.0000012202562,0.000043896278,0.00002967679,0.00042260071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974506,0.0004388408,0.0002810328,0.0012257315,0.00015608117,0.00044774218],"domain_scores_gemma":[0.9986428,0.000114200884,0.00031962438,0.00075386214,0.000061834326,0.00010769718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005350064,0.0003353548,0.00034454753,0.0005133845,0.00035432004,0.00015944213,0.0016224175,0.00017045772,0.000026079511],"category_scores_gemma":[0.000035659337,0.0004084541,0.0001718456,0.0010399696,0.00003762445,0.00030067354,0.0039474335,0.001503845,0.0000063954135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075265707,0.000043887998,0.0029756704,0.000036377623,0.000018115197,0.00024732808,0.00061155873,0.9170616,0.000015546198,0.07790035,0.000011469514,0.0010705355],"study_design_scores_gemma":[0.00033529464,0.000047918045,0.00044251428,0.0000708796,0.000011605933,0.000006132444,0.00003236786,0.9480711,0.000010598576,0.050227284,0.00032479232,0.00041947528],"about_ca_topic_score_codex":0.0007057145,"about_ca_topic_score_gemma":0.000046353085,"teacher_disagreement_score":0.54954827,"about_ca_system_score_codex":0.00025907534,"about_ca_system_score_gemma":0.00015306177,"threshold_uncertainty_score":0.99983674},"labels":[],"label_agreement":null},{"id":"W4297828369","doi":"10.21203/rs.3.rs-1976229/v1","title":"Gate-based Quantum Computing for Protein Design","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CMC Microsystems (Canada); University of Toronto","funders":"Compute Canada; Western Canada Research Grid; CMC Microsystems","keywords":"Oracle; Quantum computer; Qubit; Electronic circuit; Computer science; Quantum circuit; Quantum algorithm; Quantum; Quantum gate; Algorithm; Adder; Sequence (biology); Energy (signal processing); Exponential function; Quadratic equation; Discrete mathematics; Theoretical computer science; Mathematics; Quantum error correction; Physics; Quantum mechanics; Programming language","score_opus":0.09091074400913395,"score_gpt":0.3782288011361292,"score_spread":0.28731805712699526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297828369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021442926,0.00058377313,0.9684036,0.0030889625,0.00072061433,0.0048777126,0.00007257525,0.00069108844,0.000118785625],"genre_scores_gemma":[0.5887277,0.000006510862,0.40872857,0.00013003028,0.00065129343,0.0012797785,0.00011061149,0.0001135921,0.00025189892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99167365,0.0022182807,0.0005850422,0.0018215415,0.0020904548,0.0016110335],"domain_scores_gemma":[0.9947878,0.0018411046,0.00026607388,0.002056339,0.00072599953,0.00032267097],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0076365345,0.0004977588,0.00059257983,0.0008850235,0.0016383626,0.001035612,0.004473665,0.0002945219,0.00004777208],"category_scores_gemma":[0.00073252444,0.00047955822,0.00042313334,0.0011226067,0.00016384729,0.00008507872,0.0064202813,0.0034398423,0.000024079209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092440394,0.00034318533,0.000053975207,0.0020844862,0.00006495334,0.00013879301,0.0009760072,0.93209636,0.00043212043,0.021007568,0.0032384498,0.03947166],"study_design_scores_gemma":[0.00053125736,0.0007991999,0.0001563645,0.0007301413,0.000004302027,0.000004920546,0.00005392175,0.9564616,0.0008804735,0.034364723,0.0054875035,0.0005256073],"about_ca_topic_score_codex":0.00013664625,"about_ca_topic_score_gemma":0.0000025148586,"teacher_disagreement_score":0.56728476,"about_ca_system_score_codex":0.00039243168,"about_ca_system_score_gemma":0.0020057992,"threshold_uncertainty_score":0.99976563},"labels":[],"label_agreement":null},{"id":"W4298263856","doi":"10.48550/arxiv.1406.0798","title":"W-like states are not Necessary for Totally Correct Quantum Anonymous\\n Leader Election","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Protocol (science); State (computer science); Quantum state; Quantum; Computation; Resource (disambiguation); Quantum computer; Computer science; Mathematics; Quantum mechanics; Physics; Algorithm; Computer network; Medicine","score_opus":0.03920352503880438,"score_gpt":0.19233923447161833,"score_spread":0.15313570943281396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298263856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25969908,0.000051260235,0.73672795,0.00039717977,0.0020438035,0.0003990197,0.000030853058,0.00050368387,0.00014717951],"genre_scores_gemma":[0.99301565,0.000057851863,0.0044375076,0.00059299945,0.00036621242,0.0000036253548,0.00005721286,0.00004761409,0.001421344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969703,0.00020375407,0.000307073,0.0016802562,0.00015907189,0.0006795356],"domain_scores_gemma":[0.9974135,0.000380136,0.00052412617,0.0011774837,0.00029950094,0.00020524178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004005784,0.0005379687,0.00057826657,0.00035077462,0.00042255362,0.00029120338,0.0018722668,0.0003817379,0.000008203699],"category_scores_gemma":[0.000051604027,0.0005767223,0.00039591533,0.0005164107,0.00011356922,0.00024008001,0.0013054854,0.0008698802,0.000035970013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008531085,0.00012718797,0.000313989,0.0002237899,0.00011753194,0.0000895884,0.0003558782,0.9809108,0.00008157583,0.010138442,0.0036221019,0.003933821],"study_design_scores_gemma":[0.0005418711,0.00022055155,0.000710171,0.00016314689,0.00005604655,0.000018343893,0.00006899068,0.9750583,0.00028764267,0.019987715,0.002185754,0.00070147734],"about_ca_topic_score_codex":0.0001677554,"about_ca_topic_score_gemma":0.00006255605,"teacher_disagreement_score":0.73331654,"about_ca_system_score_codex":0.0001556722,"about_ca_system_score_gemma":0.00021849574,"threshold_uncertainty_score":0.9996684},"labels":[],"label_agreement":null},{"id":"W4299702119","doi":"","title":"An Hopf algebra for counting simple cycles","year":2017,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Simple (philosophy); Hopf algebra; Mathematics; Algebra over a field; Quasitriangular Hopf algebra; Representation theory of Hopf algebras; Division algebra; Pure mathematics; Filtered algebra","score_opus":0.01571051302780861,"score_gpt":0.25792892054535627,"score_spread":0.24221840751754767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299702119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0827478,0.00045840116,0.903897,0.008706575,0.0005046491,0.0005017071,0.000069991234,0.0005902293,0.0025236665],"genre_scores_gemma":[0.58274275,0.000065354856,0.41580498,0.00012267227,0.000112069974,0.00006601001,0.00026943188,0.000049119433,0.0007676315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99520093,0.0019291324,0.00050873886,0.0013281113,0.00045626416,0.0005768341],"domain_scores_gemma":[0.9909364,0.0013574376,0.00083919946,0.0049351747,0.0016912773,0.00024049083],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.005906146,0.0004245032,0.0004622283,0.00018906598,0.0013350835,0.002531216,0.0056091864,0.00029965077,0.000011683059],"category_scores_gemma":[0.0011776923,0.00043923315,0.00029209306,0.00015169052,0.00020183044,0.00034037212,0.0028793677,0.0006891602,0.000013206611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009740531,0.00072263106,0.0016543445,0.0004060662,0.00013661926,0.000013611035,0.012203758,0.0034872633,0.001807201,0.2900968,0.0025140203,0.68694794],"study_design_scores_gemma":[0.00037553755,9.303709e-7,0.0026984448,0.00078580173,0.00002090071,0.000011701943,0.000021933432,0.89810055,0.00797572,0.07428458,0.015146709,0.00057718554],"about_ca_topic_score_codex":0.00086595776,"about_ca_topic_score_gemma":0.000508896,"teacher_disagreement_score":0.89461327,"about_ca_system_score_codex":0.00006667978,"about_ca_system_score_gemma":0.00036041165,"threshold_uncertainty_score":0.9999651},"labels":[],"label_agreement":null},{"id":"W4300412797","doi":"10.1007/978-3-642-10698-9","title":"Theory of Quantum Computation, Communication, and Cryptography","year":2009,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum cryptography; Cryptography; Neural cryptography; Quantum computer; Theoretical computer science; Computation; Quantum; Computer security; Encryption; Algorithm; Public-key cryptography; Quantum information; Quantum mechanics; Physics","score_opus":0.009411363779440485,"score_gpt":0.24024378427563325,"score_spread":0.23083242049619276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300412797","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005040522,0.0026708131,0.9945646,0.0006621964,0.00035981843,0.0003103724,0.0000034974112,0.00016477468,0.0007598815],"genre_scores_gemma":[0.14321035,0.00014957876,0.8552279,0.0011202476,0.00019361108,0.000004790547,0.000012205489,0.000030092471,0.000051229257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996526,0.00024484203,0.0007135447,0.0011674147,0.00080509076,0.0005431131],"domain_scores_gemma":[0.99601823,0.0014388938,0.0005278231,0.0014668993,0.00038716488,0.00016101704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001797082,0.00048964546,0.0006732019,0.001194097,0.0003496072,0.00037321227,0.003348559,0.00026266222,0.0000024649007],"category_scores_gemma":[0.00012381234,0.000440552,0.00013877975,0.0016584933,0.0014220676,0.00034742436,0.0012966839,0.00087455777,0.0000029554571],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049362734,0.00006130121,0.000050238632,0.00006600197,0.000015966185,0.000014213221,0.001863754,0.076321855,0.000021603557,0.06993107,0.00016276276,0.8514863],"study_design_scores_gemma":[0.00016427158,0.00013464014,0.0006174281,0.00032557984,0.0000055574183,0.00004795428,2.6471355e-7,0.50723535,0.000091549984,0.49088234,0.00020706785,0.00028797405],"about_ca_topic_score_codex":0.000011870302,"about_ca_topic_score_gemma":0.000007147835,"teacher_disagreement_score":0.8511983,"about_ca_system_score_codex":0.0000884734,"about_ca_system_score_gemma":0.000709561,"threshold_uncertainty_score":0.9998046},"labels":[],"label_agreement":null},{"id":"W4300449791","doi":"10.1007/978-3-031-79779-8_4","title":"Reversible and Quantum Circuits","year":2008,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on digital circuits and systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Electronic circuit; Quantum computer; Reversible computing; Quantum; Dissipation; Computation; Erasure; Computer science; Adiabatic circuit; CMOS; Energy consumption; Electronic engineering; Physics; Quantum mechanics; Algorithm; Electrical engineering; Pass transistor logic; Engineering; Digital electronics","score_opus":0.02043806779516485,"score_gpt":0.204274436008591,"score_spread":0.18383636821342614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300449791","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006308366,0.04295926,0.016717466,0.0008030093,0.0032195381,0.0018626283,0.00049163576,0.0013084019,0.9263297],"genre_scores_gemma":[0.9618241,0.0008688101,0.00003171174,0.00022922624,0.0005736045,0.000017855344,0.000011466771,0.00011432477,0.03632888],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99683964,0.000053428557,0.0005506563,0.0013056415,0.00069584034,0.0005548178],"domain_scores_gemma":[0.99753153,0.00081439834,0.00035425456,0.00086867844,0.00009915538,0.00033199793],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022202589,0.00077340513,0.0009770428,0.00042177018,0.00044529364,0.0013369119,0.0007487428,0.00047659405,0.0000067307474],"category_scores_gemma":[0.00013495183,0.0006331689,0.00021321661,0.00009409778,0.00020930446,0.00028421445,0.00027678243,0.00059540954,0.00005227114],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008904915,0.00006774078,0.000040043673,0.0006805007,0.00042858135,0.00059326156,0.0010971385,0.00051698746,0.00005119041,0.18963279,0.011522876,0.79535997],"study_design_scores_gemma":[0.0011007213,0.0014512998,0.0006431125,0.007015841,0.0001762705,0.0067701116,0.000053900447,0.06618072,0.0001881956,0.035785314,0.87494737,0.0056871152],"about_ca_topic_score_codex":0.000018190796,"about_ca_topic_score_gemma":0.0000016930412,"teacher_disagreement_score":0.95551574,"about_ca_system_score_codex":0.000059309772,"about_ca_system_score_gemma":0.00010968144,"threshold_uncertainty_score":0.9996998},"labels":[],"label_agreement":null},{"id":"W4300704647","doi":"10.1007/978-3-642-27848-8_303-2","title":"Quantum Algorithms for Matrix Multiplication and Product Verification","year":2015,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matrix multiplication; Computer science; Algorithm; Product (mathematics); Quantum; Matrix (chemical analysis); Multiplication (music); Arithmetic; Mathematics; Physics; Quantum mechanics; Materials science; Combinatorics","score_opus":0.025699445372010243,"score_gpt":0.2769524869051991,"score_spread":0.25125304153318884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300704647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021912389,0.014488778,0.9224223,0.002185011,0.003807885,0.003724793,0.00043305827,0.00077928,0.051939752],"genre_scores_gemma":[0.00074969255,0.0032001974,0.8415178,0.00007163446,0.0031125653,0.00020296458,0.0004059322,0.00024419933,0.15049502],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966417,0.000040444527,0.0008602988,0.0013408689,0.00066721346,0.000449508],"domain_scores_gemma":[0.9966822,0.00025692905,0.00082036934,0.0013158846,0.00067051227,0.00025410575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007958019,0.00061741984,0.0007663937,0.00036110225,0.00018068678,0.00010276171,0.001095118,0.00035843917,0.000007901706],"category_scores_gemma":[0.0001449896,0.0005896266,0.00021194849,0.00014562487,0.00018865241,0.00027748535,0.0003897979,0.00045776364,0.000025547282],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024430314,0.000088839675,0.000007321528,0.00031020242,0.00011864997,0.000007990027,0.0010155317,0.00032986264,0.00006779621,0.14430045,0.0072699892,0.8464589],"study_design_scores_gemma":[0.0007759441,0.0004132879,0.000108630724,0.00018967631,0.00007919761,0.00005713428,0.000010191171,0.41838494,0.00009795686,0.07336198,0.5056712,0.0008498564],"about_ca_topic_score_codex":0.00002708319,"about_ca_topic_score_gemma":0.000001981041,"teacher_disagreement_score":0.84560907,"about_ca_system_score_codex":0.000084057356,"about_ca_system_score_gemma":0.00031972997,"threshold_uncertainty_score":0.9996555},"labels":[],"label_agreement":null},{"id":"W4300815004","doi":"10.48550/arxiv.1206.0330","title":"Systematic distillation of composite Fibonacci anyons using one mobile quasiparticle","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; University of Waterloo; National Science Foundation","keywords":"Topological quantum computer; Quasiparticle; Fibonacci number; Quantum computer; Anyon; Quantum; Computation; Initialization; Computer science; Physics; Theoretical physics; Topology (electrical circuits); Coin flipping; Mathematics; Quantum mechanics; Algorithm; Discrete mathematics; Combinatorics; Statistics","score_opus":0.05751171466003306,"score_gpt":0.20174059230482877,"score_spread":0.1442288776447957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300815004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5607076,0.00014858028,0.4385081,0.0000076104593,0.00021465162,0.0002689792,0.0000077445475,0.000087151,0.00004956529],"genre_scores_gemma":[0.9887388,0.000009772591,0.011118589,0.000009727413,0.00006504477,7.84663e-7,0.0000056264435,0.000013776145,0.000037929054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984412,0.00023232939,0.00033712885,0.0005476335,0.00012721305,0.00031448857],"domain_scores_gemma":[0.9980723,0.00017609172,0.00050389353,0.0009785853,0.00013007713,0.00013902008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030735641,0.00023500276,0.000502082,0.00017473508,0.00014405246,0.0000694027,0.0009200757,0.00014608468,0.000005680308],"category_scores_gemma":[0.000018739795,0.0002511281,0.00019588046,0.0004708861,0.00007318796,0.00019258902,0.0012870561,0.00029827855,0.000013971198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063695984,0.00014631006,0.0013737099,0.0026908165,0.000096728305,0.000015455065,0.0006482722,0.9814069,0.0007824604,0.012694001,0.000002379713,0.0001365707],"study_design_scores_gemma":[0.00017466815,0.000033282522,0.0014054071,0.0016792336,0.00012275002,0.0000073701785,0.000030305608,0.99241734,0.00049704104,0.0033683614,0.0000022103604,0.00026202813],"about_ca_topic_score_codex":0.00013311248,"about_ca_topic_score_gemma":0.0000050784975,"teacher_disagreement_score":0.42803112,"about_ca_system_score_codex":0.0001089609,"about_ca_system_score_gemma":0.000075655786,"threshold_uncertainty_score":0.9999941},"labels":[],"label_agreement":null},{"id":"W4300864737","doi":"10.21203/rs.3.rs-1979919/v1","title":"Preparing state within target topological sector of lattice gauge theory model on quantum simulator","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Joint Research Centre; University of Hong Kong; Fundamental Research Funds for the Central Universities; Government of Jiangsu Province; National Natural Science Foundation of China; K. C. Wong Education Foundation; Chinese Academy of Sciences; National Science Foundation","keywords":"Lattice gauge theory; Lattice (music); Quantum; Quantum simulator; Topology (electrical circuits); Lattice field theory; Physics; Gauge theory; Theoretical physics; Computer science; Statistical physics; Simulation; Quantum mechanics; Engineering; Quantum computer; Electrical engineering","score_opus":0.05575695754480081,"score_gpt":0.3630736841387377,"score_spread":0.3073167265939369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300864737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7482099,0.00051034364,0.24608982,0.00045725246,0.0007679434,0.0012010343,0.0002880959,0.0004408818,0.0020347366],"genre_scores_gemma":[0.9704675,0.000028827262,0.028607177,0.0000860459,0.00013468668,0.000094684976,0.000031166637,0.00005385436,0.0004960683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921629,0.0022419684,0.0006883335,0.0015295949,0.0023377936,0.0010394424],"domain_scores_gemma":[0.9948174,0.0020230105,0.00032602024,0.0021469966,0.00038262332,0.0003039452],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0059448886,0.00045097453,0.0006833184,0.0005964234,0.0005548162,0.0002721225,0.0033637625,0.00026507117,0.00008526959],"category_scores_gemma":[0.00084635115,0.0003761279,0.00032036015,0.0006998673,0.0002856724,0.000105455685,0.008394366,0.00415493,0.00001697299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011258866,0.00023243972,0.00009750307,0.00041913753,0.000051363048,0.00005299937,0.0028512499,0.7796213,0.00006371056,0.21527076,0.0001618848,0.0010650473],"study_design_scores_gemma":[0.00018584244,0.00047493677,0.00017202373,0.00023652535,0.0000035370424,0.000003627939,0.00007706254,0.7028221,0.0003882946,0.29514417,0.00021354457,0.00027835957],"about_ca_topic_score_codex":0.00012527265,"about_ca_topic_score_gemma":0.000006651059,"teacher_disagreement_score":0.22225758,"about_ca_system_score_codex":0.00025748237,"about_ca_system_score_gemma":0.0008612811,"threshold_uncertainty_score":0.99986905},"labels":[],"label_agreement":null},{"id":"W4301028498","doi":"10.48550/arxiv.0907.1623","title":"Faster quantum algorithm for evaluating game trees","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Quantum algorithm; Binary logarithm; Mathematics; Upper and lower bounds; Omega; Quantum walk; Time complexity; Quantum; Discrete mathematics; Algorithm; Physics; Quantum mechanics","score_opus":0.07216432397148756,"score_gpt":0.22982443393970703,"score_spread":0.15766010996821947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301028498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10165467,0.00012433699,0.8958156,0.00023208238,0.0009377277,0.0005250806,0.000029963849,0.0004467961,0.000233726],"genre_scores_gemma":[0.8215494,0.00003812215,0.17667839,0.00029677016,0.00043063442,0.0000030169933,0.00003113367,0.00003989623,0.00093260134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692,0.00021169629,0.00033242977,0.0016718763,0.00018357053,0.0006804632],"domain_scores_gemma":[0.9975001,0.00027832898,0.00038512863,0.0013679222,0.0002552862,0.00021320341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006123769,0.00052029017,0.0005412585,0.00032938694,0.00026763027,0.0003047106,0.0024359447,0.00033790222,0.000008523672],"category_scores_gemma":[0.00004968278,0.0005505967,0.00047339516,0.00047931916,0.000084186664,0.00022925602,0.0016223432,0.0007467022,0.000030368912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000148888785,0.000115960036,0.000037530994,0.00005592352,0.00009375064,0.00012199072,0.0004493045,0.688292,0.00003807923,0.028042033,0.00028769046,0.28245082],"study_design_scores_gemma":[0.00063276506,0.00027823125,0.00034873126,0.00015786818,0.000057128622,0.0000112316675,0.000024804529,0.886809,0.000049624145,0.11051622,0.00053157564,0.00058282545],"about_ca_topic_score_codex":0.000042641055,"about_ca_topic_score_gemma":0.000008991136,"teacher_disagreement_score":0.71989477,"about_ca_system_score_codex":0.00013447648,"about_ca_system_score_gemma":0.00025230588,"threshold_uncertainty_score":0.9996945},"labels":[],"label_agreement":null},{"id":"W4301185265","doi":"10.21203/rs.3.rs-2045996/v1","title":"Synthesizing efficient circuits for Hamiltonian simulation","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Innovation, Science and Economic Development Canada","keywords":"Hamiltonian (control theory); Electronic circuit; Computer science; Electrical engineering; Mathematics; Engineering; Mathematical optimization","score_opus":0.07278375380513341,"score_gpt":0.3889938566774134,"score_spread":0.31621010287227996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301185265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06983391,0.001024542,0.9219187,0.0016945439,0.0014003727,0.0025759945,0.00011620553,0.00057644205,0.00085928827],"genre_scores_gemma":[0.9803104,0.000012605719,0.018432766,0.00004861228,0.0004801705,0.00040850337,0.00004657392,0.00005304205,0.00020737338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948387,0.00071914773,0.00038746354,0.0013196748,0.0017182112,0.001016814],"domain_scores_gemma":[0.99491465,0.0026562188,0.00015283626,0.0015642638,0.0005015275,0.00021052234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036598889,0.0003026848,0.0003641462,0.00073753565,0.0012787965,0.00071031286,0.0025339916,0.00020494184,0.000036498157],"category_scores_gemma":[0.0008160836,0.00029949716,0.00030303476,0.0007840563,0.00008065013,0.000055766966,0.00513404,0.0019186004,0.000019215047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005067566,0.00009093502,0.00003303235,0.00054441846,0.000022331793,0.000021523458,0.0013103405,0.90436393,0.00004884364,0.0032755407,0.00015543154,0.09012862],"study_design_scores_gemma":[0.00018026156,0.00016879426,0.00095945806,0.00033327242,0.0000042212505,0.000003430404,0.000071664144,0.9778982,0.00008886148,0.0063696825,0.01359963,0.00032252847],"about_ca_topic_score_codex":0.000055678487,"about_ca_topic_score_gemma":0.0000028113839,"teacher_disagreement_score":0.91047645,"about_ca_system_score_codex":0.00040073498,"about_ca_system_score_gemma":0.0006025996,"threshold_uncertainty_score":0.9999457},"labels":[],"label_agreement":null},{"id":"W4302362640","doi":"10.1038/s41567-022-01742-5","title":"Quantum Hamiltonian complexity in thermal equilibrium","year":2022,"lang":"en","type":"article","venue":"Nature Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Army Research Office; Canadian Institute for Advanced Research","keywords":"Physics; Hamiltonian (control theory); Thermal equilibrium; Quantum; Thermal; Quantum mechanics; Statistical physics; Theoretical physics; Classical mechanics; Thermodynamics","score_opus":0.0194647499031363,"score_gpt":0.2593408568422162,"score_spread":0.2398761069390799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302362640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97300935,0.00046640408,0.019149732,0.0035145187,0.0016369793,0.00022043027,0.000022877064,0.0003553014,0.0016243872],"genre_scores_gemma":[0.9893564,3.1449784e-7,0.009108862,0.0011997733,0.0002594222,0.000011194114,0.000009672568,0.000015347025,0.000039008057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983513,0.00016817893,0.00017128805,0.00044434544,0.00046083258,0.0004040713],"domain_scores_gemma":[0.99917847,0.0000801867,0.00008078066,0.0005684496,0.000029293866,0.00006280817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002670425,0.00017186748,0.00019716835,0.00007048024,0.00023401735,0.000082335646,0.0013205378,0.000067076646,0.00001326803],"category_scores_gemma":[0.000010769048,0.00016455022,0.00009561172,0.0008422168,0.00005368851,0.0001515959,0.0011482685,0.0016483419,0.0000092210375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004337364,0.0008883333,0.0021513912,0.00004770058,0.00004572567,0.00027558164,0.0053720567,0.20832048,0.013789063,0.6312057,0.0028548245,0.1350058],"study_design_scores_gemma":[0.00037849316,0.000101391,0.011022522,0.000008587954,0.0000019554889,0.0000210538,0.000020589745,0.90516317,0.0007450078,0.07864991,0.0036053779,0.00028194053],"about_ca_topic_score_codex":0.00003615251,"about_ca_topic_score_gemma":0.0000053067884,"teacher_disagreement_score":0.6968427,"about_ca_system_score_codex":0.00006998624,"about_ca_system_score_gemma":0.00008777503,"threshold_uncertainty_score":0.7161317},"labels":[],"label_agreement":null},{"id":"W4303986923","doi":"10.1038/s41598-022-20375-5","title":"An optimizing method for performance and resource utilization in quantum machine learning circuits","year":2022,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Electronic circuit; Resource (disambiguation); Quantum; Machine learning; Artificial intelligence; Computer engineering; Computer network; Electrical engineering; Engineering","score_opus":0.023667371282545778,"score_gpt":0.2768634904240757,"score_spread":0.25319611914152995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4303986923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4325871,0.00019086899,0.565284,0.00014174159,0.0013292617,0.0002439246,0.0000010175615,0.0001372356,0.00008483109],"genre_scores_gemma":[0.91026026,0.0000017724813,0.08931309,0.000049295133,0.000031304906,0.00003382335,0.000033844328,0.00001349971,0.00026313326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978519,0.00021927772,0.0003407312,0.0008881512,0.000380015,0.00031991675],"domain_scores_gemma":[0.99902964,0.00008656065,0.00022014252,0.0005340848,0.000048192094,0.00008137564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044326396,0.00011701794,0.00015358029,0.000311688,0.0012650708,0.00039504736,0.00034562557,0.000024622612,0.0000054986117],"category_scores_gemma":[0.00008127703,0.0001172435,0.00003564712,0.0008383096,0.000043408345,0.0002698484,0.00033348592,0.00026150336,2.1975204e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038293692,0.000057652996,0.002500965,0.000030340336,0.0000031967763,0.000067049885,0.0032485721,0.75293016,0.0030186113,0.0005705272,0.00015429438,0.23741478],"study_design_scores_gemma":[0.00012331182,0.00013165803,0.0006268283,0.000014578498,0.0000021677267,0.0003868927,0.000091926624,0.97279966,0.00062211923,0.0018877763,0.023165986,0.00014706851],"about_ca_topic_score_codex":0.000019817768,"about_ca_topic_score_gemma":0.000003936734,"teacher_disagreement_score":0.47767317,"about_ca_system_score_codex":0.000038675946,"about_ca_system_score_gemma":0.00007577919,"threshold_uncertainty_score":0.973003},"labels":[],"label_agreement":null},{"id":"W4304140399","doi":"10.21203/rs.3.rs-2136572/v1","title":"Variational Quantum Approximate Support Vector Machine With Inference Transfer","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Samsung","keywords":"Quantum machine learning; Support vector machine; Qubit; Computer science; MNIST database; Parameterized complexity; Quantum; Quantum circuit; Quadratic equation; Inference; Quadratic unconstrained binary optimization; Algorithm; Quantum computer; Mathematics; Artificial intelligence; Artificial neural network; Quantum error correction; Quantum mechanics","score_opus":0.037986803794837314,"score_gpt":0.33811744743296845,"score_spread":0.30013064363813113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304140399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027264534,0.0003598169,0.9631318,0.004399869,0.0007489713,0.0014682423,0.0004699881,0.0006377119,0.0015190993],"genre_scores_gemma":[0.9620427,0.000070444155,0.03600465,0.000114252674,0.0003569955,0.00046224127,0.00044687878,0.000076213,0.0004256177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929313,0.00094121863,0.00045140676,0.0015236981,0.0030331505,0.0011192474],"domain_scores_gemma":[0.9966133,0.0007571908,0.00008957067,0.0016920556,0.00051976077,0.00032807438],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025406494,0.0004677206,0.00050722563,0.0006659312,0.00081834383,0.0007471276,0.0032676111,0.00021174047,0.0007232188],"category_scores_gemma":[0.00014122871,0.00037979058,0.00019237917,0.0011821386,0.00018118352,0.00017832582,0.0040253066,0.004143893,0.000045628065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032636628,0.0016461739,0.004658289,0.0033445426,0.0005250104,0.0015665179,0.012307037,0.2912203,0.00022601118,0.6378557,0.0025460804,0.04377795],"study_design_scores_gemma":[0.0005042838,0.00087025407,0.0064124214,0.00023128088,0.00000893339,0.00004928923,0.000046692814,0.96661377,0.000056886773,0.019200932,0.005413786,0.0005914563],"about_ca_topic_score_codex":0.00034233773,"about_ca_topic_score_gemma":0.000030403984,"teacher_disagreement_score":0.93477815,"about_ca_system_score_codex":0.00023775829,"about_ca_system_score_gemma":0.0018959536,"threshold_uncertainty_score":0.9998654},"labels":[],"label_agreement":null},{"id":"W4304690523","doi":"10.1140/epjqt/s40507-022-00145-y","title":"Quantum encryption with quantum permutation pad in IBMQ systems","year":2022,"lang":"en","type":"article","venue":"EPJ Quantum Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Quantum computer; Computer science; Encryption; Quantum network; Quantum cryptography; Quantum algorithm; Qubit; Theoretical computer science; Algorithm; Quantum information; Mathematics; Quantum mechanics; Physics; Quantum; Computer network","score_opus":0.007411307194852339,"score_gpt":0.2173911442985242,"score_spread":0.20997983710367188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304690523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78240263,0.00095887686,0.20955503,0.0041969097,0.0011206988,0.00049766066,0.000007986276,0.0011925916,0.00006759186],"genre_scores_gemma":[0.9946947,0.000030460258,0.004685835,0.00013584795,0.000077325705,0.0002720169,0.000018875402,0.00004397817,0.000040921914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634254,0.0003542852,0.0006436206,0.001087869,0.00069297315,0.00087868574],"domain_scores_gemma":[0.9982675,0.0001660463,0.00027273246,0.0010892954,0.00010834661,0.000096100935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000760158,0.00039718454,0.0005218609,0.0014648114,0.0006365172,0.00014489063,0.0017670991,0.00020680415,0.000020741545],"category_scores_gemma":[0.0000620554,0.0003634532,0.00008482178,0.0030880165,0.00019184103,0.0002896258,0.00064645807,0.0012429433,0.000050421077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004645487,0.00028606862,0.0020899507,0.000051506384,0.00003192628,0.00046235195,0.0015248283,0.03552124,0.0036095562,0.9487771,0.00023502465,0.0073640104],"study_design_scores_gemma":[0.00086468057,0.0012207094,0.001279116,0.00006798329,0.000008522397,0.0007973684,0.0012114452,0.93050885,0.00028872106,0.059531696,0.0036915406,0.0005293519],"about_ca_topic_score_codex":0.00024739475,"about_ca_topic_score_gemma":0.000026403066,"teacher_disagreement_score":0.89498764,"about_ca_system_score_codex":0.0002401059,"about_ca_system_score_gemma":0.00019503068,"threshold_uncertainty_score":0.99988174},"labels":[],"label_agreement":null},{"id":"W4306409810","doi":"10.1103/physreva.106.042422","title":"Quantifying multiqubit magic channels with completely stabilizer-preserving operations","year":2022,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); MAGIC (telescope); Computer science; Upper and lower bounds; Algorithm; Linear programming; Entropy (arrow of time); Theoretical computer science; Topology (electrical circuits); Mathematics; Physics; Combinatorics; Quantum mechanics","score_opus":0.040643262573182896,"score_gpt":0.35778857069865044,"score_spread":0.31714530812546754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306409810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53811455,0.1390902,0.28157443,0.03096518,0.0008903978,0.00656585,0.00011759261,0.0013162023,0.0013655851],"genre_scores_gemma":[0.9685498,0.009766589,0.01298584,0.00727718,0.00058453646,0.0006427798,0.000049935246,0.0000866145,0.000056723635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946691,0.0009993211,0.0007112986,0.0013394739,0.0014018556,0.00087897805],"domain_scores_gemma":[0.99664795,0.00067835255,0.0002955181,0.0017604624,0.0002415607,0.0003761567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008483479,0.00062818825,0.0015715776,0.000085555796,0.0008973889,0.00022023912,0.002580426,0.00001979233,0.000077926044],"category_scores_gemma":[0.00038241214,0.00046833983,0.000648988,0.0019969612,0.00013838451,0.0004683188,0.0021174233,0.0011944268,0.0001813831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008488527,0.010189996,0.00048676488,0.040481366,0.00075009133,0.000538605,0.005198332,0.114472345,0.043055262,0.3148958,0.017773233,0.4520733],"study_design_scores_gemma":[0.0004057507,0.00065106037,0.00017470318,0.005813285,0.00015231855,0.00007000925,0.000015808817,0.9428147,0.0006048653,0.0059458734,0.04246953,0.0008820801],"about_ca_topic_score_codex":0.00006526487,"about_ca_topic_score_gemma":0.0000085771035,"teacher_disagreement_score":0.8283424,"about_ca_system_score_codex":0.0001132922,"about_ca_system_score_gemma":0.00017859951,"threshold_uncertainty_score":0.99977684},"labels":[],"label_agreement":null},{"id":"W4307081151","doi":"","title":"Quantum dot charge autotuning with Bayesian Neural Networks for spin qubit applications","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut interdisciplinaire d'innovation technologique; Université de Sherbrooke","funders":"","keywords":"Qubit; Quantum dot; Charge (physics); Bayesian probability; Spin (aerodynamics); Artificial neural network; Computer science; Quantum; Quantum computer; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.011199896519448955,"score_gpt":0.2326302692276538,"score_spread":0.22143037270820487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307081151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045999843,0.0007967436,0.978916,0.010948371,0.00037759077,0.0013324688,0.00006132568,0.00076932035,0.0021982272],"genre_scores_gemma":[0.5019292,0.000099671,0.49280357,0.00040359938,0.00016910316,0.0013876371,0.000754187,0.0001222562,0.00233076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99447256,0.0022593609,0.0005925386,0.001457849,0.0005300338,0.0006876638],"domain_scores_gemma":[0.9935573,0.001307541,0.00071455864,0.0032237933,0.00093374215,0.00026307817],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.003579203,0.0005036254,0.00050205516,0.00027020226,0.0013127669,0.0009169322,0.00376713,0.000214724,0.000053443735],"category_scores_gemma":[0.00018113309,0.0004978027,0.00028777996,0.00078651536,0.00016936113,0.0001599255,0.0032453972,0.001318065,0.0000051220272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026748823,0.0007425611,0.00059351634,0.00033371977,0.00018101747,0.000015429705,0.008296812,0.10653498,0.00020423636,0.5926365,0.00102731,0.28940713],"study_design_scores_gemma":[0.00045280688,0.0000022844017,0.00026110085,0.00036547222,0.000027358281,0.00002401093,0.000032013966,0.97219455,0.00032569922,0.005239201,0.020520495,0.0005550047],"about_ca_topic_score_codex":0.0003316791,"about_ca_topic_score_gemma":0.00016613456,"teacher_disagreement_score":0.8656596,"about_ca_system_score_codex":0.00012747479,"about_ca_system_score_gemma":0.00033159638,"threshold_uncertainty_score":0.99998736},"labels":[],"label_agreement":null},{"id":"W4307203248","doi":"10.1038/s41467-022-33923-4","title":"Single-shot quantum error correction with the three-dimensional subsystem toric code.","year":2022,"lang":"en","type":"article","venue":"PubMed","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Computer science; Error detection and correction; Quantum error correction; Decoding methods; Parity bit; Algorithm; Quantum; Quantum computer; Fault tolerance; Code (set theory); Lattice (music); Topology (electrical circuits); Mathematics; Physics; Distributed computing; Set (abstract data type); Quantum mechanics; Combinatorics","score_opus":0.02827605352150427,"score_gpt":0.2059487603919217,"score_spread":0.17767270687041742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307203248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8641241,0.0005532966,0.11211972,0.0099939,0.010173598,0.0014003103,0.000014034252,0.00082204613,0.00079897314],"genre_scores_gemma":[0.99767756,1.9702448e-7,0.00063416373,0.0004456108,0.00023055804,0.00055827823,0.0000035106739,0.0000164528,0.0004336651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981091,0.00019046677,0.00017345318,0.0004443442,0.0006299613,0.00045270138],"domain_scores_gemma":[0.9990038,0.00019559068,0.00014358459,0.00050534203,0.00005731589,0.00009435722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066747953,0.00016448936,0.00015808789,0.00008755946,0.0008539424,0.00014250215,0.00083557836,0.000024922041,0.0000064101573],"category_scores_gemma":[0.000018290493,0.00010465621,0.00006638065,0.00076822395,0.000047666912,0.00010758507,0.0004469817,0.0003687654,0.0000047010576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015728388,0.00051641284,0.0022179724,0.000033714005,0.000133937,0.00017009916,0.0015698982,0.26879373,0.00011751552,0.0064683105,0.03483995,0.68498117],"study_design_scores_gemma":[0.00035841533,0.00020986184,0.03246327,0.0000066685025,0.000011663923,0.00049163,0.000073733034,0.9414371,0.00011272949,0.00033593673,0.024235424,0.00026355966],"about_ca_topic_score_codex":0.00006821351,"about_ca_topic_score_gemma":0.00011248852,"teacher_disagreement_score":0.6847176,"about_ca_system_score_codex":0.00012553869,"about_ca_system_score_gemma":0.00005341325,"threshold_uncertainty_score":0.6567921},"labels":[],"label_agreement":null},{"id":"W4307281054","doi":"10.1103/physrevb.106.165126","title":"Qubit-efficient simulation of thermal states with quantum tensor networks","year":2022,"lang":"en","type":"article","venue":"Physical review. B./Physical review. B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Alfred P. Sloan Foundation; National Science Foundation","keywords":"Qubit; Quantum; Quantum computer; Quantum simulator; Density matrix; Physics; Operator (biology); Matrix multiplication; Statistical physics; Quantum state; Quantum mechanics; Matrix product state; Topology (electrical circuits); Mathematics; Chemistry","score_opus":0.011261510582839718,"score_gpt":0.31358936090434275,"score_spread":0.30232785032150306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307281054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36653635,0.038887512,0.5885844,0.0033036135,0.0002467967,0.0019520278,0.000026891232,0.0002813042,0.0001810707],"genre_scores_gemma":[0.9915561,0.003744666,0.0011959397,0.002902055,0.00034115685,0.00017067845,0.000029328534,0.00004678861,0.000013254297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957798,0.000687301,0.00070743647,0.0008998463,0.0012618331,0.00066374696],"domain_scores_gemma":[0.9968129,0.000884991,0.0006380464,0.0011896499,0.0002351668,0.00023927767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000687544,0.00049529027,0.0013809701,0.000062865314,0.00033679494,0.000048600206,0.0014077738,0.000020513005,0.000026464342],"category_scores_gemma":[0.00014866958,0.00034325023,0.0005914049,0.0016596001,0.00015071862,0.00014441222,0.00084372825,0.0007980117,0.000036458277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017601242,0.0008831116,0.000028012899,0.0013313725,0.00005097271,0.000014915493,0.00017688033,0.8946065,0.0002700076,0.04521832,0.00045263622,0.056949727],"study_design_scores_gemma":[0.00024447564,0.00066205097,0.00032844293,0.0023699054,0.00012640844,0.000008791092,0.000004757817,0.9840512,0.00010559071,0.0056681265,0.0059886365,0.00044158936],"about_ca_topic_score_codex":0.000015929194,"about_ca_topic_score_gemma":3.1614124e-7,"teacher_disagreement_score":0.6250198,"about_ca_system_score_codex":0.00006866534,"about_ca_system_score_gemma":0.00010520237,"threshold_uncertainty_score":0.99990195},"labels":[],"label_agreement":null},{"id":"W4307641340","doi":"10.1103/physreva.106.042443","title":"Optimization of variational-quantum-eigensolver measurement by partitioning Pauli operators using multiqubit Clifford gates on noisy intermediate-scale quantum hardware","year":2022,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Pauli exclusion principle; Speedup; Quantum; Quantum algorithm; Quantum number; Quantum state; Physics; Quantum mechanics; Pauli matrices; Quantum computer; Algorithm; Computer science; Mathematics; Parallel computing","score_opus":0.02245600940756311,"score_gpt":0.31227058545402586,"score_spread":0.28981457604646277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307641340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22391425,0.04001758,0.7273964,0.004029169,0.0009457043,0.0029710538,0.00023189168,0.00037199835,0.000121937956],"genre_scores_gemma":[0.97420496,0.011612331,0.008797732,0.0043176683,0.00044908313,0.00038779707,0.00013847652,0.00008353772,0.000008437098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946782,0.00083552994,0.0009985676,0.0010150932,0.0018783988,0.0005942327],"domain_scores_gemma":[0.9973221,0.00034746825,0.00072480174,0.00088416063,0.00045166494,0.00026982775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011017774,0.000537277,0.0013205839,0.00008713756,0.000516312,0.000088903864,0.0011332416,0.000033908047,0.000052897634],"category_scores_gemma":[0.0005344077,0.0004497588,0.0006636045,0.0012105986,0.00010536579,0.00031833994,0.0006827885,0.0006825066,0.000036390582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108762666,0.009821779,0.0005256044,0.013858099,0.0006212827,0.00005086909,0.0018226408,0.7717627,0.051977213,0.056231625,0.015342952,0.07787646],"study_design_scores_gemma":[0.00032471356,0.0004230105,0.0001395325,0.0053565893,0.00015530363,0.0000063168877,0.00000773507,0.9812553,0.0026235012,0.0030045311,0.006177079,0.00052641437],"about_ca_topic_score_codex":0.000025338812,"about_ca_topic_score_gemma":7.500245e-7,"teacher_disagreement_score":0.7502907,"about_ca_system_score_codex":0.00025327434,"about_ca_system_score_gemma":0.00018478832,"threshold_uncertainty_score":0.99979544},"labels":[],"label_agreement":null},{"id":"W4308409298","doi":"10.28991/esj-2023-07-01-020","title":"A Brief Review on Mathematical Tools Applicable to Quantum Computing for Modelling and Optimization Problems in Engineering","year":2022,"lang":"en","type":"review","venue":"Emerging Science Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Quantum computer; Variety (cybernetics); Quantum; Management science; Engineering optimization; Perspective (graphical); Laplace transform; Optimization problem; Computational science; Theoretical computer science; Mathematics; Algorithm; Artificial intelligence; Engineering; Physics","score_opus":0.053051576586147425,"score_gpt":0.3145384717035994,"score_spread":0.26148689511745193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308409298","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037453924,0.41034684,0.5885834,0.00012574602,0.00021677755,0.0006662234,0.000001300821,0.00004350465,0.000012474867],"genre_scores_gemma":[0.0000040107366,0.62520915,0.3744377,0.00014110105,0.000120405595,0.000054357337,0.0000014415937,0.000026413227,0.0000054651414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667394,0.000076216966,0.0009554266,0.0008086545,0.00074998406,0.00073580287],"domain_scores_gemma":[0.99835885,0.00047170193,0.0004334502,0.00040096886,0.0000716759,0.00026332762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048742723,0.00037105868,0.0010529596,0.0007898884,0.0007359589,0.0008320082,0.0016526198,0.000057269845,0.0000075292755],"category_scores_gemma":[0.00024429502,0.0003077727,0.00019714648,0.0023065866,0.000041192077,0.00036658449,0.0006251084,0.00091632555,0.0000018677842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.1366743e-7,0.000014580672,4.565385e-8,0.003967329,0.000003532134,0.0000035395087,0.00013240289,0.617909,1.250761e-7,0.0010884119,0.000013251655,0.37686753],"study_design_scores_gemma":[0.000073182855,0.00008728934,8.727829e-8,0.033945724,0.000019892355,0.00036915898,0.00000403478,0.82018155,1.06646006e-7,0.00039017585,0.14463565,0.00029316108],"about_ca_topic_score_codex":0.0000018707033,"about_ca_topic_score_gemma":6.551226e-8,"teacher_disagreement_score":0.3765744,"about_ca_system_score_codex":0.00023522414,"about_ca_system_score_gemma":0.00037235278,"threshold_uncertainty_score":0.9999374},"labels":[],"label_agreement":null},{"id":"W4308435052","doi":"10.1103/physrevlett.129.200401","title":"Irreducible Magic Sets for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\"><mml:mi>n</mml:mi></mml:math>-Qubit Systems","year":2022,"lang":"lv","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"QuantERA; Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación; Ministerio de Economía y Competitividad; Bundesministerium für Bildung und Forschung","keywords":"MAGIC (telescope); Qubit; Observable; Quantum mechanics; Physics; Magic square; Discrete mathematics; Combinatorics; Quantum; Mathematics; Theoretical physics","score_opus":0.020475957387233117,"score_gpt":0.26710969293766523,"score_spread":0.2466337355504321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308435052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.963744,0.010107656,0.011862825,0.01057785,0.0028482878,0.0003480559,0.00018933535,0.00020040869,0.00012158717],"genre_scores_gemma":[0.9750503,0.0011602365,0.0043743327,0.015836455,0.0023798193,0.0007688827,0.00018846415,0.00018009821,0.0000614297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546087,0.00030746174,0.00080116856,0.0012500894,0.0011289231,0.0010514853],"domain_scores_gemma":[0.99676836,0.00071532396,0.000735863,0.0014000657,0.00005905634,0.0003213281],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010401802,0.00053774926,0.00059136003,0.0000887075,0.0009153301,0.0005373321,0.0017018882,0.00007995365,0.000012277398],"category_scores_gemma":[0.00017694854,0.00057600345,0.0010216119,0.00068914634,0.00023464147,0.0003043166,0.0014455612,0.00097572425,0.00067122054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029279076,0.00025681584,0.000001162757,0.0039094714,0.00017727198,0.00017617934,0.00069671194,0.01441723,0.00061058183,0.9663379,0.0056678993,0.0077194585],"study_design_scores_gemma":[0.0003397067,0.00044941925,0.000014254558,0.0023479895,0.0002645081,0.00026618375,0.000046966143,0.9514744,0.0001186971,0.00032757246,0.04382164,0.00052864006],"about_ca_topic_score_codex":0.00014040657,"about_ca_topic_score_gemma":0.000002699598,"teacher_disagreement_score":0.9660104,"about_ca_system_score_codex":0.000041520998,"about_ca_system_score_gemma":0.00025764413,"threshold_uncertainty_score":0.99966913},"labels":[],"label_agreement":null},{"id":"W4308883770","doi":"10.1103/physrevd.106.094502","title":"Toward the real-time evolution of gauge-invariant <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\"><mml:msub><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math> and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\"><mml:mi>U</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math> quantum link models on noisy intermediate-scale quantum hardware with error mitigation","year":2022,"lang":"lv","type":"article","venue":"Physical review. D/Physical review. D.","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Quantum computer; Computer science; Quantum simulator; Quantum; Quantum algorithm; Algorithm; Quantum decoherence; Qubit; Theoretical computer science; Computational science; Physics; Quantum mechanics","score_opus":0.01683918613078757,"score_gpt":0.27718036451131944,"score_spread":0.2603411783805319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308883770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9789026,0.006804729,0.003969583,0.0030374548,0.002270148,0.00043666773,0.0019740926,0.00058611913,0.0020186424],"genre_scores_gemma":[0.9730748,0.011559928,0.0038480805,0.0021676663,0.0035937878,0.002309624,0.0023967312,0.0010007862,0.000048622554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98137236,0.0015054441,0.004032507,0.0041989237,0.005249853,0.0036409118],"domain_scores_gemma":[0.9851463,0.0030505152,0.005061318,0.0043221116,0.0005461658,0.0018736281],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0039213235,0.0023416774,0.0017643471,0.0005265137,0.0029339253,0.0018029518,0.0048807263,0.0016435491,0.0005954509],"category_scores_gemma":[0.001845654,0.0029431684,0.0038988453,0.0027174517,0.0025723013,0.00217617,0.004859772,0.0044806157,0.001775502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013611787,0.0014081274,0.000008506637,0.007067595,0.00157294,0.000902627,0.0028404451,0.00585653,0.0026671735,0.9614193,0.0072731376,0.007622483],"study_design_scores_gemma":[0.0021541354,0.004106047,0.00007314635,0.011900906,0.003256298,0.0011837655,0.0007859123,0.9109732,0.04458288,0.015222393,0.0031159513,0.002645364],"about_ca_topic_score_codex":0.0013633693,"about_ca_topic_score_gemma":0.00030927782,"teacher_disagreement_score":0.94619685,"about_ca_system_score_codex":0.00010329685,"about_ca_system_score_gemma":0.0022812148,"threshold_uncertainty_score":0.9996525},"labels":[],"label_agreement":null},{"id":"W4309026783","doi":"10.3390/e24111656","title":"A Preprocessing Perspective for Quantum Machine Learning Classification Advantage in Finance Using NISQ Algorithms","year":2022,"lang":"en","type":"article","venue":"Entropy","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Quantum machine learning; Computer science; Quantum computer; Qubit; Algorithm; Quantum algorithm; Quantum; Linear discriminant analysis; Artificial intelligence; Machine learning","score_opus":0.021447758362585497,"score_gpt":0.2883555164143851,"score_spread":0.2669077580517996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309026783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13339265,0.00084650103,0.8642241,0.000722804,0.00033658784,0.00028236018,0.000008960337,0.00014265113,0.000043407246],"genre_scores_gemma":[0.8233584,0.00000771904,0.17630267,0.0000769298,0.000096524454,0.00005344505,0.000006776945,0.00001840107,0.00007910053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835646,0.00015446814,0.0002384062,0.0006180391,0.0002637142,0.00036891538],"domain_scores_gemma":[0.9992926,0.00014094698,0.00019204027,0.00027752647,0.00006059992,0.000036261772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045408568,0.00015406651,0.00018543596,0.00017918782,0.00066847797,0.00010844075,0.0005375733,0.000027559463,0.0000065687623],"category_scores_gemma":[0.00009380019,0.00016035895,0.000075516495,0.0005680068,0.000029117922,0.00020160445,0.00032612332,0.00045053475,0.0000015297301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008357035,0.0003523523,0.0027743648,0.000051124713,0.00002401191,0.00006294554,0.011705389,0.66518927,0.010673857,0.25579545,0.00004121184,0.05324647],"study_design_scores_gemma":[0.00055079005,0.00015513768,0.00057317776,0.000021807462,0.0000035664957,0.00003985246,0.00077723456,0.98339176,0.00020183017,0.012450176,0.0016390337,0.00019563506],"about_ca_topic_score_codex":0.000109983506,"about_ca_topic_score_gemma":0.0000038701037,"teacher_disagreement_score":0.6899658,"about_ca_system_score_codex":0.00028939903,"about_ca_system_score_gemma":0.00011282007,"threshold_uncertainty_score":0.6539248},"labels":[],"label_agreement":null},{"id":"W4309303298","doi":"10.21203/rs.3.rs-2185180/v1","title":"Purification-based quantum error mitigation of pair-correlated electron simulations","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Kavli Institute for Theoretical Physics, University of California, Santa Barbara; National Science Foundation","keywords":"Electron; Quantum; Statistical physics; Physics; Computer science; Quantum mechanics","score_opus":0.03869047415454525,"score_gpt":0.36001429610939667,"score_spread":0.32132382195485143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309303298","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7324134,0.0009857118,0.25682554,0.0060746972,0.00078039506,0.0018941776,0.00023708818,0.0005682812,0.00022067613],"genre_scores_gemma":[0.987339,0.000012869885,0.011651803,0.000031645588,0.000119485616,0.00013907478,0.0005372308,0.000038918926,0.0001299751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99434555,0.0014347883,0.0006221929,0.0010120057,0.0018784939,0.00070700207],"domain_scores_gemma":[0.99553055,0.0012869589,0.00035253746,0.0017824554,0.0008779838,0.00016954541],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001907624,0.0002910803,0.00037791044,0.0010126207,0.00067415147,0.00021794066,0.0021013517,0.00026945883,0.00012301281],"category_scores_gemma":[0.0005152364,0.00029759225,0.00025057385,0.0018661425,0.00015833038,0.000105738945,0.0014422816,0.002676563,0.000017675822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002149827,0.00032312534,0.0011990923,0.00052678504,0.00004678251,0.000013389386,0.0008833409,0.97587293,0.0011419728,0.013183972,0.0007916046,0.0059954966],"study_design_scores_gemma":[0.0002540532,0.0002948388,0.005517413,0.00024873493,0.000007804773,0.0000016819054,0.000051615592,0.97450894,0.002149354,0.015052477,0.0016384575,0.0002746286],"about_ca_topic_score_codex":0.00024308069,"about_ca_topic_score_gemma":0.000018744682,"teacher_disagreement_score":0.25492555,"about_ca_system_score_codex":0.00030745738,"about_ca_system_score_gemma":0.0015086165,"threshold_uncertainty_score":0.9999476},"labels":[],"label_agreement":null},{"id":"W4309310085","doi":"10.3390/rs14225774","title":"Quantum Based Pseudo-Labelling for Hyperspectral Imagery: A Simple and Efficient Semi-Supervised Learning Method for Machine Learning Classifiers","year":2022,"lang":"en","type":"article","venue":"Remote Sensing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mitacs; Sapienza Università di Roma; Innovation Saskatchewan","keywords":"Support vector machine; Hyperspectral imaging; Quantum machine learning; Computer science; Decision tree; Artificial intelligence; Random forest; Machine learning; Quantum; Boosting (machine learning); Classifier (UML); Quantum computer; Pattern recognition (psychology); Algorithm; Physics","score_opus":0.017171823922774263,"score_gpt":0.26359896550106693,"score_spread":0.24642714157829265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309310085","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16643491,0.0002468533,0.83104885,0.0011731847,0.00028412614,0.00044222426,0.000007744291,0.00034226786,0.000019858824],"genre_scores_gemma":[0.30222687,0.000003124192,0.69723415,0.00029070495,0.00012460924,5.346943e-7,0.000026398846,0.000050150637,0.00004345355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971876,0.00046278766,0.0003526427,0.00088147493,0.0003504238,0.0007650828],"domain_scores_gemma":[0.99766684,0.00154809,0.00020773549,0.00031339255,0.00010670823,0.00015722877],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001848998,0.0003090119,0.00041489382,0.00026532408,0.0021820355,0.0002687972,0.0003255546,0.00006394967,0.0000025942202],"category_scores_gemma":[0.00034028676,0.00031851226,0.00022485835,0.00050463213,0.000044647153,0.00006336021,0.0003158696,0.0007740499,5.347335e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004900519,0.000016867083,0.000005220612,0.000058645917,0.00002382016,0.000016810958,0.0012327154,0.7394888,0.02999883,0.0003128766,0.000023000093,0.22877342],"study_design_scores_gemma":[0.0012426542,0.00039167417,0.000004638909,0.000042499854,0.000031379717,0.00013595833,0.0003873418,0.99015486,0.0017271603,0.0013535671,0.004123695,0.00040459316],"about_ca_topic_score_codex":0.00009946308,"about_ca_topic_score_gemma":0.0000024491999,"teacher_disagreement_score":0.25066605,"about_ca_system_score_codex":0.00012526855,"about_ca_system_score_gemma":0.00011199577,"threshold_uncertainty_score":0.9999267},"labels":[],"label_agreement":null},{"id":"W4309758171","doi":"10.1103/physrevlett.129.220501","title":"Demonstration of Tunable Three-Body Interactions between Superconducting Qubits","year":2022,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; Canadian Institute for Advanced Research","funders":"Intelligence Advanced Research Projects Activity; Office of the Director of National Intelligence","keywords":"Flux qubit; Quantum computer; Physics; Qubit; Hamiltonian (control theory); Quantum error correction; Quantum; Quantum mechanics; Superconducting quantum computing; Quantum information; Interferometry; Quantum circuit; Quantum annealing; Computer science; Topology (electrical circuits); Quantum gate; Mathematics","score_opus":0.02565128513487381,"score_gpt":0.2923544040500061,"score_spread":0.2667031189151323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309758171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8566173,0.0009820074,0.12525952,0.016344788,0.00027122922,0.00025897077,0.0000069284633,0.00010298393,0.00015629712],"genre_scores_gemma":[0.9925912,0.000025721902,0.004857695,0.0022787738,0.00019960046,0.000026062333,0.000007645498,0.000008226068,0.0000050588387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880767,0.0001520095,0.00025747338,0.00028305454,0.00030209555,0.00019767928],"domain_scores_gemma":[0.99922174,0.00022304348,0.00013493067,0.00033980559,0.000028952121,0.0000515297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027182561,0.000114665396,0.00028256484,0.000050697963,0.00018979727,0.000028456347,0.0005521262,0.0000032079708,0.000013886308],"category_scores_gemma":[0.000028230808,0.0001041628,0.00015514447,0.00049390364,0.000032579424,0.00023215081,0.00033634243,0.00034940694,0.00000942284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007317702,0.00095428695,0.008155953,0.0025897499,0.0003628974,0.00005368715,0.0032138084,0.04925176,0.3202945,0.040935945,0.013877979,0.5603021],"study_design_scores_gemma":[0.00049059425,0.00038709643,0.007054669,0.0015898919,0.00017831003,0.00010076717,0.00005482624,0.953191,0.0059750364,0.005533939,0.024469431,0.0009744716],"about_ca_topic_score_codex":0.000035895104,"about_ca_topic_score_gemma":9.304507e-7,"teacher_disagreement_score":0.9039392,"about_ca_system_score_codex":0.0000330078,"about_ca_system_score_gemma":0.000028651224,"threshold_uncertainty_score":0.42476356},"labels":[],"label_agreement":null},{"id":"W4310001488","doi":"10.48550/arxiv.2205.08479","title":"Opportunistic Routing in Quantum Networks","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Policy-based routing; Static routing; Link-state routing protocol; Equal-cost multi-path routing; Multipath routing; Routing (electronic design automation); Computer network; Dynamic Source Routing; Path (computing); Distributed computing; Routing protocol","score_opus":0.05654096027359945,"score_gpt":0.19238782248408332,"score_spread":0.13584686221048387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310001488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20965388,0.000050699582,0.78706455,0.00014699165,0.0014272503,0.00022168517,0.000009410574,0.00034768952,0.0010778276],"genre_scores_gemma":[0.99788815,0.000067414076,0.0013103371,0.00014567284,0.00012617538,0.000001196932,0.00002666199,0.000024804749,0.00040957754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972955,0.00031062623,0.00030373997,0.0013687768,0.000120342615,0.0006010165],"domain_scores_gemma":[0.99798685,0.00021508514,0.00030186935,0.0012716975,0.000046322373,0.00017820159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058918854,0.00036387923,0.0004160386,0.00036762332,0.00029228927,0.00015656117,0.002696048,0.00021014016,0.00004911307],"category_scores_gemma":[0.00003994816,0.0004404333,0.00021216882,0.00097591203,0.00007009502,0.00013009427,0.005832916,0.0017842647,0.0000105556155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059136446,0.000052604897,0.0014513474,0.000019367744,0.00001854209,0.001275523,0.00017299593,0.8134431,0.0000010330165,0.18187244,0.00006611395,0.001620964],"study_design_scores_gemma":[0.00027055613,0.000046503366,0.0013076016,0.00008677345,0.000014823783,0.000012274702,0.000060526778,0.97563267,6.356997e-7,0.021820387,0.00027799423,0.0004692351],"about_ca_topic_score_codex":0.00029816592,"about_ca_topic_score_gemma":0.000030130961,"teacher_disagreement_score":0.7882343,"about_ca_system_score_codex":0.00026037544,"about_ca_system_score_gemma":0.0002754989,"threshold_uncertainty_score":0.99980474},"labels":[],"label_agreement":null},{"id":"W4310557743","doi":"10.17169/refubium-43258","title":"Extracting GHZ states from linear cluster states","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; European Commission","keywords":"Cluster state; Quantum entanglement; Qubit; State (computer science); LOCC; Cluster (spacecraft); Quantum computer; Topology (electrical circuits); Quantum state; Computation; Quantum; Set (abstract data type); Computer science; Physics; Mathematics; Quantum mechanics; Algorithm; Combinatorics; Computer network","score_opus":0.039587173886422626,"score_gpt":0.19550954053425842,"score_spread":0.1559223666478358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310557743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5556058,0.00011033644,0.44209367,0.00029511872,0.0009918669,0.00016468663,0.00008245364,0.00040198604,0.00025402562],"genre_scores_gemma":[0.9715277,0.00017499737,0.02616742,0.0004265461,0.0003150322,0.0000013572145,0.00019493865,0.000045090776,0.0011469285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971033,0.0003113406,0.00029234227,0.0015698535,0.00018653105,0.00053667446],"domain_scores_gemma":[0.9973579,0.00058991497,0.00038604005,0.0013724446,0.00009673067,0.00019696004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035443826,0.00043605999,0.00041458962,0.00025272707,0.00046126766,0.00024889788,0.0025868854,0.00018613409,0.00016602669],"category_scores_gemma":[0.00003343639,0.00048318697,0.00026698125,0.0005115348,0.00008084229,0.00026205103,0.0061712423,0.0015902855,0.00005993332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017827784,0.000072478106,0.0007930262,0.000029459532,0.000092477254,0.00042036184,0.0012335078,0.9928736,0.000008964594,0.0012405575,0.00039069488,0.0028270297],"study_design_scores_gemma":[0.0003388377,0.000054972395,0.00043811573,0.0000640774,0.000035056382,0.000004779943,0.00022942238,0.9542081,0.000047932816,0.03886975,0.005168962,0.00054001255],"about_ca_topic_score_codex":0.001112704,"about_ca_topic_score_gemma":0.000036375895,"teacher_disagreement_score":0.41592625,"about_ca_system_score_codex":0.00017292313,"about_ca_system_score_gemma":0.000173394,"threshold_uncertainty_score":0.999762},"labels":[],"label_agreement":null},{"id":"W4310628400","doi":"10.4230/lipics.esa.2023.10","title":"(No) Quantum Space-Time Tradeoff for USTCON","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Bundesministerium für Bildung und Forschung; QuantERA; Deutsche Forschungsgemeinschaft; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Space (punctuation); Omega; Combinatorics; Complement (music); Quantum walk; Space time; Spectral gap; Mathematics; Binary logarithm; Real line; Time complexity; Upper and lower bounds; Quantum; Discrete mathematics; Physics; Quantum algorithm; Quantum mechanics; Computer science; Mathematical analysis","score_opus":0.04100693012525943,"score_gpt":0.1871412340518533,"score_spread":0.14613430392659385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310628400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19482023,0.00010272228,0.7973152,0.0006291283,0.0026570766,0.00082923385,0.000103819824,0.00082790357,0.0027147313],"genre_scores_gemma":[0.96729463,0.000054111977,0.018700363,0.00026606768,0.00048264375,0.000006787258,0.00007365297,0.000069120804,0.013052648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715847,0.00019204167,0.00024767834,0.0016244921,0.00015149017,0.0006258202],"domain_scores_gemma":[0.9975573,0.00030429187,0.00031459963,0.0014845753,0.00012789865,0.00021136938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004096082,0.00045822468,0.00050559634,0.0003149217,0.0004795573,0.00018964945,0.0029860954,0.00025281607,0.0001295433],"category_scores_gemma":[0.000052323823,0.00052585994,0.00050706585,0.0005444556,0.00009039533,0.00017882614,0.0032200366,0.0009788208,0.000114587696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049525257,0.00015100653,0.00008184235,0.00014840724,0.0001380018,0.0002575906,0.00032486135,0.82055956,0.00008615123,0.17256485,0.004043258,0.0015949438],"study_design_scores_gemma":[0.00049972563,0.00019451571,0.00014507496,0.00004823969,0.000045312576,0.0000087589415,0.000018655935,0.9307654,0.000026577067,0.041639503,0.02601597,0.00059227704],"about_ca_topic_score_codex":0.0000863539,"about_ca_topic_score_gemma":0.0000028209408,"teacher_disagreement_score":0.7786148,"about_ca_system_score_codex":0.00020131133,"about_ca_system_score_gemma":0.000315047,"threshold_uncertainty_score":0.9997193},"labels":[],"label_agreement":null},{"id":"W4310705214","doi":"10.1038/s41467-022-34982-3","title":"Qubit vitrification and entanglement criticality on a quantum simulator","year":2022,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Compute Canada; Université de Sherbrooke","keywords":"Quantum entanglement; Criticality; Qubit; Computer science; Quantum; Physics; Statistical physics; Quantum mechanics; Nuclear physics","score_opus":0.019035444256033568,"score_gpt":0.30013751047218024,"score_spread":0.28110206621614664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310705214","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3571124,0.020963538,0.21689187,0.3897791,0.0030394844,0.0028224532,0.00035420572,0.0023619093,0.0066750515],"genre_scores_gemma":[0.9770947,0.00003568509,0.020316804,0.002404253,0.000030634088,0.00006151736,0.000026954616,0.000008093675,0.000021366579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986195,0.0003531064,0.00019837877,0.00032015503,0.00032373657,0.00018513773],"domain_scores_gemma":[0.99719036,0.00052720617,0.000071287905,0.002063545,0.00006530684,0.000082327446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004762578,0.00011283411,0.000114304086,0.000109293804,0.0011357191,0.000100448146,0.0018489652,0.000059835682,0.000011291904],"category_scores_gemma":[0.00010641107,0.00011084186,0.000049698723,0.00043332065,0.00007215681,0.00007606984,0.0015000749,0.001126937,0.000006193093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063936554,0.00035641907,0.00026870688,0.000005837311,0.000015635658,0.0000021555256,0.000664261,0.0015742391,0.0003024942,0.97702867,0.0016978877,0.018077286],"study_design_scores_gemma":[0.000270408,0.0001412845,0.0044804276,0.000008708629,0.000007632574,0.00001864915,0.00008545156,0.84014845,0.00010931529,0.012443665,0.1421,0.00018601997],"about_ca_topic_score_codex":0.000013721145,"about_ca_topic_score_gemma":0.0000069399734,"teacher_disagreement_score":0.964585,"about_ca_system_score_codex":0.00007672934,"about_ca_system_score_gemma":0.000047747893,"threshold_uncertainty_score":0.8735148},"labels":[],"label_agreement":null},{"id":"W4311111348","doi":"10.1287/mnsc.2022.4578","title":"Quantum Economic Advantage","year":2022,"lang":"en","type":"article","venue":"Management Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Creative Destruction Lab; University of Waterloo; University of Toronto; Perimeter Institute","funders":"","keywords":"Quantum computer; Quantum algorithm; Computer science; Quantum; Cournot competition; Econophysics; Quantum information; Mathematics; Mathematical economics; Physics; Quantum mechanics","score_opus":0.006502536974487467,"score_gpt":0.22857906063166553,"score_spread":0.22207652365717806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311111348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24084495,0.00013236492,0.68284684,0.005137312,0.005574596,0.0005942399,0.00000824211,0.0009687377,0.06389268],"genre_scores_gemma":[0.97013193,0.0000046058485,0.028355572,0.0006921852,0.000038172413,0.000027323144,6.8706004e-7,0.000005973614,0.00074352644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819857,0.000037783688,0.00015160227,0.0006476138,0.00052393327,0.00044047539],"domain_scores_gemma":[0.9990894,0.00002197037,0.000068931666,0.0007244935,0.000007869381,0.00008732638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009940987,0.00010660422,0.000088483044,0.0003162359,0.0012250374,0.000259218,0.003183057,0.000005355406,0.00007186395],"category_scores_gemma":[0.0000037731547,0.00010539052,0.000043459917,0.00081982434,0.00013572174,0.00035311416,0.0038219125,0.00014005444,0.00010210148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018390487,0.000047580965,0.00018863886,0.000007510196,0.0000060791735,0.00007527214,0.0003404981,0.07242662,0.00016624182,0.8299971,0.0014769539,0.09526565],"study_design_scores_gemma":[0.00014847328,0.000073335905,0.001752198,0.000002534898,0.0000018251927,0.000025124438,0.00013604827,0.9284204,0.00008797251,0.011075232,0.058097742,0.0001790966],"about_ca_topic_score_codex":0.000010350984,"about_ca_topic_score_gemma":5.069886e-7,"teacher_disagreement_score":0.8559938,"about_ca_system_score_codex":0.00015788918,"about_ca_system_score_gemma":0.00004841898,"threshold_uncertainty_score":0.9422121},"labels":[],"label_agreement":null},{"id":"W4311272551","doi":"10.1139/cjp-2022-0121","title":"Experimentally implementing the step-dependent discrete-time quantum walk on quantum computers","year":2022,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quantum walk; Physics; Controlled NOT gate; Quantum computer; Operator (biology); Rotation (mathematics); Quantum; Quantum algorithm; Probability distribution; Quantum mechanics; Quantum gate; Quantum simulator; Statistical physics; Mathematics; Geometry; Statistics","score_opus":0.010558354154604486,"score_gpt":0.22932509246814609,"score_spread":0.2187667383135416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311272551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62781024,0.0006992631,0.3550266,0.009364575,0.0057094647,0.0004733831,0.00010525263,0.00008085952,0.0007303194],"genre_scores_gemma":[0.99541587,0.000001277731,0.0029126988,0.0011160973,0.00049021945,0.0000025265024,0.0000042254537,0.000019604591,0.000037459624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978427,0.00025539132,0.0004200971,0.0002633813,0.0006048507,0.00061356096],"domain_scores_gemma":[0.99851096,0.00015900965,0.00041133445,0.00045821577,0.00007801616,0.00038247366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006857722,0.00021129659,0.0002535582,0.00014080179,0.0012730367,0.00032631477,0.0019414269,0.000020123794,0.000063243075],"category_scores_gemma":[0.000012855339,0.00016303523,0.0002187112,0.00035727504,0.0000679093,0.00017669705,0.00025969782,0.00067424047,0.000012211229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005542278,0.00023432545,0.0007970224,0.000029043878,0.0005109325,0.0017316035,0.019560251,0.36204362,0.0018001806,0.23841989,0.029362138,0.34545556],"study_design_scores_gemma":[0.00067674334,0.001142737,0.00068577874,0.00005618989,0.000019705936,0.00039132868,0.00093659404,0.970781,0.00062507077,0.008124205,0.016157279,0.00040335505],"about_ca_topic_score_codex":0.0011372409,"about_ca_topic_score_gemma":0.00023709264,"teacher_disagreement_score":0.6087374,"about_ca_system_score_codex":0.00021702213,"about_ca_system_score_gemma":0.00074754783,"threshold_uncertainty_score":0.9791298},"labels":[],"label_agreement":null},{"id":"W4311417604","doi":"10.1109/camad55695.2022.9966892","title":"Resource Optimization of SFC Embedding for IoT Networks Using Quantum Computing","year":2022,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Quadratic unconstrained binary optimization; Computer science; Quantum annealing; Scalability; Quantum computer; Embedding; Qubit; Distributed computing; Integer programming; Optimization problem; Simulated annealing; Mathematical optimization; Theoretical computer science; Quantum; Algorithm; Mathematics; Artificial intelligence","score_opus":0.017554745770577414,"score_gpt":0.26475754741999036,"score_spread":0.24720280164941294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311417604","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03374451,0.00008775566,0.9650981,0.00026900196,0.00034886273,0.00019785811,0.0000018493272,0.00016890763,0.00008315058],"genre_scores_gemma":[0.44495723,2.9521624e-7,0.5546821,0.00020910168,0.0001102997,0.000002626759,0.0000042560364,0.0000132529,0.000020872207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861425,0.0001166083,0.00033290082,0.00036179955,0.00024977833,0.00032468585],"domain_scores_gemma":[0.9990443,0.00029163575,0.00022819087,0.0003233702,0.000061004823,0.000051501775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066518225,0.00012854446,0.00020287064,0.00013665916,0.0006679203,0.00007184957,0.00068504794,0.000031130458,0.00001167718],"category_scores_gemma":[0.00002752859,0.00012807122,0.000103712424,0.00056387327,0.000024525249,0.000052414725,0.0007209579,0.00018760336,1.1094096e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005518264,0.000027045044,0.000030116433,0.0000109150915,0.000009816439,0.0000013888376,0.0004210508,0.9817798,0.000059607555,0.009363237,0.00017231156,0.008119208],"study_design_scores_gemma":[0.00025497455,0.00012196328,0.000011261996,0.00001959736,0.0000056720864,0.000029360444,0.000103050836,0.99796784,0.000080983555,0.00048195868,0.00076465675,0.00015867742],"about_ca_topic_score_codex":0.000021559126,"about_ca_topic_score_gemma":3.2018434e-7,"teacher_disagreement_score":0.4112127,"about_ca_system_score_codex":0.000044162927,"about_ca_system_score_gemma":0.00005964575,"threshold_uncertainty_score":0.52225924},"labels":[],"label_agreement":null},{"id":"W4311539460","doi":"10.1103/physreva.106.062610","title":"Universal quantum computation with symmetric qubit clusters coupled to an environment","year":2022,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal; Royal Military College Saint-Jean","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Quantum computer; Quantum error correction; Qubit; Quantum decoherence; Physics; Quantum mechanics; Quantum algorithm; Topology (electrical circuits); Quantum; Computer science; Mathematics","score_opus":0.01112502728964474,"score_gpt":0.2947847722606851,"score_spread":0.28365974497104035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311539460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.361235,0.019466618,0.6034276,0.011020119,0.000315505,0.0036920242,0.000034347617,0.0005043373,0.00030446023],"genre_scores_gemma":[0.9738936,0.005949773,0.009600819,0.009665899,0.00037371294,0.0003421549,0.00006658566,0.000077156306,0.000030330313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533695,0.00074594165,0.00050718454,0.0012441864,0.0014871055,0.00067864143],"domain_scores_gemma":[0.99751735,0.0004055019,0.00035404632,0.0010810312,0.00008102852,0.0005610575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062509306,0.0005286729,0.0012116313,0.00014699249,0.00046023505,0.000091683025,0.0015800721,0.000017969647,0.000019902762],"category_scores_gemma":[0.000087375614,0.00041627273,0.0004090468,0.0021735302,0.000089598805,0.0003174011,0.0010798199,0.00069705746,0.00020374091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014558918,0.0078162365,0.00010026328,0.0077212765,0.00037004953,0.00034064925,0.0019930801,0.1480051,0.004923359,0.12416142,0.0076780473,0.6967449],"study_design_scores_gemma":[0.00042294615,0.0020219325,0.00029676856,0.0016622405,0.00016531159,0.000035512912,0.000014202409,0.96704334,0.00007481656,0.004914837,0.0226462,0.00070187566],"about_ca_topic_score_codex":0.00004426498,"about_ca_topic_score_gemma":0.0000011081154,"teacher_disagreement_score":0.8190383,"about_ca_system_score_codex":0.00025702393,"about_ca_system_score_gemma":0.00012400013,"threshold_uncertainty_score":0.99982893},"labels":[],"label_agreement":null},{"id":"W4311641992","doi":"10.48550/arxiv.2212.06985","title":"Local Probabilistic Decoding of a Quantum Code","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Moonshot Research and Development Program; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Okinawa Institute of Science and Technology Graduate University; Government of Canada; Ministry of Colleges and Universities","keywords":"Decoding methods; Algorithm; Probabilistic logic; Computer science; Belief propagation; Code (set theory); Hamming code; Randomness; Noise (video); Mathematics; Block code; Statistics","score_opus":0.0507253510692539,"score_gpt":0.19751334034478216,"score_spread":0.14678798927552825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311641992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2655819,0.00005735657,0.73286384,0.00008455914,0.0005791011,0.000192969,0.000024858122,0.0001980798,0.00041731627],"genre_scores_gemma":[0.99449503,0.00002413674,0.0051853145,0.000052813164,0.000039780818,0.0000010688763,0.0000096856265,0.000018862886,0.00017327761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997851,0.00021940458,0.0002845203,0.001107931,0.00015827217,0.00037887454],"domain_scores_gemma":[0.99791086,0.00023087562,0.00035795523,0.0012565245,0.00010604068,0.00013772718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037454002,0.00030116722,0.0004304565,0.00027777278,0.00021800728,0.000059890233,0.0025427418,0.00015124868,0.00004429795],"category_scores_gemma":[0.000049041424,0.0003397414,0.0002714091,0.0006976491,0.00018180936,0.000097415,0.0047650924,0.00088557944,0.000009520188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011014801,0.00007903892,0.0002208503,0.00012076538,0.000040262243,0.00019576137,0.00026023263,0.8181231,0.000008273206,0.1792799,0.000085545034,0.001575251],"study_design_scores_gemma":[0.00022742688,0.0000945076,0.00024043898,0.00008811982,0.00003099834,0.000010928485,0.00006293229,0.91141605,0.000032674925,0.08706906,0.00040343232,0.000323425],"about_ca_topic_score_codex":0.00011486279,"about_ca_topic_score_gemma":0.000015508489,"teacher_disagreement_score":0.7289131,"about_ca_system_score_codex":0.00019142916,"about_ca_system_score_gemma":0.00032897072,"threshold_uncertainty_score":0.99990547},"labels":[],"label_agreement":null},{"id":"W4312098122","doi":"10.1017/9781009261692.008","title":"Shunts","year":2022,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Quantum walk; Stochastic matrix; Mathematics; Graph; Discrete mathematics; Combinatorics; Pure mathematics; Statistical physics; Quantum; Physics; Quantum mechanics; Markov chain; Quantum computer","score_opus":0.014728548398896896,"score_gpt":0.18640123098354047,"score_spread":0.17167268258464358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312098122","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003255418,0.000117238254,0.015831385,0.000060284267,0.00065906544,0.0002041122,0.000088074084,0.0004318332,0.9825755],"genre_scores_gemma":[0.00022732207,0.000030878484,0.0025906074,0.00015146108,0.00014335713,4.1311986e-7,0.000018145744,0.000034334786,0.99680346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828416,0.000049088707,0.00015731543,0.00075298443,0.00042309295,0.0003333859],"domain_scores_gemma":[0.99848217,0.00007504004,0.0001963398,0.0010093618,0.00006579746,0.00017132217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011262446,0.0003557199,0.00033474882,0.00022116369,0.00043916205,0.00009818143,0.0021462396,0.00017505689,0.000011952426],"category_scores_gemma":[0.000003950797,0.00042254882,0.00025057956,0.000015969941,0.00010278602,0.000103302016,0.002536788,0.0008237721,0.00001901402],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006861525,0.0000061650394,1.8956534e-7,0.000020770676,0.000055699322,0.0006299399,0.000055335746,0.00009907912,0.0000046997393,0.9667847,0.019732216,0.0126043465],"study_design_scores_gemma":[0.00025234267,0.000066579116,0.0000046753826,0.00004310466,0.000031276264,0.00005693111,0.000002935474,0.011292732,0.000027667935,0.00006498657,0.98769444,0.0004623405],"about_ca_topic_score_codex":0.00006461507,"about_ca_topic_score_gemma":3.860022e-7,"teacher_disagreement_score":0.9679622,"about_ca_system_score_codex":0.00015822386,"about_ca_system_score_gemma":0.00014039846,"threshold_uncertainty_score":0.9998226},"labels":[],"label_agreement":null},{"id":"W4312100644","doi":"10.1007/s00023-022-01255-0","title":"Quantum Teleportation in the Commuting Operator Framework","year":2022,"lang":"en","type":"article","venue":"Annales Henri Poincaré","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Unitary state; Operator (biology); Orthonormal basis; Pure mathematics; Von Neumann architecture; Variety (cybernetics); Class (philosophy); Quantum; Quantum teleportation; Teleportation; Discrete mathematics; Quantum channel; Quantum information; Quantum mechanics; Physics; Computer science","score_opus":0.015057644817965586,"score_gpt":0.2603076180665682,"score_spread":0.24524997324860262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312100644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9100615,0.0007887938,0.078915775,0.008855025,0.00052174274,0.00023770428,0.000005347726,0.00016198655,0.00045214145],"genre_scores_gemma":[0.984188,0.000007491197,0.011777048,0.0038410863,0.00011225019,0.000036485406,0.000007730249,0.000010835611,0.000019056288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980816,0.00046456617,0.0002950398,0.00033301898,0.00047309927,0.00035265015],"domain_scores_gemma":[0.99876875,0.00042350416,0.00011081611,0.0006202049,0.00003380423,0.000042934917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011980879,0.00014150467,0.00014977258,0.0001236159,0.0007677919,0.00018712445,0.0014990432,0.00003341926,0.000017432687],"category_scores_gemma":[0.00008520055,0.00010939341,0.00007869954,0.0008533977,0.000035712805,0.00013291702,0.00048642096,0.0007620666,0.000013790521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027991688,0.0006822074,0.016088706,0.000059920607,0.000058157228,0.0010607131,0.09008681,0.12142712,0.00036230838,0.5317022,0.008704053,0.22973981],"study_design_scores_gemma":[0.0002339776,0.00022820914,0.015928384,0.0000367837,0.000003925334,0.00024617542,0.0017895397,0.92064625,0.000048094524,0.035551928,0.024967443,0.00031931105],"about_ca_topic_score_codex":0.00009305935,"about_ca_topic_score_gemma":0.000011033823,"teacher_disagreement_score":0.79921913,"about_ca_system_score_codex":0.00003113198,"about_ca_system_score_gemma":0.0000853011,"threshold_uncertainty_score":0.5905312},"labels":[],"label_agreement":null},{"id":"W4312561338","doi":"10.23977/acss.2022.060501","title":"Can We Build a Quantum Computer?","year":2022,"lang":"en","type":"article","venue":"Advances in Computer Signals and Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quantum computer; Qubit; Computer science; Perspective (graphical); Quantum; Quantum algorithm; Computer engineering; Theoretical computer science; Artificial intelligence; Quantum mechanics; Physics","score_opus":0.011315807938080838,"score_gpt":0.2438759259960122,"score_spread":0.23256011805793136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312561338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031832356,0.01550028,0.94620675,0.0016760494,0.0040834853,0.00037691896,0.000015923504,0.00024832497,0.000059883238],"genre_scores_gemma":[0.9598125,0.0003458137,0.038459674,0.0005815821,0.00065824395,0.000076573146,0.000004603914,0.000024006808,0.00003698947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970807,0.00044335064,0.00055900955,0.0008509885,0.0005102712,0.00055568066],"domain_scores_gemma":[0.9986957,0.00033745353,0.00021794668,0.00055330835,0.000044311608,0.00015130395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069621735,0.00030445337,0.0004988037,0.00028375615,0.0004742362,0.0003328831,0.0011861533,0.000044878943,0.000004430803],"category_scores_gemma":[0.0000032440996,0.00028136146,0.0000851098,0.0006719804,0.00005910051,0.00039164347,0.0013198847,0.00044568977,0.0000028442125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006240925,0.00008975087,0.0005494342,0.00009182193,0.000016337886,0.00016936973,0.0017216821,0.6712587,0.000026755792,0.03315414,0.00037402977,0.29254174],"study_design_scores_gemma":[0.0004582232,0.00043818582,0.00016662815,0.000118834905,0.0000022424522,0.0003219973,0.00004755964,0.9503366,0.0000062416825,0.008571832,0.039171413,0.00036024678],"about_ca_topic_score_codex":0.00010047716,"about_ca_topic_score_gemma":0.000011314876,"teacher_disagreement_score":0.9279802,"about_ca_system_score_codex":0.00006440566,"about_ca_system_score_gemma":0.000058853195,"threshold_uncertainty_score":0.9999639},"labels":[],"label_agreement":null},{"id":"W4312565587","doi":"10.1109/qce53715.2022.00122","title":"Implementation and Viusalization of Quantum Walks","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Quantum Computing and Engineering (QCE)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Quantum walk; Random walk; Implementation; Computer science; Quantum; Quantum computer; Theoretical computer science; Bridge (graph theory); Physics; Mathematics; Quantum mechanics; Programming language","score_opus":0.019230461463186965,"score_gpt":0.27879437127121764,"score_spread":0.2595639098080307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312565587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6231171,0.00007755947,0.37433147,0.0007238655,0.0013894403,0.000102248574,0.00002284103,0.00013987375,0.00009556853],"genre_scores_gemma":[0.9963219,0.000040382376,0.0033688587,0.00010509363,0.00010020867,0.000007544422,0.000023030509,0.000015783286,0.000017161155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984258,0.00007216035,0.00036644124,0.00042822803,0.00046765918,0.00023971553],"domain_scores_gemma":[0.9993135,0.00013170547,0.00018640648,0.00020230982,0.000088836205,0.00007727909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045142617,0.00019251576,0.00020643313,0.00030224546,0.0002471971,0.00013399786,0.00048013058,0.00003265172,0.000033118256],"category_scores_gemma":[0.000024137911,0.00020649277,0.000047022877,0.00025466603,0.00003063543,0.00011982334,0.00039607537,0.0003120367,0.0000011965948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020225854,0.000082291765,0.00078502775,0.00006099928,0.00007937123,0.00001797476,0.0023063573,0.245023,0.00909483,0.6951004,0.00028172266,0.04714777],"study_design_scores_gemma":[0.00036678364,0.00024889022,0.0030535685,0.00004900233,0.0000054221778,0.00006042795,0.0002154984,0.9924766,0.00042528834,0.002361283,0.0005221097,0.00021516513],"about_ca_topic_score_codex":0.000071557246,"about_ca_topic_score_gemma":0.0000015985689,"teacher_disagreement_score":0.7474536,"about_ca_system_score_codex":0.000051269035,"about_ca_system_score_gemma":0.000045041677,"threshold_uncertainty_score":0.84205306},"labels":[],"label_agreement":null},{"id":"W4312704343","doi":"10.1109/qce53715.2022.00133","title":"OptiPauli: An algorithm to find a near-optimal Pauli Feature Map for Quantum Support Vector Classifiers","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Quantum Computing and Engineering (QCE)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Earl Haig Secondary School","funders":"","keywords":"Pauli exclusion principle; Kernel (algebra); Feature (linguistics); Feature vector; Algorithm; Quantum state; Computer science; Dimension (graph theory); Optimization problem; Support vector machine; Pattern recognition (psychology); Quantum; Mathematics; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.024192913913871496,"score_gpt":0.2750829854881907,"score_spread":0.2508900715743192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312704343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25162217,0.00004892869,0.7357141,0.0053324746,0.0061183283,0.00040221374,0.00021707661,0.0004906742,0.00005405477],"genre_scores_gemma":[0.8501577,0.00000722553,0.14756688,0.0008500435,0.00071659894,0.00008040134,0.00013357986,0.000070698734,0.00041688597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967635,0.000105336854,0.00045244116,0.0011164977,0.0008032646,0.00075891183],"domain_scores_gemma":[0.9984338,0.00027936112,0.00018088926,0.00052515115,0.00018928353,0.0003914876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007860229,0.00048186752,0.0004413307,0.00036702797,0.0007791515,0.00071741577,0.0015866455,0.000109217,0.00006257159],"category_scores_gemma":[0.000075186894,0.0005107138,0.00017028279,0.00040286814,0.000049100658,0.00021499401,0.0006229948,0.00093330303,0.000015085005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010019384,0.00024076627,0.000028812707,0.0000637391,0.00016068188,0.00013521836,0.0036722342,0.8503282,0.003482021,0.060673106,0.007767425,0.07334758],"study_design_scores_gemma":[0.00060716463,0.0013387837,0.00061054906,0.00007267755,0.000010788469,0.00015853113,0.00021100133,0.9784295,0.00012625207,0.00047070032,0.017342411,0.00062166096],"about_ca_topic_score_codex":0.000034875105,"about_ca_topic_score_gemma":0.0000017018224,"teacher_disagreement_score":0.59853554,"about_ca_system_score_codex":0.00017338018,"about_ca_system_score_gemma":0.00020239885,"threshold_uncertainty_score":0.99973446},"labels":[],"label_agreement":null},{"id":"W4312831158","doi":"10.1109/tqe.2022.3213474","title":"Mixed Quantum–Classical Method for Fraud Detection With Quantum Feature Selection","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Quantum Engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Quantum machine learning; Support vector machine; Quantum computer; Quantum algorithm; Feature (linguistics); Feature vector; Random forest; Quantum; Feature selection; Machine learning; IBM; Quantum state; Artificial intelligence; Algorithm; Data mining","score_opus":0.010982602220566384,"score_gpt":0.2246811247878288,"score_spread":0.21369852256726243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312831158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027575202,0.000055418208,0.9670804,0.0008945344,0.0026696988,0.0005453,0.00003197814,0.0011414572,0.0000059860317],"genre_scores_gemma":[0.84849083,0.0000042819306,0.15059789,0.0001232449,0.00017460459,0.00042331906,0.000004489951,0.00008427393,0.000097088436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972456,0.00016737501,0.00034761344,0.0009064161,0.0006183034,0.0007146934],"domain_scores_gemma":[0.99856144,0.00050996325,0.00013708313,0.00049084006,0.00010433442,0.00019635129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000563038,0.00046456326,0.00041051337,0.0005815099,0.0011821477,0.000177182,0.0006493135,0.00014289808,0.000013626312],"category_scores_gemma":[0.000014876465,0.00044361706,0.0002808906,0.0014619285,0.000026090263,0.00027901458,0.00001370137,0.0013320198,0.0000066243156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114365524,0.00017291703,7.016115e-7,0.00004925723,0.00009228021,0.000011420091,0.0002606072,0.93311846,0.019776419,0.004886939,0.00016006501,0.041356567],"study_design_scores_gemma":[0.0008439658,0.0015045966,0.000043084267,0.00003757146,0.000047370897,0.00032639535,0.000057485388,0.95945865,0.029616266,0.00047018388,0.0070310887,0.00056337245],"about_ca_topic_score_codex":0.00003863374,"about_ca_topic_score_gemma":0.000021562217,"teacher_disagreement_score":0.8209156,"about_ca_system_score_codex":0.00026392657,"about_ca_system_score_gemma":0.00010727331,"threshold_uncertainty_score":0.9998016},"labels":[],"label_agreement":null},{"id":"W4312884457","doi":"10.1109/pn56061.2022.9908348","title":"Purification at the ultimate limit using quantum superpositions of causal order","year":2022,"lang":"en","type":"article","venue":"2022 Photonics North (PN)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Superposition principle; Limit (mathematics); Quantum superposition; Quantum; Order (exchange); Computer science; Statistical physics; Quantum computer; Quantum mechanics; Physics; Mathematics; Mathematical analysis","score_opus":0.015549802976468534,"score_gpt":0.23624797334501194,"score_spread":0.2206981703685434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312884457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709473,0.00038026102,0.026663007,0.000754476,0.0006215907,0.00030138026,0.00011229438,0.0001031508,0.00011653206],"genre_scores_gemma":[0.9717906,0.000034874036,0.027102903,0.00046574164,0.00005148654,0.00007189053,0.000094981544,0.00003283104,0.0003546681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813205,0.00019806996,0.00034403632,0.00044036176,0.00053905125,0.0003464257],"domain_scores_gemma":[0.99856925,0.00014498143,0.00020863446,0.00089289964,0.00011757428,0.00006667013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004054332,0.00017031086,0.00018913065,0.000111591624,0.0012495738,0.00007137393,0.0010586666,0.000030927935,0.00014473338],"category_scores_gemma":[0.000024395787,0.00014218906,0.0001145503,0.0011039545,0.00008181386,0.00011001722,0.0011151915,0.00040841106,0.00001146054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032352717,0.0004106435,0.0020928322,0.000043040316,0.00011635875,0.000049022445,0.0080476105,0.95169145,0.013470819,0.012394186,0.0011518333,0.010499876],"study_design_scores_gemma":[0.00018855644,0.000106677864,0.0017177424,0.0000061355327,0.000019446812,0.00011178481,0.0000636699,0.98788935,0.0013446878,0.00063910725,0.0077289348,0.00018392524],"about_ca_topic_score_codex":0.00040674183,"about_ca_topic_score_gemma":0.0001424305,"teacher_disagreement_score":0.036197904,"about_ca_system_score_codex":0.00014023908,"about_ca_system_score_gemma":0.00021367802,"threshold_uncertainty_score":0.9610837},"labels":[],"label_agreement":null},{"id":"W4313188981","doi":"10.1109/iscas48785.2022.9937767","title":"A Review of Simulation Algorithms of Classical Ising Machines for Combinatorial optimization","year":2022,"lang":"en","type":"review","venue":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council","keywords":"Ising model; Computer science; Algorithm; Hamiltonian (control theory); Combinatorial optimization; Mathematical optimization; Theoretical computer science; Mathematics; Statistical physics; Physics","score_opus":0.050213464615928065,"score_gpt":0.33339897317634,"score_spread":0.2831855085604119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313188981","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028501238,0.8009518,0.18861485,0.00011263959,0.008304252,0.0013143404,0.00030153524,0.00005012714,0.00034763003],"genre_scores_gemma":[0.000250054,0.9973198,0.0008816711,0.000066935994,0.0009148154,0.00017919843,0.00024201241,0.00005104793,0.00009445941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996335,0.00041460988,0.001450778,0.00070961093,0.00086470885,0.00022526456],"domain_scores_gemma":[0.9963853,0.0012549938,0.0015401914,0.00045924063,0.00027862116,0.00008170229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001113162,0.0004051921,0.0015302696,0.0002611635,0.00016919986,0.00012498992,0.001011723,0.00017301974,0.000019986777],"category_scores_gemma":[0.00015842568,0.0003402737,0.00052259926,0.00043867607,0.00004574698,0.00014288873,0.00022179984,0.0003474722,9.609062e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006686503,0.00020560727,7.9795893e-7,0.048555877,0.00031240584,0.0000064762257,0.00013871303,0.17447671,0.00000575361,0.01240031,0.0005112097,0.76337945],"study_design_scores_gemma":[0.000255636,0.00018901975,1.764449e-7,0.020781808,0.00010079425,0.000049308674,0.0000025188747,0.6247806,0.0000010397519,0.000066160195,0.3535536,0.00021937289],"about_ca_topic_score_codex":0.000018645456,"about_ca_topic_score_gemma":2.040961e-7,"teacher_disagreement_score":0.76316005,"about_ca_system_score_codex":0.0001501645,"about_ca_system_score_gemma":0.00014350486,"threshold_uncertainty_score":0.99990493},"labels":[],"label_agreement":null},{"id":"W4313332489","doi":"10.1103/physrevresearch.4.043221","title":"Circuit connectivity boosts by quantum-classical-quantum interfaces","year":2022,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Shared Hierarchical Academic Research Computing Network; Instituto Nacional de Ciência e Tecnologia de Informação Quântica; Instituto Serrapilheira; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Compute Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo; Government of Canada; Vector Institute; Canadian Institute for Advanced Research","keywords":"Quantum circuit; Qubit; Quantum computer; Quantum gate; Quantum; Computer science; Electronic circuit; Quantum error correction; Quantum algorithm; Topology (electrical circuits); Electronic engineering; Algorithm; Physics; Quantum mechanics; Electrical engineering; Engineering","score_opus":0.06064991363411866,"score_gpt":0.3741438603867801,"score_spread":0.31349394675266146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313332489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7070332,0.13312021,0.0752631,0.07023792,0.0017089368,0.003983234,0.0001721295,0.001435049,0.0070461915],"genre_scores_gemma":[0.99704677,0.0012403987,0.00013973711,0.00085548294,0.00019734989,0.00023047531,0.000009515635,0.000029814151,0.00025043136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933786,0.0021214923,0.00036040376,0.0010648723,0.002053166,0.0010214815],"domain_scores_gemma":[0.9964267,0.0017677584,0.00011951513,0.0011694673,0.00019768825,0.00031884128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029872584,0.00027580754,0.0006147691,0.00014240074,0.0010515394,0.00022890976,0.0028353105,0.000027600434,0.00010307861],"category_scores_gemma":[0.00064612855,0.00023149108,0.00023996035,0.001936976,0.0002445677,0.00023049032,0.003227405,0.0020559358,0.00024269204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019664612,0.0024646497,0.000036606125,0.0011431752,0.000088613386,0.000119808785,0.0009871867,0.00024736224,0.015034742,0.36509097,0.19236785,0.42239937],"study_design_scores_gemma":[0.00027964075,0.0009704397,0.00011150591,0.00052247784,0.000011242767,0.000052706953,0.000028928389,0.6429731,0.001925817,0.09988857,0.2527173,0.00051825197],"about_ca_topic_score_codex":0.00006269049,"about_ca_topic_score_gemma":0.0000011194393,"teacher_disagreement_score":0.64272577,"about_ca_system_score_codex":0.00018290781,"about_ca_system_score_gemma":0.00020837536,"threshold_uncertainty_score":0.9439933},"labels":[],"label_agreement":null},{"id":"W4313442205","doi":"10.22331/q-2023-01-03-889","title":"Fluid fermionic fragments for optimizing quantum measurements of electronic Hamiltonians in the variational quantum eigensolver","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Compute Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Hamiltonian (control theory); Quantum; Wave function; Electron; Quantum mechanics; Physics; Mathematics; Mathematical optimization","score_opus":0.03580009769914886,"score_gpt":0.27655627013066036,"score_spread":0.2407561724315115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313442205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6209585,0.00043813113,0.37269562,0.003083454,0.001316485,0.0010599844,0.000022985576,0.00033337082,0.000091441594],"genre_scores_gemma":[0.9926761,0.000036016343,0.0065776487,0.00037200312,0.00014879776,0.0000783924,0.00003299536,0.000036846985,0.0000412137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962564,0.00028647372,0.00070865883,0.00070040877,0.00095991604,0.0010881071],"domain_scores_gemma":[0.99808306,0.00056243496,0.000268751,0.0008299929,0.00017522175,0.00008057399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024384614,0.00033285143,0.0004065118,0.00040989442,0.00038289677,0.00014521345,0.001787556,0.00012980074,0.000008566714],"category_scores_gemma":[0.00016649254,0.00026157626,0.00024806,0.0015233505,0.00006942463,0.00024420864,0.0002468341,0.0003858167,0.00004319208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014115158,0.00086569134,0.0016984849,0.0002560871,0.00033768348,0.000049605376,0.013849482,0.19530427,0.010596186,0.76537925,0.0042031133,0.0073189638],"study_design_scores_gemma":[0.0009087375,0.00034565237,0.0052028475,0.00008358036,0.00001667115,0.000016272223,0.00015280314,0.93672043,0.00051808084,0.055078354,0.0006519829,0.00030456786],"about_ca_topic_score_codex":0.00008989049,"about_ca_topic_score_gemma":0.000019217334,"teacher_disagreement_score":0.74141616,"about_ca_system_score_codex":0.0001241857,"about_ca_system_score_gemma":0.00035014827,"threshold_uncertainty_score":0.99998367},"labels":[],"label_agreement":null},{"id":"W4313525934","doi":"10.1109/sec54971.2022.00058","title":"Milestones on the Quantum Utility Highway","year":2022,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Milestone; Context (archaeology); Computer science; Variety (cybernetics); Quantum; Metric (unit); Quantum computer; Set (abstract data type); Quantum annealing; Engineering; Artificial intelligence; Programming language; Physics; Quantum mechanics; Operations management; History","score_opus":0.018930782003520656,"score_gpt":0.2276651855211969,"score_spread":0.20873440351767625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313525934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7118692,0.00013263,0.21165062,0.059723984,0.002424149,0.00033042388,0.000009997358,0.0010297229,0.0128292795],"genre_scores_gemma":[0.9936851,7.462136e-7,0.002846652,0.0028690598,0.00005918103,0.000017772867,7.666591e-7,0.0000052488012,0.0005154706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987618,0.00020248328,0.00012156209,0.00032352176,0.00036223905,0.00022844033],"domain_scores_gemma":[0.99888736,0.00030484924,0.000040850442,0.0007070113,0.000016523098,0.00004339627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005204361,0.00010254707,0.00008687554,0.00004379007,0.0008277862,0.000080395715,0.0013115797,0.000012251801,0.0002411979],"category_scores_gemma":[0.00002229947,0.00006023931,0.000070593254,0.00035242122,0.000039539154,0.000037678594,0.0007898959,0.0003118793,0.00004892892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054755883,0.00013062134,0.0000944704,0.0000025387162,0.0000100119505,0.000019837084,0.0007612479,0.0046345904,0.00008935611,0.9228656,0.02333329,0.048052914],"study_design_scores_gemma":[0.00007406024,0.00013433155,0.0025480995,0.0000019893832,9.164466e-7,0.0000245075,0.000058202255,0.90879476,0.00026704225,0.020772744,0.06720831,0.00011504411],"about_ca_topic_score_codex":0.00004718821,"about_ca_topic_score_gemma":0.0000017074965,"teacher_disagreement_score":0.90416014,"about_ca_system_score_codex":0.000016908665,"about_ca_system_score_gemma":0.00003806179,"threshold_uncertainty_score":0.6366746},"labels":[],"label_agreement":null},{"id":"W4313598288","doi":"10.48550/arxiv.2301.01473","title":"State Transfer in Complex Quantum Walks","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Hermitian matrix; Conjecture; Adjacency matrix; Quantum walk; Vertex (graph theory); Unitary state; Transfer (computing); Discrete mathematics; Algebraic number; Quantum; Graph; Physics; Pure mathematics; Quantum mechanics; Quantum algorithm; Computer science","score_opus":0.08937872098298469,"score_gpt":0.2016521394523253,"score_spread":0.11227341846934061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313598288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4993273,0.000018664408,0.49887955,0.0003205779,0.00055046554,0.00020471944,0.000024755142,0.00049869553,0.00017528152],"genre_scores_gemma":[0.99754363,0.00008821973,0.0014728128,0.00011518995,0.000063461324,8.9130197e-7,0.00002506792,0.00003486925,0.00065586256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973025,0.00021314176,0.0003035291,0.0014213072,0.00013768494,0.00062188634],"domain_scores_gemma":[0.99832684,0.00015875237,0.00008785609,0.0011752644,0.00007412496,0.00017719028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003699976,0.00040297004,0.00046871044,0.0005469091,0.00013786647,0.000155781,0.002355321,0.0002204236,0.000014384977],"category_scores_gemma":[0.000015867266,0.00044973454,0.0002454841,0.0010755397,0.00010480646,0.00015131976,0.0018213962,0.0010961152,0.00014951422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015596808,0.00008190335,0.0009052699,0.00008561427,0.000045897137,0.0012919701,0.00087953656,0.9506797,0.000039066923,0.04357303,0.00030206694,0.00210034],"study_design_scores_gemma":[0.0004343427,0.000045309698,0.009264937,0.000106659754,0.000010366134,0.000005026283,0.000024704572,0.9079386,0.000022461554,0.0811968,0.00047774025,0.0004730402],"about_ca_topic_score_codex":0.000615688,"about_ca_topic_score_gemma":0.00028277075,"teacher_disagreement_score":0.49821633,"about_ca_system_score_codex":0.00013543018,"about_ca_system_score_gemma":0.00017762782,"threshold_uncertainty_score":0.99979544},"labels":[],"label_agreement":null},{"id":"W4315631112","doi":"10.1145/3571204","title":"Proto-Quipper with Dynamic Lifting","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Syntax; Semantics (computer science); Construct (python library); Operational semantics; Programming language; Dynamic programming; Functional programming; State (computer science); Theoretical computer science; Categorical variable; Algorithm; Artificial intelligence","score_opus":0.008028892670940677,"score_gpt":0.25297755529038357,"score_spread":0.2449486626194429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315631112","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9916704,0.000061187195,0.00035834927,0.0057037487,0.00010801101,0.00068221154,0.0000011644055,0.0009183759,0.00049651763],"genre_scores_gemma":[0.9003319,0.000002613199,0.09899869,0.00014047291,0.00006578616,0.000082097635,7.2243245e-7,0.000027020538,0.00035069036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985486,0.000008986756,0.0001848671,0.00039711574,0.00043794714,0.00042244478],"domain_scores_gemma":[0.9989611,0.00009295453,0.00020214722,0.00057387695,0.00011508254,0.000054826105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000434438,0.00018318217,0.0001771444,0.0001442489,0.00023044884,0.00021028591,0.0028918392,0.00004855873,0.0000010272657],"category_scores_gemma":[0.0004955595,0.000104559396,0.000084200416,0.0012390754,0.000086364744,0.00014439317,0.0013852777,0.0002666025,0.000011908744],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036539997,0.00015598309,0.010167511,0.0004642096,0.00009453162,0.000019428408,0.008871745,0.00059560704,0.011066912,0.00954134,0.0008743263,0.9581119],"study_design_scores_gemma":[0.005139808,0.0062284935,0.10962368,0.00855653,0.0001915114,0.0007775937,0.011205093,0.55817986,0.2196752,0.04217765,0.033794347,0.004450216],"about_ca_topic_score_codex":0.0000105984345,"about_ca_topic_score_gemma":0.0000012343205,"teacher_disagreement_score":0.9536616,"about_ca_system_score_codex":0.00001778511,"about_ca_system_score_gemma":0.000025133813,"threshold_uncertainty_score":0.5373805},"labels":[],"label_agreement":null},{"id":"W4316116737","doi":"10.48550/arxiv.2301.04782","title":"Resource Theory of Imaginarity: New Distributed Scenarios","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; European Regional Development Fund; Natural Sciences and Engineering Research Council of Canada; European Commission; Fundacja na rzecz Nauki Polskiej; University of Science and Technology of China; QuantERA; National Natural Science Foundation of China; Narodowym Centrum Nauki","keywords":"Bipartite graph; Qubit; Protocol (science); Dimension (graph theory); Computer science; Resource (disambiguation); Entanglement distillation; Quantum; Distillation; Distributed computing; Theoretical computer science; Topology (electrical circuits); Mathematics; Quantum mechanics; Physics; Computer network; W state","score_opus":0.053407484053395744,"score_gpt":0.19060640182736158,"score_spread":0.13719891777396584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316116737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07503852,0.00007869935,0.9222423,0.0007056983,0.00052442134,0.00020655298,0.000062362495,0.0006506589,0.0004907738],"genre_scores_gemma":[0.9901052,0.000043044656,0.0058918167,0.00008803127,0.00016820249,2.9640753e-7,0.000056759443,0.00003458319,0.003612076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776024,0.0002569849,0.0002615332,0.0011436623,0.00014616111,0.00043143757],"domain_scores_gemma":[0.99733883,0.00031831142,0.00033878363,0.0016560301,0.00011647454,0.00023154408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047412064,0.00034574754,0.00044848386,0.00030472732,0.00015019094,0.000104734805,0.0027898,0.00024527835,0.000010464783],"category_scores_gemma":[0.00009460964,0.00037377438,0.00030043113,0.0009906207,0.00016911847,0.00011939039,0.0044205138,0.00088908145,0.00004952073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032216853,0.00007489168,0.0006157299,0.00010344219,0.00012439153,0.0004451604,0.00049844896,0.8457904,0.000014333134,0.14167295,0.003487707,0.007140368],"study_design_scores_gemma":[0.000312397,0.0000452997,0.0012903928,0.00018328789,0.00004339774,0.0000072308935,0.000044255354,0.76970863,0.00005085967,0.22570355,0.0022599753,0.00035073617],"about_ca_topic_score_codex":0.00025733985,"about_ca_topic_score_gemma":0.000011205142,"teacher_disagreement_score":0.9163505,"about_ca_system_score_codex":0.00008994113,"about_ca_system_score_gemma":0.00036726776,"threshold_uncertainty_score":0.99987143},"labels":[],"label_agreement":null},{"id":"W4318484009","doi":"10.1103/physreva.107.012433","title":"Maximal coin-position entanglement generation in a quantum walk for the third step and beyond regardless of the initial state","year":2023,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; Shenzhen Fundamental Research Program; Taishan Scholar Project of Shandong Province; Higher Education Discipline Innovation Project; Natural Science Foundation of Shandong Province","keywords":"Quantum walk; Quantum entanglement; Hadamard transform; Bipartite graph; Quantum discord; Physics; Statistical physics; Position (finance); Quantum mechanics; Quantum; Quantum algorithm; Mathematics; Discrete mathematics","score_opus":0.024723977500766145,"score_gpt":0.3434936116185369,"score_spread":0.31876963411777076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318484009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84645283,0.044364076,0.07250524,0.029618826,0.0006085395,0.0060354117,0.00011910096,0.0001540682,0.00014190565],"genre_scores_gemma":[0.96339494,0.031063698,0.0010141142,0.0036119476,0.00050652015,0.00033806305,0.000033820117,0.000025394364,0.00001148429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975603,0.00040406405,0.00054636016,0.00052390055,0.00057867327,0.0003866505],"domain_scores_gemma":[0.99815017,0.00065453316,0.00031384506,0.00067624875,0.000120532495,0.00008464954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084452005,0.0002760269,0.00069990987,0.000039169685,0.00019862213,0.00006703824,0.00074811414,0.00002025928,0.0000012821727],"category_scores_gemma":[0.00022390176,0.00015274595,0.000384542,0.0009523168,0.00012484359,0.00015170734,0.0004049165,0.0003139738,0.0000128558795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003399174,0.00072159246,0.00009516415,0.008402211,0.00012079265,0.000016308853,0.001196884,0.001070362,0.0134887975,0.09783115,0.007968335,0.8690544],"study_design_scores_gemma":[0.00037140615,0.00026593145,0.0014554418,0.0034378811,0.000111988295,0.000007628689,0.0000070836923,0.9539213,0.003618826,0.032190412,0.004357822,0.00025428424],"about_ca_topic_score_codex":0.000023997867,"about_ca_topic_score_gemma":0.000015616444,"teacher_disagreement_score":0.95285094,"about_ca_system_score_codex":0.000033952554,"about_ca_system_score_gemma":0.000072335606,"threshold_uncertainty_score":0.6228799},"labels":[],"label_agreement":null},{"id":"W4318706903","doi":"10.1038/s41534-023-00677-w","title":"Tailored cluster states with high threshold under biased noise","year":2023,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"National Science Foundation","keywords":"Cluster state; Quantum computer; Dephasing; Noise (video); Computer science; Qubit; Cluster (spacecraft); Scalability; Generalization; Algorithm; Quantum; Mathematics; Physics; Quantum mechanics; Artificial intelligence; Computer network","score_opus":0.009848464446732779,"score_gpt":0.21647089765235683,"score_spread":0.20662243320562404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318706903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6027807,0.000009111761,0.39199096,0.0035374127,0.00037588782,0.00021294029,0.0000071187005,0.00084750896,0.00023836967],"genre_scores_gemma":[0.9925093,0.000013596329,0.00576225,0.0014141849,0.000073968666,0.000020119287,0.00013452947,0.000012795519,0.000059249764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984938,0.000034232507,0.00035184715,0.00021079907,0.0004886939,0.00042066645],"domain_scores_gemma":[0.9989935,0.00010926772,0.0001728904,0.0004904052,0.00013037944,0.00010355145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033838677,0.00020154446,0.00016925317,0.00035033468,0.00025067298,0.00042743722,0.000545683,0.0000738752,0.000009281803],"category_scores_gemma":[0.000017982682,0.00014858892,0.00005006694,0.0010777345,0.000047602538,0.0016262331,0.00020274332,0.0002035244,0.00056708104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009519906,0.0000442378,0.000369342,0.000085330634,0.00004897621,0.000018617868,0.00568722,0.8775312,0.000109256216,0.07267175,0.010146724,0.0331922],"study_design_scores_gemma":[0.0007196881,0.00016962185,0.006954608,0.000044147964,0.0000047340536,0.00002215181,0.00014828466,0.9792413,0.00021889865,0.008994372,0.0032366673,0.0002455346],"about_ca_topic_score_codex":0.000055706034,"about_ca_topic_score_gemma":0.0000076061083,"teacher_disagreement_score":0.38972864,"about_ca_system_score_codex":0.000035607183,"about_ca_system_score_gemma":0.00007588392,"threshold_uncertainty_score":0.72888684},"labels":[],"label_agreement":null},{"id":"W4318774980","doi":"10.22323/1.430.0025","title":"Real time evolution and a traveling excitation in SU(2) pure gauge theory on a quantum computer.","year":2023,"lang":"en","type":"article","venue":"Proceedings of The 39th International Symposium on Lattice Field Theory — PoS(LATTICE2022)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum computer; Excitation; Lattice gauge theory; Controlled NOT gate; Gauge theory; Physics; IBM; Computer science; Quantum; Electronic engineering; Algorithm; Quantum mechanics; Computer engineering; Quantum gate; Engineering; Optics","score_opus":0.007542910577066983,"score_gpt":0.23795510364385544,"score_spread":0.23041219306678845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318774980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9786769,0.00002155118,0.0035172536,0.010321252,0.0011712863,0.0003951849,0.000015561824,0.0002466733,0.0056343344],"genre_scores_gemma":[0.99627036,0.00003023039,0.0021179086,0.0006299034,0.0003303377,0.000022042825,0.0000058537967,0.000028644083,0.0005647123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765086,0.00013219468,0.00051722204,0.00063684175,0.00066981843,0.00039305433],"domain_scores_gemma":[0.99744254,0.0016415403,0.0003522102,0.00026380538,0.0002141112,0.00008579556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019142898,0.00029644847,0.0002855589,0.0003173329,0.00022833307,0.00023334929,0.0012783712,0.00015931849,0.000016160728],"category_scores_gemma":[0.00035994363,0.00023569829,0.00013999658,0.0007351854,0.00009675136,0.00035211426,0.00048943347,0.0005451824,0.000040963663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025144438,0.000118996686,0.00045297563,0.000068356734,0.0000617137,0.0000058458163,0.0024816166,0.0016449265,0.008074017,0.98064643,0.0001944225,0.005999261],"study_design_scores_gemma":[0.0007531687,0.00053952244,0.012772982,0.0005970534,0.00002645386,0.000037935744,0.000183429,0.65132797,0.0018880235,0.33138233,0.00015758272,0.00033353418],"about_ca_topic_score_codex":0.000029778057,"about_ca_topic_score_gemma":0.0000013281597,"teacher_disagreement_score":0.64968306,"about_ca_system_score_codex":0.000105425795,"about_ca_system_score_gemma":0.00004029827,"threshold_uncertainty_score":0.9611497},"labels":[],"label_agreement":null},{"id":"W4318975179","doi":"10.1038/s41467-023-36144-5","title":"Universal expressiveness of variational quantum classifiers and quantum kernels for support vector machines","year":2023,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Support vector machine; Quantum; Computer science; Artificial intelligence; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.02298284112297075,"score_gpt":0.2964032396326507,"score_spread":0.2734203985096799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318975179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17142712,0.0030262666,0.77316535,0.04471207,0.0029864702,0.001551083,0.00074681453,0.0014583952,0.0009264285],"genre_scores_gemma":[0.9479633,0.00008115352,0.05153067,0.00015239825,0.00006781884,0.000027095983,0.0000987009,0.000014333681,0.00006451847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989477,0.000120097495,0.00023733282,0.00027939255,0.00020100409,0.00021450405],"domain_scores_gemma":[0.99731827,0.0010920126,0.00017303221,0.0011372819,0.00020538688,0.00007398975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036715926,0.00013647007,0.00019150786,0.0002045256,0.00037495492,0.00006241106,0.0017047062,0.00016706223,0.0000029332446],"category_scores_gemma":[0.00018557106,0.00012617113,0.00008449424,0.0006262413,0.00014588368,0.00017395086,0.00077498093,0.0004136717,0.0000033752412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012888468,0.00007867909,0.0010012956,0.00003696178,0.00006353484,0.0000020087066,0.0012068866,0.001029531,0.0017565589,0.9837735,0.0050202627,0.0060178647],"study_design_scores_gemma":[0.00037204914,0.00007358857,0.021837322,0.000028408438,0.000014055651,0.000007936224,0.000058051428,0.9437269,0.0001274277,0.017519055,0.016077116,0.00015809567],"about_ca_topic_score_codex":0.000018078474,"about_ca_topic_score_gemma":0.000013283313,"teacher_disagreement_score":0.9662545,"about_ca_system_score_codex":0.000019658037,"about_ca_system_score_gemma":0.00014468824,"threshold_uncertainty_score":0.5145109},"labels":[],"label_agreement":null},{"id":"W4318983914","doi":"10.22331/q-2023-02-02-912","title":"TensorCircuit: a Quantum Software Framework for the NISQ Era","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":129,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Tencent","keywords":"Computer science; Speedup; Quantum circuit; Quantum computer; Computational science; Qubit; Python (programming language); Quantum; Parallel computing; Software; Quantum algorithm; Parameterized complexity; Computer engineering; Electronic circuit; Computer architecture; Theoretical computer science; Quantum error correction; Algorithm; Programming language; Physics","score_opus":0.025815443835776754,"score_gpt":0.2767935362872286,"score_spread":0.2509780924514518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318983914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018384494,0.000414522,0.96537054,0.01116907,0.002524347,0.00047716804,0.00002498951,0.0016032594,0.00003163227],"genre_scores_gemma":[0.8230056,0.000098065706,0.17118314,0.0031178333,0.0016361733,0.00027260196,0.0000198276,0.00011694936,0.0005497583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759686,0.00008076906,0.0003398519,0.0006853551,0.00044718443,0.00084995944],"domain_scores_gemma":[0.99527866,0.003082678,0.00013924712,0.0012396213,0.00011902639,0.00014077892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007083348,0.00029180772,0.00029086228,0.0001642473,0.0008973986,0.000370022,0.0019850144,0.00015021043,0.000011919098],"category_scores_gemma":[0.0007510114,0.00019612398,0.00027075177,0.0012640884,0.00010750387,0.00014635299,0.0004317468,0.00054694636,0.00031297083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009880265,0.000048140137,0.00015218464,0.000056246696,0.00006320347,0.000041837382,0.0017159319,0.0060798544,0.00007848734,0.8404822,0.015737513,0.13553457],"study_design_scores_gemma":[0.00016753093,0.00011409766,0.0021807149,0.00005500023,0.000009616391,0.00002362735,0.00006144074,0.67494076,0.000054357923,0.30396348,0.018192207,0.00023714638],"about_ca_topic_score_codex":0.00002978146,"about_ca_topic_score_gemma":0.0000024138305,"teacher_disagreement_score":0.80462116,"about_ca_system_score_codex":0.00002437082,"about_ca_system_score_gemma":0.0001122991,"threshold_uncertainty_score":0.79977036},"labels":[],"label_agreement":null},{"id":"W4318993197","doi":"10.22331/q-2023-02-02-910","title":"Probing sign structure using measurement-induced entanglement","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Compute Canada; Ministry of Colleges and Universities","keywords":"Quantum entanglement; Physics; Quantum mechanics; Qubit; Bounded function; Sign (mathematics); Quantum; Statistical physics; Mathematics; Mathematical analysis","score_opus":0.05412731607902557,"score_gpt":0.2696434460916412,"score_spread":0.21551613001261563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318993197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8500053,0.00006627223,0.14639808,0.0007922711,0.0014604643,0.00029681702,0.0000048503853,0.00089962914,0.00007625988],"genre_scores_gemma":[0.9879589,0.0000014983282,0.011597751,0.00016600333,0.00022856332,0.0000049510354,0.0000035920596,0.000023289012,0.000015422534],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976805,0.00010768927,0.00028739788,0.00054352585,0.00077160087,0.00060932094],"domain_scores_gemma":[0.9990524,0.000041363903,0.00011853118,0.0005583632,0.00010600386,0.00012335285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057749037,0.00022924077,0.0002045221,0.00022502829,0.00035487872,0.00021836271,0.00080808136,0.00006914275,0.000013793877],"category_scores_gemma":[0.0000433821,0.00019926122,0.00008955163,0.0010141765,0.000019673664,0.00018100312,0.00039406295,0.00024764537,0.000054094322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015621314,0.00012244054,0.00035512782,0.00015144698,0.00016146016,0.00029637,0.0054720864,0.03534465,0.7457861,0.0474039,0.0028859912,0.16200484],"study_design_scores_gemma":[0.0002798632,0.00012158505,0.0004674904,0.00008328352,0.000007862179,0.000028716273,0.000069956586,0.9757556,0.013804765,0.008001717,0.0010772324,0.0003019816],"about_ca_topic_score_codex":0.00003126922,"about_ca_topic_score_gemma":0.000006184788,"teacher_disagreement_score":0.9404109,"about_ca_system_score_codex":0.00011132416,"about_ca_system_score_gemma":0.00013170381,"threshold_uncertainty_score":0.8125637},"labels":[],"label_agreement":null},{"id":"W4319287613","doi":"10.1109/qcs56647.2022.00011","title":"Rotation-inspired circuit cut optimization","year":2022,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantum circuit; Overhead (engineering); Qubit; Quantum; Quantum computer; Computer science; Unitary state; Algorithm; Electronic circuit; Set (abstract data type); Rotation (mathematics); Quantum state; Topology (electrical circuits); Mathematics; Quantum network; Artificial intelligence; Quantum mechanics; Physics; Combinatorics","score_opus":0.011783239278488981,"score_gpt":0.21573122596853667,"score_spread":0.20394798669004768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319287613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005421027,0.000021512787,0.9876924,0.0013550735,0.000397082,0.000089526315,0.0000012983553,0.00036713044,0.0046549463],"genre_scores_gemma":[0.7616923,0.0000013364105,0.23581807,0.0013695305,0.00008230187,0.000030916344,0.000010647737,0.000010488839,0.0009843954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991516,0.00006377867,0.00012216036,0.000249262,0.0002585348,0.00015468795],"domain_scores_gemma":[0.9995607,0.0000396814,0.00004813539,0.0002803472,0.000028138085,0.00004299778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015643256,0.000069470596,0.00006620658,0.00008469642,0.000431502,0.00009200329,0.00056326814,0.000011120325,0.00019369126],"category_scores_gemma":[0.000011062496,0.00006737111,0.000037799506,0.000458385,0.000009170192,0.00011375496,0.00033323248,0.00011595865,0.000013007958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.895176e-7,0.000023544155,0.000043643206,0.0000012525829,0.0000034702066,0.000005270492,0.00043614805,0.94228756,0.000029156425,0.02678756,0.0005168406,0.029865073],"study_design_scores_gemma":[0.00013802915,0.000056600857,0.00016216727,0.000001053854,0.000001023508,0.000025885256,0.00002495823,0.9939239,0.0000699364,0.002597909,0.0028984167,0.00010013798],"about_ca_topic_score_codex":0.0000179912,"about_ca_topic_score_gemma":9.594519e-7,"teacher_disagreement_score":0.7562713,"about_ca_system_score_codex":0.000027885162,"about_ca_system_score_gemma":0.00004576298,"threshold_uncertainty_score":0.33188084},"labels":[],"label_agreement":null},{"id":"W4319452980","doi":"10.5281/zenodo.7613143","title":"Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Science; Canadian Institute for Advanced Research; Oak Ridge National Laboratory; Alfred P. Sloan Foundation; Fermilab; U.S. Department of Energy","keywords":"Fourier transform; Electronic circuit; Quantum; Mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.04360218996327042,"score_gpt":0.2562328426347203,"score_spread":0.21263065267144987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319452980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020670133,0.000039073817,0.9639621,0.0015178622,0.0003211218,0.0005303341,0.00016752552,0.002050542,0.0107413465],"genre_scores_gemma":[0.9660172,0.000031502044,0.029307492,0.00020176757,0.00052948424,5.0366634e-7,0.0013329764,0.0012134431,0.0013656567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984286,0.00014263227,0.0002905668,0.0004256567,0.0003239969,0.000388574],"domain_scores_gemma":[0.9986625,0.00010374749,0.00012793989,0.00054697524,0.00042667458,0.00013220994],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00073270086,0.00012981231,0.00015833642,0.00038139496,0.0018714682,0.00035942718,0.0012044545,0.000054472603,0.00021782814],"category_scores_gemma":[0.00047262365,0.00013321663,0.0000984656,0.001358014,0.00009234639,0.0002569879,0.00089161197,0.0002166761,0.0012067506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024391025,0.00030243394,0.000008957419,0.0003415384,0.00014480924,0.000016629094,0.0050975974,0.011303653,0.0076417103,0.15414299,0.16483758,0.6561377],"study_design_scores_gemma":[0.00035457953,0.00020718509,0.00035942212,0.000041675725,0.000008850531,0.000048335183,0.0001226845,0.66305095,0.0004201096,0.0038286906,0.33138707,0.00017045577],"about_ca_topic_score_codex":0.000004258902,"about_ca_topic_score_gemma":9.1038025e-8,"teacher_disagreement_score":0.9453471,"about_ca_system_score_codex":0.00003666803,"about_ca_system_score_gemma":0.000010151287,"threshold_uncertainty_score":0.9995709},"labels":[],"label_agreement":null},{"id":"W4319453772","doi":"10.48550/arxiv.2302.03029","title":"Experimental demonstration of the advantage of adaptive quantum circuits","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Unitary state; Quantum circuit; Fidelity; Electronic circuit; Constant (computer programming); Computation; Computer science; Topology (electrical circuits); Quantum gate; Quantum computer; Quantum; High fidelity; Mathematics; Quantum network; Physics; Quantum mechanics; Algorithm; Telecommunications; Law","score_opus":0.06418272997025129,"score_gpt":0.20420916509607942,"score_spread":0.14002643512582813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319453772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64136046,0.000049302253,0.35730514,0.00004018617,0.0006583744,0.00019440282,0.000020623183,0.00009002121,0.0002814738],"genre_scores_gemma":[0.9990136,0.000011548638,0.0007746078,0.000011343785,0.000034950826,4.296695e-7,0.0000028577876,0.000012422071,0.00013825689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866724,0.00015376495,0.00023920776,0.00059805595,0.00014067748,0.00020102812],"domain_scores_gemma":[0.9983754,0.00012028718,0.00044719494,0.0008980908,0.00010408508,0.000054938104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018024688,0.00020532879,0.00028339855,0.00015041968,0.00010455689,0.00002103836,0.0016664698,0.00014388899,0.00000304944],"category_scores_gemma":[0.000015389474,0.00018280072,0.00025575855,0.00056031474,0.00018140231,0.00010684321,0.0018948972,0.00038540404,0.000005442139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001472977,0.00017202912,0.0014881161,0.00008708436,0.00010844622,0.000060735394,0.0013454474,0.69649684,0.0039779055,0.2949383,0.00005410392,0.0012562282],"study_design_scores_gemma":[0.000217202,0.000093671624,0.0032199542,0.00019258975,0.00002203007,0.000003663774,0.00029000992,0.96439016,0.015746206,0.015621671,0.0000067759124,0.00019609446],"about_ca_topic_score_codex":0.00011566796,"about_ca_topic_score_gemma":0.000011679088,"teacher_disagreement_score":0.3576531,"about_ca_system_score_codex":0.000056921992,"about_ca_system_score_gemma":0.0001995324,"threshold_uncertainty_score":0.7454397},"labels":[],"label_agreement":null},{"id":"W4319601507","doi":"10.1088/2632-2153/acb4df","title":"Neural network enhanced measurement efficiency for molecular groundstates","year":2023,"lang":"en","type":"article","venue":"Machine Learning Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Observable; Qubit; Estimator; Computer science; Statistical physics; Artificial neural network; Quantum; Scaling; Restricted Boltzmann machine; Boltzmann machine; Algorithm; Quantum tomography; Wave function; Artificial intelligence; Quantum state; Topology (electrical circuits); Theoretical computer science; Physics; Quantum mechanics; Mathematics; Statistics","score_opus":0.008999582188631634,"score_gpt":0.23919591357411593,"score_spread":0.2301963313854843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319601507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5193425,0.00041084466,0.47153926,0.0066597173,0.00034646777,0.00022756138,4.979777e-7,0.0013836258,0.00008954485],"genre_scores_gemma":[0.98206174,0.0000136401295,0.017672962,0.00014615881,0.00003488729,0.00002692027,0.0000010237183,0.000009249958,0.000033442942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979458,0.000032067604,0.00016890957,0.0006411283,0.0004929029,0.0007191928],"domain_scores_gemma":[0.9991951,0.00007648951,0.00008198616,0.00031537257,0.00025872997,0.00007229374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017852815,0.00015128062,0.00016805237,0.0004989797,0.000975128,0.0001975307,0.0010388985,0.000060554234,6.446154e-7],"category_scores_gemma":[0.00060785434,0.000126758,0.0000318157,0.004070203,0.00041224112,0.00013457485,0.00061023864,0.00030784676,0.000007544131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059404906,0.00003576797,0.001051651,0.000032603562,0.000013750023,0.000028807564,0.00058756105,0.104709476,0.10906589,0.07885928,0.00010952342,0.70549977],"study_design_scores_gemma":[0.00021377098,0.00032168176,0.00039386164,0.000019763022,0.0000028312902,0.000020293075,0.000025708196,0.97440815,0.006741172,0.016117183,0.0015676494,0.00016791167],"about_ca_topic_score_codex":0.0000111705085,"about_ca_topic_score_gemma":0.000003230744,"teacher_disagreement_score":0.8696987,"about_ca_system_score_codex":0.000031553867,"about_ca_system_score_gemma":0.00009803954,"threshold_uncertainty_score":0.74999946},"labels":[],"label_agreement":null},{"id":"W4319736340","doi":"10.1145/3579368","title":"Hybrid Quantum Annealing for Larger-than-QPU Lattice-structured Problems","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Quantum Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Quantum annealing; Coprocessor; Simulated annealing; Computer science; Lattice (music); Annealing (glass); Computational science; Iterated function; Quantum; Algorithm; Quantum computer; Mathematical optimization; Materials science; Parallel computing; Mathematics; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.027379943003627543,"score_gpt":0.2718793840757956,"score_spread":0.24449944107216806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319736340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29116592,0.000092951406,0.7020178,0.002082094,0.0021219125,0.0005640747,0.0000481152,0.0018913242,0.00001580028],"genre_scores_gemma":[0.9127274,0.000024719171,0.08622676,0.0003802217,0.00038088646,0.00004750243,0.000037260983,0.0000926084,0.00008265298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956303,0.0001871157,0.0008266615,0.0013427853,0.0006233712,0.0013897525],"domain_scores_gemma":[0.99599266,0.0016143736,0.0003130561,0.0015824754,0.00021246071,0.00028497644],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011457307,0.00058203546,0.0005934499,0.0006905051,0.0017095308,0.00049607846,0.0022049644,0.00016595027,0.00001005245],"category_scores_gemma":[0.00015397248,0.00056316407,0.00047347107,0.0015551435,0.00009255323,0.00033306758,0.0001368346,0.00077820814,0.000121823796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042086394,0.0001868565,0.00007768645,0.0002828479,0.00019124297,0.000067917535,0.0025047893,0.72316104,0.0014036971,0.013058781,0.00082838285,0.25819468],"study_design_scores_gemma":[0.0008944515,0.00033634374,0.00045376315,0.00023323736,0.000031096915,0.00009907139,0.00008793923,0.95589644,0.0020083196,0.03680891,0.0024879714,0.0006624596],"about_ca_topic_score_codex":0.000049945156,"about_ca_topic_score_gemma":0.000007190014,"teacher_disagreement_score":0.62156147,"about_ca_system_score_codex":0.00007951766,"about_ca_system_score_gemma":0.00013568676,"threshold_uncertainty_score":0.999682},"labels":[],"label_agreement":null},{"id":"W4319792570","doi":"10.48550/arxiv.2302.03888","title":"Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Science; Canadian Institute for Advanced Research; Oak Ridge National Laboratory; Alfred P. Sloan Foundation; Fermilab; U.S. Department of Energy","keywords":"Quantum Fourier transform; Fourier series; Fourier transform; Qubit; Discretization; Quantum; Quantum algorithm; Series (stratigraphy); Function (biology); Mathematics; Quantum circuit; Algorithm; Quantum mechanics; Mathematical analysis; Quantum error correction; Physics","score_opus":0.10029701370056034,"score_gpt":0.21756263329830122,"score_spread":0.11726561959774089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319792570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10588611,0.00003596678,0.89113224,0.0002248746,0.0012616422,0.0004440474,0.000089364905,0.0005161613,0.000409581],"genre_scores_gemma":[0.97530997,0.000023159051,0.02302556,0.000044835728,0.00024409544,0.000004942063,0.000059452927,0.00004095444,0.0012470438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980332,0.000085655985,0.0003210922,0.0010257352,0.00012365826,0.00041062516],"domain_scores_gemma":[0.99773294,0.00039706758,0.00035891047,0.0011291499,0.00023340013,0.00014853955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034156113,0.00030834659,0.00040564555,0.00045301282,0.00031852262,0.00007674593,0.0014169562,0.00025346433,0.0000053368117],"category_scores_gemma":[0.00009020566,0.00034932178,0.00041287034,0.00083682087,0.00010524868,0.00018587438,0.0012146749,0.0005994342,0.000039218914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008376836,0.000114852926,0.00037554218,0.00026467003,0.00017851978,0.00004408292,0.00043644462,0.83210886,0.000051294868,0.16255753,0.0007346916,0.0031251411],"study_design_scores_gemma":[0.00029733896,0.00006636746,0.00043885136,0.00017184562,0.000061318715,0.000004123923,0.0000521766,0.91584486,0.00008178668,0.08232875,0.00032603825,0.00032656218],"about_ca_topic_score_codex":0.00006162528,"about_ca_topic_score_gemma":0.000013700114,"teacher_disagreement_score":0.86942387,"about_ca_system_score_codex":0.0000703118,"about_ca_system_score_gemma":0.0002938862,"threshold_uncertainty_score":0.9998959},"labels":[],"label_agreement":null},{"id":"W4319971932","doi":"10.20944/preprints202302.0184.v1","title":"Accelerating the Wheel Factoring Techniques","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"King Saud University","keywords":"Factoring; Integer factorization; Cryptosystem; Prime (order theory); Factorization; Prime factor; Computer science; Prime number; Set (abstract data type); Polynomial; Integer (computer science); Key (lock); Time complexity; Factorization of polynomials; Theoretical computer science; Algorithm; Discrete mathematics; Public-key cryptography; Mathematics; Cryptography; Combinatorics; Encryption; Matrix polynomial; Computer security; Programming language","score_opus":0.17946638588120453,"score_gpt":0.3539120227156378,"score_spread":0.1744456368344333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319971932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7936389,0.00015772277,0.18231915,0.008927843,0.004204138,0.0012225515,0.000012495819,0.005969147,0.003548059],"genre_scores_gemma":[0.97191936,0.00006183227,0.025552358,0.00032883225,0.00097482686,0.0001874256,0.000007708917,0.000070891176,0.0008967583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965256,0.00021213818,0.0005760001,0.0014722077,0.00059186533,0.00062221003],"domain_scores_gemma":[0.9960916,0.00033028983,0.00039259033,0.0029238428,0.00013837431,0.00012330362],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014018221,0.00048490896,0.00042331222,0.00019174363,0.0005159598,0.00037309199,0.004737032,0.00030057368,0.0000272197],"category_scores_gemma":[0.00028806558,0.00036399323,0.0002948892,0.0003918202,0.000084797415,0.00015596166,0.014974537,0.002215996,0.00050979276],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002607327,0.0005133055,0.34531617,0.0014650943,0.0011171337,0.0004734261,0.072811894,0.09598731,0.031068943,0.032610007,0.001428618,0.417182],"study_design_scores_gemma":[0.00026582953,0.00005417464,0.29058215,0.0014679806,0.000051645766,0.000068788584,0.00012664997,0.5155648,0.11059604,0.048112854,0.030928154,0.002180915],"about_ca_topic_score_codex":0.00028929894,"about_ca_topic_score_gemma":0.0000085685415,"teacher_disagreement_score":0.4195775,"about_ca_system_score_codex":0.000097554694,"about_ca_system_score_gemma":0.00021600965,"threshold_uncertainty_score":0.9998812},"labels":[],"label_agreement":null},{"id":"W4320352225","doi":"10.48550/arxiv.2202.05260","title":"Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Oracle; Computer science; Permutation (music); Computation; Quantum; Heuristic; Quantum computer; Theoretical computer science; Quantum algorithm; Algorithm; Programming language; Quantum mechanics; Physics","score_opus":0.03285278059719928,"score_gpt":0.18627777097850662,"score_spread":0.15342499038130733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320352225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3487119,0.00006570966,0.6488183,0.00064814684,0.00019977533,0.00055192836,0.000015934167,0.00015992526,0.00082834146],"genre_scores_gemma":[0.99621767,0.000010491004,0.0030792186,0.0001226065,0.00005069274,0.000003958641,0.000024798821,0.000018246286,0.00047233936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979733,0.00046890194,0.0002646655,0.00078207074,0.00022550208,0.0002855254],"domain_scores_gemma":[0.99754244,0.0005188714,0.00059247966,0.0010901988,0.00016473202,0.00009130696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044353135,0.00029541212,0.00048498865,0.00021041033,0.00046712547,0.00011246286,0.0020141944,0.00010623729,0.000026967338],"category_scores_gemma":[0.00002422981,0.00022578052,0.00025754346,0.00075176626,0.00020111223,0.00008853619,0.0017402375,0.00079440605,0.000004513488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100724705,0.000083879124,0.00009386107,0.000028125562,0.00014076059,0.000050876457,0.00069927383,0.9200964,0.0000074262293,0.07788904,0.000242611,0.00056705676],"study_design_scores_gemma":[0.0017481872,0.00017551325,0.0004765796,0.000053917312,0.000095500356,0.000008359952,0.00029785422,0.99119973,0.000014379539,0.00470966,0.0009493806,0.00027096077],"about_ca_topic_score_codex":0.00012454102,"about_ca_topic_score_gemma":0.000014934559,"teacher_disagreement_score":0.64750576,"about_ca_system_score_codex":0.00009996979,"about_ca_system_score_gemma":0.00025103,"threshold_uncertainty_score":0.9207063},"labels":[],"label_agreement":null},{"id":"W4320473697","doi":"10.48550/arxiv.2112.02600","title":"A Quantum Computer Amenable Sparse Matrix Equation Solver","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Quantum computer; Solver; Matrix (chemical analysis); Unitary matrix; Computer science; Sparse matrix; Quantum algorithm; Quantum; Generalization; Unitary state; Quantum phase estimation algorithm; Inverse; Applied mathematics; Mathematics; Algorithm; Mathematical optimization; Quantum simulator; Quantum mechanics; Mathematical analysis; Physics","score_opus":0.05648247164602924,"score_gpt":0.1956171321372463,"score_spread":0.13913466049121706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320473697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2980236,0.00008967,0.69963723,0.00020189819,0.0013178993,0.00018866817,0.000005925054,0.00035714524,0.00017791548],"genre_scores_gemma":[0.9566968,0.000069739835,0.041735422,0.00021149346,0.00034983657,9.1312063e-7,0.000041391755,0.000029910227,0.00086445664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970164,0.00024707447,0.0003048036,0.0016458421,0.00019270681,0.0005932182],"domain_scores_gemma":[0.9974488,0.00014497095,0.00033614744,0.0016100238,0.00023608212,0.00022397221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003412344,0.0004644488,0.0004985387,0.0003060305,0.00027806757,0.0005577282,0.0019517667,0.0003372161,0.000041889576],"category_scores_gemma":[0.000018314462,0.00052039855,0.00036499646,0.0007754772,0.00008927618,0.0003711901,0.0038563653,0.0009348496,0.00010460657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008641836,0.000121222794,0.00019647664,0.000082289625,0.00008887745,0.0007215314,0.00045345462,0.94393003,0.000031060223,0.0515713,0.00062933937,0.0021657783],"study_design_scores_gemma":[0.00039743265,0.000069083435,0.00036536963,0.00018474032,0.000043404707,0.000020757152,0.00003720644,0.9797791,0.000070843635,0.017652025,0.0007931204,0.0005868929],"about_ca_topic_score_codex":0.00023188518,"about_ca_topic_score_gemma":0.00002044483,"teacher_disagreement_score":0.6586732,"about_ca_system_score_codex":0.0001804386,"about_ca_system_score_gemma":0.00035586068,"threshold_uncertainty_score":0.99972475},"labels":[],"label_agreement":null},{"id":"W4320561180","doi":"10.3929/ethz-b-000592781","title":"Tailoring Three-Dimensional Topological Codes for Biased Noise","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; University of Waterloo; Perimeter Institute","funders":"","keywords":"Topology (electrical circuits); Qubit; Toric code; Decoding methods; Lattice (music); Pauli exclusion principle; Physics; Algorithm; Mathematics; Quantum mechanics; Topological order; Combinatorics","score_opus":0.07420260839066285,"score_gpt":0.21070716390899372,"score_spread":0.13650455551833085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320561180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4758211,0.000054471904,0.52213323,0.0002606304,0.00092932425,0.0002923245,0.00004138656,0.0003062489,0.00016127362],"genre_scores_gemma":[0.974079,0.000007359868,0.0250588,0.00019857583,0.00018613474,0.000004611295,0.00003398927,0.000019134079,0.00041238448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977484,0.00011892259,0.00020605589,0.0013180163,0.00014101942,0.00046758598],"domain_scores_gemma":[0.9981618,0.00042564134,0.0002081083,0.000938998,0.00010019878,0.00016525059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036494565,0.00033562392,0.00038289352,0.00021893076,0.0005431129,0.00011533373,0.0020246108,0.00019332167,0.00007342751],"category_scores_gemma":[0.0000553681,0.00034770582,0.0003577734,0.00040483935,0.00011252362,0.000105194726,0.0041083912,0.00079222774,0.000012218194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036838414,0.00008942319,0.0006949549,0.00003903221,0.000054246455,0.00021726437,0.00006096622,0.92008543,0.00002921627,0.07703154,0.00020153844,0.0014595378],"study_design_scores_gemma":[0.0004329201,0.00013551947,0.00085651287,0.0000369688,0.00002817708,0.000008309173,0.0000126952655,0.9228409,0.00004657763,0.07391707,0.0012755338,0.0004088502],"about_ca_topic_score_codex":0.00010999025,"about_ca_topic_score_gemma":0.000023841818,"teacher_disagreement_score":0.4982579,"about_ca_system_score_codex":0.00014497651,"about_ca_system_score_gemma":0.00020252659,"threshold_uncertainty_score":0.9998975},"labels":[],"label_agreement":null},{"id":"W4320890236","doi":"10.1016/j.disc.2023.113369","title":"One-generator quasi-cyclic codes and their dual codes","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; United Arab Emirates University","keywords":"Linear code; Block code; Expander code; Luby transform code; Mathematics; Concatenated error correction code; Reed–Muller code; Discrete mathematics; Hamming code; Group code; Generator (circuit theory); Generator matrix; Algorithm; Quantum mechanics; Decoding methods; Physics","score_opus":0.022398441982459622,"score_gpt":0.2531003522162354,"score_spread":0.23070191023377576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320890236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6110722,0.00017212931,0.38578773,0.0013999096,0.00021031556,0.00017671511,0.000038027436,0.0007222444,0.00042071863],"genre_scores_gemma":[0.8715148,0.00005819193,0.12771931,0.00020749704,0.00020099031,0.00001645692,0.000017101685,0.000034469715,0.00023116081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873203,0.000057860103,0.00026608762,0.00034992173,0.00023005219,0.0003640317],"domain_scores_gemma":[0.9988938,0.0003284774,0.00009775719,0.00052243366,0.000035494704,0.00012206073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003934316,0.00020825728,0.00030337358,0.0001135971,0.00024496307,0.00029215243,0.00045451312,0.00006217579,0.00000343565],"category_scores_gemma":[0.000072723706,0.00015745153,0.00007292818,0.00044357963,0.00008889964,0.00010542688,0.00047872963,0.00015366406,0.000057875397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009923764,0.00060265046,0.00040791568,0.0011377708,0.00041662698,0.000124885,0.077573806,0.0032156229,0.029884303,0.71973836,0.0045712963,0.16231686],"study_design_scores_gemma":[0.00018345642,0.00009043359,0.00035575914,0.00009529309,0.0000079235,0.000032779735,0.00037416953,0.9300527,0.0034756602,0.06446871,0.0005764123,0.00028671717],"about_ca_topic_score_codex":0.0000064667443,"about_ca_topic_score_gemma":0.000005552832,"teacher_disagreement_score":0.9268371,"about_ca_system_score_codex":0.000009249759,"about_ca_system_score_gemma":0.000028721812,"threshold_uncertainty_score":0.64206874},"labels":[],"label_agreement":null},{"id":"W4320916903","doi":"10.1088/1742-6596/2438/1/012007","title":"Quantum computing for data science","year":2023,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Alberta","keywords":"Quantum computer; Computer science; Perspective (graphical); Quantum; State (computer science); Data science; Computational science; Theoretical computer science; Artificial intelligence; Algorithm; Physics; Quantum mechanics","score_opus":0.06566096633072292,"score_gpt":0.3140065022597345,"score_spread":0.24834553592901154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320916903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07782072,0.000028611563,0.9189734,0.0017404668,0.0011805139,0.00007770896,0.000009744398,0.00009722479,0.00007160468],"genre_scores_gemma":[0.908004,0.00002308065,0.09132618,0.00006682547,0.00054070225,5.060616e-7,0.0000040125715,0.000009169346,0.000025543795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836594,0.000032215805,0.00037118906,0.00032368,0.00051361613,0.00039338114],"domain_scores_gemma":[0.9978904,0.00021623854,0.0004093358,0.00068892847,0.00067980704,0.000115272516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013857706,0.00013857556,0.0002651764,0.00016829588,0.00041093578,0.00050576497,0.0034875344,0.000025818325,8.965568e-7],"category_scores_gemma":[0.00023398317,0.00011205109,0.00007449652,0.0011471693,0.00025615594,0.0020085652,0.0011307675,0.00022142543,0.000007254373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013319525,0.000041110117,0.00012190362,0.000045196222,0.0000276777,0.000021591943,0.0018594657,0.003933841,0.008065433,0.44475278,0.0010583074,0.5400594],"study_design_scores_gemma":[0.00022704646,0.0002454512,0.00086014654,0.00009698239,0.000007275901,0.00006761023,0.00015382201,0.9006894,0.012366475,0.083466485,0.001656387,0.00016287451],"about_ca_topic_score_codex":0.0000032911737,"about_ca_topic_score_gemma":7.0099554e-7,"teacher_disagreement_score":0.8967556,"about_ca_system_score_codex":0.000017799339,"about_ca_system_score_gemma":0.0007003755,"threshold_uncertainty_score":0.6480765},"labels":[],"label_agreement":null},{"id":"W4321192562","doi":"10.1109/icce56470.2023.10043394","title":"Comparison of heuristic approaches to PCI planning for Quantum Computers","year":2023,"lang":"en","type":"article","venue":"2023 IEEE International Conference on Consumer Electronics (ICCE)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Quantum annealing; Heuristic; Quantum computer; Qubit; Quadratic unconstrained binary optimization; Decomposition; Theoretical computer science; Quantum algorithm; Mathematical optimization; Optimization problem; Heuristics; Quantum; Parallel computing; Algorithm; Mathematics; Artificial intelligence","score_opus":0.22115958288822654,"score_gpt":0.3697650420043322,"score_spread":0.14860545911610565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321192562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15696491,0.00017523982,0.83209085,0.0060387263,0.002785019,0.0005920604,0.00007232848,0.0003902133,0.0008906463],"genre_scores_gemma":[0.98684734,0.000017737042,0.012338452,0.00021873106,0.00014418308,0.000058833448,0.00005942506,0.000026399352,0.00028888526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746865,0.00007595385,0.0005503073,0.0007004488,0.0005867697,0.0006178495],"domain_scores_gemma":[0.9982463,0.0006622937,0.00025286814,0.00045070506,0.00024089482,0.00014690879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044895333,0.0002915846,0.0004284173,0.0005054049,0.0001713676,0.00021388037,0.001695535,0.00009260882,0.000012158608],"category_scores_gemma":[0.00010599955,0.00028905185,0.00015992104,0.0006188642,0.00006760239,0.00010911453,0.00023511362,0.00037315357,0.000104858365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001674036,0.00031164032,0.0012619662,0.00009380996,0.00042116357,0.000018872335,0.002461245,0.15291728,0.0036055706,0.7263526,0.019180806,0.09320767],"study_design_scores_gemma":[0.00044150933,0.00043752752,0.00041407283,0.00013830849,0.000011436333,0.0000080187365,0.00006313423,0.979339,0.0024842627,0.010544141,0.0058045518,0.000314044],"about_ca_topic_score_codex":0.000019123523,"about_ca_topic_score_gemma":0.000011574414,"teacher_disagreement_score":0.82988244,"about_ca_system_score_codex":0.000091303664,"about_ca_system_score_gemma":0.00027825247,"threshold_uncertainty_score":0.9999562},"labels":[],"label_agreement":null},{"id":"W4321227927","doi":"10.1140/epjqt/s40507-023-00164-3","title":"Quantum encryption of superposition states with quantum permutation pad in IBM quantum computers","year":2023,"lang":"en","type":"article","venue":"EPJ Quantum Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Quantum computer; Qubit; Quantum algorithm; Quantum superposition; Computer science; Quantum network; Quantum; Quantum mechanics; Physics","score_opus":0.007799366007504372,"score_gpt":0.23226023598679205,"score_spread":0.22446086997928769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321227927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7215271,0.00018382927,0.27145696,0.0043676477,0.00059863745,0.00041940238,0.000015703934,0.0014192987,0.000011430264],"genre_scores_gemma":[0.98944587,0.00020930987,0.009911514,0.00011508244,0.000069342204,0.00007100279,0.000104380975,0.000060089704,0.000013416189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957194,0.00027205242,0.0010080405,0.0012035714,0.00069076725,0.0011062017],"domain_scores_gemma":[0.99758273,0.0004356693,0.0004752843,0.0011024325,0.0002694487,0.00013440962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008716414,0.00055187126,0.00079449336,0.002521881,0.0002894738,0.00011913372,0.0014941087,0.00042736882,0.000008873998],"category_scores_gemma":[0.00009758326,0.00049356226,0.00014955293,0.0050958064,0.00047653547,0.0005245697,0.00041552293,0.000817494,0.00011176388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017080684,0.000592396,0.007513171,0.00031498654,0.000128065,0.0005932708,0.0057140207,0.045077987,0.030232584,0.87518924,0.0007179226,0.033755537],"study_design_scores_gemma":[0.0010467139,0.0012684065,0.008427061,0.0003259289,0.000014773305,0.00014651612,0.00068271696,0.86163706,0.0039459104,0.12168156,0.00028066844,0.00054269674],"about_ca_topic_score_codex":0.0002512358,"about_ca_topic_score_gemma":0.000058187507,"teacher_disagreement_score":0.8165591,"about_ca_system_score_codex":0.00012547136,"about_ca_system_score_gemma":0.00017479944,"threshold_uncertainty_score":0.9997516},"labels":[],"label_agreement":null},{"id":"W4321444449","doi":"10.22331/q-2023-02-21-929","title":"Efficient color code decoders in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mi>d</mml:mi><mml:mo>&amp;#x2265;</mml:mo><mml:mn>2</mml:mn></mml:math> dimensions from toric code decoders","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Government of Canada; Institut Périmètre de physique théorique; Industry Canada; Simons Foundation","keywords":"Decoding methods; Code (set theory); Computer science; Approx; Algorithm; Lattice (music); Square (algebra); Mathematics; Physics; Geometry","score_opus":0.020510974184913034,"score_gpt":0.24950028872440114,"score_spread":0.2289893145394881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321444449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97511697,0.00040449106,0.018398443,0.0010155473,0.0029311574,0.00009015173,0.00021268081,0.0006771337,0.0011534266],"genre_scores_gemma":[0.982702,0.00016926363,0.014847796,0.0009904173,0.0005329194,0.00022525004,0.00024152754,0.00020897097,0.000081844766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941145,0.00027365348,0.0010526608,0.0015447529,0.0013744694,0.0016399659],"domain_scores_gemma":[0.9956795,0.0014639952,0.00065496267,0.0015221355,0.00009985657,0.0005795631],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012621672,0.00059561373,0.0003873008,0.00044032212,0.0011413482,0.00066193525,0.0019220293,0.0007020365,0.00018091586],"category_scores_gemma":[0.0005936148,0.0007963406,0.00063373975,0.0015289278,0.00045275965,0.00031654956,0.001645398,0.0010642001,0.0018660298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012994646,0.0002439454,0.0000180161,0.00012838554,0.00022266348,0.00047178235,0.0036326272,0.061630033,0.0011696239,0.9149501,0.015040863,0.0023620552],"study_design_scores_gemma":[0.0009060882,0.000490144,0.00017496721,0.00042969282,0.00012462643,0.0001864104,0.0005660066,0.97561866,0.010003344,0.0043793465,0.0063097184,0.0008109827],"about_ca_topic_score_codex":0.0011879646,"about_ca_topic_score_gemma":0.0011113686,"teacher_disagreement_score":0.91398865,"about_ca_system_score_codex":0.000043281158,"about_ca_system_score_gemma":0.0006321101,"threshold_uncertainty_score":0.9994488},"labels":[],"label_agreement":null},{"id":"W4321484836","doi":"10.48550/arxiv.2202.10601","title":"Quantum Gaussian process model of potential energy surface for a polyatomic molecule","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Statistical physics; Quantum entanglement; Qubit; Quantum; Quantum algorithm; Bayesian optimization; Gaussian; Quantum computer; Quantum process; Ansatz; Computer science; Gaussian process; Quantum state; Algorithm; Mathematics; Quantum mechanics; Physics; Quantum dynamics; Artificial intelligence","score_opus":0.030699217886364878,"score_gpt":0.19318543044111536,"score_spread":0.1624862125547505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321484836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3982585,0.000048338425,0.6008593,0.00008716964,0.0002763601,0.0001572434,0.000065080545,0.00012336271,0.0001246659],"genre_scores_gemma":[0.991294,0.000021503296,0.008055042,0.00006662425,0.00004635425,0.000002051654,0.00002794432,0.000032991826,0.00045347234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978089,0.00010817574,0.00027416213,0.0011946087,0.0001637586,0.00045040838],"domain_scores_gemma":[0.99821454,0.00006040443,0.00041390685,0.001020062,0.00014416462,0.00014693587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020458018,0.0003525937,0.00044646647,0.0002352462,0.00026024092,0.00006876628,0.0025203696,0.00018972617,0.000009688928],"category_scores_gemma":[0.000011846997,0.0004054444,0.00037498586,0.00049175037,0.00009043381,0.00012559236,0.0022246426,0.00046569432,0.0000010783235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040412924,0.00009956862,0.000031508767,0.0001146893,0.0000625749,0.00004493379,0.00020867684,0.89749515,0.0002814945,0.10139498,0.000048517897,0.00017746986],"study_design_scores_gemma":[0.0004228603,0.00009108035,0.000015083894,0.00004196389,0.000043920823,0.0000050986137,0.0000403997,0.90296984,0.0006915765,0.09525624,0.000030239262,0.00039170834],"about_ca_topic_score_codex":0.0001774534,"about_ca_topic_score_gemma":0.000006407716,"teacher_disagreement_score":0.5930355,"about_ca_system_score_codex":0.00009992521,"about_ca_system_score_gemma":0.0005657329,"threshold_uncertainty_score":0.9998397},"labels":[],"label_agreement":null},{"id":"W4321498498","doi":"10.1038/s41534-023-00683-y","title":"Deterministic improvements of quantum measurements with grouping of compatible operators, non-local transformations, and covariance estimates","year":2023,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Observable; Covariance; Pauli exclusion principle; Quantum; Quantum state; Computer science; Mathematics; Algorithm; Unitary state; Statistical physics; Mathematical optimization; Applied mathematics; Quantum mechanics; Physics; Statistics","score_opus":0.01492629629924686,"score_gpt":0.2399746879689199,"score_spread":0.22504839166967305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321498498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40052754,0.000016081582,0.59890705,0.00006670021,0.00011345142,0.00022484352,0.0000123496075,0.00008236624,0.000049624574],"genre_scores_gemma":[0.98278695,0.000017765591,0.017062787,0.0000573833,0.000009239989,0.00001647971,0.000040899387,0.000007449213,0.00000102271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983684,0.000031017924,0.00067634776,0.00015760983,0.0004971287,0.0002695026],"domain_scores_gemma":[0.99897397,0.00008953977,0.00035818203,0.00028522915,0.0002209366,0.000072145725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051802,0.00018282617,0.00028957907,0.0003088214,0.00018724587,0.00010377401,0.00037205915,0.00005580105,0.0000014251375],"category_scores_gemma":[0.00003514581,0.00015134441,0.000037405567,0.00074103184,0.00009813993,0.001387255,0.00009848895,0.000115191695,0.000009333613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033038497,0.00035772755,0.013164952,0.0045481143,0.00035959535,0.000013781945,0.038018286,0.42246813,0.011849945,0.068726525,0.000441379,0.43972117],"study_design_scores_gemma":[0.00080934557,0.00039949952,0.011160508,0.00027691052,0.000013254656,0.000015920918,0.00019047783,0.9820944,0.0040472094,0.0007725896,0.000048937312,0.00017095696],"about_ca_topic_score_codex":0.00007905611,"about_ca_topic_score_gemma":0.000003672279,"teacher_disagreement_score":0.5822594,"about_ca_system_score_codex":0.000023753028,"about_ca_system_score_gemma":0.00010206006,"threshold_uncertainty_score":0.6171646},"labels":[],"label_agreement":null},{"id":"W4321610982","doi":"10.1038/s41586-022-05434-1","title":"Suppressing quantum errors by scaling a surface code logical qubit","year":2023,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1050,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, Santa Barbara; Canadian Institute for Advanced Research; Ames Research Center; National Aeronautics and Space Administration","keywords":"Qubit; Computer science; Error detection and correction; Quantum computer; Algorithm; Quantum error correction; Word error rate; Code (set theory); Flux qubit; Quantum; Theoretical computer science; Topology (electrical circuits); Set (abstract data type); Physics; Mathematics; Quantum mechanics; Artificial intelligence","score_opus":0.013867897489296795,"score_gpt":0.2749677534111713,"score_spread":0.2610998559218745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321610982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9024557,0.0016012134,0.0800839,0.011746481,0.0017165458,0.00016893803,0.000037303354,0.0018499534,0.00033996382],"genre_scores_gemma":[0.9781447,0.000014720135,0.020105373,0.0011758652,0.000172988,0.0000020552989,0.000022590975,0.000022692557,0.0003390167],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795,0.00010896322,0.00021291188,0.00063413277,0.0005061041,0.0005878938],"domain_scores_gemma":[0.9989678,0.00024463015,0.00008077202,0.00049654755,0.00005978315,0.00015045417],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00043737085,0.00022319365,0.0002339417,0.000088135625,0.00034167615,0.0002707997,0.0011273377,0.00076195074,0.00000976776],"category_scores_gemma":[0.00011357624,0.0001784464,0.00011268915,0.0010744643,0.000058722126,0.00016451192,0.0004947451,0.002464639,0.00009452336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005476882,0.00036810554,0.0020404551,0.00021182309,0.00014778382,0.0010806782,0.006969444,0.19606616,0.06928424,0.04009404,0.5768777,0.10680481],"study_design_scores_gemma":[0.00022825503,0.000037647245,0.00083436817,0.00006347155,0.0000037407249,0.0000377401,0.000033882076,0.96410316,0.002620622,0.003989192,0.027765926,0.00028202072],"about_ca_topic_score_codex":0.000009800239,"about_ca_topic_score_gemma":0.0000020617517,"teacher_disagreement_score":0.76803696,"about_ca_system_score_codex":0.000025145933,"about_ca_system_score_gemma":0.000046974736,"threshold_uncertainty_score":0.99983674},"labels":[],"label_agreement":null},{"id":"W4321612523","doi":"10.1021/acs.jctc.2c01155","title":"Efficient Construction of Involutory Linear Combinations of Anticommuting Pauli Generators for Large-Scale Iterative Qubit Coupled Cluster Calculations","year":2023,"lang":"en","type":"article","venue":"Journal of Chemical Theory and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; OTI Lumionics (Canada)","funders":"","keywords":"Coupled cluster; Qubit; Pauli exclusion principle; Scale (ratio); Cluster (spacecraft); Computer science; Linear scale; Theoretical computer science; Physics; Algorithm; Quantum; Quantum mechanics; Molecule","score_opus":0.010363368742719021,"score_gpt":0.2698613213723691,"score_spread":0.2594979526296501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321612523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5158537,0.000040386494,0.48378503,0.000114264774,0.00012207738,0.00006411317,0.000004645342,0.000011978279,0.0000037946033],"genre_scores_gemma":[0.90921193,0.0000030380456,0.09066567,0.00003176184,0.00007163535,0.0000015188159,0.0000072437215,0.0000054741404,0.0000017235506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888396,0.00015757444,0.00052050914,0.00011981051,0.00019661603,0.00012153536],"domain_scores_gemma":[0.9980466,0.0008915942,0.00049710803,0.000084256026,0.0004281765,0.000052284355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010578686,0.000089034234,0.00024156024,0.00018285727,0.00011443207,0.000023575973,0.00014531246,0.00005589363,7.1185144e-7],"category_scores_gemma":[0.00015930718,0.000076231074,0.00010899056,0.0003813568,0.00008919252,0.00007425626,0.00008110166,0.00013871209,2.3230221e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019009707,0.00060426607,0.0004367559,0.0002268707,0.00017250303,0.000003318004,0.010723421,0.7352288,0.05807963,0.16869654,0.00008369088,0.025554162],"study_design_scores_gemma":[0.0010876037,0.00011406536,0.00027794408,0.00009256186,0.00002160674,0.000026340516,0.0002127392,0.9465742,0.015769722,0.0357409,0.000010797014,0.00007149683],"about_ca_topic_score_codex":4.9547424e-7,"about_ca_topic_score_gemma":9.68876e-8,"teacher_disagreement_score":0.39335823,"about_ca_system_score_codex":0.000015985373,"about_ca_system_score_gemma":0.00005145159,"threshold_uncertainty_score":0.31086132},"labels":[],"label_agreement":null},{"id":"W4321636521","doi":"10.1109/sc41404.2022.00073","title":"Positive-Phase Temperature Scaling for Quantum-Assisted Boltzmann Machine Training","year":2022,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Scaling; Quantization (signal processing); Computer science; Statistical physics; Quantum; Boltzmann constant; Probabilistic logic; Algorithm; Convergence (economics); Rate of convergence; Mathematical optimization; Mathematics; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.021153495502460314,"score_gpt":0.2778808124616281,"score_spread":0.2567273169591678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321636521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32136267,0.00036347166,0.67038196,0.00521113,0.0009143265,0.0005093917,0.00012130414,0.00070128666,0.0004344679],"genre_scores_gemma":[0.875773,9.957274e-7,0.12188206,0.001634216,0.00017286617,0.00005913925,0.000057584057,0.000024583145,0.00039551323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981148,0.00013396952,0.0002885854,0.00060838315,0.00036960887,0.00048464327],"domain_scores_gemma":[0.9990276,0.00025143576,0.000101719794,0.00041875383,0.000066975226,0.00013350969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061332714,0.0002232131,0.0002690038,0.00016748102,0.0012647988,0.00023997024,0.0009311871,0.000044439257,0.00003771385],"category_scores_gemma":[0.000040985637,0.00019532963,0.00017608718,0.00054947,0.000027959712,0.00013813296,0.00049101113,0.00043543155,0.0000027082167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013992304,0.001374938,0.000059536807,0.00007630339,0.00021569974,0.0002576617,0.012603302,0.03362191,0.038717512,0.17013617,0.005222903,0.73757416],"study_design_scores_gemma":[0.0014478925,0.00046507252,0.00019540053,0.000018301114,0.000010050213,0.00019796472,0.00020853824,0.9890508,0.00089462515,0.0023149601,0.0048790714,0.00031731417],"about_ca_topic_score_codex":0.00002439613,"about_ca_topic_score_gemma":0.0000021697258,"teacher_disagreement_score":0.9554289,"about_ca_system_score_codex":0.000049237377,"about_ca_system_score_gemma":0.00010396833,"threshold_uncertainty_score":0.9727938},"labels":[],"label_agreement":null},{"id":"W4321650014","doi":"10.48550/arxiv.2302.11454","title":"Quantum complexity of the Kronecker coefficients","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Office of Science; Ministry of Colleges and Universities; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Government of Canada; U.S. Department of Energy","keywords":"Kronecker delta; Mathematics; Quantum; Rank (graph theory); Dimension (graph theory); Quantum computer; Complexity class; Quantum algorithm; Polynomial; Time complexity; Discrete mathematics; Combinatorics; Quantum mechanics; Mathematical analysis; Physics","score_opus":0.10413899433076286,"score_gpt":0.20712387794654105,"score_spread":0.10298488361577819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321650014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5506986,0.000017946104,0.44664967,0.00033405985,0.0016511303,0.0002127801,0.000033418542,0.0001942166,0.00020821489],"genre_scores_gemma":[0.99760145,0.000012431931,0.0016078593,0.00005399125,0.000057526562,2.765506e-7,0.0000056906924,0.000018535886,0.00064226304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806,0.00021220488,0.0002465432,0.0009294209,0.00018416296,0.0003676892],"domain_scores_gemma":[0.99746823,0.00012570387,0.00035963324,0.0018035999,0.00014287737,0.00009997908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031073007,0.00028131943,0.00035242445,0.00016873115,0.00024412302,0.00006807573,0.0036068324,0.00018664269,0.000008236459],"category_scores_gemma":[0.00004740562,0.0002350378,0.00034166488,0.0009799105,0.00041820243,0.00006523089,0.006008755,0.00072135,0.00006467475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064672654,0.00009778867,0.0013339758,0.00007039431,0.000060949373,0.00005135995,0.00035098824,0.84718496,0.000024449824,0.1498237,0.00038958268,0.0006054203],"study_design_scores_gemma":[0.00019875984,0.000025492513,0.009308791,0.00014169878,0.000022833268,0.0000029267728,0.0000205669,0.91413903,0.00010399134,0.07555524,0.00024098341,0.00023968579],"about_ca_topic_score_codex":0.00023274598,"about_ca_topic_score_gemma":0.000031133226,"teacher_disagreement_score":0.44690287,"about_ca_system_score_codex":0.000072944276,"about_ca_system_score_gemma":0.00019062668,"threshold_uncertainty_score":0.95845634},"labels":[],"label_agreement":null},{"id":"W4322628972","doi":"10.3390/fi15030094","title":"Quantum Computing for Healthcare: A Review","year":2023,"lang":"en","type":"review","venue":"Future Internet","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":215,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Health care; Quantum computer; Data science; Process (computing); Field (mathematics); Management science; Quantum","score_opus":0.0603345714871014,"score_gpt":0.36202420633698673,"score_spread":0.3016896348498853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322628972","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.680576e-8,0.89328337,0.09540321,0.0026733652,0.0060797255,0.0016130671,0.000057731333,0.0008637969,0.000025664212],"genre_scores_gemma":[1.4422771e-7,0.9744343,0.019147657,0.0014692459,0.0040586167,0.00012843488,0.00015356451,0.00011488753,0.0004931316],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99608254,0.00031107818,0.0012049945,0.0012391681,0.00037913368,0.00078308594],"domain_scores_gemma":[0.9970167,0.00065165566,0.00079428474,0.0011857179,0.00013842869,0.00021315647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010061135,0.0007412707,0.0024855093,0.0002705533,0.00014005067,0.00024038788,0.00307778,0.0003650621,0.0000055088535],"category_scores_gemma":[0.00012351907,0.00055187725,0.0012239235,0.0010130408,0.000032840846,0.00007734278,0.001007759,0.0009959133,0.00029608735],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.4999183e-7,0.000012244752,4.001633e-8,0.089727685,0.00008757281,0.000026049152,0.00007391606,0.0000011125209,2.7534972e-9,0.013708617,0.077235356,0.81912696],"study_design_scores_gemma":[0.00007394945,0.00011564295,2.3293559e-7,0.12559693,0.00011314651,0.00018698667,0.0000016818369,0.022739287,4.0563002e-8,0.0006454587,0.8500408,0.00048584706],"about_ca_topic_score_codex":0.000030406956,"about_ca_topic_score_gemma":0.000008458904,"teacher_disagreement_score":0.8186411,"about_ca_system_score_codex":0.00010837313,"about_ca_system_score_gemma":0.00034638456,"threshold_uncertainty_score":0.9996933},"labels":[],"label_agreement":null},{"id":"W4322717314","doi":"10.48550/arxiv.2302.13702","title":"Pauli-based model of quantum computation with higher-dimensional systems","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação para a Ciência e a Tecnologia; HORIZON EUROPE Framework Programme; European Commission; UK Research and Innovation","keywords":"Quantum computer; Qubit; Pauli exclusion principle; Computation; Omega; Mathematics; Discrete mathematics; Quantum circuit; Monotone polygon; Quantum; Combinatorics; Topology (electrical circuits); Quantum mechanics; Physics; Quantum error correction; Algorithm","score_opus":0.08107144348787337,"score_gpt":0.19386250344799763,"score_spread":0.11279105996012426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322717314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2587709,0.00002512794,0.7398132,0.0001254541,0.0006041807,0.00020791472,0.000030471792,0.0003732596,0.00004949424],"genre_scores_gemma":[0.988376,0.000003682719,0.01114872,0.000039087085,0.000054484986,9.820045e-7,0.000037354068,0.000030547602,0.00030913684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797285,0.00014527037,0.00027707728,0.0010356717,0.00024034987,0.00032876685],"domain_scores_gemma":[0.99810976,0.00021446656,0.00044492848,0.00080680975,0.0002855367,0.00013851178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025483352,0.00034366178,0.00045454493,0.00035225332,0.00014324624,0.00008623168,0.0011330704,0.00021550592,0.0000012440274],"category_scores_gemma":[0.000007559579,0.00032596657,0.00016269453,0.0006599425,0.00011826807,0.00010801035,0.00090861664,0.0005110072,0.000017438015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027078748,0.0000667967,0.00014220898,0.0001703874,0.00006353853,0.00013109607,0.000056698187,0.954438,0.000024944242,0.0446531,0.00014462473,0.00008153669],"study_design_scores_gemma":[0.0005078118,0.00012084407,0.00036986914,0.00039090295,0.00004024406,0.0000031576262,0.000008834524,0.98070014,0.000029990695,0.01744891,0.000009143163,0.00037014706],"about_ca_topic_score_codex":0.00023803717,"about_ca_topic_score_gemma":0.000010432884,"teacher_disagreement_score":0.7296051,"about_ca_system_score_codex":0.000092961964,"about_ca_system_score_gemma":0.00043689218,"threshold_uncertainty_score":0.99991924},"labels":[],"label_agreement":null},{"id":"W4322743007","doi":"10.3390/math11051203","title":"Acceleration of Wheel Factoring Techniques","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"King Saud University","keywords":"Factoring; Integer factorization; Cryptosystem; Computer science; Factorization; Prime number; Polynomial; Prime (order theory); Set (abstract data type); Integer (computer science); Key (lock); Acceleration; Prime factor; Factorization of polynomials; Time complexity; Theoretical computer science; Algorithm; Public-key cryptography; Parallel computing; Discrete mathematics; Mathematics; Cryptography; Combinatorics; Encryption; Matrix polynomial; Computer security; Operating system","score_opus":0.026599847099710222,"score_gpt":0.26917884496875605,"score_spread":0.24257899786904583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322743007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19910999,0.000008263167,0.79893625,0.0002994412,0.00011923895,0.00008557505,9.700447e-7,0.0006377386,0.00080252776],"genre_scores_gemma":[0.52897877,0.000005918001,0.4707724,0.000024584939,0.00005960234,0.000005373406,0.0000012100361,0.000008807572,0.00014334307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943835,0.000008960369,0.00016654612,0.00010649313,0.0001617865,0.00011785323],"domain_scores_gemma":[0.99950963,0.000081405866,0.00007503533,0.00027838716,0.000034358276,0.00002118158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019027415,0.00006340371,0.00010456192,0.00009653397,0.00004802972,0.000048767582,0.0003541682,0.000027957174,0.0000023783007],"category_scores_gemma":[0.000035518748,0.00005216424,0.000034607896,0.00036401683,0.000011689447,0.00008075782,0.00017144694,0.000059932547,0.000019773799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013477899,0.0002583488,0.0003149891,0.00084071246,0.00005195554,0.000026755832,0.04692732,0.003743822,0.069566295,0.2707033,0.0023024715,0.6052627],"study_design_scores_gemma":[0.00004241493,0.000036345285,0.0003483926,0.000076010016,0.000001927525,0.0000059210115,0.000036082627,0.9022154,0.067091,0.028921846,0.0011255641,0.000099046985],"about_ca_topic_score_codex":0.0000022004347,"about_ca_topic_score_gemma":2.2530055e-7,"teacher_disagreement_score":0.89847165,"about_ca_system_score_codex":0.0000064576025,"about_ca_system_score_gemma":0.000015143265,"threshold_uncertainty_score":0.2127196},"labels":[],"label_agreement":null},{"id":"W4322759389","doi":"10.48550/arxiv.2302.14067","title":"Variational Quantum Eigensolvers in the Era of Distributed Quantum Computers","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Quantum computer; Computer science; Modular design; Qubit; Quantum; Distributed computing; Quantum algorithm; Computational science; Quantum network; Quantum information; Computer engineering; Theoretical computer science; Parallel computing; Physics; Quantum mechanics","score_opus":0.04973895304181422,"score_gpt":0.1965279095397718,"score_spread":0.1467889564979576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322759389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29252443,0.000024283418,0.7049196,0.00087898254,0.0010904252,0.00024991634,0.000094407646,0.00018506481,0.000032901433],"genre_scores_gemma":[0.99650294,0.00004516759,0.0030997363,0.00011563885,0.00009697588,0.000001102923,0.00009794742,0.00001798666,0.000022495266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748975,0.00038617436,0.00039572376,0.0010164635,0.00025479653,0.00045709743],"domain_scores_gemma":[0.9974021,0.0007234922,0.00040531904,0.0012320282,0.00014426307,0.00009282822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007299491,0.0003519891,0.00043740243,0.00029858534,0.00017770374,0.00012258916,0.003302874,0.00023909082,0.0000046242453],"category_scores_gemma":[0.0000612197,0.00031962318,0.00029420177,0.0014980978,0.0001554802,0.0001417893,0.0018115769,0.0012384193,0.000025638008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011371456,0.00009158848,0.0011064447,0.000046262612,0.000057495305,0.000236516,0.00072426896,0.7736609,0.0000048201327,0.22329655,0.00050489214,0.0002588911],"study_design_scores_gemma":[0.00036675876,0.000055511096,0.020005865,0.0001514001,0.000022130154,0.0000067346205,0.000106309475,0.89469093,0.0000056143917,0.084178664,0.000109272856,0.00030081815],"about_ca_topic_score_codex":0.00058014615,"about_ca_topic_score_gemma":0.00004345299,"teacher_disagreement_score":0.70397854,"about_ca_system_score_codex":0.00012141358,"about_ca_system_score_gemma":0.0002985345,"threshold_uncertainty_score":0.9999256},"labels":[],"label_agreement":null},{"id":"W4322766701","doi":"10.22331/q-2023-03-02-934","title":"Fast quantum circuit cutting with randomized measurements","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Lawrence Berkeley National Laboratory; Office of Science; Defense Advanced Research Projects Agency; Flatiron Health; National Energy Research Scientific Computing Center; Simons Foundation; U.S. Department of Energy","keywords":"Qubit; Quantum computer; Computation; Electronic circuit; Quantum circuit; Quantum; Mathematics; Overhead (engineering); Omega; Algorithm; Computer science; Topology (electrical circuits); Quantum mechanics; Combinatorics; Quantum error correction; Physics","score_opus":0.03189235801111866,"score_gpt":0.24831110230170816,"score_spread":0.2164187442905895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322766701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2859637,0.00018948031,0.7042903,0.0022456418,0.0015154391,0.0007336115,0.000004734996,0.0025363162,0.0025207824],"genre_scores_gemma":[0.99174494,0.00001379892,0.007283534,0.00032767013,0.00023416102,0.000051828803,0.000009180326,0.000047168814,0.0002877032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670166,0.0003312135,0.00047344997,0.00076169637,0.00090401794,0.00082795613],"domain_scores_gemma":[0.9981572,0.0004577219,0.00023035346,0.0008135164,0.00014592949,0.00019527716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019337513,0.00034572187,0.00062854687,0.0003260983,0.0004328888,0.0003230916,0.0011825294,0.000081316946,0.000012140486],"category_scores_gemma":[0.00020995481,0.00025162703,0.00020282286,0.001478793,0.00014004903,0.00025718161,0.00033240992,0.00034295782,0.0003681635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040369155,0.0005612406,0.003012809,0.0004186823,0.0011414954,0.0011151141,0.016715745,0.053822238,0.005270314,0.6524064,0.0101591125,0.2513399],"study_design_scores_gemma":[0.020119013,0.00012605388,0.00049343996,0.00015029838,0.000021479957,0.000061574734,0.0000662093,0.9591303,0.000374438,0.018214645,0.0008104397,0.00043214162],"about_ca_topic_score_codex":0.000059729846,"about_ca_topic_score_gemma":0.0000033385493,"teacher_disagreement_score":0.905308,"about_ca_system_score_codex":0.00003739789,"about_ca_system_score_gemma":0.00012422877,"threshold_uncertainty_score":0.9999936},"labels":[],"label_agreement":null},{"id":"W4322810867","doi":"10.48550/arxiv.2302.14811","title":"qSWIFT: High-order randomized compiler for Hamiltonian simulation","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Canadian Institute for Advanced Research; University of Toronto","funders":"Japan Society for the Promotion of Science","keywords":"Hamiltonian (control theory); Computer science; Quantum; Inverse; Lattice (music); Qubit; Algorithm; Upper and lower bounds; Applied mathematics; Mathematics; Mathematical optimization; Quantum mechanics; Physics; Mathematical analysis","score_opus":0.0625355911515645,"score_gpt":0.2116122411340157,"score_spread":0.14907664998245118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322810867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07219077,0.000026594542,0.9234262,0.00047324607,0.001893636,0.0010227886,0.000038653467,0.00081036164,0.000117722935],"genre_scores_gemma":[0.96860266,0.000028940936,0.02908985,0.00014922592,0.00026675107,0.0000055223322,0.000070607646,0.000044259446,0.0017422131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974573,0.00027241424,0.00034008166,0.0013274127,0.00012874707,0.00047401522],"domain_scores_gemma":[0.996722,0.001321338,0.0003583131,0.0011544677,0.00029322776,0.00015068662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068682287,0.000413172,0.00077809184,0.00036837146,0.00031561797,0.00021479116,0.0016328098,0.00032005296,0.00000892611],"category_scores_gemma":[0.0001554583,0.0004199135,0.00047757084,0.00067333004,0.00014113849,0.00015610416,0.0016894889,0.0005521359,0.000073208816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004787199,0.000037705493,0.00002230453,0.00006474026,0.000121877856,0.000041204246,0.00019721313,0.93667305,0.0000030403767,0.061038118,0.00016668871,0.0011553657],"study_design_scores_gemma":[0.015529196,0.00003186804,0.00022946583,0.00009037456,0.000069168986,8.6902514e-7,0.0000073471206,0.8610729,0.000011089786,0.12199413,0.0005408074,0.00042277446],"about_ca_topic_score_codex":0.000185203,"about_ca_topic_score_gemma":0.00003007784,"teacher_disagreement_score":0.89641184,"about_ca_system_score_codex":0.00009498075,"about_ca_system_score_gemma":0.00017311939,"threshold_uncertainty_score":0.9998253},"labels":[],"label_agreement":null},{"id":"W4323044453","doi":"10.3390/s23052753","title":"Accurate Image Multi-Class Classification Neural Network Model with Quantum Entanglement Approach","year":2023,"lang":"en","type":"article","venue":"Sensors","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Commonwealth Scientific and Industrial Research Organisation","keywords":"MNIST database; Qubit; Computer science; Artificial neural network; Quantum; Quantum computer; Quantum gate; Benchmark (surveying); Quantum entanglement; Algorithm; Quantum circuit; Contextual image classification; Artificial intelligence; Computer engineering; Image (mathematics); Pattern recognition (psychology); Quantum error correction; Physics; Quantum mechanics","score_opus":0.03867953353123705,"score_gpt":0.266905229382246,"score_spread":0.22822569585100894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323044453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37832576,0.000016824628,0.6182574,0.0015556241,0.00027735555,0.00028816902,0.000005711156,0.00085253204,0.00042060317],"genre_scores_gemma":[0.8187478,0.000008221178,0.18029206,0.00020345428,0.00017143141,0.00002183528,0.000027701892,0.000030131658,0.0004973844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980666,0.00010868608,0.00024699132,0.0006197346,0.00036079038,0.0005972115],"domain_scores_gemma":[0.99898547,0.00006640144,0.0001323316,0.00061938824,0.00007138602,0.0001250299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031470845,0.00023197186,0.00019094265,0.00011019836,0.00028926035,0.00021030854,0.00063334906,0.000056029112,0.0000013481524],"category_scores_gemma":[0.000012941463,0.00017789008,0.00007165223,0.0009284251,0.00006673961,0.00015787891,0.00023783963,0.0002589267,0.000067072695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007387278,0.000044339096,0.00005891832,0.000012647978,0.000015388421,0.000022367301,0.00067648373,0.9893479,0.00027157547,0.0042744665,0.0010638683,0.0042046993],"study_design_scores_gemma":[0.00038167567,0.000059367514,0.0016232479,0.000015533553,0.0000065901954,0.000019203711,0.00010240031,0.9967128,0.000052230163,0.0004180722,0.00035708887,0.00025178018],"about_ca_topic_score_codex":0.00001104614,"about_ca_topic_score_gemma":0.0000028720137,"teacher_disagreement_score":0.44042203,"about_ca_system_score_codex":0.00003458312,"about_ca_system_score_gemma":0.00004197281,"threshold_uncertainty_score":0.7254147},"labels":[],"label_agreement":null},{"id":"W4323804483","doi":"10.1038/s41598-023-30710-z","title":"Quantum computing reduces systemic risk in financial networks","year":2023,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Systemic risk; Computer science; Cascading failure; Scalability; Context (archaeology); Convergence (economics); Quantum; Cascade; Financial institution; Mathematical optimization; Algorithm; Finance; Financial crisis; Mathematics; Business; Economics","score_opus":0.009807339161982436,"score_gpt":0.23465017466357993,"score_spread":0.2248428355015975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323804483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88994855,0.00024524707,0.09013127,0.00014280103,0.018584866,0.00021201464,6.5365305e-7,0.000641353,0.00009322683],"genre_scores_gemma":[0.99652797,0.000008020194,0.0029285282,0.000022320353,0.00027471274,0.000005942365,0.0000095583155,0.0000132316045,0.00020968998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996536,0.00018060028,0.0007284474,0.0012472989,0.00056230143,0.0007453218],"domain_scores_gemma":[0.99810207,0.00015866222,0.0004417466,0.0010763293,0.00009150508,0.00012971563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044071996,0.00020185516,0.00028907866,0.00052497815,0.0006685159,0.0007155464,0.00072680775,0.0000975743,0.0000023361458],"category_scores_gemma":[0.00035247515,0.00018077235,0.000117325224,0.0035632171,0.00012969742,0.00020620572,0.00059724617,0.00040627221,0.00004482878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034773007,0.000072355106,0.011357527,0.00004495748,0.000011484288,0.0037589879,0.004073109,0.81353563,0.0012292733,0.0019235634,0.017755745,0.1462339],"study_design_scores_gemma":[0.000088506335,0.000019408277,0.008371896,0.00017738345,0.0000024010003,0.00044708428,0.000033916225,0.97457004,0.0002309362,0.014718673,0.0011122156,0.00022752293],"about_ca_topic_score_codex":0.000062629486,"about_ca_topic_score_gemma":0.000013852996,"teacher_disagreement_score":0.16103444,"about_ca_system_score_codex":0.000047865753,"about_ca_system_score_gemma":0.00021489369,"threshold_uncertainty_score":0.73716825},"labels":[],"label_agreement":null},{"id":"W4327743729","doi":"10.1038/s41598-023-30258-y","title":"Practical overview of image classification with tensor-network quantum circuits","year":2023,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Computer science; Electronic circuit; Quantum computer; Qubit; Computer engineering; Quantum circuit; Python (programming language); Quantum; Computer architecture; Theoretical computer science; Tensor (intrinsic definition); Computational science; Artificial intelligence; Topology (electrical circuits); Quantum network; Electrical engineering; Mathematics; Physics; Programming language; Quantum mechanics","score_opus":0.05542493055858945,"score_gpt":0.3120777661070694,"score_spread":0.25665283554847995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327743729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4539458,0.00030113984,0.52357435,0.0054461546,0.012143562,0.0008126617,0.0000035357996,0.0014200478,0.0023527716],"genre_scores_gemma":[0.9463872,0.000012420508,0.052684005,0.000053273812,0.00016288953,0.000015931542,0.000022870576,0.000021558935,0.0006398783],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713457,0.00010702225,0.00051245943,0.0009295838,0.0008494599,0.00046689284],"domain_scores_gemma":[0.9974414,0.00015561451,0.0004989682,0.0014744818,0.0002994562,0.00013004112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002331402,0.00015703928,0.00024345782,0.00019519334,0.00034618276,0.00038728226,0.00039300302,0.000056377194,0.000010779984],"category_scores_gemma":[0.00020612794,0.00011807455,0.00008697536,0.0027654143,0.00026348184,0.00033627637,0.00023838777,0.0001878832,0.000058667134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028039718,0.0009316986,0.017233834,0.0009049171,0.0002666675,0.0103450585,0.0045680674,0.030206451,0.064242475,0.23247896,0.45837104,0.1804228],"study_design_scores_gemma":[0.00017922612,0.00014597873,0.032047693,0.0002917501,0.000023004359,0.0014643472,0.000064920554,0.8849662,0.0021522345,0.051693738,0.02653812,0.00043280437],"about_ca_topic_score_codex":0.0000080333875,"about_ca_topic_score_gemma":0.0000027950305,"teacher_disagreement_score":0.85475975,"about_ca_system_score_codex":0.000019864263,"about_ca_system_score_gemma":0.00029207257,"threshold_uncertainty_score":0.48149407},"labels":[],"label_agreement":null},{"id":"W4327990572","doi":"10.48550/arxiv.2303.09788","title":"Higher-order quantum transformations of Hamiltonian dynamics","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Ministry of Colleges and Universities; Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology; University of Tokyo; Government of Canada","keywords":"Hamiltonian (control theory); Randomness; Adiabatic quantum computation; Quantum; Hamiltonian path problem; Bounded function; Quantum algorithm; Mathematics; Pauli exclusion principle; Computer science; Quantum computer; Physics; Discrete mathematics; Quantum mechanics; Hamiltonian path; Mathematical optimization; Mathematical analysis","score_opus":0.046445268599223405,"score_gpt":0.19243700896309415,"score_spread":0.14599174036387075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327990572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14475702,0.000029214678,0.85159725,0.00073004287,0.0012808455,0.00020574279,0.00007803034,0.00052570755,0.0007961264],"genre_scores_gemma":[0.99213475,0.000085605956,0.0064655663,0.00004241083,0.0000593848,6.751491e-7,0.000043104224,0.000026299947,0.0011422001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831927,0.00010521188,0.0003082157,0.00076156727,0.00013298725,0.0003727539],"domain_scores_gemma":[0.99814457,0.00013353545,0.0002629263,0.0011337718,0.00019289972,0.00013231688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002181935,0.0003066143,0.00038683982,0.0004024175,0.00018144895,0.000080667276,0.0019661842,0.00026576064,0.000009886337],"category_scores_gemma":[0.000015062817,0.00033810773,0.0002617827,0.0011937642,0.00013239958,0.00018405817,0.0011639285,0.00067930744,0.000052091586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043203813,0.00005384469,0.00019390842,0.0001109856,0.00006793461,0.000066987755,0.00035598647,0.71350694,0.000004970137,0.28417453,0.00013804792,0.0013215411],"study_design_scores_gemma":[0.0002350319,0.000044858545,0.0021270195,0.00011797597,0.00003265789,0.0000028873376,0.000032040167,0.911485,0.000014540132,0.08532072,0.0002679444,0.00031932147],"about_ca_topic_score_codex":0.0002720631,"about_ca_topic_score_gemma":0.00011326824,"teacher_disagreement_score":0.8473777,"about_ca_system_score_codex":0.00011646405,"about_ca_system_score_gemma":0.00022681306,"threshold_uncertainty_score":0.9999071},"labels":[],"label_agreement":null},{"id":"W4327993130","doi":"10.48550/arxiv.2303.09945","title":"Estimating Coherent Contributions to the Error Profile Using Cycle Error Reconstruction","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Algorithm; Fidelity; Pauli exclusion principle; Benchmarking; Generalization; Protocol (science); Scalability; Error detection and correction; Feature (linguistics); Mathematics; Physics; Telecommunications","score_opus":0.07385723530215739,"score_gpt":0.24251223997356947,"score_spread":0.1686550046714121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327993130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36225453,0.00000998164,0.63397837,0.00075602246,0.0020524845,0.00042829677,0.000064452644,0.0003965848,0.000059255763],"genre_scores_gemma":[0.9363073,0.0000017595863,0.06291608,0.00007867765,0.00035241098,0.00000345601,0.00001432234,0.000023434912,0.00030252594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979232,0.00020072483,0.00025130593,0.0009967438,0.00012318185,0.00050486106],"domain_scores_gemma":[0.99812245,0.00015610782,0.0002802724,0.0010431446,0.00022809274,0.00016994457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046620378,0.00028977642,0.00028771328,0.0002221595,0.0008088069,0.00022871987,0.0015001422,0.00017301968,0.000011441345],"category_scores_gemma":[0.00013378603,0.00026070842,0.00019318597,0.0009068834,0.00008860285,0.00014244513,0.0026415358,0.0007435343,0.00012605492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004429377,0.000020754736,0.0001479656,0.000024696305,0.000043420245,0.000044562337,0.00027207262,0.9902038,0.000033353717,0.005266764,0.00020019877,0.003737985],"study_design_scores_gemma":[0.00017138373,0.000031610525,0.00046250317,0.00024253465,0.000040088722,0.000030021482,0.00007054257,0.9833473,0.000053511118,0.015129728,0.00010953894,0.00031121433],"about_ca_topic_score_codex":0.00037883737,"about_ca_topic_score_gemma":0.00006832301,"teacher_disagreement_score":0.5740528,"about_ca_system_score_codex":0.00028179833,"about_ca_system_score_gemma":0.00027582282,"threshold_uncertainty_score":0.9999845},"labels":[],"label_agreement":null},{"id":"W4353055437","doi":"10.1038/s41586-023-05782-6","title":"Real-time quantum error correction beyond break-even","year":2023,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":396,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut quantique; Université de Sherbrooke","funders":"Army Research Office","keywords":"Quantum error correction; Coherence (philosophical gambling strategy); Computer science; Quantum; Quantum decoherence; Quantum capacity; Quantum information; Qubit; Error detection and correction; Quantum network; Quantum computer; Quantum technology; Quantum mechanics; Open quantum system; Statistical physics; Physics; Algorithm","score_opus":0.006794550772480391,"score_gpt":0.25266048128392826,"score_spread":0.24586593051144787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353055437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9202748,0.00043021695,0.01984656,0.020289231,0.020162158,0.00057604536,0.000034526314,0.0074377996,0.0109486645],"genre_scores_gemma":[0.96232754,0.00007036012,0.019730227,0.0016674318,0.0015629134,0.000018222347,0.00008251742,0.00007264505,0.014468156],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998449,0.00007747968,0.00016721248,0.000503923,0.00039142973,0.00041090552],"domain_scores_gemma":[0.9990273,0.00016111016,0.00008126771,0.0005412709,0.00008117521,0.0001078923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003186539,0.00018466827,0.00018459914,0.00021402698,0.00025100913,0.00013579345,0.0007886451,0.0006366683,0.000019618621],"category_scores_gemma":[0.0000742501,0.00015820116,0.00010374402,0.0013892086,0.000029721397,0.000167219,0.00030964456,0.0015793762,0.0005966121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027735827,0.00010867376,0.00022064883,0.000046947483,0.00006146384,0.00027008925,0.002074412,0.010498479,0.011475306,0.017173411,0.7417069,0.2163359],"study_design_scores_gemma":[0.00018445677,0.00010353136,0.006670254,0.00003303575,0.0000048596366,0.0000817125,0.000017127917,0.9642078,0.000656246,0.0068799844,0.020918911,0.00024206046],"about_ca_topic_score_codex":0.00003335352,"about_ca_topic_score_gemma":0.000007485118,"teacher_disagreement_score":0.95370936,"about_ca_system_score_codex":0.000033073717,"about_ca_system_score_gemma":0.00006933415,"threshold_uncertainty_score":0.7668441},"labels":[],"label_agreement":null},{"id":"W4353080380","doi":"10.54097/hset.v38i.5831","title":"Comparison of Quantum and Classical Algorithm in Searching a Number in a Database Case","year":2023,"lang":"en","type":"article","venue":"Highlights in Science Engineering and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum sort; Quantum algorithm; Quantum computer; Quantum phase estimation algorithm; Computer science; Speedup; Algorithm; Quantum; Theoretical computer science; Quantum network; Parallel computing; Quantum mechanics; Physics","score_opus":0.013928595785229902,"score_gpt":0.2935370483549417,"score_spread":0.2796084525697118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353080380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96342474,0.0000977566,0.034805078,0.001266741,0.00013568847,0.000085567954,0.0000022351069,0.00017343777,0.000008727296],"genre_scores_gemma":[0.9493595,0.000031508196,0.0505797,0.000003503136,0.000009865038,0.000007937262,3.8109843e-7,0.000005199978,0.0000024151218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985396,0.000022962984,0.00028895488,0.0004950071,0.00019301531,0.0004604192],"domain_scores_gemma":[0.99939835,0.00018380022,0.00003801344,0.00029434392,0.000019874093,0.000065608074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008026162,0.00012420378,0.0002674956,0.001730722,0.000070280956,0.00004767513,0.00045134322,0.00008509523,2.1305539e-7],"category_scores_gemma":[0.00013675616,0.0001096862,0.00000967614,0.0046388414,0.00032889156,0.00019506014,0.000672868,0.00042112177,0.00000360591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066643556,0.0003336793,0.042282242,0.00018379715,0.00000770335,0.008750173,0.00851045,0.04673095,0.020894812,0.68819475,0.000032074302,0.18407269],"study_design_scores_gemma":[0.00026390894,0.000043080374,0.004089735,0.00012745366,4.91869e-7,0.0004686623,0.0001234453,0.99129933,0.0018630555,0.0014526113,0.00014209785,0.00012614358],"about_ca_topic_score_codex":0.00010552334,"about_ca_topic_score_gemma":0.000050694893,"teacher_disagreement_score":0.94456834,"about_ca_system_score_codex":0.00003010499,"about_ca_system_score_gemma":0.00005192464,"threshold_uncertainty_score":0.44728735},"labels":[],"label_agreement":null},{"id":"W4353115879","doi":"10.4204/eptcs.397.5","title":"Normalizing Resistor Networks","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Rewriting; Resistor; Electronic circuit; Computer science; Quantum; Topology (electrical circuits); Physics; Electrical engineering; Quantum mechanics; Voltage; Engineering","score_opus":0.004568360625917888,"score_gpt":0.2249425239763987,"score_spread":0.2203741633504808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353115879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1602761,0.00014223554,0.83313245,0.002063607,0.0007310395,0.0002273717,2.2444965e-7,0.0011559008,0.002271102],"genre_scores_gemma":[0.9717446,0.000026430398,0.027498098,0.00040904447,0.00027645633,0.0000148918825,4.7197523e-7,0.000015704958,0.000014330597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958453,0.00003062846,0.0003651441,0.0010914793,0.00074959674,0.001917844],"domain_scores_gemma":[0.99896276,0.00018391765,0.00008989118,0.00039101028,0.00014580217,0.00022659065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003254657,0.00025578268,0.00025759017,0.0006780389,0.00055530475,0.0006086913,0.0034348047,0.00008450744,0.0000053196545],"category_scores_gemma":[0.0001451403,0.00022526814,0.00007627218,0.006429981,0.0009826733,0.00067991426,0.0016548953,0.00073921453,0.000047662048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049444666,0.000021897757,0.0001558819,0.000007802993,0.0000025029935,0.000014637557,0.00044155392,0.0052992417,0.00019052053,0.95954126,0.00017963673,0.034140117],"study_design_scores_gemma":[0.00018290043,0.00017492141,0.0014316334,0.00004978088,0.00000131042,0.000054067823,0.000006408307,0.87041074,0.00048809938,0.12645091,0.00048574182,0.00026347485],"about_ca_topic_score_codex":0.0000037414186,"about_ca_topic_score_gemma":0.0000010562561,"teacher_disagreement_score":0.86511153,"about_ca_system_score_codex":0.00023545617,"about_ca_system_score_gemma":0.0002361686,"threshold_uncertainty_score":0.91861683},"labels":[],"label_agreement":null},{"id":"W4360886261","doi":"10.48550/arxiv.2303.13012","title":"Exponential quantum speedup in simulating coupled classical oscillators","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Canadian Institute for Advanced Research","funders":"Office of Science; U.S. Department of Energy","keywords":"Speedup; Quantum algorithm; Quantum computer; Quantum; Sublinear function; Quantum circuit; Oracle; Computer science; Algorithm; Applied mathematics; Mathematics; Quantum mechanics; Physics; Discrete mathematics; Quantum error correction; Parallel computing","score_opus":0.06895934947972257,"score_gpt":0.20984304791095168,"score_spread":0.1408836984312291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360886261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6981415,0.000017504473,0.29913107,0.0002383268,0.0016156728,0.00020966388,0.0000059782337,0.00054931984,0.00009093683],"genre_scores_gemma":[0.99705786,0.000021632046,0.0021172466,0.000048470112,0.00026855903,6.0988054e-7,0.000012192978,0.000040164996,0.00043327926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968099,0.00021429689,0.00039698323,0.0016641665,0.0002154584,0.00069920917],"domain_scores_gemma":[0.99784356,0.00038419102,0.00028729922,0.0011724106,0.000085856635,0.00022668611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004822331,0.00045421778,0.0005497929,0.00060110586,0.00020695469,0.00022404721,0.0020618602,0.0003966359,0.000010888647],"category_scores_gemma":[0.00010050841,0.0005112082,0.0003083759,0.0012469303,0.00012668516,0.00018171119,0.0038614671,0.0013412338,0.00012381452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014639673,0.000066611494,0.0025554048,0.00004687757,0.000035006327,0.0008912623,0.00032723375,0.96751416,0.00004038306,0.027881024,0.00007758318,0.0005498141],"study_design_scores_gemma":[0.0005536423,0.000047224945,0.0042141876,0.00019312836,0.00001657357,0.0000048184734,0.000046902165,0.960713,0.000014614852,0.033552658,0.00010480668,0.00053840666],"about_ca_topic_score_codex":0.00037756457,"about_ca_topic_score_gemma":0.000092473536,"teacher_disagreement_score":0.2989163,"about_ca_system_score_codex":0.00021260214,"about_ca_system_score_gemma":0.00024776722,"threshold_uncertainty_score":0.9997339},"labels":[],"label_agreement":null},{"id":"W4361212435","doi":"10.1103/physrevresearch.5.013211","title":"Compositional optimization of quantum circuits for quantum kernels of support vector machines","year":2023,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum; Quantum gate; Quantum circuit; Quantum algorithm; Computer science; Quantum computer; Electronic circuit; Support vector machine; Algorithm; Metric (unit); Bayesian optimization; Mathematics; Theoretical computer science; Quantum error correction; Artificial intelligence; Physics; Quantum mechanics; Engineering","score_opus":0.07617844251729129,"score_gpt":0.4095500859228594,"score_spread":0.33337164340556813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361212435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09741029,0.004117048,0.8894397,0.0056040836,0.00041506163,0.0021999683,0.00019397128,0.0002763488,0.000343541],"genre_scores_gemma":[0.9913908,0.001158168,0.006802477,0.000116093426,0.00026475987,0.000107273314,0.000084780586,0.00002730156,0.000048302085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757195,0.0002819847,0.0004126085,0.00039027887,0.00092687673,0.00041629266],"domain_scores_gemma":[0.99735254,0.0013166389,0.00014771546,0.00046346648,0.0006120753,0.00010759238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015396794,0.00013440353,0.00047712182,0.00018890394,0.00013211025,0.000030705723,0.0009008869,0.000028294538,0.000014205753],"category_scores_gemma":[0.00045715933,0.00010821196,0.00023066896,0.0016281552,0.00014480716,0.00011568903,0.0003580752,0.00023331365,0.000028387587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003516226,0.0011375704,0.00014767068,0.0129721295,0.0001360979,0.000017824204,0.0008138957,0.064729385,0.025594454,0.7601744,0.014056502,0.12018494],"study_design_scores_gemma":[0.00018026815,0.0004080032,0.0006026658,0.00083697174,0.000007939939,0.000003704394,0.000002264254,0.9754639,0.00146182,0.020185703,0.00073979876,0.000106910076],"about_ca_topic_score_codex":0.00001556049,"about_ca_topic_score_gemma":2.0757045e-7,"teacher_disagreement_score":0.9107346,"about_ca_system_score_codex":0.000018947527,"about_ca_system_score_gemma":0.00016666079,"threshold_uncertainty_score":0.4412756},"labels":[],"label_agreement":null},{"id":"W4361230790","doi":"10.48550/arxiv.2303.15626","title":"A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Compute Canada; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research","keywords":"Generative grammar; Computer science; Quantum; Qubit; Generative model; Artificial intelligence; Theoretical computer science; Machine learning; Quantum mechanics","score_opus":0.1264458603962412,"score_gpt":0.2674586358171172,"score_spread":0.141012775420876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361230790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08703076,0.00005186027,0.90764844,0.001753412,0.0016732111,0.0006994435,0.00005481131,0.0009549452,0.00013312839],"genre_scores_gemma":[0.72313416,0.00007118955,0.27582633,0.00023949581,0.00047623774,0.000007813439,0.000032463748,0.00006659091,0.0001457308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954174,0.0004007112,0.0005472026,0.0023588801,0.0002636164,0.0010121654],"domain_scores_gemma":[0.9951149,0.0021536993,0.00061359484,0.0014329714,0.00029458688,0.00039020434],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0007614566,0.00070601277,0.00078117044,0.00037429112,0.00075362145,0.0005099625,0.0018078022,0.0007465297,0.0000022658812],"category_scores_gemma":[0.0005392244,0.00075348455,0.0005705917,0.00085598143,0.00021725385,0.00058423413,0.00284401,0.0024930616,0.000034023622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025074276,0.000069600785,0.000025526351,0.00007145506,0.00008371607,0.00035810203,0.00036087382,0.511072,0.00003065974,0.4866964,0.00017075571,0.0010358987],"study_design_scores_gemma":[0.00026068522,0.00009052905,0.000015311938,0.0002832498,0.000044236906,0.000011484071,0.00017779584,0.5913675,0.000045523448,0.40713587,0.000056662408,0.0005111318],"about_ca_topic_score_codex":0.000025794969,"about_ca_topic_score_gemma":0.000015086719,"teacher_disagreement_score":0.6361034,"about_ca_system_score_codex":0.00022571976,"about_ca_system_score_gemma":0.00073539803,"threshold_uncertainty_score":0.99980825},"labels":[],"label_agreement":null},{"id":"W4361787487","doi":"10.36227/techrxiv.19742422","title":"Reducing the CNOT count for Clifford+T circuits on NISQ architectures","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Dalhousie University; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Controlled NOT gate; Computer science; Qubit; Quantum computer; Quantum circuit; Quantum gate; Topology (electrical circuits); Quantum error correction; Mathematics; Quantum; Physics; Quantum mechanics","score_opus":0.02561943034344787,"score_gpt":0.2750424976970341,"score_spread":0.24942306735358621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361787487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08338784,0.00046409247,0.8820809,0.01628493,0.0071295123,0.002192505,0.00011203873,0.0010483784,0.007299805],"genre_scores_gemma":[0.8974626,0.00003102322,0.08937615,0.00787582,0.0022847077,0.0007845992,0.00007094238,0.00012380906,0.0019903479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965818,0.00021060226,0.00046931056,0.0013407108,0.0007368692,0.0006607178],"domain_scores_gemma":[0.9961851,0.0011772184,0.00031204565,0.0021295627,0.00008192853,0.00011409284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010731107,0.00049842516,0.00043896938,0.0002109794,0.0010358853,0.00061052054,0.0040402305,0.00016016737,0.000054992674],"category_scores_gemma":[0.0001427984,0.00032274862,0.00043750438,0.0002686531,0.00008386122,0.000023385264,0.0033534828,0.001785629,0.000008613969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094253,0.00007983444,0.000007049934,0.00010058254,0.000078699966,0.000011213543,0.002098162,0.6005717,0.00003152917,0.03176643,0.0059127044,0.35933268],"study_design_scores_gemma":[0.00027187465,0.0003159333,0.0003803569,0.000121343706,0.000019672607,0.00004068936,0.000043303142,0.8746764,0.00027822753,0.092693694,0.030561939,0.0005965894],"about_ca_topic_score_codex":0.00017081517,"about_ca_topic_score_gemma":0.000013623241,"teacher_disagreement_score":0.81407475,"about_ca_system_score_codex":0.00012249856,"about_ca_system_score_gemma":0.00033595497,"threshold_uncertainty_score":0.99992245},"labels":[],"label_agreement":null},{"id":"W4362552012","doi":"10.21203/rs.3.rs-2671289/v1","title":"Quantum information phases in space-time: measurement-inducedentanglement and teleportation on a noisy quantum processor","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Kavli Institute for Theoretical Physics, University of California, Santa Barbara; Office of Science; U.S. Department of Energy; Curtin University of Technology; Canadian Institute for Advanced Research; Gordon and Betty Moore Foundation; Basic Energy Sciences; Alfred P. Sloan Foundation; University of California, Santa Barbara; David and Lucile Packard Foundation; Stanford Research Computing Center, Stanford University; National Science Foundation","keywords":"Superdense coding; Quantum entanglement; Quantum teleportation; Teleportation; Quantum channel; Computer science; Physics; Quantum information; Quantum mechanics; Quantum information processing; Quantum network; Quantum","score_opus":0.07644449247091158,"score_gpt":0.3571923958803683,"score_spread":0.2807479034094567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362552012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9477014,0.00074905844,0.03270066,0.011102112,0.0012651344,0.004833764,0.000118267846,0.0010271408,0.00050247915],"genre_scores_gemma":[0.9969596,0.0001801542,0.0019726122,0.00006601802,0.00020257785,0.00039061691,0.00012309513,0.000039845214,0.00006542609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935633,0.00047793798,0.00075499294,0.0009555913,0.0033119486,0.0009362424],"domain_scores_gemma":[0.99730194,0.00036303757,0.00032623266,0.00088657497,0.0008866489,0.00023555756],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0046752873,0.00041668498,0.00045004222,0.0017603532,0.00036574254,0.0010578668,0.0010654451,0.00026857218,0.000009264845],"category_scores_gemma":[0.0011011659,0.0003793639,0.000103836144,0.0013357238,0.00008782935,0.00049989496,0.0015540539,0.0017129257,0.00014336653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066179264,0.003368648,0.006470778,0.01528845,0.0005655473,0.0013523747,0.049087293,0.12750104,0.0042959573,0.078298055,0.028076112,0.6850339],"study_design_scores_gemma":[0.00097154884,0.00081857835,0.010495381,0.0032869142,0.0000075876987,0.000012405349,0.000537396,0.95809567,0.0010049003,0.022515928,0.0016564584,0.0005972334],"about_ca_topic_score_codex":0.0005516401,"about_ca_topic_score_gemma":0.000089898014,"teacher_disagreement_score":0.8305946,"about_ca_system_score_codex":0.00048353118,"about_ca_system_score_gemma":0.0007885014,"threshold_uncertainty_score":0.99997914},"labels":[],"label_agreement":null},{"id":"W4362582230","doi":"10.1038/s41534-023-00697-6","title":"Synthesizing efficient circuits for Hamiltonian simulation","year":2023,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Science; Advanced Research Projects Agency - Energy; Nippon Telegraph and Telephone; Government of Canada; Innovation, Science and Economic Development Canada; Western Canada Research Grid; Compute Canada; Google; U.S. Department of Energy","keywords":"Hamiltonian (control theory); Electronic circuit; Computer science; Theoretical computer science; Mathematics; Engineering; Electrical engineering; Mathematical optimization","score_opus":0.018389591799297833,"score_gpt":0.2591346933476046,"score_spread":0.24074510154830675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362582230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16289674,0.000009540198,0.8341768,0.0005729171,0.0006405856,0.00032306474,0.0000069488506,0.0010988743,0.00027456434],"genre_scores_gemma":[0.9946863,0.000002570975,0.0048913658,0.00023761645,0.00009549581,0.000029041334,0.000036148824,0.000008377604,0.000013062132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875104,0.000029178256,0.00036428336,0.00017936496,0.0003161223,0.00035998685],"domain_scores_gemma":[0.9989127,0.0003802201,0.00016836924,0.00033215812,0.00013769028,0.000068884896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060641277,0.00013780645,0.00013112824,0.0003481002,0.00036592688,0.0002881477,0.00041968634,0.000071746086,0.0000013293809],"category_scores_gemma":[0.00022228879,0.00012813964,0.000085677675,0.0007389575,0.000016768212,0.00070366974,0.000109104454,0.00009809035,0.0002584328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028503136,0.000007532214,0.000014730328,0.000036763628,0.000004915415,7.351717e-7,0.0018526721,0.75210047,0.00007972039,0.018094314,0.0002479234,0.22755735],"study_design_scores_gemma":[0.00023624698,0.0000539041,0.0024932132,0.000040085826,0.00000309436,0.000005235671,0.00005166623,0.98427445,0.0001628895,0.0016682097,0.010842026,0.00016895981],"about_ca_topic_score_codex":0.0000052932423,"about_ca_topic_score_gemma":5.284682e-7,"teacher_disagreement_score":0.8317896,"about_ca_system_score_codex":0.000044029606,"about_ca_system_score_gemma":0.00005236335,"threshold_uncertainty_score":0.52253824},"labels":[],"label_agreement":null},{"id":"W4362600773","doi":"10.1103/physrevresearch.5.l022003","title":"Simulating time evolution on distributed quantum computers","year":2023,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Computer science; Quantum computer; Quantum; Distributed computing; Physics; Quantum mechanics","score_opus":0.056435806224363665,"score_gpt":0.39484512498759167,"score_spread":0.338409318763228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362600773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44588643,0.008082582,0.4864678,0.04641831,0.0012677067,0.0037891266,0.00008788016,0.0051766373,0.0028235242],"genre_scores_gemma":[0.9976168,0.00030454746,0.0010983009,0.00031003644,0.00047160566,0.000033639797,0.00004230867,0.000023815654,0.00009893019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653417,0.00062952924,0.00025052225,0.0006154752,0.0011959316,0.0007743625],"domain_scores_gemma":[0.996845,0.0019440193,0.00006092196,0.00074949657,0.00020256822,0.00019797315],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017320538,0.00017615675,0.0003504748,0.00018490423,0.00041270716,0.00014317199,0.0011607199,0.000029093602,0.000006080745],"category_scores_gemma":[0.0007440197,0.00013787154,0.00017087041,0.0033395593,0.00009364723,0.00012687602,0.0008194465,0.0006878044,0.0030325286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019267898,0.00070419547,0.000066445245,0.0019396322,0.000078945726,0.00019701685,0.0005088013,0.08440159,0.0036045662,0.30530107,0.09372512,0.50945336],"study_design_scores_gemma":[0.0001071881,0.00019654402,0.0008720656,0.0013067889,0.0000025237175,0.0000025548823,0.0000017296967,0.968907,0.000050653456,0.023175234,0.005226781,0.00015093753],"about_ca_topic_score_codex":0.000014120913,"about_ca_topic_score_gemma":1.3996053e-7,"teacher_disagreement_score":0.8845054,"about_ca_system_score_codex":0.00010149935,"about_ca_system_score_gemma":0.000081454,"threshold_uncertainty_score":0.9977437},"labels":[],"label_agreement":null},{"id":"W4362647182","doi":"10.1109/cyberc55534.2022.00012","title":"Analysis of Zero-Key Authentication and Zero-Knowledge Proof","year":2022,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"","keywords":"Zero-knowledge proof; Computer science; Computer security; Public key infrastructure; Cryptography; Public-key cryptography; NIST; Authentication (law); Key (lock); Password; Key exchange; Access control; Theoretical computer science; Encryption","score_opus":0.010353838714488544,"score_gpt":0.2429269780794256,"score_spread":0.23257313936493704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362647182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30499932,0.00016359298,0.69328344,0.00040337365,0.00010365205,0.00008205936,0.0000035554015,0.00006948127,0.0008915428],"genre_scores_gemma":[0.98180115,0.0000012625794,0.017640244,0.000054213073,0.000007991414,0.000007982123,0.000003861598,0.0000034470372,0.0004798494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991562,0.0000810723,0.00017500347,0.00027730805,0.00018198593,0.00012844511],"domain_scores_gemma":[0.9994026,0.0000729214,0.000080519676,0.0003555895,0.000043382206,0.00004498368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031565945,0.00007327085,0.00016217666,0.00030403037,0.0001770038,0.000036845195,0.00042775195,0.000013909821,0.000030386447],"category_scores_gemma":[0.000012553937,0.00006329602,0.00007206389,0.0013506395,0.00003078276,0.000056519293,0.0005919992,0.000093801755,0.0000014211525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013459092,0.0008436741,0.011712086,0.000077822806,0.0011597647,0.000008777381,0.029232994,0.09702087,0.004448037,0.2919858,0.0016858473,0.56181085],"study_design_scores_gemma":[0.00009277974,0.00007237216,0.01074467,0.00000191079,0.00006426941,0.0000040861823,0.00001992271,0.983329,0.00037112,0.004118669,0.0010986537,0.00008255598],"about_ca_topic_score_codex":0.000021451955,"about_ca_topic_score_gemma":0.000003674558,"teacher_disagreement_score":0.88630813,"about_ca_system_score_codex":0.000013690971,"about_ca_system_score_gemma":0.000030425559,"threshold_uncertainty_score":0.25811368},"labels":[],"label_agreement":null},{"id":"W4363671821","doi":"10.4230/lipics.tqc.2024.12","title":"Quantum Delegation with an Off-The-Shelf Device","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Ottawa","keywords":"Computer science; Quantum computer; Delegation; Theoretical computer science; Quantum; Quantum algorithm; Quantum mechanics; Physics","score_opus":0.060695796025061456,"score_gpt":0.19798335975311465,"score_spread":0.1372875637280532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4363671821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4799537,0.00003042042,0.5181846,0.00046567197,0.00045951485,0.00020894466,0.0000070441247,0.00058112474,0.00010893789],"genre_scores_gemma":[0.99387854,0.00003854378,0.0051559317,0.0001728351,0.00017850388,0.0000013170479,0.000025073561,0.000034522098,0.0005147379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977834,0.0002257799,0.00018347937,0.0012171187,0.00016681956,0.00042336545],"domain_scores_gemma":[0.9975734,0.00018579152,0.00025602966,0.0016358742,0.00018316269,0.00016579025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038951318,0.0003463393,0.00027226898,0.00021852842,0.00041631208,0.0002929555,0.0026011262,0.0001909519,0.0000034135728],"category_scores_gemma":[0.000021715672,0.00027897442,0.00012765007,0.0009577227,0.00012290374,0.00031137306,0.0015960303,0.0008143296,0.000080488266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022366503,0.000054173874,0.0004832372,0.00004293321,0.00007024136,0.00030185006,0.0005546347,0.91938084,0.0000071807135,0.07397761,0.00012775522,0.004977179],"study_design_scores_gemma":[0.00023222585,0.00015110531,0.0021975623,0.0000890061,0.000040125993,0.000015419133,0.00007169409,0.9602531,0.000028993587,0.035892874,0.0006357378,0.00039215814],"about_ca_topic_score_codex":0.0003498922,"about_ca_topic_score_gemma":0.00023192391,"teacher_disagreement_score":0.51392484,"about_ca_system_score_codex":0.0000872004,"about_ca_system_score_gemma":0.00024918152,"threshold_uncertainty_score":0.99996626},"labels":[],"label_agreement":null},{"id":"W4365135628","doi":"10.1371/journal.pcbi.1011033","title":"Gate-based quantum computing for protein design","year":2023,"lang":"en","type":"article","venue":"PLoS Computational Biology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CMC Microsystems (Canada); Occupational Cancer Research Centre; University of Toronto","funders":"Compute Canada; Canadian Institutes of Health Research; Western Canada Research Grid; CMC Microsystems","keywords":"Quantum computer; Computer science; Protein design; Quantum; Computational biology; Physics; Protein structure; Biology; Quantum mechanics; Nuclear magnetic resonance","score_opus":0.04514953130065076,"score_gpt":0.28297353726750973,"score_spread":0.237824005966859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365135628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09763546,0.000026903896,0.8976204,0.0028987138,0.0002744883,0.0006137668,0.000016098955,0.00089620287,0.000017982684],"genre_scores_gemma":[0.6159676,2.2984347e-7,0.3832963,0.0004225651,0.00014277874,0.00005068157,0.000089166024,0.000015787082,0.00001491822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813217,0.00022411208,0.0003372553,0.0005991046,0.0001883294,0.0005190023],"domain_scores_gemma":[0.99796253,0.0013504005,0.00014729137,0.00024876083,0.00019659479,0.0000943994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054405106,0.00020905874,0.00025913553,0.00028691834,0.00036159015,0.00009227714,0.0007317126,0.00010009651,0.000003749552],"category_scores_gemma":[0.00017650682,0.00018821386,0.00011164115,0.00070044154,0.00008335457,0.0000629088,0.0002035715,0.00015922783,0.000106985484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017256327,0.00006995122,0.000095088,0.000036516056,0.000034897374,0.000007699877,0.00011961735,0.8978329,0.0025841617,0.08687729,0.0004955053,0.011829164],"study_design_scores_gemma":[0.00050348544,0.00029282307,0.0005688687,0.000034747918,0.0000034168818,0.000005151293,0.000003306176,0.86990505,0.0009485479,0.1271708,0.00035371826,0.00021010076],"about_ca_topic_score_codex":0.000004099834,"about_ca_topic_score_gemma":2.3679988e-7,"teacher_disagreement_score":0.51833206,"about_ca_system_score_codex":0.000028960767,"about_ca_system_score_gemma":0.00020327506,"threshold_uncertainty_score":0.7675139},"labels":[],"label_agreement":null},{"id":"W4365151014","doi":"10.1103/physrevapplied.19.044034","title":"Efficient Algorithms for High-Dimensional Quantum Optimal Control of a Transmon Qubit","year":2023,"lang":"en","type":"article","venue":"Physical Review Applied","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Intelligence Advanced Research Projects Activity","keywords":"Transmon; Qubit; Computer science; Algorithm; Quantum algorithm; Quantum; Quantum Fourier transform; Benchmark (surveying); Quantum computer; Quantum gate; Physics; Quantum mechanics","score_opus":0.014167019694692973,"score_gpt":0.27642440802009854,"score_spread":0.26225738832540557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365151014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089018695,0.001602765,0.9052731,0.0020605307,0.00023077503,0.001393719,0.00004780747,0.00032747927,0.000045119876],"genre_scores_gemma":[0.9759317,0.00007150707,0.023033613,0.0005191132,0.0001928884,0.00020660956,0.000016383065,0.00002159756,0.0000065557247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815106,0.000047795274,0.00038745403,0.00052810105,0.0004611476,0.00042442564],"domain_scores_gemma":[0.99869996,0.0005064155,0.00015777389,0.00044363982,0.00007250182,0.000119723896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004723007,0.00023175716,0.00068132,0.00006758661,0.000108250715,0.000022582104,0.0006054256,0.000031614516,0.0000028488264],"category_scores_gemma":[0.000033091183,0.00017663058,0.00028676743,0.000704291,0.000066759945,0.000020186279,0.00011833589,0.00016221502,0.00005112661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005396175,0.0005729961,7.487902e-7,0.00172471,0.000104398285,0.000008606437,0.00031993588,0.19484611,0.015104565,0.46453136,0.0011059293,0.3216267],"study_design_scores_gemma":[0.00082733296,0.00015886535,0.000092140595,0.00033454513,0.000040936997,0.0000022481106,0.0000014201643,0.9871416,0.0013427528,0.009153031,0.00069766317,0.00020744588],"about_ca_topic_score_codex":0.000005523022,"about_ca_topic_score_gemma":8.937901e-8,"teacher_disagreement_score":0.88691306,"about_ca_system_score_codex":0.00001378291,"about_ca_system_score_gemma":0.000057311463,"threshold_uncertainty_score":0.7202786},"labels":[],"label_agreement":null},{"id":"W4365802358","doi":"10.1088/2058-7058/36/02/26","title":"Ask me anything: Rafal Janik","year":2023,"lang":"en","type":"article","venue":"Physics World","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ask price; Officer; Business; Management; History; Political science; Law; Economics; Finance","score_opus":0.018093378708116628,"score_gpt":0.25105298951267546,"score_spread":0.23295961080455885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365802358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114953935,0.0001246061,0.8455839,0.011204729,0.003543166,0.00031586568,0.000009391763,0.004290264,0.01997415],"genre_scores_gemma":[0.97166705,0.0000037068355,0.023499507,0.00073565764,0.0010548944,0.000007960417,0.0000073939277,0.000025889698,0.0029979507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875367,0.00004120586,0.00013928054,0.00037529657,0.00030061405,0.00038991898],"domain_scores_gemma":[0.9991686,0.000133453,0.000056675402,0.00051466614,0.000035301742,0.00009132531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021030358,0.0001456322,0.00015013458,0.00010727146,0.00020247922,0.00018390254,0.00079165446,0.000019614143,0.0000048289926],"category_scores_gemma":[0.000013163888,0.00013242282,0.000095308154,0.0016937758,0.000030458472,0.00017752936,0.00048255944,0.00024494677,0.0005622553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003986817,0.00012002258,0.00050920306,0.000036566867,0.000059057922,0.00010734585,0.0035156931,0.035377547,0.002481481,0.46839154,0.031983048,0.4574145],"study_design_scores_gemma":[0.00014975989,0.000021917842,0.0013102822,0.000023787816,0.000003059162,0.000003854964,0.0000070251103,0.88504374,0.001402816,0.09636365,0.015455382,0.00021475827],"about_ca_topic_score_codex":0.000014223346,"about_ca_topic_score_gemma":0.000004053341,"teacher_disagreement_score":0.8567131,"about_ca_system_score_codex":0.000015541305,"about_ca_system_score_gemma":0.000039186285,"threshold_uncertainty_score":0.7226842},"labels":[],"label_agreement":null},{"id":"W4366598569","doi":"10.22331/q-2023-04-20-985","title":"Finite-rate sparse quantum codes aplenty","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Bipartite graph; Computer science; Algorithm; Satisfiability; Code (set theory); Qubit; Constraint satisfaction problem; Quantum; Theoretical computer science; Quantum mechanics; Artificial intelligence; Physics","score_opus":0.025180603851039308,"score_gpt":0.25745154941295123,"score_spread":0.2322709455619119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366598569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54113895,0.00027747004,0.44241118,0.0073336367,0.0037889616,0.0003413461,0.000043791955,0.003868867,0.0007958091],"genre_scores_gemma":[0.992471,0.00010045513,0.005146668,0.00093437335,0.00037179908,0.000022464781,0.00004121382,0.000043062155,0.00086897076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739426,0.00020500677,0.00039018656,0.0007496467,0.0004188535,0.00084202253],"domain_scores_gemma":[0.9979402,0.0006318378,0.00014136419,0.0009828837,0.000083234096,0.00022047259],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008897484,0.0003130266,0.00033781395,0.0003083566,0.00039474768,0.0003001963,0.0014033223,0.00010829944,0.000028033643],"category_scores_gemma":[0.00020570564,0.00027137456,0.00017245297,0.0015476656,0.00009580751,0.00023228303,0.00062684284,0.00036898855,0.0018064169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000328512,0.00028132778,0.0008742131,0.00014726356,0.00012027511,0.00090658246,0.003999845,0.10478152,0.0020640525,0.7568892,0.066133015,0.06376982],"study_design_scores_gemma":[0.0002677213,0.00013457406,0.0025782282,0.00004785037,0.0000054573816,0.000018776595,0.000048531132,0.9126729,0.00035464644,0.048502024,0.035015337,0.00035399137],"about_ca_topic_score_codex":0.000079535814,"about_ca_topic_score_gemma":0.00000746748,"teacher_disagreement_score":0.80789137,"about_ca_system_score_codex":0.000025988827,"about_ca_system_score_gemma":0.0000897683,"threshold_uncertainty_score":0.99997383},"labels":[],"label_agreement":null},{"id":"W4366824063","doi":"10.1103/physreva.107.042429","title":"Perturbative model of noisy quantum signal processing","year":2023,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Science; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Neelan Tiruchelvam Trust; U.S. Department of Energy","keywords":"Algorithm; Generalization; Notation; Operator (biology); Quantum; Unification; Diagrammatic reasoning; Quantum error correction; Computer science; Mathematics; Quantum algorithm; Theoretical computer science; Physics; Quantum mechanics; Arithmetic; Mathematical analysis","score_opus":0.026559551690348238,"score_gpt":0.34806697488510085,"score_spread":0.3215074231947526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366824063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2048865,0.11821695,0.65713936,0.013048194,0.00025396998,0.0030275409,0.00006594895,0.0014467926,0.0019147648],"genre_scores_gemma":[0.9575241,0.03302415,0.005467577,0.003093933,0.00054168823,0.00017836709,0.000022207973,0.000068307214,0.000079664205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960788,0.00031786383,0.00075400237,0.0009997366,0.0011095791,0.00074002123],"domain_scores_gemma":[0.997343,0.0005787935,0.0005154288,0.00092568377,0.00033105596,0.0003060285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006644482,0.0005378253,0.0016840707,0.00009425061,0.00019474798,0.000066046356,0.0016100258,0.000038821916,0.000005036763],"category_scores_gemma":[0.00039385588,0.0003866747,0.0008633479,0.0024587254,0.00018986617,0.00037789452,0.00072226475,0.0006275284,0.00027115966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011947961,0.0012637198,0.000019314304,0.026142888,0.00010713143,0.00003285799,0.001428629,0.0056521255,0.03174693,0.09579232,0.0074660797,0.83033603],"study_design_scores_gemma":[0.00013340921,0.00017280313,0.00005570631,0.012512114,0.00009568554,0.0000046204655,0.0000028697295,0.9063412,0.0018291138,0.07658696,0.0018456745,0.00041985782],"about_ca_topic_score_codex":0.000006232217,"about_ca_topic_score_gemma":2.6275444e-7,"teacher_disagreement_score":0.90068907,"about_ca_system_score_codex":0.000042688363,"about_ca_system_score_gemma":0.00023364501,"threshold_uncertainty_score":0.9998585},"labels":[],"label_agreement":null},{"id":"W4367044107","doi":"10.1109/edtm55494.2023.10103117","title":"Scalable Addressing Circuits for a Surface Code Quantum Computer in Silicon","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Quantum computer; Electronic circuit; Code (set theory); Silicon; Computer architecture; Quantum; Optoelectronics; Electrical engineering; Programming language; Materials science; Engineering; Physics; Operating system","score_opus":0.04238219230769774,"score_gpt":0.2871165796692973,"score_spread":0.24473438736159958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367044107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4393286,0.000040042905,0.55696046,0.0018795084,0.0005953207,0.0002627666,0.000005730197,0.000715118,0.00021245285],"genre_scores_gemma":[0.93037796,0.00000556105,0.06812438,0.0006274009,0.00019833035,0.00001526645,0.000009834416,0.000028617036,0.0006126475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982381,0.00006437895,0.0002853501,0.0005787002,0.00022080791,0.0006126847],"domain_scores_gemma":[0.9989244,0.00043110727,0.0000621352,0.00042708227,0.00005747005,0.00009783887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006052559,0.00017634986,0.00024814895,0.00018082565,0.00017869446,0.00025579063,0.0007409401,0.00007607817,0.000005025186],"category_scores_gemma":[0.00002718958,0.00015593685,0.000083902974,0.0010472103,0.00003276758,0.00019842423,0.0003449676,0.00017124313,0.00007189897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010473424,0.00020160852,0.002591663,0.00021420898,0.0000344516,0.00011064715,0.0028713346,0.53895354,0.0061756456,0.04916848,0.025547424,0.37412053],"study_design_scores_gemma":[0.0004995605,0.000077514684,0.0034591292,0.000086062886,0.0000013104683,0.000011341509,0.000014949577,0.9878467,0.0009486815,0.0045821043,0.0022498542,0.00022282978],"about_ca_topic_score_codex":0.00005166002,"about_ca_topic_score_gemma":0.00002889824,"teacher_disagreement_score":0.49104935,"about_ca_system_score_codex":0.000029005972,"about_ca_system_score_gemma":0.000070753165,"threshold_uncertainty_score":0.63589203},"labels":[],"label_agreement":null},{"id":"W4367049307","doi":"10.1103/prxquantum.4.020315","title":"Deterministic Constant-Depth Preparation of the AKLT State on a Quantum Processor Using Fusion Measurements","year":2023,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Science; U.S. Department of Energy","keywords":"Constant (computer programming); Quantum; Computation; Symmetry (geometry); Quantum computer; Homogeneous space; State (computer science); Physics; Computer science; Topology (electrical circuits); Quantum mechanics; Algorithm; Mathematics; Geometry; Programming language; Combinatorics","score_opus":0.06089474153274752,"score_gpt":0.31541139836574106,"score_spread":0.2545166568329935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367049307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95761704,0.00004215464,0.040056344,0.00034697133,0.0009759993,0.00048670985,0.000011418421,0.00028910983,0.00017424325],"genre_scores_gemma":[0.9982288,0.000006550348,0.0015197777,0.00010989715,0.000052015108,0.000012225081,0.0000024338683,0.000020851337,0.000047469926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975518,0.00021498001,0.00046649625,0.0005113177,0.000808682,0.0004467515],"domain_scores_gemma":[0.99850816,0.00017190479,0.0003720874,0.00069519354,0.00016937355,0.00008331256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071128627,0.00023422067,0.00026114492,0.00018294076,0.00038073835,0.0001196925,0.0008994493,0.000059391798,0.0000023783887],"category_scores_gemma":[0.00022059995,0.0001626828,0.00011352688,0.0010822256,0.00010200702,0.00014962957,0.00039233128,0.00021276891,0.000029944493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008215227,0.0018158463,0.016103178,0.001958808,0.0004286773,0.00021126244,0.033389732,0.43436992,0.2622745,0.06731824,0.0033184143,0.17798992],"study_design_scores_gemma":[0.00034929268,0.00027757412,0.0043703304,0.00028678184,0.00001264425,0.000019445963,0.000025675548,0.97543037,0.0067172493,0.012157877,0.00014397423,0.00020878582],"about_ca_topic_score_codex":0.000032488064,"about_ca_topic_score_gemma":0.000014446696,"teacher_disagreement_score":0.54106045,"about_ca_system_score_codex":0.000050014387,"about_ca_system_score_gemma":0.0002518012,"threshold_uncertainty_score":0.6634012},"labels":[],"label_agreement":null},{"id":"W4367053540","doi":"10.21203/rs.3.rs-2844895/v1","title":"WITHDRAWN: Exploring the features of quanvolutional neural networks for improved image classification","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial intelligence; Convolutional neural network; Contextual image classification; Artificial neural network; Image (mathematics); Pattern recognition (psychology); Network topology; Machine learning; Image processing","score_opus":0.11853772319923268,"score_gpt":0.369004207764395,"score_spread":0.25046648456516235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367053540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024960678,0.0009019504,0.95511174,0.013946509,0.0021784415,0.0022912193,0.00011802298,0.00042298803,0.000068427435],"genre_scores_gemma":[0.95675415,0.00014692567,0.03951404,0.000042665022,0.0017497423,0.0012098008,0.00016319584,0.000074781405,0.00034469998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965798,0.00048690022,0.00041483462,0.00088280323,0.00086101075,0.0007746301],"domain_scores_gemma":[0.9955252,0.0017863851,0.00021891049,0.001414352,0.0009342496,0.000120915094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002674732,0.0002665,0.0003241583,0.00034444375,0.0006766026,0.00050906534,0.0025476909,0.00018273469,0.0000015164023],"category_scores_gemma":[0.000529165,0.00018877347,0.00029834808,0.0008072165,0.0003059859,0.00015908969,0.0027583805,0.001970642,0.0000036430852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000245352,0.00032585612,0.00029855996,0.002352556,0.0003195768,0.000021891003,0.004565064,0.46632332,0.0030758292,0.093488954,0.022136874,0.40684617],"study_design_scores_gemma":[0.00017972598,0.00015330827,0.026251633,0.0002563249,0.0000054604648,0.000004510673,0.00012977509,0.9600784,0.00011517867,0.01228097,0.00035768157,0.00018701481],"about_ca_topic_score_codex":0.00018939415,"about_ca_topic_score_gemma":0.000039031565,"teacher_disagreement_score":0.93179345,"about_ca_system_score_codex":0.00010415991,"about_ca_system_score_gemma":0.00032232617,"threshold_uncertainty_score":0.8561568},"labels":[],"label_agreement":null},{"id":"W4367677246","doi":"10.1145/3592622","title":"Quantum Computing with Differentiable Quantum Transforms","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Quantum Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada); University of British Columbia","funders":"","keywords":"Differentiable function; Quantum computer; Computer science; Quantum; Computation; Quantum algorithm; Theoretical computer science; Pure mathematics; Mathematics; Algorithm; Physics; Quantum mechanics","score_opus":0.01784252110367955,"score_gpt":0.24911496401779287,"score_spread":0.2312724429141133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367677246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40275505,0.00005600017,0.59173465,0.0015697278,0.0009516084,0.0003657219,0.000012365961,0.0024747588,0.00008013183],"genre_scores_gemma":[0.9721947,0.000040823,0.026788995,0.0004141944,0.00025555238,0.00001642845,0.000025729516,0.00013547856,0.00012811311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936585,0.00029041505,0.0010633348,0.0017778809,0.0012260155,0.0019838484],"domain_scores_gemma":[0.99540806,0.001357485,0.00035903903,0.0021968607,0.00021005195,0.00046850063],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010584667,0.0009436142,0.00091929024,0.0010382972,0.0022554987,0.000712364,0.0030657803,0.00026345838,0.00003233412],"category_scores_gemma":[0.000050853057,0.0007809567,0.00045621817,0.0038347181,0.00021984527,0.0005481447,0.00017569413,0.0015080721,0.00038589895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001508233,0.00072857004,0.000352682,0.00028209656,0.00040703616,0.00032727764,0.0059875255,0.6858687,0.0009056404,0.027389912,0.00060977734,0.27699],"study_design_scores_gemma":[0.0014351214,0.0008262807,0.0019994222,0.0005041322,0.000050533337,0.0002191673,0.00041007367,0.9830295,0.0013277541,0.008261375,0.00084344385,0.001093224],"about_ca_topic_score_codex":0.00014769583,"about_ca_topic_score_gemma":0.000017207474,"teacher_disagreement_score":0.56943965,"about_ca_system_score_codex":0.00012497605,"about_ca_system_score_gemma":0.00020753308,"threshold_uncertainty_score":0.99946415},"labels":[],"label_agreement":null},{"id":"W4367860003","doi":"10.48550/arxiv.2305.01169","title":"Fast quantum gate design with deep reinforcement learning using real-time feedback on readout signals","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reinforcement learning; Quantum computer; Leakage (economics); Quantum gate; Qubit; High fidelity; Fidelity; Quantum; Algorithm; Electronic engineering; Electrical engineering; Artificial intelligence; Physics; Engineering; Telecommunications; Quantum mechanics","score_opus":0.07364942258616722,"score_gpt":0.2041372790777402,"score_spread":0.130487856491573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367860003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18511382,0.000008724944,0.81276226,0.0000733134,0.00029709435,0.00042490137,0.0000020444666,0.00082795083,0.00048988115],"genre_scores_gemma":[0.97829014,0.00008764228,0.018355591,0.00006197355,0.00015594857,0.0000014111095,0.00002126285,0.00008715478,0.0029389008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628365,0.00046103357,0.0003595101,0.0017642756,0.00031167752,0.0008198614],"domain_scores_gemma":[0.9972226,0.000393763,0.0005814526,0.001321732,0.00019790344,0.00028252238],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006736669,0.00065728405,0.0006208577,0.0005470626,0.0005468425,0.00034530464,0.0018694903,0.00029212612,0.000022387585],"category_scores_gemma":[0.00003881652,0.00063921686,0.00023265119,0.001018883,0.00013693851,0.0002118151,0.0019809674,0.0012222771,0.0003122754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098199846,0.00003975714,0.00006619207,0.000058643964,0.00013787922,0.0007642151,0.0005369502,0.9931234,0.00022549891,0.0042927684,0.000049642993,0.00060686935],"study_design_scores_gemma":[0.00053343765,0.00048639183,0.00012738649,0.00070005015,0.00007169298,0.000016738022,0.000071419,0.99252903,0.00021527002,0.0044341306,0.000030221525,0.00078423903],"about_ca_topic_score_codex":0.00039179248,"about_ca_topic_score_gemma":0.000006439226,"teacher_disagreement_score":0.7944067,"about_ca_system_score_codex":0.00029873176,"about_ca_system_score_gemma":0.00030832083,"threshold_uncertainty_score":0.9996059},"labels":[],"label_agreement":null},{"id":"W4376123241","doi":"10.22331/q-2023-05-04-995","title":"Measurement optimization of variational quantum simulation by classical shadow and derandomization","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Quantum computer; Qubit; Quantum; Computer science; Observable; Physics; Quantum algorithm; Computation; Algorithm; Statistical physics; Quantum mechanics","score_opus":0.018268805527482303,"score_gpt":0.24524196367875684,"score_spread":0.22697315815127453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376123241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01820381,0.00011389916,0.97953963,0.0014161238,0.00028536216,0.00017890122,0.0000063193133,0.0002221751,0.000033771583],"genre_scores_gemma":[0.98507553,0.000021607282,0.014703538,0.00006857266,0.000066044675,0.000007852601,0.00003058799,0.000012107491,0.000014155312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983906,0.00013160131,0.00034726065,0.00033767102,0.0005858347,0.00020700115],"domain_scores_gemma":[0.9991311,0.0002111829,0.00016509346,0.00021364978,0.0002083988,0.00007060714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007176244,0.00013457914,0.00019392805,0.00016199268,0.0001606213,0.00009213515,0.00021977059,0.000074152136,0.0000055458404],"category_scores_gemma":[0.00021611857,0.00012295897,0.000048102418,0.0006021443,0.000038644204,0.00021388817,0.000111531706,0.00009827728,0.0000068936597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001942281,0.000043094275,0.00010502411,0.00002161718,0.000016065294,9.723626e-7,0.00023105014,0.9627357,0.00066348136,0.030598227,0.00060806796,0.0049572443],"study_design_scores_gemma":[0.0009607123,0.000080742924,0.0014902874,0.000037636288,0.000007931454,0.0000023170703,0.000007598067,0.98995894,0.00012816169,0.006937072,0.0002529073,0.00013567407],"about_ca_topic_score_codex":0.000012660874,"about_ca_topic_score_gemma":0.0000010026208,"teacher_disagreement_score":0.96687174,"about_ca_system_score_codex":0.000029188985,"about_ca_system_score_gemma":0.00006106127,"threshold_uncertainty_score":0.50141215},"labels":[],"label_agreement":null},{"id":"W4376166989","doi":"10.48550/arxiv.2305.05881","title":"Data and code example for the article: \"Massively parallel hybrid quantum-classical machine learning for kernelized time-series classification\"","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Agnostiq (Canada)","funders":"Office of Science; National Energy Research Scientific Computing Center; U.S. Department of Energy","keywords":"Computer science; Quantum machine learning; Kernel method; Support vector machine; Radial basis function kernel; Algorithm; Artificial intelligence; Quantum; Quantum computer; Machine learning","score_opus":0.14080461175945924,"score_gpt":0.23784992387292334,"score_spread":0.0970453121134641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376166989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031354114,0.000141868,0.9631974,0.003179925,0.0003606716,0.0007865538,0.0005325309,0.0004338993,0.000013042434],"genre_scores_gemma":[0.9461525,0.00035139563,0.048400696,0.00013599978,0.0003265953,0.000023550572,0.00053938216,0.00007828478,0.003991594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975411,0.00015744808,0.00027318008,0.0014718384,0.00011273848,0.00044364925],"domain_scores_gemma":[0.9960709,0.0017724788,0.00032109185,0.0015441262,0.00015132948,0.00014002505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007227327,0.00032546985,0.00037715724,0.000114333154,0.0007629487,0.00034694123,0.002637283,0.00013285576,0.000004019138],"category_scores_gemma":[0.00033910733,0.00027585658,0.00014831363,0.00027183758,0.00022971757,0.00024608048,0.0033813743,0.00058638374,0.000019607765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035861158,0.00014442367,0.0009014522,0.0002534657,0.00046202648,0.000073462325,0.0005559388,0.81328714,0.00020168484,0.16311799,0.007460175,0.013183609],"study_design_scores_gemma":[0.0007484945,0.000093669754,0.0010829779,0.000045746237,0.00008985326,0.00000924923,0.00004630821,0.93824065,0.000016867902,0.03964438,0.019651625,0.00033015572],"about_ca_topic_score_codex":0.0000689935,"about_ca_topic_score_gemma":0.00005816941,"teacher_disagreement_score":0.9147984,"about_ca_system_score_codex":0.00004562648,"about_ca_system_score_gemma":0.00016649603,"threshold_uncertainty_score":0.99996936},"labels":[],"label_agreement":null},{"id":"W4376274099","doi":"10.1016/j.infsof.2023.107249","title":"Making existing software quantum safe: A case study on IBM Db2","year":2023,"lang":"en","type":"article","venue":"Information and Software Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Toronto Metropolitan University","funders":"","keywords":"Computer science; IBM; Quantum computer; Software engineering; Cryptography; Upgrade; Software; Computer security; Quantum; Operating system","score_opus":0.036255932891376914,"score_gpt":0.30416471946185214,"score_spread":0.26790878657047523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376274099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62468743,0.000022282504,0.37008187,0.0007201902,0.0002940567,0.00025720664,0.000004524495,0.003864826,0.000067627894],"genre_scores_gemma":[0.95735055,0.0000035096957,0.04215238,0.0003974051,0.000029251609,0.00003090482,0.0000049969112,0.000009743167,0.000021281652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868935,0.000038088812,0.00039646926,0.00027194782,0.0002295292,0.00037459555],"domain_scores_gemma":[0.9989533,0.00021931849,0.00017396193,0.0005051212,0.00009317751,0.000055115244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037949692,0.00019429518,0.0002058293,0.0009258812,0.00055050093,0.0002121429,0.00047456007,0.00015078513,0.0000033525089],"category_scores_gemma":[0.0005245558,0.00017374069,0.00003739363,0.0013722014,0.00006822974,0.00044315154,0.00059626496,0.00038596985,0.00012887284],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050095096,0.000046763635,0.006422082,0.000042501677,0.000021149157,0.0011433756,0.00686283,0.0012477357,0.0000018568813,0.014084582,0.0003049418,0.96981716],"study_design_scores_gemma":[0.003256428,0.0026121878,0.016227465,0.00040805206,0.000031292693,0.013036751,0.018063437,0.86435884,0.00010925342,0.05326411,0.026880944,0.0017512222],"about_ca_topic_score_codex":0.000024592804,"about_ca_topic_score_gemma":0.000008687642,"teacher_disagreement_score":0.968066,"about_ca_system_score_codex":0.000028333654,"about_ca_system_score_gemma":0.000042995358,"threshold_uncertainty_score":0.70849395},"labels":[],"label_agreement":null},{"id":"W4376604100","doi":"10.1088/2058-9565/acd578","title":"Do quantum circuit Born machines generalize?","year":2023,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Waterloo","funders":"Army Research Office; Mitacs; UK Research and Innovation","keywords":"Leverage (statistics); Generalization; Computer science; Generative grammar; Cardinality (data modeling); Algorithm; Set (abstract data type); Generative model; Artificial intelligence; Machine learning; Theoretical computer science; Mathematics; Data mining","score_opus":0.01610957440974005,"score_gpt":0.25848906044656234,"score_spread":0.2423794860368223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376604100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95538235,0.0005637065,0.026653325,0.0132431,0.0010736649,0.00018457504,0.0000046094333,0.0024974064,0.00039725695],"genre_scores_gemma":[0.99502987,0.0001213929,0.00433041,0.00031100988,0.000087173365,0.000019072322,0.0000013121912,0.000015265297,0.00008447407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970024,0.000035104928,0.0002919923,0.0010735177,0.0006393402,0.00095762033],"domain_scores_gemma":[0.9984075,0.000088293054,0.000109304805,0.000992438,0.00022919863,0.00017329628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012423984,0.00025029323,0.00028389035,0.0015997305,0.0009329487,0.00039253972,0.0024188685,0.00015422578,0.0000057462707],"category_scores_gemma":[0.00030542194,0.00020461626,0.000044957043,0.008311225,0.0012124092,0.00040256753,0.0013478942,0.00036041907,0.00014301042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.500485e-7,0.000023227263,0.0012584,0.000011369606,0.000005923492,0.00008055733,0.00027130754,0.000062881816,0.015098429,0.8138045,0.00073814014,0.1686443],"study_design_scores_gemma":[0.00019717866,0.00016844638,0.0024341056,0.000023779463,0.0000032795665,0.00021997487,0.00006466193,0.700685,0.0018140256,0.28742254,0.00666117,0.00030582445],"about_ca_topic_score_codex":0.000039037983,"about_ca_topic_score_gemma":0.000003888444,"teacher_disagreement_score":0.70062214,"about_ca_system_score_codex":0.000033245575,"about_ca_system_score_gemma":0.00025492915,"threshold_uncertainty_score":0.83440083},"labels":[],"label_agreement":null},{"id":"W4376604320","doi":"10.1088/2058-9565/acd577","title":"Reducing molecular electronic Hamiltonian simulation cost for linear combination of unitaries approaches","year":2023,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Science; Google","keywords":"Hamiltonian (control theory); Norm (philosophy); Homogeneous space; Quantum; Figure of merit; Computer science; Applied mathematics; Mathematics; Quantum mechanics; Physics; Mathematical optimization; Optics","score_opus":0.02397533980907055,"score_gpt":0.27103742460022945,"score_spread":0.2470620847911589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376604320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65169394,0.00008032545,0.34496242,0.0026387905,0.00009006665,0.00024024544,0.0000014137744,0.00027539936,0.000017368688],"genre_scores_gemma":[0.9897913,0.000009586013,0.0101279905,0.000024417583,0.00000974552,0.00002001363,0.0000029199277,0.0000061672667,0.000007897065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987088,0.000017072747,0.00018495269,0.00041712864,0.0002459621,0.00042607033],"domain_scores_gemma":[0.99916905,0.0001181559,0.00010362954,0.00033512292,0.00023691582,0.000037104706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008845652,0.00010148076,0.00014989485,0.00080732704,0.00036709112,0.000055525117,0.0006433299,0.0000822541,1.7945628e-7],"category_scores_gemma":[0.00036802125,0.00009274903,0.000022666045,0.0034359663,0.00060426263,0.00020775087,0.00025886286,0.00013926634,0.0000016791225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028382522,0.000026871843,0.0000981907,0.000024345474,0.0000055472788,0.0000017355958,0.0003377261,0.027402699,0.015134692,0.82814455,0.000005727105,0.12881507],"study_design_scores_gemma":[0.0001747012,0.00025313365,0.00024462352,0.000016456446,0.0000030041112,0.0000062743507,0.00007766237,0.8805959,0.020755164,0.097503,0.0002760671,0.00009398522],"about_ca_topic_score_codex":0.000009511819,"about_ca_topic_score_gemma":0.0000018835295,"teacher_disagreement_score":0.8531932,"about_ca_system_score_codex":0.000031548858,"about_ca_system_score_gemma":0.00023239104,"threshold_uncertainty_score":0.37821957},"labels":[],"label_agreement":null},{"id":"W4376639497","doi":"10.1145/3564246.3585158","title":"Multidimensional Quantum Walks","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Quantum walk; Upper and lower bounds; Quantum; Matching (statistics); Extension (predicate logic); Computational complexity theory; Order (exchange); Quantum algorithm; Computer science; Constant (computer programming); Mathematics; Combinatorics; Discrete mathematics; Algorithm; Physics; Quantum mechanics; Statistics","score_opus":0.013606643110884671,"score_gpt":0.2449471810087453,"score_spread":0.23134053789786063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376639497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29770985,0.000032220167,0.68891376,0.0065949555,0.0012595259,0.000094022216,0.0000011809855,0.002679344,0.0027151562],"genre_scores_gemma":[0.86130255,0.0000054693687,0.135292,0.0008922215,0.00016253107,0.0000050148305,0.000004438302,0.000012213004,0.0023235492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990633,0.000027080294,0.00011439404,0.00028759288,0.00022621106,0.0002813817],"domain_scores_gemma":[0.99941355,0.00012249878,0.00002191966,0.0003328171,0.000029720615,0.00007951508],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020420265,0.00008927052,0.00008492066,0.00011499994,0.00014204545,0.00005034075,0.0004191999,0.000031195046,0.000024132685],"category_scores_gemma":[0.000023258533,0.00006741672,0.000054305743,0.00060913747,0.000019464649,0.00008438781,0.00038638953,0.000106615655,0.0012205292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023408877,0.000055916993,0.0002522655,0.00001013185,0.000019549909,0.00016065099,0.0007202388,0.011290533,0.003025426,0.6763943,0.04041601,0.26765266],"study_design_scores_gemma":[0.0001128801,0.000026399215,0.0037437163,0.0000059403665,5.047734e-7,0.00001539694,0.000007224646,0.9687329,0.00037607935,0.008151166,0.018719088,0.000108732434],"about_ca_topic_score_codex":0.000016485204,"about_ca_topic_score_gemma":9.517651e-7,"teacher_disagreement_score":0.95744234,"about_ca_system_score_codex":0.0000062567437,"about_ca_system_score_gemma":0.00002881699,"threshold_uncertainty_score":0.99955714},"labels":[],"label_agreement":null},{"id":"W4377010173","doi":"10.22331/q-2023-05-15-1002","title":"Two-Unitary Decomposition Algorithm and Open Quantum System Simulation","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Science; Ames Research Center; National Aeronautics and Space Administration; U.S. Department of Energy","keywords":"Algorithm; Computer science; Artificial intelligence","score_opus":0.01944055297754499,"score_gpt":0.3051477675114587,"score_spread":0.28570721453391373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377010173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23050533,0.00015584053,0.76507074,0.0008972274,0.0011623782,0.00046173343,0.000016640694,0.0013234097,0.00040669407],"genre_scores_gemma":[0.9566293,0.000010950373,0.042839672,0.00016692342,0.00021879733,0.000019384655,0.00003670441,0.000027003352,0.000051268496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980478,0.00019684075,0.00034457873,0.0006332512,0.00032404103,0.0004534448],"domain_scores_gemma":[0.9986978,0.00034082073,0.00013171432,0.00057467184,0.00008614909,0.00016885444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070975674,0.00023574423,0.00029643063,0.0002721631,0.00052647403,0.00059302046,0.0010955665,0.00007673477,0.0000029914681],"category_scores_gemma":[0.00002393376,0.00021719288,0.00006186495,0.0009258969,0.000047764628,0.0005775071,0.0011259355,0.00021912376,0.00015557955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025763584,0.00011693994,0.00027024647,0.00017613036,0.00008397128,0.00040146682,0.0019810938,0.23266168,0.0006763351,0.3332818,0.0014601088,0.42886448],"study_design_scores_gemma":[0.0005432889,0.000144507,0.0022215836,0.00012107745,0.000008567117,0.000080122765,0.00013796183,0.9847371,0.00007561797,0.010833734,0.0008053981,0.00029101974],"about_ca_topic_score_codex":0.00021312734,"about_ca_topic_score_gemma":0.0000036622814,"teacher_disagreement_score":0.75207543,"about_ca_system_score_codex":0.00004813094,"about_ca_system_score_gemma":0.000055569093,"threshold_uncertainty_score":0.8856869},"labels":[],"label_agreement":null},{"id":"W4377121328","doi":"10.48550/arxiv.2305.10310","title":"QRAM: A Survey and Critique","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Clarendon Fund; University of Oxford","keywords":"Scalability; Computer science; Qubit; Argument (complex analysis); Quantum; Quantum computer; Random access; State (computer science); Theoretical computer science; Algorithm; Physics; Quantum mechanics","score_opus":0.08066532993175275,"score_gpt":0.21067770552794823,"score_spread":0.1300123755961955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377121328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45103133,0.000056534336,0.5470724,0.00031649874,0.00064259407,0.00013969665,0.000027991127,0.00054421724,0.00016872949],"genre_scores_gemma":[0.9956625,0.00013732669,0.0027959535,0.00014837405,0.00006684191,4.306494e-7,0.00001609704,0.000022344811,0.00115011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979862,0.00027630635,0.00014632507,0.001164175,0.000075497286,0.00035147957],"domain_scores_gemma":[0.99820167,0.00047122818,0.00011449094,0.0009241759,0.00011372121,0.00017471683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053090166,0.00027680016,0.0002982417,0.0002343689,0.00017526466,0.00021679809,0.0013662702,0.00023522723,0.0000033042472],"category_scores_gemma":[0.00011276222,0.00030773084,0.000106913125,0.0005509722,0.0001015521,0.000116411094,0.0035439446,0.0007038891,0.00004820788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035059013,0.0001589354,0.047024447,0.00037072523,0.0002563563,0.0026850319,0.0011799249,0.7833358,0.000013674485,0.15267283,0.004776272,0.0074909306],"study_design_scores_gemma":[0.0001680807,0.000034135166,0.04389343,0.000075594755,0.0000092655855,0.000007459217,0.000010144448,0.89941365,0.0000076734295,0.055812534,0.00021677451,0.00035127735],"about_ca_topic_score_codex":0.00082434004,"about_ca_topic_score_gemma":0.00021043979,"teacher_disagreement_score":0.5446312,"about_ca_system_score_codex":0.000043033622,"about_ca_system_score_gemma":0.00013640217,"threshold_uncertainty_score":0.9999375},"labels":[],"label_agreement":null},{"id":"W4377238332","doi":"10.1103/physrevlett.130.210601","title":"Quantum Similarity Testing with Convolutional Neural Networks","year":2023,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Ontario Ministry of Research, Innovation and Science; Government of Canada; Croucher Foundation; National Natural Science Foundation of China; Research Grants Council, University Grants Committee; Innovation, Science and Economic Development Canada; John Templeton Foundation","keywords":"Computer science; Quantum state; Convolutional neural network; Algorithm; Gaussian; Quantum; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.02559002461922797,"score_gpt":0.27030119003311465,"score_spread":0.24471116541388668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377238332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44228747,0.0023174633,0.48985544,0.0629116,0.0005090222,0.00052232994,0.0000047971093,0.0015075491,0.00008432739],"genre_scores_gemma":[0.9674938,0.000102606304,0.007206528,0.02456138,0.0005767183,0.00002524396,0.000010411515,0.000019788606,0.0000035649086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984782,0.00011104615,0.00017734965,0.000432402,0.00035297457,0.00044806924],"domain_scores_gemma":[0.9988751,0.00047961838,0.00009345324,0.00038673822,0.00005052089,0.00011458893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025104336,0.0001906779,0.0002961341,0.000038631875,0.00018854192,0.00007653607,0.000598651,0.000008433244,0.0000014495374],"category_scores_gemma":[0.000080160484,0.00013680881,0.00010712512,0.0012480923,0.000083015984,0.0001434673,0.00025343162,0.00035619093,0.0000437245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006570348,0.00014035341,0.0019896545,0.00077342,0.000069139714,0.00029153147,0.00017153117,0.85562485,0.00085550343,0.012928582,0.021245131,0.10590373],"study_design_scores_gemma":[0.000097073236,0.000054339023,0.0062885117,0.00045634262,0.00001134491,0.000025676727,4.9114703e-7,0.99151015,0.0000031692075,0.00044702928,0.00091178133,0.00019411504],"about_ca_topic_score_codex":0.000009272311,"about_ca_topic_score_gemma":3.6071407e-7,"teacher_disagreement_score":0.52520627,"about_ca_system_score_codex":0.000017571732,"about_ca_system_score_gemma":0.000023215733,"threshold_uncertainty_score":0.5578902},"labels":[],"label_agreement":null},{"id":"W4377820347","doi":"10.1103/physreva.107.053316","title":"Many topological regions on the Bloch sphere of the spin-1/2 double-kicked top","year":2023,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Physics; Winding number; Topology (electrical circuits); Floquet theory; Spin (aerodynamics); Context (archaeology); Quantum; Degrees of freedom (physics and chemistry); Quantum mechanics; Mathematics","score_opus":0.03061734068637286,"score_gpt":0.3549320453669126,"score_spread":0.32431470468053974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377820347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75713545,0.033327743,0.010311998,0.1864607,0.0009265458,0.0047375485,0.0000309588,0.00083442236,0.0062346496],"genre_scores_gemma":[0.95963746,0.025652446,0.0004938768,0.012561831,0.0009519861,0.0002713111,0.000006835137,0.000047113535,0.0003771481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613315,0.00063372677,0.00064050907,0.00085508235,0.0010530353,0.00068448106],"domain_scores_gemma":[0.9957338,0.0011984323,0.00041055167,0.0023075002,0.0001497296,0.00020000165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007787125,0.0004791839,0.0011989627,0.000032158383,0.00042223875,0.00008464401,0.003058017,0.000048543316,0.000025867483],"category_scores_gemma":[0.0006866575,0.0002226982,0.0012545876,0.0026838356,0.000460372,0.00009173597,0.0012257206,0.0009468958,0.0006849113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104274495,0.0006700499,0.000032382464,0.0022525047,0.000074506555,0.000021308591,0.0002218038,0.00015362508,0.0017075295,0.91183054,0.027849928,0.055175416],"study_design_scores_gemma":[0.0010391863,0.0011183305,0.0033727011,0.03990455,0.0005403041,0.00006130032,0.000028393786,0.20966522,0.010267076,0.44878495,0.28348568,0.0017323031],"about_ca_topic_score_codex":0.000017997045,"about_ca_topic_score_gemma":0.0000013917686,"teacher_disagreement_score":0.46304557,"about_ca_system_score_codex":0.000036394624,"about_ca_system_score_gemma":0.00012149538,"threshold_uncertainty_score":0.9081369},"labels":[],"label_agreement":null},{"id":"W4378881805","doi":"10.1145/3565478.3572541","title":"Integrated Control Addressing Circuits for a Surface Code Quantum Computer in Silicon","year":2022,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Qubit; Quantum computer; Computer science; Error detection and correction; Scalability; Quantum network; Quantum error correction; Electronic engineering; Node (physics); Modular design; Electronic circuit; Overhead (engineering); Quantum; Electrical engineering; Engineering; Physics; Algorithm; Quantum mechanics","score_opus":0.026383563491948137,"score_gpt":0.25887160959610656,"score_spread":0.2324880461041584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378881805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2479368,0.00008484654,0.748843,0.0017392617,0.0006252372,0.00039310454,0.000029819526,0.00026940255,0.00007854526],"genre_scores_gemma":[0.966512,5.971202e-7,0.031810135,0.0014265691,0.00007316661,0.00003701269,0.000010365461,0.0000183443,0.000111813075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804765,0.00023602143,0.00034877588,0.00058937405,0.00028186702,0.0004962905],"domain_scores_gemma":[0.9988813,0.0004597775,0.00010674197,0.00039879492,0.00006754167,0.00008586959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007061503,0.0002004347,0.0003106173,0.00014972621,0.00036489574,0.00018710854,0.0009824652,0.00004208329,0.0000242592],"category_scores_gemma":[0.000022918133,0.00018053417,0.00010467309,0.0006114427,0.000032167423,0.00013419165,0.00036334907,0.00039452902,0.0000041981943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037429614,0.0003401017,0.0010361857,0.00004093517,0.000041850744,0.00007292416,0.002105432,0.7696242,0.0040697483,0.030135999,0.004620435,0.18787481],"study_design_scores_gemma":[0.001492139,0.00025440883,0.000675807,0.000024399356,0.000002826518,0.000040224775,0.00005162807,0.98954254,0.00020072094,0.0018707167,0.005594604,0.00025000572],"about_ca_topic_score_codex":0.000117366915,"about_ca_topic_score_gemma":0.000028489942,"teacher_disagreement_score":0.7185752,"about_ca_system_score_codex":0.00009156164,"about_ca_system_score_gemma":0.0001377742,"threshold_uncertainty_score":0.736197},"labels":[],"label_agreement":null},{"id":"W4378977813","doi":"10.1016/j.jedc.2023.104680","title":"Quantum monte carlo for economics: Stress testing and macroeconomic deep learning","year":2023,"lang":"en","type":"article","venue":"Journal of Economic Dynamics and Control","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada); Bank of Canada","funders":"","keywords":"Bottleneck; Computer science; Monte Carlo method; Benchmarking; Investment (military); Quantum Monte Carlo; Quasi-Monte Carlo method; Quantum computer; Macro; Deep learning; Artificial neural network; Quantum; Mathematical optimization; Economics; Artificial intelligence; Monte Carlo molecular modeling; Mathematics; Physics; Management; Markov chain Monte Carlo","score_opus":0.007156522604540959,"score_gpt":0.21414583358093783,"score_spread":0.20698931097639686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378977813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9315543,0.0004106924,0.06620754,0.0010010754,0.000601698,0.0001324843,0.000023015182,0.000039443858,0.000029708906],"genre_scores_gemma":[0.99397755,0.00020257849,0.0053038076,0.00008451378,0.00035333986,0.0000043865252,8.495747e-7,0.000018920111,0.000054061064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882627,0.000034877485,0.0005259604,0.00027473015,0.00003034947,0.0003078126],"domain_scores_gemma":[0.99838716,0.0007519145,0.0005276288,0.00013771236,0.000053545697,0.0001420272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006695097,0.0001669903,0.00041210136,0.00020533804,0.00020862931,0.00033109545,0.00034410154,0.000058615937,6.648711e-7],"category_scores_gemma":[0.00007294871,0.00015935554,0.00010659588,0.00004630657,0.000044680404,0.00026200234,0.00012323272,0.00022330786,0.0000021703618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040211668,0.00001301241,0.011270977,0.000039571845,0.00015950992,0.000015083974,0.0003301453,0.6271946,0.000044084718,0.014731032,0.00001882438,0.34614298],"study_design_scores_gemma":[0.0013835796,0.0002746448,0.005500461,0.000032236796,0.00001987227,0.00013565908,0.00010809455,0.9838658,0.0000032289931,0.008335581,0.00017003014,0.00017080765],"about_ca_topic_score_codex":0.000029721568,"about_ca_topic_score_gemma":0.000051422605,"teacher_disagreement_score":0.3566712,"about_ca_system_score_codex":0.00008157397,"about_ca_system_score_gemma":0.000073457406,"threshold_uncertainty_score":0.649833},"labels":[],"label_agreement":null},{"id":"W4379208543","doi":"10.1007/s10773-023-05354-4","title":"Hybrid Phase-Based Representation of Quantum Images","year":2023,"lang":"en","type":"article","venue":"International Journal of Theoretical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Qubit; Basis (linear algebra); Superposition principle; Algorithm; Mathematics; Representation (politics); Quantum algorithm; Quantum computer; Dimension (graph theory); Theoretical computer science; Quantum; Computer science; Quantum mechanics; Combinatorics; Physics; Mathematical analysis; Geometry","score_opus":0.014328805457935263,"score_gpt":0.3150330402764615,"score_spread":0.30070423481852626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379208543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1649118,0.000012589906,0.83098066,0.0029144282,0.00093357434,0.000029130795,0.000011376165,0.000036250414,0.0001702029],"genre_scores_gemma":[0.98737085,0.0000074652944,0.012040763,0.00012837004,0.00043418308,5.0685946e-7,0.000004814901,0.0000074422987,0.0000055794494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985828,0.000085427215,0.00038433992,0.000129152,0.000690158,0.00012813606],"domain_scores_gemma":[0.9984748,0.00045873164,0.00032953426,0.00018150455,0.00049431244,0.000061151535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034875213,0.00008658465,0.00017849913,0.00014460154,0.000028915932,0.00007325277,0.0010396083,0.000018146762,0.000012188408],"category_scores_gemma":[0.00021794722,0.00006919922,0.00020017315,0.0002605095,0.0001806093,0.0001763831,0.00014785114,0.00017363779,0.000011481287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007062761,0.00023774809,0.00005007559,0.000007310358,0.000083519255,0.00012866648,0.00014200495,0.035533816,0.0062010717,0.86224556,0.001219698,0.094079904],"study_design_scores_gemma":[0.0005180616,0.00012968079,0.00009673698,0.000043062915,0.0000054936427,0.000025996744,0.0000053432977,0.55375904,0.05038963,0.39492068,0.00005815677,0.000048101145],"about_ca_topic_score_codex":0.0000015014143,"about_ca_topic_score_gemma":7.571296e-9,"teacher_disagreement_score":0.8224591,"about_ca_system_score_codex":0.000019473762,"about_ca_system_score_gemma":0.000071895396,"threshold_uncertainty_score":0.2821862},"labels":[],"label_agreement":null},{"id":"W4379386662","doi":"10.20944/preprints202306.0209.v1","title":"Entanglement Distillation Optimization using Fuzzy Relations for Quantum State Tomography","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum annealing; Quantum entanglement; Distillation; Density matrix; Fuzzy logic; Computer science; Quantum; Quantum computer; Quantum tomography; Mathematical optimization; Simulated annealing; Statistical physics; Quantum state; Mathematics; Algorithm; Quantum mechanics; Physics; Artificial intelligence; Chemistry","score_opus":0.11233824518827874,"score_gpt":0.3399999158093406,"score_spread":0.22766167062106185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379386662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21852803,0.000047758283,0.7770351,0.0006742093,0.001806475,0.0010207038,0.000077816374,0.00071387645,0.00009603217],"genre_scores_gemma":[0.8104326,0.000034941506,0.18850201,0.00005809237,0.0002772346,0.000159369,0.00023056827,0.00007212931,0.00023305167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968311,0.0001553509,0.00072035997,0.0013403303,0.0004612678,0.0004915492],"domain_scores_gemma":[0.9974426,0.000213966,0.00057856867,0.0013530691,0.00027029,0.00014147932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086125947,0.0003984639,0.00037344068,0.00048090058,0.00042864695,0.0001692137,0.0010559267,0.00020381511,0.000020030944],"category_scores_gemma":[0.00015871428,0.00042508164,0.00033831698,0.0005959866,0.00005422494,0.00018640721,0.0024637235,0.0005270753,0.00007107924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008141379,0.000054894153,0.026958382,0.000093576025,0.00008817201,0.0000036581384,0.0010256389,0.9681028,0.00014466725,0.002289609,0.000037502294,0.0011929675],"study_design_scores_gemma":[0.0002509062,0.00002351357,0.031510323,0.00020187507,0.000038218484,0.0000035665018,0.0000157947,0.9290348,0.00032785657,0.037807617,0.00036149344,0.00042402014],"about_ca_topic_score_codex":0.00013347223,"about_ca_topic_score_gemma":0.000010540799,"teacher_disagreement_score":0.5919046,"about_ca_system_score_codex":0.00017665073,"about_ca_system_score_gemma":0.00018881685,"threshold_uncertainty_score":0.9998201},"labels":[],"label_agreement":null},{"id":"W4380032415","doi":"10.21468/scipost.report.6291","title":"Report on scipost_202206_00017v2","year":2022,"lang":"en","type":"peer-review","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Science; University of Toronto; Compute Canada; National Science Foundation; Government of Canada; Vector Institute; Canadian Institute for Advanced Research; U.S. Department of Energy","keywords":"Computer science","score_opus":0.02251354351758392,"score_gpt":0.2965773141307317,"score_spread":0.27406377061314774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380032415","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011390404,0.026098255,0.0411319,0.52528113,0.03696531,0.0012777048,0.00016139023,0.002211549,0.36686137],"genre_scores_gemma":[0.00001043233,0.0009906581,0.022715833,0.03428844,0.001026866,0.000090608926,0.00056868704,0.00006379258,0.9402447],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959307,0.00017120033,0.0005783783,0.0013727681,0.0014537098,0.00049329584],"domain_scores_gemma":[0.9966147,0.00019236699,0.0003882943,0.0025301918,0.00011731845,0.00015716083],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010900832,0.00045695197,0.00066555943,0.000252443,0.00038404128,0.00017989824,0.0029696273,0.000122029705,0.0027208333],"category_scores_gemma":[0.00018173682,0.00037113074,0.00037897108,0.0007808682,0.000033973047,0.00005980148,0.0021287755,0.0014297628,0.00027234157],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.4711256e-7,0.000046040084,3.5149762e-7,0.00027257597,0.000024067984,0.0013460803,0.000013986886,0.000271553,1.8250434e-7,0.0026092501,0.91996837,0.07544697],"study_design_scores_gemma":[0.00006906,0.00016539582,0.0000070314863,0.00073725247,0.0000178305,0.0011280299,6.0012025e-7,0.013517831,0.0000037574605,0.00072399847,0.9831644,0.00046477624],"about_ca_topic_score_codex":0.00009584101,"about_ca_topic_score_gemma":0.0000056001377,"teacher_disagreement_score":0.5733833,"about_ca_system_score_codex":0.000114310424,"about_ca_system_score_gemma":0.00045766082,"threshold_uncertainty_score":0.99987406},"labels":[],"label_agreement":null},{"id":"W4380032525","doi":"10.21468/scipost.report.5465","title":"Report on scipost_202206_00017v1","year":2022,"lang":"en","type":"peer-review","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Science; University of Toronto; Compute Canada; National Science Foundation; Government of Canada; Vector Institute; Canadian Institute for Advanced Research; U.S. Department of Energy","keywords":"Art","score_opus":0.022673500824321163,"score_gpt":0.29680320667322285,"score_spread":0.2741297058489017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380032525","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014836933,0.02785101,0.042951435,0.551706,0.03901039,0.0013510577,0.00016979025,0.002335718,0.33460972],"genre_scores_gemma":[0.00001049376,0.0009863592,0.022595683,0.033423435,0.0010280241,0.000090811234,0.0005659533,0.0000639056,0.9412353],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995937,0.0001710375,0.0005779135,0.0013725939,0.0014483859,0.00049306895],"domain_scores_gemma":[0.9966249,0.00019102062,0.00038166175,0.0025283669,0.00011694731,0.00015713538],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010868666,0.0004568355,0.0006652421,0.00025182142,0.0003809412,0.00017899698,0.0029652766,0.00012218273,0.0026977805],"category_scores_gemma":[0.00014002151,0.0003710874,0.00037882334,0.00077890145,0.00003388811,0.00005973472,0.0021277918,0.0014299905,0.00027215306],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.4659e-7,0.00004606423,3.5266055e-7,0.00027356463,0.000024087705,0.0013476019,0.000013985621,0.00026546512,1.8186796e-7,0.0027257947,0.9207013,0.07460101],"study_design_scores_gemma":[0.00006911778,0.00016538608,0.0000068772397,0.0007388388,0.000017838593,0.0011282878,5.997071e-7,0.013418313,0.000003735918,0.0009881355,0.982998,0.00046485657],"about_ca_topic_score_codex":0.000083448715,"about_ca_topic_score_gemma":0.0000056019544,"teacher_disagreement_score":0.6066256,"about_ca_system_score_codex":0.0001142809,"about_ca_system_score_gemma":0.0004577976,"threshold_uncertainty_score":0.9998741},"labels":[],"label_agreement":null},{"id":"W4380032527","doi":"10.21468/scipost.report.5303","title":"Report on scipost_202206_00017v1","year":2022,"lang":"en","type":"peer-review","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Science; University of Toronto; Compute Canada; National Science Foundation; Government of Canada; Vector Institute; Canadian Institute for Advanced Research; U.S. Department of Energy","keywords":"Computer science","score_opus":0.022673500824321163,"score_gpt":0.29680320667322285,"score_spread":0.2741297058489017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380032527","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014836933,0.02785101,0.042951435,0.551706,0.03901039,0.0013510577,0.00016979025,0.002335718,0.33460972],"genre_scores_gemma":[0.00001049376,0.0009863592,0.022595683,0.033423435,0.0010280241,0.000090811234,0.0005659533,0.0000639056,0.9412353],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995937,0.0001710375,0.0005779135,0.0013725939,0.0014483859,0.00049306895],"domain_scores_gemma":[0.9966249,0.00019102062,0.00038166175,0.0025283669,0.00011694731,0.00015713538],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010868666,0.0004568355,0.0006652421,0.00025182142,0.0003809412,0.00017899698,0.0029652766,0.00012218273,0.0026977805],"category_scores_gemma":[0.00014002151,0.0003710874,0.00037882334,0.00077890145,0.00003388811,0.00005973472,0.0021277918,0.0014299905,0.00027215306],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.4659e-7,0.00004606423,3.5266055e-7,0.00027356463,0.000024087705,0.0013476019,0.000013985621,0.00026546512,1.8186796e-7,0.0027257947,0.9207013,0.07460101],"study_design_scores_gemma":[0.00006911778,0.00016538608,0.0000068772397,0.0007388388,0.000017838593,0.0011282878,5.997071e-7,0.013418313,0.000003735918,0.0009881355,0.982998,0.00046485657],"about_ca_topic_score_codex":0.000083448715,"about_ca_topic_score_gemma":0.0000056019544,"teacher_disagreement_score":0.6066256,"about_ca_system_score_codex":0.0001142809,"about_ca_system_score_gemma":0.0004577976,"threshold_uncertainty_score":0.9998741},"labels":[],"label_agreement":null},{"id":"W4380321969","doi":"10.1103/physreva.107.062412","title":"Quantum algorithm for the linear Vlasov equation with collisions","year":2023,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Vlasov equation; Quantum; Algorithm; Quantum algorithm; Physics; Applied mathematics; Mathematics; Plasma; Mathematical physics; Quantum mechanics","score_opus":0.029088677176665217,"score_gpt":0.3560846261396899,"score_spread":0.32699594896302464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380321969","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058537265,0.026227606,0.94711256,0.016789025,0.00031541518,0.0029915557,0.00004679893,0.0005644585,0.00009886658],"genre_scores_gemma":[0.26358914,0.48540425,0.18728797,0.040703274,0.012422726,0.008648676,0.0005192339,0.000630044,0.0007946865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965175,0.000289486,0.0005432198,0.0009293316,0.0009682419,0.00075221184],"domain_scores_gemma":[0.9948575,0.002835043,0.00033998644,0.0013792426,0.0003239269,0.00026428234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009611122,0.00049186323,0.0011081662,0.000060077517,0.00053523364,0.00011850281,0.0016257004,0.000034235167,0.0000038009039],"category_scores_gemma":[0.00073744974,0.00026865304,0.0007274313,0.002703295,0.0001549009,0.00025615454,0.0004691327,0.0005271883,0.00048676404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067627643,0.0004769477,0.0000074577542,0.0027933875,0.00012467313,0.000016066597,0.0002046756,0.0011620532,0.00044397832,0.068038054,0.011902548,0.9148234],"study_design_scores_gemma":[0.00023919136,0.00036773126,0.00011155565,0.0050799646,0.000189552,0.000008836052,0.0000035473583,0.9078627,0.0003103026,0.020654421,0.064795315,0.00037683776],"about_ca_topic_score_codex":0.000011954463,"about_ca_topic_score_gemma":0.0000010545405,"teacher_disagreement_score":0.91444653,"about_ca_system_score_codex":0.000042191514,"about_ca_system_score_gemma":0.00016214505,"threshold_uncertainty_score":0.9999766},"labels":[],"label_agreement":null},{"id":"W4380355680","doi":"10.22331/q-2023-06-12-1041","title":"Classification of measurement-based quantum wire in stabilizer PEPS","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Stabilizer (aeronautics); Quantum; Class (philosophy); Transmission (telecommunications); Quantum state; Pure mathematics; Computer science; Physics; Mathematics; Quantum mechanics; Artificial intelligence; Engineering; Telecommunications; Structural engineering","score_opus":0.045615276422631884,"score_gpt":0.26812259069758454,"score_spread":0.22250731427495266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380355680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8921076,0.000120971126,0.10333676,0.002924367,0.0006233774,0.00025356153,0.0000058753376,0.00045372106,0.00017379058],"genre_scores_gemma":[0.99735767,0.000005824692,0.0024658132,0.00007224696,0.000042595082,0.000017350594,0.000006475051,0.000017197952,0.00001480224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771047,0.00017918469,0.0004633977,0.00049247785,0.00073035277,0.00042414706],"domain_scores_gemma":[0.99868476,0.00016481301,0.00017455751,0.000729118,0.00016514472,0.00008158626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012864593,0.00018130196,0.00026586713,0.00041352757,0.000089611116,0.000054743523,0.0007941605,0.00008184413,0.000008009823],"category_scores_gemma":[0.00017381548,0.00016418194,0.00010218649,0.0016608948,0.00007358891,0.00013687855,0.00013392356,0.0002227668,0.00006923252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013428349,0.0014586004,0.037004206,0.00088712753,0.00009055278,0.00017801227,0.0064783427,0.07038756,0.1517401,0.5583108,0.008024313,0.16530608],"study_design_scores_gemma":[0.00043097223,0.000111546025,0.07826642,0.00010610208,0.0000027962108,0.0000017577656,0.00007600016,0.9114454,0.0013594816,0.0072529214,0.00076651433,0.00018013548],"about_ca_topic_score_codex":0.00007013716,"about_ca_topic_score_gemma":0.00003219334,"teacher_disagreement_score":0.8410578,"about_ca_system_score_codex":0.000066716675,"about_ca_system_score_gemma":0.00021199735,"threshold_uncertainty_score":0.66951454},"labels":[],"label_agreement":null},{"id":"W4380882198","doi":"10.1103/physreva.107.062416","title":"Transforming collections of Pauli operators into equivalent collections of Pauli operators over minimal registers","year":2023,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Industry Canada","keywords":"Pauli exclusion principle; Pauli matrices; Qubit; Set (abstract data type); Physics; Computer science; Quantum entanglement; Quantum; Quantum mechanics; Theoretical physics; Discrete mathematics; Mathematics","score_opus":0.018754709568934092,"score_gpt":0.34391413313643654,"score_spread":0.32515942356750244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380882198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8371874,0.05780859,0.082048364,0.009624047,0.0015504576,0.0067535555,0.0001885272,0.0010076596,0.003831375],"genre_scores_gemma":[0.9191123,0.07319182,0.0040500704,0.0017723975,0.00064425025,0.0005633223,0.000034190864,0.00011200248,0.0005196164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956118,0.00047230572,0.0012164039,0.0009719904,0.0010260587,0.000701437],"domain_scores_gemma":[0.99698406,0.0006953751,0.00046357853,0.0011451935,0.00033866573,0.0003731338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006969142,0.00057253515,0.0019344233,0.00025426524,0.00054291205,0.00009527994,0.0012734896,0.000061073544,0.000020120353],"category_scores_gemma":[0.00058168924,0.00045102977,0.0012281535,0.008290802,0.000296503,0.00034392386,0.00046714547,0.0005791966,0.000056381952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013310747,0.009209588,0.0003313529,0.08348727,0.0018703311,0.00018417292,0.0115432255,0.0049482924,0.22729774,0.09752107,0.19572788,0.36774597],"study_design_scores_gemma":[0.0029858507,0.0048656627,0.00068414555,0.07657556,0.001944143,0.00010408791,0.00018768074,0.5002536,0.10044129,0.035290744,0.27255353,0.004113678],"about_ca_topic_score_codex":0.00008013366,"about_ca_topic_score_gemma":0.000016850723,"teacher_disagreement_score":0.49530533,"about_ca_system_score_codex":0.00011472944,"about_ca_system_score_gemma":0.000353385,"threshold_uncertainty_score":0.9997941},"labels":[],"label_agreement":null},{"id":"W4380905717","doi":"10.1109/tit.2023.3286870","title":"On the Hardness of the Minimum Distance Problem of Quantum Codes","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Notation; Mathematics; Discrete mathematics; Quantum algorithm; Combinatorics; Quantum; Quantum computer; Graph; Code (set theory); Computer science; Arithmetic; Quantum mechanics; Physics","score_opus":0.00872148690654637,"score_gpt":0.21461079546155076,"score_spread":0.2058893085550044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380905717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042578198,0.000003682314,0.9547142,0.0011708296,0.00059821084,0.00021799473,0.00004192227,0.000101838676,0.00057315256],"genre_scores_gemma":[0.9990004,0.000006512024,0.00054824766,0.0002775809,0.000007769161,0.000022120941,0.0000011607523,0.0000043593104,0.0001318597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896616,0.00014696582,0.00033046646,0.0000903569,0.00032521616,0.0001408566],"domain_scores_gemma":[0.998609,0.000574515,0.00021113906,0.00049799937,0.00008501172,0.000022354676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066725444,0.000101938116,0.00011490066,0.00012522873,0.00026965313,0.000040833307,0.0007256478,0.000038191287,0.0000102279955],"category_scores_gemma":[0.00001567756,0.000055944536,0.00011710073,0.0007716957,0.0001374313,0.00024952722,0.0000069601,0.0001969061,0.00003581479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046307814,0.000058323465,0.0000015295535,0.000078626465,0.000031442472,1.7907091e-7,0.007725946,0.353538,0.00013029849,0.58720917,0.00066887843,0.05051129],"study_design_scores_gemma":[0.00025779946,0.0001186958,0.00022687904,0.00018906445,0.000008532863,0.0000036138647,0.00047859896,0.88782144,0.022292262,0.087448284,0.0010331582,0.00012168865],"about_ca_topic_score_codex":0.0000054952707,"about_ca_topic_score_gemma":0.0000011772776,"teacher_disagreement_score":0.9564222,"about_ca_system_score_codex":0.000013788956,"about_ca_system_score_gemma":0.000047739373,"threshold_uncertainty_score":0.2281352},"labels":[],"label_agreement":null},{"id":"W4381747951","doi":"10.1109/tit.2023.3287556","title":"How to Sample From the Limiting Distribution of a Continuous-Time Quantum Walk","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum walk; Notation; Mathematics; Limiting; Discrete mathematics; Random walk; Quantum algorithm; Combinatorics; Eigenvalues and eigenvectors; Graph; Algorithm; Quantum; Statistics; Arithmetic; Quantum mechanics; Physics","score_opus":0.008506631016310617,"score_gpt":0.20876107434522276,"score_spread":0.20025444332891215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381747951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08193912,0.0000039640236,0.9143188,0.0024046327,0.0004280282,0.00018884722,0.00035171036,0.00031754252,0.000047366266],"genre_scores_gemma":[0.995752,0.000003967921,0.0036836464,0.00039761962,0.00004566148,0.00001568779,0.00005854313,0.0000050677345,0.000037845457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896324,0.00012035185,0.0002838199,0.0001355468,0.00027913915,0.00021788599],"domain_scores_gemma":[0.9979581,0.0013246029,0.0001396793,0.00041118174,0.00010496809,0.00006143964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005443292,0.00012459035,0.00014076523,0.00012282713,0.00033077653,0.00022241432,0.0005137054,0.000051946347,0.000014558619],"category_scores_gemma":[0.00009125723,0.00009266389,0.00010596889,0.0007106867,0.000041995696,0.0005863563,0.000007548844,0.00018785968,0.00018783647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008282164,0.000034351695,0.000007803534,0.000016310101,0.000055738554,8.3086803e-7,0.006880418,0.16520621,0.00028955346,0.021380523,0.0007435126,0.8053019],"study_design_scores_gemma":[0.00031641475,0.00021318658,0.0010541506,0.00007575279,0.000012696474,0.00000401952,0.0006181441,0.97122455,0.0060973,0.016540127,0.003652857,0.00019083235],"about_ca_topic_score_codex":0.00005557475,"about_ca_topic_score_gemma":0.0000032083822,"teacher_disagreement_score":0.9138128,"about_ca_system_score_codex":0.000022470089,"about_ca_system_score_gemma":0.000035713725,"threshold_uncertainty_score":0.37787238},"labels":[],"label_agreement":null},{"id":"W4381853425","doi":"10.21203/rs.3.rs-2279231/v2","title":"A SAT Solver + Computer Algebra Attack on the Minimum Kochen-Specker Problem","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Waterloo","funders":"","keywords":"Kochen–Specker theorem; Solver; Computer science; Dimension (graph theory); Theoretical computer science; Vector space; Cryptography; Quantum system; Discrete mathematics; Algebra over a field; Mathematics; Quantum; Algorithm; Pure mathematics; Quantum mechanics; Physics; Programming language","score_opus":0.11528533961930867,"score_gpt":0.368983848342992,"score_spread":0.2536985087236834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381853425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37434846,0.0015478319,0.38949853,0.20248562,0.008536865,0.011512295,0.0003200163,0.0055865776,0.006163783],"genre_scores_gemma":[0.79140294,0.0005025782,0.17732769,0.003947146,0.011850244,0.0016229731,0.00035215728,0.00068609574,0.012308153],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913899,0.0013565501,0.00058854197,0.0020569577,0.002886006,0.0017220885],"domain_scores_gemma":[0.9929928,0.0024604923,0.00019418437,0.0033682887,0.00062750845,0.00035669433],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.004029027,0.0006398724,0.00058415456,0.0006851576,0.0009474507,0.0017813543,0.005499496,0.00047474878,0.00006317163],"category_scores_gemma":[0.00018304397,0.0004228965,0.000475217,0.001390562,0.0003671038,0.0001104918,0.01215501,0.005017019,0.0023896496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007976488,0.000819137,0.0005775709,0.001877511,0.000557227,0.0010809114,0.012223608,0.07885568,0.00011638163,0.08671014,0.70669013,0.110411964],"study_design_scores_gemma":[0.00038033762,0.0005519724,0.004333153,0.0022126073,0.00000785065,0.000022940132,0.000081099184,0.9125023,0.00013518154,0.05106153,0.027913788,0.0007972485],"about_ca_topic_score_codex":0.0001049008,"about_ca_topic_score_gemma":0.000028277855,"teacher_disagreement_score":0.8336466,"about_ca_system_score_codex":0.00023144139,"about_ca_system_score_gemma":0.0005944971,"threshold_uncertainty_score":0.9998812},"labels":[],"label_agreement":null},{"id":"W4382241014","doi":"10.1103/physreva.107.062421","title":"Optimizing quantum circuits with Riemannian gradient flow","year":2023,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada); Vector Institute; University of Waterloo","funders":"Mitacs","keywords":"Quantum circuit; Heuristics; Unitary state; Quantum; Quantum phase estimation algorithm; Computer science; Quantum computer; Electronic circuit; Quantum algorithm; Algorithm; Flow (mathematics); Unitary group; Mathematical optimization; Mathematics; Theoretical computer science; Applied mathematics; Quantum network; Geometry; Quantum mechanics; Physics","score_opus":0.017609887525827223,"score_gpt":0.31631757912352887,"score_spread":0.29870769159770166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382241014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3717911,0.17188133,0.40233728,0.036798175,0.0015261704,0.006843782,0.000073049756,0.0051045273,0.003644579],"genre_scores_gemma":[0.87073106,0.10243213,0.013059372,0.010827847,0.002040502,0.0004765931,0.000084306135,0.00021916674,0.00012902095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949909,0.00041643606,0.00067475834,0.0014541628,0.0012619108,0.0012018377],"domain_scores_gemma":[0.99646586,0.00056920596,0.00037286684,0.0017638041,0.00023448073,0.0005937822],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00073617155,0.00074095506,0.0017798581,0.000115252005,0.00035262134,0.00018243658,0.0019133615,0.000039652594,0.0000075168136],"category_scores_gemma":[0.00039606425,0.0005082859,0.000825785,0.003426499,0.0001866766,0.00042760937,0.0007211937,0.0008256461,0.0011626937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011392964,0.0016092376,0.00005398319,0.019723361,0.00025916545,0.00052710355,0.0023293875,0.0046542725,0.0030279853,0.09646474,0.016882138,0.85445726],"study_design_scores_gemma":[0.00037518068,0.00058553217,0.00037233127,0.02411504,0.0002211154,0.000057724035,0.0000073183382,0.906205,0.00059908757,0.026640557,0.03971099,0.0011101126],"about_ca_topic_score_codex":0.00001167346,"about_ca_topic_score_gemma":0.0000014123069,"teacher_disagreement_score":0.9015507,"about_ca_system_score_codex":0.00007024004,"about_ca_system_score_gemma":0.00013842314,"threshold_uncertainty_score":0.99973685},"labels":[],"label_agreement":null},{"id":"W4382362536","doi":"10.31234/osf.io/z675e","title":"Steps Toward Quantum Computational Creativity","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum entanglement; Creativity; Computer science; Context (archaeology); Superposition principle; Quantum; Quantum computer; Cognition; Theoretical computer science; Cognitive science; Quantum mechanics; Physics; Psychology","score_opus":0.051193120872584534,"score_gpt":0.2950982510767824,"score_spread":0.24390513020419785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382362536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014926947,0.00007106194,0.97293055,0.0060892673,0.0024439914,0.00027422974,0.000031677493,0.0021307573,0.0011015303],"genre_scores_gemma":[0.5893296,0.00001570767,0.40811232,0.0005273214,0.0005198257,0.000036430818,0.00008832757,0.000053768363,0.0013166725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712336,0.00016721881,0.0004244041,0.0011503134,0.0006713696,0.00046332495],"domain_scores_gemma":[0.998029,0.0004794283,0.00021472003,0.0009492319,0.0001585903,0.00016906131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052851037,0.00040740098,0.0004645445,0.00026230156,0.00017813357,0.0005578147,0.0020084803,0.00024667906,0.00002261191],"category_scores_gemma":[0.00007050676,0.00035581345,0.00026563322,0.0003782632,0.00007117412,0.00010292427,0.0047986777,0.00096021045,0.00031948093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003657948,0.00011418397,0.0003225868,0.00017756179,0.000114833274,0.0001066183,0.0013245576,0.8231104,0.000007060148,0.13252313,0.0084059145,0.033789486],"study_design_scores_gemma":[0.00011168395,0.0000345811,0.006444319,0.00008133927,0.000005519409,0.000012697991,0.000009975554,0.76343864,0.000013161337,0.2288931,0.0006156979,0.0003392696],"about_ca_topic_score_codex":0.00024367364,"about_ca_topic_score_gemma":0.000008623772,"teacher_disagreement_score":0.5744027,"about_ca_system_score_codex":0.00006040788,"about_ca_system_score_gemma":0.000344286,"threshold_uncertainty_score":0.9998894},"labels":[],"label_agreement":null},{"id":"W4382395854","doi":"10.1103/physrevresearch.5.023200","title":"Quantum algorithms for generator coordinate methods","year":2023,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Pacific Northwest National Laboratory; Basic Energy Sciences; Defense Advanced Research Projects Agency; Battelle; U.S. Department of Energy; Office of Science; Advanced Research Projects Agency; National Science Foundation","keywords":"Quantum algorithm; Quantum; Formalism (music); Linear subspace; Algorithm; Discretization; Eigenvalues and eigenvectors; Eigenfunction; Benchmark (surveying); Qubit; Quantum computer; Algebra over a field; Mathematics; Computer science; Quantum mechanics; Pure mathematics; Physics; Mathematical analysis","score_opus":0.16619398098137425,"score_gpt":0.5112053266740573,"score_spread":0.345011345692683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382395854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003903603,0.02960843,0.94826764,0.014751269,0.00064137526,0.001698167,0.000019206474,0.00078864506,0.00032165746],"genre_scores_gemma":[0.03124361,0.0311265,0.92296016,0.004535047,0.0051388713,0.0026436038,0.00007606341,0.00022711964,0.002049045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963587,0.00095288496,0.00028669898,0.0007594246,0.00065690547,0.0009853916],"domain_scores_gemma":[0.9960705,0.002290347,0.000059094746,0.0008872743,0.0004297444,0.0002630264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055410443,0.00019848204,0.0004837191,0.00020159177,0.0004512164,0.00018540007,0.0016392153,0.000036576574,0.0000048151696],"category_scores_gemma":[0.0011586413,0.00014922368,0.00028386223,0.0030918396,0.000113976115,0.00014080595,0.0009490096,0.0005438535,0.00037152457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024796866,0.0000847945,0.0000014854855,0.0010115823,0.000024297855,0.000011757306,0.0001265626,0.00011690862,0.002881688,0.07831098,0.05036304,0.8670644],"study_design_scores_gemma":[0.000118588556,0.00015411827,0.000029428791,0.00039423697,0.0000047984463,0.0000037686623,0.0000027937228,0.73883766,0.0012700032,0.06442806,0.19460224,0.00015428339],"about_ca_topic_score_codex":0.0000138884425,"about_ca_topic_score_gemma":3.0559278e-7,"teacher_disagreement_score":0.86691016,"about_ca_system_score_codex":0.000038665676,"about_ca_system_score_gemma":0.00014560018,"threshold_uncertainty_score":0.6085165},"labels":[],"label_agreement":null},{"id":"W4382631173","doi":"10.1021/acs.jpclett.3c00985","title":"A Hybrid Quantum-Classical Algorithm for Multichannel Quantum Scattering of Atoms and Molecules","year":2023,"lang":"en","type":"article","venue":"The Journal of Physical Chemistry Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Division of Physics; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Quantum; Physics; Scattering; Quantum mechanics; Quantum algorithm; Algorithm; Computer science","score_opus":0.009842395632174705,"score_gpt":0.23658830912091547,"score_spread":0.22674591348874076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382631173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6694113,0.00003169505,0.32622045,0.004180177,0.000070371476,0.0000497256,0.0000067594788,0.000027967031,0.0000015215039],"genre_scores_gemma":[0.9917243,0.0000071664226,0.007540467,0.00019026376,0.000513419,0.0000023480895,0.000001221427,0.000016318561,0.000004453751],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880725,0.000050531537,0.00032205842,0.0001825428,0.0003361446,0.0003014961],"domain_scores_gemma":[0.9986501,0.00060213194,0.00029946934,0.00025734268,0.00008010315,0.00011086095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003929036,0.0001732149,0.00032449054,0.000047542704,0.00011519718,0.0000503296,0.00076303567,0.000024824429,4.25951e-7],"category_scores_gemma":[0.000056283778,0.00011596814,0.00019744149,0.00020038745,0.00021483147,0.000096452044,0.00025487688,0.00030111228,0.0000013642194],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022609223,0.0000802025,0.0000030192807,0.000116488634,0.000083356965,0.000038755814,0.0009655005,0.0055339313,0.9634326,0.00026595933,0.00068663224,0.028770946],"study_design_scores_gemma":[0.00039920976,0.000078097546,0.000070796945,0.00009081699,0.000024741126,0.00014395129,0.00003659045,0.8553071,0.14059982,0.0030668834,0.00006208868,0.00011990377],"about_ca_topic_score_codex":0.0000029178093,"about_ca_topic_score_gemma":2.1543377e-8,"teacher_disagreement_score":0.84977317,"about_ca_system_score_codex":0.000015898664,"about_ca_system_score_gemma":0.000028765824,"threshold_uncertainty_score":0.47290435},"labels":[],"label_agreement":null},{"id":"W4383045339","doi":"10.48550/arxiv.2306.17230","title":"Superselection Rules, Quantum Error Correction, and Quantum Chromodynamics","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Brookhaven National Laboratory; Institute for Quantum Information and Matter, California Institute of Technology; Office of Science; Fonds Wetenschappelijk Onderzoek; Advanced Scientific Computing Research; National Research Foundation; Natural Sciences and Engineering Research Council of Canada; Vlaamse regering; U.S. Department of Energy; National Science Foundation","keywords":"Superselection; Quantum; Physics; Quantum error correction; Quantum field theory; Theoretical physics; Quantum mechanics; Quantum algorithm; Mathematics","score_opus":0.04657545105018478,"score_gpt":0.19370892167113868,"score_spread":0.1471334706209539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383045339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51506543,0.00007349253,0.4798015,0.00018998688,0.003713545,0.0001923774,0.00001647624,0.0008785208,0.000068660134],"genre_scores_gemma":[0.9966284,0.0003813762,0.0013784681,0.000055221164,0.00023272911,0.0000014044737,0.000044350523,0.000048050068,0.0012299978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723876,0.00019554481,0.00027065785,0.001612785,0.00014610207,0.0005361839],"domain_scores_gemma":[0.99817836,0.00017820408,0.00024297558,0.001001104,0.00017739361,0.00022196051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035044848,0.00046036334,0.0004287099,0.0005014654,0.0004817639,0.000270116,0.0011823601,0.00039957708,0.000005350642],"category_scores_gemma":[0.00005980818,0.00052434223,0.00020186309,0.0008827256,0.0001576391,0.0002548347,0.0019662778,0.001125193,0.000085539505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029565288,0.0001268844,0.0016074145,0.0001866537,0.00016788438,0.0004384576,0.0007744554,0.8804177,0.000062644554,0.10987498,0.002580181,0.0037331623],"study_design_scores_gemma":[0.00027402505,0.00010951546,0.003762193,0.00013070331,0.000043944234,0.00005466591,0.00009844108,0.9477864,0.000014235898,0.046738982,0.0004360457,0.00055083015],"about_ca_topic_score_codex":0.00082496414,"about_ca_topic_score_gemma":0.00022364741,"teacher_disagreement_score":0.48156297,"about_ca_system_score_codex":0.00021257055,"about_ca_system_score_gemma":0.00024304878,"threshold_uncertainty_score":0.9997208},"labels":[],"label_agreement":null},{"id":"W4383070383","doi":"10.1007/s11128-023-04011-3","title":"Sedentariness in quantum walks","year":2023,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Vertex (graph theory); Quantum walk; Combinatorics; Mathematics; Graph; Discrete mathematics; Quantum; Quantum computer; Physics; Quantum mechanics","score_opus":0.01141039419929335,"score_gpt":0.24694238016305267,"score_spread":0.23553198596375932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383070383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63166493,0.000059900944,0.36198896,0.002280727,0.0008719511,0.00023005935,0.000002951419,0.0015231636,0.0013773366],"genre_scores_gemma":[0.99579114,0.000008764228,0.0035425792,0.00051113835,0.000058116122,0.000019057607,0.000027882326,0.000009578378,0.00003172862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982805,0.0000390524,0.000551013,0.00022847354,0.00042113618,0.00047977193],"domain_scores_gemma":[0.99923813,0.000063363565,0.00020058674,0.00030974293,0.00010572423,0.00008243785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006260518,0.0001823186,0.00018696663,0.00068233145,0.00026916843,0.0005831734,0.0007394568,0.000078784666,0.000005876124],"category_scores_gemma":[0.00007667709,0.00016655006,0.000049545022,0.002293413,0.00003323891,0.0029797875,0.00030782362,0.00027833725,0.0003560421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012744475,0.000049710863,0.0017637673,0.00037256497,0.0000076172228,0.0000376743,0.015100746,0.06493079,0.00012272688,0.051646102,0.0012193,0.86473626],"study_design_scores_gemma":[0.0003378027,0.000027213184,0.010073429,0.00011232887,0.0000011874827,0.000026662234,0.00028696994,0.9752116,0.000105266285,0.00915494,0.004433729,0.00022884236],"about_ca_topic_score_codex":0.000060082893,"about_ca_topic_score_gemma":0.0000058480373,"teacher_disagreement_score":0.9102808,"about_ca_system_score_codex":0.000053069674,"about_ca_system_score_gemma":0.00014663754,"threshold_uncertainty_score":0.6791714},"labels":[],"label_agreement":null},{"id":"W4383817322","doi":"10.1007/s42484-023-00112-5","title":"Quantum autoencoders for communication-efficient cloud computing","year":2023,"lang":"en","type":"article","venue":"Quantum Machine Intelligence","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Computer science; Quantum computer; Cloud computing; Computation; Qubit; Theoretical computer science; Quantum; Quantum information; Distributed computing; Computer engineering; Computational science; Parallel computing; Algorithm; Operating system; Physics","score_opus":0.024032286436649265,"score_gpt":0.29740793904309504,"score_spread":0.27337565260644575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383817322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036312107,0.0005576649,0.9549377,0.0040752147,0.0016929216,0.00053116033,0.000022227256,0.0016896422,0.00018138601],"genre_scores_gemma":[0.92803603,0.00007252141,0.071014576,0.00043780383,0.00021476326,0.000034312056,0.000042732736,0.00004795613,0.00009932902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967184,0.00020293402,0.0007501716,0.0008821179,0.00051861245,0.0009277857],"domain_scores_gemma":[0.9961886,0.0015670571,0.0002954538,0.0015177373,0.00021821,0.0002129464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00164025,0.00039802594,0.00040969998,0.00038286927,0.00093645894,0.0003255257,0.0030975465,0.00011329241,0.000011703442],"category_scores_gemma":[0.00037221698,0.0003635239,0.0002660108,0.0017246197,0.00018592401,0.00013803225,0.0010384428,0.0005003225,0.00028682945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100455245,0.00009308186,0.000067945555,0.00005369525,0.000028034876,0.000011995388,0.0021018253,0.5837261,0.00006819189,0.3481937,0.0018213085,0.06382409],"study_design_scores_gemma":[0.00014500346,0.00015330418,0.0002324797,0.00009288055,0.000006930407,0.000032764838,0.00016253823,0.94296795,0.00040490917,0.051823422,0.0035424246,0.00043541833],"about_ca_topic_score_codex":0.00014772992,"about_ca_topic_score_gemma":0.000010571214,"teacher_disagreement_score":0.8917239,"about_ca_system_score_codex":0.000064179396,"about_ca_system_score_gemma":0.00012634245,"threshold_uncertainty_score":0.9998817},"labels":[],"label_agreement":null},{"id":"W4383822293","doi":"10.22331/q-2023-07-10-1049","title":"Quantum simulation of battery materials using ionic pseudopotentials","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Quantum computer; Pseudopotential; Qubit; Hamiltonian (control theory); Computer science; Quantum; Quantum algorithm; Quantum simulator; Algorithm; Quantum mechanics; Statistical physics; Mathematics; Physics; Mathematical optimization","score_opus":0.03132315272618364,"score_gpt":0.28856603212973136,"score_spread":0.25724287940354773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383822293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6871494,0.00004640962,0.31086776,0.00024785084,0.0012360804,0.00011686875,0.00000979555,0.00031121416,0.000014642759],"genre_scores_gemma":[0.99503666,0.000009135439,0.0046114144,0.00007425527,0.00020444236,0.0000029687144,0.0000103356215,0.000023351953,0.000027438928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979834,0.00017577612,0.0005567213,0.00044181992,0.00039769057,0.0004446207],"domain_scores_gemma":[0.99866194,0.00026453377,0.00027677108,0.0006219524,0.000098155666,0.000076643206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000729089,0.00019982371,0.00034784907,0.00032560108,0.00019008105,0.00013756972,0.0006790284,0.00009210964,0.00003064849],"category_scores_gemma":[0.00008222528,0.00018141836,0.000112431386,0.00091890007,0.00005930243,0.0002444269,0.00037207888,0.0001114247,0.00011330359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001089165,0.00005383978,0.00009283346,0.000099704164,0.000036658173,0.000039205082,0.00052706245,0.85438174,0.117134765,0.019472128,0.00026864524,0.007882535],"study_design_scores_gemma":[0.00019751614,0.00007208126,0.0013218636,0.000087233835,0.000009543997,0.000012869145,0.000015025181,0.96870697,0.011815124,0.017413916,0.00014084204,0.00020703465],"about_ca_topic_score_codex":0.000043457418,"about_ca_topic_score_gemma":4.740636e-7,"teacher_disagreement_score":0.30788726,"about_ca_system_score_codex":0.000022786175,"about_ca_system_score_gemma":0.00007466693,"threshold_uncertainty_score":0.73980266},"labels":[],"label_agreement":null},{"id":"W4383860194","doi":"10.3204/pubdb-2023-04595","title":"Quantum Computing for High-Energy Physics: State of the Art and Challenges","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Agencia Estatal de Investigación; HORIZON EUROPE Framework Programme; QuantERA; Centre for Quantum Technologies; European Regional Development Fund; Eusko Jaurlaritza; European Commission; CERN","keywords":"Quantum computer; IBM; Computer science; Large Hadron Collider; Upgrade; Computational science; Physics; Quantum; Theoretical computer science; Quantum mechanics","score_opus":0.06885563779732382,"score_gpt":0.19004406935984883,"score_spread":0.12118843156252501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383860194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15226178,0.00020205394,0.84565413,0.00062095467,0.00084351376,0.00017581884,0.000025214627,0.00018177294,0.00003476669],"genre_scores_gemma":[0.9957376,0.00050860184,0.003236859,0.000040739073,0.00012502969,5.6971174e-7,0.000004743809,0.000023353436,0.00032250799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843234,0.00011898097,0.00019351469,0.00085236813,0.00009386473,0.00030895596],"domain_scores_gemma":[0.9982458,0.00034474654,0.00034368093,0.0008727089,0.0001224141,0.000070680726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025566155,0.00026023955,0.00035365985,0.000099619254,0.00020486288,0.00006150091,0.0013831047,0.000101006415,2.67747e-7],"category_scores_gemma":[0.000022058723,0.00022621106,0.00018169316,0.00030567282,0.00014078779,0.00007283675,0.0030515974,0.00031096902,0.000002607218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067322662,0.00003053159,0.00007638997,0.0002007502,0.00007601728,0.000012867724,0.00036851098,0.50408334,0.000009627468,0.47911316,0.0000898444,0.015932256],"study_design_scores_gemma":[0.0001799067,0.00003866983,0.001144012,0.00014299533,0.000016924077,0.000001240046,0.000016141346,0.6531597,0.00010170528,0.34490344,0.00012631035,0.00016896639],"about_ca_topic_score_codex":0.000101448335,"about_ca_topic_score_gemma":0.00003399601,"teacher_disagreement_score":0.8434758,"about_ca_system_score_codex":0.000030659674,"about_ca_system_score_gemma":0.00009136263,"threshold_uncertainty_score":0.9224619},"labels":[],"label_agreement":null},{"id":"W4383891108","doi":"10.1007/978-3-031-38100-3_12","title":"Improved Synthesis of Toffoli-Hadamard Circuits","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo; Photon Etc (Canada); Simon Fraser University","funders":"","keywords":"Toffoli gate; Hadamard transform; Complex Hadamard matrix; Electronic circuit; Hadamard matrix; Integer (computer science); Matrix (chemical analysis); Qubit; Mathematics; Computer science; Discrete mathematics; Combinatorics; Arithmetic; Algorithm; Topology (electrical circuits); Quantum gate; Physics; Quantum mechanics; Quantum","score_opus":0.014643321662646386,"score_gpt":0.22947315407114202,"score_spread":0.21482983240849562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383891108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023073071,0.00019568171,0.99340206,0.00075973786,0.0026295295,0.00035144165,0.000016586762,0.00040157716,0.002012665],"genre_scores_gemma":[0.4155125,0.00015447079,0.57976663,0.0011973932,0.0016570194,0.00003401378,0.0000078110525,0.0002224552,0.0014477266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952051,0.000053245432,0.0008125185,0.0018463815,0.0011710783,0.0009116794],"domain_scores_gemma":[0.9951292,0.0018596884,0.00052229076,0.0019701398,0.0002987088,0.0002199284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012154962,0.0006754466,0.000939831,0.0012637981,0.00024390187,0.00033506114,0.004887236,0.0003969099,0.0000102065],"category_scores_gemma":[0.0003996524,0.00060346734,0.0002981154,0.0011953114,0.0007129512,0.0002813381,0.002261621,0.000946443,0.000040483872],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002227269,0.000023147295,0.000010794908,0.00008606602,0.00002327082,0.00007894832,0.00038998705,0.029017098,0.00046358988,0.008475695,0.000017493969,0.96141165],"study_design_scores_gemma":[0.00016493685,0.00017556167,0.00013210232,0.0007793099,0.000013700947,0.000062078165,1.3877212e-7,0.90555507,0.0055725733,0.08638086,0.00042220618,0.0007414417],"about_ca_topic_score_codex":0.000045793488,"about_ca_topic_score_gemma":0.000039080365,"teacher_disagreement_score":0.96067023,"about_ca_system_score_codex":0.00015274843,"about_ca_system_score_gemma":0.0006998385,"threshold_uncertainty_score":0.99964166},"labels":[],"label_agreement":null},{"id":"W4384263609","doi":"10.48550/arxiv.2307.05810","title":"The Clifford theory of the n-qubit Clifford group","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clifford algebra; Group (periodic table); Qubit; Spin representation; Mathematics; Representation (politics); Algebra over a field; Pure mathematics; Combinatorics; Quantum mechanics; Quantum; Physics; Fundamental representation","score_opus":0.054575128048740734,"score_gpt":0.18355244464052917,"score_spread":0.12897731659178843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384263609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38743523,0.00017059372,0.60419744,0.0011599986,0.0044214213,0.0006115729,0.000028000759,0.00053173315,0.0014440389],"genre_scores_gemma":[0.99551654,0.00016260889,0.0008306763,0.00012463685,0.0001632918,0.0000012855415,0.0000031876725,0.000028591894,0.0031691757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997662,0.0004597284,0.00030941822,0.00089614454,0.00019298875,0.00047970432],"domain_scores_gemma":[0.9960596,0.00084517855,0.00046348208,0.0024168806,0.00011532623,0.00009955759],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001054268,0.0003297438,0.00032261704,0.00012420682,0.0006900044,0.00016085498,0.0055812662,0.0002282792,0.0000037917575],"category_scores_gemma":[0.000101033,0.00021232538,0.00050692057,0.0009076184,0.00042001894,0.000092061084,0.0064510508,0.001023986,0.000035695793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003071955,0.000054771117,0.0011762378,0.00006243768,0.00014502539,0.000056156267,0.0004447666,0.2076744,0.000013239805,0.7771636,0.00069361704,0.012484982],"study_design_scores_gemma":[0.00021097233,0.00004540868,0.0051306263,0.00013665488,0.000039866776,0.000004718996,0.000081275015,0.5844262,0.00004873176,0.40742284,0.0021850462,0.00026765166],"about_ca_topic_score_codex":0.00008056855,"about_ca_topic_score_gemma":0.00006309097,"teacher_disagreement_score":0.60808134,"about_ca_system_score_codex":0.00007088031,"about_ca_system_score_gemma":0.00016411189,"threshold_uncertainty_score":0.999799},"labels":[],"label_agreement":null},{"id":"W4384818072","doi":"10.1117/12.2678460","title":"Quantum networks: from the quantum internet to the brain","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum network; Computer science; Quantum information science; Quantum entanglement; Quantum; Quantum computer; Quantum information; The Internet; Quantum technology; Context (archaeology); Open quantum system; Physics; Quantum mechanics; World Wide Web","score_opus":0.015218838630798572,"score_gpt":0.24191344089547803,"score_spread":0.22669460226467947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384818072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087203674,0.00011396168,0.77235603,0.13722567,0.0018789648,0.00022205785,0.0000044301723,0.0007517582,0.0002434601],"genre_scores_gemma":[0.97212917,0.0000102001895,0.0038902292,0.021274768,0.0011052279,0.000023999139,0.000009208572,0.000023656634,0.0015335215],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819493,0.0002157481,0.00024057127,0.0005044432,0.00033296377,0.00051132654],"domain_scores_gemma":[0.9971332,0.0015511796,0.000056340414,0.0011127418,0.000036192087,0.00011037778],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008639935,0.00019192317,0.000154818,0.000054927597,0.00031319994,0.0004972543,0.003008624,0.000050492556,0.000031094878],"category_scores_gemma":[0.00014001469,0.00009036611,0.00011134385,0.0012352193,0.00005138771,0.000085059226,0.0014362934,0.0003437514,0.00087927113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005285935,0.000017660152,0.00021265888,0.0000014186554,0.000036736048,0.00002403465,0.0039457274,0.069875225,0.00003399531,0.12232973,0.7194829,0.084034614],"study_design_scores_gemma":[0.00008332046,0.00005457474,0.0070365993,0.000021830823,0.0000022604254,0.0000061254173,0.00010009912,0.878326,0.000018799774,0.009090206,0.10511775,0.00014243457],"about_ca_topic_score_codex":0.00080013456,"about_ca_topic_score_gemma":0.000193766,"teacher_disagreement_score":0.88492554,"about_ca_system_score_codex":0.000013570516,"about_ca_system_score_gemma":0.00003267724,"threshold_uncertainty_score":0.9998987},"labels":[],"label_agreement":null},{"id":"W4384934796","doi":"10.1038/s41534-023-00742-4","title":"Evidence of Kardar-Parisi-Zhang scaling on a digital quantum simulator","year":2023,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Science Foundation Ireland","keywords":"Scaling; Exponent; Spin (aerodynamics); Physics; Statistical physics; Isotropy; Qubit; Quantum mechanics; Quantum; Mathematical physics; Mathematics","score_opus":0.024775385466158255,"score_gpt":0.2661896835567351,"score_spread":0.24141429809057685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384934796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79612815,0.000060480048,0.2012267,0.00071450026,0.00070369855,0.00022100259,0.000011679035,0.0006322112,0.00030160052],"genre_scores_gemma":[0.99855614,0.000028618546,0.0010528461,0.00021886776,0.00009134218,0.000007963431,0.000020014573,0.000010885709,0.000013310833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978258,0.000047294718,0.0006814566,0.00025684736,0.0007557012,0.00043286974],"domain_scores_gemma":[0.99818504,0.0005338324,0.0003624306,0.00061711867,0.00018530381,0.00011628916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064671336,0.00022252521,0.0002695799,0.00049281295,0.00021550087,0.00042959393,0.0008151873,0.00010326809,0.0000045149527],"category_scores_gemma":[0.00049996015,0.00019457829,0.00014383062,0.0013060772,0.00005229201,0.0028319615,0.00032955647,0.0002533171,0.0005698938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014291276,0.00010420027,0.0011347907,0.00042802704,0.000057979323,0.000023876097,0.010212563,0.48033658,0.0004653302,0.10674215,0.0021127097,0.39823887],"study_design_scores_gemma":[0.00024834496,0.000261996,0.0031735238,0.00047204812,0.0000039793226,0.000011737943,0.000113925555,0.9893608,0.0005528422,0.004115163,0.0014548149,0.00023079281],"about_ca_topic_score_codex":0.000018710763,"about_ca_topic_score_gemma":4.4085613e-7,"teacher_disagreement_score":0.50902426,"about_ca_system_score_codex":0.000045158584,"about_ca_system_score_gemma":0.0001004406,"threshold_uncertainty_score":0.7934672},"labels":[],"label_agreement":null},{"id":"W4385236030","doi":"10.1021/acs.jctc.3c00335","title":"Partitioning Quantum Chemistry Simulations with Clifford Circuits","year":2023,"lang":"en","type":"article","venue":"Journal of Chemical Theory and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Vector Institute; University of Toronto","funders":"Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; Los Alamos National Laboratory; National Nuclear Security Administration; Office of Science; Vector Institute; Canada Research Chairs; Google; Compute Canada; Canadian Institute for Advanced Research; Government of Canada; Department of Energy and Climate Change; U.S. Department of Energy","keywords":"Quantum chemistry; Computer science; Quantum; Chemistry; Electronic circuit; Quantum chemical; Nanotechnology; Computational chemistry; Chemical physics; Physics; Molecule; Materials science; Quantum mechanics; Organic chemistry","score_opus":0.012526565071857001,"score_gpt":0.2592058005996753,"score_spread":0.24667923552781829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385236030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5825269,0.000029924597,0.41704708,0.00023658416,0.000050914445,0.000019066483,6.121107e-7,0.000044238728,0.00004466979],"genre_scores_gemma":[0.995891,0.0000030870226,0.0038702425,0.00006973515,0.00014624589,5.330294e-7,0.0000034978038,0.000005974302,0.000009717621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921185,0.0000644648,0.00024866834,0.00013075417,0.00020494904,0.00013933226],"domain_scores_gemma":[0.99901277,0.0005009126,0.00020116291,0.000079260615,0.00012068903,0.00008521496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004671217,0.00008674544,0.00014013253,0.00006208658,0.0001012839,0.000098423814,0.00017292234,0.000040561754,0.0000031774696],"category_scores_gemma":[0.000079662335,0.000066413704,0.000044209726,0.00037109226,0.000052014744,0.00019271905,0.000054938067,0.00019358488,0.0000020669343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001453098,0.00017316043,0.00053319597,0.00014543522,0.00016701347,0.00015633156,0.0031807146,0.5316547,0.11062405,0.07987545,0.00032929468,0.27301535],"study_design_scores_gemma":[0.0004451294,0.0000836671,0.00044519996,0.000105569634,0.000012647393,0.00025404544,0.000045527377,0.77503884,0.011882133,0.21147558,0.00009233018,0.00011934053],"about_ca_topic_score_codex":1.7464126e-7,"about_ca_topic_score_gemma":1.3255614e-8,"teacher_disagreement_score":0.41336405,"about_ca_system_score_codex":0.000011523664,"about_ca_system_score_gemma":0.000039088027,"threshold_uncertainty_score":0.27082723},"labels":[],"label_agreement":null},{"id":"W4385253600","doi":"10.1137/22m1521262","title":"Irrational Quantum Walks","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Applied Algebra and Geometry","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Irrational number; Quantum walk; Random walk; Quantum; Mathematics; Computer science; Quantum mechanics; Physics; Quantum algorithm; Statistics; Geometry","score_opus":0.009593700666047388,"score_gpt":0.2306701473315459,"score_spread":0.2210764466654985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385253600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90972793,0.00026039672,0.0803247,0.0055623404,0.0012885662,0.00012975534,0.0000041699773,0.0004359322,0.0022662093],"genre_scores_gemma":[0.99318874,0.0001003114,0.0047054896,0.0012456081,0.00057905004,0.000003885895,0.0000043033974,0.000015681686,0.000156952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984442,0.000035958114,0.0002713532,0.00034824273,0.0004866654,0.00041358933],"domain_scores_gemma":[0.99915475,0.00019980513,0.00012015526,0.00024918138,0.00004067186,0.00023542457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005890997,0.00018658354,0.00019801018,0.00055000646,0.0005151364,0.00027933356,0.0005014404,0.00007919947,0.000029339462],"category_scores_gemma":[0.000030904772,0.00014624765,0.00007895184,0.0011556769,0.000048303038,0.00011789036,0.00021152927,0.0005756392,0.00024476426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023566532,0.00008734257,0.00022198842,0.000022858088,0.00006491982,0.00017466198,0.00055032026,0.0042141853,0.0012830598,0.63839704,0.01115005,0.34381],"study_design_scores_gemma":[0.0017381529,0.00057494885,0.059902277,0.00009926961,0.000014108693,0.0010490929,0.00017977004,0.40525758,0.00077172334,0.49829632,0.031206034,0.0009107083],"about_ca_topic_score_codex":5.6202776e-7,"about_ca_topic_score_gemma":1.6974604e-7,"teacher_disagreement_score":0.40104342,"about_ca_system_score_codex":0.000017751161,"about_ca_system_score_gemma":0.00005684434,"threshold_uncertainty_score":0.5963806},"labels":[],"label_agreement":null},{"id":"W4385256364","doi":"10.1103/physrevresearch.5.033049","title":"Improved quantum error correction with randomized compiling","year":2023,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Australian Research Council; Canada First Research Excellence Fund","keywords":"Computer science; Overhead (engineering); Error detection and correction; Noise (video); Fidelity; Computer engineering; Quantum computer; Fault tolerance; Reduction (mathematics); Code (set theory); Algorithm; Quantum error correction; Quantum noise; Rotation (mathematics); Quantum; Distributed computing; Mathematics; Telecommunications; Artificial intelligence; Set (abstract data type); Physics","score_opus":0.05685035018707226,"score_gpt":0.39752694021968366,"score_spread":0.3406765900326114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385256364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33092606,0.024331652,0.5893889,0.034996,0.0030309223,0.009227811,0.000008842371,0.004362274,0.0037275658],"genre_scores_gemma":[0.987774,0.004963101,0.004831202,0.00049205794,0.00071243,0.00040000715,0.0000157653,0.000051733783,0.00075967994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651843,0.0010600765,0.00027016003,0.00058050215,0.0009024346,0.0006684088],"domain_scores_gemma":[0.99631476,0.0024681645,0.000079910445,0.00065741764,0.00030653732,0.00017319912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036975183,0.00017838736,0.00067150465,0.00018082619,0.000359885,0.00015517649,0.0008925609,0.00002392982,0.0000053858566],"category_scores_gemma":[0.00090233894,0.00011122971,0.00020501092,0.0028112726,0.00022470196,0.0001460747,0.0004880296,0.0007760523,0.00028787498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028808594,0.0007735683,0.000027654512,0.0041480036,0.0002464667,0.00017562447,0.0019924825,0.0046891966,0.0049614483,0.073645085,0.026260573,0.880199],"study_design_scores_gemma":[0.004987536,0.00016247723,0.000039167862,0.0011177345,0.0000091494185,0.000011224201,0.000010199618,0.9849472,0.00023485521,0.0059663174,0.0023616822,0.00015243299],"about_ca_topic_score_codex":0.0000623237,"about_ca_topic_score_gemma":0.0000037839964,"teacher_disagreement_score":0.98025805,"about_ca_system_score_codex":0.000034699657,"about_ca_system_score_gemma":0.00013262591,"threshold_uncertainty_score":0.4535816},"labels":[],"label_agreement":null},{"id":"W4385273453","doi":"10.21203/rs.3.rs-3054054/v1","title":"A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Quantum; Generative grammar; Computer science; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.15271947638752442,"score_gpt":0.4434750441133343,"score_spread":0.2907555677258099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385273453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01343925,0.00045843865,0.9643023,0.016535427,0.001624826,0.0022616226,0.000152051,0.0010542077,0.00017187903],"genre_scores_gemma":[0.32913837,0.00019733772,0.6673397,0.00019563771,0.0019866556,0.00073321286,0.00011577461,0.0001668663,0.00012644181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98954904,0.0017516385,0.0010590606,0.002720822,0.0025519785,0.002367453],"domain_scores_gemma":[0.9858323,0.009665925,0.00043059926,0.0021532332,0.0012357921,0.00068219576],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0054283077,0.00079314667,0.0010240265,0.00085648365,0.0016373553,0.002059423,0.0025694002,0.0010863296,0.0000042087854],"category_scores_gemma":[0.005239829,0.0007202103,0.0006351525,0.0013710132,0.00040101339,0.00052451,0.0062103774,0.008063094,0.00006896192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007057332,0.0002876293,0.000033199718,0.0010845271,0.00016187702,0.00048377097,0.0029052494,0.17175215,0.00024801976,0.79254854,0.0030656515,0.027358815],"study_design_scores_gemma":[0.000214356,0.0002675766,0.000028338323,0.0014319557,0.000008983462,0.000018543693,0.0004381923,0.59719247,0.0001381841,0.39950648,0.00028073436,0.0004741521],"about_ca_topic_score_codex":0.000047047048,"about_ca_topic_score_gemma":0.000019528143,"teacher_disagreement_score":0.42544034,"about_ca_system_score_codex":0.00037173877,"about_ca_system_score_gemma":0.002326708,"threshold_uncertainty_score":0.9996624},"labels":[],"label_agreement":null},{"id":"W4385332781","doi":"10.1109/ims37964.2023.10188173","title":"A Quantum-Walk-Unitary HHL Matrix Equation Solver and Its Challenges in the NISQ Era","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Manitoba","funders":"","keywords":"Initialization; Quantum phase estimation algorithm; Quantum walk; Solver; Quantum circuit; Quantum algorithm; Computer science; Quantum computer; Hamiltonian (control theory); Unitary matrix; Quantum; Algorithm; Unitary state; Mathematics; Quantum error correction; Quantum mechanics; Physics; Mathematical optimization; Law","score_opus":0.055750613988083765,"score_gpt":0.2772949359147678,"score_spread":0.22154432192668402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385332781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8911257,0.004354858,0.04572939,0.055351432,0.0005019752,0.00043692114,0.000003023241,0.0006985208,0.0017981767],"genre_scores_gemma":[0.9945844,0.00046895773,0.0044563455,0.00029373742,0.000097005504,0.0000074593827,0.000002983742,0.000006567146,0.00008258131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988382,0.00013382916,0.00016170801,0.00032736233,0.00025789588,0.00028100662],"domain_scores_gemma":[0.9991708,0.00041650966,0.000036337296,0.00030871225,0.000026063482,0.00004157902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007304298,0.00012401199,0.000115888826,0.00017906948,0.00014368792,0.00011776288,0.00055125344,0.000049760973,0.0000064773567],"category_scores_gemma":[0.000041753283,0.00008043936,0.000033519158,0.0005646654,0.000018404528,0.00017818212,0.00020814883,0.00021642717,0.00007446924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067836863,0.00007972001,0.00029019348,0.00008686955,0.000021056218,0.00016671317,0.015770841,0.010374553,0.00015613278,0.5090783,0.0008768684,0.46309194],"study_design_scores_gemma":[0.0001696065,0.00006780185,0.02113052,0.000021635182,0.0000016915563,0.000028727576,0.00028618352,0.9536862,0.000023279972,0.02402672,0.00043770333,0.00011997814],"about_ca_topic_score_codex":0.000048806793,"about_ca_topic_score_gemma":0.00005054723,"teacher_disagreement_score":0.9433116,"about_ca_system_score_codex":0.0000062464264,"about_ca_system_score_gemma":0.000027369886,"threshold_uncertainty_score":0.32802218},"labels":[],"label_agreement":null},{"id":"W4385386787","doi":"10.18280/ria.370314","title":"Analysis of Existing Approaches and Algorithms of Post-Quantum Cryptography","year":2023,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cryptography; Computer science; Quantum cryptography; Algorithm; Theoretical computer science; Quantum; Quantum information; Physics; Quantum mechanics","score_opus":0.07343750975797499,"score_gpt":0.28565017987459246,"score_spread":0.21221267011661749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385386787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4114694,0.00026780408,0.5872947,0.00023957838,0.00011718144,0.00009305968,0.000011330998,0.00011353911,0.0003933958],"genre_scores_gemma":[0.97227144,0.000066253924,0.027548749,0.000018203818,0.000027463167,0.000004915691,0.000009621475,0.0000096453105,0.000043683198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983762,0.00007526135,0.0005483826,0.0004722406,0.00022830174,0.00029964568],"domain_scores_gemma":[0.99847823,0.0004496731,0.00025504403,0.0005876322,0.00015034639,0.00007908923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073239376,0.00015512742,0.0004264591,0.00091445184,0.00011791383,0.000049595787,0.0006134638,0.000060572584,0.0000082569895],"category_scores_gemma":[0.00013571187,0.00014237135,0.00023572173,0.005017489,0.0001924681,0.00010959079,0.00033441695,0.00013588925,0.000008655087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008262914,0.00014696221,0.002918267,0.00021824735,0.00042176497,0.000016605054,0.008814432,0.44459814,0.0049452344,0.09417652,0.000032860455,0.4437027],"study_design_scores_gemma":[0.000019670331,0.00010971706,0.0022222553,0.000054978875,0.00006363189,0.000005560769,0.00069123437,0.98358077,0.009954823,0.0030379489,0.00011338189,0.0001460501],"about_ca_topic_score_codex":0.000059397764,"about_ca_topic_score_gemma":0.0000035160328,"teacher_disagreement_score":0.56080204,"about_ca_system_score_codex":0.0000051256384,"about_ca_system_score_gemma":0.000023146149,"threshold_uncertainty_score":0.58057356},"labels":[],"label_agreement":null},{"id":"W4385438397","doi":"10.48550/arxiv.2307.15661","title":"Relaxations and Exact Solutions to Quantum Max Cut via the Algebraic Structure of Swap Operators","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; QuantERA; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Hamiltonian (control theory); Discrete mathematics; Pauli matrices; Bipartite graph; Eigenvalues and eigenvectors; Qubit; Combinatorics; Quantum; Graph; Quantum mechanics","score_opus":0.04307229187832901,"score_gpt":0.19472056583422542,"score_spread":0.15164827395589642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385438397","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56048524,0.000044384313,0.43739098,0.0010439511,0.00055403786,0.00025016957,0.00003778075,0.00016763603,0.00002581621],"genre_scores_gemma":[0.99731195,0.000042042357,0.0021073816,0.00011398523,0.00008066096,7.207103e-7,0.000010557481,0.000021444752,0.00031123502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982043,0.00017631946,0.00023266641,0.0008892968,0.00012599437,0.00037141168],"domain_scores_gemma":[0.99804157,0.00022750397,0.0002145977,0.0012054744,0.00014145109,0.00016939103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021446176,0.00028956635,0.0003029662,0.0003212786,0.00050098385,0.00012624363,0.0016681817,0.0001964264,0.000008459752],"category_scores_gemma":[0.00006743187,0.00024459697,0.00014597965,0.0010806605,0.0001367414,0.00012409105,0.0031648816,0.0006951292,0.000021203505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055639102,0.000028475122,0.00073538837,0.000046995887,0.00010040637,0.00004423095,0.001172172,0.8680988,0.00024651867,0.12811692,0.0006371215,0.00076739],"study_design_scores_gemma":[0.00013948194,0.000059745136,0.0063198004,0.00009114167,0.00004447515,0.00001173415,0.00007630311,0.92240906,0.00007785214,0.07026498,0.00020741698,0.00029800885],"about_ca_topic_score_codex":0.00039202766,"about_ca_topic_score_gemma":0.00022771662,"teacher_disagreement_score":0.43682674,"about_ca_system_score_codex":0.000078563935,"about_ca_system_score_gemma":0.00017968324,"threshold_uncertainty_score":0.9974375},"labels":[],"label_agreement":null},{"id":"W4385473885","doi":"10.48550/arxiv.2307.16034","title":"Simulation of quantum computation with magic states via Jordan-Wigner transformations","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; HORIZON EUROPE Framework Programme; Canada First Research Excellence Fund","keywords":"Polytope; MAGIC (telescope); Computation; Mathematics; Quantum computer; Qubit; Quantum; State (computer science); Quantum state; Discrete mathematics; Quantum mechanics; Algorithm; Physics","score_opus":0.04335373498090335,"score_gpt":0.20188933943300774,"score_spread":0.1585356044521044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385473885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26368225,0.000011602526,0.73537403,0.00012972044,0.00021939103,0.00022971617,0.000021534903,0.0002785318,0.000053196636],"genre_scores_gemma":[0.9923808,0.000020018648,0.0073364796,0.00002492928,0.000034440796,5.134389e-7,0.00008104836,0.000022516917,0.00009922654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984969,0.00012823365,0.00029216992,0.00064980844,0.00015937092,0.0002735122],"domain_scores_gemma":[0.9984248,0.00034779898,0.0003380944,0.00052837457,0.00026678893,0.00009409157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002075066,0.00027605792,0.00032131808,0.0004059553,0.00015631325,0.000085178006,0.000768017,0.00013897786,0.00000380443],"category_scores_gemma":[0.000011677633,0.0002671842,0.000142128,0.00089319237,0.00010025412,0.00028644176,0.0003791134,0.00040757636,0.000029133373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016010958,0.00005062383,0.00013162501,0.0001165654,0.00005866225,0.00003711102,0.0008923152,0.98750895,0.000005660036,0.00953205,0.000021170821,0.0016292626],"study_design_scores_gemma":[0.0003546817,0.000113142545,0.00076266733,0.00013256179,0.000041744654,0.0000024595158,0.000053441443,0.9112603,0.000029629153,0.08693982,0.000023237371,0.00028629645],"about_ca_topic_score_codex":0.00015766906,"about_ca_topic_score_gemma":0.000028354325,"teacher_disagreement_score":0.72869855,"about_ca_system_score_codex":0.000066699664,"about_ca_system_score_gemma":0.00012762,"threshold_uncertainty_score":0.99997807},"labels":[],"label_agreement":null},{"id":"W4385623761","doi":"10.20944/preprints202308.0529.v1","title":"On the Simplest Entangled Mixed States","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Quantum entanglement; Qubit; State (computer science); Cluster state; Rank (graph theory); W state; Quantum mechanics; Theoretical physics; Quantum state; Quantum; Physics; Computer science; Mathematics; Combinatorics; Algorithm","score_opus":0.10730315444323255,"score_gpt":0.32327955210402676,"score_spread":0.2159763976607942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385623761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9601615,0.00003939874,0.02299599,0.0109220855,0.0028664598,0.00066859403,0.00003259777,0.0013832642,0.0009300862],"genre_scores_gemma":[0.9960394,0.000049621634,0.0016175938,0.0007819002,0.00030412624,0.0001235507,0.000033563603,0.000060688206,0.0009895728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630195,0.00038777498,0.0005033277,0.0015227555,0.0006579961,0.0006262101],"domain_scores_gemma":[0.99502426,0.0011812327,0.00032941462,0.0031972085,0.00011037343,0.00015750121],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012981764,0.00049728766,0.00043074478,0.0001933691,0.00034938913,0.00020768755,0.0040895147,0.00022216453,0.00010818634],"category_scores_gemma":[0.00043333796,0.0003545809,0.0003142,0.00040084805,0.00011177158,0.000055917524,0.008877225,0.001609639,0.0033419698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009973026,0.0011474576,0.07677871,0.0006839394,0.0013617552,0.00078661996,0.021013103,0.6311191,0.002473918,0.20565875,0.017211117,0.041665804],"study_design_scores_gemma":[0.00037409962,0.00007042995,0.1404487,0.00049217494,0.000031040334,0.00002074419,0.00009432756,0.54303527,0.009005191,0.2981436,0.0072251926,0.0010592425],"about_ca_topic_score_codex":0.00019341228,"about_ca_topic_score_gemma":0.000023200093,"teacher_disagreement_score":0.092484824,"about_ca_system_score_codex":0.000089980895,"about_ca_system_score_gemma":0.00016298889,"threshold_uncertainty_score":0.9998906},"labels":[],"label_agreement":null},{"id":"W4385625257","doi":"10.1007/s10773-023-05439-0","title":"A Unification of the Coding Theory and OAQEC Perspectives on Hybrid Codes","year":2023,"lang":"en","type":"article","venue":"International Journal of Theoretical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum information; Computer science; Coding theory; Quantum error correction; Quantum convolutional code; Theoretical computer science; Quantum channel; Quantum; Mathematics; Algorithm; Quantum mechanics; Physics","score_opus":0.00844020645382342,"score_gpt":0.2629904519684299,"score_spread":0.2545502455146065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385625257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64792424,0.00003819819,0.34653258,0.004312665,0.0005880425,0.000041468462,0.0000063603866,0.000022002034,0.00053446175],"genre_scores_gemma":[0.998171,0.000029248116,0.0014581175,0.00010138317,0.00022538198,3.1198076e-7,3.022379e-7,0.00000435139,0.000009949617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990839,0.00015240374,0.00018294026,0.00010269473,0.00039959853,0.000078474244],"domain_scores_gemma":[0.9986739,0.0007126946,0.00019330547,0.00014334978,0.00024567364,0.000031073967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065625465,0.00006466102,0.000100068406,0.00006432784,0.0000516553,0.000058981866,0.0007731205,0.000013681142,0.0000027190308],"category_scores_gemma":[0.0003215304,0.000039667702,0.00009203951,0.0001513656,0.00029393987,0.00007957957,0.00019284604,0.0001804877,0.0000020343161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029094403,0.000039703722,0.000031521922,0.0000023747739,0.00004177091,0.000005780223,0.001257257,0.0017036379,0.001161072,0.9689448,0.000044215118,0.026738781],"study_design_scores_gemma":[0.00017114497,0.000075894895,0.0012570053,0.00009525127,0.0000064784617,0.000042526375,0.00020095214,0.10206907,0.008349313,0.88765055,0.00003301001,0.000048799728],"about_ca_topic_score_codex":4.0424138e-7,"about_ca_topic_score_gemma":1.6983218e-8,"teacher_disagreement_score":0.35024673,"about_ca_system_score_codex":0.000020548689,"about_ca_system_score_gemma":0.000032270174,"threshold_uncertainty_score":0.1617602},"labels":[],"label_agreement":null},{"id":"W4385714682","doi":"10.48550/arxiv.2308.04021","title":"Quantum resources in Harrow-Hassidim-Lloyd algorithm","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Department of Science and Technology, Ministry of Science and Technology, India; Harish-Chandra Research Institute","keywords":"Quantum entanglement; Multipartite; Multipartite entanglement; Bipartite graph; Algorithm; Coherence (philosophical gambling strategy); Quantum algorithm; Computer science; Quantum; Mathematics; Squashed entanglement; Statistical physics; Theoretical computer science; Quantum mechanics; Physics","score_opus":0.05568939247929661,"score_gpt":0.19402352673410078,"score_spread":0.13833413425480418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385714682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4181009,0.00013909368,0.57729936,0.0006878026,0.0019049997,0.00032152387,0.000031436895,0.0011339169,0.0003809723],"genre_scores_gemma":[0.9853017,0.00013934467,0.011988994,0.00013670583,0.00029127032,0.0000022132976,0.000019589706,0.00006171853,0.002058483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635816,0.00030335606,0.00038540974,0.0019536437,0.00021409754,0.0007853565],"domain_scores_gemma":[0.9973689,0.00027690563,0.00030962733,0.0016958527,0.00010200872,0.00024671396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006111302,0.00053207687,0.0005857509,0.0008337718,0.00023636871,0.00029995106,0.003369006,0.0004339244,0.000011089123],"category_scores_gemma":[0.000059439284,0.0005891311,0.00031868246,0.0015981849,0.0001526289,0.0002307463,0.0044522653,0.001522572,0.00021379712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001577175,0.00017053877,0.0017696124,0.000119410906,0.00009745784,0.0036139537,0.0015462084,0.94481015,0.000020478526,0.030797288,0.0012018007,0.01583732],"study_design_scores_gemma":[0.00042549262,0.000057147106,0.0036876467,0.00025671517,0.000017181845,0.000011250985,0.000075195356,0.92816937,0.000026927073,0.06518107,0.0014675076,0.0006245052],"about_ca_topic_score_codex":0.00082881143,"about_ca_topic_score_gemma":0.00012166038,"teacher_disagreement_score":0.5672008,"about_ca_system_score_codex":0.00020032062,"about_ca_system_score_gemma":0.00022450958,"threshold_uncertainty_score":0.999656},"labels":[],"label_agreement":null},{"id":"W4385802095","doi":"10.1145/3588983.3596680","title":"Efficient QAOA Optimization using Directed Restarts and Graph Lookup","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Research Council Canada; Pacific Northwest National Laboratory; Office of Science; Battelle; U.S. Department of Energy","keywords":"Computer science; Scalability; Parameterized complexity; Random graph; Theoretical computer science; Algorithm; Graph; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Mathematics; Artificial intelligence; Database","score_opus":0.01350811794924672,"score_gpt":0.23501539098464982,"score_spread":0.2215072730354031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385802095","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26113233,0.00003975835,0.737111,0.00040495262,0.00020821457,0.000066307155,4.272691e-7,0.0009020844,0.00013495832],"genre_scores_gemma":[0.32207686,0.000012843694,0.67758596,0.00014743807,0.000051364113,0.0000019141219,0.000002604246,0.000010925686,0.000110085675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990963,0.000046662088,0.00012421845,0.00033009623,0.00017077842,0.0002319938],"domain_scores_gemma":[0.9994951,0.000074104995,0.000037162165,0.00027987504,0.00003900688,0.000074757256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018796403,0.00009904249,0.00009408814,0.00021343515,0.00020500466,0.00015836883,0.0002551664,0.000033766057,0.0000025229135],"category_scores_gemma":[0.000023196433,0.00008232956,0.00002760641,0.0010548829,0.000026851412,0.000051633124,0.00031191373,0.00007284832,0.000006484446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.523495e-7,0.000009938814,0.000043775122,0.000004901801,0.000003931057,0.000012487377,0.00023661708,0.99171925,0.00013188558,0.001920973,0.000121957615,0.0057937214],"study_design_scores_gemma":[0.000117228745,0.000020991229,0.0010349026,0.000018464316,0.0000018528746,0.00001633987,0.000007396287,0.9979487,0.00012685647,0.000525165,0.00006648284,0.00011558882],"about_ca_topic_score_codex":0.000024751793,"about_ca_topic_score_gemma":0.0000012959946,"teacher_disagreement_score":0.06094453,"about_ca_system_score_codex":0.000009275191,"about_ca_system_score_gemma":0.000022063654,"threshold_uncertainty_score":0.33573022},"labels":[],"label_agreement":null},{"id":"W4385829557","doi":"10.1007/jhep08(2023)071","title":"Quantum error correction from complexity in Brownian SYK","year":2023,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Department of Atomic Energy, Government of India; Simons Foundation; U.S. Department of Energy","keywords":"Algorithm; Physics; Computer science","score_opus":0.02855659979200921,"score_gpt":0.25197833920853147,"score_spread":0.22342173941652227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385829557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42529875,0.0000402628,0.57075226,0.000754951,0.003024288,0.000014661575,0.000002972166,0.00007398671,0.00003786152],"genre_scores_gemma":[0.99096996,0.000022122033,0.007877754,0.00016406184,0.0008988112,6.853928e-7,0.000005024005,0.0000118086655,0.000049774455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870884,0.00011489935,0.00036950625,0.00019871537,0.00036005295,0.0002480077],"domain_scores_gemma":[0.99907506,0.00017297851,0.00031514943,0.00025615084,0.000094579795,0.0000860587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002083767,0.00013780019,0.00028725102,0.00016668144,0.00009351888,0.00008581217,0.0006246188,0.00005031136,0.0000032131004],"category_scores_gemma":[0.00002181057,0.00011684979,0.00012256768,0.0008900929,0.000041891577,0.00026015157,0.00016546242,0.00032127983,0.000011480881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005526308,0.0003864605,0.0010416666,0.0000129415785,0.00010790042,0.00047392232,0.0017519997,0.29121935,0.00093232485,0.3295881,0.011376212,0.36305386],"study_design_scores_gemma":[0.00033840997,0.000112926115,0.017743412,0.0000639472,0.0000043089135,0.000026005078,0.00002275268,0.63743013,0.0011037139,0.34229344,0.0007362137,0.00012471709],"about_ca_topic_score_codex":0.000801537,"about_ca_topic_score_gemma":0.00011158183,"teacher_disagreement_score":0.5656712,"about_ca_system_score_codex":0.00004990744,"about_ca_system_score_gemma":0.0000800071,"threshold_uncertainty_score":0.47649962},"labels":[],"label_agreement":null},{"id":"W4385879085","doi":"10.22331/q-2023-08-16-1086","title":"Assessment of various Hamiltonian partitionings for the electronic structure problem on a quantum computer using the Trotter approximation","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Hamiltonian (control theory); Unitary state; Qubit; Homogeneous space; Hamiltonian path problem; Mathematics; Quantum; Quantum computer; Computer science; Algorithm; Quantum mechanics; Hamiltonian path; Physics; Discrete mathematics; Mathematical optimization; Geometry","score_opus":0.016210389964438944,"score_gpt":0.27673845724535434,"score_spread":0.2605280672809154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385879085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20765622,0.000029485893,0.78612906,0.004771135,0.00045180434,0.00076048233,0.000013465695,0.00017573716,0.0000126222085],"genre_scores_gemma":[0.972195,0.0000052662726,0.026786804,0.0006360743,0.0002586841,0.00006142342,0.000013479606,0.000024796806,0.000018415518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980089,0.00015105127,0.00037206194,0.00044679188,0.00043473643,0.0005864477],"domain_scores_gemma":[0.99832666,0.0005559471,0.00027730875,0.0006881173,0.0001097597,0.000042235366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075003185,0.00022924662,0.00023881692,0.00012619123,0.00067633647,0.00023729952,0.0009461385,0.00007493451,0.0000038327257],"category_scores_gemma":[0.000017329747,0.0001291034,0.00015814506,0.0007238725,0.00009582013,0.00012193876,0.00020176725,0.00039218843,0.0000035625999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012119056,0.00007127407,0.00013322386,0.00008908908,0.0001083983,0.0000031504796,0.0019292465,0.31520912,0.0019022825,0.66377795,0.0014617523,0.015302433],"study_design_scores_gemma":[0.00031836063,0.00036356677,0.0051683085,0.000061218016,0.000020523432,0.000018636307,0.000030359437,0.93014985,0.00024498242,0.06161689,0.0018467658,0.00016053126],"about_ca_topic_score_codex":0.00003898261,"about_ca_topic_score_gemma":0.000009453585,"teacher_disagreement_score":0.7645388,"about_ca_system_score_codex":0.00006984274,"about_ca_system_score_gemma":0.00017784341,"threshold_uncertainty_score":0.5264684},"labels":[],"label_agreement":null},{"id":"W4385958524","doi":"10.48550/arxiv.2308.01068","title":"Neural network encoded variational quantum algorithms","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Parameterized complexity; Artificial neural network; Hamiltonian (control theory); Computer science; Quantum computer; Quantum; Quantum circuit; Ansatz; Ground state; Quantum machine learning; Algorithm; Quantum algorithm; Bethe ansatz; Artificial intelligence; Mathematical optimization; Quantum network; Mathematics; Quantum mechanics; Physics","score_opus":0.06197315344912986,"score_gpt":0.19793884711087015,"score_spread":0.13596569366174027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385958524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06371767,0.000063873435,0.9293344,0.000671098,0.0044387826,0.00026599693,0.000030301899,0.0012414864,0.0002363725],"genre_scores_gemma":[0.9676826,0.000055854114,0.029256651,0.0002455202,0.0012216306,0.000001921303,0.000068035915,0.00005313202,0.0014146381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679875,0.00026716845,0.00032284812,0.001644524,0.00022258444,0.0007441086],"domain_scores_gemma":[0.99751717,0.00036321068,0.00034041118,0.0013618168,0.00017052577,0.00024685825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005099652,0.00047498406,0.00045449665,0.00027254145,0.0004152967,0.0002835166,0.0028169148,0.00035663808,0.000017486534],"category_scores_gemma":[0.000046444973,0.0005254252,0.0003575443,0.0011832771,0.000099575176,0.00022050223,0.003968911,0.0011675338,0.00018328415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006810747,0.000036346428,0.00032524762,0.000024932258,0.00007489778,0.0003949777,0.00013560045,0.8730281,0.0000021482463,0.12342874,0.0013598775,0.0011823351],"study_design_scores_gemma":[0.0002556543,0.000044794564,0.002181772,0.00006611392,0.000027805701,0.000011867166,0.000008264525,0.8070519,0.0000028064253,0.18954645,0.00033599942,0.00046655556],"about_ca_topic_score_codex":0.00019191697,"about_ca_topic_score_gemma":0.00002058858,"teacher_disagreement_score":0.90396494,"about_ca_system_score_codex":0.00013001407,"about_ca_system_score_gemma":0.00028998288,"threshold_uncertainty_score":0.99971974},"labels":[],"label_agreement":null},{"id":"W4385986443","doi":"10.21203/rs.3.rs-3256699/v1","title":"Enabling Quantum Cybersecurity Analytics in Botnet Detection: Stable Architecture and Speed-up through Tree Algorithms","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Botnet; Algorithm; Quantum; Quantum computer; Quantum algorithm; Analytics; Process (computing); Speedup; Domain (mathematical analysis); Computer engineering; Theoretical computer science; Data mining; Parallel computing; Operating system; Mathematics","score_opus":0.07615622768589964,"score_gpt":0.35769218340236414,"score_spread":0.2815359557164645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385986443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36499733,0.0067452434,0.6098828,0.007283476,0.0046040663,0.003400877,0.00024678017,0.0020098467,0.0008295983],"genre_scores_gemma":[0.96987915,0.0017376236,0.025602257,0.0001017412,0.0015516346,0.00010298126,0.00008046242,0.00017458836,0.0007695865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916894,0.0011147202,0.00080481323,0.0023440276,0.0021318884,0.0019151377],"domain_scores_gemma":[0.99558103,0.001283662,0.0002315879,0.0020150554,0.00048833026,0.00040035768],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0038997969,0.0007008056,0.0009134372,0.0015400618,0.0007029661,0.0013659428,0.0023348362,0.00070005335,0.000011743643],"category_scores_gemma":[0.00066514197,0.00065965956,0.00027282696,0.0030839902,0.00037347633,0.00029412186,0.006958843,0.0062413556,0.000044011093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020437864,0.00077566615,0.0024667855,0.0060015903,0.0005295902,0.0033220616,0.043275915,0.39686766,0.0007548762,0.014890136,0.003082959,0.5278284],"study_design_scores_gemma":[0.0006183716,0.00028438825,0.0029715172,0.0009372044,0.000011299719,0.00006498461,0.00061480125,0.8746421,0.0004916915,0.115410954,0.0032381273,0.00071459985],"about_ca_topic_score_codex":0.0037913185,"about_ca_topic_score_gemma":0.0017853047,"teacher_disagreement_score":0.6048818,"about_ca_system_score_codex":0.00036071386,"about_ca_system_score_gemma":0.00063055346,"threshold_uncertainty_score":0.99967074},"labels":[],"label_agreement":null},{"id":"W4386044496","doi":"10.48550/arxiv.2308.08815","title":"Quantum Process Learning Through Neural Emulation","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Government of Canada; Croucher Foundation; National Natural Science Foundation of China; Basic and Applied Basic Research Foundation of Guangdong Province; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; John Templeton Foundation","keywords":"Emulation; Computer science; Artificial neural network; Quantum; Process (computing); Quantum state; Representation (politics); Action (physics); Artificial intelligence; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.07862816418234994,"score_gpt":0.22103569816265242,"score_spread":0.14240753398030248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386044496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4785317,0.00002448963,0.5190237,0.00022102465,0.0008588194,0.00014816373,0.0000026051837,0.0009758525,0.00021360628],"genre_scores_gemma":[0.9972368,0.000026303145,0.0015147136,0.000059277296,0.00019674406,7.660426e-7,0.000021641188,0.000033884662,0.0009098646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771607,0.00018174724,0.0002169423,0.0012797998,0.00015054483,0.00045488455],"domain_scores_gemma":[0.9985197,0.00015138481,0.00029447454,0.00078164676,0.00014733268,0.000105437466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022202022,0.00034579352,0.00032199756,0.00020734085,0.0003717759,0.00022298364,0.0016834401,0.00024880748,0.000005676178],"category_scores_gemma":[0.00006060562,0.0003793927,0.00020644085,0.00089292764,0.00007137751,0.00034636477,0.0018745953,0.0012178399,0.00009731437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006283322,0.000024487274,0.0010868312,0.00007763168,0.000030033752,0.00020547492,0.001030403,0.9724422,0.000005598194,0.024058744,0.00005006938,0.0009822241],"study_design_scores_gemma":[0.0001903711,0.000052930867,0.0015181311,0.0001004957,0.000019628309,0.0000065302693,0.00008129247,0.90161204,0.000017007194,0.09589051,0.00012316726,0.0003878976],"about_ca_topic_score_codex":0.0001706155,"about_ca_topic_score_gemma":0.00001055086,"teacher_disagreement_score":0.5187051,"about_ca_system_score_codex":0.00007614298,"about_ca_system_score_gemma":0.00013221322,"threshold_uncertainty_score":0.9998658},"labels":[],"label_agreement":null},{"id":"W4386067823","doi":"10.22331/q-2023-08-22-1089","title":"Concatenation Schemes for Topological Fault-tolerant Quantum Error Correction","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research; Army Research Office; Simons Foundation","keywords":"Algorithm; Concatenation (mathematics); Computer science; Artificial intelligence; Mathematics; Arithmetic","score_opus":0.032680698692485126,"score_gpt":0.2973353186096821,"score_spread":0.26465461991719696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386067823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41391972,0.00006847102,0.57595515,0.0037618317,0.004619416,0.0003248891,0.000007709634,0.0012684477,0.000074381016],"genre_scores_gemma":[0.9915486,0.000014565214,0.007069913,0.0003484564,0.00037095728,0.000069606605,0.00003502896,0.000021591177,0.00052131293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811137,0.00008822358,0.00033958515,0.00059959467,0.0003089598,0.0005522542],"domain_scores_gemma":[0.9988454,0.0003723484,0.000115719085,0.0004055497,0.00014689962,0.00011411003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054046063,0.00022027157,0.00026375696,0.00021294173,0.0004290203,0.00017089074,0.0006468689,0.00013733511,0.000009998334],"category_scores_gemma":[0.00023215348,0.0001795882,0.00016199864,0.00075894577,0.00007667867,0.00020409968,0.00019694945,0.00023185743,0.00016153693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008746164,0.00027109048,0.00036390094,0.00012971809,0.0000854201,0.00007967119,0.0022158786,0.024972878,0.0049303235,0.6087297,0.040982015,0.3171519],"study_design_scores_gemma":[0.00042278817,0.0002971507,0.0016682431,0.000028973862,0.000005950677,0.000030036996,0.0001094607,0.95031565,0.0010662725,0.021609165,0.024188632,0.00025765234],"about_ca_topic_score_codex":0.00003521807,"about_ca_topic_score_gemma":0.0000067952215,"teacher_disagreement_score":0.9253428,"about_ca_system_score_codex":0.000040259773,"about_ca_system_score_gemma":0.000061723884,"threshold_uncertainty_score":0.73233944},"labels":[],"label_agreement":null},{"id":"W4386093908","doi":"10.4204/eptcs.384.8","title":"Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Amplitude; Mathematics; Theoretical physics; Physics; Quantum mechanics","score_opus":0.008348149584011729,"score_gpt":0.24822842542809928,"score_spread":0.23988027584408755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386093908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053060804,0.00006800727,0.9416912,0.0037543266,0.00028309468,0.0005103309,0.0000041437866,0.00039244271,0.00023564491],"genre_scores_gemma":[0.96271354,0.000012661832,0.03643175,0.000504372,0.00021682591,0.00009325184,0.0000021997084,0.000016277756,0.000009134142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963939,0.000026866934,0.0003111269,0.0009625016,0.0008884933,0.0014170969],"domain_scores_gemma":[0.99781024,0.0012857945,0.00011516638,0.00039132172,0.0002750953,0.00012239942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029991488,0.00027732117,0.00026193197,0.0002860489,0.0009405402,0.00083031895,0.0032524636,0.000051422798,0.0000047751623],"category_scores_gemma":[0.00020923096,0.00017002379,0.00007472556,0.0033685942,0.001999138,0.00046904216,0.00082369096,0.00045031542,0.000010892968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027323093,0.000025047137,0.00018436456,0.000013521548,0.00001157273,0.0000019449274,0.0007178862,0.0019047629,0.0003560119,0.9793283,0.000031126914,0.017398177],"study_design_scores_gemma":[0.00026953395,0.00027486615,0.0016792272,0.000030232613,0.0000029855048,0.000019862893,0.000013100878,0.5278766,0.00022901027,0.46922645,0.00022148133,0.00015662657],"about_ca_topic_score_codex":0.0000037204572,"about_ca_topic_score_gemma":0.000003213456,"teacher_disagreement_score":0.9096527,"about_ca_system_score_codex":0.00014487049,"about_ca_system_score_gemma":0.00038044827,"threshold_uncertainty_score":0.8006785},"labels":[],"label_agreement":null},{"id":"W4386095693","doi":"10.4204/eptcs.384.7","title":"Generators and Relations for 3-Qubit Clifford+CS Operators","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Qubit; Physics; Quantum mechanics; Quantum","score_opus":0.0052980364038951455,"score_gpt":0.23948872887487338,"score_spread":0.23419069247097823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386095693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4981797,0.00007677256,0.4977654,0.0025327832,0.0003406522,0.00038140191,0.000001219554,0.0004237928,0.00029830102],"genre_scores_gemma":[0.91950035,0.00001790396,0.0798984,0.00033961146,0.00016874168,0.00004563859,8.977903e-7,0.000014622385,0.0000138460055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970579,0.00001841415,0.00031829075,0.0009764281,0.0004262576,0.0012027051],"domain_scores_gemma":[0.9990849,0.00022705799,0.000065513974,0.00024310073,0.00017061771,0.00020884332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021515817,0.00022195143,0.00022683787,0.00052213913,0.00068990135,0.0006101084,0.00150333,0.00007928288,0.0000025665267],"category_scores_gemma":[0.00020693315,0.0001908724,0.000055139935,0.003329821,0.000885838,0.0005482206,0.00085053284,0.00038673673,0.000013039263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038683584,0.000017925155,0.00029556514,0.000009821496,0.000003097757,0.0000017966927,0.00059628463,0.00068664714,0.00041142316,0.97211313,0.00014993185,0.0257105],"study_design_scores_gemma":[0.00025355516,0.0002403026,0.0008305272,0.000025253788,0.0000021123876,0.000025951385,0.0000092879445,0.7418909,0.0011138227,0.25494197,0.00046497383,0.00020135062],"about_ca_topic_score_codex":0.0000013152124,"about_ca_topic_score_gemma":8.5012965e-7,"teacher_disagreement_score":0.74120426,"about_ca_system_score_codex":0.00012515087,"about_ca_system_score_gemma":0.00027695176,"threshold_uncertainty_score":0.77835506},"labels":[],"label_agreement":null},{"id":"W4386168857","doi":"10.1103/physreva.108.022422","title":"Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods","year":2023,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Knud Højgaards Fond; Augustinus Fonden","keywords":"Quantum algorithm; Algorithm; Computer science; Quantum computer; Series (stratigraphy); Term (time); Domain (mathematical analysis); Operator (biology); Quantum; Field (mathematics); Quantum phase estimation algorithm; Applied mathematics; Mathematics; Quantum mechanics; Physics; Quantum error correction; Mathematical analysis","score_opus":0.023456336691213577,"score_gpt":0.3671616455634713,"score_spread":0.34370530887225775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386168857","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035640236,0.010628172,0.94313455,0.0072944327,0.00040098777,0.002368363,0.00005967209,0.0004335917,0.00003999818],"genre_scores_gemma":[0.13048868,0.01377536,0.8379152,0.014231068,0.0019040366,0.0011989168,0.0002245063,0.00021646864,0.00004577489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960668,0.0009191532,0.000634554,0.0010643608,0.0006426584,0.00067247567],"domain_scores_gemma":[0.9972118,0.0011378502,0.00037947437,0.00077427464,0.00025693164,0.00023965364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014110178,0.00054660253,0.0014356332,0.00007109783,0.0003870909,0.00026750672,0.0008186561,0.00004628189,0.000002992223],"category_scores_gemma":[0.00095348177,0.00040029048,0.00046332373,0.0009955696,0.00017881292,0.00024159644,0.00046774893,0.00032816705,0.00006362817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024119458,0.00052872865,0.0000032121973,0.0117189735,0.00013124941,0.00003582538,0.00039891398,0.0009455939,0.028839564,0.10429004,0.0012428174,0.851841],"study_design_scores_gemma":[0.00027929863,0.00049593183,0.00012399716,0.009431016,0.00012161552,0.000011644354,0.000002001262,0.9243635,0.01393006,0.046926554,0.0037808225,0.00053354964],"about_ca_topic_score_codex":0.000005203257,"about_ca_topic_score_gemma":7.3032126e-8,"teacher_disagreement_score":0.9234179,"about_ca_system_score_codex":0.000041690102,"about_ca_system_score_gemma":0.00014387362,"threshold_uncertainty_score":0.9998449},"labels":[],"label_agreement":null},{"id":"W4386228847","doi":"10.48550/arxiv.2308.13020","title":"Hamiltonian Learning via Shadow Tomography of Pseudo-Choi States","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Pacific Northwest National Laboratory; Office of Science; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; U.S. Department of Energy","keywords":"Hamiltonian (control theory); Mathematics; Combinatorics; Quadratic growth; Inverse; Mathematical physics; Algorithm; Geometry; Mathematical optimization","score_opus":0.03450884545381323,"score_gpt":0.18215165793924626,"score_spread":0.14764281248543304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386228847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43834725,0.000056639135,0.5597592,0.00013326443,0.00064028555,0.00016370452,0.000013470081,0.00064454175,0.00024161948],"genre_scores_gemma":[0.9913729,0.00012764244,0.007506533,0.000041055137,0.00008469405,6.207533e-7,0.000022905548,0.000035854748,0.00080781325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757767,0.00020439745,0.00030017566,0.0012425735,0.00016813085,0.0005070496],"domain_scores_gemma":[0.9978842,0.00023901043,0.00040682981,0.0011125572,0.00017310561,0.00018425443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036439748,0.00039259394,0.00048297294,0.0006763505,0.0002352998,0.000120525205,0.0022207128,0.00025636525,0.00001000186],"category_scores_gemma":[0.000031990447,0.00043358028,0.00040975318,0.0013790535,0.00016998003,0.00015101378,0.0029611224,0.0011248988,0.000049690323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009563727,0.00005553263,0.0061385143,0.00012912737,0.00012788438,0.0002504299,0.0006994937,0.9819775,0.00006472421,0.00675384,0.00012331213,0.003670062],"study_design_scores_gemma":[0.00023969576,0.00010438624,0.0059466,0.0001929281,0.000033461914,0.0000057806287,0.000049948536,0.9432682,0.00011572472,0.049359296,0.0002524289,0.00043155928],"about_ca_topic_score_codex":0.00059276697,"about_ca_topic_score_gemma":0.000053331827,"teacher_disagreement_score":0.5530256,"about_ca_system_score_codex":0.0000548904,"about_ca_system_score_gemma":0.00012230192,"threshold_uncertainty_score":0.9998116},"labels":[],"label_agreement":null},{"id":"W4386232364","doi":"10.1109/ojcoms.2023.3309268","title":"Quantum Machine Learning for Next-G Wireless Communications: Fundamentals and the Path Ahead","year":2023,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Wireless; Quantum machine learning; Software deployment; Perspective (graphical); Quantum; Artificial intelligence; Quantum computer; Computer engineering; Telecommunications; Software engineering","score_opus":0.06784361100376576,"score_gpt":0.32912547661530117,"score_spread":0.26128186561153544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386232364","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15585181,0.020057919,0.26538336,0.55240196,0.0019158802,0.003474519,0.00004911861,0.00026964018,0.0005957965],"genre_scores_gemma":[0.91337353,0.00646449,0.078688875,0.0010947266,0.000062628365,0.000046592722,0.0000049683517,0.000019740486,0.00024444197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980484,0.00088096637,0.0004892082,0.00013904087,0.0002310859,0.00021128154],"domain_scores_gemma":[0.99412745,0.0023025554,0.00064434914,0.0026563024,0.00020784057,0.00006150094],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0038426793,0.0001328412,0.0002771639,0.00003524407,0.0027052038,0.0007871996,0.012774736,0.000047424237,9.3288196e-7],"category_scores_gemma":[0.00013821476,0.00007539878,0.0003219368,0.0006338196,0.0006213316,0.00038858995,0.0053105275,0.00080747437,0.0000030801236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018132519,0.0009185678,0.002841638,0.00017184451,0.0016864305,0.000002449723,0.10285306,0.021988181,0.0043654777,0.36693004,0.05768833,0.44037268],"study_design_scores_gemma":[0.0011865009,0.000054799137,0.00041669945,0.00013689291,0.000030838062,0.000054038694,0.0009660852,0.95304203,0.000040793024,0.014163273,0.029802611,0.00010542511],"about_ca_topic_score_codex":0.00006913906,"about_ca_topic_score_gemma":0.00001668531,"teacher_disagreement_score":0.9310539,"about_ca_system_score_codex":0.00004462397,"about_ca_system_score_gemma":0.00013267297,"threshold_uncertainty_score":0.99859315},"labels":[],"label_agreement":null},{"id":"W4386243800","doi":"10.1088/2058-9565/acf4ba","title":"Boosting quantum amplitude exponentially in variational quantum algorithms","year":2023,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Algorithm; Ground state; Quantum algorithm; Quantum computer; Computer science; Quantum; Physics; Quantum mechanics","score_opus":0.01482822204987427,"score_gpt":0.2597515473786568,"score_spread":0.24492332532878253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386243800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.834118,0.00025501015,0.14913137,0.013014549,0.0012771576,0.00032034735,0.000006396633,0.0017359264,0.00014124911],"genre_scores_gemma":[0.9786788,0.000060833187,0.020875465,0.0002067656,0.00009164696,0.00003738851,0.0000040239115,0.000018842597,0.000026236905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585634,0.00006550415,0.0005581825,0.0013224806,0.0009476056,0.0012498988],"domain_scores_gemma":[0.998262,0.0002742672,0.0001918739,0.0008025635,0.00029118985,0.00017812084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002544062,0.00030953405,0.00037807794,0.0025532672,0.0008123672,0.00039310168,0.002234353,0.00021119202,0.0000051043185],"category_scores_gemma":[0.00074856484,0.00028700716,0.000049828042,0.009560894,0.0009597226,0.0006740641,0.0015515516,0.00057258236,0.0000911968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040619266,0.00008158474,0.0021773677,0.000019046536,0.000008762879,0.00017426084,0.00065297086,0.0005593229,0.015868396,0.92368525,0.00015636053,0.056612622],"study_design_scores_gemma":[0.0003395984,0.00015777191,0.011580816,0.000051349612,0.0000025718296,0.00012774281,0.00015370858,0.80677235,0.00064713333,0.17903715,0.0008121724,0.00031761738],"about_ca_topic_score_codex":0.00010925261,"about_ca_topic_score_gemma":0.000014994556,"teacher_disagreement_score":0.806213,"about_ca_system_score_codex":0.00008844656,"about_ca_system_score_gemma":0.0005484207,"threshold_uncertainty_score":0.9999582},"labels":[],"label_agreement":null},{"id":"W4386254860","doi":"10.22331/q-2023-08-29-1093","title":"Local Probabilistic Decoding of a Quantum Code","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Moonshot Research and Development Program; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Okinawa Institute of Science and Technology Graduate University; Government of Canada; Ministry of Colleges and Universities","keywords":"Algorithm; Computer science; Artificial intelligence","score_opus":0.021842613966882887,"score_gpt":0.2639806393989564,"score_spread":0.2421380254320735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386254860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27346608,0.00008074453,0.723613,0.0010984134,0.0006990935,0.00015285464,0.000008617096,0.0006716236,0.00020954688],"genre_scores_gemma":[0.992395,0.000011058934,0.007318119,0.000106506246,0.000071471586,0.00001038554,0.000004617022,0.000019999561,0.00006288692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980984,0.00009355698,0.0004039185,0.0004929072,0.0003928742,0.00051836134],"domain_scores_gemma":[0.99861825,0.00035757117,0.00014561342,0.00066503225,0.00008810206,0.00012543492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005766595,0.00019356688,0.00030285912,0.00024194553,0.00015770525,0.000069883565,0.001011714,0.00007519958,0.000008411206],"category_scores_gemma":[0.00015295454,0.00016800307,0.00012865626,0.001255247,0.00013997532,0.00012565688,0.0004414099,0.0002206435,0.00015912837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016973032,0.00015487467,0.00035566866,0.00025043517,0.00004810666,0.00016321997,0.0021146466,0.06831062,0.0018412925,0.8320086,0.0056559755,0.08907961],"study_design_scores_gemma":[0.00020595928,0.00015227264,0.0012551929,0.00008375584,0.00000506009,0.000028578366,0.000049657465,0.93518525,0.0006062484,0.06080316,0.0014279335,0.00019691023],"about_ca_topic_score_codex":0.000030978026,"about_ca_topic_score_gemma":0.0000057789825,"teacher_disagreement_score":0.86687464,"about_ca_system_score_codex":0.000027955813,"about_ca_system_score_gemma":0.000110239496,"threshold_uncertainty_score":0.6850966},"labels":[],"label_agreement":null},{"id":"W4386294146","doi":"10.21203/rs.3.rs-3259186/v1","title":"Parameterized complexity of reconfiguration of atoms","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Control reconfiguration; Computer science; Combinatorics; Grid; Discrete mathematics; Mathematics; Geometry","score_opus":0.17662623872122302,"score_gpt":0.3978486303277462,"score_spread":0.22122239160652318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386294146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7716249,0.0002787151,0.222514,0.002319334,0.00084895553,0.0012505958,0.00019594475,0.00036814492,0.00059937034],"genre_scores_gemma":[0.9475262,0.00006770673,0.052055676,0.0000064998035,0.000109982364,0.0000379362,0.000058739883,0.00002410978,0.000113124705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961473,0.00081997865,0.000618637,0.0006879708,0.0012573726,0.00046874842],"domain_scores_gemma":[0.996456,0.0008009556,0.00033617238,0.0014840624,0.00080655614,0.000116215706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025025024,0.00020153286,0.0005634269,0.00061119825,0.00012107281,0.00011968041,0.0019047948,0.00023054091,0.000017818013],"category_scores_gemma":[0.0004902636,0.00018210972,0.0002442452,0.0009192517,0.00044504873,0.00006622712,0.002784781,0.0011609887,0.000026436343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038652023,0.0017356736,0.003190546,0.024262333,0.00095647643,0.00025546923,0.020154547,0.048252374,0.027181886,0.39009026,0.0076795,0.47585443],"study_design_scores_gemma":[0.00029408588,0.00034154902,0.012214367,0.0012780435,0.000004413496,0.0000042169445,0.000059137492,0.7409151,0.009164565,0.23526682,0.00022278925,0.00023492247],"about_ca_topic_score_codex":0.00057137694,"about_ca_topic_score_gemma":0.000023208255,"teacher_disagreement_score":0.6926627,"about_ca_system_score_codex":0.00005320429,"about_ca_system_score_gemma":0.00041072123,"threshold_uncertainty_score":0.7426219},"labels":[],"label_agreement":null},{"id":"W4386325618","doi":"10.1103/physrevresearch.5.033144","title":"Graph-theoretic characterization of unextendible product bases","year":2023,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"National Key Research and Development Program of China; Hong Kong Research Institute of Textiles and Apparel; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China; Government of Canada; Innovation, Science and Economic Development Canada; John Templeton Foundation","keywords":"Multipartite; Constructive; Orthogonality; Mathematics; Characterization (materials science); Combinatorics; Product (mathematics); Graph; Quantum nonlocality; Quantum entanglement; Limit (mathematics); Quantum; Discrete mathematics; Computer science; Quantum mechanics","score_opus":0.05328189835573317,"score_gpt":0.388381218051463,"score_spread":0.3350993196957298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386325618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9424724,0.007974846,0.025953805,0.018429628,0.0004248706,0.002124132,0.000025920624,0.0008196419,0.0017747702],"genre_scores_gemma":[0.9878971,0.010287393,0.0010354844,0.00015620318,0.00030430913,0.00007026987,0.000030971707,0.00001980781,0.00019844098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977964,0.00042122274,0.00020608609,0.00040624285,0.00076827843,0.00040172695],"domain_scores_gemma":[0.99856967,0.0003638559,0.00006201843,0.00066708983,0.00024762482,0.00008971398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001498533,0.00010151378,0.0002728171,0.00021031081,0.00012864436,0.000047618716,0.0008388025,0.00001102924,0.0000096215435],"category_scores_gemma":[0.0004489576,0.00007497105,0.00011197338,0.003777423,0.00015013517,0.00009711725,0.00046424032,0.00027520143,0.00017679173],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051939883,0.00031927112,0.00006552412,0.0043796324,0.000023369455,0.000024127528,0.00038843777,0.00009083271,0.0807519,0.23042458,0.0017000466,0.68182707],"study_design_scores_gemma":[0.0003203745,0.00068604597,0.015264949,0.006926467,0.00002084421,0.000018415973,0.000008179298,0.6528344,0.062676504,0.22521262,0.03542848,0.00060273655],"about_ca_topic_score_codex":0.000009354928,"about_ca_topic_score_gemma":2.2566746e-7,"teacher_disagreement_score":0.68122435,"about_ca_system_score_codex":0.000009879369,"about_ca_system_score_gemma":0.00007428462,"threshold_uncertainty_score":0.30572307},"labels":[],"label_agreement":null},{"id":"W4386361403","doi":"10.1109/nano58406.2023.10231308","title":"Quantized Simulated Bifurcation for the Ising Model","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Discretization; Quantization (signal processing); Ising model; Speedup; Algorithm; Mathematics; Applied mathematics; Parallel computing; Statistical physics; Physics; Mathematical analysis","score_opus":0.03530754186963664,"score_gpt":0.2929318305916747,"score_spread":0.2576242887220381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386361403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033444393,0.000022618362,0.9596016,0.005709306,0.00023279637,0.00018645357,9.4894096e-7,0.00069111906,0.00011077139],"genre_scores_gemma":[0.9035247,0.0000049266328,0.095124535,0.0004980596,0.00007028523,0.0000063155017,0.0000032706232,0.000009164531,0.0007587464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993195,0.000016774155,0.00011960675,0.000210647,0.00012653274,0.00020694615],"domain_scores_gemma":[0.99907327,0.00047205543,0.00003493714,0.00034017075,0.00005291064,0.000026680318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003491555,0.00007316361,0.00007066403,0.00006896738,0.00030781707,0.0001421171,0.00051055383,0.000027132179,0.00000125806],"category_scores_gemma":[0.00005217812,0.000043672084,0.00006114058,0.000557853,0.000014829513,0.00008061513,0.00013657713,0.000062649975,0.000028086411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018319199,0.0000048129004,0.0000031325415,0.0000031613083,0.000006218615,3.2275372e-7,0.00034030413,0.9194633,0.00045571855,0.02368708,0.0010551404,0.054979026],"study_design_scores_gemma":[0.00019523497,0.000015292575,0.00011044335,0.000005451891,0.0000025925674,0.0000012115656,0.000011256613,0.9807619,0.00035710545,0.017654369,0.0008123294,0.00007283691],"about_ca_topic_score_codex":0.000012772927,"about_ca_topic_score_gemma":0.0000015247456,"teacher_disagreement_score":0.8700803,"about_ca_system_score_codex":0.000006540201,"about_ca_system_score_gemma":0.00003167324,"threshold_uncertainty_score":0.23675112},"labels":[],"label_agreement":null},{"id":"W4386525435","doi":"10.1103/prxquantum.4.030334","title":"Holographic Quantum Simulation of Entanglement Renormalization Circuits","year":2023,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Canada First Research Excellence Fund; Alfred P. Sloan Foundation; U.S. Department of Energy; U.S. Department of Defense","keywords":"Ansatz; Qubit; Quantum entanglement; Quantum computer; Physics; Statistical physics; Quantum mechanics; Renormalization; Matrix product state; Quantum information; Quantum; Theoretical physics; Computer science","score_opus":0.022781372917126147,"score_gpt":0.2714326516590199,"score_spread":0.24865127874189377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386525435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4620429,0.00010364693,0.5356288,0.00048819778,0.0007532827,0.00022024795,0.0000069204675,0.0006049003,0.00015108983],"genre_scores_gemma":[0.9987069,0.000036069134,0.001009013,0.00008634571,0.00008236214,0.000009662258,0.000028334569,0.000015910404,0.00002542037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981956,0.0001291714,0.0004389671,0.00041220913,0.00044223628,0.00038185006],"domain_scores_gemma":[0.99883914,0.00020113093,0.00022794209,0.000528855,0.00012405755,0.00007890244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062111614,0.00016852717,0.00021437694,0.00045070727,0.00016446337,0.00006592986,0.0006175599,0.00007334266,0.000009853482],"category_scores_gemma":[0.000085768224,0.00015709667,0.000108852095,0.0018713544,0.000051182673,0.00021380023,0.00025667957,0.00013206314,0.000048651727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000809595,0.00017457159,0.005581305,0.00014171102,0.000057893034,0.000039145423,0.002844319,0.769711,0.003501368,0.14694344,0.0008734913,0.07012362],"study_design_scores_gemma":[0.00026091954,0.00015826212,0.015050145,0.000047454796,0.0000069600032,0.00000539576,0.000027498094,0.9625168,0.0005294383,0.020094521,0.0011267381,0.00017589824],"about_ca_topic_score_codex":0.000020963711,"about_ca_topic_score_gemma":0.0000026542773,"teacher_disagreement_score":0.53666395,"about_ca_system_score_codex":0.000017758264,"about_ca_system_score_gemma":0.000041986834,"threshold_uncertainty_score":0.64062166},"labels":[],"label_agreement":null},{"id":"W4386605192","doi":"10.12688/f1000research.140027.1","title":"Quantum data communication protection with the quantum permutation pad block cipher in counter mode and Clifford operators","year":2023,"lang":"en","type":"preprint","venue":"F1000Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Block cipher; Encryption; Computer science; Mathematics; Theoretical computer science; Computer network","score_opus":0.08242994948437626,"score_gpt":0.34552179660743954,"score_spread":0.26309184712306327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386605192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73978317,0.00058307406,0.22532608,0.03043252,0.00038752164,0.002830163,0.00011814837,0.00048186773,0.000057476245],"genre_scores_gemma":[0.9929733,0.0002865055,0.0056610596,0.00011963442,0.00014329376,0.0003209168,0.00021246269,0.00006956034,0.00021323611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995988,0.00093807006,0.00040105174,0.0011542918,0.0009711266,0.00054743927],"domain_scores_gemma":[0.9957899,0.0003984139,0.00017335729,0.0032494804,0.0002835584,0.00010533015],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002693971,0.00032919474,0.00032053638,0.00035863716,0.000532808,0.001052401,0.0040842406,0.00022742532,0.0000035161547],"category_scores_gemma":[0.00015296559,0.00022061632,0.00003440339,0.00081847335,0.0002872046,0.0003504583,0.0076845363,0.0021986668,0.000025440342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057620404,0.0008954248,0.0060730227,0.00199669,0.0005322239,0.00028913512,0.044748317,0.71683306,0.0018487643,0.028658226,0.022419281,0.17512967],"study_design_scores_gemma":[0.0003195689,0.00013598923,0.007316787,0.00034876858,0.000007648602,0.000024462623,0.000247514,0.98389125,0.000049753733,0.0061142286,0.0012581896,0.0002858237],"about_ca_topic_score_codex":0.0028679972,"about_ca_topic_score_gemma":0.001291383,"teacher_disagreement_score":0.26705822,"about_ca_system_score_codex":0.00010728017,"about_ca_system_score_gemma":0.00037349528,"threshold_uncertainty_score":0.9999846},"labels":[],"label_agreement":null},{"id":"W4386753310","doi":"10.1016/j.mex.2023.102366","title":"Quantum AI and hybrid simulators for a Universal Quantum Field Computation Model","year":2023,"lang":"en","type":"review","venue":"MethodsX","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Victoria","keywords":"Qubit; Quantum computer; Quantum; Statistical physics; Physics; Quantum state; Field (mathematics); Quantum information; Quantum mechanics; Quantum system; Computer science; Mathematics","score_opus":0.08387319525781128,"score_gpt":0.3971229363669124,"score_spread":0.31324974110910114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386753310","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000074370464,0.31745023,0.6808535,0.00018175281,0.00060025277,0.0005422589,0.00003055368,0.00032671873,0.000007338951],"genre_scores_gemma":[0.000019801862,0.44510713,0.554069,0.0002782967,0.00024079719,0.000042971253,0.000034426495,0.00008950536,0.000118108954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972159,0.00044632374,0.0005882024,0.000979386,0.00026849788,0.00050164614],"domain_scores_gemma":[0.9957657,0.0030522456,0.000342302,0.00053600204,0.00009634709,0.00020739732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011630801,0.0005149434,0.0013831954,0.00042118225,0.0002843092,0.00024222479,0.00086338574,0.00023367176,7.225068e-7],"category_scores_gemma":[0.0003799176,0.0004380144,0.00047327357,0.0005632851,0.000061500505,0.00015216284,0.00056661834,0.00056645536,0.000009094263],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026150665,0.000014822793,7.3038706e-8,0.003207214,0.000071806884,0.000017623079,0.00017046489,0.018227605,1.3601914e-7,0.014347831,0.0006835117,0.9632563],"study_design_scores_gemma":[0.00016790521,0.00012513087,1.2983092e-7,0.0015365618,0.00012568528,0.000031957145,0.0000032287917,0.82249254,0.0000011579966,0.04259156,0.13251103,0.00041312017],"about_ca_topic_score_codex":0.00002525013,"about_ca_topic_score_gemma":8.8645515e-7,"teacher_disagreement_score":0.9628432,"about_ca_system_score_codex":0.00005347363,"about_ca_system_score_gemma":0.00036484594,"threshold_uncertainty_score":0.9998072},"labels":[],"label_agreement":null},{"id":"W4386801698","doi":"10.1021/acs.jctc.3c00712","title":"Growth Reduction of Similarity-Transformed Electronic Hamiltonians in Qubit Space","year":2023,"lang":"en","type":"article","venue":"Journal of Chemical Theory and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Hamiltonian (control theory); Qubit; Ansatz; Coupled cluster; Pauli exclusion principle; Quantum; Computer science; Statistical physics; Topology (electrical circuits); Quantum mechanics; Applied mathematics; Physics; Mathematics; Mathematical optimization","score_opus":0.006419440866765548,"score_gpt":0.24474529539661796,"score_spread":0.23832585452985242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386801698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7667349,0.000097629454,0.23211418,0.00084749196,0.00009990699,0.00004098404,3.486849e-7,0.000022534496,0.000042027386],"genre_scores_gemma":[0.99562633,0.000056707733,0.004205111,0.000028840097,0.00007150215,5.367873e-7,0.0000010082103,0.00000478531,0.000005165434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990382,0.00013649932,0.0003304304,0.00012446502,0.00019305917,0.0001773433],"domain_scores_gemma":[0.9993443,0.00026790425,0.00018456807,0.00006120729,0.00009367666,0.000048374826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010848927,0.00008292351,0.00019165849,0.00020799313,0.000030593004,0.000026535792,0.00019384663,0.00005578905,7.361798e-7],"category_scores_gemma":[0.00007252394,0.00007069784,0.00006719644,0.0005610592,0.00005271102,0.00017537661,0.000038706312,0.00030114394,6.175407e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006347577,0.00035315406,0.00031161305,0.00027660598,0.00012748865,0.00006860417,0.0110631585,0.053368,0.28178376,0.40350103,0.00022380671,0.24828802],"study_design_scores_gemma":[0.0007753907,0.00025649488,0.0010535592,0.00012803747,0.0000110166075,0.00024744254,0.000103234146,0.21725763,0.066158764,0.7138444,0.0000375303,0.00012650278],"about_ca_topic_score_codex":0.0000019466627,"about_ca_topic_score_gemma":1.875017e-7,"teacher_disagreement_score":0.31034335,"about_ca_system_score_codex":0.000028461298,"about_ca_system_score_gemma":0.00006745717,"threshold_uncertainty_score":0.2882974},"labels":[],"label_agreement":null},{"id":"W4386836710","doi":"10.3389/fcomp.2023.1238988","title":"Tutorial: calibration refinement in quantum annealing","year":2023,"lang":"en","type":"article","venue":"Frontiers in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; Ising model; Quantum annealing; Homogeneous space; Quantum; Quantum computer; Theoretical computer science; Qubit; Algorithm; Exploit; Statistical physics; Physics; Mathematics; Quantum mechanics","score_opus":0.011732253197243673,"score_gpt":0.24334292560561838,"score_spread":0.2316106724083747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386836710","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1389146,0.000061781284,0.8500098,0.001531544,0.00897383,0.00015647299,8.4863944e-7,0.00031895505,0.000032144588],"genre_scores_gemma":[0.4972246,0.000021214328,0.50195956,0.00032861548,0.00041792952,0.000014908851,0.000003041199,0.000011851392,0.000018261862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972556,0.00009300124,0.00041100458,0.0008699202,0.0006429011,0.000727532],"domain_scores_gemma":[0.999052,0.00006949328,0.00009113797,0.00061823154,0.000050831266,0.000118325894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018419864,0.00017868936,0.00023704363,0.0011983698,0.00021728265,0.0004083299,0.001887539,0.000056130273,8.0724163e-7],"category_scores_gemma":[0.000052359228,0.00017119832,0.00004382348,0.0056995326,0.00016299903,0.0007086382,0.0008403389,0.00025887362,0.000009779238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005573397,0.000054939777,0.009660108,0.000019826388,0.0000032061564,0.00013927753,0.0027128828,0.63994926,0.00025256444,0.0064424095,0.0051735244,0.33558646],"study_design_scores_gemma":[0.00031198293,0.00006282209,0.011827265,0.00006596933,4.5973928e-7,0.0000056191234,0.0000150017595,0.97776634,0.00020233249,0.008695287,0.0008360639,0.00021085786],"about_ca_topic_score_codex":0.00007394655,"about_ca_topic_score_gemma":0.000010025155,"teacher_disagreement_score":0.35831,"about_ca_system_score_codex":0.00015491614,"about_ca_system_score_gemma":0.00023361317,"threshold_uncertainty_score":0.6981265},"labels":[],"label_agreement":null},{"id":"W4386875658","doi":"10.48550/arxiv.2309.09350","title":"Efficient Quantum Algorithm for All Quantum Wavelet Transforms","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Advanced Research Projects Agency; Defense Advanced Research Projects Agency","keywords":"Quantum Fourier transform; Wavelet packet decomposition; Wavelet; Wavelet transform; Algorithm; Discrete wavelet transform; Stationary wavelet transform; Harmonic wavelet transform; Second-generation wavelet transform; Quantum algorithm; Quantum phase estimation algorithm; Mathematics; Lifting scheme; Computer science; Cascade algorithm; Quantum error correction; Quantum; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.05828914953161346,"score_gpt":0.20896358467449228,"score_spread":0.15067443514287882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386875658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1273287,0.00006467634,0.86708224,0.00059971365,0.0026666392,0.00085420546,0.00017354701,0.0011589583,0.00007133845],"genre_scores_gemma":[0.94933486,0.0001181465,0.04836836,0.00028223186,0.0004913446,0.000012429739,0.00013067109,0.0001319022,0.0011300463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958361,0.00013377496,0.00046727937,0.0022143417,0.00024846708,0.00110003],"domain_scores_gemma":[0.997034,0.00038912296,0.00033345295,0.0016469412,0.00023154805,0.00036489533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000708753,0.0007093482,0.00072109123,0.00054717826,0.00039560389,0.00026766726,0.0031846508,0.00049900584,0.0000065476097],"category_scores_gemma":[0.00003729571,0.00071395515,0.00075805315,0.0008684939,0.00015326928,0.00010097293,0.0017478883,0.0010393478,0.000116655705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018615316,0.00016790444,0.000007985565,0.00015789004,0.0001917441,0.00033076407,0.00085681275,0.8953278,0.000017806902,0.084780306,0.00071352953,0.017428806],"study_design_scores_gemma":[0.0007960054,0.00018465446,0.00009810275,0.00015428448,0.00007635885,0.00001373436,0.00007435333,0.91389763,0.000059722675,0.082170956,0.001636308,0.0008378917],"about_ca_topic_score_codex":0.00016577703,"about_ca_topic_score_gemma":0.000016964494,"teacher_disagreement_score":0.82200617,"about_ca_system_score_codex":0.0002062087,"about_ca_system_score_gemma":0.0003125266,"threshold_uncertainty_score":0.99953115},"labels":[],"label_agreement":null},{"id":"W4386876363","doi":"10.48550/arxiv.2309.09956","title":"Small k-pairable states","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"QuantERA; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Qubit; Graph; Quantum; Physics; Quantum mechanics","score_opus":0.08340267747367182,"score_gpt":0.18151335364025653,"score_spread":0.09811067616658471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386876363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28682858,0.000054788605,0.7094282,0.00040232352,0.0012436414,0.00017837182,0.000018754874,0.0013422312,0.0005031016],"genre_scores_gemma":[0.9775326,0.0001759156,0.0143927075,0.00018752109,0.00020428239,9.334525e-7,0.00003389733,0.00004671143,0.0074253967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977611,0.00012737258,0.00018851734,0.0013076193,0.000091243935,0.0005241869],"domain_scores_gemma":[0.9979575,0.00019045382,0.00018531042,0.00137088,0.00010847342,0.00018733792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030829562,0.0003449799,0.00033113704,0.00029692677,0.000226234,0.0002282553,0.0025422291,0.00022926042,0.000009705092],"category_scores_gemma":[0.000026929925,0.0003743532,0.00023815125,0.0007295281,0.000079138335,0.00011216988,0.0039650397,0.0008072311,0.00030088233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042537104,0.000039261868,0.0004263437,0.00006491214,0.000059151196,0.00052493566,0.00026326213,0.97051233,0.0000047665953,0.02533623,0.00095501234,0.0018095631],"study_design_scores_gemma":[0.00017535077,0.000040596267,0.0006023794,0.000097813834,0.000017883383,0.0000043764326,0.000025648804,0.8733583,0.000037162736,0.12399284,0.00126048,0.00038715822],"about_ca_topic_score_codex":0.00039173415,"about_ca_topic_score_gemma":0.000064345186,"teacher_disagreement_score":0.6950355,"about_ca_system_score_codex":0.00009209354,"about_ca_system_score_gemma":0.00018093016,"threshold_uncertainty_score":0.99987084},"labels":[],"label_agreement":null},{"id":"W4386881183","doi":"10.1088/2058-9565/acfbaa","title":"Diabatic quantum annealing for the frustrated ring model","year":2023,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Laboratory Directed Research and Development; U.S. Department of Energy; Office of Science; Canada First Research Excellence Fund; Los Alamos National Laboratory; Natural Sciences and Engineering Research Council of Canada; Université de Sherbrooke; National Science Foundation","keywords":"Quantum annealing; Adiabatic process; Adiabatic quantum computation; Diabatic; Simulated annealing; Hamiltonian (control theory); Qubit; Ground state; Quantum; Statistical physics; Schedule; Exponential function; Computer science; Mathematical optimization; Physics; Quantum computer; Quantum mechanics; Mathematics; Mathematical analysis","score_opus":0.022185907418897657,"score_gpt":0.27019496463714293,"score_spread":0.2480090572182453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386881183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6279858,0.00023394119,0.35679144,0.013204127,0.00039976754,0.00028575852,0.0000035382056,0.0010630249,0.000032633707],"genre_scores_gemma":[0.99071586,0.000057278827,0.008923249,0.00017146049,0.00004005042,0.000051061244,6.900818e-7,0.000010603034,0.000029723687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979849,0.000013608516,0.00022987241,0.0006595989,0.00035393029,0.0007580922],"domain_scores_gemma":[0.99865055,0.0003156382,0.000090922134,0.0006392876,0.00021910122,0.000084501895],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014503469,0.00016762064,0.00018275385,0.00065201306,0.0014105177,0.00028245628,0.0018418059,0.0000998084,4.3853555e-7],"category_scores_gemma":[0.0004455442,0.000113982744,0.000036709258,0.0046197255,0.00084964273,0.00027905454,0.00066565163,0.0002671247,0.000011690011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023615037,0.000015820546,0.00015244844,0.000021682701,0.000010524738,0.000010577316,0.00050507276,0.017770583,0.015187793,0.8742311,0.0002528007,0.09183923],"study_design_scores_gemma":[0.00013865565,0.00009286987,0.0001558361,0.000019592624,0.00000441493,0.000025931156,0.00013669915,0.8519842,0.0023209215,0.14465593,0.0003212965,0.00014366605],"about_ca_topic_score_codex":0.000014079578,"about_ca_topic_score_gemma":0.000003015028,"teacher_disagreement_score":0.8342136,"about_ca_system_score_codex":0.000023312534,"about_ca_system_score_gemma":0.0002562178,"threshold_uncertainty_score":0.9998895},"labels":[],"label_agreement":null},{"id":"W4386881187","doi":"10.1021/acs.jpca.3c03015","title":"Modular Cluster Circuits for the Variational Quantum Eigensolver","year":2023,"lang":"en","type":"article","venue":"The Journal of Physical Chemistry A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; New Brunswick Innovation Foundation; Canada Foundation for Innovation","keywords":"Quantum circuit; Quantum computer; Coupled cluster; Computer science; Qubit; Modular design; Quantum; Quantum gate; Quantum algorithm; Algorithm; Electronic circuit; Topology (electrical circuits); Quantum error correction; Computational science; Quantum mechanics; Physics; Mathematics; Molecule","score_opus":0.014411738954341445,"score_gpt":0.24916954265739596,"score_spread":0.23475780370305452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386881187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1770793,0.00006931717,0.814723,0.0077359537,0.00017436444,0.00009694973,0.0000053062363,0.00004412465,0.000071643175],"genre_scores_gemma":[0.99755436,0.0000042597526,0.00050741,0.00024435128,0.0015554082,0.0000025976422,8.344521e-7,0.00000822975,0.0001225714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991107,0.000041548836,0.00018639007,0.00010268168,0.000355991,0.0002026913],"domain_scores_gemma":[0.99816966,0.0011688418,0.0001806513,0.00029034357,0.00013712495,0.000053372623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065462344,0.00009875728,0.00013335064,0.000014300838,0.00023655864,0.00006664022,0.001101889,0.000026922276,0.0000032002117],"category_scores_gemma":[0.00010338023,0.000048827424,0.00018761573,0.00027402616,0.000051355426,0.00007872415,0.00016301277,0.0002788376,0.000008716778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002625889,0.00010991852,0.0000023187233,0.000046211437,0.00016526079,0.000009033793,0.0026050268,0.8472858,0.12793936,0.005364145,0.0048752436,0.011571386],"study_design_scores_gemma":[0.0002458276,0.000044002863,0.00033786672,0.000017023563,0.00002275908,0.000060932347,0.000021704964,0.96950036,0.006136742,0.021983018,0.0015607651,0.000068978625],"about_ca_topic_score_codex":0.0000010098141,"about_ca_topic_score_gemma":3.3506748e-8,"teacher_disagreement_score":0.82047504,"about_ca_system_score_codex":0.00001539419,"about_ca_system_score_gemma":0.00006683526,"threshold_uncertainty_score":0.20476021},"labels":[],"label_agreement":null},{"id":"W4386947660","doi":"10.1088/2058-9565/acfc62","title":"Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions","year":2023,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Science; Canadian Institute for Advanced Research; Oak Ridge National Laboratory; Alfred P. Sloan Foundation; Fermilab; U.S. Department of Energy","keywords":"Algorithm; Function (biology); Computer science","score_opus":0.02236736183315363,"score_gpt":0.2693273650210382,"score_spread":0.24696000318788458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386947660","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5093397,0.00014220018,0.482187,0.006115997,0.0006384751,0.0003465353,0.000013650586,0.0009772566,0.00023917817],"genre_scores_gemma":[0.9715496,0.000020146928,0.028160656,0.0000813133,0.000057580986,0.0000509229,0.0000033464703,0.000011955045,0.0000645178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807966,0.000016805807,0.00031352573,0.00063691754,0.00037049878,0.00058259605],"domain_scores_gemma":[0.9986053,0.00020719151,0.00014488766,0.0006071681,0.000335887,0.000099580015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009731612,0.00015790382,0.00024405132,0.001299693,0.00076162076,0.00008201343,0.0010848929,0.00012227012,0.000001542285],"category_scores_gemma":[0.00048005418,0.00013965028,0.0000551854,0.0053476263,0.00090324145,0.00035420278,0.00045022863,0.00022864006,0.000020186479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018812437,0.000058146652,0.0005077339,0.000054353022,0.00001459014,0.0000070827496,0.000419257,0.00023404189,0.01844751,0.8667966,0.0004949436,0.11296385],"study_design_scores_gemma":[0.00020234563,0.0002259368,0.0006170149,0.000033687094,0.0000062442937,0.000048353246,0.00018090864,0.86731184,0.0042955843,0.12522173,0.0016920071,0.00016433718],"about_ca_topic_score_codex":0.000008314178,"about_ca_topic_score_gemma":0.0000022072295,"teacher_disagreement_score":0.8670778,"about_ca_system_score_codex":0.000021218859,"about_ca_system_score_gemma":0.00031361487,"threshold_uncertainty_score":0.5857848},"labels":[],"label_agreement":null},{"id":"W4386998145","doi":"10.1145/3625307","title":"Milestones on the Quantum Utility Highway: Quantum Annealing Case Study","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Quantum Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Milestone; Quantum annealing; Quantum computer; Computer science; Benchmark (surveying); Heuristic; Computation; Quantum; Overhead (engineering); Algorithm; Artificial intelligence; Quantum mechanics; Physics; Programming language","score_opus":0.048921344671200115,"score_gpt":0.295849325057757,"score_spread":0.2469279803865569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386998145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6634388,0.000044959223,0.32819244,0.003688581,0.002036712,0.00066611165,0.000016446098,0.001890696,0.000025271376],"genre_scores_gemma":[0.99640346,0.000013950074,0.0025332419,0.00060258986,0.00028061628,0.000043661825,0.00000512184,0.00008082709,0.000036506688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99395335,0.000985776,0.0010133464,0.0016683537,0.0010545676,0.0013246227],"domain_scores_gemma":[0.9916229,0.0043248152,0.00033548308,0.003229623,0.00019282184,0.00029433152],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00266019,0.0007598423,0.0006605526,0.0006860928,0.0037186523,0.0005987546,0.0028224734,0.00018160736,0.000024468052],"category_scores_gemma":[0.00022316069,0.0005770458,0.00042846048,0.0031647417,0.0001985414,0.00027001134,0.00026600252,0.001590689,0.0003546817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014325998,0.0032031836,0.0009341495,0.00015976459,0.00061538327,0.010986308,0.0326598,0.5235614,0.00030825677,0.03427045,0.0020252366,0.39113277],"study_design_scores_gemma":[0.00066762837,0.00089145405,0.0017236574,0.00015776278,0.00004004646,0.0010234176,0.004674684,0.98407483,0.00021831838,0.005502833,0.0003585901,0.0006667699],"about_ca_topic_score_codex":0.00074818835,"about_ca_topic_score_gemma":0.00005283666,"teacher_disagreement_score":0.46051338,"about_ca_system_score_codex":0.00009131093,"about_ca_system_score_gemma":0.00014691826,"threshold_uncertainty_score":0.9996681},"labels":[],"label_agreement":null},{"id":"W4387010616","doi":"10.1109/les.2023.3298739","title":"An Approximate Parallel Annealing Ising Machine for Solving Traveling Salesman Problems","year":2023,"lang":"en","type":"article","venue":"IEEE Embedded Systems Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council; University of Alberta","keywords":"Travelling salesman problem; Simulated annealing; Computer science; Adder; Ising model; Mathematical optimization; Combinatorial optimization; Algorithm; Parallel computing; Mathematics; Physics","score_opus":0.024372422358734453,"score_gpt":0.2646234403038393,"score_spread":0.2402510179451048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387010616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2221547,0.00011688043,0.7725323,0.0009692952,0.0022483459,0.00067645963,0.000013152582,0.0012662852,0.0000225672],"genre_scores_gemma":[0.9293819,0.0000049018136,0.06855689,0.0006482741,0.0011038193,0.00012701972,0.00004046743,0.00008640632,0.0000502999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967583,0.00018911842,0.0006585632,0.00094195054,0.00044400658,0.0010080744],"domain_scores_gemma":[0.99829555,0.000299427,0.00028416037,0.00083927286,0.000076823424,0.00020477602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018491955,0.00038619974,0.00047079555,0.0002953489,0.0006746294,0.0008172223,0.0011966866,0.00011218448,4.779128e-7],"category_scores_gemma":[0.00003266402,0.0003578374,0.00018064195,0.0006841099,0.0000459157,0.00042937582,0.000097716045,0.00031942443,0.000020541282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005405804,0.000019697743,0.00004806153,0.00031263786,0.00004043351,0.00004016649,0.004308,0.9003939,0.08863406,0.0005898218,0.0008841912,0.0047236425],"study_design_scores_gemma":[0.0005372962,0.00007023378,0.00004790393,0.00032179698,0.000010483732,0.00006274978,0.000104761675,0.99714214,0.0005987015,0.00034638622,0.00028426351,0.00047325686],"about_ca_topic_score_codex":0.000088459135,"about_ca_topic_score_gemma":0.0000063931643,"teacher_disagreement_score":0.70722723,"about_ca_system_score_codex":0.000056675603,"about_ca_system_score_gemma":0.000040640498,"threshold_uncertainty_score":0.99988735},"labels":[],"label_agreement":null},{"id":"W4387019909","doi":"10.1007/s11128-023-04104-z","title":"Spreading entanglement through pairwise exchange interactions","year":2023,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Qubit; Pairwise comparison; Quantum computer; Quantum entanglement; State (computer science); Physics; Quantum mechanics; Computer science; Topology (electrical circuits); Quantum; Mathematics; Algorithm; Combinatorics","score_opus":0.022669778685677485,"score_gpt":0.2797432005482949,"score_spread":0.2570734218626174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387019909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043209307,0.0000808485,0.9475639,0.0022647113,0.0010106958,0.00020083817,0.000005799142,0.0017129726,0.003950921],"genre_scores_gemma":[0.968295,0.000029116907,0.030073948,0.001153316,0.00018207458,0.00004593895,0.00005672586,0.000013373199,0.00015052507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986197,0.00003420092,0.00041748746,0.0001917122,0.00035579008,0.00038113655],"domain_scores_gemma":[0.99924797,0.00006604089,0.00022593558,0.0002774898,0.000113191425,0.00006935728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036229784,0.00016072107,0.0001321653,0.000294191,0.00053705863,0.00061262224,0.00048418224,0.00003862754,0.000023820296],"category_scores_gemma":[0.000051388484,0.00014566236,0.000062979074,0.0012038826,0.000025697691,0.0043151896,0.00028886643,0.00019511332,0.00048220588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051363327,0.000034863166,0.00009253817,0.0003161017,0.000016116142,0.000009819,0.038259547,0.00845366,0.00013169626,0.024263456,0.006801793,0.9216153],"study_design_scores_gemma":[0.00018918954,0.00003221699,0.00020553377,0.00013838006,0.000003354956,0.000026745203,0.00067369104,0.9251896,0.00050764874,0.0050431616,0.06780222,0.00018824296],"about_ca_topic_score_codex":0.000013909082,"about_ca_topic_score_gemma":0.0000013561364,"teacher_disagreement_score":0.92508566,"about_ca_system_score_codex":0.000063277366,"about_ca_system_score_gemma":0.0000697535,"threshold_uncertainty_score":0.6197942},"labels":[],"label_agreement":null},{"id":"W4387075175","doi":"10.48550/arxiv.2309.13461","title":"Tight bounds on Pauli channel learning without entanglement","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Air Force Office of Scientific Research; Institute for Quantum Information and Matter, California Institute of Technology; Government of Canada; Ministry of Colleges and Universities; MediaTek; Office of Science; U.S. Department of Energy; California Institute of Technology; Massachusetts Institute of Technology; Multidisciplinary University Research Initiative; Army Research Office; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; National Science Foundation","keywords":"Quantum entanglement; Pauli exclusion principle; Upper and lower bounds; Physics; Quantum mechanics; Qubit; Topology (electrical circuits); Eigenvalues and eigenvectors; Squashed entanglement; Channel (broadcasting); Mathematics; Quantum; Statistical physics; Computer science; Combinatorics; Mathematical analysis; Telecommunications","score_opus":0.06445716229593078,"score_gpt":0.20010814638549285,"score_spread":0.13565098408956205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387075175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40195733,0.000041659237,0.5912946,0.00072892394,0.0024184042,0.00035760045,0.000012304622,0.0015036198,0.0016855679],"genre_scores_gemma":[0.9922055,0.00007327186,0.0012932492,0.00016473573,0.0002783062,0.0000015410617,0.00002477411,0.00004233598,0.00591628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726427,0.00020767144,0.00022300836,0.0015129794,0.0002082914,0.00058377616],"domain_scores_gemma":[0.998197,0.00013391742,0.00027277262,0.0011030354,0.00008105524,0.00021220806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037728358,0.00044346138,0.00038788552,0.00040262012,0.0004312658,0.00026109174,0.0019363074,0.00023808358,0.000014864109],"category_scores_gemma":[0.00003112495,0.00046442973,0.00026181352,0.00063897466,0.00007959918,0.000112968984,0.0030010866,0.0013241955,0.00031764703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014872593,0.0000787255,0.0008072685,0.000053662017,0.000100121106,0.00058042817,0.0007346418,0.97736835,0.000009941406,0.018095136,0.00044750512,0.0017093377],"study_design_scores_gemma":[0.00037423553,0.0001893094,0.0010120483,0.00023797087,0.00002819328,0.000005962137,0.0000639497,0.9748706,0.00006924246,0.02019728,0.0024135874,0.0005376245],"about_ca_topic_score_codex":0.00010496959,"about_ca_topic_score_gemma":0.000020602356,"teacher_disagreement_score":0.59024817,"about_ca_system_score_codex":0.00020149446,"about_ca_system_score_gemma":0.0001429128,"threshold_uncertainty_score":0.9997807},"labels":[],"label_agreement":null},{"id":"W4387220907","doi":"10.20944/preprints202309.2100.v1","title":"Quantum Machine Learning Guided Image Synthesis","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Generative grammar; Computer science; Fidelity; Artificial intelligence; Image synthesis; Image (mathematics); Generative model; Machine learning","score_opus":0.1007212655475236,"score_gpt":0.3305071436669589,"score_spread":0.2297858781194353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387220907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77034956,0.00029325104,0.20806688,0.006640999,0.004316586,0.0008691994,0.00004299743,0.0061636106,0.00325689],"genre_scores_gemma":[0.96864426,0.00018520292,0.027855033,0.0001671633,0.0005386602,0.00016636659,0.000032993295,0.0001488395,0.0022614521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945598,0.00056988175,0.00086596544,0.002327221,0.00078491913,0.0008921985],"domain_scores_gemma":[0.99529386,0.00064319064,0.00058268517,0.0029867133,0.00020902095,0.0002845204],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020380896,0.0007207527,0.0008280143,0.0004626093,0.0004333189,0.00026961399,0.004258706,0.00040896382,0.0001646971],"category_scores_gemma":[0.0016532685,0.00070647727,0.0005161245,0.00055316614,0.00012642863,0.00017148437,0.014296839,0.0026771855,0.0042822286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008619135,0.0011128908,0.36725616,0.0029654533,0.0019637628,0.0025245314,0.013575055,0.47819343,0.033011463,0.021232814,0.0034126858,0.07466554],"study_design_scores_gemma":[0.00018902961,0.000021708613,0.05226627,0.00048417415,0.000042653133,0.000053439977,0.000017453478,0.9163776,0.010158159,0.015213323,0.004218477,0.0009577129],"about_ca_topic_score_codex":0.0007171205,"about_ca_topic_score_gemma":0.0000111093705,"teacher_disagreement_score":0.43818417,"about_ca_system_score_codex":0.00012582306,"about_ca_system_score_gemma":0.00024120392,"threshold_uncertainty_score":0.99962366},"labels":[],"label_agreement":null},{"id":"W4387226307","doi":"10.48550/arxiv.2309.16665","title":"Modular quantum signal processing in many variables","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Science; National Science Foundation","keywords":"Computer science; Modular design; Quantum; Theoretical computer science; Algebra over a field; Algorithm; Mathematics; Programming language; Pure mathematics","score_opus":0.0531122433726924,"score_gpt":0.19193338744300756,"score_spread":0.13882114407031515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387226307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2717203,0.000084439394,0.726753,0.00016348803,0.00039199856,0.00017377584,0.000006403747,0.0005260581,0.00018053439],"genre_scores_gemma":[0.9919246,0.000041087435,0.0072794133,0.000059086728,0.00013225157,0.0000010975389,0.000009672803,0.000033608896,0.0005192114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973682,0.0001675208,0.0002750856,0.0014623823,0.00014848614,0.00057832635],"domain_scores_gemma":[0.9985686,0.00009321892,0.00022916011,0.00087262806,0.00009315914,0.00014324307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048172692,0.00037988968,0.00041363438,0.0005563047,0.00019396475,0.00025258472,0.0022644007,0.00030442484,0.0000074707327],"category_scores_gemma":[0.000019206545,0.00042562583,0.00016710338,0.0012280764,0.00008220421,0.00023930438,0.0029008265,0.0010301528,0.00005908684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006906458,0.00006187101,0.0006282767,0.00012995886,0.000017552487,0.00096651644,0.0003198714,0.9465117,0.000052066804,0.04762409,0.000048998085,0.00363223],"study_design_scores_gemma":[0.00024702135,0.000028149207,0.0021912067,0.0003355054,0.00001363664,0.000006651835,0.000031194322,0.8582715,0.00002013433,0.13831104,0.00012837967,0.0004156192],"about_ca_topic_score_codex":0.0003115986,"about_ca_topic_score_gemma":0.000026745374,"teacher_disagreement_score":0.7202043,"about_ca_system_score_codex":0.00014566306,"about_ca_system_score_gemma":0.00031221192,"threshold_uncertainty_score":0.9998196},"labels":[],"label_agreement":null},{"id":"W4387244283","doi":"10.1007/s10801-023-01261-3","title":"Quantum state transfer between twins in weighted graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Manitoba","funders":"Canada Research Chairs; Canada Foundation for Innovation","keywords":"Combinatorics; Mathematics; Adjacency list; Transfer (computing); Adjacency matrix; Graph; Discrete mathematics; Computer science","score_opus":0.012886597821163491,"score_gpt":0.23939762307551374,"score_spread":0.22651102525435024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387244283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95279276,0.00019519468,0.04288266,0.0021688014,0.0016855001,0.00009228938,0.000002949016,0.00012888039,0.00005098769],"genre_scores_gemma":[0.99881244,0.00010940858,0.00083493267,0.000082279104,0.00008988489,0.0000011410228,0.0000012792561,0.000020998024,0.00004760995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755013,0.00017202953,0.0007979977,0.0002678341,0.0007016308,0.0005104016],"domain_scores_gemma":[0.9986853,0.00037070297,0.0001942283,0.00035033334,0.00018079371,0.00021865552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011796086,0.00022134976,0.00047766938,0.0010245654,0.00011152351,0.00013251,0.0012609027,0.00008874174,0.000003310507],"category_scores_gemma":[0.00005941742,0.00018603195,0.00022816766,0.0033534241,0.0000447188,0.00033375013,0.00017312402,0.00076883147,0.000019597734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006616907,0.0009550068,0.0581004,0.0002153793,0.00043721523,0.0038061691,0.015943095,0.004060103,0.0008691465,0.7282477,0.0054720514,0.18182756],"study_design_scores_gemma":[0.0019307656,0.0006999774,0.10593538,0.0001551755,0.000017487251,0.00011141345,0.00004633441,0.09753994,0.00052502146,0.78930557,0.0033348238,0.00039810274],"about_ca_topic_score_codex":0.00001550092,"about_ca_topic_score_gemma":0.0000030402357,"teacher_disagreement_score":0.18142945,"about_ca_system_score_codex":0.000068829504,"about_ca_system_score_gemma":0.00018766255,"threshold_uncertainty_score":0.75861627},"labels":[],"label_agreement":null},{"id":"W4387355362","doi":"10.48550/arxiv.2310.01431","title":"NISQ Computers: A Path to Quantum Supremacy","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"Harvard University","keywords":"Quantum computer; Computer science; Quantum; Transformative learning; Realm; Quantum state; Theoretical computer science; Physics; Sociology; Political science; Law; Quantum mechanics","score_opus":0.06578752431849952,"score_gpt":0.20148372675784734,"score_spread":0.13569620243934782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387355362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25858533,0.000026168804,0.736416,0.00084921916,0.0022754078,0.00035655213,0.000027376587,0.0012937256,0.00017025636],"genre_scores_gemma":[0.9808159,0.00003382015,0.017538192,0.0004345694,0.00031777477,0.0000016788422,0.000020788157,0.000053736847,0.0007835435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964598,0.00020410505,0.00031394916,0.0020543775,0.00020434709,0.0007634455],"domain_scores_gemma":[0.99675846,0.00031474963,0.00022409849,0.0020810387,0.0001652761,0.0004563814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038120153,0.0005456014,0.0005576008,0.0005689935,0.00028945634,0.0003804794,0.004003474,0.00028361334,0.000008360089],"category_scores_gemma":[0.000060805785,0.0006034031,0.00037034843,0.0013483472,0.00007908569,0.00018571735,0.007578678,0.00096239377,0.0005782448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012606756,0.00008016959,0.00031930796,0.00010918176,0.00008618621,0.001103988,0.00076130417,0.91613454,0.000015373955,0.075420566,0.0035523123,0.0024044581],"study_design_scores_gemma":[0.00030430837,0.0001148643,0.0014087394,0.0003174753,0.0000246135,0.000012954035,0.00003243561,0.93991774,0.000018692393,0.055988066,0.0011853466,0.0006747547],"about_ca_topic_score_codex":0.00035609602,"about_ca_topic_score_gemma":0.000030362371,"teacher_disagreement_score":0.72223055,"about_ca_system_score_codex":0.00016419993,"about_ca_system_score_gemma":0.00024869578,"threshold_uncertainty_score":0.9996417},"labels":[],"label_agreement":null},{"id":"W4387402455","doi":"10.1186/s13040-023-00343-z","title":"Quantum analysis of squiggle data","year":2023,"lang":"en","type":"article","venue":"BioData Mining","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Alberta Innovates; Ministero dello Sviluppo Economico; Government of Alberta; Genome Canada","keywords":"Nanopore sequencing; Computer science; Curse of dimensionality; Algorithm; Quantum; IBM; Quantum computer; Current (fluid); Computer engineering; DNA sequencing; Theoretical computer science; Artificial intelligence; DNA; Electrical engineering; Physics","score_opus":0.07099168818858985,"score_gpt":0.30829258730085923,"score_spread":0.23730089911226937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387402455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6940934,0.0002204629,0.302715,0.00096800737,0.0006345537,0.000078130324,0.00044386977,0.0005924657,0.00025407498],"genre_scores_gemma":[0.9139639,0.000019286803,0.08502722,0.00009755926,0.00009317348,0.0000015484865,0.0007131909,0.000010115543,0.00007398795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998628,0.00004641853,0.00025302914,0.0005426208,0.0002624542,0.00026745666],"domain_scores_gemma":[0.9974073,0.0002142316,0.00011806945,0.0021683562,0.000030797197,0.00006120925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064037245,0.00010351875,0.0002444406,0.00054261286,0.000098413315,0.00008943352,0.0027237367,0.00003654877,0.000010651644],"category_scores_gemma":[0.00012395754,0.0000909655,0.00006427458,0.004041322,0.000039714316,0.0002642546,0.0024810238,0.00007228331,0.000035741934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000141282335,0.0002160708,0.020655198,0.0001196199,0.0026735724,0.00030415168,0.007163027,0.02546749,0.005324243,0.02318767,0.07048795,0.8443869],"study_design_scores_gemma":[0.0000707908,0.000024800594,0.011129582,0.000015686279,0.000068576905,0.0000026687148,0.00006127136,0.9829391,0.000120581804,0.00009683856,0.005357162,0.00011292122],"about_ca_topic_score_codex":0.000056576846,"about_ca_topic_score_gemma":0.000010140739,"teacher_disagreement_score":0.9574716,"about_ca_system_score_codex":0.0000048914917,"about_ca_system_score_gemma":0.000043757194,"threshold_uncertainty_score":0.5061426},"labels":[],"label_agreement":null},{"id":"W4387545514","doi":"10.3934/amc.2023036","title":"Polynomial representation of additive cyclic codes and new quantum codes","year":2023,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Cyclic code; Polynomial code; Combinatorics; Binary number; Polynomial; Symplectic geometry; Linear code; Generator (circuit theory); Discrete mathematics; Quantum; Block code; Pure mathematics; Algorithm; Arithmetic; Power (physics); Decoding methods; Mathematical analysis; Quantum mechanics","score_opus":0.03357229013745686,"score_gpt":0.3365365296462214,"score_spread":0.3029642395087645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387545514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4628305,0.0075697396,0.516593,0.005982563,0.00028651228,0.0008073252,0.00010595342,0.0003978827,0.005426549],"genre_scores_gemma":[0.6810947,0.0037416338,0.31507817,0.000012365475,0.000011268831,0.000009317951,0.0000156202,0.0000063100765,0.000030617837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991378,0.00008053211,0.00038353674,0.00013457259,0.00014700703,0.00011654833],"domain_scores_gemma":[0.9970413,0.0016106864,0.00026771074,0.0009889852,0.0000574323,0.000033890235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024799895,0.0000812268,0.00023667041,0.00017952542,0.00007467987,0.000019094989,0.0010026894,0.00002877529,0.0000011028391],"category_scores_gemma":[0.0002541256,0.00007707687,0.000037336995,0.0007049271,0.0002030479,0.00023339805,0.0005642118,0.00010981846,0.000002334564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014759601,0.0005906887,0.0018121899,0.00040100713,0.000082847335,0.0000031943175,0.040960554,0.02770567,0.0042454437,0.61400247,0.0018245552,0.30835664],"study_design_scores_gemma":[0.00024401778,0.000050652467,0.002014712,0.00023091241,0.000006788334,0.000004911709,0.0006986708,0.8111036,0.0020154715,0.1824327,0.0010935009,0.00010408287],"about_ca_topic_score_codex":0.000058658334,"about_ca_topic_score_gemma":0.00006737719,"teacher_disagreement_score":0.7833979,"about_ca_system_score_codex":0.0000073136075,"about_ca_system_score_gemma":0.00003651805,"threshold_uncertainty_score":0.31431034},"labels":[],"label_agreement":null},{"id":"W4387559162","doi":"10.48550/arxiv.2310.04542","title":"Lagrangian Duality in Quantum Optimization: Overcoming QUBO Limitations for Constrained Problems","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mitacs","keywords":"Quadratic unconstrained binary optimization; Quantum computer; Augmented Lagrangian method; Mathematical optimization; Computer science; Quantum annealing; Quantum; Optimization problem; Quantum circuit; Mathematics; Theoretical computer science; Quantum network; Physics","score_opus":0.11608513478749852,"score_gpt":0.2187956911392658,"score_spread":0.10271055635176729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387559162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04623188,0.00002740165,0.95047176,0.00095139386,0.0007963247,0.0007358752,0.00005998306,0.00050286955,0.00022252694],"genre_scores_gemma":[0.94958425,0.000056805937,0.049691044,0.00008576791,0.00010139617,0.00000742696,0.00008015,0.00003180285,0.00036136253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777997,0.00016889001,0.00034732194,0.0011407516,0.00010140852,0.0004616778],"domain_scores_gemma":[0.99795866,0.0006644944,0.00027389367,0.0007959174,0.00017455759,0.00013245177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056820473,0.00031801005,0.00038434932,0.00044583023,0.00024951936,0.00019485013,0.001228071,0.00026406016,0.0000036371466],"category_scores_gemma":[0.0001566575,0.00037411094,0.00024110159,0.001010774,0.00010831791,0.00021089768,0.0010014693,0.0005330745,0.000010992421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075491052,0.00006053387,0.00026474026,0.00012001735,0.000036073772,0.00005451267,0.0006637489,0.9170382,0.0000043256787,0.081151746,0.00007938842,0.00051915064],"study_design_scores_gemma":[0.0006469665,0.00005018385,0.0005972002,0.00022257621,0.000022954837,0.0000034203574,0.00009849315,0.94322634,0.000005094943,0.054562557,0.00016718381,0.00039702424],"about_ca_topic_score_codex":0.00019930112,"about_ca_topic_score_gemma":0.00022419184,"teacher_disagreement_score":0.9033524,"about_ca_system_score_codex":0.00013075382,"about_ca_system_score_gemma":0.00028451416,"threshold_uncertainty_score":0.9998711},"labels":[],"label_agreement":null},{"id":"W4387560480","doi":"10.48550/arxiv.2310.05844","title":"Certifying ground-state properties of quantum many-body systems","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"QuantERA; National Natural Science Foundation of China; Agence Nationale de la Recherche; National Research Foundation; European Commission; Generalitat de Catalunya; National Science Foundation; Government of Canada; Centres de Recerca de Catalunya; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada","keywords":"Ground state; Observable; Scalability; Semidefinite programming; Statistical physics; Relaxation (psychology); Computer science; Upper and lower bounds; State (computer science); Energy (signal processing); Mathematical optimization; Applied mathematics; Mathematics; Physics; Algorithm; Quantum mechanics; Mathematical analysis","score_opus":0.10587549608896672,"score_gpt":0.1943397223828361,"score_spread":0.08846422629386937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387560480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4645026,0.00018200908,0.5330415,0.00007209556,0.0014245211,0.00024147386,0.000010863899,0.00046496646,0.000059954047],"genre_scores_gemma":[0.99775875,0.000118633805,0.0005103842,0.000016074564,0.000106690626,0.0000015734267,0.0000057654247,0.00004047722,0.0014416287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974126,0.00023144008,0.0004100123,0.0012221507,0.00019928117,0.0005244998],"domain_scores_gemma":[0.99766105,0.000095805204,0.00047601137,0.0014076568,0.00020856394,0.00015090124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004242381,0.00041432088,0.0005769754,0.00044483226,0.0002214432,0.00023400743,0.0024427895,0.00021502638,0.0000016524033],"category_scores_gemma":[0.000032406486,0.0004042106,0.00027785494,0.0007639586,0.00017263576,0.00021826943,0.0033230486,0.0007279145,0.00006759556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016090353,0.00005588453,0.00032585723,0.00067188276,0.00013183372,0.00031103555,0.00075809046,0.85490644,0.00029998829,0.1421401,0.00007369827,0.00030908146],"study_design_scores_gemma":[0.00021634149,0.00006039696,0.00079048576,0.00079200324,0.000033189383,0.00001237966,0.00010575034,0.9862114,0.00023484322,0.010988627,0.000098660086,0.0004558891],"about_ca_topic_score_codex":0.0013457235,"about_ca_topic_score_gemma":0.0000044868543,"teacher_disagreement_score":0.5332562,"about_ca_system_score_codex":0.00011922909,"about_ca_system_score_gemma":0.00020660118,"threshold_uncertainty_score":0.999841},"labels":[],"label_agreement":null},{"id":"W4387616307","doi":"10.1007/s10623-023-01306-5","title":"New quantum codes from self-dual codes over $$\\mathbb {F}_4$$","year":2023,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear code; Mathematics; Expander code; Discrete mathematics; Block code; Minimum distance; Quantum; Concatenated error correction code; Combinatorics; Physics; Algorithm; Quantum mechanics; Decoding methods","score_opus":0.01668971577279916,"score_gpt":0.24187927839778794,"score_spread":0.2251895626249888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387616307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38657424,0.0011374565,0.6088031,0.00067131396,0.000537115,0.00022525985,0.00008524341,0.0017753094,0.00019096903],"genre_scores_gemma":[0.6636177,0.001016239,0.33336958,0.0010080055,0.0007006532,0.000029266635,0.000113062364,0.00007739175,0.000068154804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972147,0.00017521052,0.0003989331,0.00093005516,0.0005270875,0.00075405504],"domain_scores_gemma":[0.9981448,0.00054857973,0.00014852903,0.00070219074,0.000066766544,0.000389155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041882126,0.0004463735,0.0004901809,0.0004785747,0.00051287265,0.00069586304,0.00080595183,0.00016868518,0.000030399624],"category_scores_gemma":[0.000021565605,0.00038511914,0.0002594874,0.0017296901,0.00011741454,0.00026930164,0.00043807697,0.00033157994,0.000056642653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013503524,0.00057881227,0.016544105,0.00021757,0.0014660625,0.00080415275,0.01976995,0.005128133,0.023107618,0.51489365,0.1372837,0.2800712],"study_design_scores_gemma":[0.001185841,0.0004236016,0.024423094,0.00014518453,0.000074833304,0.00004126775,0.00022311395,0.796093,0.0011945223,0.14709194,0.028018437,0.0010851548],"about_ca_topic_score_codex":0.00056610594,"about_ca_topic_score_gemma":0.000034803226,"teacher_disagreement_score":0.7909649,"about_ca_system_score_codex":0.000012077597,"about_ca_system_score_gemma":0.00009146321,"threshold_uncertainty_score":0.99986005},"labels":[],"label_agreement":null},{"id":"W4387667597","doi":"10.22331/q-2023-10-16-1141","title":"On the role of entanglement in qudit-based circuit compression","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"HORIZON EUROPE Framework Programme; Österreichische Forschungsförderungsgesellschaft; Bundesministerium für Bildung, Wissenschaft und Forschung; Austrian Science Fund; European Commission","keywords":"Qubit; Quantum entanglement; Quantum gate; Computer science; Quantum computer; Topology (electrical circuits); Electronic circuit; Quantum information; Quantum circuit; Quantum; Theoretical computer science; Quantum mechanics; Physics; Quantum network; Mathematics","score_opus":0.015936619114231894,"score_gpt":0.23716610828137777,"score_spread":0.22122948916714588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387667597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97604334,0.000086540764,0.019867567,0.002470458,0.00041089838,0.00021057094,0.0000058355654,0.00019647014,0.00070829224],"genre_scores_gemma":[0.9993473,0.0000022313245,0.0003392578,0.00024678477,0.000030356978,0.0000105480285,0.0000028351737,0.0000068622007,0.000013802947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887407,0.0001147376,0.00020318956,0.00024105188,0.00032129753,0.0002456359],"domain_scores_gemma":[0.9989593,0.00043466917,0.000081117694,0.00046991606,0.000019938461,0.000035031197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041146853,0.00010160887,0.00012803903,0.00015480841,0.000087072825,0.000031141943,0.00070125883,0.000029999232,0.000015582293],"category_scores_gemma":[0.00003677474,0.0000661326,0.000058758287,0.0006500663,0.000032659966,0.000029830633,0.00016260694,0.0001613556,0.0000582702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000169203,0.00030301095,0.0018565876,0.000033967666,0.000015240257,0.000047950933,0.002077243,0.060084876,0.010397923,0.81906646,0.003194601,0.1029052],"study_design_scores_gemma":[0.00019676032,0.00011016682,0.004208562,0.00010317064,8.8442914e-7,8.0397393e-7,0.00005447433,0.9263835,0.005901212,0.06129392,0.001663297,0.000083242936],"about_ca_topic_score_codex":0.00005092229,"about_ca_topic_score_gemma":0.0000051300194,"teacher_disagreement_score":0.8662986,"about_ca_system_score_codex":0.000018815503,"about_ca_system_score_gemma":0.00003759992,"threshold_uncertainty_score":0.26968092},"labels":[],"label_agreement":null},{"id":"W4387686935","doi":"10.48550/arxiv.2310.08639","title":"Mixed-state Quantum Phases: Renormalization and Quantum Error Correction","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; National Science Foundation; Government of Canada; Ministry of Colleges and Universities","keywords":"Toric code; Code (set theory); Quantum; Quantum information; Computer science; Quantum computer; Physics; Statistical physics; Quantum mechanics","score_opus":0.06797497414435749,"score_gpt":0.2056040844799104,"score_spread":0.13762911033555292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387686935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3977659,0.00005961666,0.59750366,0.00015491252,0.0035379357,0.00019623838,0.000016109623,0.0007163903,0.000049234684],"genre_scores_gemma":[0.99668235,0.0003147388,0.0010514589,0.000062935076,0.00014308674,0.0000013327042,0.000046594218,0.000039291517,0.001658224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974458,0.00022652277,0.00029757613,0.001410664,0.00014654224,0.00047284583],"domain_scores_gemma":[0.9981442,0.00019121348,0.0003644012,0.00093265175,0.00016242097,0.0002051032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038998344,0.00041785822,0.00038613702,0.00048627178,0.00038443436,0.00027998153,0.0010719661,0.0002473475,0.00000546896],"category_scores_gemma":[0.00007035627,0.00046525084,0.00016383965,0.00093375205,0.0001280897,0.0003232683,0.0019611027,0.00070972746,0.00004833846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029745659,0.00008365564,0.00084284734,0.00012530453,0.00008273868,0.0003479369,0.0007169392,0.95705646,0.000031407977,0.032299403,0.0022252374,0.00615831],"study_design_scores_gemma":[0.00035991674,0.000109680936,0.0015647262,0.0001863725,0.00003825078,0.000024435398,0.00008674874,0.94882745,0.00007247289,0.04762023,0.0006110909,0.0004986107],"about_ca_topic_score_codex":0.0004987984,"about_ca_topic_score_gemma":0.00013421255,"teacher_disagreement_score":0.5989164,"about_ca_system_score_codex":0.00010835981,"about_ca_system_score_gemma":0.00016326981,"threshold_uncertainty_score":0.99977994},"labels":[],"label_agreement":null},{"id":"W4387687547","doi":"10.3389/fenrg.2023.1061602","title":"Exploring quantum learning in the smart grid through the evolution of noisy finite fourier series","year":2023,"lang":"en","type":"article","venue":"Frontiers in Energy Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro-Québec; University of Toronto","funders":"","keywords":"Computer science; Leverage (statistics); Quantum; Grid; Algorithm; Anomaly detection; Network packet; Reliability (semiconductor); Quantum computer; Data mining; Machine learning; Artificial intelligence; Mathematics; Physics; Computer security","score_opus":0.07933818437877835,"score_gpt":0.29498436576927517,"score_spread":0.21564618139049682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387687547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44225052,0.0020724153,0.53497076,0.014626411,0.0036016302,0.00035104883,0.0000039020742,0.00026549626,0.0018578038],"genre_scores_gemma":[0.9889302,0.00061039557,0.00951754,0.00004827663,0.0002824006,0.00012060428,0.0000045927964,0.000019034596,0.000466913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965685,0.0011998569,0.00029260217,0.00037761344,0.00088116725,0.000680256],"domain_scores_gemma":[0.99843293,0.00076992856,0.00006022085,0.0006151566,0.00009059032,0.00003118385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034852931,0.00012886495,0.00019227242,0.0005174531,0.00042634894,0.00012148829,0.0016336131,0.00005756365,0.0000012161788],"category_scores_gemma":[0.0004302492,0.00008185102,0.00006751409,0.0040614526,0.00026828342,0.00043577907,0.0006312435,0.00090357894,0.000005022578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059685837,0.00008281095,0.012655794,0.000050623683,0.000030907668,0.00013220358,0.034616623,0.72333217,0.00008565588,0.12456471,0.009017558,0.09537125],"study_design_scores_gemma":[0.00018605228,0.000134038,0.009505455,0.00008254243,0.0000010099791,0.0000067649653,0.005896365,0.9136155,0.00011448882,0.0343976,0.0359454,0.00011477758],"about_ca_topic_score_codex":0.001586984,"about_ca_topic_score_gemma":0.00015448307,"teacher_disagreement_score":0.54667974,"about_ca_system_score_codex":0.000101366204,"about_ca_system_score_gemma":0.0001494431,"threshold_uncertainty_score":0.3925651},"labels":[],"label_agreement":null},{"id":"W4387744574","doi":"10.1038/s41586-023-06505-7","title":"Measurement-induced entanglement and teleportation on a noisy quantum processor","year":2023,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":172,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Basic Energy Sciences; University of California, Santa Barbara; Office of Science; Canadian Institute for Advanced Research; U.S. Department of Energy; Gordon and Betty Moore Foundation; Alfred P. Sloan Foundation; Stanford Research Computing Center, Stanford University; National Science Foundation","keywords":"Quantum entanglement; Teleportation; Quantum teleportation; Superdense coding; Computer science; Physics; Quantum mechanics; Quantum; Quantum channel","score_opus":0.01916008753397748,"score_gpt":0.26755828574458823,"score_spread":0.24839819821061077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387744574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98599297,0.00034830897,0.0041877055,0.0073249065,0.0008909557,0.00030187043,0.0000030675562,0.0006535441,0.00029665636],"genre_scores_gemma":[0.99733675,0.000009423925,0.0015893414,0.00087071274,0.0001312766,0.0000144416235,0.0000041545427,0.000010565499,0.00003335428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844474,0.00003509823,0.0001527884,0.00041536434,0.00068371557,0.00026830917],"domain_scores_gemma":[0.99942553,0.00003268557,0.00008494954,0.0002637513,0.000115394825,0.00007769428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044810597,0.00014403425,0.00011758288,0.00015810283,0.0001684264,0.000121732555,0.0003144102,0.00025852548,0.0000013813293],"category_scores_gemma":[0.00010737465,0.000114867245,0.000035588637,0.0006293577,0.000010180683,0.00009696122,0.00010049193,0.00086776953,0.000027174543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005551864,0.00029636623,0.0010616997,0.00027864176,0.00012273749,0.00033191315,0.0045486437,0.0017085379,0.032268528,0.08233908,0.014780716,0.8622076],"study_design_scores_gemma":[0.0014596465,0.0010449396,0.053600613,0.00039724662,0.000019966057,0.000060439896,0.00015395775,0.88760096,0.018734569,0.015603713,0.020519616,0.0008043368],"about_ca_topic_score_codex":0.000005404495,"about_ca_topic_score_gemma":0.00000660304,"teacher_disagreement_score":0.8858924,"about_ca_system_score_codex":0.000033478605,"about_ca_system_score_gemma":0.000058904592,"threshold_uncertainty_score":0.46841502},"labels":[],"label_agreement":null},{"id":"W4387804379","doi":"10.48550/arxiv.2310.12110","title":"Simulating 2D lattice gauge theories on a qudit quantum computer","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; HORIZON EUROPE Framework Programme; QuantERA; Bundesministerium für Bildung und Forschung; Canada First Research Excellence Fund; Austrian Science Fund; Natural Sciences and Engineering Research Council of Canada; European Commission; Österreichische Forschungsförderungsgesellschaft; Canadian Institute for Advanced Research","keywords":"Quantum computer; Lattice gauge theory; Physics; Quantum simulator; Qubit; Quantum algorithm; Open quantum system; Theoretical physics; Quantum information; Quantum technology; Gauge theory; Quantum; Quantum network; Quantum mechanics","score_opus":0.05898657630317719,"score_gpt":0.20713093909477942,"score_spread":0.14814436279160223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387804379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37775126,0.000019630717,0.617642,0.00046786445,0.0022015485,0.00024793795,0.000026616657,0.0011821182,0.00046102202],"genre_scores_gemma":[0.9900074,0.000025364077,0.008085267,0.00033633714,0.0005904018,8.665888e-7,0.000020390326,0.000053990356,0.00088000455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669677,0.00030986787,0.000325332,0.0017719413,0.00022037493,0.00067570317],"domain_scores_gemma":[0.99655265,0.0010048175,0.00036310614,0.0017085811,0.00015663609,0.00021419291],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050224556,0.00056700915,0.00053845986,0.00040636864,0.00045809674,0.00035938527,0.0025500623,0.00032855198,0.000011372135],"category_scores_gemma":[0.00007225348,0.0005829064,0.000355927,0.00087875285,0.00014885452,0.00018958272,0.00401279,0.0013022424,0.00033029093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012203173,0.00004725009,0.00016359384,0.000058051734,0.00006341057,0.00041947735,0.0003949364,0.6281907,0.0000019509664,0.36870635,0.00028348257,0.0016586315],"study_design_scores_gemma":[0.00028905927,0.00012357447,0.00078546104,0.00027697027,0.00002887264,0.000005543021,0.00002821826,0.8025342,0.000012863471,0.19488305,0.0005034849,0.00052870304],"about_ca_topic_score_codex":0.00016418661,"about_ca_topic_score_gemma":0.000019575717,"teacher_disagreement_score":0.6122561,"about_ca_system_score_codex":0.00013305644,"about_ca_system_score_gemma":0.00015617757,"threshold_uncertainty_score":0.9996622},"labels":[],"label_agreement":null},{"id":"W4387827199","doi":"10.53829/ntr202310fa4","title":"Dilemma between Quantum Speedup and Computational Reliability--Overcoming Errors with Efficient Verification Methods for Quantum Computing","year":2023,"lang":"en","type":"article","venue":"NTT technical review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Exploratory Research for Advanced Technology; Japan Science and Technology Agency; University of Waterloo","keywords":"Speedup; Computer science; Reliability (semiconductor); Quantum; Quantum computer; Dilemma; Parallel computing; Computational science; Algorithm; Theoretical computer science; Mathematics; Physics; Quantum mechanics","score_opus":0.03764931689298488,"score_gpt":0.3669933062389969,"score_spread":0.329343989346012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387827199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031096023,0.0025901021,0.9592006,0.0049831118,0.00015693723,0.001115206,0.0000103721095,0.0008251515,0.000022495315],"genre_scores_gemma":[0.2632037,0.0003943266,0.73574203,0.00041917295,0.000106925174,0.000051557417,0.000042180855,0.000034314166,0.000005769979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997036,0.00033850851,0.00073659664,0.00094719353,0.00042267964,0.00051903306],"domain_scores_gemma":[0.9959699,0.0026281371,0.000306377,0.00070020935,0.00020431144,0.00019108967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038250326,0.00030961563,0.00068332563,0.00015576159,0.00039531328,0.0001271497,0.0007892879,0.00010935641,0.0000019570844],"category_scores_gemma":[0.0009269395,0.00023984592,0.00016788929,0.0013774314,0.00016055585,0.000104969404,0.00047666882,0.00040473175,0.00001537904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014758709,0.00011504931,0.00062463246,0.00295337,0.00004665764,0.0000084370195,0.00016955366,0.04564448,0.00018940959,0.08808777,0.0012733566,0.8608725],"study_design_scores_gemma":[0.0003056086,0.0002221053,0.012618431,0.0019907632,0.000049114256,0.000037004822,0.0000044853214,0.96058995,0.000029110983,0.0097830165,0.014020636,0.00034975607],"about_ca_topic_score_codex":0.000010643302,"about_ca_topic_score_gemma":4.1789642e-7,"teacher_disagreement_score":0.9149455,"about_ca_system_score_codex":0.00006486725,"about_ca_system_score_gemma":0.00009901663,"threshold_uncertainty_score":0.9780633},"labels":[],"label_agreement":null},{"id":"W4387839084","doi":"10.48550/arxiv.2310.12854","title":"Redundant string symmetry-based error correction: Demonstrations on quantum devices","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Teleportation; Cluster state; Qubit; Quantum entanglement; Quantum teleportation; Quantum computer; Physics; Fidelity; Quantum error correction; Topology (electrical circuits); Quantum; Computer science; Quantum mechanics; Quantum network; Mathematics; Quantum channel; Combinatorics; Telecommunications","score_opus":0.08167941336923185,"score_gpt":0.21801191012230817,"score_spread":0.13633249675307632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387839084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30515644,0.000022802738,0.6883885,0.0005398307,0.004064582,0.0002596075,0.000021218768,0.0011290837,0.00041793083],"genre_scores_gemma":[0.99499756,0.000009964862,0.003940508,0.00018905268,0.00021009413,0.0000016820691,0.000021948008,0.00003325321,0.00059596053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973809,0.00019813186,0.0002914467,0.0014523967,0.0001912535,0.0004858463],"domain_scores_gemma":[0.9976038,0.00043257378,0.00033288114,0.0012759552,0.0001442459,0.00021059411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003266975,0.0004279122,0.00036958657,0.00062019186,0.0005767835,0.00031570773,0.0017556016,0.0002841774,0.000008266743],"category_scores_gemma":[0.00007027882,0.00046778648,0.0003025556,0.001323189,0.00010777328,0.00015746437,0.0010106058,0.001136606,0.00014743103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012427076,0.00008532224,0.0008185221,0.000049570634,0.000056925648,0.00027491682,0.00008108637,0.9367103,0.0000071180734,0.0599021,0.0005286533,0.0014730493],"study_design_scores_gemma":[0.00026762352,0.00012975032,0.0025805088,0.00039114032,0.000041224313,0.000007959826,0.00006345286,0.98291147,0.00012721728,0.012544683,0.00043890844,0.0004960746],"about_ca_topic_score_codex":0.00022785742,"about_ca_topic_score_gemma":0.00012467755,"teacher_disagreement_score":0.6898411,"about_ca_system_score_codex":0.00018995005,"about_ca_system_score_gemma":0.00044692075,"threshold_uncertainty_score":0.9997774},"labels":[],"label_agreement":null},{"id":"W4387869558","doi":"10.1109/dasa59624.2023.10286779","title":"Quantum Optimization in Engineering: A Brief Review","year":2023,"lang":"en","type":"review","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Variety (cybernetics); Computer science; Quantum computer; Quantum; Engineering optimization; Management science; Optimization problem; Engineering; Artificial intelligence; Algorithm; Physics; Quantum mechanics","score_opus":0.03477499239485939,"score_gpt":0.2961252560718769,"score_spread":0.2613502636770175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387869558","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.2055278e-9,0.6688628,0.32980445,0.00011620237,0.00030049778,0.00038923087,0.0000016030768,0.0004458955,0.000079290476],"genre_scores_gemma":[9.4435935e-9,0.9552337,0.044232592,0.00014160709,0.00009143158,0.00005717828,0.00002149118,0.000044583634,0.00017739351],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997927,0.000108725326,0.0007133172,0.00063489954,0.0002460362,0.00036999548],"domain_scores_gemma":[0.9987197,0.00024320855,0.00019136193,0.00073166896,0.000029270877,0.000084823594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054355897,0.00038205265,0.0013564337,0.00039246972,0.000032179745,0.00011193383,0.0012691297,0.00015403704,0.000011823096],"category_scores_gemma":[0.00015029508,0.0002938308,0.00031948483,0.0022604829,0.000008835051,0.00009344375,0.00047773408,0.00047548945,0.00011478852],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.4173812e-8,0.000013431082,1.940798e-8,0.05785567,0.000017648368,0.00005190027,0.000010400452,0.028552106,1.1292037e-9,0.0048394273,0.0011953346,0.907464],"study_design_scores_gemma":[0.00002210295,0.000009191263,6.6883764e-8,0.06470299,0.000017581187,0.00003394574,6.890082e-8,0.46050298,4.9444684e-9,0.000025763371,0.47448802,0.0001972819],"about_ca_topic_score_codex":0.000016281974,"about_ca_topic_score_gemma":0.0000012638266,"teacher_disagreement_score":0.90726674,"about_ca_system_score_codex":0.00005604109,"about_ca_system_score_gemma":0.00018687981,"threshold_uncertainty_score":0.99995136},"labels":[],"label_agreement":null},{"id":"W4387881087","doi":"10.22331/q-2023-10-23-1148","title":"Simulating gauge theories with variational quantum eigensolvers in superconducting microwave cavities","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Research and Innovation Foundation; Canada First Research Excellence Fund; Austrian Science Fund; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; European Commission; QuantERA; Industry Canada; Alfred P. Sloan Foundation","keywords":"Ansatz; Qubit; Hilbert space; Realization (probability); Physics; Quantum; Quantum computer; Quantum simulator; Quantum algorithm; Computer science; Gauge theory; Topology (electrical circuits); Quantum mechanics; Theoretical physics; Mathematics","score_opus":0.016182726804558067,"score_gpt":0.2422945287728636,"score_spread":0.22611180196830552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387881087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91703224,0.0000693403,0.08030429,0.0010147387,0.00059230335,0.0001594508,0.000008252308,0.0005296962,0.00028968597],"genre_scores_gemma":[0.98248464,0.000005653372,0.017027024,0.00015925085,0.00018155809,0.000011120796,0.000018621642,0.000029094346,0.00008304335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778,0.000146929,0.00037186255,0.00059584074,0.000424562,0.00068077195],"domain_scores_gemma":[0.9985739,0.0006940487,0.0001152371,0.00043943967,0.000088526875,0.000088871864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007187885,0.00027135265,0.0002891863,0.00035859083,0.00036663344,0.00024592242,0.0006143799,0.00008350719,0.000010569753],"category_scores_gemma":[0.00012859647,0.0002264527,0.000074531825,0.0013194331,0.00011136953,0.0004335936,0.00027569992,0.00037612813,0.00005236228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002051182,0.00005544705,0.0053152703,0.000059462243,0.000042912445,0.00025042603,0.014347401,0.0852066,0.0040847952,0.8842593,0.00017772522,0.00618019],"study_design_scores_gemma":[0.00040942882,0.00011417149,0.0045968825,0.00010362799,0.0000041846247,0.00004599519,0.0013764142,0.90585387,0.00062848086,0.08631029,0.00020655141,0.00035009725],"about_ca_topic_score_codex":0.00026830932,"about_ca_topic_score_gemma":0.000063917476,"teacher_disagreement_score":0.8206473,"about_ca_system_score_codex":0.000056386096,"about_ca_system_score_gemma":0.00015856036,"threshold_uncertainty_score":0.9234473},"labels":[],"label_agreement":null},{"id":"W4387886056","doi":"10.1109/access.2023.3327214","title":"Quantum Error Correction Via Noise Guessing Decoding","year":2023,"lang":"en","type":"article","venue":"IEEE Access","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Ministério da Ciência, Tecnologia e Ensino Superior; University of Toronto; European Commission","keywords":"Computer science; Algorithm; Quantum error correction; Decoding methods; Concatenated error correction code; Theoretical computer science; Linear code; Quantum computer; Block code; Quantum; Physics; Quantum mechanics","score_opus":0.03749238428040324,"score_gpt":0.31772527056320726,"score_spread":0.280232886282804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387886056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39024293,0.000024239827,0.6007657,0.00048753273,0.007350467,0.00007039651,6.0922184e-7,0.00087963534,0.00017850539],"genre_scores_gemma":[0.99496615,0.000007873031,0.004019446,0.00027291165,0.0005086978,0.000008921985,0.000002776257,0.00001943905,0.00019378417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985337,0.0000693262,0.00022584434,0.0004633406,0.00027970187,0.00042803324],"domain_scores_gemma":[0.99911076,0.00016793294,0.00011249626,0.00044820097,0.000060624327,0.00010001276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034028533,0.00016269137,0.00016564192,0.00026958744,0.00041779052,0.0006132289,0.0012452344,0.00006400202,0.0000058333494],"category_scores_gemma":[0.000042134085,0.00014848224,0.000078683304,0.0013505921,0.00003098117,0.00068075705,0.00037014487,0.00023547573,0.00017074269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007993599,0.000056430028,0.002038122,0.00005028312,0.000024860008,0.00014324364,0.0013100023,0.102094345,0.006934305,0.00053186755,0.01621477,0.8705938],"study_design_scores_gemma":[0.00013279227,0.000025250416,0.005635734,0.0000591951,0.0000035050912,0.000038547278,0.000012438648,0.98522645,0.0045730066,0.0032315,0.0008542884,0.00020730413],"about_ca_topic_score_codex":0.00010073193,"about_ca_topic_score_gemma":0.000016507878,"teacher_disagreement_score":0.8831321,"about_ca_system_score_codex":0.00003336171,"about_ca_system_score_gemma":0.000044774937,"threshold_uncertainty_score":0.605493},"labels":[],"label_agreement":null},{"id":"W4387909106","doi":"10.22331/q-2023-10-24-1153","title":"Partitioning qubits in hypergraph product codes to implement logical gates","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Freie Universität Berlin; Innovation, Science and Economic Development Canada","keywords":"Hypergraph; Low-density parity-check code; Block code; Mathematics; Transversal (combinatorics); Computer science; Theoretical computer science; Discrete mathematics; Topology (electrical circuits); Algorithm; Decoding methods; Combinatorics","score_opus":0.024622133266932623,"score_gpt":0.2826845797361799,"score_spread":0.25806244646924725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387909106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9618668,0.000100124955,0.021639662,0.014822245,0.0004409105,0.0002700671,0.0000032055734,0.0006216356,0.00023534814],"genre_scores_gemma":[0.99368614,0.000007923061,0.005619734,0.00046267558,0.00012628442,0.000036638223,0.0000065650547,0.000009611936,0.000044436263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983801,0.0000842568,0.0002598992,0.0005213375,0.0002225301,0.00053184],"domain_scores_gemma":[0.9993152,0.00011469953,0.00004051941,0.00037112503,0.000040947718,0.00011753394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005434816,0.00014563421,0.00018320883,0.00026651827,0.00015940948,0.00014468779,0.0005290984,0.000027730603,0.00000884989],"category_scores_gemma":[0.000085199135,0.00012120652,0.000054543638,0.0014794295,0.000022520637,0.00010141009,0.00035935984,0.00015835317,0.00019733385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003384485,0.0003730645,0.021525325,0.00011508091,0.00004709452,0.00052324217,0.0067503643,0.07031989,0.008577906,0.7597493,0.023970604,0.10801429],"study_design_scores_gemma":[0.00031875915,0.00037946546,0.057410307,0.00011176903,0.0000027572335,0.00002793202,0.00009057762,0.8556376,0.0030337782,0.068466716,0.014088226,0.0004320913],"about_ca_topic_score_codex":0.000066331064,"about_ca_topic_score_gemma":0.00004242138,"teacher_disagreement_score":0.7853177,"about_ca_system_score_codex":0.000020532127,"about_ca_system_score_gemma":0.00003518363,"threshold_uncertainty_score":0.49426585},"labels":[],"label_agreement":null},{"id":"W4387933416","doi":"10.1088/1361-6404/ad06be","title":"Quantum computing with trapped ions: a beginner’s guide","year":2023,"lang":"en","type":"article","venue":"European Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Air Force Office of Scientific Research","keywords":"Physics; Quantum computer; Scalability; Ion; Quantum; Trapped ion quantum computer; Computational science; Theoretical physics; Quantum simulator; Quantum mechanics; Computer science; Operating system","score_opus":0.01839109493151218,"score_gpt":0.24286315456568452,"score_spread":0.22447205963417236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387933416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16237253,0.000059096245,0.83468944,0.0012109439,0.00046045877,0.00004716909,0.0000010710752,0.0001912839,0.00096800225],"genre_scores_gemma":[0.9243031,0.000014590801,0.0740832,0.00029171124,0.0011691934,1.2772507e-7,0.0000012303259,0.00004002378,0.00009678029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982923,0.00031205523,0.0004273854,0.00021592212,0.00042103123,0.0003313072],"domain_scores_gemma":[0.9987695,0.00014519393,0.00042562888,0.000343212,0.00017878013,0.00013765435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011095114,0.0001728257,0.00024073834,0.0001333054,0.00019934983,0.00017783041,0.0010616315,0.00001079222,0.0000010813407],"category_scores_gemma":[0.00003676846,0.00012480792,0.00013691605,0.0009585253,0.000056954053,0.00020890457,0.00023684007,0.0003930611,0.00006719727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025660675,0.00016644057,0.00020563329,0.000042536027,0.00017069673,0.002963858,0.006336164,0.21809943,0.001973686,0.026145184,0.017000819,0.7268699],"study_design_scores_gemma":[0.0011584392,0.00094719697,0.0046088193,0.00041748837,0.000021952406,0.0006066672,0.00015519068,0.9703284,0.0005298601,0.0032846925,0.017559657,0.0003816706],"about_ca_topic_score_codex":0.0000013940339,"about_ca_topic_score_gemma":1.5255965e-7,"teacher_disagreement_score":0.7619306,"about_ca_system_score_codex":0.000015701808,"about_ca_system_score_gemma":0.00009133571,"threshold_uncertainty_score":0.50895196},"labels":[],"label_agreement":null},{"id":"W4388092466","doi":"10.48550/arxiv.2310.18410","title":"Initial state preparation for quantum chemistry on quantum computers","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Information and Communications Technology Promotion; Alliance de recherche numérique du Canada; Mitacs; Ministry of Education, Science and Technology; Stewart Blusson Quantum Matter Institute, University of British Columbia; National Research Foundation of Korea; Agencia Estatal de Investigación; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Ground state; Computer science; State (computer science); Statistical physics; Metric (unit); Scaling; Ansatz; Quality (philosophy); Quantum; Mathematical optimization; Energy (signal processing); Work (physics); Algorithm; Mathematics; Physics; Quantum mechanics","score_opus":0.06747862802982367,"score_gpt":0.229424960423263,"score_spread":0.1619463323934393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388092466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32627356,0.0000092110195,0.67051977,0.00024262966,0.0016478852,0.00041020082,0.00007175283,0.0007223783,0.000102635684],"genre_scores_gemma":[0.99535036,0.000022183716,0.0032728093,0.0001330211,0.00034324068,0.0000048681577,0.000106673186,0.00004903589,0.0007178159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971149,0.00011827101,0.0003432768,0.0016774709,0.00016911128,0.0005769694],"domain_scores_gemma":[0.9975002,0.00044432408,0.0003981992,0.0012731127,0.00017994399,0.00020426209],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037609218,0.00048381215,0.00044922734,0.00022131394,0.00032176723,0.0002754385,0.0019582808,0.0002925348,0.000003942625],"category_scores_gemma":[0.000059900565,0.00054772367,0.00035785954,0.00048073707,0.00010187313,0.00016779802,0.0016095518,0.0007305755,0.000069491696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009964649,0.0000963529,0.000022689868,0.0001919344,0.000095993506,0.00017115969,0.000391548,0.96977,0.000073018055,0.026144145,0.0016350489,0.0013084259],"study_design_scores_gemma":[0.0005636282,0.00020040774,0.00011355983,0.00020019757,0.000025482346,0.0000050571966,0.000017183376,0.9103292,0.00058987114,0.086802304,0.00060772797,0.0005453846],"about_ca_topic_score_codex":0.00006980091,"about_ca_topic_score_gemma":0.0000067875512,"teacher_disagreement_score":0.6690768,"about_ca_system_score_codex":0.00017006854,"about_ca_system_score_gemma":0.00028704316,"threshold_uncertainty_score":0.99969745},"labels":[],"label_agreement":null},{"id":"W4388184023","doi":"10.48550/arxiv.2310.19953","title":"A Hybrid Quantum Algorithm for Load Flow","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Scalability; Convergence (economics); Quantum; Algorithm; Flow (mathematics); Computer science; Mathematical optimization; Quantum algorithm; Newton's method; Mathematics; Physics; Nonlinear system; Quantum mechanics","score_opus":0.05445647217159943,"score_gpt":0.1986523696118346,"score_spread":0.14419589744023517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388184023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021960702,0.00007661672,0.9727671,0.00035101263,0.002829206,0.00053841376,0.00015824469,0.0012124724,0.00010619948],"genre_scores_gemma":[0.66800123,0.00020725667,0.32330635,0.0004070941,0.0013232242,0.000014178717,0.00014501542,0.00017553815,0.0064201043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968484,0.00011090627,0.0002851509,0.0018444199,0.00018842786,0.0007226988],"domain_scores_gemma":[0.9972716,0.000323401,0.0002692468,0.0015882009,0.00029718943,0.00025036806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005083029,0.0004987253,0.00051980256,0.00031360248,0.00033917706,0.00025936117,0.0028565573,0.00024536025,0.0000061311475],"category_scores_gemma":[0.00006573647,0.0005531845,0.00052234717,0.00052403257,0.00010164993,0.00017243224,0.003148416,0.00077329174,0.00015451317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014150697,0.00010332633,0.000024508216,0.00013355736,0.00017570192,0.0007882679,0.00026611204,0.89027506,0.0000067423434,0.02679633,0.004592971,0.0768233],"study_design_scores_gemma":[0.00048912346,0.00009044674,0.000060537444,0.0001186509,0.000040490308,0.00001480963,0.000012049497,0.85478187,0.000047325648,0.14130025,0.0024841425,0.0005602892],"about_ca_topic_score_codex":0.00015048019,"about_ca_topic_score_gemma":0.000012734244,"teacher_disagreement_score":0.6494608,"about_ca_system_score_codex":0.00023673761,"about_ca_system_score_gemma":0.0005162482,"threshold_uncertainty_score":0.99969196},"labels":[],"label_agreement":null},{"id":"W4388424947","doi":"10.1103/physrevresearch.5.043117","title":"Financial risk management on a neutral atom quantum processor","year":2023,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Social Innovation","funders":"Eusko Jaurlaritza; Agence Nationale de la Recherche; Donostia International Physics Center","keywords":"Interpretability; Benchmark (surveying); Computer science; Quantum computer; Tensor (intrinsic definition); Qubit; Finance; Set (abstract data type); Quantum; Artificial intelligence; Machine learning; Mathematics; Economics; Physics","score_opus":0.051127555772238986,"score_gpt":0.39439187520307933,"score_spread":0.34326431943084035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388424947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9256541,0.012957881,0.02172096,0.022019045,0.0009459535,0.004365977,0.000034346594,0.002167527,0.010134168],"genre_scores_gemma":[0.9556709,0.03300276,0.005709631,0.001951804,0.0016794772,0.00070487196,0.00001645406,0.00007808967,0.0011860016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967211,0.0004527932,0.00021952836,0.0007063715,0.0010553834,0.00084486004],"domain_scores_gemma":[0.99837816,0.0004976814,0.000059269383,0.00077815686,0.0001296852,0.00015704294],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017382387,0.00018218577,0.0003214684,0.0002029917,0.00040594873,0.0001384611,0.0014792372,0.00002543143,0.0000039114084],"category_scores_gemma":[0.0002600949,0.00013400064,0.00017980061,0.0031837502,0.000087244414,0.00009914159,0.0008874975,0.0008654287,0.00181411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009613405,0.0002676052,0.000021924436,0.00154824,0.0000166939,0.0001431966,0.00022576559,0.0004440289,0.000020341824,0.506596,0.024461603,0.46624497],"study_design_scores_gemma":[0.0003221529,0.00056312245,0.0043876735,0.0026874894,0.000013130862,0.0000050210156,0.000005864656,0.5637955,0.00020174097,0.28354025,0.14411649,0.00036156827],"about_ca_topic_score_codex":0.000014477036,"about_ca_topic_score_gemma":0.0000011275137,"teacher_disagreement_score":0.56335145,"about_ca_system_score_codex":0.00003636362,"about_ca_system_score_gemma":0.000083565574,"threshold_uncertainty_score":0.9989631},"labels":[],"label_agreement":null},{"id":"W4388486490","doi":"10.1021/acs.jctc.3c00912","title":"Block-Invariant Symmetry Shift: Preprocessing Technique for Second-Quantized Hamiltonians to Improve Their Decompositions to Linear Combination of Unitaries","year":2023,"lang":"en","type":"article","venue":"Journal of Chemical Theory and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Mitacs","keywords":"Eigenvalues and eigenvectors; Hamiltonian (control theory); BLISS; Computer science; Algorithm; Invariant (physics); Linear subspace; Mathematics; Quantum mechanics; Physics; Pure mathematics; Mathematical optimization","score_opus":0.010072934946872461,"score_gpt":0.2761071206907557,"score_spread":0.26603418574388327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388486490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44434768,0.000016731654,0.55459976,0.00072728033,0.000092689246,0.00016732952,0.0000065613367,0.00003204906,0.00000990768],"genre_scores_gemma":[0.8754281,0.0000010573501,0.12428574,0.00017843471,0.000078440666,0.000010204802,0.0000037701043,0.000009408992,0.0000048869147],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890083,0.00011310067,0.00045348896,0.00020394601,0.00016183393,0.00016680079],"domain_scores_gemma":[0.9982238,0.0009906236,0.00026836127,0.00012370375,0.0002765353,0.000117001495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013189168,0.00012521057,0.00026734837,0.00029701943,0.00012587103,0.00007999905,0.000301976,0.0000682459,6.257477e-7],"category_scores_gemma":[0.00022928741,0.00010326809,0.00009384728,0.0006141288,0.0000403733,0.00015848022,0.00014149353,0.0001704828,7.091016e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038746887,0.00021443581,0.000014772688,0.00024998648,0.00009612787,0.000008286467,0.005975829,0.0187274,0.8534095,0.07467389,0.00011657624,0.046125695],"study_design_scores_gemma":[0.0005433248,0.0005087973,0.00016419048,0.00023082116,0.000016146278,0.000060776925,0.00008398733,0.18678768,0.48829478,0.3231176,0.000048566773,0.00014330584],"about_ca_topic_score_codex":7.433091e-7,"about_ca_topic_score_gemma":1.8114413e-7,"teacher_disagreement_score":0.43108037,"about_ca_system_score_codex":0.000021524142,"about_ca_system_score_gemma":0.0000704928,"threshold_uncertainty_score":0.42111504},"labels":[],"label_agreement":null},{"id":"W4388500029","doi":"10.22331/q-2023-11-08-1175","title":"Automated Generation of Shuttling Sequences for a Linear Segmented Ion Trap Quantum Computer","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Army Research Office; Bundesministerium für Bildung und Forschung; Office of the Director of National Intelligence; Intelligence Advanced Research Projects Activity; Canada First Research Excellence Fund; Natural Sciences and Engineering Research Council of Canada; Université de Sherbrooke","keywords":"Qubit; Toffoli gate; Quantum computer; Computer science; Overhead (engineering); Quantum circuit; Trapped ion quantum computer; Quantum; Quantum gate; Algorithm; Topology (electrical circuits); Physics; Quantum error correction; Quantum mechanics; Electrical engineering; Engineering","score_opus":0.043166420805517275,"score_gpt":0.2940677572313932,"score_spread":0.250901336425876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388500029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46119767,0.00004205663,0.53525436,0.0007809315,0.001168767,0.00025520017,0.000015050394,0.0012803776,0.0000055901182],"genre_scores_gemma":[0.8971939,0.00001746609,0.10182439,0.00015521634,0.0006357264,0.000029573239,0.00008354855,0.000027925566,0.000032231714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980693,0.000106218955,0.00049828814,0.0005335865,0.00034389863,0.00044874285],"domain_scores_gemma":[0.9988785,0.00022761956,0.0002222325,0.00041445877,0.00016835493,0.00008884548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063646695,0.00022063183,0.00031685206,0.00029879616,0.00025485546,0.000102676524,0.0006240109,0.00010277767,0.0000024783935],"category_scores_gemma":[0.000043572178,0.00019269876,0.0001604177,0.0009675259,0.000059299684,0.00019709583,0.00015867694,0.00013821539,0.000024590943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057671437,0.00035574517,0.00027797415,0.00054366654,0.00023173633,0.00007202145,0.006076194,0.57609653,0.19256234,0.10969315,0.018614909,0.09541805],"study_design_scores_gemma":[0.00044275896,0.00039177528,0.00040816818,0.00008888892,0.000008653495,0.000013458915,0.000025070556,0.9865152,0.009088568,0.0020986486,0.0006897679,0.00022902322],"about_ca_topic_score_codex":0.000033761607,"about_ca_topic_score_gemma":0.0000033405788,"teacher_disagreement_score":0.43599626,"about_ca_system_score_codex":0.00002443437,"about_ca_system_score_gemma":0.000095092335,"threshold_uncertainty_score":0.7858028},"labels":[],"label_agreement":null},{"id":"W4388581200","doi":"10.1145/3624062.3624221","title":"Enabling Scalable VQE Simulation on Leading HPC Systems","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantum computer; Computer science; Scalability; Qubit; Supercomputer; Quantum circuit; Quantum; Quantum simulator; Quantum algorithm; Computational science; Computer engineering; Quantum network; Parallel computing; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.027347915438019742,"score_gpt":0.27609675261081973,"score_spread":0.2487488371728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388581200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11682356,0.000049908504,0.87480783,0.0007454409,0.0012039214,0.00014176757,6.145766e-7,0.0016632368,0.004563699],"genre_scores_gemma":[0.99294436,0.0000030933072,0.003748856,0.00018457815,0.00022655854,0.000003496478,0.0000019137985,0.0000106320995,0.0028764918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988528,0.00004771239,0.00016515264,0.00034567612,0.0002692655,0.00031938712],"domain_scores_gemma":[0.9991833,0.00031758272,0.000045939592,0.00034798737,0.000039104714,0.00006606508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003997154,0.00010853661,0.00012444917,0.00021626485,0.00023267468,0.00031567374,0.00039746187,0.000043780856,0.000004444148],"category_scores_gemma":[0.000042563082,0.000087647975,0.000043324562,0.00074241945,0.000009924966,0.00015396954,0.00016283647,0.000128138,0.00064650044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.302824e-7,0.000009564664,0.000024395309,0.0000115552075,0.00000381953,0.000009297412,0.00018352833,0.95683753,0.00016148813,0.016446814,0.0005060587,0.025805235],"study_design_scores_gemma":[0.000099248115,0.00005804677,0.00009952857,0.000056661906,9.4629473e-7,0.0000034134764,0.00001703835,0.99212116,0.00028350964,0.00067877816,0.0064600287,0.000121654855],"about_ca_topic_score_codex":0.000022154158,"about_ca_topic_score_gemma":5.3250596e-7,"teacher_disagreement_score":0.8761208,"about_ca_system_score_codex":0.000024630921,"about_ca_system_score_gemma":0.000018896242,"threshold_uncertainty_score":0.83096707},"labels":[],"label_agreement":null},{"id":"W4388581224","doi":"10.1145/3624062.3624222","title":"QASMTrans: A QASM Quantum Transpiler Framework for NISQ Devices","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Battelle; Lawrence Berkeley National Laboratory; Office of Science; Pacific Northwest National Laboratory; National Energy Research Scientific Computing Center; U.S. Department of Energy","keywords":"Computer science; Quantum computer; Quantum; Theoretical computer science; Physics","score_opus":0.023504346799808708,"score_gpt":0.2819218628077784,"score_spread":0.2584175160079697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388581224","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028679335,0.000099561876,0.96159774,0.006839152,0.0007878346,0.00027621983,0.000008292279,0.0014313284,0.00028053124],"genre_scores_gemma":[0.4026785,0.00001809635,0.59515065,0.0014485525,0.000305727,0.00006873286,0.000007381595,0.000028902052,0.0002934755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835145,0.000036698362,0.00025574202,0.0005394442,0.0002579125,0.0005587251],"domain_scores_gemma":[0.9986109,0.00065682735,0.000048861588,0.0005064374,0.000053246564,0.00012371872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003342593,0.00019976842,0.00021568454,0.00015718203,0.00026968628,0.00016653766,0.0009368539,0.00011471014,0.000019949648],"category_scores_gemma":[0.000043404794,0.00015865851,0.0001868017,0.00087379885,0.00003716221,0.00017435734,0.00008428101,0.00020738365,0.00013052078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008297337,0.000050249546,0.00008786463,0.0000854543,0.00003832922,0.000018067727,0.002283978,0.0037718688,0.00022064378,0.89377004,0.0026120765,0.09705311],"study_design_scores_gemma":[0.0002438715,0.00013958008,0.0009442927,0.00006660374,0.0000057135167,0.000007643393,0.000051258943,0.8202053,0.00046674753,0.15457271,0.023028918,0.0002673776],"about_ca_topic_score_codex":0.000016286836,"about_ca_topic_score_gemma":0.000010615805,"teacher_disagreement_score":0.8164334,"about_ca_system_score_codex":0.000008718247,"about_ca_system_score_gemma":0.000048208392,"threshold_uncertainty_score":0.64699066},"labels":[],"label_agreement":null},{"id":"W4388651578","doi":"10.1109/msec.2023.3324516","title":"IEEE Computer Society Seeks Applicants for Editors in Chief","year":2023,"lang":"en","type":"article","venue":"IEEE Security & Privacy","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; University of Waterloo; Jinan University; National Natural Science Foundation of China","keywords":"Editor in chief; Engineering ethics; Management; Computer science; Political science; Sociology; Engineering; Economics","score_opus":0.013998879636996161,"score_gpt":0.26448860957104225,"score_spread":0.2504897299340461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388651578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5460982,0.000030612126,0.4413831,0.0028544168,0.0079862615,0.0006778186,0.000025726062,0.0008909232,0.00005298509],"genre_scores_gemma":[0.9328149,0.00002723957,0.05633523,0.0010879076,0.009506782,0.0001007898,0.00001720019,0.00005001483,0.000059923033],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997488,0.000065930195,0.0003884923,0.0008408544,0.00040341183,0.00081326265],"domain_scores_gemma":[0.9985079,0.00033748904,0.000118843214,0.00079812866,0.00007060053,0.00016700118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000652006,0.0002963204,0.00035728188,0.00016281972,0.00025411294,0.00020289376,0.0016694386,0.00016994782,0.000002306033],"category_scores_gemma":[0.000021039476,0.00028492487,0.00028893675,0.0010994591,0.000073129544,0.00021871564,0.0004775101,0.0004708165,0.00007076589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036017398,0.00072399905,0.0015001781,0.00046668487,0.00017209885,0.00010877216,0.03666081,0.029894195,0.002171368,0.003271154,0.676581,0.24841371],"study_design_scores_gemma":[0.00078926166,0.000109834524,0.0017404046,0.000056755096,0.0000042531246,0.000010171774,0.00001604723,0.94332415,0.0012226544,0.015537652,0.03680617,0.0003826257],"about_ca_topic_score_codex":0.000054889675,"about_ca_topic_score_gemma":0.0000143595225,"teacher_disagreement_score":0.91343,"about_ca_system_score_codex":0.0000594352,"about_ca_system_score_gemma":0.00010826884,"threshold_uncertainty_score":0.9999603},"labels":[],"label_agreement":null},{"id":"W4388652902","doi":"10.4204/eptcs.394.2","title":"Generators and Relations for 2-Qubit Clifford+T Operators","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Qubit; Mathematics; Computer science; Physics; Quantum; Quantum mechanics","score_opus":0.005236406282705447,"score_gpt":0.2392558016829437,"score_spread":0.23401939540023825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388652902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49289742,0.00006876262,0.50301945,0.0026238526,0.00031988657,0.00036102594,0.0000010689726,0.00041495232,0.0002936107],"genre_scores_gemma":[0.92204255,0.000015250271,0.07739184,0.00032242847,0.00015650832,0.00004389717,7.9796206e-7,0.000013537749,0.000013173949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717444,0.000017113893,0.00030194747,0.00094225764,0.00040270522,0.001161521],"domain_scores_gemma":[0.999139,0.00021441457,0.0000607739,0.00023049628,0.00015986018,0.00019542454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021274139,0.00020941763,0.00021513138,0.00051712693,0.0006573764,0.00058112305,0.0014302395,0.000073988514,0.00000246314],"category_scores_gemma":[0.00019069853,0.00017977004,0.000051556086,0.0032483554,0.000851242,0.0005401146,0.0007902469,0.00036624412,0.000012936286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034711625,0.000016299995,0.0002785891,0.000008730647,0.0000028433292,0.0000016180094,0.0005826969,0.00055907515,0.00041524012,0.9715014,0.00013964542,0.026490403],"study_design_scores_gemma":[0.00023989768,0.00023086749,0.0008196238,0.00002271625,0.0000018103655,0.000025299953,0.000009130841,0.7332126,0.0010710504,0.26376617,0.0004131533,0.00018766678],"about_ca_topic_score_codex":0.0000013069977,"about_ca_topic_score_gemma":8.2158516e-7,"teacher_disagreement_score":0.73265356,"about_ca_system_score_codex":0.00011854811,"about_ca_system_score_gemma":0.00025481,"threshold_uncertainty_score":0.733081},"labels":[],"label_agreement":null},{"id":"W4388667449","doi":"10.4204/eptcs.394.18","title":"Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Controlled NOT gate; Qubit; Quantum circuit; Computer science; Quantum; Physics; Topology (electrical circuits); Quantum gate; Quantum error correction; Quantum mechanics; Electrical engineering; Engineering","score_opus":0.006984824673843871,"score_gpt":0.23441218892405868,"score_spread":0.22742736425021481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388667449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20483153,0.000020919435,0.79201734,0.0015257191,0.00021897067,0.00045024775,0.0000020611906,0.00064544956,0.00028777364],"genre_scores_gemma":[0.9549712,0.0000058810647,0.044655435,0.00016442778,0.000088595276,0.000080352744,0.0000017698032,0.000026199326,0.0000061684395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569094,0.00003070865,0.0004167302,0.0012990215,0.00079765514,0.001764956],"domain_scores_gemma":[0.99836266,0.00066174957,0.00016156113,0.00037290485,0.00025946618,0.00018163401],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030982653,0.0003234277,0.00036069134,0.0006446027,0.00070072315,0.0006703505,0.002508519,0.00008511103,0.0000028107218],"category_scores_gemma":[0.00029561215,0.0002649001,0.00008459496,0.004257158,0.0009112277,0.0006444113,0.0006373667,0.00049550715,0.000017806737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017340573,0.000038076516,0.00016653276,0.000028161468,0.0000068155337,0.0000046014943,0.0007104719,0.002736263,0.0006998472,0.95932436,0.000014371413,0.03625317],"study_design_scores_gemma":[0.0002766235,0.00037768047,0.001475486,0.00012460284,0.0000048745096,0.00005493478,0.000018431485,0.77266747,0.0011238726,0.22352439,0.000043605167,0.0003080499],"about_ca_topic_score_codex":0.000002705318,"about_ca_topic_score_gemma":0.0000021199999,"teacher_disagreement_score":0.7699312,"about_ca_system_score_codex":0.00031183663,"about_ca_system_score_gemma":0.00036518901,"threshold_uncertainty_score":0.99998033},"labels":[],"label_agreement":null},{"id":"W4388667510","doi":"10.4204/eptcs.394.17","title":"Symbolic Synthesis of Clifford Circuits and Beyond","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; McGill University; Simon Fraser University","funders":"","keywords":"Electronic circuit; Computer science; Theoretical computer science; Engineering; Electrical engineering","score_opus":0.00466237897613747,"score_gpt":0.22454490373767944,"score_spread":0.21988252476154196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388667510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8712371,0.00010774354,0.12368269,0.0016347948,0.0002487794,0.00022312727,9.578054e-7,0.00037522038,0.0024895922],"genre_scores_gemma":[0.98875254,0.00004108222,0.010958096,0.00015177898,0.00006864461,0.0000130937415,1.4646874e-7,0.000010887925,0.0000037080486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704057,0.00002547831,0.00036043042,0.00084892166,0.00061880326,0.0011057674],"domain_scores_gemma":[0.9989461,0.00035768148,0.00010440378,0.0002875346,0.00013410277,0.00017019533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023557045,0.00020781162,0.00032090166,0.00066085893,0.00024312547,0.00024069691,0.0019850652,0.000068565336,0.0000025519817],"category_scores_gemma":[0.00026905193,0.00017890042,0.000052780615,0.0039265146,0.0014882823,0.00040712405,0.0011808028,0.00037914715,0.000008680699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002028213,0.000024863413,0.00027101187,0.00002442809,0.0000033759418,0.0000036631495,0.00070307014,0.000083122075,0.0009682769,0.85925436,0.000014981489,0.1386468],"study_design_scores_gemma":[0.00013078006,0.00018968275,0.003009198,0.0000622322,0.0000026547978,0.00005747324,0.000014000632,0.6951214,0.007501437,0.29368988,0.000035628364,0.00018563992],"about_ca_topic_score_codex":0.0000020953894,"about_ca_topic_score_gemma":3.709098e-7,"teacher_disagreement_score":0.69503826,"about_ca_system_score_codex":0.00006977327,"about_ca_system_score_gemma":0.00019436273,"threshold_uncertainty_score":0.72953475},"labels":[],"label_agreement":null},{"id":"W4388671786","doi":"10.22331/q-2023-11-14-1181","title":"Composite Quantum Simulations","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Toronto","funders":"U.S. Department of Energy","keywords":"Hamiltonian (control theory); Probabilistic logic; Computer science; Bounded function; Channel (broadcasting); Composite number; Asymptotically optimal algorithm; Mathematical optimization; Quantum; Applied mathematics; Algorithm; Statistical physics; Mathematics; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.018393238405512147,"score_gpt":0.26682561183954195,"score_spread":0.2484323734340298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388671786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7009338,0.000068366404,0.29017732,0.004419594,0.0014496874,0.00016460035,0.000015566462,0.0023076525,0.00046341686],"genre_scores_gemma":[0.9914719,0.000007858578,0.00771029,0.00033786357,0.00018808198,0.000004967464,0.000020286036,0.000020626005,0.00023813508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983339,0.000082395556,0.00026730978,0.00046605166,0.0003412129,0.0005091527],"domain_scores_gemma":[0.99873453,0.00029198773,0.00007866851,0.0006914465,0.00006397271,0.00013937784],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024138257,0.00018657907,0.00019625462,0.00027588685,0.00039628445,0.00020499292,0.00091310363,0.00006590947,0.000015325757],"category_scores_gemma":[0.00004476122,0.00016858058,0.000106498155,0.0014587175,0.000049796123,0.00020544884,0.0003972238,0.00022849286,0.0008768523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009065758,0.00016252884,0.0019034537,0.000050529536,0.000065565204,0.00023634091,0.0024037114,0.22184938,0.009077713,0.69806004,0.017071374,0.049110293],"study_design_scores_gemma":[0.00018789811,0.000048748883,0.006609295,0.00002223023,0.0000033504236,0.0000178425,0.000011649723,0.9434709,0.00020512904,0.04004634,0.009153579,0.00022306685],"about_ca_topic_score_codex":0.00002679869,"about_ca_topic_score_gemma":0.0000027982246,"teacher_disagreement_score":0.7216215,"about_ca_system_score_codex":0.000019012376,"about_ca_system_score_gemma":0.00004939785,"threshold_uncertainty_score":0.99990106},"labels":[],"label_agreement":null},{"id":"W4388698905","doi":"10.1038/s41598-023-46497-y","title":"The power of one clean qubit in supervised machine learning","year":2023,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Qubit; Quantum entanglement; Coherence (philosophical gambling strategy); Quantum computer; Kernel (algebra); Quantum; Noise (video); Quantum technology; IBM; Quantum algorithm; Theoretical computer science; Artificial intelligence; Computer engineering; Algorithm; Open quantum system; Quantum mechanics; Physics; Mathematics; Discrete mathematics","score_opus":0.013312240291415015,"score_gpt":0.23301089741784134,"score_spread":0.21969865712642633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388698905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98986226,0.00015765315,0.003939116,0.0010714482,0.003989774,0.00015904024,4.4027604e-7,0.00023805468,0.00058221904],"genre_scores_gemma":[0.9964641,0.000005050515,0.0020256725,0.000014343941,0.000021614362,0.0000037284528,0.000004974349,0.000008345858,0.0014521962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797577,0.00010268189,0.0004434229,0.0005480513,0.00055811927,0.00037193432],"domain_scores_gemma":[0.99860024,0.00015301237,0.00018536235,0.00091855985,0.00007961921,0.0000631892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033300645,0.0000982538,0.00015149185,0.00023999176,0.00044736546,0.00031257985,0.0005714138,0.000032454547,0.000009012141],"category_scores_gemma":[0.00024622356,0.000069732094,0.00007659662,0.001976389,0.00015712008,0.000105203064,0.00044351773,0.00023511866,0.0000221105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025791358,0.00043248473,0.05450704,0.00011618662,0.00007998684,0.0028827798,0.027265664,0.11045351,0.04204457,0.010396853,0.010727025,0.7410681],"study_design_scores_gemma":[0.00018181492,0.00007471351,0.018267523,0.00008503501,0.0000024867045,0.000098751356,0.0001708899,0.9317204,0.0055134343,0.022397643,0.021267246,0.00022005886],"about_ca_topic_score_codex":0.000063438034,"about_ca_topic_score_gemma":0.000055387245,"teacher_disagreement_score":0.8212669,"about_ca_system_score_codex":0.000014208807,"about_ca_system_score_gemma":0.000084765576,"threshold_uncertainty_score":0.34408185},"labels":[],"label_agreement":null},{"id":"W4388720663","doi":"10.1109/epeps58208.2023.10314918","title":"On the Phase Estimation Amplitudes in the Quantum Matrix Equation Solver","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Manitoba","funders":"","keywords":"Solver; Eigenvalues and eigenvectors; Amplitude; Quantum; Quantum phase estimation algorithm; Phase (matter); Matrix (chemical analysis); Estimation; Applied mathematics; Work (physics); Mathematics; Computer science; Algorithm; Mathematical optimization; Quantum algorithm; Quantum mechanics; Physics; Quantum error correction; Engineering","score_opus":0.03743749479756277,"score_gpt":0.318297367028837,"score_spread":0.28085987223127423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388720663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2072297,0.000008253869,0.77786356,0.014017624,0.00016449831,0.00018147595,7.136786e-7,0.00020576941,0.00032843315],"genre_scores_gemma":[0.9931377,0.0000019081183,0.0058412747,0.000877666,0.000043819397,0.000018028353,0.0000043904274,0.00000445719,0.00007075278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897903,0.00013945499,0.00015445054,0.00020898941,0.00031522327,0.00020285981],"domain_scores_gemma":[0.9985108,0.0009845307,0.000045697092,0.0004234471,0.000018098903,0.000017419334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010727631,0.000090708694,0.00006692984,0.0001060187,0.00020870408,0.000258526,0.00071942137,0.000025745625,0.000011512436],"category_scores_gemma":[0.00012210892,0.00004314121,0.00004045323,0.0008263534,0.000024083109,0.00010711048,0.0000994828,0.00015974253,0.00021391627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031943705,0.000067030815,0.000009331831,0.000003970039,0.0000031964616,0.000007708009,0.0021151525,0.072176345,0.00009242835,0.8727913,0.003026903,0.049703464],"study_design_scores_gemma":[0.00016819338,0.00006742645,0.00072751025,0.000012090552,9.2818203e-7,0.000003017601,0.000054966535,0.8580347,0.000059430935,0.14058599,0.00022777467,0.000058013396],"about_ca_topic_score_codex":0.000037392147,"about_ca_topic_score_gemma":0.000005464008,"teacher_disagreement_score":0.785908,"about_ca_system_score_codex":0.000012893453,"about_ca_system_score_gemma":0.000022043743,"threshold_uncertainty_score":0.27495322},"labels":[],"label_agreement":null},{"id":"W4388747972","doi":"10.48550/arxiv.2311.08696","title":"Synthesis and Arithmetic of Single Qutrit Circuits","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Government of Canada; Innovation, Science and Economic Development Canada","keywords":"Qutrit; Exponent; Combinatorics; Toffoli gate; Unit (ring theory); Mathematics; Hadamard transform; Arithmetic; Discrete mathematics; Physics; Quantum mechanics; Quantum; Quantum gate; Quantum computer; Qubit","score_opus":0.06822019754354862,"score_gpt":0.18242164377462114,"score_spread":0.11420144623107252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388747972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6159215,0.0001143332,0.3824673,0.00019683044,0.00046143867,0.00015501985,0.000020237168,0.00032764176,0.00033569816],"genre_scores_gemma":[0.9965837,0.000087310706,0.0029161104,0.000019887875,0.00005497299,5.0301793e-7,0.0000019481115,0.000019476183,0.00031611702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983599,0.00011883707,0.00019968498,0.0009289406,0.00010120604,0.00029142667],"domain_scores_gemma":[0.9982319,0.00043802982,0.0002290158,0.00087636424,0.00009791458,0.0001268024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025414556,0.00025035362,0.00039540647,0.0003587306,0.000105723164,0.000088888606,0.0012381875,0.00020099402,0.0000035403446],"category_scores_gemma":[0.00009708125,0.00027881123,0.00015399155,0.00061981333,0.00013817163,0.00009107771,0.0022428408,0.0003812012,0.000016537651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018718638,0.0005497017,0.0046210326,0.0013409541,0.0005030382,0.0014077792,0.0015306304,0.79979813,0.0012017282,0.11152794,0.00034939268,0.07715098],"study_design_scores_gemma":[0.00018004097,0.00006671242,0.003585264,0.00034782075,0.000059999442,0.000012407791,0.000029053386,0.9501843,0.0010725525,0.0439817,0.000103231265,0.0003769452],"about_ca_topic_score_codex":0.0001488612,"about_ca_topic_score_gemma":0.000019211364,"teacher_disagreement_score":0.38066217,"about_ca_system_score_codex":0.000037334627,"about_ca_system_score_gemma":0.00008970544,"threshold_uncertainty_score":0.9999664},"labels":[],"label_agreement":null},{"id":"W4388748004","doi":"10.48550/arxiv.2311.08495","title":"Photonic implementation of the quantum Morra game","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Agencia Estatal de Investigación; European Regional Development Fund; Engineering and Physical Sciences Research Council; Ministerio de Ciencia e Innovación; Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Government of Canada","keywords":"Quantum pseudo-telepathy; Quantum; Nash equilibrium; Computer science; Game theory; Symmetric game; Outcome (game theory); Photonics; Qubit; Mathematical economics; Quantum information; Repeated game; Quantum computer; Normal-form game; Quantum mechanics; Physics; Mathematics; Quantum network","score_opus":0.057010334274853025,"score_gpt":0.21436557640783815,"score_spread":0.15735524213298513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388748004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7686,0.000022029692,0.22932875,0.00029984963,0.0011858876,0.00026092716,0.000021510492,0.00020997191,0.00007111665],"genre_scores_gemma":[0.99889153,0.000037678034,0.0006060453,0.000053999247,0.000053387303,7.1549516e-7,0.000005566072,0.000016697753,0.0003344053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984673,0.00014661285,0.00022268572,0.0007326363,0.00013345959,0.00029730043],"domain_scores_gemma":[0.99809754,0.00009687121,0.0003638138,0.0012806953,0.000095205454,0.0000658764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024825934,0.00022347018,0.00024774807,0.00016844244,0.00012743524,0.000062552244,0.0023288117,0.00012827401,0.000012727186],"category_scores_gemma":[0.000013962973,0.00019381264,0.00027978444,0.0007628341,0.000093216244,0.00008898057,0.003140176,0.0005023631,0.000021845011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052967166,0.00004278885,0.00276606,0.00010482794,0.00009786487,0.000061374834,0.0010431001,0.90551805,0.0001585157,0.08756034,0.00035318974,0.0022885595],"study_design_scores_gemma":[0.00023766204,0.00003352573,0.0105443355,0.00008092173,0.00002936,0.0000031308186,0.00010966875,0.9371548,0.00066081755,0.050785776,0.00014728433,0.00021266771],"about_ca_topic_score_codex":0.00060100254,"about_ca_topic_score_gemma":0.00008675617,"teacher_disagreement_score":0.23029155,"about_ca_system_score_codex":0.000082711,"about_ca_system_score_gemma":0.00025903241,"threshold_uncertainty_score":0.790345},"labels":[],"label_agreement":null},{"id":"W4388775618","doi":"10.1364/opticaq.502451","title":"Experimental solutions to the high-dimensional mean king’s problem","year":2023,"lang":"en","type":"article","venue":"Optica Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Canada Research Chairs","keywords":"Quantum entanglement; Dimension (graph theory); Prime (order theory); Scheme (mathematics); Computer science; Graph; Quantum; Qubit; Mathematics; Applied mathematics; Theoretical computer science; Algorithm; Quantum mechanics; Pure mathematics; Physics; Combinatorics; Mathematical analysis","score_opus":0.01974079449080656,"score_gpt":0.2523200553411261,"score_spread":0.23257926085031955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388775618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7372049,0.00020730779,0.18880005,0.06686032,0.0031533323,0.00078363245,0.000019209252,0.001826144,0.001145092],"genre_scores_gemma":[0.94516295,0.0000011823091,0.053302687,0.000812263,0.00023511889,0.00004632404,0.0000064531478,0.000018935467,0.00041410906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813944,0.00007964003,0.00021935118,0.0004879806,0.00045775442,0.0006158498],"domain_scores_gemma":[0.9989336,0.00014590668,0.000047196518,0.0006498426,0.00005292989,0.00017049455],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047377063,0.00017790873,0.00014914777,0.00013490589,0.00072984974,0.00020884082,0.0010258795,0.00004393113,0.000018394405],"category_scores_gemma":[0.000028634424,0.00012242557,0.00008712177,0.00093394436,0.000063813364,0.00010538111,0.0010340723,0.00021317392,0.0010756418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009296161,0.00017674996,0.000010808548,0.000009038226,0.00004389015,0.00007381249,0.0037609278,0.08050767,0.012549412,0.8522132,0.037524886,0.013120299],"study_design_scores_gemma":[0.00018091827,0.00019513707,0.0007108082,0.000034560122,0.0000043407513,0.00004178662,0.000072970615,0.981428,0.0019656194,0.0060555185,0.009067355,0.00024293926],"about_ca_topic_score_codex":0.00007219342,"about_ca_topic_score_gemma":0.000007436351,"teacher_disagreement_score":0.9009204,"about_ca_system_score_codex":0.000035092296,"about_ca_system_score_gemma":0.000070641356,"threshold_uncertainty_score":0.99970216},"labels":[],"label_agreement":null},{"id":"W4388793082","doi":"10.1007/s42484-023-00132-1","title":"A semi-agnostic ansatz with variable structure for variational quantum algorithms","year":2023,"lang":"en","type":"article","venue":"Quantum Machine Intelligence","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Los Alamos National Laboratory; Agencia Estatal de Investigación; Office of Science; Generalitat de Catalunya; Advanced Scientific Computing Research; Laboratory Directed Research and Development; U.S. Department of Energy","keywords":"Ansatz; Computer science; Quantum computer; Algorithm; Quantum; Quantum algorithm; Quantum circuit; Randomness; Theoretical computer science; Quantum network; Mathematics; Physics; Quantum mechanics","score_opus":0.013358805885927432,"score_gpt":0.2585341750718328,"score_spread":0.24517536918590535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388793082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010143733,0.00020248145,0.9848156,0.0017521027,0.0011862217,0.000611448,0.00022065615,0.000998756,0.00006901217],"genre_scores_gemma":[0.73740005,0.00003469071,0.260821,0.0005697779,0.0005447303,0.00009999774,0.0001823954,0.00008389793,0.00026345527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996464,0.00011666624,0.0005780803,0.0011444736,0.0007265925,0.00097015186],"domain_scores_gemma":[0.9968238,0.0014323504,0.00025151152,0.0009327604,0.00031100516,0.00024858955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066991907,0.0005094396,0.00045552925,0.00038725106,0.0005679931,0.00035735077,0.001776713,0.00016210436,0.00006080618],"category_scores_gemma":[0.00034948174,0.00039857483,0.00013666885,0.0022485266,0.000119367774,0.0003556053,0.00037397418,0.0005112052,0.000088770685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006050386,0.00012017217,0.00030787388,0.00013836757,0.000118305186,0.000083009676,0.0010518862,0.47494566,0.0006082901,0.48114595,0.0015540248,0.03986598],"study_design_scores_gemma":[0.00023616715,0.00047676874,0.00044363088,0.00008522324,0.000017717697,0.00014730991,0.000028686847,0.8284621,0.000558173,0.16640681,0.0026455626,0.00049182534],"about_ca_topic_score_codex":0.00016465278,"about_ca_topic_score_gemma":0.00001608055,"teacher_disagreement_score":0.7272563,"about_ca_system_score_codex":0.00006062904,"about_ca_system_score_gemma":0.00031350437,"threshold_uncertainty_score":0.99984664},"labels":[],"label_agreement":null},{"id":"W4388843123","doi":"10.48550/arxiv.2311.10137","title":"Optimal twirling depths for shadow tomography in the presence of noise","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Basic Energy Sciences; Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Office of Science; U.S. Department of Energy","keywords":"Quantum entanglement; Upper and lower bounds; Noise (video); Entropy (arrow of time); Algorithm; State (computer science); Mathematics; Computer science; Statistical physics; Physics; Mathematical analysis; Image (mathematics); Quantum mechanics; Quantum; Artificial intelligence","score_opus":0.05903631953796528,"score_gpt":0.2073929302763002,"score_spread":0.14835661073833492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388843123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38168278,0.000047813293,0.6169351,0.00017532779,0.000535154,0.0003993824,0.000017606933,0.00011851035,0.00008833901],"genre_scores_gemma":[0.9799708,0.000031086198,0.019742662,0.00004400394,0.00007703622,0.0000032686692,0.00000656228,0.0000149208445,0.000109671004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827677,0.00014258258,0.00023074183,0.0008561759,0.0001231307,0.00037061135],"domain_scores_gemma":[0.99790704,0.0006528575,0.0002226879,0.0010541849,0.00010299871,0.000060233408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006138866,0.00023849914,0.00029688157,0.0004183274,0.00012301569,0.00009128392,0.0031242745,0.00016119024,0.0000010585093],"category_scores_gemma":[0.00006904554,0.00021125146,0.00031208093,0.0011493271,0.0001119074,0.000111364396,0.0015465826,0.0005400682,0.000003696038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015218542,0.00005738519,0.0015992025,0.000107398395,0.000030165478,0.000084051004,0.0010310351,0.9740658,0.000015202414,0.021844245,0.00012965722,0.0010206518],"study_design_scores_gemma":[0.0002731324,0.00006630694,0.0030221224,0.0001749231,0.00001947928,0.000002975054,0.000120779856,0.9697539,0.00006316271,0.026178345,0.00009743526,0.00022742055],"about_ca_topic_score_codex":0.00021455671,"about_ca_topic_score_gemma":0.000059361802,"teacher_disagreement_score":0.598288,"about_ca_system_score_codex":0.000025894733,"about_ca_system_score_gemma":0.00011202972,"threshold_uncertainty_score":0.8614585},"labels":[],"label_agreement":null},{"id":"W4388853973","doi":"10.1038/s41534-023-00788-4","title":"Approximate symmetries and quantum error correction","year":2023,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Army Research Office; Air Force Office of Scientific Research; Institute for Quantum Information and Matter, California Institute of Technology; Ministry of Colleges and Universities; Multidisciplinary University Research Initiative; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Tsinghua University; Division of Mathematical Sciences; Government of Canada; National Science Foundation","keywords":"Quantum computer; Homogeneous space; Computation; Quantum; Quantum error correction; Mathematics; Symmetry (geometry); Series (stratigraphy); Quantum operation; Quantum algorithm; Computer science; Algebra over a field; Discrete mathematics; Pure mathematics; Quantum mechanics; Algorithm; Open quantum system; Physics; Geometry","score_opus":0.012104923276276365,"score_gpt":0.2356387108706843,"score_spread":0.22353378759440795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388853973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44588405,0.00007483132,0.54578227,0.00215407,0.0032315855,0.0002910991,0.0000067418855,0.0018395075,0.000735813],"genre_scores_gemma":[0.9958534,0.00009784608,0.003278685,0.0004853704,0.000105371604,0.000021640539,0.000051484192,0.00001101023,0.00009519583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986576,0.000050194616,0.0003725792,0.00021177482,0.0003467299,0.00036116585],"domain_scores_gemma":[0.99911463,0.00014167088,0.00018233224,0.00033065127,0.00013544306,0.000095297226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055993866,0.00017760039,0.00017108655,0.00052574556,0.00037915772,0.000441696,0.00034649894,0.000089799374,0.000002974247],"category_scores_gemma":[0.0001945533,0.00015712202,0.000050991366,0.0013154973,0.000052876665,0.0018701125,0.00025773406,0.00020800842,0.00026643256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003750527,0.00003832962,0.0007063383,0.00020206478,0.000035707028,0.000013342225,0.00979079,0.008938323,0.00017367837,0.20850745,0.02223998,0.7493165],"study_design_scores_gemma":[0.0002338295,0.000101808706,0.0060062497,0.000034790584,0.0000036250908,0.000071589864,0.0003215495,0.97426236,0.00017426717,0.006877567,0.011709656,0.0002027224],"about_ca_topic_score_codex":0.00004174329,"about_ca_topic_score_gemma":0.0000028208392,"teacher_disagreement_score":0.96532404,"about_ca_system_score_codex":0.000027556802,"about_ca_system_score_gemma":0.00004538274,"threshold_uncertainty_score":0.640725},"labels":[],"label_agreement":null},{"id":"W4388981622","doi":"10.1007/978-3-031-37966-6_5","title":"Structure-Aware Minor-Embedding for Machine Learning in Quantum Annealing Processors","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantum annealing; Qubit; Computer science; Quantum; Embedding; Minor (academic); Quantum computer; Simulated annealing; Probabilistic logic; Boltzmann machine; Theoretical computer science; Algorithm; Deep learning; Artificial intelligence; Quantum mechanics; Physics","score_opus":0.0207828965451506,"score_gpt":0.26052398362800705,"score_spread":0.23974108708285646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388981622","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035824836,0.0015396099,0.9569975,0.002324179,0.0039956057,0.002434449,0.00023897114,0.0048260195,0.024061186],"genre_scores_gemma":[0.10705754,0.0001857111,0.15314724,0.0008320653,0.0021652807,0.000081632716,0.0005586422,0.0007742877,0.7351976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997105,0.000028747196,0.0006073399,0.0011408671,0.00043786166,0.00068020367],"domain_scores_gemma":[0.99846,0.0004497574,0.00034216914,0.0004886708,0.00012872944,0.00013065629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004074503,0.0005997326,0.00066214934,0.00063611416,0.00029820664,0.00027314472,0.0012094072,0.0003847893,0.000025647956],"category_scores_gemma":[0.0000927601,0.0005311642,0.0002276599,0.00021517849,0.000044259188,0.00014636597,0.00056481286,0.0011332852,0.000022503844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033693363,0.000022462356,0.00013484352,0.0011749645,0.00015251056,0.00024499983,0.0023691154,0.46586642,0.000071930655,0.34920433,0.00088525325,0.17983946],"study_design_scores_gemma":[0.00031798318,0.00011971387,0.00001652969,0.00048587497,0.000011132168,0.000026811776,0.00001375436,0.9315962,0.000047305773,0.05649672,0.010237021,0.00063095114],"about_ca_topic_score_codex":0.0000672926,"about_ca_topic_score_gemma":0.0001598301,"teacher_disagreement_score":0.8038503,"about_ca_system_score_codex":0.00007118998,"about_ca_system_score_gemma":0.00015532708,"threshold_uncertainty_score":0.999714},"labels":[],"label_agreement":null},{"id":"W4389116444","doi":"10.48550/arxiv.2311.15873","title":"Taming Quantum Time Complexity","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; QuantERA; European Commission; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Quantum; Quantum complexity theory; Computer science; Computational complexity theory; Subroutine; Reduction (mathematics); Bounded function; Quantum algorithm; Time complexity; Algorithm; Theoretical computer science; Mathematics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.09829531483341708,"score_gpt":0.19959810294785618,"score_spread":0.1013027881144391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389116444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2957291,0.000033821038,0.6993225,0.0004745461,0.0013896027,0.00024241323,0.00003155295,0.0017577288,0.0010187151],"genre_scores_gemma":[0.9896269,0.000027101432,0.0071820575,0.000115824616,0.00022550997,5.614922e-7,0.00003079418,0.000041071908,0.0027501967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972999,0.0001983225,0.0002475796,0.0015120197,0.00015673954,0.00058541977],"domain_scores_gemma":[0.99757904,0.00022074202,0.000268447,0.0015965395,0.000116718,0.00021850194],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040500454,0.00041957322,0.0004629459,0.00034812657,0.00034347663,0.0002357763,0.002973456,0.0002769458,0.000023649623],"category_scores_gemma":[0.000039099195,0.0004722292,0.0003148098,0.00084707176,0.00018024108,0.00016936575,0.0052971533,0.0009919504,0.0009299206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010748218,0.00009079383,0.00022750752,0.00011528864,0.00012832684,0.0008344721,0.00062852324,0.8105041,0.000049962313,0.18303584,0.001850208,0.002524283],"study_design_scores_gemma":[0.000191908,0.000034994184,0.00079728826,0.00011728143,0.000020490686,0.000006680292,0.0000142733015,0.84261215,0.00002709819,0.15531617,0.0004070206,0.00045462747],"about_ca_topic_score_codex":0.00023175322,"about_ca_topic_score_gemma":0.0000070606825,"teacher_disagreement_score":0.6938978,"about_ca_system_score_codex":0.00013264075,"about_ca_system_score_gemma":0.00017867931,"threshold_uncertainty_score":0.99984795},"labels":[],"label_agreement":null},{"id":"W4389159024","doi":"10.1109/qce57702.2023.00019","title":"Towards Fidelity-Optimal Qubit Mapping on NISQ Computers","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Quantum computer; Qubit; Quantum algorithm; Quantum circuit; Swap (finance); Algorithm; Parallel computing; Computer engineering; Quantum; Theoretical computer science; Quantum error correction","score_opus":0.02098109613177293,"score_gpt":0.2522517800198532,"score_spread":0.23127068388808028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389159024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11357077,0.00001346433,0.87160367,0.007076345,0.0011585418,0.00012777996,0.0000023692178,0.0019703468,0.0044767326],"genre_scores_gemma":[0.5489221,0.000008703494,0.44491267,0.004226462,0.0005003132,0.000010988699,0.000010764478,0.00002899925,0.0013789446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822253,0.000063300424,0.00024616183,0.00056155183,0.00039698862,0.0005094686],"domain_scores_gemma":[0.9989706,0.00019580315,0.000054826898,0.000590769,0.00004737047,0.00014059042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004021956,0.0001985613,0.0001980253,0.00026829055,0.00024306746,0.00024222094,0.0010519073,0.0000596571,0.000016619768],"category_scores_gemma":[0.000036204478,0.00016278587,0.000121958175,0.0010158191,0.00003650327,0.00013017446,0.0006471641,0.00025547363,0.00058270304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000452237,0.00005836095,0.000057114084,0.000025927962,0.00003721486,0.00015948768,0.0016733538,0.25353768,0.00023486807,0.05159833,0.03055525,0.6620579],"study_design_scores_gemma":[0.00019993106,0.00010706903,0.0032861647,0.00003776195,0.0000010640575,0.000018298564,0.000030405507,0.9793295,0.00022410939,0.002292063,0.014243168,0.00023043918],"about_ca_topic_score_codex":0.00005273141,"about_ca_topic_score_gemma":0.0000015284504,"teacher_disagreement_score":0.7257919,"about_ca_system_score_codex":0.000029083682,"about_ca_system_score_gemma":0.000056555677,"threshold_uncertainty_score":0.7489663},"labels":[],"label_agreement":null},{"id":"W4389159469","doi":"10.1109/qce57702.2023.10214","title":"Short-Depth Circuits and Error Mitigation for Large-Scale GHZ-State Preparation, and Benchmarking on IBM's 127-Qubit System","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Qubit; Computer science; Quantum computer; IBM; Quantum network; Quantum information science; Quantum circuit; Quantum information; Quantum technology; Computer engineering; Quantum algorithm; One-way quantum computer; Fidelity; Quantum sensor; Quantum; Quantum error correction; Theoretical computer science; Electronic engineering; Open quantum system; Quantum entanglement; Physics; Quantum mechanics; Telecommunications; Engineering","score_opus":0.01557206746629916,"score_gpt":0.26603753246580236,"score_spread":0.25046546499950323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389159469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60547006,0.000035378078,0.39246607,0.0004305811,0.00028828243,0.00039908144,0.000010915814,0.0004479246,0.00045170632],"genre_scores_gemma":[0.9858631,0.0000055164105,0.013597697,0.00011569803,0.00012706201,0.000036995,0.000016995298,0.000013034356,0.00022391928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862987,0.000049356306,0.00024348812,0.00053972733,0.00020676917,0.00033081172],"domain_scores_gemma":[0.9993196,0.00018395,0.000063661326,0.0002606059,0.00006412889,0.00010806855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005155784,0.00015657043,0.00017234404,0.00013807166,0.00036852647,0.00026849695,0.00019015136,0.000051699797,7.8010663e-7],"category_scores_gemma":[0.000018898518,0.00013429641,0.000039693456,0.00031192205,0.000021440022,0.00018262136,0.00014717985,0.00008714924,0.0000058117494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047716072,0.0001551975,0.007804953,0.0011728727,0.00014310883,0.000056067634,0.026091969,0.04403691,0.002082244,0.066892974,0.008882923,0.84263307],"study_design_scores_gemma":[0.00027520093,0.00017993819,0.015641725,0.00009712474,0.0000055630717,0.00002003912,0.00012636854,0.9808904,0.0006374427,0.0011737675,0.00077106815,0.00018134531],"about_ca_topic_score_codex":0.000006961161,"about_ca_topic_score_gemma":0.00003823931,"teacher_disagreement_score":0.9368535,"about_ca_system_score_codex":0.000021434898,"about_ca_system_score_gemma":0.00002442659,"threshold_uncertainty_score":0.54764485},"labels":[],"label_agreement":null},{"id":"W4389162631","doi":"10.1109/qce57702.2023.00146","title":"Fast Quantum Gate Design with Deep Reinforcement Learning Using Real-Time Feedback on Readout Signals","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Reinforcement learning; Quantum computer; Leakage (economics); Quantum gate; Qubit; Subspace topology; Quantum; Algorithm; Electronic engineering; Artificial intelligence; Engineering; Physics","score_opus":0.02537378919913591,"score_gpt":0.24989115294330408,"score_spread":0.22451736374416817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389162631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09125595,0.000006103822,0.9046462,0.00036311088,0.00012371452,0.00026348702,2.2540219e-7,0.0011643323,0.0021768333],"genre_scores_gemma":[0.797289,0.00002676724,0.19702995,0.00036825944,0.00021753696,0.000014115461,0.000010927034,0.000078195306,0.004965246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974696,0.0002103963,0.0003332055,0.00066641293,0.0005930844,0.00072731683],"domain_scores_gemma":[0.99865866,0.0003412086,0.00017419046,0.0005566649,0.0000904624,0.00017882309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074961595,0.00031855458,0.0003055067,0.00028920703,0.0004709176,0.00032909302,0.0006892021,0.00007118384,0.00004993],"category_scores_gemma":[0.000033889963,0.00023385296,0.00007918528,0.0011089685,0.000054665885,0.0001939958,0.00032204314,0.0003164429,0.00061873416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028382537,0.00001643442,0.000018791556,0.0000107819915,0.000027683258,0.000078166326,0.00068739586,0.98308843,0.004129054,0.0019235709,0.00021280267,0.009778517],"study_design_scores_gemma":[0.000382505,0.0007446352,0.00014275959,0.0001523998,0.000008159903,0.000035609697,0.00006704202,0.99549806,0.0020075392,0.0004654776,0.0001272321,0.0003685599],"about_ca_topic_score_codex":0.00009891539,"about_ca_topic_score_gemma":0.0000013985172,"teacher_disagreement_score":0.70761627,"about_ca_system_score_codex":0.000059096998,"about_ca_system_score_gemma":0.000095501,"threshold_uncertainty_score":0.9536247},"labels":[],"label_agreement":null},{"id":"W4389162714","doi":"10.1109/qce57702.2023.20328","title":"QWalkVis: Quantum Walks Visualization Application","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Quantum walk; Random walk; Visualization; Probabilistic logic; Quantum; Superposition principle; Computer science; Quantum computer; Statistical physics; Space (punctuation); Quantum algorithm; Theoretical computer science; Mathematics; Physics; Artificial intelligence; Quantum mechanics; Statistics","score_opus":0.010158687500364456,"score_gpt":0.2640601900278188,"score_spread":0.2539015025274543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389162714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032833025,0.000012265569,0.96247923,0.0014210215,0.0002680444,0.00011477431,5.496799e-7,0.0018413384,0.0010297269],"genre_scores_gemma":[0.9865394,0.000010700762,0.012330453,0.00043696654,0.000146027,0.000020778887,0.000017353761,0.00001296863,0.0004853414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990226,0.000035149464,0.00015612724,0.00033361863,0.0002181907,0.00023431111],"domain_scores_gemma":[0.9993791,0.000061482526,0.00004833086,0.00040341003,0.000047049154,0.00006064614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002462557,0.00009485291,0.00008564035,0.00015455477,0.0001540648,0.00011648445,0.0005061443,0.00004275789,0.000007898217],"category_scores_gemma":[0.000020870479,0.00008018045,0.000040408882,0.0012115148,0.0000151769855,0.00014256552,0.00021203962,0.00006908119,0.00058846746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001169517,0.000035341618,0.0002676675,0.000015511283,0.000008442505,0.0000062965264,0.0006331333,0.0077529405,0.002423686,0.7192009,0.0058031385,0.26385173],"study_design_scores_gemma":[0.00008389825,0.000026955873,0.002896221,0.0000057211946,0.0000010701473,0.0000054250763,0.000012847153,0.968417,0.00076185423,0.018823814,0.008850036,0.00011515463],"about_ca_topic_score_codex":0.000022609214,"about_ca_topic_score_gemma":0.0000029644561,"teacher_disagreement_score":0.96066403,"about_ca_system_score_codex":0.000012389495,"about_ca_system_score_gemma":0.000023059427,"threshold_uncertainty_score":0.7563755},"labels":[],"label_agreement":null},{"id":"W4389162808","doi":"10.1109/qce57702.2023.00028","title":"Exploring the Potential of Qutrits for Quantum Optimization of Graph Coloring","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Qutrit; Qubit; Computer science; Quantum computer; Encoding (memory); Quantum; Graph; Set (abstract data type); Quantum circuit; Theoretical computer science; Topology (electrical circuits); Algorithm; Mathematics; Quantum error correction; Artificial intelligence; Quantum mechanics; Physics","score_opus":0.04738110117247538,"score_gpt":0.2484844770129345,"score_spread":0.20110337584045912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389162808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24804863,0.000013533005,0.75076395,0.00045716894,0.00044427934,0.00013308141,0.0000018460761,0.00010835777,0.000029169552],"genre_scores_gemma":[0.912863,0.000031128624,0.0869683,0.00001547343,0.00006582278,0.000021642363,0.000001912627,0.0000071454183,0.000025538682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923855,0.00002770612,0.00021924927,0.00016716137,0.00017548414,0.0001718626],"domain_scores_gemma":[0.9993398,0.00019392198,0.00009634597,0.00024873065,0.00009797515,0.00002322101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003518255,0.00007025988,0.00012391903,0.00014231748,0.00011382077,0.000026001879,0.0004927319,0.000016672597,0.0000010033558],"category_scores_gemma":[0.00004002203,0.000047821002,0.0000921431,0.0007810361,0.00003246362,0.00014101599,0.0001837063,0.00005165519,7.9896165e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054512584,0.00001594369,0.000016867172,0.000035876696,0.000013164033,7.201789e-7,0.00039419506,0.9520544,0.0013181625,0.032008365,0.00007603611,0.01406084],"study_design_scores_gemma":[0.00017821175,0.000092506285,0.00085626106,0.000025719955,0.000004234836,0.0000019331733,0.000079762176,0.98986524,0.005910455,0.0028785449,0.000048852682,0.000058285154],"about_ca_topic_score_codex":0.000023517401,"about_ca_topic_score_gemma":0.0000010044296,"teacher_disagreement_score":0.6648144,"about_ca_system_score_codex":0.0000034286131,"about_ca_system_score_gemma":0.00002181195,"threshold_uncertainty_score":0.19500838},"labels":[],"label_agreement":null},{"id":"W4389162845","doi":"10.1109/qce57702.2023.10241","title":"Effect of Repetitions and Entanglement on Performance of Pauli Feature Map","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Earl Haig Secondary School","funders":"","keywords":"Quantum entanglement; Pauli exclusion principle; Computer science; ENCODE; Feature vector; Kernel (algebra); Quantum; Classifier (UML); Feature (linguistics); Quantum machine learning; Support vector machine; Quantum state; Pattern recognition (psychology); Theoretical computer science; Artificial intelligence; Quantum computer; Topology (electrical circuits); Physics; Mathematics; Quantum mechanics; Discrete mathematics; Combinatorics","score_opus":0.004812421092695053,"score_gpt":0.23211253473844848,"score_spread":0.22730011364575342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389162845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9958573,0.000031025986,0.0020525358,0.0011000559,0.0001533438,0.00009906801,0.000003578092,0.000093148796,0.00060994556],"genre_scores_gemma":[0.9945641,0.000017599466,0.0049824766,0.00004457242,0.000023145883,0.0000033878891,0.0000024016356,0.0000031865081,0.0003591328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994371,0.000038598802,0.000096533666,0.0001607966,0.00015520693,0.00011178361],"domain_scores_gemma":[0.99952024,0.0001479,0.000045889003,0.00023947092,0.000017829374,0.000028660226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025998984,0.00006986339,0.00011370941,0.000085811225,0.0000504058,0.0000112705,0.0001817326,0.000022292194,0.0000049486944],"category_scores_gemma":[0.000010072683,0.000047480917,0.000033232733,0.0002609916,0.0000274503,0.000033423497,0.00014769087,0.000072091454,0.000007821064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010389548,0.00020030442,0.012576118,0.0017277172,0.00011569339,0.000047643854,0.0024481555,0.012096692,0.011574731,0.055894822,0.01955892,0.8836553],"study_design_scores_gemma":[0.0006342757,0.0039193323,0.021222753,0.00029393937,0.000009276313,0.000016236421,0.000015502319,0.8828391,0.08778499,0.00034472154,0.0027458584,0.0001740486],"about_ca_topic_score_codex":0.000004274355,"about_ca_topic_score_gemma":7.3839726e-7,"teacher_disagreement_score":0.88348126,"about_ca_system_score_codex":0.0000041089797,"about_ca_system_score_gemma":0.000008344964,"threshold_uncertainty_score":0.19362156},"labels":[],"label_agreement":null},{"id":"W4389167103","doi":"10.1109/qce57702.2023.10168","title":"Workshops Program","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Warrant; Engineering ethics; Incubator; Computer science; Engineering management; Public relations; Library science; Knowledge management; Political science; Engineering; Business","score_opus":0.014594087559188396,"score_gpt":0.2692498520495164,"score_spread":0.254655764490328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389167103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12069771,0.000047759997,0.829016,0.011449752,0.0012311033,0.00033689113,4.645898e-7,0.014231992,0.022988373],"genre_scores_gemma":[0.52025443,0.000007078332,0.4736688,0.00066740025,0.00024334983,0.000031363663,0.00000296839,0.000013165935,0.0051114173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993285,0.000015097886,0.00007388984,0.00020841093,0.00013250537,0.00024161523],"domain_scores_gemma":[0.9995651,0.00004964211,0.000013664654,0.0002988173,0.000015970558,0.00005679173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001327454,0.00006197717,0.000057361485,0.00007713391,0.00008536027,0.00013553922,0.0005149011,0.000023383847,0.000008912807],"category_scores_gemma":[0.000012254409,0.00004633566,0.00003775575,0.0009703402,0.000013983305,0.00006767055,0.00027534936,0.00008376664,0.0004771353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.6432175e-7,0.000014623845,0.0000454809,0.0000018507939,0.000002656314,0.000017545683,0.00012009403,0.0013188137,0.000016211496,0.019116564,0.0072430666,0.97210294],"study_design_scores_gemma":[0.00005612623,0.000035400975,0.003358495,0.0000053000276,3.6738012e-7,0.000008277979,0.000006178055,0.95353085,0.00008161569,0.0056876396,0.037147965,0.00008179952],"about_ca_topic_score_codex":0.0000033828255,"about_ca_topic_score_gemma":9.0235454e-7,"teacher_disagreement_score":0.9720211,"about_ca_system_score_codex":0.0000035569997,"about_ca_system_score_gemma":0.000014858937,"threshold_uncertainty_score":0.61327684},"labels":[],"label_agreement":null},{"id":"W4389168113","doi":"10.1109/qce57702.2023.10288","title":"QNotation: An Interactive Visual Tool to Lower Learning Barriers in Quantum Computing","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Notation; Computer science; Debugging; Quantum computer; Quantum; Theoretical computer science; Programming language; Mathematics; Quantum mechanics","score_opus":0.009233557438374413,"score_gpt":0.28970384333532945,"score_spread":0.28047028589695505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389168113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70842373,0.0000021381738,0.28943726,0.00066429016,0.0005782765,0.00010520046,2.6081227e-7,0.0005795719,0.00020927661],"genre_scores_gemma":[0.9805379,5.1339214e-7,0.018546097,0.0005983383,0.00014802703,0.000004347282,0.000003615718,0.000015206278,0.00014595593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826634,0.0001589543,0.00027885166,0.0005618838,0.00027436845,0.00045962],"domain_scores_gemma":[0.9991944,0.00025516015,0.000059898513,0.00024043019,0.00006462069,0.00018552746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005849653,0.00016815265,0.00018155292,0.0003904415,0.00022987173,0.00027792613,0.0005489132,0.000047344252,0.000023126706],"category_scores_gemma":[0.00021666827,0.00015696345,0.000051872474,0.0015460715,0.000019037807,0.0003779824,0.00046820552,0.00037526255,0.00018508712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022156963,0.00005154451,0.0023345507,0.000009292427,0.000012552991,0.00015780231,0.017010031,0.71993333,0.00073803385,0.005885915,0.00034157405,0.25350323],"study_design_scores_gemma":[0.00021625584,0.0003107892,0.011311543,0.000043791442,8.104489e-7,0.0000097913235,0.0006476011,0.9855533,0.00018941874,0.00054630416,0.00092602236,0.0002443627],"about_ca_topic_score_codex":0.00007117651,"about_ca_topic_score_gemma":0.000019395962,"teacher_disagreement_score":0.2721142,"about_ca_system_score_codex":0.000047438487,"about_ca_system_score_gemma":0.000070010494,"threshold_uncertainty_score":0.64007837},"labels":[],"label_agreement":null},{"id":"W4389168147","doi":"10.1109/qce57702.2023.10274","title":"Reduced Gate Count for Quantum State Preparation of 2D Data","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Gate count; Computer science; Quantum circuit; Quantum; Quantum computer; Algorithm; Computer engineering; Image (mathematics); Quantum gate; Basis (linear algebra); Theoretical computer science; Electronic engineering; Computer hardware; Artificial intelligence; Mathematics; Quantum error correction; Engineering","score_opus":0.04466204834641457,"score_gpt":0.32694946333585495,"score_spread":0.2822874149894404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389168147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31937754,0.000018609537,0.6783481,0.0010489245,0.0004333936,0.00024559355,0.00005092211,0.00034714144,0.00012977338],"genre_scores_gemma":[0.9102941,0.000015763102,0.0887315,0.0001101745,0.00008989035,0.000012664134,0.00011089174,0.0000128176,0.00062216347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893624,0.000029119086,0.00023959423,0.00038622523,0.00019077853,0.00021805677],"domain_scores_gemma":[0.998704,0.00015570426,0.00009967521,0.0009194256,0.00007908922,0.00004210805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005798131,0.000086010245,0.00012948508,0.00008327595,0.00008322482,0.00006910928,0.0010246856,0.000022517368,0.0000024361148],"category_scores_gemma":[0.0000596117,0.00006931857,0.000032349737,0.00039971675,0.000021847278,0.00020557934,0.0004931397,0.000048703263,0.000019887786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013894337,0.0002639404,0.00007653725,0.0003984402,0.0001772143,0.000021440053,0.007912131,0.21753386,0.04705482,0.12208465,0.1480021,0.45633593],"study_design_scores_gemma":[0.0001732835,0.00011654231,0.0003535781,0.000015211241,0.0000025680781,0.0000026932107,0.000010531468,0.9751147,0.0029483924,0.017301727,0.0038687862,0.00009197444],"about_ca_topic_score_codex":0.000036266523,"about_ca_topic_score_gemma":0.00000849964,"teacher_disagreement_score":0.7575809,"about_ca_system_score_codex":0.0000070675283,"about_ca_system_score_gemma":0.000079143196,"threshold_uncertainty_score":0.2826729},"labels":[],"label_agreement":null},{"id":"W4389217483","doi":"10.48550/arxiv.2311.17384","title":"Bases for optimising stabiliser decompositions of quantum states","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; European Commission","keywords":"Stabiliser; Quantum computer; Superposition principle; Quantum; Qubit; Computation; Mathematics; Computer science; Quantum mechanics; Algorithm; Physics; Mathematical analysis; Materials science; Nanotechnology","score_opus":0.07810368578011745,"score_gpt":0.21734495635369036,"score_spread":0.1392412705735729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389217483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2737623,0.000031115258,0.72469056,0.00025699564,0.0005325026,0.0002718321,0.00012680476,0.000296228,0.000031674805],"genre_scores_gemma":[0.9510859,0.000064009306,0.048423085,0.00005106817,0.00007483496,0.00000197198,0.000063970976,0.000031230422,0.00020389269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824136,0.00009809169,0.00027480366,0.000922695,0.00009067398,0.0003723492],"domain_scores_gemma":[0.99772567,0.00067431806,0.00028771805,0.0009424099,0.0002442834,0.00012558988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002827029,0.00027973176,0.00038710152,0.0003242308,0.00022555538,0.000103184386,0.0013951459,0.00015126327,0.0000059593212],"category_scores_gemma":[0.000047845228,0.00030641945,0.0003261847,0.00051368406,0.00011246318,0.00014855764,0.0015208678,0.00033034215,0.000008641765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014640697,0.00007422236,0.0001347229,0.00016256912,0.000067098015,0.00003475121,0.0002727979,0.9573223,0.000047126246,0.041029174,0.00037617242,0.00046440554],"study_design_scores_gemma":[0.0002609412,0.00008802947,0.00023389023,0.00020132621,0.000042768443,0.0000021697244,0.00006857665,0.90138036,0.00034758824,0.09690514,0.00017304215,0.0002961702],"about_ca_topic_score_codex":0.00015053997,"about_ca_topic_score_gemma":0.000016012447,"teacher_disagreement_score":0.67732364,"about_ca_system_score_codex":0.000069592155,"about_ca_system_score_gemma":0.00018943178,"threshold_uncertainty_score":0.9999388},"labels":[],"label_agreement":null},{"id":"W4389235407","doi":"10.1073/pnas.2311014120","title":"Hybrid quantum algorithms for flow problems","year":2023,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Algorithm; Computer science; Quantum computer; Nonlinear system; Quantum algorithm; Quantum; Quantum phase estimation algorithm; Quantum simulator; Scaling; Mathematics; Physics; Geometry; Quantum mechanics","score_opus":0.04751076433755746,"score_gpt":0.2999600936950042,"score_spread":0.25244932935744674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389235407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9331475,0.0003301812,0.014294498,0.046980064,0.0005594531,0.0015919558,0.000116481235,0.00057248905,0.0024074109],"genre_scores_gemma":[0.9297534,0.000013236503,0.06964939,0.00024972737,0.00016294654,0.000026042359,2.1437309e-7,0.000005790939,0.00013922791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979492,0.0000056243002,0.00032151848,0.00037044258,0.0010798397,0.0002733706],"domain_scores_gemma":[0.99908984,0.000242893,0.00032700817,0.000014961011,0.00028439652,0.000040893847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019980106,0.000109424116,0.00016185088,0.00024872142,0.00035677198,0.000072258415,0.0022116574,0.000043405013,0.0000010489603],"category_scores_gemma":[0.00036536978,0.00007083296,0.0001241383,0.0014397235,0.00037377625,0.000384282,0.00042784176,0.00014017835,0.0000026587431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011141205,0.00014133808,0.00066354964,0.00046920317,0.000060088136,4.810434e-8,0.0015604299,0.06227568,0.095526814,0.7499335,0.019289428,0.07006877],"study_design_scores_gemma":[0.00010342534,0.000051572,0.0022086715,0.000059778973,0.0000021580329,0.000008499045,0.000013103783,0.7034261,0.026948346,0.2663985,0.0007083173,0.00007149108],"about_ca_topic_score_codex":0.0000023954358,"about_ca_topic_score_gemma":8.88817e-9,"teacher_disagreement_score":0.6411505,"about_ca_system_score_codex":0.00001489097,"about_ca_system_score_gemma":0.000044507222,"threshold_uncertainty_score":0.41098467},"labels":[],"label_agreement":null},{"id":"W4389298562","doi":"10.1103/physrevx.13.041041","title":"Exponential Quantum Speedup in Simulating Coupled Classical Oscillators","year":2023,"lang":"en","type":"article","venue":"Physical Review X","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Canadian Institute for Advanced Research","funders":"Australian Research Council; Office of Science; U.S. Department of Energy","keywords":"Speedup; Quantum; Exponential function; Statistical physics; Computer science; Physics; Quantum mechanics; Parallel computing; Mathematics; Mathematical analysis","score_opus":0.022074163141698404,"score_gpt":0.3122420985051946,"score_spread":0.29016793536349617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389298562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97852117,0.001482754,0.01405971,0.004274423,0.0005342481,0.00035294573,0.0000015939363,0.0005568025,0.00021637543],"genre_scores_gemma":[0.9974446,0.00040231552,0.0012273071,0.0004953579,0.00037394834,0.0000124168855,0.0000035736616,0.000016482561,0.000023977507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980601,0.00013443062,0.00034564247,0.000518672,0.00045326233,0.00048788468],"domain_scores_gemma":[0.9988411,0.0004204577,0.00009603799,0.00047172586,0.00003306998,0.00013758436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004403448,0.0002020166,0.00046974982,0.000098263234,0.000096536096,0.00007428946,0.0006631599,0.000029450823,0.0000065868526],"category_scores_gemma":[0.00025310795,0.00016223175,0.00020194332,0.001596296,0.000045933146,0.0001352185,0.00045075954,0.00033895444,0.00037499442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021176298,0.0011145844,0.0016231913,0.003201574,0.000092740884,0.0006564152,0.0026227054,0.088035375,0.008961886,0.38611406,0.0044860276,0.50307024],"study_design_scores_gemma":[0.0001768969,0.000046375244,0.001985279,0.00075975,0.000005541994,0.0000036917193,0.0000027347962,0.9791289,0.000044758228,0.015517002,0.0021269335,0.00020215733],"about_ca_topic_score_codex":0.000014452334,"about_ca_topic_score_gemma":0.0000017020332,"teacher_disagreement_score":0.8910935,"about_ca_system_score_codex":0.000028869188,"about_ca_system_score_gemma":0.00004834552,"threshold_uncertainty_score":0.66156185},"labels":[],"label_agreement":null},{"id":"W4389348730","doi":"10.1103/physrevresearch.5.043202","title":"Context-aware fidelity estimation","year":2023,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Benchmarking; Fidelity; Computer science; Context (archaeology); Algorithm; Qubit; Decoupling (probability); Unitary state; Computer engineering; Quantum; Physics; Telecommunications; Engineering; Quantum mechanics","score_opus":0.09189320250229528,"score_gpt":0.4444695896574953,"score_spread":0.3525763871552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389348730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22065616,0.03671832,0.61033994,0.11667133,0.0010669446,0.00424787,0.00003317733,0.0044993917,0.005766872],"genre_scores_gemma":[0.9950312,0.0017577069,0.0020660078,0.00062779366,0.00022437704,0.000068487265,0.000011251122,0.000012435385,0.00020076022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762726,0.00041452714,0.00018613705,0.00042118158,0.0008665925,0.00048431708],"domain_scores_gemma":[0.99814403,0.0007990745,0.0000354771,0.00064853084,0.00022946144,0.00014340221],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018546528,0.00010491947,0.00024208447,0.00010115296,0.00025670568,0.000113738824,0.0009563828,0.0000189055,0.000009343422],"category_scores_gemma":[0.0006865393,0.00007953459,0.000113127615,0.00211358,0.00008113621,0.00015270223,0.00067524717,0.0004852541,0.0017030961],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.955652e-7,0.000051640687,0.000008820938,0.000541773,0.0000062466547,0.000018134719,0.00015513893,0.0004344215,0.000095786054,0.027759306,0.020307284,0.95062053],"study_design_scores_gemma":[0.000059297286,0.000055530607,0.0008432821,0.0006800333,0.0000017262815,0.0000030273409,0.000003514868,0.9395736,0.00012652762,0.043527737,0.015032234,0.00009352905],"about_ca_topic_score_codex":0.000031364532,"about_ca_topic_score_gemma":0.0000013115962,"teacher_disagreement_score":0.950527,"about_ca_system_score_codex":0.000031086387,"about_ca_system_score_gemma":0.000089430934,"threshold_uncertainty_score":0.9990742},"labels":[],"label_agreement":null},{"id":"W4389348821","doi":"10.1103/physrevlett.131.230601","title":"Superposed Quantum Error Mitigation","year":2023,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Canada First Research Excellence Fund; Austrian Science Fund; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Noise (video); Probabilistic logic; Superposition principle; Quantum computer; Computation; Fidelity; IBM; Unitary state; Computer engineering; Quantum noise; Quantum; Algorithm; Physics; Quantum mechanics; Telecommunications; Artificial intelligence","score_opus":0.018386212018544967,"score_gpt":0.2882338472608237,"score_spread":0.2698476352422787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389348821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86484784,0.0012236037,0.044659786,0.08742249,0.00049431046,0.000336245,0.0000029205914,0.000949948,0.00006285815],"genre_scores_gemma":[0.9529507,0.00079213677,0.004460034,0.04111815,0.0005650348,0.000045072826,0.000021348744,0.000026567901,0.000020912077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998709,0.00011030792,0.00017765095,0.00036528468,0.00031588937,0.00032185964],"domain_scores_gemma":[0.99921346,0.00016117505,0.000058493544,0.00044916736,0.00002430355,0.000093381335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002242197,0.00014812565,0.00025089577,0.00005617257,0.00010689592,0.00006161643,0.0006142497,0.0000069280713,0.0000034860461],"category_scores_gemma":[0.000055701195,0.00011788654,0.00017429945,0.00091020105,0.000040146148,0.00015282429,0.00017726189,0.00017527008,0.0006529706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006002172,0.00037141843,0.00034984146,0.004558384,0.00014304563,0.00034571462,0.0028209148,0.01616042,0.12907787,0.088908255,0.23524868,0.52200943],"study_design_scores_gemma":[0.00010480469,0.00003248398,0.0023848335,0.00061557605,0.000010433072,0.0000068179083,0.0000020246894,0.98151225,0.0002858195,0.0028961147,0.011929613,0.00021925123],"about_ca_topic_score_codex":0.000004632275,"about_ca_topic_score_gemma":2.2520535e-7,"teacher_disagreement_score":0.9653518,"about_ca_system_score_codex":0.000015159914,"about_ca_system_score_gemma":0.00001769138,"threshold_uncertainty_score":0.8392833},"labels":[],"label_agreement":null},{"id":"W4389379267","doi":"10.1103/physrevc.108.064305","title":"Prediction of the neutron drip line in oxygen isotopes using quantum computation","year":2023,"lang":"en","type":"article","venue":"Physical review. C","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Science and Engineering Research Board; Ministry of Education, India; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Quantum computer; Physics; Ansatz; Qubit; Quantum; Neutron; Quantum simulator; Quantum error correction; Quantum algorithm; Statistical physics; Quantum mechanics; Computational physics","score_opus":0.03800391449471604,"score_gpt":0.316928854896449,"score_spread":0.278924940401733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389379267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.963856,0.0007867704,0.032802843,0.0017599862,0.0003208499,0.00032470917,0.000004531609,0.00011011868,0.000034233115],"genre_scores_gemma":[0.9979965,0.00025083945,0.0013953063,0.00018959993,0.00014584529,0.0000058752244,0.0000038633907,0.000007239508,0.000004904407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989502,0.00014341164,0.0002529042,0.00023168376,0.00024743724,0.00017437646],"domain_scores_gemma":[0.99941266,0.00011491719,0.0001270745,0.00027243764,0.00004277545,0.000030145371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028927723,0.000099141536,0.00022778296,0.000054329557,0.00006484372,0.000019714778,0.00040877552,0.000016883096,4.0935564e-7],"category_scores_gemma":[0.00006370972,0.00006600126,0.00011283531,0.0012038578,0.00003168039,0.000094801006,0.0002472848,0.00016429312,0.000010184022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000087027065,0.0005110488,0.0021123774,0.0019301425,0.000041340732,0.000011495986,0.0022960883,0.68800473,0.04056913,0.024481146,0.0016013941,0.23843239],"study_design_scores_gemma":[0.00009079018,0.000040109575,0.029895049,0.00074401,0.0000069983307,0.0000020763055,0.0000023103548,0.9593812,0.0003934589,0.009073667,0.00031261097,0.000057674406],"about_ca_topic_score_codex":0.000030480143,"about_ca_topic_score_gemma":0.000001559456,"teacher_disagreement_score":0.2713765,"about_ca_system_score_codex":0.000019217256,"about_ca_system_score_gemma":0.000031656542,"threshold_uncertainty_score":0.2691453},"labels":[],"label_agreement":null},{"id":"W4389427038","doi":"10.1088/2058-9565/ad133e","title":"Quantum-classical hybrid neural networks in the neural tangent kernel regime","year":2023,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum; Artificial neural network; Kernel (algebra); Computer science; Gaussian process; Mathematics; Gaussian; Algorithm; Artificial intelligence; Statistical physics; Topology (electrical circuits); Pure mathematics; Quantum mechanics; Physics","score_opus":0.013838525730589944,"score_gpt":0.24838534244658939,"score_spread":0.23454681671599945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389427038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9370307,0.00037812244,0.011401699,0.049348827,0.0007776074,0.00024255528,0.000001448335,0.0007537311,0.00006533486],"genre_scores_gemma":[0.9985255,0.00004885067,0.0005157964,0.0007572678,0.00009650556,0.000026413993,0.0000012021388,0.000010205858,0.000018245262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694854,0.000096526455,0.00032045235,0.00091964856,0.0006530756,0.0010617813],"domain_scores_gemma":[0.99852306,0.00023632852,0.00010562103,0.00091972767,0.00010220037,0.00011309539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016540419,0.00024139918,0.00026481526,0.0008867611,0.0006545449,0.00034217024,0.003049908,0.0001111083,0.000001318698],"category_scores_gemma":[0.00026188436,0.00016192344,0.000049871887,0.0067465515,0.0014636432,0.00032927757,0.0011214996,0.00075216795,0.000022090027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011515011,0.00014709917,0.0030713093,0.00001689966,0.000009631426,0.0012148076,0.0010799494,0.007525506,0.0017406106,0.62465364,0.003293616,0.3572354],"study_design_scores_gemma":[0.00020126665,0.00023184235,0.004586223,0.000014568384,0.0000025661905,0.00048138836,0.00016174192,0.9665798,0.00011460442,0.026101466,0.0013142604,0.00021029709],"about_ca_topic_score_codex":0.00003111526,"about_ca_topic_score_gemma":0.000011172016,"teacher_disagreement_score":0.9590543,"about_ca_system_score_codex":0.00003636216,"about_ca_system_score_gemma":0.00011052408,"threshold_uncertainty_score":0.6603046},"labels":[],"label_agreement":null},{"id":"W4389539275","doi":"10.1145/3610548.3618151","title":"Quantum Ray Marching: Reformulating Light Transport for Quantum Computers","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendering (computer graphics); Quantum algorithm; Quantum computer; Quantum walk; Computer science; Quantum; Ray tracing (physics); Algorithm; Computational science; Physics; Computer graphics (images); Quantum mechanics","score_opus":0.017744912547008423,"score_gpt":0.25617293136613,"score_spread":0.2384280188191216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389539275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1029116,0.000024195786,0.8867512,0.006075356,0.0013848189,0.00038341797,0.0000068332492,0.0019627542,0.0004998483],"genre_scores_gemma":[0.8177396,0.0000065570744,0.18063003,0.00061755785,0.00037402657,0.00003103631,0.000031051368,0.00004742254,0.00052272045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973731,0.00005762966,0.00051395886,0.00077901664,0.00040897075,0.00086734013],"domain_scores_gemma":[0.9984607,0.0004127243,0.00013075196,0.00070919225,0.00008028957,0.0002063446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084695907,0.00031302043,0.00036229906,0.00033953923,0.0005298648,0.00016578443,0.0013308687,0.00009607354,0.000005012342],"category_scores_gemma":[0.00004031847,0.00024840687,0.00027930434,0.0010138011,0.000036538113,0.00028249354,0.0002755774,0.00027147756,0.00006441638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049759736,0.0001759629,0.0007528035,0.00034131104,0.00015463377,0.00017455289,0.007311236,0.13418773,0.004633295,0.6135156,0.012959696,0.22574341],"study_design_scores_gemma":[0.00050921587,0.00017698061,0.0024196396,0.000068051486,0.000005854418,0.000018913319,0.000042072683,0.96393114,0.00033758278,0.017732024,0.014377663,0.00038087097],"about_ca_topic_score_codex":0.000043495453,"about_ca_topic_score_gemma":0.000006280227,"teacher_disagreement_score":0.8297434,"about_ca_system_score_codex":0.000033453896,"about_ca_system_score_gemma":0.00008051112,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W4389541980","doi":"10.1364/ls.2023.lm5f.3","title":"Experimental Demonstration of Neural Adaptive Quantum Tomography for Two-Qubit States","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Ottawa","funders":"","keywords":"Quantum tomography; Qubit; Tomography; Quantum; Quantum state; Physics; Computer science; Bayesian probability; Quantum mechanics; Statistical physics; Algorithm; Artificial intelligence; Optics","score_opus":0.01873690310215873,"score_gpt":0.2718881822955803,"score_spread":0.25315127919342156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389541980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4792617,0.000053642107,0.5194798,0.00033578178,0.00026303204,0.00019460547,0.000007741824,0.00028127915,0.0001224124],"genre_scores_gemma":[0.95423335,7.979978e-7,0.04558066,0.00006961214,0.000050044815,0.00001963599,0.000008834089,0.000007114184,0.00002998399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909705,0.00003132594,0.0001957228,0.00026867952,0.00016856095,0.00023865997],"domain_scores_gemma":[0.9994601,0.00016107054,0.00007115845,0.00019840285,0.000057070392,0.000052190924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015488788,0.00011035534,0.00013186455,0.00015929672,0.00010765143,0.000048284837,0.000335302,0.000023753393,0.0000032277712],"category_scores_gemma":[0.000005330064,0.0000908551,0.00011126477,0.0005397907,0.000049355116,0.00014708833,0.00011892065,0.000057073576,0.0000044085464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012503633,0.00040725345,0.0010852346,0.00006615431,0.00014322296,0.000024860956,0.007966941,0.1386688,0.091981426,0.6321254,0.0048140036,0.122591704],"study_design_scores_gemma":[0.0003267486,0.00038970634,0.0005970915,0.0000089949535,0.000001992664,0.000004226065,0.00022555626,0.9307204,0.06235248,0.0052249553,0.000039621307,0.000108250024],"about_ca_topic_score_codex":0.000042191707,"about_ca_topic_score_gemma":0.000004033513,"teacher_disagreement_score":0.79205155,"about_ca_system_score_codex":0.00000600845,"about_ca_system_score_gemma":0.000023718867,"threshold_uncertainty_score":0.37049636},"labels":[],"label_agreement":null},{"id":"W4389565660","doi":"10.33102/iiecons.v10i1.90","title":"DEVELOPMENT OF QUANTUM COMMUNICATIONS TECHNOLOGY (QCT) IN MALAYSIA","year":2023,"lang":"en","type":"article","venue":"I-iECONS e-proceedings","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Universiti Malaysia Perlis","keywords":"Context (archaeology); Information and Communications Technology; The Internet; Variety (cybernetics); Computer science; China; Telecommunications; Political science","score_opus":0.021228720546241638,"score_gpt":0.26242965522318373,"score_spread":0.2412009346769421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389565660","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98827624,0.00007557246,0.005245931,0.0039114845,0.00013616098,0.00014520109,0.0000018648851,0.00058696046,0.001620592],"genre_scores_gemma":[0.82589245,0.000018096951,0.17391697,0.000051175317,0.000015209479,0.000029556635,0.0000019994095,0.00001215198,0.00006236529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985831,0.0000064875258,0.0004575309,0.0003698554,0.0001804323,0.00040263924],"domain_scores_gemma":[0.9991605,0.000062908286,0.00015877574,0.0004350502,0.00012212593,0.00006063132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045808998,0.00015649208,0.000250492,0.00088530773,0.00017954936,0.00006216526,0.0020759904,0.00011147538,0.000004307362],"category_scores_gemma":[0.00006421531,0.00015541272,0.00004758427,0.0026753878,0.0001494775,0.00015819514,0.0013372656,0.0003179469,0.0000923615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055974847,0.00022789004,0.019778978,0.00013847195,0.00005593553,0.000014512881,0.013731589,0.00040429886,0.017429922,0.8183177,0.0022625679,0.12763256],"study_design_scores_gemma":[0.00033951487,0.00004790566,0.012674313,0.00016808492,0.0000033564684,0.00004035096,0.0007461312,0.9507749,0.005339524,0.016904144,0.01265739,0.00030436873],"about_ca_topic_score_codex":0.000009051082,"about_ca_topic_score_gemma":0.000007902001,"teacher_disagreement_score":0.9503706,"about_ca_system_score_codex":0.00004060398,"about_ca_system_score_gemma":0.00011154812,"threshold_uncertainty_score":0.6337547},"labels":[],"label_agreement":null},{"id":"W4389681670","doi":"10.1002/ail2.89","title":"On a quantum inspired approach to train machine learning models","year":2023,"lang":"en","type":"article","venue":"Applied AI Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada)","funders":"","keywords":"Computer science; Quantum machine learning; Quantum; Context (archaeology); Artificial intelligence; Field (mathematics); Machine learning; Quantum computer; Mathematics; Physics; Quantum mechanics","score_opus":0.020175664355217216,"score_gpt":0.22031183518289282,"score_spread":0.2001361708276756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389681670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17217685,0.000005863391,0.8125273,0.01178969,0.00017478713,0.00028076416,0.0000029756766,0.0011643517,0.0018774419],"genre_scores_gemma":[0.95215,0.0000010121337,0.026452322,0.021090556,0.0001246385,0.000061774896,0.000018295541,0.000035932928,0.000065455206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980049,0.000060802227,0.00021866534,0.0007215125,0.00040998997,0.00058408856],"domain_scores_gemma":[0.99913925,0.00013095769,0.00005688142,0.00049819256,0.000012190201,0.0001625217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038244872,0.00025396972,0.00023812294,0.00032984233,0.00027942358,0.00017909915,0.0009137309,0.000057035602,0.0000015581633],"category_scores_gemma":[0.000015375765,0.00022597866,0.000085267944,0.0011499401,0.000032219526,0.00008406662,0.0003247301,0.00051062694,0.00028982974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009651192,0.000038773476,0.0000025463655,0.00001165733,0.000014679544,0.000015508158,0.0019774274,0.8217897,0.0052435976,0.14006346,0.004436514,0.026396466],"study_design_scores_gemma":[0.00032225245,0.000060680763,0.0000992055,0.000014177631,0.0000024898245,0.0000060686916,0.00001690884,0.98683596,0.00018880935,0.010075804,0.002084699,0.00029295884],"about_ca_topic_score_codex":0.000023403276,"about_ca_topic_score_gemma":6.4336103e-7,"teacher_disagreement_score":0.78607494,"about_ca_system_score_codex":0.000031069372,"about_ca_system_score_gemma":0.00001958544,"threshold_uncertainty_score":0.9215142},"labels":[],"label_agreement":null},{"id":"W4389721722","doi":"10.1190/image2023-3905653.1","title":"Gated based quantum computer algorithm for geophysical inversion","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carbon Management Canada; University of Calgary","funders":"","keywords":"Inversion (geology); Hessian matrix; Residual; Algorithm; Computer science; Quantum; Quantum computer; Quantum algorithm; Inverse problem; Geophysics; Mathematics; Geology; Physics; Applied mathematics; Quantum mechanics","score_opus":0.013760623746227002,"score_gpt":0.23992908284911155,"score_spread":0.22616845910288455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389721722","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014620036,0.0000036360173,0.9800159,0.0027581917,0.0008763802,0.00022898657,0.000007751714,0.0014300498,0.000059088314],"genre_scores_gemma":[0.057858363,0.0000014238921,0.93902564,0.0019889327,0.0005868778,0.000017144459,0.00005643667,0.00002869528,0.0004364728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998465,0.00005186385,0.00019564276,0.00053500966,0.00027519377,0.0004772895],"domain_scores_gemma":[0.9989418,0.00033921032,0.000052897845,0.000436526,0.00009127272,0.00013833528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025006323,0.00018441684,0.00020089459,0.00019389328,0.00024436964,0.00014722689,0.0007234868,0.00007094253,0.0000071475533],"category_scores_gemma":[0.000011652242,0.00015027748,0.00015976727,0.0009048964,0.00003911952,0.0001278517,0.00031921433,0.00013896656,0.00022394232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004468919,0.00008744687,0.000017442993,0.00002266811,0.00001912934,0.000028562477,0.00013570109,0.01110837,0.00027599366,0.011909272,0.04536802,0.93102294],"study_design_scores_gemma":[0.0005915818,0.0002219038,0.00049998576,0.000018897084,0.0000032484218,0.000003149665,0.0000041379235,0.9812107,0.0008754108,0.0037164378,0.01262949,0.00022502079],"about_ca_topic_score_codex":0.000023257078,"about_ca_topic_score_gemma":6.368701e-7,"teacher_disagreement_score":0.97010237,"about_ca_system_score_codex":0.000018466028,"about_ca_system_score_gemma":0.000062641615,"threshold_uncertainty_score":0.6128138},"labels":[],"label_agreement":null},{"id":"W4389741998","doi":"10.1021/acs.jpca.3c07317","title":"Physical Chemistry of Quantum Information Science","year":2023,"lang":"en","type":"article","venue":"The Journal of Physical Chemistry A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Quantum chemistry; Chemistry; Nanotechnology; Computer science; Data science; Engineering physics; Materials science; Physics; Molecule; Organic chemistry","score_opus":0.00762945188222549,"score_gpt":0.2460676670011624,"score_spread":0.2384382151189369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389741998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9805741,0.000009203543,0.018132199,0.0005628882,0.00004096747,0.000028232582,0.0000024164221,0.00004450206,0.0006055008],"genre_scores_gemma":[0.99935496,0.000003414369,0.00017906333,0.000025798974,0.00041439163,4.6363294e-7,6.090863e-7,0.0000038429553,0.000017474817],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859613,0.000022097342,0.0002840784,0.00009859265,0.0007488416,0.00025026454],"domain_scores_gemma":[0.9986065,0.00023689934,0.00040886624,0.00037281224,0.00026723885,0.00010770643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006397524,0.00011910313,0.00021957922,0.00003688522,0.00014358619,0.00006518606,0.0016634051,0.000024999752,0.0000021986748],"category_scores_gemma":[0.00018402141,0.00007452532,0.00014777856,0.0011553651,0.0003240039,0.0005382082,0.00037017604,0.00038050287,0.000012361583],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014808081,0.00009722382,0.00000217081,0.000093079485,0.000016667685,0.0000044390567,0.0029763854,0.05292088,0.9366766,0.0007819939,0.00019923819,0.0062165135],"study_design_scores_gemma":[0.00012070912,0.00003871333,0.00010088128,0.00003775029,0.00000718309,0.0000444316,0.0000657358,0.6023722,0.39461812,0.0024196561,0.000115238916,0.000059364476],"about_ca_topic_score_codex":0.0000019983172,"about_ca_topic_score_gemma":5.6916414e-9,"teacher_disagreement_score":0.54945135,"about_ca_system_score_codex":0.000027062399,"about_ca_system_score_gemma":0.00020454338,"threshold_uncertainty_score":0.30910483},"labels":[],"label_agreement":null},{"id":"W4389750777","doi":"10.2172/2229681","title":"Quantum Optimization: Potential, Challenges, and the Path Forward","year":2023,"lang":"en","type":"report","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; HORIZON EUROPE Framework Programme; Los Alamos National Laboratory; National Nuclear Security Administration; European Climate, Infrastructure and Environment Executive Agency; Bundesministerium für Wirtschaft und Energie; National Research Foundation Singapore; U.S. Department of Energy; European Commission; Government of Canada; National Research Foundation; Freistaat Thüringen; Natural Sciences and Engineering Research Council of Canada; Institut Périmètre de physique théorique; Thüringer Aufbaubank; Innovation, Science and Economic Development Canada","keywords":"Quantum; Path (computing); Computer science; Physics; Quantum mechanics; Computer network","score_opus":0.03887213090241247,"score_gpt":0.2711857596601485,"score_spread":0.23231362875773603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389750777","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000120919785,0.025020396,0.9377389,0.012897068,0.004284883,0.0004555313,0.000008054523,0.00096097897,0.018622123],"genre_scores_gemma":[0.015859528,0.5480688,0.37296683,0.0018335806,0.009252536,0.00027372842,0.00017401746,0.0005113681,0.051059563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731284,0.00015610785,0.00041295457,0.0007781173,0.000955338,0.00038461984],"domain_scores_gemma":[0.9981122,0.0002780283,0.00026418996,0.0009832953,0.00025559822,0.000106688356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015809608,0.0003478476,0.00051589246,0.00014869208,0.00033254985,0.0003473569,0.0011448668,0.00023357756,0.000009517067],"category_scores_gemma":[0.0001484069,0.00020045441,0.00020051189,0.00026236897,0.0001479608,0.00009070071,0.0011878167,0.0005101835,0.000023425653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015997071,0.000063736676,0.000001390177,0.00051359175,0.00038938195,0.00034694132,0.0020792233,0.14417921,3.2962888e-7,0.14352353,0.07090579,0.6379809],"study_design_scores_gemma":[0.00037281358,0.0000448076,0.00004617285,0.00012058373,0.000027953907,0.00028770676,0.00003679068,0.9489597,3.8104454e-7,0.007010927,0.042804625,0.0002875423],"about_ca_topic_score_codex":0.00013017691,"about_ca_topic_score_gemma":0.000009925694,"teacher_disagreement_score":0.8047805,"about_ca_system_score_codex":0.00003174807,"about_ca_system_score_gemma":0.0004077339,"threshold_uncertainty_score":0.81742936},"labels":[],"label_agreement":null},{"id":"W4389783315","doi":"10.1038/s41467-023-43908-6","title":"Synergistic pretraining of parametrized quantum circuits via tensor networks","year":2023,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Public Health Ontario","funders":"","keywords":"Computer science; Quantum; Qubit; Tensor (intrinsic definition); Electronic circuit; Quantum computer; Obstacle; Encoding (memory); Quantum machine learning; Theoretical computer science; Computer engineering; Artificial intelligence; Mathematics; Physics; Quantum mechanics","score_opus":0.02539791986826876,"score_gpt":0.29048625871127237,"score_spread":0.2650883388430036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389783315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037260953,0.005140248,0.948251,0.005241504,0.0011536522,0.00041047696,0.000017071592,0.0013549052,0.0011701947],"genre_scores_gemma":[0.94922036,0.00014691062,0.050279766,0.00018602845,0.00006144642,0.000017450066,0.000033638495,0.000016725702,0.00003769289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984781,0.00022932484,0.00036279025,0.00030890177,0.00028001546,0.0003408267],"domain_scores_gemma":[0.99508876,0.0016925471,0.0002092852,0.0027256866,0.00019281833,0.000090887224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006261141,0.000160139,0.0002641164,0.0003255697,0.0003598998,0.00007266237,0.003485241,0.00024759,0.0000024169974],"category_scores_gemma":[0.0005766258,0.00014718749,0.0001232227,0.0028680174,0.00015240397,0.000102642334,0.001015669,0.0011679629,0.000018122775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008828475,0.00039022978,0.0018402525,0.000080222795,0.0002592339,0.000026504471,0.0031455974,0.110772334,0.004876016,0.44923022,0.0070562186,0.42231432],"study_design_scores_gemma":[0.00018414378,0.000039629336,0.0065423264,0.00005767841,0.000010972351,0.000008395587,0.0000191351,0.9872835,0.00007676964,0.0035649873,0.0020507295,0.00016172304],"about_ca_topic_score_codex":0.000013509614,"about_ca_topic_score_gemma":0.000009645949,"teacher_disagreement_score":0.9119594,"about_ca_system_score_codex":0.00002068922,"about_ca_system_score_gemma":0.00006307574,"threshold_uncertainty_score":0.6476503},"labels":[],"label_agreement":null},{"id":"W4390013556","doi":"10.22331/q-2023-12-20-1210","title":"Generalization despite overfitting in quantum machine learning models","year":2023,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada); Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Mitacs; Government of Canada","keywords":"Overfitting; Artificial intelligence; Quantum; Generalization; Computer science; Machine learning; Artificial neural network; Mathematics; Physics; Quantum mechanics","score_opus":0.027511229885535043,"score_gpt":0.24913365917982666,"score_spread":0.22162242929429163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390013556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5747244,0.0002376835,0.42250708,0.0007835466,0.00057326566,0.00011988327,0.0000020795617,0.0008873795,0.00016472743],"genre_scores_gemma":[0.99212533,0.00008113021,0.0072186566,0.00019909717,0.00013803323,0.000010957197,0.000023827346,0.000032897653,0.00017007535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978522,0.00020322541,0.00039072364,0.0005762358,0.00036763638,0.0006099975],"domain_scores_gemma":[0.99914527,0.00016842141,0.00013464743,0.0004034476,0.000050204802,0.00009800503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008161641,0.00022259266,0.00024521284,0.00045922102,0.00026705218,0.00019542863,0.00066662126,0.00008890701,0.000005038476],"category_scores_gemma":[0.000103414386,0.00021237042,0.00008305426,0.0018309075,0.000027372802,0.00039863924,0.0004143591,0.00041964077,0.00009041656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036721435,0.000026829688,0.0018051107,0.00002272055,0.000006750162,0.00007121029,0.0014928808,0.87517875,0.00082712254,0.10486381,0.00017912258,0.015522004],"study_design_scores_gemma":[0.0003094584,0.00007218154,0.0019361082,0.00006640909,0.0000019680026,0.000014739866,0.000026377234,0.95947635,0.00014891189,0.03665182,0.0010334101,0.0002622903],"about_ca_topic_score_codex":0.00022668878,"about_ca_topic_score_gemma":0.000020002784,"teacher_disagreement_score":0.417401,"about_ca_system_score_codex":0.0000433423,"about_ca_system_score_gemma":0.000053059946,"threshold_uncertainty_score":0.86602145},"labels":[],"label_agreement":null},{"id":"W4390092954","doi":"10.48550/arxiv.2312.13282","title":"Estimating Trotter Approximation Errors to Optimize Hamiltonian Partitioning for Lower Eigenvalue Errors","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Toronto","keywords":"Eigenvalues and eigenvectors; Hamiltonian (control theory); Mathematics; Applied mathematics; Approximation error; Perturbation theory (quantum mechanics); Quantum; Perturbation (astronomy); Mathematical optimization; Quantum mechanics; Physics","score_opus":0.07155294869942376,"score_gpt":0.2205894400829907,"score_spread":0.14903649138356695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390092954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22008976,0.0000063217017,0.7760761,0.00062189566,0.0017520265,0.00070853013,0.000024288842,0.0006463253,0.00007474581],"genre_scores_gemma":[0.603147,0.0000018115195,0.39568758,0.00021744723,0.0002441778,0.000014429393,0.00003523409,0.000046691082,0.0006056844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721944,0.00012246863,0.00035110026,0.001511938,0.00015688708,0.00063818344],"domain_scores_gemma":[0.99795324,0.00021233385,0.00031681897,0.001091043,0.00018038663,0.0002461658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055072,0.00042916217,0.0004244932,0.00043172025,0.0005085107,0.00029405425,0.0015637901,0.00025602253,0.000007919733],"category_scores_gemma":[0.00013503742,0.00048930023,0.00033257162,0.00075202767,0.00006326001,0.00025587258,0.0017036328,0.00055357633,0.00009619871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017535436,0.00003919032,0.000106478605,0.000099506535,0.000051923882,0.00005909412,0.0008567957,0.99182266,0.00001764916,0.0051678554,0.0003332169,0.0014280911],"study_design_scores_gemma":[0.00036873957,0.000096027106,0.00048108675,0.00030445453,0.000041907886,0.000004143612,0.00005023067,0.9721071,0.000057847163,0.025764093,0.00017432026,0.00055001426],"about_ca_topic_score_codex":0.00006900269,"about_ca_topic_score_gemma":0.000023350509,"teacher_disagreement_score":0.38305718,"about_ca_system_score_codex":0.00018694288,"about_ca_system_score_gemma":0.00015670345,"threshold_uncertainty_score":0.99975586},"labels":[],"label_agreement":null},{"id":"W4390187950","doi":"10.1109/wsce59557.2023.10365953","title":"FIPS Compliant Quantum Secure Communication Using Quantum Permutation Pad","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Quantum; Computer science; Permutation (music); Computer network; Quantum cryptography; Physics; Quantum information; Quantum mechanics","score_opus":0.03711095238402824,"score_gpt":0.2890624839781042,"score_spread":0.25195153159407596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390187950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45882937,0.000102380116,0.5359062,0.003192973,0.00039990264,0.00017108953,0.000004592246,0.0011100167,0.000283444],"genre_scores_gemma":[0.94747406,0.000026101285,0.051944677,0.00031028915,0.00007624301,0.0000062909107,0.000033791588,0.000020427779,0.00010809085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824035,0.00019688801,0.00033193073,0.00043939488,0.00036501745,0.00042638995],"domain_scores_gemma":[0.99848986,0.0002363462,0.00013897882,0.00090693764,0.000120004486,0.00010787663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053057657,0.00020227423,0.00020750213,0.0002307747,0.0005786913,0.00027678686,0.001094572,0.00008197913,0.000016094671],"category_scores_gemma":[0.000046634443,0.00017612237,0.00009726319,0.001191303,0.000064778855,0.00031527504,0.0005736953,0.00028892278,0.00020886943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014566622,0.0002086539,0.0010037541,0.00014250986,0.00008534339,0.00010254864,0.011556053,0.2355257,0.0072163744,0.68102926,0.009065469,0.054049756],"study_design_scores_gemma":[0.00020204812,0.000046480694,0.0036826013,0.00006531939,0.000004870044,0.000048862512,0.00019535911,0.96626323,0.00022481894,0.027917633,0.0011044551,0.00024432613],"about_ca_topic_score_codex":0.00015969841,"about_ca_topic_score_gemma":0.000013048088,"teacher_disagreement_score":0.7307375,"about_ca_system_score_codex":0.000043765882,"about_ca_system_score_gemma":0.00007257162,"threshold_uncertainty_score":0.71820617},"labels":[],"label_agreement":null},{"id":"W4390214574","doi":"10.48550/arxiv.2312.14245","title":"Scalable simulation of non-equilibrium quantum dynamics via classically optimised unitary circuits","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto; Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst; European Commission","keywords":"Unitary state; Scalability; Quantum; Computer science; Hamiltonian (control theory); Electronic circuit; Quantum circuit; Quantum dynamics; Quantum computer; Statistical physics; Quantum network; Physics; Quantum mechanics; Mathematics; Mathematical optimization; Law","score_opus":0.04463094752952005,"score_gpt":0.20334338986703304,"score_spread":0.158712442337513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390214574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30516168,0.000012744443,0.69301295,0.000115875846,0.00078578485,0.00024413789,0.000028092643,0.00037778262,0.0002609398],"genre_scores_gemma":[0.99538755,0.000015927715,0.003684116,0.000039607792,0.00010493288,5.8072163e-7,0.00006902961,0.000045514676,0.0006527478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973806,0.0001658915,0.00041686537,0.0012922941,0.00021853451,0.0005257834],"domain_scores_gemma":[0.99705386,0.00041392606,0.00046494344,0.0015224908,0.00032315857,0.00022164168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003558316,0.00043288,0.0005681661,0.00050130894,0.00015208479,0.00010318224,0.0023390078,0.000419124,0.0000070033616],"category_scores_gemma":[0.000053705822,0.00050000317,0.00032756547,0.0013038468,0.00016825342,0.00026685343,0.0028302171,0.0008616842,0.000049976432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012942673,0.000092545066,0.00030677268,0.00015194187,0.00008906544,0.00017549502,0.00013561574,0.989003,0.00009725333,0.0074735023,0.000055503722,0.0024063622],"study_design_scores_gemma":[0.00042420172,0.00010858673,0.0017407415,0.000204458,0.00006002284,0.0000031631778,0.000019677262,0.9621797,0.000045236986,0.03471572,0.00001732859,0.00048112127],"about_ca_topic_score_codex":0.0001832935,"about_ca_topic_score_gemma":0.000025778758,"teacher_disagreement_score":0.69022584,"about_ca_system_score_codex":0.00018555646,"about_ca_system_score_gemma":0.00032792072,"threshold_uncertainty_score":0.99974513},"labels":[],"label_agreement":null},{"id":"W4390456266","doi":"10.1039/d3cp03523a","title":"Applications of noisy quantum computing and quantum error mitigation to “adamantaneland”: a benchmarking study for quantum chemistry","year":2023,"lang":"en","type":"article","venue":"Physical Chemistry Chemical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Quantum chemistry; Quantum; Quantum algorithm; Quantum computer; Benchmarking; Quantum tomography; Algorithm; Computer science; Quantum mechanics; Chemistry; Quantum state; Physics; Computational science; Molecule","score_opus":0.012781229764103572,"score_gpt":0.2798790444454995,"score_spread":0.26709781468139593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390456266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78397435,0.0000135255705,0.21476866,0.00023788444,0.00004904976,0.00056137115,0.000040313364,0.000313266,0.000041547508],"genre_scores_gemma":[0.99485457,0.0000012833057,0.0036879869,0.000046675952,0.0011176924,0.00014009679,0.00009420754,0.000043277065,0.000014209724],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972769,0.000029385517,0.0005170545,0.0010428404,0.0005145494,0.0006192759],"domain_scores_gemma":[0.9978234,0.00065756735,0.00027579465,0.00073395536,0.00020966324,0.0002995924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025826634,0.00041604793,0.0006030011,0.000032784843,0.00025014937,0.0001147093,0.00092167396,0.000110380824,0.0000013821628],"category_scores_gemma":[0.000094548515,0.00041866326,0.00021551207,0.0011358269,0.00013996837,0.00012376021,0.00074849307,0.00040329993,0.0000068811146],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031551655,0.0009139434,0.00018103787,0.00087265135,0.00008559265,0.0000054488237,0.0021941701,0.0033596302,0.9706942,0.0022917187,0.00028800103,0.019082079],"study_design_scores_gemma":[0.00051139476,0.0000792649,0.00014306388,0.00008114648,0.000032001957,0.0000057323696,0.00019164963,0.7407068,0.2400563,0.017690608,0.00010904321,0.00039298573],"about_ca_topic_score_codex":0.000014244674,"about_ca_topic_score_gemma":1.491774e-7,"teacher_disagreement_score":0.7373472,"about_ca_system_score_codex":0.000052850773,"about_ca_system_score_gemma":0.00007691,"threshold_uncertainty_score":0.9998265},"labels":[],"label_agreement":null},{"id":"W4390470454","doi":"10.61797/ijanca.v2i2.284","title":"Unveiling Advanced Computational Applications in Quantum Computing: A Comprehensive Review","year":2023,"lang":"en","type":"review","venue":"International Journal of Advanced Nano Computing and Analytics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lambton College","funders":"","keywords":"Quantum computer; Computer science; Field (mathematics); Quantum; Supercomputer; Computational science; Computer engineering; Management science; Physics; Engineering; Mathematics; Parallel computing; Quantum mechanics","score_opus":0.03510354820533123,"score_gpt":0.37061807030299526,"score_spread":0.335514522097664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390470454","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013109334,0.80750686,0.19047797,0.0002922552,0.0010126174,0.00043310862,0.000020038024,0.00010850705,0.000017526878],"genre_scores_gemma":[0.0003152806,0.9274881,0.071384534,0.00024563744,0.00042936768,0.000004086853,0.000053161828,0.0000591045,0.000020741523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949245,0.00023665954,0.00257319,0.0007491992,0.0010189306,0.00049752],"domain_scores_gemma":[0.99330485,0.0022189354,0.0027534922,0.00041347186,0.0010864871,0.00022276696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008583115,0.0006527228,0.0023025877,0.0012971226,0.00019536933,0.00025207835,0.0023054152,0.00018002215,0.0000015172927],"category_scores_gemma":[0.0002574203,0.0005611793,0.0006923007,0.0017206238,0.000116539784,0.0002641657,0.00089313585,0.0011767538,0.00001397736],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000386458,0.00009124828,0.0000052537384,0.0047011296,0.0002861814,0.00015292085,0.00011844212,0.16289721,7.1468946e-7,0.0020349198,0.00010673889,0.82960135],"study_design_scores_gemma":[0.000881892,0.0001509051,0.00003498476,0.09218249,0.00021541824,0.0010331349,0.000071357084,0.45173296,6.7623125e-7,0.0027726318,0.4501589,0.00076465635],"about_ca_topic_score_codex":0.000003966995,"about_ca_topic_score_gemma":7.5964834e-7,"teacher_disagreement_score":0.82883674,"about_ca_system_score_codex":0.00023665336,"about_ca_system_score_gemma":0.0005479906,"threshold_uncertainty_score":0.999684},"labels":[],"label_agreement":null},{"id":"W4390572028","doi":"10.2139/ssrn.4655575","title":"Quantum Computation and Universe","year":2024,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Society of Intestinal Research","funders":"","keywords":"Quantum computer; Theoretical physics; Universe; Computation; Quantum; Physics; Astronomy; Computer science; Quantum mechanics; Algorithm","score_opus":0.005472709837146895,"score_gpt":0.22771058050686444,"score_spread":0.22223787066971754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390572028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08413987,0.0046058027,0.90801173,0.0023696336,0.0004765392,0.000034822177,3.3582916e-7,0.00016836915,0.00019287254],"genre_scores_gemma":[0.9937877,0.0008524148,0.0048778276,0.00006120731,0.00020548848,3.1986298e-7,5.4758544e-7,0.000009587859,0.0002048735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852765,0.000055695433,0.00012322671,0.00021995018,0.00015924872,0.00091424765],"domain_scores_gemma":[0.999719,0.000064806634,0.000033253484,0.000088046785,0.00002879856,0.00006606906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070429745,0.00010068184,0.00008617023,0.00015267935,0.00019524992,0.00033743327,0.00026082832,0.000033188557,0.000001305602],"category_scores_gemma":[0.000008591922,0.00008225539,0.000050512834,0.000275917,0.000028378065,0.00027155876,0.00012364294,0.001073517,0.000016733935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015670154,0.0000062739155,0.0000074762174,0.0000050137905,0.000027555043,0.000026092963,0.00027066568,0.0011335491,0.000046894074,0.638633,0.00007292129,0.35976896],"study_design_scores_gemma":[0.00008628816,0.00011152392,0.000057669666,0.000023216431,0.0000043705613,0.0013980289,0.00009302113,0.5697086,0.0000060124685,0.4270076,0.0014292646,0.00007441213],"about_ca_topic_score_codex":0.0000123785685,"about_ca_topic_score_gemma":0.000012130691,"teacher_disagreement_score":0.9096479,"about_ca_system_score_codex":0.00015705291,"about_ca_system_score_gemma":0.00073565624,"threshold_uncertainty_score":0.46639568},"labels":[],"label_agreement":null},{"id":"W4390605047","doi":"10.1145/3632861","title":"With a Few Square Roots, Quantum Computing Is as Easy as Pi","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pi; Square root; Square (algebra); Quantum; Mathematics; Physics; Computer science; Quantum mechanics; Geometry","score_opus":0.008725239926303079,"score_gpt":0.2634030320044901,"score_spread":0.254677792078187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390605047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98253363,0.0018401071,0.001665235,0.010153061,0.0003911761,0.0005587955,0.0000033696547,0.0011913743,0.0016632364],"genre_scores_gemma":[0.9479801,0.0000072044654,0.05075955,0.0005638446,0.00021930409,0.0000143437255,8.445469e-7,0.000044984852,0.00040981438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977049,0.000016825321,0.00029844788,0.00073235185,0.0007014396,0.0005460047],"domain_scores_gemma":[0.9986259,0.00019092228,0.00019832993,0.000701253,0.00017097846,0.000112649774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047584227,0.00033482217,0.00029875123,0.00018802352,0.0003055469,0.00085650646,0.003224812,0.00008988798,0.0000067199685],"category_scores_gemma":[0.00039681102,0.00020203534,0.00018727605,0.0011358313,0.00012741587,0.00023612655,0.0014626922,0.00053257705,0.00003625122],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050021095,0.00023628552,0.0024104896,0.00123574,0.00023608247,0.000094368435,0.017349415,0.00022615932,0.0023802337,0.10965019,0.0024249363,0.8637061],"study_design_scores_gemma":[0.0028459847,0.008983102,0.010775352,0.024991816,0.00042738646,0.00397727,0.01096577,0.5490522,0.15349066,0.10418326,0.12568478,0.0046224594],"about_ca_topic_score_codex":0.000107793276,"about_ca_topic_score_gemma":0.000001426751,"teacher_disagreement_score":0.85908365,"about_ca_system_score_codex":0.000038089616,"about_ca_system_score_gemma":0.00008779141,"threshold_uncertainty_score":0.8259312},"labels":[],"label_agreement":null},{"id":"W4390659374","doi":"10.32388/0r9ken","title":"Review of: \"On Qubits and Quantum Information Technologies\"","year":2024,"lang":"en","type":"peer-review","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Qubit; Superconducting quantum computing; Quantum; Computer science; Physics; Quantum mechanics","score_opus":0.015164593299961433,"score_gpt":0.276970544478733,"score_spread":0.26180595117877153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390659374","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012890157,0.74987364,0.021305852,0.21896759,0.0023944168,0.000618463,0.00006169715,0.00091656996,0.0058604605],"genre_scores_gemma":[0.000030200465,0.9291382,0.02282877,0.036647778,0.00014536877,0.000058562506,0.00019752333,0.000028904595,0.010924736],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998179,0.000047165366,0.0006604833,0.0004196831,0.00045261678,0.00024100857],"domain_scores_gemma":[0.998385,0.00012914758,0.000325206,0.000927192,0.00018926886,0.000044173987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006460173,0.00033792006,0.0007105396,0.00029275654,0.00005125855,0.00010453093,0.0011239635,0.00020419549,0.000015459793],"category_scores_gemma":[0.0003267686,0.00022809977,0.00016304238,0.00075043814,0.000060078888,0.00017366864,0.000939063,0.0007089986,0.00013073771],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.4997232e-7,0.000004385342,2.8396883e-8,0.053570498,0.000011262166,0.000001950742,0.000010230527,0.0000015835783,1.17811496e-7,0.0100643905,0.59606457,0.34027082],"study_design_scores_gemma":[0.000031980184,0.00010268462,7.268322e-7,0.14892109,0.000031862353,0.000043233373,0.0000015415839,0.021544544,0.000010013378,0.0026582435,0.82643116,0.00022291199],"about_ca_topic_score_codex":0.000022142884,"about_ca_topic_score_gemma":0.0000012883742,"teacher_disagreement_score":0.3400479,"about_ca_system_score_codex":0.000023114915,"about_ca_system_score_gemma":0.00014223222,"threshold_uncertainty_score":0.9301639},"labels":[],"label_agreement":null},{"id":"W4390702910","doi":"10.22331/q-2024-01-10-1220","title":"Multivariate trace estimation in constant quantum depth","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Louisiana State University; National Science Foundation","keywords":"Algorithm; Computer science; TRACE (psycholinguistics); Quantum computer; Artificial intelligence; Quantum; Physics; Quantum mechanics; Philosophy","score_opus":0.015591882009059421,"score_gpt":0.2751254188229745,"score_spread":0.25953353681391506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390702910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124265715,0.0012636095,0.8691867,0.0021952996,0.0015683891,0.00019860995,0.000005257663,0.00073613017,0.00058026443],"genre_scores_gemma":[0.96323556,0.00001517354,0.036481477,0.00010068542,0.00007259068,0.000011924054,0.00000362909,0.000020919213,0.000058016692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981005,0.00012323409,0.00038584069,0.00062603597,0.00030258734,0.0004617851],"domain_scores_gemma":[0.99904215,0.00032153123,0.000057272016,0.00044419113,0.000030943458,0.000103894214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005529765,0.00022918532,0.0002340652,0.00031130377,0.00010748591,0.00039811095,0.00059600436,0.00009149994,0.000010255525],"category_scores_gemma":[0.0000765898,0.00019461881,0.00009271674,0.00087149255,0.000057675366,0.00037296282,0.00016280827,0.00042132597,0.00017021496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008070836,0.00010377952,0.00008417818,0.00009751218,0.000018638404,0.00060970243,0.0028261298,0.02499487,0.0012942003,0.76230896,0.00056424626,0.20708975],"study_design_scores_gemma":[0.00022535528,0.000082181956,0.0012771384,0.00023364516,0.00000422137,0.000103961356,0.000028402763,0.9437436,0.00025696814,0.05158537,0.0022060291,0.00025312277],"about_ca_topic_score_codex":0.00015478204,"about_ca_topic_score_gemma":0.000025084879,"teacher_disagreement_score":0.91874874,"about_ca_system_score_codex":0.0000649225,"about_ca_system_score_gemma":0.0001524415,"threshold_uncertainty_score":0.7936325},"labels":[],"label_agreement":null},{"id":"W4390760350","doi":"10.23977/tracam.2023.030107","title":"Equivalence of 2-tensors and 3-tensors under Local Unitary and General Linear Groups","year":2023,"lang":"en","type":"article","venue":"Transactions on Computational and Applied Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Marianopolis College","funders":"","keywords":"Equivalence (formal languages); Unitary state; Mathematics; Tensor (intrinsic definition); Singular value decomposition; Pure mathematics; Invariants of tensors; Group (periodic table); Matrix equivalence; Decomposition; Algebra over a field; Quantum mechanics; Matrix analysis; Physics; Eigenvalues and eigenvectors; Algorithm","score_opus":0.018414310556707017,"score_gpt":0.24356903173537095,"score_spread":0.22515472117866392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390760350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38465998,0.000019361332,0.61477983,0.00032391184,0.000020964359,0.00007395308,0.000008029911,0.000079442274,0.00003454534],"genre_scores_gemma":[0.74966633,0.00003474835,0.2501215,0.00010606843,0.000017923448,0.000005314849,0.0000035516582,0.000009379808,0.000035176537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991159,0.000014733243,0.00022718801,0.0002616236,0.00022149824,0.00015907084],"domain_scores_gemma":[0.99930274,0.00038998193,0.00006107956,0.00012116929,0.000040828214,0.000084216284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014714105,0.00014456843,0.00019078354,0.00015017542,0.00020038997,0.00003450921,0.000120533805,0.00004791697,0.0000026053085],"category_scores_gemma":[0.000002443651,0.0001250043,0.000028295035,0.00032058722,0.00018535803,0.000054356256,0.000029451207,0.0001428194,0.000004999061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060030125,0.00007122065,0.0000031159673,0.000128468,0.000028043227,0.0000027746573,0.0010072968,0.8469171,0.00010318925,0.11892829,0.000011485061,0.03279304],"study_design_scores_gemma":[0.00027317065,0.000066673485,0.00094940886,0.000036252888,0.000011720916,0.000046179,0.00020425922,0.89818305,0.00012438856,0.099969834,0.000009633551,0.00012545276],"about_ca_topic_score_codex":0.0000036506437,"about_ca_topic_score_gemma":5.562376e-7,"teacher_disagreement_score":0.36500636,"about_ca_system_score_codex":0.000005932878,"about_ca_system_score_gemma":0.000019788253,"threshold_uncertainty_score":0.5097527},"labels":[],"label_agreement":null},{"id":"W4390807395","doi":"10.1088/1367-2630/ad1c91","title":"Experimental simulation of quantum superchannels","year":2024,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Key Research and Development Program of China; Beijing Nova Program; Special Project for Research and Development in Key areas of Guangdong Province; Beijing Innovation Center for Future Chip; National Natural Science Foundation of China","keywords":"Physics; Quantum; Qubit; Quantum metrology; Quantum information; Quantum sensor; Quantum computer; Quantum simulator; Computer engineering; Statistical physics; Algorithm; Electronic engineering; Quantum mechanics; Theoretical physics; Computer science","score_opus":0.023318697352069127,"score_gpt":0.2903794071497971,"score_spread":0.26706070979772795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390807395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19162442,0.00090495765,0.8064034,0.00020456886,0.0007851706,0.000021270696,6.2966586e-7,0.000021697268,0.00003386175],"genre_scores_gemma":[0.98578966,0.000004165428,0.013310676,0.000029168996,0.0008405025,7.494131e-8,1.9050499e-7,0.0000070825927,0.000018496261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992352,0.000029798906,0.00024966654,0.000100104575,0.00027873795,0.00010650577],"domain_scores_gemma":[0.9995256,0.00011937582,0.00009399443,0.00012453979,0.000069371934,0.000067106106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013978817,0.0000796106,0.00014731372,0.00006549026,0.000028718092,0.00007156892,0.00034096112,0.000023665607,0.0000045496686],"category_scores_gemma":[0.00000969843,0.000062296436,0.0001364852,0.000247562,0.000018578665,0.00031973314,0.00007064853,0.00017049677,0.000004255527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074159516,0.00008492682,0.000007320741,0.000027879005,0.000043455373,0.000037406542,0.0049128192,0.72390884,0.03146719,0.041102268,0.00057605654,0.19782439],"study_design_scores_gemma":[0.00013769022,0.00024643642,0.000025242201,0.00011828415,0.00000519159,0.000033150514,0.000027103855,0.92230564,0.055221178,0.02120501,0.0006140413,0.00006105418],"about_ca_topic_score_codex":0.000005412237,"about_ca_topic_score_gemma":3.5363126e-8,"teacher_disagreement_score":0.79416525,"about_ca_system_score_codex":0.000018447992,"about_ca_system_score_gemma":0.00012389307,"threshold_uncertainty_score":0.2540375},"labels":[],"label_agreement":null},{"id":"W4390846320","doi":"10.1007/978-3-031-42478-6_26","title":"Ising Machines Using Parallel Spin Updating Algorithms for Solving Traveling Salesman Problems","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Ising model; Simulated annealing; Computer science; Solver; Spins; Computation; Ising spin; Algorithm; Time complexity; Parallel computing; Mathematical optimization; Mathematics; Physics; Statistical physics","score_opus":0.05426117843566925,"score_gpt":0.2869551414834059,"score_spread":0.23269396304773665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390846320","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013311258,0.00030867534,0.97906876,0.00039410227,0.0015723734,0.00085127976,0.000025191417,0.0013263326,0.016320176],"genre_scores_gemma":[0.00055055897,0.000044021042,0.9353038,0.00026666885,0.0016200162,0.000019284062,0.0000635596,0.00028106628,0.061851025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593925,0.000025524314,0.0010108673,0.001485589,0.00058713596,0.0009516541],"domain_scores_gemma":[0.9977217,0.00041927968,0.00061554875,0.00084937573,0.0001981186,0.00019602507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009131831,0.00084514165,0.0008430996,0.00040514328,0.0008893939,0.0007492728,0.0014713659,0.00041585756,0.000015239926],"category_scores_gemma":[0.00006168809,0.00077585655,0.00049638667,0.00017814332,0.00008031061,0.00027199448,0.0008826913,0.00081257976,0.00003706078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064791743,0.000028723776,0.00000776397,0.0006745817,0.00027041018,0.00008844833,0.001327088,0.19126704,0.0005587936,0.34532186,0.0004353803,0.46001342],"study_design_scores_gemma":[0.00033898992,0.00008179482,0.0000053598724,0.0012124748,0.00004068175,0.00008694021,0.000012437273,0.91178715,0.00002911322,0.08282589,0.0026525492,0.0009265975],"about_ca_topic_score_codex":0.00008580322,"about_ca_topic_score_gemma":0.000034528115,"teacher_disagreement_score":0.72052014,"about_ca_system_score_codex":0.00009932142,"about_ca_system_score_gemma":0.00019652885,"threshold_uncertainty_score":0.9994692},"labels":[],"label_agreement":null},{"id":"W4390962955","doi":"10.4230/lipics.stacs.2025.54","title":"Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; European Commission; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Quantum walk; Divide and conquer algorithms; Recursion (computer science); Subspace topology; Computer science; Quantum; Subroutine; Quadratic growth; Theoretical computer science; Quantum algorithm; Simple (philosophy); Quantum logic; Quantum computer; Boolean function; Discrete mathematics; Mathematics; Algorithm; Quantum mechanics; Physics; Programming language; Artificial intelligence","score_opus":0.03282529287102845,"score_gpt":0.1901941828885178,"score_spread":0.15736889001748935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390962955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82150984,0.0010803278,0.17249143,0.0012045488,0.0024803474,0.00029915982,0.000042970056,0.00065781275,0.00023357706],"genre_scores_gemma":[0.99498594,0.00020465089,0.003528246,0.00021961644,0.00021295148,9.741146e-7,0.000019009498,0.000038561207,0.000790026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679637,0.00021181384,0.00030837316,0.001931886,0.00019293469,0.00055862975],"domain_scores_gemma":[0.99790907,0.00029887442,0.00015162639,0.0011503448,0.00016486763,0.00032518813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042397963,0.0005428724,0.00049605285,0.00038182532,0.0003108888,0.00024530114,0.0012303487,0.00037686492,0.000020487993],"category_scores_gemma":[0.000051935363,0.0005310819,0.00024783352,0.0005354548,0.00023285174,0.00015383255,0.0066546365,0.001487261,0.00015806156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003632606,0.00014503431,0.0005015072,0.00035903725,0.00022676752,0.0018475308,0.0008672021,0.1354059,0.00018319531,0.8498322,0.004358376,0.0062369388],"study_design_scores_gemma":[0.000266326,0.000066250104,0.00063208665,0.0003452864,0.000049431415,0.000049378337,0.000022474183,0.7803466,0.000049596183,0.21455103,0.003099107,0.00052242767],"about_ca_topic_score_codex":0.00022578661,"about_ca_topic_score_gemma":0.000013927052,"teacher_disagreement_score":0.6449407,"about_ca_system_score_codex":0.00010766321,"about_ca_system_score_gemma":0.00026827754,"threshold_uncertainty_score":0.9997141},"labels":[],"label_agreement":null},{"id":"W4391013485","doi":"10.48550/arxiv.2401.09253","title":"The generative quantum eigensolver (GQE) and its application for ground state search","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Advanced Research Projects Agency; Japan Society for the Promotion of Science; Office of Science; Defense Advanced Research Projects Agency; Council for Science, Technology and Innovation; National Energy Research Scientific Computing Center; Canadian Institute for Advanced Research; U.S. Department of Energy","keywords":"Generative grammar; Quantum; Transformer; Hamiltonian (control theory); Computer science; Quantum computer; Ground state; Generative model; Artificial intelligence; Quantum mechanics; Mathematics; Physics; Mathematical optimization","score_opus":0.04961022222098412,"score_gpt":0.21340107273032405,"score_spread":0.16379085050933992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391013485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3958292,0.00064385176,0.60168916,0.0005665147,0.00043751276,0.0005903977,0.0000305339,0.00014936566,0.00006346844],"genre_scores_gemma":[0.99663526,0.0003304295,0.0015075159,0.00007077053,0.00016712514,0.0000066167177,0.000010124222,0.000022850092,0.0012492909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981197,0.000118509524,0.00016537591,0.0011050319,0.000103534556,0.0003878384],"domain_scores_gemma":[0.9986027,0.00030727318,0.000108812535,0.0006689384,0.00019056918,0.00012173316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044974426,0.00027224672,0.00020850699,0.0001258757,0.0005786158,0.00037157536,0.0011204022,0.00013142746,7.183433e-7],"category_scores_gemma":[0.000014773083,0.0002231715,0.00013595297,0.0003569588,0.00011489144,0.000091018046,0.0024568764,0.0006314294,0.000024962666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026767182,0.000029820061,0.000025272122,0.00016992044,0.00014635558,0.000046958943,0.0012265655,0.40281072,0.00019063598,0.5787942,0.00020674626,0.016326033],"study_design_scores_gemma":[0.00012946963,0.000041903957,0.00011078598,0.000033324068,0.000022259863,0.0000040633236,0.0000302838,0.7900191,0.00018494783,0.20809887,0.0011077672,0.00021719323],"about_ca_topic_score_codex":0.00006453625,"about_ca_topic_score_gemma":0.000030818246,"teacher_disagreement_score":0.60080606,"about_ca_system_score_codex":0.00009144492,"about_ca_system_score_gemma":0.0001965691,"threshold_uncertainty_score":0.910067},"labels":[],"label_agreement":null},{"id":"W4391023775","doi":"10.1038/s41598-024-51941-8","title":"Stabilized quantum-enhanced SIEM architecture and speed-up through Hoeffding tree algorithms enable quantum cybersecurity analytics in botnet detection","year":2024,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Botnet; Quantum computer; Algorithm; Quantum; Quantum algorithm; Analytics; Speedup; Computer engineering; Theoretical computer science; Data mining; Operating system; Physics","score_opus":0.014721868638097926,"score_gpt":0.25654064322054915,"score_spread":0.2418187745824512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391023775","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64662045,0.0013727889,0.33723593,0.0004293886,0.012878613,0.00047195304,0.0000044631947,0.00061708124,0.00036931632],"genre_scores_gemma":[0.98761857,0.00002959755,0.011594004,0.00004136122,0.00022764261,0.000012000541,0.000012859393,0.000037714188,0.00042624262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946468,0.00020373435,0.00095333543,0.0023057049,0.00095071644,0.0009397142],"domain_scores_gemma":[0.9977066,0.00027125233,0.0002792528,0.0013688599,0.00014150467,0.00023251108],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026725684,0.0004613258,0.00053955783,0.0006681529,0.0005720186,0.0021750794,0.00056032406,0.0001902982,0.000015194093],"category_scores_gemma":[0.00026313937,0.00039760093,0.0002098494,0.0029151682,0.0003628865,0.0007683043,0.00051914365,0.0008165821,0.000011874566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007621563,0.0005167061,0.00043939432,0.0010998073,0.00024798364,0.007001586,0.05848473,0.06573464,0.20873308,0.012196758,0.0028281724,0.64264095],"study_design_scores_gemma":[0.00025430333,0.00010329816,0.00015694526,0.00025493331,0.000020313664,0.00073869136,0.00020261039,0.82787055,0.026431099,0.13658449,0.0069003673,0.00048241043],"about_ca_topic_score_codex":0.0002614343,"about_ca_topic_score_gemma":0.00025227663,"teacher_disagreement_score":0.7621359,"about_ca_system_score_codex":0.00017057228,"about_ca_system_score_gemma":0.00028763807,"threshold_uncertainty_score":0.9998476},"labels":[],"label_agreement":null},{"id":"W4391097207","doi":"10.1109/access.2024.3357144","title":"Nebula: Network Enhanced Boltzmann Machine With Universal Local Search Architecture","year":2024,"lang":"en","type":"article","venue":"IEEE Access","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Boltzmann machine; Computer science; Ising model; Sampling (signal processing); Mathematical optimization; Quadratic unconstrained binary optimization; Binary number; Simulated annealing; Boltzmann constant; Theoretical computer science; Algorithm; Statistical physics; Mathematics; Artificial neural network; Artificial intelligence; Quantum; Physics; Quantum computer","score_opus":0.009507163648580442,"score_gpt":0.2557105980384485,"score_spread":0.24620343438986803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391097207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056660302,0.00071387435,0.9379511,0.0016357354,0.0011507331,0.00017954632,0.0000054123175,0.0007263937,0.0009768864],"genre_scores_gemma":[0.97938657,0.00001458664,0.019005956,0.00040932655,0.0008280043,0.000006475672,0.0000053883186,0.000035468216,0.00030822825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977675,0.00010803976,0.0001888507,0.00077906396,0.00047953648,0.00067699474],"domain_scores_gemma":[0.9988993,0.00019000573,0.000037110134,0.0006229186,0.00006374742,0.00018691583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025198172,0.00029143685,0.0002465648,0.00018027336,0.00026000311,0.0009078433,0.0019179737,0.000088236586,0.000020577285],"category_scores_gemma":[0.0000036282179,0.00020930615,0.00009164695,0.0013560395,0.00014596478,0.00042593348,0.0004894644,0.00075621833,0.000047379606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027024354,0.000025702722,0.000043574575,0.0000628168,0.0000643655,0.00043205073,0.0006928228,0.7035819,0.00015718378,0.0032082114,0.0013910583,0.29031327],"study_design_scores_gemma":[0.0002939013,0.00020640403,0.0003895193,0.00023526023,0.000013796013,0.00015342655,0.000009551537,0.9852659,0.0023475387,0.00353003,0.007172582,0.00038205268],"about_ca_topic_score_codex":0.0001569012,"about_ca_topic_score_gemma":0.00008099431,"teacher_disagreement_score":0.9227263,"about_ca_system_score_codex":0.000051788367,"about_ca_system_score_gemma":0.00019939034,"threshold_uncertainty_score":0.8754354},"labels":[],"label_agreement":null},{"id":"W4391105010","doi":"10.1038/s43588-023-00578-0","title":"Language models for quantum simulation","year":2024,"lang":"en","type":"article","venue":"Nature Computational Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; Perimeter Institute; University of Waterloo","funders":"","keywords":"Computer science; Quantum; Physics; Quantum mechanics","score_opus":0.011950994730520373,"score_gpt":0.31454271207674644,"score_spread":0.3025917173462261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391105010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016239867,0.001031057,0.97892976,0.0017467968,0.0012052864,0.0001881805,0.0000108713575,0.00043940175,0.0002087533],"genre_scores_gemma":[0.8100451,6.8934577e-7,0.18934707,0.00037373236,0.00018990017,0.0000065614113,0.0000071530267,0.000007050579,0.000022696426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824333,0.000018698849,0.00016897268,0.0006175154,0.0006429361,0.00030856425],"domain_scores_gemma":[0.9985507,0.00087363843,0.000036429323,0.00021648918,0.00022625715,0.000096452866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067118945,0.00012716383,0.00009708891,0.0002812068,0.00036623445,0.00065950764,0.00090534316,0.0000827445,0.0000022005138],"category_scores_gemma":[0.00014514464,0.00010436309,0.000076691154,0.0013633693,0.000118846256,0.0008214048,0.00017409661,0.0003052439,0.000012498753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.976129e-7,0.000007156927,8.902156e-7,0.000010878618,0.0000023123741,0.000003718885,0.00042343032,0.6308236,0.00012537936,0.33174807,0.00007990621,0.036773633],"study_design_scores_gemma":[0.00006559081,0.00003020274,0.00016687873,0.000030380736,0.0000017823112,0.00001260728,0.000005337041,0.7762087,0.000087808265,0.22250041,0.00077535916,0.00011491597],"about_ca_topic_score_codex":0.0000032859375,"about_ca_topic_score_gemma":5.6560185e-7,"teacher_disagreement_score":0.7938053,"about_ca_system_score_codex":0.000064106884,"about_ca_system_score_gemma":0.00033332355,"threshold_uncertainty_score":0.6359647},"labels":[],"label_agreement":null},{"id":"W4391134769","doi":"10.21468/scipost.report.8094","title":"Report on 2304.09900v1","year":2023,"lang":"en","type":"peer-review","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Ministerio de Ciencia e Innovación; European Commission; Comunidad de Madrid","keywords":"Materials science","score_opus":0.03061385068003329,"score_gpt":0.3061896471342583,"score_spread":0.275575796454225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391134769","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015552097,0.011607323,0.17047878,0.61543834,0.047745466,0.0012641295,0.00008243647,0.0061965827,0.14717141],"genre_scores_gemma":[0.0000074473987,0.0011607382,0.023728967,0.014882799,0.0016739644,0.000034771132,0.00024626296,0.00007384203,0.9581912],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965443,0.00008865453,0.0005974048,0.0012530508,0.0009944744,0.0005221171],"domain_scores_gemma":[0.99677336,0.00027150763,0.0003303297,0.0022954547,0.00016609304,0.00016324155],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009250046,0.00046038665,0.000695533,0.00022896344,0.00015478776,0.00019428377,0.0021777824,0.00022407119,0.000096900665],"category_scores_gemma":[0.00030278854,0.0003368233,0.00036330445,0.00081010966,0.000033271644,0.000050602273,0.00096643233,0.0009201491,0.0017787003],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3356824e-7,0.000018638522,4.1886196e-7,0.00038737277,0.000024553841,0.001079374,0.000009904226,0.0001249966,1.555083e-7,0.0015001055,0.9085686,0.08828561],"study_design_scores_gemma":[0.00005629898,0.00008044541,0.000027781367,0.0027617353,0.00001565647,0.00040298948,3.0418727e-7,0.025004957,0.0000057357256,0.001445041,0.9697708,0.00042825495],"about_ca_topic_score_codex":0.00010819178,"about_ca_topic_score_gemma":0.000017304275,"teacher_disagreement_score":0.8110198,"about_ca_system_score_codex":0.00004574855,"about_ca_system_score_gemma":0.00026906718,"threshold_uncertainty_score":0.9999084},"labels":[],"label_agreement":null},{"id":"W4391335643","doi":"10.28924/2291-8639-22-2024-24","title":"Modified Intuitionistic Quantum Fuzzy Operators for Binary Optimization Problems","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Prince of Songkla University","keywords":"Realization (probability); Mathematics; Quantum; Fuzzy logic; Binary number; Fuzzy inference; Quadratic unconstrained binary optimization; Quadratic equation; Mathematical optimization; Theoretical computer science; Computer science; Algebra over a field; Artificial intelligence; Fuzzy control system; Adaptive neuro fuzzy inference system; Pure mathematics; Arithmetic; Quantum computer","score_opus":0.010772782323995903,"score_gpt":0.27424922959745435,"score_spread":0.2634764472734584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391335643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004255862,0.0005619842,0.9919266,0.0027934543,0.00022290541,0.000112064925,0.000019845453,0.000035765413,0.000071526934],"genre_scores_gemma":[0.9284848,0.00017448449,0.07075525,0.000098225806,0.00038032365,0.00003224663,0.000026019537,0.000006846787,0.000041791234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907666,0.00002201122,0.00037336466,0.00019984388,0.00023913042,0.00008901285],"domain_scores_gemma":[0.9991056,0.000138985,0.00014804672,0.00012142783,0.00042047357,0.00006552298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029710052,0.00008702456,0.00015324955,0.00055560935,0.00012374144,0.0005517757,0.00047502833,0.000032160133,0.00000513192],"category_scores_gemma":[0.000015469808,0.00006946179,0.00018603996,0.00068646186,0.00003186995,0.00023597026,0.00007102669,0.000107099346,0.0000013637991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034076625,0.00005564192,0.000030468716,0.000013321595,0.00065718667,0.00000439233,0.00016280542,0.8167829,0.00018639729,0.1408324,0.00014631009,0.041124757],"study_design_scores_gemma":[0.00011658139,0.000054850214,0.00010737431,0.000033349694,0.0001530287,0.00003808914,0.000013709556,0.9769677,0.00003335642,0.018586205,0.003817526,0.000078234305],"about_ca_topic_score_codex":0.00000690614,"about_ca_topic_score_gemma":0.0000014031901,"teacher_disagreement_score":0.92422897,"about_ca_system_score_codex":0.00003119439,"about_ca_system_score_gemma":0.00006947048,"threshold_uncertainty_score":0.53207856},"labels":[],"label_agreement":null},{"id":"W4391462086","doi":"10.48550/arxiv.2401.17357","title":"Mixed-state quantum anomaly and multipartite entanglement","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Materials Research; Natural Sciences and Engineering Research Council of Canada; Institut Périmètre de physique théorique; Industry Canada; National Science Foundation; Government of Canada; Ministry of Colleges and Universities","keywords":"Quantum entanglement; Multipartite; Multipartite entanglement; W state; Anomaly (physics); Quantum mechanics; State (computer science); Quantum state; Physics; Quantum; Squashed entanglement; Theoretical physics; Statistical physics; Mathematics; Algorithm","score_opus":0.04281002163047114,"score_gpt":0.18428582626531675,"score_spread":0.1414758046348456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391462086","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8111524,0.00044358082,0.18583304,0.00032971182,0.0013078189,0.00022168638,0.00003154319,0.0004272771,0.00025295196],"genre_scores_gemma":[0.9952468,0.0001406313,0.0035852743,0.000093952316,0.000100761834,9.543966e-7,0.000007666189,0.000024638095,0.0007993167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976545,0.00012058323,0.00022953835,0.0014260579,0.00011338823,0.00045593982],"domain_scores_gemma":[0.99855757,0.00009070324,0.00015104664,0.0009093413,0.000066479726,0.0002248683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026315698,0.00039236032,0.00033020653,0.00029217362,0.00016959952,0.00034167257,0.0011203892,0.00014771885,0.0000074741415],"category_scores_gemma":[0.000011551418,0.00040280554,0.00018469224,0.0004337501,0.000112994385,0.000109891116,0.00556392,0.00078525255,0.00009016088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033502565,0.00019896215,0.0023886992,0.0006030136,0.000413327,0.0034643267,0.0022724702,0.654249,0.00018057768,0.31032082,0.0014672222,0.024408076],"study_design_scores_gemma":[0.00023974852,0.00006462888,0.00094803976,0.00017124755,0.000042144467,0.000017016984,0.0000270987,0.9074934,0.00012327784,0.08903256,0.0014173039,0.00042352057],"about_ca_topic_score_codex":0.00017972826,"about_ca_topic_score_gemma":0.000056270266,"teacher_disagreement_score":0.2532444,"about_ca_system_score_codex":0.0000969496,"about_ca_system_score_gemma":0.00012263749,"threshold_uncertainty_score":0.9998424},"labels":[],"label_agreement":null},{"id":"W4391547750","doi":"10.1109/comst.2024.3361662","title":"A Survey of Quantum Internet Protocols From a Layered Perspective","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Perspective (graphical); The Internet; Internet privacy; Computer science; World Wide Web; Artificial intelligence","score_opus":0.08058248362427577,"score_gpt":0.3580161048826365,"score_spread":0.27743362125836074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391547750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03346472,0.0030353072,0.95070064,0.0013495722,0.004191837,0.0049629766,0.00060994143,0.00086470734,0.000820271],"genre_scores_gemma":[0.9802031,0.000036954567,0.018413577,0.000027384642,0.00026884425,0.00085521775,0.000056669724,0.000030460817,0.000107785905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930101,0.005009613,0.00071362173,0.0005880619,0.00038114938,0.0002974349],"domain_scores_gemma":[0.9911042,0.004530383,0.00023308034,0.0033818735,0.00064957957,0.000100886085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005761418,0.00025606336,0.0004988687,0.00022688514,0.00014877958,0.00043671683,0.0042322376,0.0001254084,0.000018804063],"category_scores_gemma":[0.0008524648,0.00023017233,0.00015646168,0.0012074136,0.00024871068,0.000297341,0.0009601965,0.0004521582,0.000076224234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012167195,0.0029748448,0.0075500896,0.00033735274,0.0023015959,0.00007184582,0.065518945,0.004941996,0.028024333,0.6647334,0.030617602,0.1928063],"study_design_scores_gemma":[0.00048996124,0.00023336924,0.04695878,0.00059210946,0.000020186817,0.000008386953,0.00007998895,0.9154045,0.00270647,0.02208069,0.010876778,0.00054878107],"about_ca_topic_score_codex":0.022002695,"about_ca_topic_score_gemma":0.00116383,"teacher_disagreement_score":0.94673836,"about_ca_system_score_codex":0.000117468466,"about_ca_system_score_gemma":0.00049087784,"threshold_uncertainty_score":0.9845099},"labels":[],"label_agreement":null},{"id":"W4391558311","doi":"10.1088/2058-9565/ad26b3","title":"A thermodynamic approach to optimization in complex quantum systems","year":2024,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast; Aarhus Universitet","keywords":"Complex system; Quantum; Statistical physics; Computer science; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.012962966628829866,"score_gpt":0.2444716156195155,"score_spread":0.23150864899068563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391558311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2004579,0.0006877697,0.79312557,0.0035460908,0.0004607863,0.00032399915,0.0000021094588,0.000786892,0.00060886773],"genre_scores_gemma":[0.9651666,0.000019929319,0.034628794,0.00009725697,0.000027576707,0.000034586228,0.0000012495985,0.000010734783,0.000013247477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784327,0.000035137342,0.00026212874,0.0009188325,0.00038641595,0.0005541918],"domain_scores_gemma":[0.9991821,0.000050994993,0.000037691116,0.0005150741,0.00010893516,0.00010517283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009286431,0.00017938038,0.00022482271,0.0017666661,0.0002486669,0.00055072404,0.001339224,0.00010891087,8.930204e-7],"category_scores_gemma":[0.00008509115,0.00014557297,0.000020278661,0.0064319917,0.00043699605,0.00034240764,0.0005744371,0.00028788732,0.000015284346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013045915,0.00004614674,0.000054114622,0.000042142772,0.000003704639,0.000027242068,0.0005139499,0.03805377,0.0044993204,0.9329824,0.00006981213,0.023706129],"study_design_scores_gemma":[0.00008252529,0.00012067593,0.0002499192,0.000065105254,0.00000162988,0.00019017796,0.00014043905,0.9882753,0.00004919925,0.009915672,0.0007145776,0.00019476474],"about_ca_topic_score_codex":0.00006377369,"about_ca_topic_score_gemma":0.0000024509986,"teacher_disagreement_score":0.95022154,"about_ca_system_score_codex":0.00008550106,"about_ca_system_score_gemma":0.0002157185,"threshold_uncertainty_score":0.5936293},"labels":[],"label_agreement":null},{"id":"W4391740246","doi":"","title":"On scalable quantum-inspired distributed machine learning","year":2024,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada)","funders":"","keywords":"Scalability; Computer science; Quantum; Quantum machine learning; Distributed computing; Artificial intelligence; Quantum computer; Physics; Quantum mechanics; Operating system","score_opus":0.009804221441197202,"score_gpt":0.22034478483570244,"score_spread":0.21054056339450525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391740246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08437001,0.0023310657,0.8767885,0.022190021,0.0010522403,0.00044712386,0.00014770683,0.0020697257,0.010603621],"genre_scores_gemma":[0.92248124,0.00018436067,0.07191436,0.00017758206,0.00006370649,0.000048075617,0.00063569535,0.00008485146,0.004410104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927266,0.0038743897,0.000599221,0.0015106087,0.00068542623,0.0006037322],"domain_scores_gemma":[0.9940068,0.0017345304,0.00041961443,0.002680019,0.0008891837,0.00026983183],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004260739,0.00055241486,0.0005149108,0.0003369145,0.0006135448,0.0014920841,0.0029579033,0.00033085136,0.00004271147],"category_scores_gemma":[0.0012904387,0.00052771403,0.00034555234,0.0008546371,0.00015780891,0.00009125402,0.005666257,0.0024112663,0.0002041583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014309388,0.0007520359,0.00023091857,0.000486828,0.00019840828,0.000095822,0.00722148,0.029858567,0.00077283225,0.7811521,0.003236962,0.1759797],"study_design_scores_gemma":[0.00026218433,0.0000014188088,0.00025240073,0.0022426215,0.000022414915,0.000019061656,0.000008680592,0.919655,0.0040828623,0.063389555,0.009554282,0.0005095214],"about_ca_topic_score_codex":0.0008087363,"about_ca_topic_score_gemma":0.00016466745,"teacher_disagreement_score":0.88979644,"about_ca_system_score_codex":0.00014764069,"about_ca_system_score_gemma":0.00032706175,"threshold_uncertainty_score":0.9998902},"labels":[],"label_agreement":null},{"id":"W4391745256","doi":"10.1038/s41598-024-53708-7","title":"Effective prime factorization via quantum annealing by modular locally-structured embedding","year":2024,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Women's College Research Institute; Università degli Studi di Trento; Nuclear Physics; Provincia Autonoma di Trento; Fondazione Bruno Kessler","keywords":"Multiplier (economics); Qubit; Factorization; Computer science; Quantum computer; Quantum annealing; Quantum; Modulo; Modular design; Embedding; Topology (electrical circuits); Algorithm; Arithmetic; Mathematics; Discrete mathematics; Physics; Quantum mechanics; Combinatorics; Artificial intelligence","score_opus":0.004435093371985369,"score_gpt":0.23562796205964245,"score_spread":0.2311928686876571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391745256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15672961,0.0008285846,0.82388866,0.00014824618,0.01731808,0.00033279462,0.0000024693454,0.00069864327,0.000052938063],"genre_scores_gemma":[0.9871746,0.0000014408445,0.012193501,0.00002650886,0.00021997171,0.000013487172,0.000047573332,0.000026340424,0.00029658584],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966305,0.00010875025,0.00048095774,0.0015239909,0.0007510089,0.0005048173],"domain_scores_gemma":[0.9984272,0.00009849102,0.00018074762,0.000972289,0.00014800389,0.00017325376],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012554933,0.0002673242,0.00023745235,0.0002881811,0.0005619616,0.0019894484,0.00047446182,0.00011003528,0.000012341931],"category_scores_gemma":[0.00010430894,0.00022430066,0.0001418353,0.0013376669,0.00012366072,0.0005288007,0.00028067335,0.0003194916,0.0000235119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004863329,0.00007149636,0.00030716142,0.00020488628,0.00012129774,0.001826526,0.004890535,0.10202006,0.4850238,0.002832603,0.009653566,0.39304322],"study_design_scores_gemma":[0.00004484293,0.00003654866,0.000108586864,0.00011809963,0.0000084242,0.00031397046,0.0000070691717,0.9068313,0.046531674,0.03415331,0.011580094,0.00026607336],"about_ca_topic_score_codex":0.000026302847,"about_ca_topic_score_gemma":0.0000011620665,"teacher_disagreement_score":0.830445,"about_ca_system_score_codex":0.00009647229,"about_ca_system_score_gemma":0.00013508718,"threshold_uncertainty_score":0.99904656},"labels":[],"label_agreement":null},{"id":"W4391871310","doi":"10.22331/q-2024-08-28-1453","title":"GraphiQ: Quantum circuit design for photonic graph states","year":2024,"lang":"en","type":"preprint","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; University of Toronto","funders":"Air Force Office of Scientific Research; Mitacs","keywords":"Photonics; Quantum; Graph; Physics; Computer science; Optoelectronics; Quantum mechanics; Theoretical computer science","score_opus":0.033278613556856414,"score_gpt":0.26735163969144554,"score_spread":0.23407302613458913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391871310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03321754,0.006292111,0.9463892,0.0015891083,0.008371598,0.0017142997,0.00018917417,0.0021552795,0.00008167796],"genre_scores_gemma":[0.85738397,0.0009055281,0.13716781,0.001065052,0.0013912395,0.001060925,0.00023194216,0.00037730148,0.00041623492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944794,0.00026224996,0.0009103366,0.0023367794,0.0007113292,0.0012998615],"domain_scores_gemma":[0.9959793,0.00082872657,0.00041266176,0.0021321217,0.00031961844,0.00032754545],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014045825,0.0009907429,0.0009826304,0.0009066485,0.00033542022,0.0012268635,0.0034496337,0.00054340606,0.000011969273],"category_scores_gemma":[0.00010803345,0.0008850812,0.0008614576,0.0011623556,0.00018902727,0.000116441406,0.0028295247,0.0018833656,0.000112087415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059979782,0.0003091922,0.000015545684,0.0028703609,0.00088966166,0.00033997782,0.0056320927,0.1668799,0.0008121323,0.7435302,0.041118972,0.037541993],"study_design_scores_gemma":[0.00017890646,0.00021512675,0.000016545446,0.00034948223,0.00004913895,0.000030285886,0.000015517508,0.5135485,0.00038979977,0.48162752,0.0029844346,0.0005947383],"about_ca_topic_score_codex":0.00014688572,"about_ca_topic_score_gemma":0.000006730868,"teacher_disagreement_score":0.8241664,"about_ca_system_score_codex":0.00014256327,"about_ca_system_score_gemma":0.0009083954,"threshold_uncertainty_score":0.99981},"labels":[],"label_agreement":null},{"id":"W4391912705","doi":"10.1145/3643667.3648226","title":"On the need for effective tools for debugging quantum programs","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Debugging; Computer science; Set (abstract data type); Quantum; Software engineering; Quantum computer; Programming language","score_opus":0.026438102415976897,"score_gpt":0.27725314722433075,"score_spread":0.25081504480835387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391912705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011974482,0.00019977917,0.96210855,0.014898704,0.003286878,0.0059041046,0.00002684572,0.0011378054,0.00046282678],"genre_scores_gemma":[0.7532538,0.0000037167158,0.23595531,0.0019681696,0.0016106452,0.006476165,0.0000549241,0.00011375179,0.00056352565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978097,0.00008563845,0.00028858823,0.001025259,0.00025826987,0.00053256046],"domain_scores_gemma":[0.9949665,0.003776726,0.00012997258,0.0009222634,0.00012944482,0.000075082324],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00092051784,0.00041322413,0.00037140303,0.00012680521,0.00030997227,0.0018636653,0.0016188152,0.00019364028,0.0000017165638],"category_scores_gemma":[0.00031974717,0.00023559532,0.0005332095,0.0002157154,0.000048105132,0.000050411836,0.0018801565,0.0007824998,0.00001717456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001489758,0.00004328081,3.3765045e-7,0.00029957166,0.00011185491,0.000002378697,0.00054275565,0.0049042227,0.000016266833,0.46938977,0.004236193,0.5204385],"study_design_scores_gemma":[0.000121646546,0.00027594197,0.0000061992014,0.00032906613,0.0000202662,0.0000033886704,0.000013035028,0.60086286,0.00023521719,0.39456707,0.0033490853,0.00021625435],"about_ca_topic_score_codex":0.000022446267,"about_ca_topic_score_gemma":0.000004737971,"teacher_disagreement_score":0.7412793,"about_ca_system_score_codex":0.00006128923,"about_ca_system_score_gemma":0.00015164229,"threshold_uncertainty_score":0.9991725},"labels":[],"label_agreement":null},{"id":"W4392120469","doi":"10.1140/epjc/s10052-024-12598-9","title":"Effects of underlying topology on quantum state discrimination","year":2024,"lang":"en","type":"preprint","venue":"The European Physical Journal C","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; Canadian Quantum Research Center; Perimeter Institute","funders":"","keywords":"Topology (electrical circuits); State (computer science); Quantum; Computer science; Physics; Mathematics; Quantum mechanics; Algorithm; Combinatorics","score_opus":0.022572114602171855,"score_gpt":0.2855687340427305,"score_spread":0.26299661944055863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392120469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80944633,0.00055697403,0.1734387,0.004800912,0.004253828,0.00027007045,0.0000052778314,0.0002072452,0.007020644],"genre_scores_gemma":[0.9979226,0.000032391792,0.00073720905,0.000090650516,0.0011166991,0.0000010841075,8.325219e-7,0.0000351021,0.000063426865],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974192,0.001252821,0.00030059434,0.0003604305,0.00039648716,0.00027051094],"domain_scores_gemma":[0.9985628,0.00055326347,0.00031719674,0.0004165812,0.00006455287,0.00008559512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007363734,0.00025534167,0.00030542535,0.00012700078,0.0001826023,0.00030240402,0.0014870914,0.000029052739,1.8578508e-7],"category_scores_gemma":[0.000058402715,0.0001472708,0.00028305384,0.0001598178,0.00011340752,0.00003761789,0.0022011776,0.0021886227,0.00004802975],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002433159,0.0003030716,4.1445375e-7,0.0005812134,0.00020730431,0.00068670785,0.010893595,0.05494316,0.005793616,0.053944137,0.0017493633,0.8708731],"study_design_scores_gemma":[0.00013853346,0.00032549753,0.00070145685,0.0008065448,0.000045803863,0.00008156214,0.000014984991,0.20103332,0.0010331916,0.79557776,0.00004935929,0.0001919927],"about_ca_topic_score_codex":0.0000058106407,"about_ca_topic_score_gemma":2.0488031e-7,"teacher_disagreement_score":0.8706811,"about_ca_system_score_codex":0.000037276634,"about_ca_system_score_gemma":0.00006289892,"threshold_uncertainty_score":0.9508598},"labels":[],"label_agreement":null},{"id":"W4392155664","doi":"10.22331/q-2024-02-26-1266","title":"Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Laboratory Directed Research and Development; U.S. Department of Energy","keywords":"Extrapolation; Interpolation (computer graphics); Applied mathematics; Algorithm; Hamiltonian (control theory); Limit (mathematics); Quantum; Eigenvalues and eigenvectors; Chebyshev filter; Computer science; Mathematics; Quantum computer; Mathematical optimization; Quantum mechanics; Mathematical analysis; Artificial intelligence; Physics","score_opus":0.02553795757688832,"score_gpt":0.3076169928885159,"score_spread":0.2820790353116276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392155664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13129082,0.000162663,0.86561006,0.0011126552,0.0011994044,0.0002467878,0.000011487922,0.00034664117,0.000019474302],"genre_scores_gemma":[0.9142061,6.560104e-7,0.08516242,0.00018351263,0.00036907714,0.000008731591,0.0000063117254,0.00001808782,0.000045098044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898493,0.000029649356,0.00022627755,0.00038435182,0.00010912375,0.0002656446],"domain_scores_gemma":[0.9991203,0.000407267,0.000049977465,0.00031251463,0.00005575113,0.00005418858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016797755,0.00013908173,0.00012238785,0.00015156176,0.00018236489,0.000439911,0.0003575109,0.000056030767,0.000010563104],"category_scores_gemma":[0.00008080152,0.00011882499,0.00011599256,0.00032435975,0.000020396044,0.00038661808,0.000119031385,0.00015137834,0.000010435162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038502276,0.00017802096,0.00021020281,0.00047949768,0.00020753508,0.000028942146,0.0073184893,0.068269625,0.20045179,0.27002674,0.0025739637,0.45021668],"study_design_scores_gemma":[0.00013428564,0.000063275016,0.00005424437,0.000070180206,0.000009196151,0.000016629552,0.000007926791,0.9774686,0.00073045446,0.01638778,0.0048981467,0.00015924525],"about_ca_topic_score_codex":0.000020082754,"about_ca_topic_score_gemma":0.0000021717317,"teacher_disagreement_score":0.909199,"about_ca_system_score_codex":0.000033099117,"about_ca_system_score_gemma":0.000078281606,"threshold_uncertainty_score":0.48455423},"labels":[],"label_agreement":null},{"id":"W4392166480","doi":"10.1103/physreva.109.022618","title":"Minimal qubit representations of Hamiltonians via conserved charges","year":2024,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Qubit; Physics; Quantum mechanics; Theoretical physics; Quantum","score_opus":0.015945756876482555,"score_gpt":0.35573062907780667,"score_spread":0.33978487220132414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392166480","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16794695,0.54902416,0.23637244,0.037074503,0.0010968584,0.0035010027,0.00012029057,0.0012971156,0.0035666882],"genre_scores_gemma":[0.9008974,0.084378675,0.008685787,0.004286617,0.0011329209,0.00030767714,0.000037819067,0.000086758715,0.00018639112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642974,0.0004006171,0.0007934858,0.0010392838,0.00078324997,0.0005535954],"domain_scores_gemma":[0.9969724,0.0010075303,0.00026145298,0.0012806392,0.00019560536,0.00028240398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049533,0.00046511897,0.0014095361,0.00008163038,0.00012910798,0.00010775233,0.0013019033,0.0000353728,0.00002406052],"category_scores_gemma":[0.00044726062,0.00034635438,0.0010832646,0.0016353872,0.00021350392,0.00031882085,0.0004790719,0.0005783778,0.00042890752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012348849,0.002092026,0.000118360236,0.048507456,0.00046414044,0.00018874869,0.0012133109,0.00010568741,0.070948325,0.21234933,0.02734733,0.63665295],"study_design_scores_gemma":[0.00035078597,0.0006320329,0.0010815096,0.049854368,0.00063317874,0.000098333076,0.0000053821577,0.75007147,0.017644301,0.08395387,0.09440487,0.0012698887],"about_ca_topic_score_codex":0.00003527731,"about_ca_topic_score_gemma":0.0000017030113,"teacher_disagreement_score":0.7499658,"about_ca_system_score_codex":0.000036350866,"about_ca_system_score_gemma":0.00017019382,"threshold_uncertainty_score":0.99989885},"labels":[],"label_agreement":null},{"id":"W4392240014","doi":"10.1038/s42005-024-01552-6","title":"A framework for demonstrating practical quantum advantage: comparing quantum against classical generative models","year":2024,"lang":"en","type":"article","venue":"Communications Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Compute Canada; Mitacs; Government of Canada","keywords":"Quantum; Generative grammar; Computer science; Theoretical physics; Statistical physics; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.0998357170356442,"score_gpt":0.3734038959812662,"score_spread":0.273568178945622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392240014","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026540658,0.0010379013,0.9845623,0.009458314,0.00044419852,0.00036809433,0.000019561718,0.00066954404,0.00078604807],"genre_scores_gemma":[0.4928026,0.000066838555,0.50657505,0.00020773889,0.00021993434,0.000069582435,0.000025870917,0.000023759907,0.000008608298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980124,0.00024273914,0.0004429027,0.00057503476,0.00027300333,0.0004539158],"domain_scores_gemma":[0.99483013,0.0026032422,0.00013363363,0.0021288956,0.00016141431,0.00014267341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040594835,0.0002819138,0.0003299106,0.00008134037,0.00088249205,0.0007884761,0.001884307,0.000120585384,5.268202e-7],"category_scores_gemma":[0.0001658841,0.0002650297,0.00021683342,0.0006950984,0.0002384549,0.0007594785,0.0011421401,0.0011185983,0.000020554546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028321306,0.00014775382,0.000006556231,0.000036519694,0.000049750244,0.0000042147353,0.0013132732,0.017512735,0.00025398313,0.9300715,0.00040427299,0.05019666],"study_design_scores_gemma":[0.00007770614,0.00004215626,0.000004623472,0.00016167229,0.000014353236,0.000010967625,0.00009094696,0.6012475,0.000103636805,0.39644915,0.0016018131,0.00019547544],"about_ca_topic_score_codex":0.000003779496,"about_ca_topic_score_gemma":0.0000032657433,"teacher_disagreement_score":0.58373475,"about_ca_system_score_codex":0.0000754569,"about_ca_system_score_gemma":0.00032932824,"threshold_uncertainty_score":0.9999802},"labels":[],"label_agreement":null},{"id":"W4392270687","doi":"10.1103/physrevresearch.6.023247","title":"Flying-cat parity checks for quantum error correction","year":2024,"lang":"en","type":"preprint","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Parity (physics); Computer science; Quantum; Error detection and correction; Arithmetic; Mathematics; Algorithm; Physics; Quantum mechanics","score_opus":0.12326171827082119,"score_gpt":0.458137338269195,"score_spread":0.3348756199983738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392270687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05784061,0.23623429,0.61196816,0.051817976,0.022212705,0.013921854,0.00017421402,0.0027565174,0.0030736984],"genre_scores_gemma":[0.91057265,0.027851555,0.039536227,0.0016862514,0.010506139,0.005379209,0.00023740865,0.00037052121,0.0038600499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948519,0.0006675036,0.0004970604,0.0016702543,0.0013343345,0.0009789453],"domain_scores_gemma":[0.995963,0.0013325353,0.00014643639,0.0016586696,0.000609806,0.00028959365],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003374092,0.00043864135,0.00092223525,0.00023221457,0.00054128136,0.0006053118,0.0025057835,0.00016639348,0.000007442541],"category_scores_gemma":[0.001190281,0.00034488732,0.0007503347,0.001061008,0.00016207909,0.00007468621,0.006457538,0.0033499403,0.0003484612],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010748845,0.00043348625,0.0000046260166,0.027171092,0.0001207093,0.000027432345,0.0007582397,0.0005627633,0.0002657103,0.047734894,0.07835954,0.8445508],"study_design_scores_gemma":[0.000058670976,0.00013467499,0.00003188369,0.006409459,0.000028671862,0.0000060550474,0.0000042400447,0.7427643,0.0001338284,0.2266486,0.023494314,0.00028529772],"about_ca_topic_score_codex":0.00014258733,"about_ca_topic_score_gemma":0.0000084911535,"teacher_disagreement_score":0.852732,"about_ca_system_score_codex":0.00020642868,"about_ca_system_score_gemma":0.0006835955,"threshold_uncertainty_score":0.99990034},"labels":[],"label_agreement":null},{"id":"W4392359273","doi":"10.1103/physrevresearch.6.013224","title":"Composite Qdrift-product formulas for quantum and classical simulations in real and imaginary time","year":2024,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Vector Institute; University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada; Government of Canada; Canadian Institute for Advanced Research; Shared Hierarchical Academic Research Computing Network; U.S. Department of Energy","keywords":"The Imaginary; Composite number; Quantum; Product (mathematics); Imaginary time; Mathematics; Physics; Pure mathematics; Quantum mechanics; Quantum dynamics; Algorithm; Geometry; Psychology","score_opus":0.04928935450755901,"score_gpt":0.41344600125139236,"score_spread":0.36415664674383336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392359273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6808167,0.18060523,0.041159086,0.0904429,0.0003524225,0.0044851713,0.00007847761,0.0006372278,0.0014227448],"genre_scores_gemma":[0.9892463,0.003859449,0.006189234,0.00013335457,0.00035466792,0.000055439188,0.000011437187,0.00002235921,0.00012774963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812967,0.00022502647,0.00020585052,0.0006376329,0.0003681176,0.00043368567],"domain_scores_gemma":[0.99780613,0.0015974175,0.000017544618,0.00033924746,0.000096348056,0.00014329149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090310076,0.00014084025,0.00031463534,0.00015221136,0.00017673844,0.00025668272,0.00033518203,0.000020706235,0.0000017553605],"category_scores_gemma":[0.0001722452,0.00010688568,0.00006848622,0.0007574053,0.0001723907,0.00023913315,0.00049446896,0.00050340797,0.000022646036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024675115,0.00034622982,0.00013190985,0.0052642445,0.00004122175,0.00008720318,0.0008935181,0.0003696067,0.010174836,0.24672313,0.006199686,0.7297437],"study_design_scores_gemma":[0.00011487836,0.00014936858,0.00086573785,0.0011296753,0.000006201592,0.000016848913,8.0573545e-7,0.9207356,0.000062850035,0.06745441,0.009344342,0.000119298886],"about_ca_topic_score_codex":0.00002116159,"about_ca_topic_score_gemma":0.0000018959863,"teacher_disagreement_score":0.920366,"about_ca_system_score_codex":0.000029556511,"about_ca_system_score_gemma":0.00008080045,"threshold_uncertainty_score":0.43586716},"labels":[],"label_agreement":null},{"id":"W4392369852","doi":"10.1038/s41567-024-02411-5","title":"Drug design on quantum computers","year":2024,"lang":"en","type":"article","venue":"Nature Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Physics; Drug; Quantum computer; Quantum; Quantum mechanics; Medicine; Pharmacology","score_opus":0.010389929589176214,"score_gpt":0.24996182934022004,"score_spread":0.23957189975104382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392369852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028850138,0.0009144936,0.98771155,0.0032280046,0.0037113416,0.00013148894,0.0000033329509,0.0009311811,0.00048357938],"genre_scores_gemma":[0.8989974,0.000009935155,0.097734,0.0018779712,0.0012055094,0.0000047600124,0.000004008717,0.000029433699,0.00013693709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998525,0.00008686589,0.00013107811,0.0005583853,0.00037816903,0.0003205008],"domain_scores_gemma":[0.99889445,0.00044624062,0.000031808897,0.0005012681,0.0000396904,0.00008654824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021556608,0.00022142011,0.0001642587,0.00008143407,0.00013896529,0.00040838396,0.0008659653,0.00011062426,0.0000014994146],"category_scores_gemma":[0.00001219654,0.00017285104,0.00012911942,0.0006653122,0.000032586304,0.00017951729,0.00018174491,0.0011401222,0.00014022212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004504139,0.000065263754,0.0000017518771,0.00003901951,0.00003968787,0.000115428724,0.00092144083,0.046893496,0.00019931328,0.6150645,0.042506073,0.29414952],"study_design_scores_gemma":[0.000080845486,0.000071086666,0.000032777698,0.00013350017,0.000004509435,0.000014310126,0.0000022940023,0.90487504,0.0017991292,0.07878852,0.013986936,0.00021107975],"about_ca_topic_score_codex":0.0000029093228,"about_ca_topic_score_gemma":1.5092205e-7,"teacher_disagreement_score":0.89611244,"about_ca_system_score_codex":0.000035754223,"about_ca_system_score_gemma":0.00007887059,"threshold_uncertainty_score":0.70486605},"labels":[],"label_agreement":null},{"id":"W4392374948","doi":"10.1007/s42484-024-00152-5","title":"Expressive quantum supervised machine learning using Kerr-nonlinear parametric oscillators","year":2024,"lang":"en","type":"article","venue":"Quantum Machine Intelligence","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Moonshot Research and Development Program; Japan Society for the Promotion of Science; New Energy and Industrial Technology Development Organization; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Nonlinear system; Parametric statistics; Quantum; Computer science; Artificial intelligence; Physics; Machine learning; Mathematics; Quantum mechanics; Statistics","score_opus":0.023014237717955653,"score_gpt":0.2822966213796009,"score_spread":0.25928238366164524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392374948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25526485,0.01028378,0.7299606,0.00052382593,0.0022241764,0.00029968322,0.000029405524,0.001302968,0.000110672234],"genre_scores_gemma":[0.94753027,0.0003455239,0.051232543,0.0001859839,0.00044732323,0.000012499387,0.000023851873,0.000100849524,0.000121159785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950251,0.00041512444,0.0009627047,0.0016316659,0.0008401441,0.0011252845],"domain_scores_gemma":[0.9970539,0.0010538307,0.00022262684,0.0010891537,0.00018043909,0.00040003093],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010362612,0.00075417216,0.00066212344,0.0010477981,0.0006424701,0.0010717749,0.0021947543,0.00022118984,0.000109148],"category_scores_gemma":[0.0005186809,0.0006331367,0.00041527796,0.0035070973,0.0002004237,0.0006413202,0.0009895612,0.0017095619,0.00028660742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000546621,0.00032867328,0.0016556833,0.00048689288,0.00026481302,0.0013366077,0.003954149,0.60737,0.0039179036,0.10631571,0.0001779417,0.27413693],"study_design_scores_gemma":[0.00011243765,0.00031048822,0.000053031683,0.00031112676,0.000026735263,0.00036983224,0.00006343401,0.97849643,0.0028389688,0.011776971,0.0048502544,0.0007902991],"about_ca_topic_score_codex":0.00084261526,"about_ca_topic_score_gemma":0.000012282392,"teacher_disagreement_score":0.6922654,"about_ca_system_score_codex":0.00014192947,"about_ca_system_score_gemma":0.0002684008,"threshold_uncertainty_score":0.9999652},"labels":[],"label_agreement":null},{"id":"W4392385369","doi":"10.1007/s11128-024-04284-2","title":"Quantum pulse-width modulation design and implementation for a DC motor drive","year":2024,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Quantum computer; Pulse-width modulation; Quantum; Modulation (music); Physics; Computer science; Optoelectronics; Quantum mechanics; Voltage; Acoustics","score_opus":0.015354624617658933,"score_gpt":0.2809238978742816,"score_spread":0.2655692732566227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392385369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03430658,0.0002915623,0.96281606,0.0010075906,0.0004002099,0.0006379338,0.000010016116,0.00049825636,0.000031810618],"genre_scores_gemma":[0.8432563,0.0000124426415,0.15624967,0.00024115603,0.00009715183,0.00007776185,0.0000437524,0.00001276113,0.0000090311005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998585,0.000043264477,0.00049257703,0.0002817569,0.00028328938,0.00031413842],"domain_scores_gemma":[0.99924165,0.000157529,0.00018131375,0.00016585033,0.00017295608,0.00008070119],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006532324,0.00019418499,0.0001518297,0.00034094614,0.00043196205,0.0015160134,0.00024894776,0.00007111751,0.000004156078],"category_scores_gemma":[0.000043298398,0.00017196946,0.000055304303,0.0004507946,0.000031131134,0.0039657247,0.000084158135,0.0001358923,0.000013792309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001255837,0.000011243193,0.000013614359,0.00043110058,0.000013607837,0.0000010568781,0.0063382513,0.0083996635,0.0005308199,0.060054533,0.00024711853,0.92394644],"study_design_scores_gemma":[0.00029972478,0.00020179988,0.00043969738,0.00013726413,0.000010107232,0.00002883589,0.0001945325,0.961395,0.0006184045,0.03386777,0.002585929,0.00022088032],"about_ca_topic_score_codex":0.0000114675195,"about_ca_topic_score_gemma":5.5757346e-7,"teacher_disagreement_score":0.9529954,"about_ca_system_score_codex":0.000055671942,"about_ca_system_score_gemma":0.00018265602,"threshold_uncertainty_score":0.9995205},"labels":[],"label_agreement":null},{"id":"W4392490169","doi":"10.48550/arxiv.2403.00910","title":"Beyond-classical computation in quantum simulation","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Office of Science; Canada First Research Excellence Fund; Government of Canada; U.S. Department of Energy","keywords":"Quantum; White supremacy; Political science; Computer science; Physics; Quantum mechanics; Law; Politics","score_opus":0.04250917293376269,"score_gpt":0.21412014486970748,"score_spread":0.1716109719359448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392490169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37924096,0.00006951897,0.6182015,0.00034998293,0.0010200939,0.000169998,0.0000057443017,0.00034774243,0.0005944808],"genre_scores_gemma":[0.99635,0.000010903259,0.003171134,0.00007431025,0.00014730684,5.107823e-7,0.000017864455,0.000020756559,0.00020724998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978863,0.00016966555,0.00027084243,0.0012006595,0.00012904908,0.0003434559],"domain_scores_gemma":[0.99884003,0.00025612098,0.00014152423,0.0005683671,0.00007877479,0.0001151532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027272376,0.0003092629,0.0003157504,0.0005171043,0.00009309477,0.0002317376,0.0009582396,0.00028892152,0.000004413051],"category_scores_gemma":[0.000026536412,0.00034019625,0.00018383258,0.00093600806,0.00006767147,0.00013484864,0.002359442,0.0011622952,0.00010788617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006778667,0.000052299627,0.000099026685,0.00006826821,0.000019239364,0.00036450537,0.00029922382,0.90421695,0.0000060273346,0.087634765,0.00007640053,0.007156513],"study_design_scores_gemma":[0.00017592996,0.000031270447,0.00048633665,0.00012516599,0.000013692662,0.0000029759096,0.000009737816,0.7111937,0.0000055302457,0.2876032,0.00009297092,0.00025949086],"about_ca_topic_score_codex":0.00006528105,"about_ca_topic_score_gemma":0.000024013245,"teacher_disagreement_score":0.617109,"about_ca_system_score_codex":0.00020409643,"about_ca_system_score_gemma":0.00018720009,"threshold_uncertainty_score":0.999905},"labels":[],"label_agreement":null},{"id":"W4392524062","doi":"10.2139/ssrn.4750609","title":"Evaluation Framework for Quantum Security Risk Assessment: A Comprehensive Study for Quantum-Safe Migration","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Fredericton; University of New Brunswick; Université de Montréal","funders":"","keywords":"Quantum; Risk analysis (engineering); Business; Physics; Quantum mechanics","score_opus":0.022908130153461034,"score_gpt":0.34289170213258646,"score_spread":0.3199835719791254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392524062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24043615,0.005248512,0.74475,0.0021886684,0.003812351,0.003288044,0.00007575004,0.0001898226,0.000010670625],"genre_scores_gemma":[0.944297,0.0009532886,0.051837098,0.000087082495,0.0020732232,0.0005832868,0.000058778878,0.00008855186,0.000021676044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99228984,0.0011305627,0.0010613133,0.0014698639,0.0014999255,0.002548504],"domain_scores_gemma":[0.99479294,0.0011231857,0.0012081722,0.0010162207,0.0016947181,0.00016477914],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.009815081,0.0007141384,0.00080506824,0.00048965326,0.0010009885,0.0013487992,0.0018249507,0.0004713923,0.0000035578626],"category_scores_gemma":[0.0005927239,0.0006321974,0.0007805246,0.0004421462,0.0000513104,0.00020255228,0.0010241068,0.00924914,0.0000079896045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011999113,0.0007791451,0.00012303454,0.00027944453,0.0022311867,0.0000069567395,0.0058978726,0.052012,0.000024139285,0.78323025,0.00044145653,0.1548545],"study_design_scores_gemma":[0.00061858364,0.0012551575,0.00017074408,0.00018117219,0.0004006747,0.000055277662,0.00067226996,0.4942831,0.000004641395,0.5017671,0.00024935315,0.00034194664],"about_ca_topic_score_codex":0.0001608901,"about_ca_topic_score_gemma":0.0005250293,"teacher_disagreement_score":0.7038609,"about_ca_system_score_codex":0.001981712,"about_ca_system_score_gemma":0.008873259,"threshold_uncertainty_score":0.9996879},"labels":[],"label_agreement":null},{"id":"W4392546568","doi":"10.22331/q-2024-03-07-1275","title":"Here comes the SU(N): multivariate quantum gates and gradients","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada); Vector Institute; University of Waterloo","funders":"","keywords":"Multivariate statistics; Multivariate analysis; Quantum; Computer science; Physics; Mathematics; Quantum mechanics; Statistics","score_opus":0.012457309331348471,"score_gpt":0.2513456704026863,"score_spread":0.23888836107133782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392546568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87086535,0.008608117,0.09963594,0.015368444,0.003696543,0.00037004458,0.000015707199,0.001144231,0.00029565557],"genre_scores_gemma":[0.99672604,0.00007861551,0.0024783937,0.00031950328,0.0001954398,0.000010836598,0.0000026596683,0.000023656932,0.00016487528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982898,0.00013531002,0.00024808178,0.0005848858,0.00028327375,0.00045859662],"domain_scores_gemma":[0.9987602,0.00048382985,0.000051290215,0.0005469854,0.000036964055,0.000120701254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004437222,0.00024946677,0.00021042491,0.00011139139,0.00039039785,0.00088583597,0.00083823263,0.000066177214,0.0000061748983],"category_scores_gemma":[0.000045075198,0.00015030167,0.000099547666,0.00048222413,0.00014359556,0.00022679458,0.0004513042,0.00038519365,0.00008899291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075362204,0.00007422415,0.00076036697,0.0001281874,0.000104904255,0.00020354951,0.004879544,0.000401618,0.0005618495,0.89957315,0.0028745362,0.09043053],"study_design_scores_gemma":[0.00017098335,0.00009910728,0.0031271963,0.00012635537,0.000010417242,0.000117599506,0.00011956734,0.92799866,0.000109667766,0.051428106,0.016463518,0.00022879196],"about_ca_topic_score_codex":0.00015036925,"about_ca_topic_score_gemma":0.000004108953,"teacher_disagreement_score":0.92759705,"about_ca_system_score_codex":0.000018413943,"about_ca_system_score_gemma":0.00005023237,"threshold_uncertainty_score":0.85421365},"labels":[],"label_agreement":null},{"id":"W4392666005","doi":"10.5506/aphyspolbsupp.17.2-a14","title":"Quantum Algorithms in Particle Physics","year":2024,"lang":"en","type":"article","venue":"Acta Physica Polonica B Proceedings Supplement","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Physics; Quantum; Algorithm; Theoretical physics; Computer science; Statistical physics; Quantum mechanics","score_opus":0.014799253848627897,"score_gpt":0.2658429310236836,"score_spread":0.2510436771750557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392666005","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45023122,0.00069757336,0.0077549373,0.5358845,0.0015671077,0.0010078866,0.000045669563,0.0018735318,0.0009375502],"genre_scores_gemma":[0.987586,0.000030692405,0.011443288,0.00025151335,0.0005025292,0.000072525676,0.0000062350273,0.000034120876,0.00007306952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740255,0.00001957519,0.00039859148,0.00087066257,0.00047443673,0.0008341567],"domain_scores_gemma":[0.9992633,0.00010434666,0.00007612279,0.00034033784,0.00006351994,0.00015236273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033812804,0.00031354712,0.0002956394,0.00010125746,0.00014859764,0.0005868136,0.0010539361,0.000057554378,0.000026293768],"category_scores_gemma":[0.000018284334,0.00027833885,0.00014510051,0.00120278,0.000071545546,0.0006948805,0.00061837136,0.00044413455,0.000080169935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001531006,0.0006464334,0.00069499563,0.00028249502,0.00012696377,0.00009207829,0.008810093,0.00036354508,0.011407845,0.6943667,0.26736376,0.015829807],"study_design_scores_gemma":[0.00032378515,0.00022550182,0.0006499823,0.00015787449,0.000010820016,0.000019407376,0.000065949105,0.81790805,0.007027137,0.005449387,0.16778795,0.00037416196],"about_ca_topic_score_codex":0.00007207094,"about_ca_topic_score_gemma":0.0000035827954,"teacher_disagreement_score":0.8175445,"about_ca_system_score_codex":0.00012394403,"about_ca_system_score_gemma":0.00012341102,"threshold_uncertainty_score":0.99996686},"labels":[],"label_agreement":null},{"id":"W4392850233","doi":"10.1007/s12076-024-00374-y","title":"Quantum machine learning in spatial analysis: a paradigm shift in resource allocation and environmental modeling","year":2024,"lang":"en","type":"article","venue":"Letters in Spatial and Resource Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Paradigm shift; Resource allocation; Computer science; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.007892784647796925,"score_gpt":0.21405233270878785,"score_spread":0.20615954806099093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392850233","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79390305,0.001158331,0.19515091,0.009583959,0.000055131444,0.00008700801,0.0000013503986,0.000045335506,0.000014934972],"genre_scores_gemma":[0.9983124,0.0000360478,0.0010852059,0.00047622834,0.00006995048,0.0000054686325,0.0000054550696,0.000005954601,0.0000032548955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803793,0.00021658059,0.00031937627,0.0007345151,0.00033372242,0.00035785526],"domain_scores_gemma":[0.99960005,0.0001531142,0.00004842828,0.00013496882,9.5144475e-7,0.00006245768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009908417,0.00017162324,0.00022461404,0.0008093389,0.00018825606,0.0003415677,0.00036731342,0.000058083195,0.0000018728749],"category_scores_gemma":[0.000016251817,0.00013958111,0.000041721643,0.0010950909,0.00022602777,0.00018091219,0.00026254548,0.00045087034,8.049674e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010322484,0.000029997218,0.042292904,0.00002582248,0.000008652259,0.000090443704,0.008434078,0.88573045,0.00034483816,0.0006172467,0.0000023396835,0.06241292],"study_design_scores_gemma":[0.00018200996,0.000065033404,0.018598659,0.00010689248,0.000007892521,0.000011139347,0.0001414534,0.9794438,0.000011680377,0.001003595,0.00024370855,0.00018416982],"about_ca_topic_score_codex":0.0035303896,"about_ca_topic_score_gemma":0.0014685951,"teacher_disagreement_score":0.2044094,"about_ca_system_score_codex":0.00003470407,"about_ca_system_score_gemma":0.000019626446,"threshold_uncertainty_score":0.5691953},"labels":[],"label_agreement":null},{"id":"W4392912398","doi":"10.7554/elife.89947.2","title":"Improved clinical data imputation via classical and quantum determinantal point processes","year":2024,"lang":"en","type":"preprint","venue":"eLife","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Centre","funders":"","keywords":"Computer science; Imputation (statistics); Missing data; Data mining; Robustness (evolution); Qubit; Algorithm; Artificial intelligence; Machine learning; Quantum","score_opus":0.037103746390671544,"score_gpt":0.336818269573533,"score_spread":0.29971452318286146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392912398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23265696,0.004143048,0.75061655,0.005083554,0.0057472526,0.00061606616,0.0001368978,0.00094327197,0.000056378787],"genre_scores_gemma":[0.89203703,0.00027341658,0.10492451,0.00053610187,0.0019572268,0.00002176287,0.0001363812,0.000056717894,0.00005687289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632114,0.00016343576,0.000783964,0.0018826405,0.00043607978,0.00041271397],"domain_scores_gemma":[0.9972763,0.0004205832,0.00028770164,0.0016273102,0.00014350889,0.00024459467],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011105278,0.00041582962,0.0005415003,0.00013952708,0.00014395911,0.00079363957,0.0021747567,0.00037490382,0.0000017026122],"category_scores_gemma":[0.00043317335,0.00033766186,0.000116834955,0.0002454611,0.00016111346,0.0001804692,0.014702476,0.0016861149,0.000032906086],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003232863,0.0002828802,0.00029320235,0.001874285,0.00018127101,0.00034978258,0.0012228246,0.00038926053,0.00013339371,0.0018087827,0.005892815,0.9875392],"study_design_scores_gemma":[0.00019998856,0.00017610592,0.00073752267,0.0003220586,0.000041154522,0.00015543569,0.000008496951,0.98084664,0.00013237147,0.015527228,0.0014318317,0.00042116272],"about_ca_topic_score_codex":0.00003708475,"about_ca_topic_score_gemma":0.00002279414,"teacher_disagreement_score":0.987118,"about_ca_system_score_codex":0.00002685796,"about_ca_system_score_gemma":0.00070246577,"threshold_uncertainty_score":0.99990755},"labels":[],"label_agreement":null},{"id":"W4392968156","doi":"10.1007/978-3-031-54376-0_13","title":"A New Approach for Quantum Phase Estimation Based Algorithms for Machine Learning","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Quantum; Algorithm; Phase (matter); Estimation; Artificial intelligence; Machine learning; Physics; Engineering; Quantum mechanics; Systems engineering","score_opus":0.024042354056904126,"score_gpt":0.2694618714767019,"score_spread":0.24541951741979778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392968156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024279175,0.015415722,0.98040295,0.0002598059,0.001478124,0.001549711,0.00004063925,0.00024443175,0.0006062139],"genre_scores_gemma":[0.060948167,0.00017157148,0.9134683,0.00037282394,0.0062270286,0.0003986885,0.0012202438,0.00037959672,0.016813595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975933,0.000043561155,0.0005804686,0.0010499012,0.00024945807,0.00048330115],"domain_scores_gemma":[0.9980193,0.0010669241,0.00028329738,0.0004084839,0.00007368585,0.00014831252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072186766,0.0005652363,0.0007631804,0.00029778306,0.0002260442,0.00060444325,0.0004536986,0.00056441827,0.0000022333768],"category_scores_gemma":[0.00006265298,0.0004626022,0.00024438466,0.00014311925,0.00003406602,0.000066527224,0.000119747165,0.00088089565,0.0000013019195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024430135,0.00001242555,8.3843105e-7,0.00046163573,0.000042081378,0.0000070588662,0.00011678397,0.7429068,0.0000013422813,0.025529863,0.00019467704,0.23070207],"study_design_scores_gemma":[0.0011400194,0.00037201573,1.8976517e-7,0.0008178811,0.00005339962,0.000045021065,8.798909e-7,0.9495942,0.0000018135461,0.023136763,0.024339326,0.0004985155],"about_ca_topic_score_codex":0.00006348879,"about_ca_topic_score_gemma":0.000010356396,"teacher_disagreement_score":0.23020355,"about_ca_system_score_codex":0.00006305812,"about_ca_system_score_gemma":0.00010728453,"threshold_uncertainty_score":0.99978256},"labels":[],"label_agreement":null},{"id":"W4392971860","doi":"10.1103/physreva.110.012607","title":"Simulating quantum field theories on continuous-variable quantum computers","year":2024,"lang":"en","type":"preprint","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Particle Physics","funders":"","keywords":"Photon; Continuous variable; Variable (mathematics); Quantum; Physics; Field (mathematics); Quantum mechanics; Mathematics; Statistics; Mathematical analysis; Pure mathematics","score_opus":0.013258717455596838,"score_gpt":0.3372495589993133,"score_spread":0.3239908415437165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392971860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076269135,0.38676274,0.4626031,0.042401545,0.010161673,0.009054362,0.00024315216,0.004153853,0.008350426],"genre_scores_gemma":[0.8745714,0.06875245,0.012465918,0.03629541,0.006542447,0.0006964141,0.00014996895,0.00036741054,0.0001585906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99128234,0.0010574138,0.0015914593,0.0029801673,0.001687944,0.0014006842],"domain_scores_gemma":[0.9902792,0.004287687,0.0009923057,0.0033878498,0.0003662215,0.0006867361],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0013762456,0.0017181769,0.004256926,0.00016519398,0.00035381655,0.0006969701,0.003906686,0.00021459792,0.000023521448],"category_scores_gemma":[0.0023118954,0.0012850809,0.0022822195,0.0014801958,0.00021835255,0.00020366156,0.0061542373,0.0046095983,0.00077228365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014522897,0.0008470711,0.0000056596045,0.03722718,0.00031322168,0.00011513493,0.00034987324,0.0037002007,0.00039273337,0.82230246,0.015366204,0.119365714],"study_design_scores_gemma":[0.000116820396,0.0003761982,0.0000059984673,0.0676078,0.000281063,0.000010353171,0.000002018977,0.5038563,0.00027707827,0.41178903,0.014768679,0.000908662],"about_ca_topic_score_codex":0.00006433301,"about_ca_topic_score_gemma":7.7877837e-7,"teacher_disagreement_score":0.79830223,"about_ca_system_score_codex":0.00015088482,"about_ca_system_score_gemma":0.00048926787,"threshold_uncertainty_score":0.9995564},"labels":[],"label_agreement":null},{"id":"W4393191351","doi":"10.1103/physrevresearch.6.013326","title":"Efficient tensor network simulation of IBM's largest quantum processors","year":2024,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Compute Canada","funders":"Institute for Advanced Studies in Basic Sciences; Eusko Jaurlaritza; Egg Industry Center","keywords":"Qubit; Quantum computer; IBM; Quantum; Computer science; Superconducting quantum computing; Physics; Quantum mechanics; Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics; Optics","score_opus":0.052173123816327785,"score_gpt":0.41444421798358544,"score_spread":0.36227109416725767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393191351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31654012,0.27342358,0.39146808,0.011891568,0.0010138007,0.0027316448,0.000016062582,0.00093321124,0.001981938],"genre_scores_gemma":[0.9970731,0.0007984038,0.0014869577,0.00007927421,0.0004652957,0.00002624656,0.0000019578629,0.00001606022,0.0000527176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972623,0.0003510546,0.00028826043,0.000515091,0.0010401616,0.00054311834],"domain_scores_gemma":[0.99763906,0.0013625307,0.00004744685,0.0005118963,0.00031508942,0.00012399744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018527285,0.00014118322,0.0003371307,0.00010422369,0.00015382358,0.00012346517,0.00079167756,0.000027036249,0.000007638013],"category_scores_gemma":[0.00043521417,0.00009832571,0.00016548028,0.002391339,0.000106190106,0.00006344049,0.00042228278,0.0005777379,0.00013973014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004905035,0.00026346033,0.000020095447,0.0053467485,0.000029241522,0.000030657655,0.00035308214,0.70858645,0.00023486155,0.09982395,0.0018405288,0.183466],"study_design_scores_gemma":[0.000040649003,0.00012079321,0.00017079177,0.0034767636,0.000006780286,0.0000028017253,0.0000013345717,0.97366923,0.00006476678,0.0117504485,0.01059012,0.0001055439],"about_ca_topic_score_codex":0.000010708359,"about_ca_topic_score_gemma":3.3432661e-7,"teacher_disagreement_score":0.680533,"about_ca_system_score_codex":0.000030235047,"about_ca_system_score_gemma":0.00014695564,"threshold_uncertainty_score":0.40096062},"labels":[],"label_agreement":null},{"id":"W4393305093","doi":"10.1038/s41467-024-46959-5","title":"Enhancing combinatorial optimization with classical and quantum generative models","year":2024,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Quantum; Context (archaeology); Quantum computer; Optimization problem; Mathematical optimization; Quantum state; Theoretical computer science; Artificial intelligence; Algorithm; Mathematics","score_opus":0.013432230457997824,"score_gpt":0.26589338418668074,"score_spread":0.25246115372868294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393305093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016634477,0.0065094475,0.97919804,0.010899248,0.0005268972,0.00014318159,0.000004440676,0.00038043584,0.00067488407],"genre_scores_gemma":[0.6384001,0.00014072469,0.36116028,0.00015947486,0.000086222055,0.000012336501,0.000011942427,0.000010525179,0.00001843325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904627,0.00013126148,0.00015125723,0.00031992755,0.00018827562,0.00016300891],"domain_scores_gemma":[0.9984765,0.0003516221,0.00003785919,0.00095516717,0.00010605862,0.00007277697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019627555,0.00013633611,0.0001269759,0.000110224464,0.00039525572,0.00041323496,0.00091142085,0.00015083227,9.848598e-7],"category_scores_gemma":[0.0000272523,0.00010424546,0.00003169617,0.00051434035,0.00011383756,0.00036910744,0.0005266887,0.00095998676,0.0000021947724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002310957,0.00003533125,0.000004267401,0.000009224091,0.00002506479,0.0000040648615,0.0009475449,0.047174126,0.00012015169,0.94729954,0.00031091718,0.004067486],"study_design_scores_gemma":[0.00013031467,0.000062800405,0.000019385856,0.00007542769,0.000010146648,0.000035407404,0.000017583963,0.97642,0.00014427019,0.019713027,0.0032308402,0.00014078937],"about_ca_topic_score_codex":0.0000056165004,"about_ca_topic_score_gemma":0.000021256417,"teacher_disagreement_score":0.9292459,"about_ca_system_score_codex":0.00003129083,"about_ca_system_score_gemma":0.0001166734,"threshold_uncertainty_score":0.42510065},"labels":[],"label_agreement":null},{"id":"W4393549390","doi":"10.5281/zenodo.7658784","title":"Data for threshold plot in \"Finite-rate sparse quantum codes aplenty\"","year":2023,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Plot (graphics); Quantum; Computer science; Algorithm; Mathematics; Statistics; Physics; Quantum mechanics","score_opus":0.08089242219296122,"score_gpt":0.28512530035916234,"score_spread":0.20423287816620112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393549390","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089934765,0.000104010025,0.031279393,0.001105146,0.0006309671,0.00081552885,0.96456844,0.0012125612,0.00019401702],"genre_scores_gemma":[0.00017644592,0.00030804382,0.0013716735,0.0002732568,0.000398941,2.2740953e-7,0.9962151,0.0011027626,0.00015353746],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961228,0.00044690972,0.0005646366,0.0014736323,0.0005682522,0.00082378136],"domain_scores_gemma":[0.9958734,0.00028567054,0.00027959433,0.0030075188,0.00033123844,0.00022261131],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0023674504,0.00039027858,0.00044080234,0.00071324524,0.0015757205,0.002033799,0.009575597,0.00019913552,0.00024954698],"category_scores_gemma":[0.0015988725,0.00039547455,0.0000885542,0.001342625,0.00015314069,0.00036182895,0.010671614,0.0008548944,0.007834062],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026474527,0.0001357553,9.7725696e-8,0.0001982765,0.000041221367,0.00006787579,0.00012943914,0.0021998577,0.000016919008,0.0010733171,0.9868188,0.009291973],"study_design_scores_gemma":[0.00041067947,0.00019742097,0.000018688397,0.00013871116,0.000012551646,0.000028442588,0.000024405783,0.25470042,0.000004279171,0.0008701783,0.74326587,0.00032834167],"about_ca_topic_score_codex":0.00012041175,"about_ca_topic_score_gemma":0.000013287225,"teacher_disagreement_score":0.25250056,"about_ca_system_score_codex":0.000106843065,"about_ca_system_score_gemma":0.00002197337,"threshold_uncertainty_score":0.99984974},"labels":[],"label_agreement":null},{"id":"W4393563754","doi":"10.5281/zenodo.5211695","title":"Supplemental data for \"Large-scale quantum machine learning\"","year":2021,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scale (ratio); Computer science; Quantum; Artificial intelligence; Physics; Geography; Cartography; Quantum mechanics","score_opus":0.031125892195129522,"score_gpt":0.26558553900949344,"score_spread":0.23445964681436393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393563754","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001952854,0.00024438283,0.117886536,0.0009592244,0.00045021906,0.00047738914,0.87911326,0.00063538004,0.00021408642],"genre_scores_gemma":[0.00009132572,0.0001629122,0.0070095155,0.0002151273,0.0004885167,9.335322e-8,0.99097806,0.000799466,0.0002549559],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99612474,0.0005560495,0.00044872626,0.0014366815,0.0006552068,0.0007786105],"domain_scores_gemma":[0.9963182,0.00009153695,0.00027355424,0.002625288,0.00043763837,0.00025373735],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0014392592,0.00036469882,0.00038464362,0.00030004748,0.0034714832,0.0023265393,0.0077387695,0.00016357296,0.0044034645],"category_scores_gemma":[0.00071060855,0.00037457867,0.00012290337,0.000666661,0.00008177118,0.00031711638,0.014701778,0.00097564625,0.0015656544],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013412077,0.00019541338,1.1719796e-7,0.00015506412,0.00006118075,0.00003447831,0.00015271796,0.00011617986,0.00003978835,0.0003581291,0.98142934,0.01744416],"study_design_scores_gemma":[0.00054837734,0.0002783314,0.0000044080325,0.00005724481,0.00002442588,0.00017977113,0.00005150193,0.17405109,0.000014181275,0.00008228708,0.8243616,0.00034672418],"about_ca_topic_score_codex":0.000046215817,"about_ca_topic_score_gemma":0.000004422773,"teacher_disagreement_score":0.17393492,"about_ca_system_score_codex":0.00009946635,"about_ca_system_score_gemma":0.00002069986,"threshold_uncertainty_score":0.9998706},"labels":[],"label_agreement":null},{"id":"W4393690082","doi":"10.5281/zenodo.7658783","title":"Data for threshold plot in \"Finite-rate sparse quantum codes aplenty\"","year":2023,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Plot (graphics); Quantum; Mathematics; Statistical physics; Statistics; Algorithm; Computer science; Physics; Quantum mechanics","score_opus":0.08089242219296122,"score_gpt":0.28512530035916234,"score_spread":0.20423287816620112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393690082","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000089934765,0.000104010025,0.031279393,0.001105146,0.0006309671,0.00081552885,0.96456844,0.0012125612,0.00019401702],"genre_scores_gemma":[0.00017644592,0.00030804382,0.0013716735,0.0002732568,0.000398941,2.2740953e-7,0.9962151,0.0011027626,0.00015353746],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961228,0.00044690972,0.0005646366,0.0014736323,0.0005682522,0.00082378136],"domain_scores_gemma":[0.9958734,0.00028567054,0.00027959433,0.0030075188,0.00033123844,0.00022261131],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0023674504,0.00039027858,0.00044080234,0.00071324524,0.0015757205,0.002033799,0.009575597,0.00019913552,0.00024954698],"category_scores_gemma":[0.0015988725,0.00039547455,0.0000885542,0.001342625,0.00015314069,0.00036182895,0.010671614,0.0008548944,0.007834062],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026474527,0.0001357553,9.7725696e-8,0.0001982765,0.000041221367,0.00006787579,0.00012943914,0.0021998577,0.000016919008,0.0010733171,0.9868188,0.009291973],"study_design_scores_gemma":[0.00041067947,0.00019742097,0.000018688397,0.00013871116,0.000012551646,0.000028442588,0.000024405783,0.25470042,0.000004279171,0.0008701783,0.74326587,0.00032834167],"about_ca_topic_score_codex":0.00012041175,"about_ca_topic_score_gemma":0.000013287225,"teacher_disagreement_score":0.25250056,"about_ca_system_score_codex":0.000106843065,"about_ca_system_score_gemma":0.00002197337,"threshold_uncertainty_score":0.99984974},"labels":[],"label_agreement":null},{"id":"W4393698485","doi":"10.5281/zenodo.7025645","title":"Data for \"Qubit vitrification and entanglement criticality on a quantum processor\"","year":2022,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Quantum entanglement; Criticality; Qubit; Quantum; Vitrification; Physics; Computer science; Quantum mechanics; Nuclear physics","score_opus":0.05933163398451954,"score_gpt":0.2932268006384475,"score_spread":0.23389516665392798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393698485","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000427194,0.00010621472,0.042603876,0.002476976,0.00024203784,0.00089661643,0.95293456,0.000451979,0.00024499462],"genre_scores_gemma":[0.00034044703,0.0000981865,0.0015006424,0.00043516178,0.00019289494,4.4880875e-7,0.99699545,0.00039573148,0.000041066196],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99700946,0.0004066487,0.0003476773,0.0011940267,0.00061772414,0.00042447157],"domain_scores_gemma":[0.99721885,0.00012721572,0.00018811584,0.0019976478,0.0002900653,0.00017813088],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014655173,0.00024195477,0.00023673948,0.00026272118,0.002773419,0.0014182706,0.004610555,0.00008543673,0.0033917776],"category_scores_gemma":[0.0009634165,0.0002458878,0.0000450371,0.00046638018,0.00010749025,0.00021446137,0.0058767335,0.0005477785,0.00023955194],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029718245,0.0002057857,1.9008203e-8,0.00023216826,0.00002767122,0.000007881064,0.00010039804,0.00003564804,0.000022955537,0.0036695453,0.95212436,0.04354383],"study_design_scores_gemma":[0.0003616438,0.0005046618,0.000008883594,0.000041868636,0.000020994703,0.0000588923,0.00003303421,0.031290106,0.0000122801275,0.00082478515,0.96658236,0.00026050987],"about_ca_topic_score_codex":0.000017038943,"about_ca_topic_score_gemma":3.8047216e-7,"teacher_disagreement_score":0.044060834,"about_ca_system_score_codex":0.00011798249,"about_ca_system_score_gemma":0.0000137896395,"threshold_uncertainty_score":0.99999934},"labels":[],"label_agreement":null},{"id":"W4393716859","doi":"10.5281/zenodo.6514878","title":"Dynamical topological phase realized in a trapped-ion quantum simulator","year":2022,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantum simulator; Quantum; Ion; Topology (electrical circuits); Phase (matter); Physics; Computer science; Simulation; Statistical physics; Quantum computer; Quantum mechanics; Mathematics; Combinatorics","score_opus":0.027503533746833342,"score_gpt":0.28243762763250896,"score_spread":0.2549340938856756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393716859","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039849817,0.00017771452,0.032393508,0.001989142,0.0008842803,0.0011571471,0.9566128,0.0018646145,0.0009357677],"genre_scores_gemma":[0.007105114,0.000115598334,0.00052740035,0.0003105758,0.00022424337,1.8838514e-7,0.99099755,0.0006489426,0.00007036097],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958568,0.0011747319,0.00051996333,0.0010529127,0.00073721155,0.00065837556],"domain_scores_gemma":[0.99812436,0.00010777227,0.00021952577,0.0011508294,0.00015115173,0.00024636733],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011328676,0.0003330179,0.00042089692,0.00059680914,0.0017761263,0.00095021183,0.0040700175,0.00020451374,0.019855842],"category_scores_gemma":[0.0005830445,0.00032828754,0.0001366784,0.0011944164,0.0001636068,0.00016564666,0.004726819,0.0014106494,0.0007815111],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000745842,0.0005885422,5.1346575e-8,0.00005812135,0.00002276525,0.00024826766,0.00022719342,0.00144805,0.0000557753,0.0023195096,0.96401966,0.030937487],"study_design_scores_gemma":[0.0011435476,0.00066601596,0.000009368322,0.000031464915,0.000008112602,0.00018254873,0.000027713377,0.14103952,0.00000368291,0.00060182664,0.85596806,0.00031816884],"about_ca_topic_score_codex":0.00007873809,"about_ca_topic_score_gemma":9.343258e-7,"teacher_disagreement_score":0.13959147,"about_ca_system_score_codex":0.00026370163,"about_ca_system_score_gemma":0.000016120253,"threshold_uncertainty_score":0.9999965},"labels":[],"label_agreement":null},{"id":"W4393717264","doi":"10.5281/zenodo.10447635","title":"Cost Analysis Results of the Generation Circuits of the Entanglement Classes of Graph States with up to 7 Qubits","year":2023,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Qubit; Quantum entanglement; Graph; Electronic circuit; Quantum mechanics; Computer science; Theoretical computer science; Physics; Quantum","score_opus":0.038691707722123644,"score_gpt":0.25591888792919715,"score_spread":0.2172271802070735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393717264","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008936432,0.00003743879,0.022761047,0.0012513361,0.00042215217,0.0011443206,0.96512634,0.000161272,0.00015968423],"genre_scores_gemma":[0.110154144,0.00021926196,0.0011423817,0.0002770029,0.00025382187,4.1285105e-7,0.8866733,0.00083623454,0.0004434441],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975494,0.00049301726,0.00046829772,0.00044019026,0.00082276034,0.00022633292],"domain_scores_gemma":[0.99727786,0.00006297726,0.0005477396,0.0013230497,0.0007190641,0.000069321126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000741847,0.00016260037,0.000271401,0.00041481594,0.0006413887,0.00020644546,0.0029853256,0.00005261395,0.000058353828],"category_scores_gemma":[0.0003358556,0.00010193747,0.00012774087,0.0036312018,0.00015168707,0.00006239433,0.0024248539,0.0002376552,0.00007366508],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015297801,0.00006455587,0.0000023575888,0.00008526275,0.00024883024,0.0000014258546,0.0010103523,0.021527654,0.00042663084,0.00014831958,0.9677764,0.008692874],"study_design_scores_gemma":[0.00047416097,0.00040156482,0.0012287456,0.00020246221,0.00017132597,0.000010541939,0.00013689704,0.012891707,0.0030572617,0.00005059409,0.98116374,0.00021097907],"about_ca_topic_score_codex":0.00019859888,"about_ca_topic_score_gemma":0.000035541838,"teacher_disagreement_score":0.10121771,"about_ca_system_score_codex":0.000047972648,"about_ca_system_score_gemma":0.000018304287,"threshold_uncertainty_score":0.55475277},"labels":[],"label_agreement":null},{"id":"W4393752377","doi":"10.5281/zenodo.7025646","title":"Data for \"Qubit vitrification and entanglement criticality on a quantum processor\"","year":2022,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Quantum entanglement; Criticality; Qubit; Vitrification; Quantum; Computer science; Physics; Quantum mechanics; Nuclear physics","score_opus":0.05933163398451954,"score_gpt":0.2932268006384475,"score_spread":0.23389516665392798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393752377","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000427194,0.00010621472,0.042603876,0.002476976,0.00024203784,0.00089661643,0.95293456,0.000451979,0.00024499462],"genre_scores_gemma":[0.00034044703,0.0000981865,0.0015006424,0.00043516178,0.00019289494,4.4880875e-7,0.99699545,0.00039573148,0.000041066196],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99700946,0.0004066487,0.0003476773,0.0011940267,0.00061772414,0.00042447157],"domain_scores_gemma":[0.99721885,0.00012721572,0.00018811584,0.0019976478,0.0002900653,0.00017813088],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014655173,0.00024195477,0.00023673948,0.00026272118,0.002773419,0.0014182706,0.004610555,0.00008543673,0.0033917776],"category_scores_gemma":[0.0009634165,0.0002458878,0.0000450371,0.00046638018,0.00010749025,0.00021446137,0.0058767335,0.0005477785,0.00023955194],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029718245,0.0002057857,1.9008203e-8,0.00023216826,0.00002767122,0.000007881064,0.00010039804,0.00003564804,0.000022955537,0.0036695453,0.95212436,0.04354383],"study_design_scores_gemma":[0.0003616438,0.0005046618,0.000008883594,0.000041868636,0.000020994703,0.0000588923,0.00003303421,0.031290106,0.0000122801275,0.00082478515,0.96658236,0.00026050987],"about_ca_topic_score_codex":0.000017038943,"about_ca_topic_score_gemma":3.8047216e-7,"teacher_disagreement_score":0.044060834,"about_ca_system_score_codex":0.00011798249,"about_ca_system_score_gemma":0.0000137896395,"threshold_uncertainty_score":0.99999934},"labels":[],"label_agreement":null},{"id":"W4393764278","doi":"10.5281/zenodo.7120441","title":"Data for \"Qubit vitrification and entanglement criticality on a quantum processor\"","year":2022,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Quantum entanglement; Criticality; Qubit; Quantum; Vitrification; Physics; Computer science; Quantum mechanics; Nuclear physics","score_opus":0.05933163398451954,"score_gpt":0.2932268006384475,"score_spread":0.23389516665392798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393764278","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000427194,0.00010621472,0.042603876,0.002476976,0.00024203784,0.00089661643,0.95293456,0.000451979,0.00024499462],"genre_scores_gemma":[0.00034044703,0.0000981865,0.0015006424,0.00043516178,0.00019289494,4.4880875e-7,0.99699545,0.00039573148,0.000041066196],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99700946,0.0004066487,0.0003476773,0.0011940267,0.00061772414,0.00042447157],"domain_scores_gemma":[0.99721885,0.00012721572,0.00018811584,0.0019976478,0.0002900653,0.00017813088],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014655173,0.00024195477,0.00023673948,0.00026272118,0.002773419,0.0014182706,0.004610555,0.00008543673,0.0033917776],"category_scores_gemma":[0.0009634165,0.0002458878,0.0000450371,0.00046638018,0.00010749025,0.00021446137,0.0058767335,0.0005477785,0.00023955194],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029718245,0.0002057857,1.9008203e-8,0.00023216826,0.00002767122,0.000007881064,0.00010039804,0.00003564804,0.000022955537,0.0036695453,0.95212436,0.04354383],"study_design_scores_gemma":[0.0003616438,0.0005046618,0.000008883594,0.000041868636,0.000020994703,0.0000588923,0.00003303421,0.031290106,0.0000122801275,0.00082478515,0.96658236,0.00026050987],"about_ca_topic_score_codex":0.000017038943,"about_ca_topic_score_gemma":3.8047216e-7,"teacher_disagreement_score":0.044060834,"about_ca_system_score_codex":0.00011798249,"about_ca_system_score_gemma":0.0000137896395,"threshold_uncertainty_score":0.99999934},"labels":[],"label_agreement":null},{"id":"W4393769304","doi":"10.5281/zenodo.7996534","title":"Data and code example for the article: \"Massively parallel hybrid quantum-classical machine learning for kernelized time-series classification\"","year":2023,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Agnostiq (Canada)","funders":"","keywords":"Massively parallel; Computer science; Series (stratigraphy); Code (set theory); Parallel computing; Artificial intelligence; Machine learning; Theoretical computer science; Programming language; Biology; Paleontology","score_opus":0.06771278731211063,"score_gpt":0.27546396998901856,"score_spread":0.20775118267690795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393769304","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034310957,0.00017129144,0.3306042,0.004628667,0.00019097942,0.000965305,0.66262954,0.0007443042,0.000031398027],"genre_scores_gemma":[0.00017792705,0.00040795602,0.008172644,0.00016402078,0.0004310426,0.0000014172405,0.98903364,0.00081374415,0.00079759397],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971319,0.00039107213,0.00041970817,0.0010807872,0.00043135227,0.0005452209],"domain_scores_gemma":[0.9967384,0.00081740855,0.00030841108,0.0015547777,0.000403155,0.00017789964],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001590571,0.00029682906,0.0003224543,0.00017416189,0.0038995387,0.002095887,0.004385954,0.00010174129,0.0001536024],"category_scores_gemma":[0.0026599762,0.00024078705,0.00007857354,0.0004281162,0.00027256066,0.00029529075,0.004723901,0.00060437317,0.0013924732],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007085311,0.000052757874,1.12813794e-7,0.00009922213,0.000077729084,0.0000058398928,0.00010596002,0.0004516918,0.000080368736,0.0013229195,0.95719004,0.04054252],"study_design_scores_gemma":[0.0003837965,0.00016979224,0.000024178846,0.000024250588,0.000025886582,0.000051831128,0.000019589948,0.44629818,0.000004395892,0.0004004055,0.55243325,0.00016440096],"about_ca_topic_score_codex":0.000034414155,"about_ca_topic_score_gemma":0.0000035844942,"teacher_disagreement_score":0.4458465,"about_ca_system_score_codex":0.0000519789,"about_ca_system_score_gemma":0.000020471845,"threshold_uncertainty_score":0.99938506},"labels":[],"label_agreement":null},{"id":"W4393813467","doi":"10.5281/zenodo.10447636","title":"Cost Analysis Results of the Generation Circuits of the Entanglement Classes of Graph States with up to 7 Qubits","year":2023,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Qubit; Quantum entanglement; Graph; Electronic circuit; Computer science; Quantum mechanics; Theoretical computer science; Physics; Quantum","score_opus":0.038691707722123644,"score_gpt":0.25591888792919715,"score_spread":0.2172271802070735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393813467","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008936432,0.00003743879,0.022761047,0.0012513361,0.00042215217,0.0011443206,0.96512634,0.000161272,0.00015968423],"genre_scores_gemma":[0.110154144,0.00021926196,0.0011423817,0.0002770029,0.00025382187,4.1285105e-7,0.8866733,0.00083623454,0.0004434441],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975494,0.00049301726,0.00046829772,0.00044019026,0.00082276034,0.00022633292],"domain_scores_gemma":[0.99727786,0.00006297726,0.0005477396,0.0013230497,0.0007190641,0.000069321126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000741847,0.00016260037,0.000271401,0.00041481594,0.0006413887,0.00020644546,0.0029853256,0.00005261395,0.000058353828],"category_scores_gemma":[0.0003358556,0.00010193747,0.00012774087,0.0036312018,0.00015168707,0.00006239433,0.0024248539,0.0002376552,0.00007366508],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015297801,0.00006455587,0.0000023575888,0.00008526275,0.00024883024,0.0000014258546,0.0010103523,0.021527654,0.00042663084,0.00014831958,0.9677764,0.008692874],"study_design_scores_gemma":[0.00047416097,0.00040156482,0.0012287456,0.00020246221,0.00017132597,0.000010541939,0.00013689704,0.012891707,0.0030572617,0.00005059409,0.98116374,0.00021097907],"about_ca_topic_score_codex":0.00019859888,"about_ca_topic_score_gemma":0.000035541838,"teacher_disagreement_score":0.10121771,"about_ca_system_score_codex":0.000047972648,"about_ca_system_score_gemma":0.000018304287,"threshold_uncertainty_score":0.55475277},"labels":[],"label_agreement":null},{"id":"W4394167833","doi":"10.6084/m9.figshare.14268162","title":"Adiabatic Quantum Computation: From Adiabatic Theorem to D-Wave Computer","year":2021,"lang":"en","type":"dataset","venue":"Figshare","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Adiabatic process; Quantum computer; Adiabatic quantum computation; Computation; Physics; Adiabatic theorem; Quantum; Quantum mechanics; Computer science; Algorithm","score_opus":0.028151076648094988,"score_gpt":0.24980235738320686,"score_spread":0.22165128073511187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394167833","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001664102,0.0005124268,0.013786964,0.0004343673,0.0014512724,0.00050064386,0.98296964,0.00030180192,0.000026258394],"genre_scores_gemma":[0.000045831566,0.000003819135,0.027746422,0.0029475251,0.0017553649,0.00010846641,0.9673213,0.000048251048,0.000023064109],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99582624,0.0003293228,0.000673211,0.001589305,0.00081779127,0.00076414295],"domain_scores_gemma":[0.9956976,0.0012255575,0.00038837135,0.0018777639,0.00030494586,0.00050571654],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012261327,0.00076703064,0.000882995,0.0003391033,0.0002952049,0.0011174885,0.0023308026,0.0003944815,0.017190978],"category_scores_gemma":[0.0004731625,0.0007322436,0.00033166687,0.00095741585,0.000016340338,0.00018118662,0.002275366,0.00097383745,0.0067600557],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016892872,0.00006525048,9.833836e-8,0.00020407636,0.00008318958,0.00050532905,0.00016314824,0.0049006315,8.1176375e-7,0.000020387894,0.97649866,0.017556697],"study_design_scores_gemma":[0.00017913782,0.00011272772,0.00006194879,0.0034033996,0.000020339567,0.00004890393,0.000004207436,0.36165023,0.000010818978,0.000559889,0.63327324,0.0006751721],"about_ca_topic_score_codex":0.000070471564,"about_ca_topic_score_gemma":0.00002532212,"teacher_disagreement_score":0.3567496,"about_ca_system_score_codex":0.00010181495,"about_ca_system_score_gemma":0.0004540273,"threshold_uncertainty_score":0.9999195},"labels":[],"label_agreement":null},{"id":"W4394656853","doi":"10.48550/arxiv.quant-ph/0405002","title":"Connections between relative entropy of entanglement and geometric measure of entanglement","year":2004,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum entanglement; Multipartite entanglement; Squashed entanglement; Kullback–Leibler divergence; W state; Bipartite graph; Multipartite; Upper and lower bounds; Entropy (arrow of time); Mathematics; Entanglement distillation; Entanglement witness; Quantum discord; Measure (data warehouse); Quantum mechanics; Statistical physics; Physics; Combinatorics; Quantum; Statistics; Mathematical analysis; Computer science","score_opus":0.034058316200889116,"score_gpt":0.26205767191244955,"score_spread":0.22799935571156044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394656853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77751297,0.0010894415,0.21936752,0.00078137434,0.0005119945,0.00045562652,0.00007808487,0.00007654685,0.00012641957],"genre_scores_gemma":[0.98297226,0.00009360507,0.016642075,0.00003811319,0.00016224757,0.000018923054,0.000025531956,0.00001925883,0.000027997829],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99734414,0.00015539206,0.0007698307,0.0007645346,0.0006034067,0.00036270943],"domain_scores_gemma":[0.9977553,0.0002661928,0.00076956,0.0008243946,0.00023979197,0.00014474704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005260579,0.00036045077,0.00066172244,0.0005609069,0.00013652834,0.000040466795,0.0008427888,0.00019177127,0.00001707573],"category_scores_gemma":[0.00011259123,0.00033176065,0.00023067003,0.00076691236,0.0001426644,0.00010067019,0.0017650938,0.0006502081,0.000005327024],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022556593,0.0007010466,0.9027064,0.000771668,0.0015865947,0.000037224272,0.0066292384,0.015035951,0.0014547037,0.029692141,0.00015032495,0.041212145],"study_design_scores_gemma":[0.0030239343,0.001429908,0.91960186,0.0019162777,0.00047272365,0.00002883023,0.00024657944,0.011070248,0.032935876,0.026373772,0.0015551838,0.001344799],"about_ca_topic_score_codex":0.00026149224,"about_ca_topic_score_gemma":0.000009419682,"teacher_disagreement_score":0.20545925,"about_ca_system_score_codex":0.00016893301,"about_ca_system_score_gemma":0.00022482191,"threshold_uncertainty_score":0.99991345},"labels":[],"label_agreement":null},{"id":"W4394710090","doi":"10.1088/2058-9565/ad3d7f","title":"Efficient quantum algorithm for all quantum wavelet transforms","year":2024,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Defense Advanced Research Projects Agency","keywords":"Quantum; Quantum algorithm; Wavelet; Algorithm; Quantum Fourier transform; Computer science; Quantum error correction; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.00957090269982635,"score_gpt":0.255904255365631,"score_spread":0.24633335266580464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394710090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20624149,0.0020696702,0.7731114,0.014189795,0.0019581586,0.00058702443,0.000027174186,0.0017325775,0.00008271924],"genre_scores_gemma":[0.9190535,0.000103540566,0.0800741,0.00041358708,0.00016119792,0.00010109917,0.0000040069094,0.000039385748,0.00004957558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957527,0.00002690684,0.00049621786,0.0016201638,0.0007465414,0.0013574518],"domain_scores_gemma":[0.9982731,0.00023638866,0.00008591361,0.00083580066,0.00031211105,0.00025673953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017647452,0.0004158135,0.00043088105,0.00154936,0.00078890566,0.00068935077,0.0021419928,0.00026046572,0.0000039801525],"category_scores_gemma":[0.000142761,0.00031886276,0.00012677493,0.0040107984,0.0014351367,0.00032665106,0.00051367795,0.000556267,0.000038767863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022042063,0.000057147037,0.000002464415,0.00004719062,0.00001774193,0.000051774743,0.0005667132,0.00010039598,0.004723677,0.55889654,0.0002414321,0.4352927],"study_design_scores_gemma":[0.00028431727,0.00056774245,0.000021376134,0.00008869279,0.0000143386915,0.00036295253,0.00014796684,0.86211795,0.003645726,0.11360404,0.018728739,0.0004161518],"about_ca_topic_score_codex":0.000022389198,"about_ca_topic_score_gemma":0.0000025656373,"teacher_disagreement_score":0.8620176,"about_ca_system_score_codex":0.00009906335,"about_ca_system_score_gemma":0.00055998494,"threshold_uncertainty_score":0.9999263},"labels":[],"label_agreement":null},{"id":"W4394748729","doi":"10.1103/prxquantum.5.020310","title":"Lifting Topological Codes: Three-Dimensional Subsystem Codes from Two-Dimensional Anyon Models","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Industry Canada; Vlaamse regering; Fonds De La Recherche Scientifique - FNRS; Fonds Wetenschappelijk Onderzoek; Government of Canada","keywords":"Toric code; Computer science; Anyon; Class (philosophy); Code (set theory); Abelian group; Topology (electrical circuits); Theoretical computer science; Quantum; Physics; Mathematics; Quantum computer; Pure mathematics; Artificial intelligence; Topological quantum computer; Quantum mechanics; Set (abstract data type)","score_opus":0.02640070190836456,"score_gpt":0.26240367492491995,"score_spread":0.2360029730165554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394748729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7192858,0.004630513,0.2698369,0.002190998,0.002288754,0.00023003368,0.0000606016,0.0012699746,0.00020641605],"genre_scores_gemma":[0.947019,0.0000045130196,0.051683836,0.00043215704,0.00072194,0.000013247449,0.000032323605,0.00003408369,0.00005891511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651235,0.00021587416,0.0005683038,0.0012068569,0.00079663383,0.0006999865],"domain_scores_gemma":[0.9977882,0.0010847691,0.000112949216,0.0006546052,0.00011494176,0.00024454546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007263161,0.00041735914,0.00048635597,0.00017645357,0.00041404186,0.00052245194,0.0009962084,0.00016839555,0.000050488532],"category_scores_gemma":[0.000056742247,0.00031881136,0.00024138537,0.0005166559,0.00013482246,0.00040157168,0.0007882178,0.00065163994,0.0001966978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047312613,0.00018642038,0.00044686082,0.00012430202,0.0002285967,0.0009840899,0.0013275967,0.519809,0.0035295906,0.44121358,0.0023457536,0.029756896],"study_design_scores_gemma":[0.00023989756,0.00010819191,0.00026533703,0.00034817393,0.00001587275,0.000126656,0.000010193603,0.85528564,0.0003360971,0.14243554,0.00045359324,0.00037481415],"about_ca_topic_score_codex":0.00045376926,"about_ca_topic_score_gemma":0.00005448179,"teacher_disagreement_score":0.33547664,"about_ca_system_score_codex":0.00006863857,"about_ca_system_score_gemma":0.00019479317,"threshold_uncertainty_score":0.9999264},"labels":[],"label_agreement":null},{"id":"W4394800807","doi":"10.1088/2058-9565/ad3eab","title":"Information flow in parameterized quantum circuits","year":2024,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Toronto","funders":"Canada Research Chairs; Government of Ontario; University of Toronto; Google","keywords":"Parameterized complexity; Metric (unit); Convergence (economics); Computer science; Representation (politics); Quantum; Electronic circuit; Mutual information; Theoretical computer science; Flow (mathematics); Algorithm; Quantum computer; Quantum circuit; Measure (data warehouse); Quantum algorithm; Binary number; Mathematical optimization; Mathematics; Quantum error correction; Artificial intelligence; Data mining; Quantum mechanics","score_opus":0.007684175269745336,"score_gpt":0.2347006125988686,"score_spread":0.22701643732912327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394800807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.814329,0.0006971535,0.1736788,0.008675228,0.001105211,0.00020829935,0.0000029337427,0.0010768552,0.00022649847],"genre_scores_gemma":[0.9918923,0.00004822918,0.007819478,0.00019258943,0.00002020243,0.00001633312,8.7118804e-7,0.0000047567128,0.0000052663418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832624,0.000022240572,0.0002986465,0.00043853428,0.0003846229,0.00052970764],"domain_scores_gemma":[0.9992339,0.00008588293,0.000047001173,0.00044517318,0.000108073684,0.00007996876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009777305,0.000157795,0.00018871026,0.0017886906,0.00022314985,0.0005952978,0.0010844868,0.00012307426,0.0000024453557],"category_scores_gemma":[0.00025006282,0.00013049853,0.0000245681,0.005184623,0.0005949514,0.0014418141,0.00046142086,0.0003710544,0.000058272883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.7954894e-7,0.000013290679,0.000082356564,0.000025906702,0.0000024993699,0.000033597495,0.000709832,0.00007757535,0.0027585565,0.40008178,0.00005563212,0.5961582],"study_design_scores_gemma":[0.000138985,0.000120975,0.00040811862,0.00007229788,0.0000014126517,0.00015598665,0.000081027174,0.90653974,0.0010677504,0.08496655,0.0062782955,0.00016886301],"about_ca_topic_score_codex":0.000022152095,"about_ca_topic_score_gemma":0.0000029015914,"teacher_disagreement_score":0.90646213,"about_ca_system_score_codex":0.000054502125,"about_ca_system_score_gemma":0.00032259425,"threshold_uncertainty_score":0.574047},"labels":[],"label_agreement":null},{"id":"W4394861184","doi":"10.1109/isit57864.2024.10619118","title":"Fully Quantum Arbitrarily Varying Channel Coding for Entanglement-Assisted Communication","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canada First Research Excellence Fund","keywords":"Communication source; Quantum entanglement; Quantum channel; Amplitude damping channel; Classical capacity; Quantum capacity; Channel (broadcasting); Computer science; Quantum information science; Quantum; Coding (social sciences); Channel capacity; Topology (electrical circuits); Superdense coding; Theoretical computer science; Physics; Mathematics; Quantum mechanics; Quantum network; Computer network; Combinatorics","score_opus":0.033476776592262496,"score_gpt":0.28330128545970784,"score_spread":0.24982450886744534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394861184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043572104,0.0016600492,0.97803026,0.0075077307,0.0029997088,0.0010013053,0.000053512205,0.00136198,0.0030282275],"genre_scores_gemma":[0.6790306,0.00008078413,0.31879395,0.0008173744,0.00041967526,0.00023960914,0.00015693741,0.000066072775,0.00039502193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972905,0.000120882556,0.0006124874,0.0010540332,0.00037486973,0.00054725085],"domain_scores_gemma":[0.99744785,0.00035303898,0.00028260358,0.0016266289,0.00015812214,0.00013173686],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007599085,0.00045570915,0.00045500783,0.00032339286,0.00040862485,0.0011123444,0.0025425751,0.0002595368,0.0000087370745],"category_scores_gemma":[0.00004152837,0.0004132519,0.00036648518,0.00032341995,0.000048114343,0.00009803183,0.005772352,0.0011401282,0.000026967531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038506776,0.0003572689,0.000008021974,0.002570817,0.00066073966,0.0000511174,0.006356458,0.026252916,0.0012954716,0.7596904,0.015835956,0.18688232],"study_design_scores_gemma":[0.0002470232,0.000058465797,0.000030185369,0.00062486593,0.000035795143,0.000021461949,0.000030903157,0.8148179,0.0004015761,0.18164174,0.0016680509,0.0004220399],"about_ca_topic_score_codex":0.00014053403,"about_ca_topic_score_gemma":0.000015444626,"teacher_disagreement_score":0.788565,"about_ca_system_score_codex":0.00013012935,"about_ca_system_score_gemma":0.00024166123,"threshold_uncertainty_score":0.9999246},"labels":[],"label_agreement":null},{"id":"W4394875044","doi":"10.1103/physreve.109.044141","title":"Protecting information via probabilistic cellular automata","year":2024,"lang":"en","type":"article","venue":"Physical review. E","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum cellular automaton; Cellular automaton; Probabilistic logic; Ising model; Universality (dynamical systems); Stochastic cellular automaton; Computer science; Theoretical computer science; Quantum; Probabilistic automaton; Continuous spatial automaton; Statistical physics; Toric code; Algorithm; Automaton; Quantum finite automata; Quantum computer; Physics; Artificial intelligence; Quantum mechanics; Automata theory","score_opus":0.008368153213740093,"score_gpt":0.2736734103809654,"score_spread":0.2653052571672253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394875044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012115329,0.0038610129,0.9780027,0.0030170623,0.0004179848,0.00067956466,0.0000018392524,0.0010230922,0.0008813636],"genre_scores_gemma":[0.98086953,0.00014750408,0.017705413,0.0006997681,0.00044893025,0.000086229484,0.000007934899,0.000014033626,0.000020681291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894655,0.000083096405,0.00022803755,0.00024938697,0.00027496615,0.00021795704],"domain_scores_gemma":[0.9992927,0.00014115451,0.0000554806,0.0004003207,0.000041792464,0.000068560636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038357038,0.00013772275,0.0001932258,0.000044102264,0.00011084879,0.00024048751,0.00048036076,0.00001688878,0.0000031957245],"category_scores_gemma":[0.00017185848,0.000100428966,0.00012029933,0.000556812,0.000020984471,0.0005164529,0.0002279694,0.00032350916,0.00042782119],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.706165e-7,0.000035017227,5.9837856e-7,0.0028036227,0.000010377509,0.00000938419,0.00044944434,0.00062575185,0.000645053,0.030310702,0.0005422021,0.9645675],"study_design_scores_gemma":[0.000029959252,0.00004721482,0.000015167849,0.0013091891,0.000010000488,0.000015127632,6.438049e-7,0.93875694,0.00055818504,0.034462966,0.02466247,0.00013211466],"about_ca_topic_score_codex":0.0000059424115,"about_ca_topic_score_gemma":1.0636368e-7,"teacher_disagreement_score":0.9687542,"about_ca_system_score_codex":0.000026587217,"about_ca_system_score_gemma":0.0000486359,"threshold_uncertainty_score":0.5498919},"labels":[],"label_agreement":null},{"id":"W4394880843","doi":"10.53759/181x/jcns202404006","title":"Advancements and Applications of Quantum Computing in Robotics","year":2024,"lang":"en","type":"article","venue":"Journal of Computing and Natural Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Quantum computer; Qubit; Robotics; Computer science; Superposition principle; Artificial intelligence; Field (mathematics); Quantum machine learning; Unconventional computing; Process (computing); Quantum superposition; Quantum algorithm; Computer engineering; Quantum; Theoretical computer science; Computational science; Distributed computing; Robot; Mathematics; Quantum mechanics; Physics","score_opus":0.006353094542474628,"score_gpt":0.2804710124675914,"score_spread":0.27411791792511675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394880843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4736599,0.004760526,0.52056366,0.00038585893,0.00052162353,0.00005948466,2.6583183e-7,0.000022018843,0.000026658605],"genre_scores_gemma":[0.9234448,0.000067734465,0.07633405,0.000037969497,0.0001086449,8.134926e-8,6.2663254e-8,0.0000031542047,0.0000035006879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863946,0.00003572797,0.0004410284,0.0002554798,0.00038521175,0.00024306611],"domain_scores_gemma":[0.99912286,0.00030193425,0.00021634188,0.00012203284,0.00014312018,0.000093731214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013482713,0.00010439816,0.0002124849,0.00042744962,0.00016985596,0.00021120535,0.00056006643,0.00002508983,1.4832726e-7],"category_scores_gemma":[0.0000631676,0.00007816508,0.000037765414,0.0013067134,0.00024269486,0.0003486909,0.00036551812,0.00037950827,2.4246302e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044793605,0.000045225013,0.0021007967,0.0001321329,0.000012213615,0.00003504918,0.0017434611,0.04901423,0.0030825476,0.05705371,0.000013082066,0.8867631],"study_design_scores_gemma":[0.00015001281,0.00009490308,0.012395415,0.0004141251,0.000003705655,0.00030155285,0.00004497651,0.9823534,0.0002409363,0.003727721,0.00018141238,0.00009182734],"about_ca_topic_score_codex":0.000007893701,"about_ca_topic_score_gemma":5.7093496e-7,"teacher_disagreement_score":0.9333392,"about_ca_system_score_codex":0.000028710347,"about_ca_system_score_gemma":0.00015557701,"threshold_uncertainty_score":0.31874794},"labels":[],"label_agreement":null},{"id":"W4394998539","doi":"10.1145/3620665.3640363","title":"Red-QAOA: Efficient Variational Optimization through Circuit Reduction","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Lawrence Berkeley National Laboratory; Office of Science; National Energy Research Scientific Computing Center; U.S. Department of Energy","keywords":"Reduction (mathematics); Computer science; Mathematical optimization; Mathematics; Geometry","score_opus":0.017058049049257947,"score_gpt":0.24541327946206723,"score_spread":0.22835523041280928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394998539","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007477743,0.00035092715,0.97692454,0.004147368,0.0073083835,0.00031598107,0.000010337166,0.0010816936,0.009113025],"genre_scores_gemma":[0.13022786,0.000036740294,0.8669912,0.00018989042,0.0015282547,0.000041558018,0.00008982706,0.00004208156,0.00085259014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974243,0.000094377465,0.00042858568,0.0011653274,0.0005736747,0.00031375623],"domain_scores_gemma":[0.99867976,0.000052154348,0.00018141599,0.00084853446,0.00016727696,0.00007089049],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003634151,0.00032872346,0.00026182472,0.0002001474,0.0001925833,0.00069481443,0.0009407736,0.0002791949,0.000056809844],"category_scores_gemma":[0.000031049058,0.00029228895,0.0001915615,0.0005064314,0.000039128354,0.0000718258,0.0024852988,0.0009216869,0.00008799023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.360091e-7,0.000044469292,2.3095252e-7,0.000064462365,0.00003747921,0.0000073000797,0.00080209976,0.8711236,0.000018529943,0.121090814,0.0020663764,0.0047437013],"study_design_scores_gemma":[0.00007613841,0.000021846901,0.000015141021,0.00013586358,0.000017775536,0.000065455904,0.000006418633,0.8578819,0.000082747356,0.14072381,0.0006799265,0.0002929495],"about_ca_topic_score_codex":0.000052694602,"about_ca_topic_score_gemma":4.124855e-7,"teacher_disagreement_score":0.12948008,"about_ca_system_score_codex":0.00014938194,"about_ca_system_score_gemma":0.000343949,"threshold_uncertainty_score":0.9999529},"labels":[],"label_agreement":null},{"id":"W4395057230","doi":"10.1109/icapc61546.2023.00005","title":"Preface ICAPC 2023","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.012976114312377558,"score_gpt":0.2428540326038259,"score_spread":0.22987791829144835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395057230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16113162,0.00006480492,0.78685564,0.011717636,0.0013126532,0.00016010502,0.0000020189718,0.004059556,0.034695946],"genre_scores_gemma":[0.7708287,0.000022719656,0.1832268,0.0011646416,0.00042112477,0.000014809789,0.0000054418097,0.00002441037,0.04429134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992026,0.000021950224,0.000089536945,0.00026370125,0.00016735503,0.00025487668],"domain_scores_gemma":[0.9994405,0.00007231784,0.000018210912,0.00038456608,0.000018065026,0.00006634632],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017153854,0.0000738801,0.00007160563,0.0000844661,0.00010021324,0.00009646837,0.00063899055,0.000026149211,0.000028499693],"category_scores_gemma":[0.00001911163,0.00005680794,0.000041124076,0.00081392884,0.0000146749835,0.000082311555,0.00038940524,0.00009140449,0.0017223915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018797699,0.000053277203,0.00028525945,0.000023790926,0.000030015328,0.00012956587,0.0012405033,0.02561128,0.0024133832,0.16911592,0.18925697,0.61183816],"study_design_scores_gemma":[0.000078084355,0.000027729766,0.0030021584,0.0000057583024,5.520951e-7,0.000009381259,0.00000797283,0.95505726,0.0006448734,0.0075062215,0.03355137,0.00010864998],"about_ca_topic_score_codex":0.000014707606,"about_ca_topic_score_gemma":0.0000020318623,"teacher_disagreement_score":0.929446,"about_ca_system_score_codex":0.0000051516627,"about_ca_system_score_gemma":0.000020451726,"threshold_uncertainty_score":0.9990549},"labels":[],"label_agreement":null},{"id":"W4395090861","doi":"10.1117/12.3012606","title":"Scalable fault tolerance: quantum technologies with silicon colour centres","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Photon Etc (Canada)","funders":"","keywords":"Scalability; Fault tolerance; Computer science; Quantum; Quantum computer; Silicon; Distributed computing; Optoelectronics; Materials science; Database; Physics; Quantum mechanics","score_opus":0.006674325628700066,"score_gpt":0.22284527865465453,"score_spread":0.21617095302595446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395090861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47486326,0.003506333,0.48900622,0.017176624,0.0011136265,0.00033351022,0.0000052553673,0.009593386,0.0044017853],"genre_scores_gemma":[0.9608627,0.000034519708,0.037807137,0.00017472319,0.00006153264,0.000011032321,9.917858e-7,0.0000143780235,0.001033008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985771,0.000023248589,0.00015735574,0.00055962475,0.00026285657,0.0004197942],"domain_scores_gemma":[0.9992818,0.00011203374,0.00002658122,0.00048238543,0.00004603153,0.00005114765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012261086,0.00019182541,0.00017520154,0.00014384507,0.00015690124,0.0005445592,0.0008033203,0.00008100393,0.00001534113],"category_scores_gemma":[0.000016570846,0.000120180215,0.000052807558,0.0007824467,0.00009404009,0.0002397971,0.00029092812,0.00028840918,0.000098201825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016311425,0.00012764447,0.0005438479,0.00018650759,0.000082759725,0.00048500946,0.0010781338,0.03216338,0.002217285,0.43638867,0.017308481,0.509402],"study_design_scores_gemma":[0.00012828081,0.0001713277,0.00018497207,0.00014350117,0.000003890509,0.00009560933,0.00010891791,0.9599597,0.0059147677,0.0068013547,0.026260607,0.00022708211],"about_ca_topic_score_codex":0.000048186685,"about_ca_topic_score_gemma":0.000013950118,"teacher_disagreement_score":0.9277963,"about_ca_system_score_codex":0.000024212852,"about_ca_system_score_gemma":0.000086040214,"threshold_uncertainty_score":0.5251197},"labels":[],"label_agreement":null},{"id":"W4395444117","doi":"10.48550/arxiv.2404.14491","title":"Conditional disclosure of secrets with quantum resources","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Industry Canada; Government of Canada","keywords":"Quantum; Business; Computer science; Computer security; Internet privacy; Physics; Quantum mechanics","score_opus":0.026126184084419017,"score_gpt":0.1730401271376422,"score_spread":0.14691394305322317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395444117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7584852,0.0001703646,0.23925339,0.00027694655,0.00034608832,0.00014350255,0.000068284025,0.00024930495,0.0010068931],"genre_scores_gemma":[0.9970212,0.00001571309,0.0022084666,0.000037127476,0.00011725405,4.875896e-7,0.000024348685,0.00002023173,0.0005551474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825597,0.000101955506,0.00019272092,0.0009937603,0.00017297309,0.0002826332],"domain_scores_gemma":[0.99854934,0.00012307795,0.00022863947,0.00084461644,0.00012691879,0.00012740269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017224885,0.00031146323,0.0003529166,0.00027964351,0.00011281829,0.00011487086,0.0014216399,0.00018835807,0.000018022245],"category_scores_gemma":[0.000009875126,0.00026926753,0.00019902484,0.00058470044,0.00022234063,0.00008321851,0.0023092781,0.0008345776,0.000028336517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027110073,0.00007074242,0.0006205209,0.0002975403,0.00019664306,0.00069971645,0.0007748454,0.63011265,0.000026316882,0.3664373,0.00035228662,0.00038436442],"study_design_scores_gemma":[0.00019911499,0.000118814416,0.0011832949,0.00035546423,0.000054032287,0.000022255237,0.000043064054,0.7941549,0.00006607435,0.203049,0.00044525095,0.00030872508],"about_ca_topic_score_codex":0.00007558545,"about_ca_topic_score_gemma":0.000014434033,"teacher_disagreement_score":0.238536,"about_ca_system_score_codex":0.00004836234,"about_ca_system_score_gemma":0.00022403493,"threshold_uncertainty_score":0.999976},"labels":[],"label_agreement":null},{"id":"W4396545135","doi":"10.1103/physrevlett.132.180805","title":"Tight Bounds on Pauli Channel Learning without Entanglement","year":2024,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"NTT Research; Air Force Office of Scientific Research; Government of Canada; David and Lucile Packard Foundation; Ministry of Colleges and Universities; Multidisciplinary University Research Initiative; Army Research Office; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; Office of Science; U.S. Department of Energy; California Institute of Technology; Massachusetts Institute of Technology; National Science Foundation","keywords":"Quantum entanglement; Pauli exclusion principle; Upper and lower bounds; Physics; Quantum mechanics; Qubit; Topology (electrical circuits); Squashed entanglement; Channel (broadcasting); Eigenvalues and eigenvectors; Computer science; Statistical physics; Quantum; Mathematics; Combinatorics; Telecommunications; Mathematical analysis","score_opus":0.01238530267485451,"score_gpt":0.282883719110549,"score_spread":0.2704984164356945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396545135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21584259,0.04356575,0.47978896,0.25128773,0.003399627,0.0012795614,0.000006643166,0.0026452334,0.0021839128],"genre_scores_gemma":[0.9636741,0.0010827917,0.0020735813,0.032081142,0.0009357004,0.000039934446,0.000006099179,0.000029939813,0.00007670666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984712,0.00011872571,0.00017736727,0.0005094087,0.0003898127,0.00033346904],"domain_scores_gemma":[0.99937373,0.00013284397,0.000045451066,0.000337063,0.000010487926,0.00010040034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023602282,0.00020810036,0.00027569587,0.000053967924,0.00012737406,0.0002155564,0.00049086777,0.000007429149,0.000009737818],"category_scores_gemma":[0.00001752826,0.00014912787,0.00020202079,0.000332321,0.000034052628,0.000115264644,0.00017643848,0.00043956426,0.0003981799],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074820045,0.00042663948,0.00005798653,0.0047747083,0.00027485602,0.0005678276,0.0040473663,0.018641498,0.008519257,0.043410946,0.053312715,0.8659587],"study_design_scores_gemma":[0.00008831144,0.00017056473,0.00008799258,0.003621657,0.000026214384,0.000018685345,0.0000019226866,0.791908,0.0002461784,0.0009396435,0.20257509,0.0003157114],"about_ca_topic_score_codex":0.0000031562747,"about_ca_topic_score_gemma":1.260529e-7,"teacher_disagreement_score":0.865643,"about_ca_system_score_codex":0.000044694156,"about_ca_system_score_gemma":0.000020009125,"threshold_uncertainty_score":0.6081258},"labels":[],"label_agreement":null},{"id":"W4396545989","doi":"10.1103/physreva.109.052601","title":"Implementation of a quantum division circuit on noisy intermediate-scale quantum devices using dynamic circuits and approximate computing","year":2024,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum computer; Quantum circuit; Computer science; Quantum error correction; Qubit; Quantum algorithm; Quantum network; Quantum information; Quantum gate; Quantum technology; Quantum; Theoretical computer science; Open quantum system; Physics; Quantum mechanics","score_opus":0.0188569837926791,"score_gpt":0.3675057180550402,"score_spread":0.3486487342623611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396545989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7109882,0.043258492,0.24365662,0.0005515583,0.0003071607,0.00095726486,0.0000233301,0.00021995536,0.000037407255],"genre_scores_gemma":[0.9873257,0.010682206,0.00062965037,0.0010365866,0.0002261563,0.000029164166,0.000017733733,0.00005153276,0.0000012511933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959148,0.00041227383,0.0009448869,0.0012137489,0.00086081715,0.0006534619],"domain_scores_gemma":[0.99762094,0.000741838,0.00047106805,0.0007686819,0.00013713297,0.0002603222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008089217,0.00058098574,0.0014506964,0.00014592969,0.00019349968,0.00019841049,0.0008869988,0.00004238224,0.0000044319095],"category_scores_gemma":[0.00012491432,0.00044252814,0.0005659434,0.0012389873,0.00015467782,0.0004031487,0.00063785206,0.000607462,0.000044311946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002836097,0.0004700654,0.00020229677,0.029638516,0.000111590285,0.000031307878,0.0011346521,0.0002775207,0.015116816,0.038602356,0.000109605004,0.9143024],"study_design_scores_gemma":[0.00017641135,0.00035771282,0.0015161389,0.032548543,0.0001769986,0.000020491501,0.000015058916,0.946502,0.0009507493,0.016675377,0.00058614474,0.00047441525],"about_ca_topic_score_codex":0.00003423347,"about_ca_topic_score_gemma":0.0000025564777,"teacher_disagreement_score":0.94622445,"about_ca_system_score_codex":0.00009218564,"about_ca_system_score_gemma":0.00011618877,"threshold_uncertainty_score":0.99980265},"labels":[],"label_agreement":null},{"id":"W4396558186","doi":"10.1016/j.cose.2024.103883","title":"Navigating quantum security risks in networked environments: A comprehensive study of quantum-safe network protocols","year":2024,"lang":"en","type":"article","venue":"Computers & Security","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Université de Montréal","funders":"","keywords":"Computer science; Computer security; Protocol (science); Quantum computer; Quantum cryptography; Quantum network; Cryptographic protocol; Quantum; Cryptography; Quantum information; Physics","score_opus":0.02635697674877876,"score_gpt":0.3160726994727151,"score_spread":0.28971572272393636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396558186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85448927,0.0010652113,0.13470715,0.00031965796,0.0015600452,0.007405569,0.00000971973,0.00041363479,0.000029718069],"genre_scores_gemma":[0.9919177,0.000020073698,0.0066534635,0.00017766077,0.000526839,0.0006471029,0.00000980749,0.000045948556,0.0000013692857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945249,0.0009257577,0.0012336646,0.0014654135,0.0008156331,0.0010346458],"domain_scores_gemma":[0.9972174,0.0008404874,0.00037228822,0.0012640455,0.0000701038,0.00023567154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009121465,0.0006220146,0.0009425012,0.0001450778,0.00029826522,0.00040539828,0.0019457225,0.00019358506,0.0000073805973],"category_scores_gemma":[0.000027702074,0.00059104373,0.00025314797,0.00163988,0.00018254056,0.00042741426,0.0016904013,0.0018266614,0.000021082371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015104515,0.0041248687,0.010015576,0.0009768426,0.00048206048,0.0015140302,0.08251516,0.75893885,0.00013398126,0.025175815,0.0026364697,0.11333528],"study_design_scores_gemma":[0.0011428909,0.0009376684,0.007825943,0.0016274687,0.000017820266,0.000046452904,0.00032837663,0.963209,0.000025689798,0.021456096,0.002806287,0.00057635887],"about_ca_topic_score_codex":0.0006256915,"about_ca_topic_score_gemma":0.000044119522,"teacher_disagreement_score":0.20427008,"about_ca_system_score_codex":0.00013710672,"about_ca_system_score_gemma":0.00010503691,"threshold_uncertainty_score":0.9996541},"labels":[],"label_agreement":null},{"id":"W4396582211","doi":"10.22331/q-2024-05-02-1329","title":"Entanglement-assisted Quantum Reed-Muller Tensor Product Codes","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum entanglement; Tensor product; Quantum; Product (mathematics); Physics; Quantum mechanics; Mathematics; Pure mathematics; Geometry","score_opus":0.017301877038519597,"score_gpt":0.26133450442138867,"score_spread":0.24403262738286907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396582211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52692515,0.012347728,0.40038085,0.03328535,0.0149658155,0.0013758335,0.00007836393,0.007132081,0.0035088253],"genre_scores_gemma":[0.9826474,0.0000469907,0.014914298,0.00046804233,0.0007272211,0.000030464842,0.000016139586,0.000053806576,0.0010956319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968805,0.00015432498,0.00048382656,0.0011389122,0.00059598597,0.0007464595],"domain_scores_gemma":[0.99836403,0.0002063178,0.00009042899,0.0010417766,0.00010347307,0.00019396484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060379435,0.00038274913,0.0003515802,0.00030083768,0.0003095874,0.0007269002,0.001200297,0.000083187886,0.000067819376],"category_scores_gemma":[0.00007669431,0.00030291887,0.00021677374,0.0010053861,0.000102622784,0.00032929305,0.00044534454,0.00047895743,0.0004916578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003943713,0.00044407276,0.00038204057,0.00043683161,0.00031286443,0.001142999,0.0028156433,0.00087020185,0.012135046,0.5064403,0.08005887,0.39492172],"study_design_scores_gemma":[0.00024837276,0.00029573916,0.0018735252,0.00023913333,0.000022257738,0.00024691483,0.000046261946,0.8721999,0.0014843048,0.009963252,0.11286848,0.00051184185],"about_ca_topic_score_codex":0.000057723973,"about_ca_topic_score_gemma":0.0000091776365,"teacher_disagreement_score":0.8713297,"about_ca_system_score_codex":0.00007347415,"about_ca_system_score_gemma":0.00015865958,"threshold_uncertainty_score":0.9999423},"labels":[],"label_agreement":null},{"id":"W4396659606","doi":"10.1002/jcc.27384","title":"Range‐separated density functional theory using multiresolution analysis and quantum computing","year":2024,"lang":"en","type":"article","venue":"Journal of Computational Chemistry","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto; Canadian Institute for Advanced Research; McGill University; GLS Industries (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Toronto; Google; U.S. Department of Energy","keywords":"Density functional theory; Atomic orbital; Basis set; Wave function; Qubit; Statistical physics; Quantum; Range (aeronautics); Partition (number theory); Quantum mechanics; Quantum chemistry; Basis (linear algebra); Computer science; Mathematics; Physics; Molecule; Materials science; Combinatorics; Geometry","score_opus":0.01263378597446456,"score_gpt":0.2606558989150064,"score_spread":0.24802211294054183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396659606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48458198,0.0006520921,0.514379,0.00012333416,0.00018979593,0.000016146756,0.000001878405,0.000040739847,0.000015033798],"genre_scores_gemma":[0.94628483,0.0000046299783,0.05324985,0.000056113215,0.00037026306,1.4868715e-7,0.000006539068,0.000008539486,0.000019066594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984694,0.000100505065,0.0004774383,0.00027953452,0.00048690304,0.0001862055],"domain_scores_gemma":[0.99858093,0.00057839573,0.0002580841,0.00011640034,0.0003426845,0.00012348297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083827483,0.0001659566,0.00028419198,0.0002497402,0.00020785304,0.00026571853,0.00024513347,0.00007571085,0.000012220435],"category_scores_gemma":[0.00006271868,0.00014437178,0.00023087056,0.00092091924,0.00007724918,0.00024563514,0.0001321129,0.00038576423,0.0000018270655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024993229,0.000038132403,0.000570796,0.000061164996,0.0005310498,0.00010270237,0.00029570915,0.9838195,0.0033077628,0.0012213383,0.00007582515,0.009951039],"study_design_scores_gemma":[0.00024524643,0.00002156269,0.011256306,0.00009125655,0.00015363152,0.0009969407,0.000016175502,0.96059537,0.0007029401,0.025712257,0.00006042368,0.0001478996],"about_ca_topic_score_codex":0.000004752735,"about_ca_topic_score_gemma":1.8811492e-7,"teacher_disagreement_score":0.46170288,"about_ca_system_score_codex":0.000078841935,"about_ca_system_score_gemma":0.00022875232,"threshold_uncertainty_score":0.588731},"labels":[],"label_agreement":null},{"id":"W4396710821","doi":"10.1109/edtm58488.2024.10512142","title":"Performance Comparison for Quantum Approximate Optimization Algorithm (QAOA) across Noiseless Simulation, Experimentally Benchmarked Noisy Simulation, and Experimental Hardware Platforms","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fractal Systems (Canada)","funders":"","keywords":"Qubit; Computer science; Quantum computer; Quantum algorithm; Node (physics); Quantum; Algorithm; Noise (video); Quantum circuit; Quantum simulator; Graph; Theoretical computer science; Quantum error correction; Quantum mechanics; Physics; Artificial intelligence","score_opus":0.019900254114877648,"score_gpt":0.31691403923692324,"score_spread":0.29701378512204557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396710821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23618379,0.0005771977,0.7613366,0.000063532076,0.0006048182,0.0005801994,0.000023055605,0.00056256796,0.00006822364],"genre_scores_gemma":[0.7798111,0.000005331761,0.21967405,0.0000844556,0.00017021668,0.00006447043,0.000079438636,0.000036487123,0.00007444831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748206,0.000025935764,0.0005958696,0.0009056479,0.00042037244,0.00057013804],"domain_scores_gemma":[0.9988084,0.00032758122,0.0001296979,0.0004048516,0.00016177677,0.00016768712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036795004,0.00040221665,0.00036489672,0.00014627656,0.0007166065,0.0009584226,0.0005041362,0.00013550612,0.00002294562],"category_scores_gemma":[0.000014648782,0.000341941,0.0001144414,0.00043504278,0.00009562346,0.0011665393,0.0003571046,0.00018708015,0.0000070073543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022473678,0.00010304965,0.000081512946,0.00009043607,0.000033577773,0.0000026103373,0.0038544552,0.95979184,0.00012097116,0.0013628163,0.0000709199,0.034465324],"study_design_scores_gemma":[0.00078032614,0.00028080223,0.00012411292,0.00011272197,0.000008645232,0.0000128111615,0.00048764102,0.993894,0.0030005472,0.00021821674,0.0005860052,0.00049420475],"about_ca_topic_score_codex":0.000011679835,"about_ca_topic_score_gemma":0.000001076188,"teacher_disagreement_score":0.5436273,"about_ca_system_score_codex":0.00009022013,"about_ca_system_score_gemma":0.000060263344,"threshold_uncertainty_score":0.99990326},"labels":[],"label_agreement":null},{"id":"W4396721832","doi":"10.1103/prxquantum.5.020330","title":"High-Order Randomized Compiler for Hamiltonian Simulation","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Canadian Institute for Advanced Research; University of Toronto","funders":"Japan Society for the Promotion of Science; Canadian Institute for Advanced Research","keywords":"Hamiltonian (control theory); Inverse; Mathematics; Quantum; Lattice (music); Algorithm; Applied mathematics; Upper and lower bounds; Qubit; Computer science; Discrete mathematics; Quantum mechanics; Mathematical optimization; Physics; Mathematical analysis","score_opus":0.012671196834757358,"score_gpt":0.271935252254338,"score_spread":0.25926405541958064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396721832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015729947,0.0007099223,0.97636336,0.0031230068,0.0025612067,0.0006222787,0.000009943723,0.00076784426,0.0001125102],"genre_scores_gemma":[0.88059735,0.0000098079245,0.118277386,0.0003433787,0.0004224044,0.0000589787,0.000014736492,0.000026757169,0.0002492024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984237,0.00012538361,0.00034424436,0.00051791384,0.00023628741,0.00035250257],"domain_scores_gemma":[0.9979207,0.0014403281,0.000063107815,0.00038476477,0.000109302404,0.00008181221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076290907,0.00020351661,0.00038220774,0.00016324088,0.00019137957,0.00043586618,0.00048266118,0.000074361444,0.000014251733],"category_scores_gemma":[0.00014977592,0.00015508113,0.0002110705,0.00043250673,0.000065728724,0.00021690299,0.00013923134,0.00018809873,0.000070758666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004816206,0.000055757973,0.0000030342933,0.00013879091,0.0001039688,0.000016817183,0.0010370249,0.30679005,0.00017467575,0.60305876,0.0016258396,0.086513646],"study_design_scores_gemma":[0.00818422,0.00005294958,0.00003809208,0.00006952746,0.000017075003,0.0000058565206,0.000002855155,0.89578724,0.00008989004,0.07697851,0.018572394,0.00020136296],"about_ca_topic_score_codex":0.00002541411,"about_ca_topic_score_gemma":0.00000207737,"teacher_disagreement_score":0.8648674,"about_ca_system_score_codex":0.000024047342,"about_ca_system_score_gemma":0.00007808792,"threshold_uncertainty_score":0.63240254},"labels":[],"label_agreement":null},{"id":"W4396728818","doi":"10.1021/acs.jpca.4c00993","title":"Extension of Exactly-Solvable Hamiltonians Using Symmetries of Lie Algebras","year":2024,"lang":"en","type":"article","venue":"The Journal of Physical Chemistry A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lie algebra; Homogeneous space; Pauli matrices; Eigenvalues and eigenvectors; Mathematics; Quantum; Algebra over a field; Operator (biology); Quantum mechanics; Pure mathematics; Mathematical physics; Physics","score_opus":0.012724394467527215,"score_gpt":0.2540888787667087,"score_spread":0.2413644842991815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396728818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8986959,0.00084643264,0.09988862,0.00030982224,0.00007353816,0.000023004997,0.0000021528774,0.000017146285,0.00014338252],"genre_scores_gemma":[0.9959997,0.000013371912,0.0036147316,0.000022523383,0.00031180956,8.021478e-8,1.2276263e-7,0.000007873463,0.000029782952],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990261,0.000041874213,0.00031196396,0.00011144107,0.00035956368,0.00014901873],"domain_scores_gemma":[0.9988375,0.00038943853,0.0002496575,0.00028880447,0.00017911107,0.000055521145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038512726,0.000110622845,0.00027432703,0.000040512266,0.000054017462,0.00003840828,0.000655418,0.000032796914,0.0000036889028],"category_scores_gemma":[0.00008114281,0.000066323904,0.00018548591,0.00045304775,0.00012385033,0.00012626915,0.0001856513,0.0003301195,8.5200867e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014814143,0.00009908286,0.00000206896,0.00020792427,0.000060020124,0.00002206658,0.0010863121,0.02681433,0.96498775,0.000682721,0.00010948645,0.0059134476],"study_design_scores_gemma":[0.000070936476,0.0000841609,0.000029081613,0.00033691668,0.000030995336,0.00015032492,0.000030867872,0.4915096,0.50319797,0.004411118,0.00009417091,0.000053897766],"about_ca_topic_score_codex":0.000008616028,"about_ca_topic_score_gemma":4.3106386e-8,"teacher_disagreement_score":0.46469525,"about_ca_system_score_codex":0.000018746128,"about_ca_system_score_gemma":0.00012797226,"threshold_uncertainty_score":0.27046102},"labels":[],"label_agreement":null},{"id":"W4396838453","doi":"10.1007/978-3-031-59619-3_14","title":"Quantum-Secure Autonomous Factories: Hybrid TLS 1.3 for Inter- and Intra-plant Communication","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes on data engineering and communications technologies","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Computer science; Quantum; Embedded system; Computer security; Computer network; Physics; Quantum mechanics","score_opus":0.025080399951757485,"score_gpt":0.24591986149054954,"score_spread":0.22083946153879205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396838453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001568044,0.0657337,0.90073156,0.02248017,0.00043464595,0.0009528784,0.0028670232,0.0057854583,0.00085776666],"genre_scores_gemma":[0.5044949,0.032630816,0.4569709,0.00031238687,0.00015153791,0.00021748153,0.0041964836,0.00025755825,0.0007678945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844694,0.000014921872,0.0003732688,0.0007503609,0.00013475405,0.00027975545],"domain_scores_gemma":[0.9919695,0.0014227871,0.00015790196,0.0063370853,0.00006518768,0.000047517497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020311096,0.00051022996,0.0004483785,0.00039343748,0.0003357266,0.00048864575,0.0050084377,0.00038085153,8.2968654e-7],"category_scores_gemma":[0.0003204932,0.00043254628,0.00006360184,0.000107239386,0.00027670103,0.00016482393,0.005146079,0.0014850008,0.0000047742024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004567924,0.000020222837,6.9770357e-7,0.00029892044,0.0001472643,0.0000046607934,0.00031511128,0.0009487956,0.000058953294,0.693273,0.0006825634,0.30424526],"study_design_scores_gemma":[0.00009462734,0.00014671158,0.0000014655649,0.000847799,0.000050238174,0.00008519531,0.000014326069,0.63321,0.0001652246,0.12416714,0.24075337,0.0004639078],"about_ca_topic_score_codex":0.000013586839,"about_ca_topic_score_gemma":0.000019627696,"teacher_disagreement_score":0.6322612,"about_ca_system_score_codex":0.000052037743,"about_ca_system_score_gemma":0.000045170225,"threshold_uncertainty_score":0.99981266},"labels":[],"label_agreement":null},{"id":"W4396855072","doi":"10.1103/physreva.109.052423","title":"Approximate complex amplitude encoding algorithm and its application to data classification problems","year":2024,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Amplitude; Encoding (memory); Algorithm; Computer science; Data mining; Artificial intelligence; Pattern recognition (psychology); Physics","score_opus":0.05761668976320426,"score_gpt":0.381608356477377,"score_spread":0.32399166671417273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396855072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019237994,0.09014052,0.89310986,0.010998406,0.00014584413,0.0026680212,0.00007549937,0.00057768135,0.00036038837],"genre_scores_gemma":[0.7575932,0.13784829,0.090038665,0.009265741,0.0026557546,0.0016577592,0.0007036512,0.00017913821,0.000057788322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960355,0.00025606158,0.0006352098,0.0017812697,0.00072439614,0.00056754163],"domain_scores_gemma":[0.99701387,0.00042114808,0.00019813742,0.0018289948,0.00014368906,0.00039414357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009136172,0.0004818032,0.0010027718,0.00008032436,0.00020552686,0.00031887638,0.0020392777,0.00003437591,0.0000038798207],"category_scores_gemma":[0.00025773194,0.00036858636,0.0002280029,0.0015739904,0.00006571108,0.00058347406,0.0014670867,0.0005147074,0.0003896156],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.251571e-7,0.00023075628,0.0000017829617,0.009307246,0.000038360602,0.000004845697,0.00015501307,0.000031025193,0.016612073,0.060808152,0.0024637822,0.91034615],"study_design_scores_gemma":[0.000059681766,0.000082023165,0.00012556695,0.00817111,0.00010129056,0.000019537907,0.0000011288585,0.883436,0.0002687326,0.016421609,0.090904124,0.00040914305],"about_ca_topic_score_codex":0.000008538341,"about_ca_topic_score_gemma":5.970274e-7,"teacher_disagreement_score":0.909937,"about_ca_system_score_codex":0.00006146969,"about_ca_system_score_gemma":0.00007798831,"threshold_uncertainty_score":0.9998766},"labels":[],"label_agreement":null},{"id":"W4396965322","doi":"10.1021/acs.jpca.4c01234","title":"Simulating Vibronic Spectra by Direct Application of Doktorov Formulas on a Superconducting Quantum Simulator","year":2024,"lang":"en","type":"article","venue":"The Journal of Physical Chemistry A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Superconductivity; Vibronic spectroscopy; Spectral line; Quantum; Physics; Quantum mechanics; Simulation; Computational physics; Computer science","score_opus":0.007030389495068809,"score_gpt":0.25111614430248014,"score_spread":0.24408575480741132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396965322","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88629943,0.00035079345,0.11253344,0.00038155992,0.00007140007,0.000061362865,0.0000036271315,0.00005602551,0.00024234361],"genre_scores_gemma":[0.9988098,0.0000031948362,0.00044325175,0.000025371904,0.0006876088,6.512671e-7,6.5527576e-7,0.000013706164,0.000015723528],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884564,0.000049365135,0.0003359897,0.00018185275,0.00037843047,0.00020874363],"domain_scores_gemma":[0.99844396,0.0008935335,0.00020537266,0.0003164307,0.00006723825,0.0000734365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041242503,0.00015560286,0.0002544563,0.000024564692,0.00009469793,0.000070075344,0.00068482285,0.000038030783,0.0000027377152],"category_scores_gemma":[0.000072762035,0.000097060634,0.00019620477,0.00029579055,0.000053106247,0.00017197135,0.000102859514,0.00050523435,0.0000033356132],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014886808,0.00010208498,0.0000015960112,0.00011594904,0.00005000108,0.0000046841433,0.0011843551,0.21505392,0.7708621,0.001001214,0.00006514494,0.011544079],"study_design_scores_gemma":[0.00010790373,0.00012755608,0.0000037638774,0.0001398303,0.00001848429,0.000023369053,0.000030078325,0.75380284,0.24297856,0.0023643244,0.0003202955,0.00008298793],"about_ca_topic_score_codex":0.0000068056866,"about_ca_topic_score_gemma":6.2590445e-8,"teacher_disagreement_score":0.5387489,"about_ca_system_score_codex":0.000052391493,"about_ca_system_score_gemma":0.00006590811,"threshold_uncertainty_score":0.39580178},"labels":[],"label_agreement":null},{"id":"W4397026548","doi":"10.1109/twc.2024.3396437","title":"Quantum Machine Learning for Performance Optimization of RIS-Assisted Communications: Framework Design and Application to Energy Efficiency Maximization of Systems With RSMA","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Maximization; Efficient energy use; Quantum; Energy (signal processing); Mathematical optimization; Communications system; Distributed computing; Artificial intelligence; Computer architecture; Computer network; Electrical engineering; Mathematics; Engineering","score_opus":0.01828926230277456,"score_gpt":0.25185225318230614,"score_spread":0.23356299087953158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4397026548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014243069,0.0011383479,0.9955486,0.0008105882,0.000110436995,0.00068778556,0.00002209667,0.00023692835,0.000020927844],"genre_scores_gemma":[0.6484745,0.00083872874,0.35033396,0.000015404601,0.000005817275,0.000277554,0.00001821255,0.000021208281,0.0000145983795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844253,0.00030192314,0.00050616264,0.0003424132,0.00022637009,0.00018062652],"domain_scores_gemma":[0.99616754,0.0013437448,0.00022553581,0.0018816107,0.00030779064,0.00007377709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004423527,0.00019194742,0.00027137407,0.00042578005,0.0006229733,0.00011441845,0.0013670413,0.00010359562,6.905647e-7],"category_scores_gemma":[0.000013772202,0.00017621896,0.000060916067,0.0013928564,0.00018655788,0.00021652611,0.000036200985,0.00031905834,8.743847e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029420426,0.00018496397,0.00000726852,0.00012682148,0.000042155454,6.869305e-8,0.000773851,0.9023704,0.00038909208,0.01815247,0.0000023670452,0.07792111],"study_design_scores_gemma":[0.00019110457,0.00048309346,0.000026862814,0.0006030351,0.00004526357,0.0000139882895,0.000052312804,0.99657255,0.0014173607,0.00017377247,0.00023909615,0.000181547],"about_ca_topic_score_codex":0.00011804586,"about_ca_topic_score_gemma":0.000015044559,"teacher_disagreement_score":0.6470502,"about_ca_system_score_codex":0.000050117775,"about_ca_system_score_gemma":0.000103557926,"threshold_uncertainty_score":0.7186001},"labels":[],"label_agreement":null},{"id":"W4397028226","doi":"10.1103/physrevresearch.7.023262","title":"Compact quantum algorithms for time-dependent differential equations","year":2025,"lang":"en","type":"preprint","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; Los Alamos National Laboratory; New York University","keywords":"Quantum; Quantum algorithm; Algorithm; Computer science; Physics; Quantum mechanics","score_opus":0.1017418908172455,"score_gpt":0.43944783019227374,"score_spread":0.33770593937502824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4397028226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006048548,0.018296331,0.9672655,0.007839895,0.0009061485,0.003549565,0.00029548912,0.00035826207,0.0008839776],"genre_scores_gemma":[0.7558977,0.050848458,0.1166216,0.005088556,0.024356637,0.008919531,0.002999484,0.0006955538,0.034572512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940816,0.0010353826,0.00061599776,0.0014824593,0.0017168663,0.0010676492],"domain_scores_gemma":[0.9931986,0.0034653337,0.0002083983,0.0019895488,0.0008233729,0.0003147688],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019212352,0.0004973637,0.0011958786,0.0003313751,0.00053516467,0.0005361258,0.003187721,0.00014526844,0.000029305576],"category_scores_gemma":[0.001080478,0.00040142008,0.00078445417,0.00083035143,0.00016391065,0.00009818547,0.0041333097,0.002404875,0.00021701583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044867058,0.003344645,0.000005406632,0.027322816,0.00078058837,0.000054040596,0.00094937626,0.012526085,0.0010750743,0.24453811,0.09412653,0.61523247],"study_design_scores_gemma":[0.00021318428,0.00014836254,0.000023615417,0.004499457,0.000047037145,0.0000021179924,0.0000012181299,0.9041972,0.00016901307,0.08248615,0.007849915,0.00036271283],"about_ca_topic_score_codex":0.000091987364,"about_ca_topic_score_gemma":0.0000017796373,"teacher_disagreement_score":0.8916711,"about_ca_system_score_codex":0.00017735295,"about_ca_system_score_gemma":0.000820404,"threshold_uncertainty_score":0.99989665},"labels":[],"label_agreement":null},{"id":"W4398135697","doi":"10.1063/5.0207195","title":"Exactly solvable Hamiltonian fragments obtained from a direct sum of Lie algebras","year":2024,"lang":"en","type":"article","venue":"The Journal of Chemical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamiltonian (control theory); Homogeneous space; Pauli exclusion principle; Eigenvalues and eigenvectors; Qubit; Quantum; Pauli matrices; Lie algebra; Mathematics; Quantum mechanics; Mathematical physics; Physics; Pure mathematics","score_opus":0.009386344043321228,"score_gpt":0.22926109962402724,"score_spread":0.21987475558070602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398135697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89014375,0.0011921965,0.10645653,0.0011272652,0.0005326889,0.000051486342,0.0000073154574,0.000054112086,0.0004346407],"genre_scores_gemma":[0.98851115,0.000025032732,0.010656423,0.00014580028,0.00062229275,2.7792393e-7,9.451509e-7,0.000013515744,0.0000245381],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998782,0.00006901216,0.00035671442,0.00014454208,0.00043392592,0.00021380009],"domain_scores_gemma":[0.9987891,0.0005040277,0.00020253629,0.00032820698,0.000088486886,0.00008765727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034308838,0.00014375322,0.00028624496,0.00003469862,0.00004560989,0.00008831267,0.0010437543,0.00004516066,0.000006305279],"category_scores_gemma":[0.000035441557,0.00008770307,0.00018393825,0.00033633757,0.000077411074,0.00018372657,0.0002368492,0.00045050558,0.000007966928],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076951794,0.0003637716,0.00006040591,0.0001075312,0.0005608205,0.0000804089,0.005712585,0.004395045,0.8629757,0.0046691047,0.0063812733,0.11461639],"study_design_scores_gemma":[0.00039622458,0.00016313429,0.00014071036,0.00049073825,0.00008433551,0.00004188042,0.000019659648,0.30024093,0.54124105,0.15537122,0.0015880937,0.00022205505],"about_ca_topic_score_codex":0.000022129736,"about_ca_topic_score_gemma":1.44171e-7,"teacher_disagreement_score":0.3217347,"about_ca_system_score_codex":0.000030751587,"about_ca_system_score_gemma":0.00011306817,"threshold_uncertainty_score":0.35764274},"labels":[],"label_agreement":null},{"id":"W4398151806","doi":"10.2139/ssrn.4834504","title":"Quantum Resources in Harrow-Hassidim-Lloyd Algorithm","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Harrow; Quantum; Algorithm; Computer science; History; Physics; Quantum mechanics; Archaeology","score_opus":0.00718745079678194,"score_gpt":0.2382130840870763,"score_spread":0.23102563329029438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398151806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20884956,0.061175242,0.7055882,0.0139110945,0.008137069,0.0005672542,0.00002169472,0.0009036351,0.0008462124],"genre_scores_gemma":[0.9407557,0.0070755123,0.043999147,0.0004922954,0.004759491,0.00004975591,0.000015953168,0.00024000308,0.0026121018],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99229646,0.00038464303,0.0009145527,0.001272769,0.0008857339,0.0042458163],"domain_scores_gemma":[0.99810785,0.00013926515,0.00042742022,0.0009845147,0.00011275845,0.00022821185],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0039168773,0.0006936379,0.00072654366,0.0009675553,0.0002927517,0.0012746401,0.003423643,0.00046407516,0.000007452738],"category_scores_gemma":[0.00006720208,0.0005957857,0.0005085904,0.00079551834,0.00009154123,0.00015682292,0.0033753428,0.018093346,0.00009777738],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001682236,0.00017658698,0.0000633062,0.00012377668,0.00037187609,0.000578739,0.0027913507,0.012292946,0.000050718245,0.18271196,0.0007003361,0.8001216],"study_design_scores_gemma":[0.00023769047,0.00015444786,0.000086231616,0.00038253178,0.000019359828,0.0011056509,0.0001295389,0.42030835,0.000019034931,0.5746128,0.0024961121,0.00044821936],"about_ca_topic_score_codex":0.00029538738,"about_ca_topic_score_gemma":0.00032959855,"teacher_disagreement_score":0.7996734,"about_ca_system_score_codex":0.0014072765,"about_ca_system_score_gemma":0.0052733617,"threshold_uncertainty_score":0.9997621},"labels":[],"label_agreement":null},{"id":"W4398204237","doi":"10.22331/q-2024-05-22-1354","title":"A High Performance Compiler for Very Large Scale Surface Code Computations","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Defense Advanced Research Projects Agency","keywords":"Compiler; Computer science; Parallel computing; Computation; Code (set theory); Programming language; Scale (ratio); Computational science; Physics","score_opus":0.012788822353719555,"score_gpt":0.25516051096189424,"score_spread":0.24237168860817468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398204237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41527724,0.00030734515,0.58055186,0.0013374281,0.0016628179,0.00017388225,0.00006749666,0.00054957485,0.00007235449],"genre_scores_gemma":[0.899297,0.00001473675,0.0997472,0.00029337863,0.00025625926,0.000013664659,0.00002847202,0.000026127029,0.00032316218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984119,0.000045793608,0.00026565656,0.00053835334,0.00024355255,0.0004947321],"domain_scores_gemma":[0.9990261,0.00033920782,0.000046524412,0.00040603016,0.00008088614,0.00010123871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037254926,0.00020072333,0.00022324997,0.000101330246,0.00037956535,0.0003672981,0.0006326594,0.000066591536,0.000009956708],"category_scores_gemma":[0.0000112021,0.00017583539,0.000117672455,0.0004936246,0.000048028407,0.00027581118,0.00020857732,0.0002444293,0.00014327171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003134183,0.00038058189,0.00046540992,0.0007897051,0.0001445547,0.000057538757,0.0048212,0.38201427,0.0009866805,0.5102741,0.03352398,0.066510625],"study_design_scores_gemma":[0.00028712777,0.00015345887,0.0011448483,0.00013631412,0.000008960351,0.000028398888,0.000018669583,0.9577571,0.0003747872,0.0047654347,0.03508688,0.00023799013],"about_ca_topic_score_codex":0.000011302022,"about_ca_topic_score_gemma":0.000005371716,"teacher_disagreement_score":0.57574284,"about_ca_system_score_codex":0.000034083092,"about_ca_system_score_gemma":0.000107698696,"threshold_uncertainty_score":0.7170359},"labels":[],"label_agreement":null},{"id":"W4398206470","doi":"10.22331/q-2024-05-22-1352","title":"Relaxations and Exact Solutions to Quantum Max Cut via the Algebraic Structure of Swap Operators","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; QuantERA; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Swap (finance); Algebraic structure; Mathematics; Algebraic number; Quantum; Pure mathematics; Algebra over a field; Physics; Quantum mechanics; Mathematical analysis; Business","score_opus":0.010499919485583474,"score_gpt":0.24106921461379527,"score_spread":0.23056929512821178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398206470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59560704,0.0014151137,0.39144814,0.009701556,0.0012297435,0.0002602453,0.00002858013,0.00026133918,0.000048222817],"genre_scores_gemma":[0.99453485,0.000021328506,0.004830106,0.00033909475,0.00016102965,0.000007197931,0.000004150357,0.000021121532,0.000081146245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983426,0.00011940073,0.00032377572,0.0005123839,0.00030379696,0.0003980938],"domain_scores_gemma":[0.99877703,0.00027965722,0.00006508873,0.0006608814,0.0000728994,0.00014444995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027699774,0.00021803683,0.00021419494,0.00021089979,0.00044933934,0.00030049583,0.00076689984,0.00008204232,0.000020650497],"category_scores_gemma":[0.000074537995,0.00014377745,0.000094395175,0.0010002819,0.00010241136,0.00020787862,0.00044420993,0.00037951037,0.000032658027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006467854,0.00006092764,0.00022327782,0.00011823807,0.0001230318,0.000038008264,0.0069482825,0.009442153,0.014892938,0.9258525,0.00883971,0.03345448],"study_design_scores_gemma":[0.00008729429,0.0001672203,0.0025849,0.00011066148,0.000019508729,0.00011838863,0.00007456735,0.9436919,0.0006839687,0.045713436,0.006512372,0.00023576224],"about_ca_topic_score_codex":0.00010088736,"about_ca_topic_score_gemma":0.000058284277,"teacher_disagreement_score":0.93424976,"about_ca_system_score_codex":0.000033824464,"about_ca_system_score_gemma":0.00012919471,"threshold_uncertainty_score":0.58630747},"labels":[],"label_agreement":null},{"id":"W4398231190","doi":"10.1103/prxquantum.5.020341","title":"Quantum-Inspired Classical Algorithm for Graph Problems by Gaussian Boson Sampling","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Army Research Office; NTT Research; Natural Sciences and Engineering Research Council of Canada; Multidisciplinary University Research Initiative; U.S. Department of Energy; Air Force Office of Scientific Research; David and Lucile Packard Foundation; Office of Science; National Science Foundation","keywords":"Quantum; Gaussian; Boson; Algorithm; Quantum algorithm; Computer science; Quantum computer; Theoretical computer science; Mathematics; Physics; Quantum mechanics","score_opus":0.022077038342297912,"score_gpt":0.2698084289963209,"score_spread":0.247731390654023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398231190","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073145586,0.0035318106,0.9784189,0.0056921886,0.0025942922,0.0006519927,0.000089729525,0.0016102892,0.0000962313],"genre_scores_gemma":[0.49731326,0.00020068637,0.4981543,0.00090431585,0.0019389986,0.00041996548,0.00016175688,0.0002501256,0.0006565794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963572,0.000104875595,0.0006061115,0.0013201508,0.00056470424,0.0010469597],"domain_scores_gemma":[0.99822694,0.0004888181,0.00012422749,0.0007495006,0.00008976636,0.00032072564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072655507,0.00048499368,0.00046685274,0.00030373005,0.00047641888,0.0009943444,0.0012619502,0.00021031605,0.000008214041],"category_scores_gemma":[0.00005973035,0.00040575172,0.00037704819,0.0009605017,0.00012233079,0.00041565695,0.0003199871,0.00059468544,0.000064479595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009082782,0.00023754107,0.00002287684,0.0003486237,0.0001329117,0.000048335187,0.0012388112,0.0009915362,0.0034790705,0.18343665,0.01936012,0.7906945],"study_design_scores_gemma":[0.00032652958,0.00034954186,0.00004239522,0.00025871102,0.000020424213,0.000059090205,0.000016391847,0.8299032,0.0006288221,0.0697269,0.09816854,0.0004994897],"about_ca_topic_score_codex":0.000043326545,"about_ca_topic_score_gemma":0.0000033244767,"teacher_disagreement_score":0.82891166,"about_ca_system_score_codex":0.00007052698,"about_ca_system_score_gemma":0.00016712757,"threshold_uncertainty_score":0.9998394},"labels":[],"label_agreement":null},{"id":"W4399089407","doi":"10.1007/978-3-031-62076-8_15","title":"Exact Synthesis of Multiqubit Clifford-Cyclotomic Circuits","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Simon Fraser University","funders":"","keywords":"Computer science; Electronic circuit; Theoretical computer science; Algebra over a field; Algorithm; Arithmetic; Parallel computing; Electrical engineering; Mathematics; Pure mathematics; Engineering","score_opus":0.012273433612952033,"score_gpt":0.2397102863917149,"score_spread":0.22743685277876288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399089407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007696532,0.0010753733,0.9894894,0.0006323942,0.0028712633,0.00041358493,0.000020345531,0.00036548666,0.004362516],"genre_scores_gemma":[0.68470335,0.00011633437,0.3126272,0.00061019004,0.0010501738,0.000019150668,0.0000039714796,0.00013154981,0.0007381025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948605,0.000043375556,0.00089664216,0.002104833,0.0012212844,0.00087340845],"domain_scores_gemma":[0.9959538,0.0012992467,0.00042065405,0.0018856315,0.0002128387,0.00022780489],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010787222,0.00077827653,0.0009702383,0.0014710965,0.000208618,0.0004927221,0.0045394287,0.0004307554,0.000020151063],"category_scores_gemma":[0.0001606253,0.0006704173,0.00036503162,0.0009615103,0.0008244725,0.00030678118,0.0020639189,0.0013052128,0.00008558969],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002568182,0.000033607943,0.000015380327,0.00019408508,0.000032273674,0.00017089055,0.0006246732,0.049881455,0.00035757085,0.015216411,0.000017026427,0.93345404],"study_design_scores_gemma":[0.0001349481,0.00014372973,0.00008720612,0.0016391455,0.000021557062,0.00015888755,1.3986104e-7,0.8419183,0.006352321,0.14764374,0.0011385265,0.0007615246],"about_ca_topic_score_codex":0.000039865292,"about_ca_topic_score_gemma":0.000025067551,"teacher_disagreement_score":0.9326925,"about_ca_system_score_codex":0.0002352332,"about_ca_system_score_gemma":0.000612569,"threshold_uncertainty_score":0.9995747},"labels":[],"label_agreement":null},{"id":"W4399109444","doi":"10.1007/978-3-031-62076-8_10","title":"LinguaQuanta: Towards a Quantum Transpiler Between OpenQASM and Quipper","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Quantum; Quantum mechanics; Physics","score_opus":0.017833268101129018,"score_gpt":0.2596659320885891,"score_spread":0.24183266398746012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399109444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017539277,0.0031426824,0.98659825,0.0028154003,0.0026838214,0.0004596025,0.000022969085,0.00043973658,0.0020835905],"genre_scores_gemma":[0.5446172,0.00027992038,0.44859108,0.0020164014,0.0031938383,0.00001641793,0.000014892701,0.00018895062,0.0010813258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943263,0.000041784035,0.00076066173,0.0026550698,0.001172363,0.0010438508],"domain_scores_gemma":[0.9973939,0.0004699657,0.00020279296,0.0014056328,0.0001607799,0.00036691938],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011683127,0.00092366175,0.0009614303,0.0011414099,0.0003771556,0.0012784457,0.0032304248,0.00051046954,0.000014341646],"category_scores_gemma":[0.000048866274,0.00076746946,0.00024158417,0.00083265355,0.00094150286,0.00043885774,0.0022460104,0.001977895,0.00007398326],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042973165,0.00001843102,0.00003935969,0.00015607793,0.000041733536,0.00031820132,0.0023185988,0.0072713397,0.000055910183,0.05760932,0.00002055718,0.9321462],"study_design_scores_gemma":[0.0002555488,0.00031326126,0.00023085589,0.0010655327,0.000025201876,0.00019316337,2.7134482e-7,0.695745,0.00033997314,0.29376766,0.007037821,0.0010257306],"about_ca_topic_score_codex":0.00007496089,"about_ca_topic_score_gemma":0.000036923193,"teacher_disagreement_score":0.93112046,"about_ca_system_score_codex":0.00015898839,"about_ca_system_score_gemma":0.00063381763,"threshold_uncertainty_score":0.9997583},"labels":[],"label_agreement":null},{"id":"W4399151419","doi":"10.62056/a6n56c0kr","title":"The Round Complexity of Proofs in the Bounded Quantum Storage Model","year":2025,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; National Research Council Canada","funders":"HORIZON EUROPE Framework Programme; Simons Institute for the Theory of Computing, University of California Berkeley; Agence Nationale de la Recherche; European Commission","keywords":"Mathematical proof; Bounded function; Quantum; Computer science; Storage model; Mathematics; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.06019643846856042,"score_gpt":0.34177379511629535,"score_spread":0.2815773566477349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399151419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13649192,0.00229249,0.7936743,0.062556885,0.00023788546,0.00050452707,0.000004294168,0.000065006214,0.0041726977],"genre_scores_gemma":[0.88859093,0.00009372371,0.11083503,0.00040485826,0.0000053106387,0.00005443509,0.0000025505742,0.0000035222226,0.000009658316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980791,0.0008636402,0.00044200665,0.00021435703,0.0001338423,0.00026704563],"domain_scores_gemma":[0.9951572,0.0015794348,0.00013440037,0.0030434157,0.000071164635,0.0000144068845],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0012561516,0.00011273876,0.00020763512,0.00016875457,0.0004886156,0.00009046864,0.0056816246,0.000073927346,4.820324e-7],"category_scores_gemma":[0.00016156123,0.0000741385,0.000055566685,0.0009611882,0.0009237565,0.00007835399,0.0012510562,0.0006056374,0.0000017879026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004465521,0.00014861043,0.00042687223,0.0000066153484,0.0000072473204,9.843463e-7,0.0021844187,0.0072938823,0.000021137457,0.98188066,0.00013484617,0.007890274],"study_design_scores_gemma":[0.00013888004,0.0000138804,0.0031342113,0.000016576381,0.0000014381005,0.000004545557,0.000103356295,0.5573428,0.0000065422223,0.43784773,0.0013492355,0.00004076207],"about_ca_topic_score_codex":0.00018252184,"about_ca_topic_score_gemma":0.0020937633,"teacher_disagreement_score":0.752099,"about_ca_system_score_codex":0.00005205239,"about_ca_system_score_gemma":0.0002032004,"threshold_uncertainty_score":0.9996981},"labels":[],"label_agreement":null},{"id":"W4399151433","doi":"10.4230/lipics.tqc.2024.1","title":"Multi-qubit Lattice Surgery Scheduling","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Qubit; Lattice (music); Computer science; Quantum; Physics; Quantum mechanics","score_opus":0.06837317440194321,"score_gpt":0.20193214780925015,"score_spread":0.13355897340730694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399151433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4274671,0.00045080256,0.5679539,0.00035298345,0.0023707133,0.00015778097,0.0000112914,0.0008876255,0.0003477925],"genre_scores_gemma":[0.9513629,0.00008196303,0.046950538,0.00015161982,0.00027842345,6.171591e-7,0.000008494198,0.000036442463,0.0011290079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973451,0.0001545496,0.0002638739,0.0015860779,0.0001252532,0.0005251652],"domain_scores_gemma":[0.99779224,0.00038151036,0.00018945808,0.0013019493,0.00011711339,0.00021770952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048147593,0.0004258495,0.0004540951,0.000471156,0.00020700577,0.00037650234,0.0017795733,0.00032096627,0.000012017733],"category_scores_gemma":[0.000066719345,0.00045888658,0.00045718384,0.0008890025,0.00009062366,0.00013955851,0.005355266,0.0015142413,0.00033523492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067328715,0.00009094161,0.00043468573,0.0003211659,0.00015530955,0.0017618577,0.00036548998,0.95716244,0.000032965556,0.034183778,0.00031832972,0.005166327],"study_design_scores_gemma":[0.00012379671,0.000011727001,0.0003017297,0.00038209363,0.000053336596,0.000019105863,0.000018331028,0.9687603,0.0000541856,0.029234618,0.0005237883,0.00051698583],"about_ca_topic_score_codex":0.00011125864,"about_ca_topic_score_gemma":0.000013649411,"teacher_disagreement_score":0.5238958,"about_ca_system_score_codex":0.00012083943,"about_ca_system_score_gemma":0.0003656275,"threshold_uncertainty_score":0.99978626},"labels":[],"label_agreement":null},{"id":"W4399204000","doi":"10.1038/s42005-024-01649-y","title":"Resource theory of imaginarity in distributed scenarios","year":2024,"lang":"en","type":"article","venue":"Communications Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Resource (disambiguation); Distributed computing; Computer network","score_opus":0.022303360690509297,"score_gpt":0.2776687205215486,"score_spread":0.2553653598310393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399204000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010443238,0.0020063496,0.981143,0.0039960654,0.00008246568,0.00011446815,0.000029610826,0.0002454724,0.001939339],"genre_scores_gemma":[0.9617315,0.000029585299,0.038106564,0.00005072236,0.000023983734,0.0000067483875,0.00002502203,0.0000068080917,0.000019074765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922055,0.00019425905,0.00017859723,0.00017289257,0.0001027652,0.00013096219],"domain_scores_gemma":[0.9975752,0.0004669126,0.000039468458,0.0018509388,0.000040200488,0.000027278167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035258863,0.00008086915,0.00011368077,0.000060872415,0.00009119937,0.000080839214,0.0019038598,0.000025465095,9.4444965e-7],"category_scores_gemma":[0.00003199777,0.0000754832,0.000057317673,0.00088744616,0.00015529906,0.0001379411,0.0009781163,0.00033309587,0.0000090028225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011840104,0.00013355767,0.00013282978,0.000029063947,0.000011451521,0.0000028914271,0.0017410833,0.0034456335,0.00017273473,0.7651749,0.00033341747,0.2288212],"study_design_scores_gemma":[0.000059884584,0.000012917812,0.00094715634,0.0001090442,0.000003459721,0.0000042753786,0.000029299978,0.8149933,0.00017758252,0.174052,0.009528635,0.000082410676],"about_ca_topic_score_codex":0.000016663422,"about_ca_topic_score_gemma":0.0000028823251,"teacher_disagreement_score":0.9512882,"about_ca_system_score_codex":0.000026927622,"about_ca_system_score_gemma":0.000072411465,"threshold_uncertainty_score":0.3537877},"labels":[],"label_agreement":null},{"id":"W4399321676","doi":"10.1103/physrevresearch.6.023241","title":"Rydberg-atom experiment for the integer factorization problem","year":2024,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Samsung Science and Technology Foundation","keywords":"Quantum computer; Rydberg atom; Factorization; Atom (system on chip); Rydberg formula; Physics; Discrete mathematics; Mathematics; Quantum; Arithmetic; Combinatorics; Quantum mechanics; Computer science; Algorithm; Parallel computing","score_opus":0.07440540091731378,"score_gpt":0.4391339905309952,"score_spread":0.36472858961368143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399321676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045020998,0.07886204,0.90269196,0.015757984,0.00030404024,0.0012855706,0.0000032476746,0.00017862131,0.00046632075],"genre_scores_gemma":[0.9588558,0.011901354,0.02299683,0.0008953507,0.002422606,0.0016892334,0.0000131628485,0.000067245805,0.0011583957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822956,0.00018666504,0.00016319961,0.00042105984,0.0006212647,0.00037826397],"domain_scores_gemma":[0.99781835,0.0014368672,0.000018774517,0.00047925458,0.00016752825,0.000079227124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011532791,0.00011475979,0.00016887944,0.000054068943,0.00025082825,0.0003490813,0.0009218197,0.00001657284,0.000008833301],"category_scores_gemma":[0.000115396746,0.000060516482,0.00015474373,0.0008789006,0.00006898757,0.00012950457,0.00040185766,0.00041120892,0.00010440429],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016093937,0.00007469825,8.987782e-7,0.0011846889,0.000028945396,0.0000033156234,0.0008615006,0.00011252086,0.001021625,0.42097145,0.013103067,0.56263566],"study_design_scores_gemma":[0.000034539513,0.000098129996,0.000008396076,0.0011134887,0.0000050932567,0.0000025006898,0.00000529345,0.56022996,0.0011253542,0.033116277,0.40417877,0.00008219407],"about_ca_topic_score_codex":0.000012058205,"about_ca_topic_score_gemma":4.2798433e-7,"teacher_disagreement_score":0.9584056,"about_ca_system_score_codex":0.0000494134,"about_ca_system_score_gemma":0.00011536167,"threshold_uncertainty_score":0.33661988},"labels":[],"label_agreement":null},{"id":"W4399420289","doi":"10.1117/12.3013415","title":"Asymptotic compression rate of quantum autoencoders","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Compression (physics); Quantum; Data compression; Data compression ratio; Artificial intelligence; Image compression; Physics; Materials science; Quantum mechanics; Composite material; Image processing","score_opus":0.009182864182024185,"score_gpt":0.24268376890893126,"score_spread":0.23350090472690707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399420289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027461544,0.00038596074,0.9673698,0.0014563573,0.00095308264,0.000060764713,0.0000010061915,0.0005372589,0.0017742448],"genre_scores_gemma":[0.94344187,0.000008435282,0.055993695,0.00015964305,0.000054546468,0.000001387066,8.31683e-7,0.000008371701,0.00033123765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990877,0.00006324182,0.00019622946,0.00031219877,0.00014408954,0.00019657383],"domain_scores_gemma":[0.9993523,0.0001898077,0.000031340733,0.0003367372,0.000029028926,0.000060801794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025706342,0.00010924807,0.00013760118,0.00012540973,0.000058284804,0.00012530957,0.00053425954,0.000036185644,0.000024026354],"category_scores_gemma":[0.000014072909,0.00007645164,0.000081390135,0.00039896165,0.00004054716,0.000146007,0.00023038636,0.00014308335,0.000048718208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036255187,0.00006828872,0.000052572326,0.00019412041,0.000047539812,0.00007600125,0.0013689533,0.07525379,0.0053317556,0.78679216,0.006942932,0.123868264],"study_design_scores_gemma":[0.000065473316,0.00006204295,0.00036352393,0.00013834402,0.0000029498528,0.000016652226,0.000008007154,0.97750396,0.002052493,0.016846143,0.0028384798,0.000101956415],"about_ca_topic_score_codex":0.00003182578,"about_ca_topic_score_gemma":6.1718515e-7,"teacher_disagreement_score":0.91598034,"about_ca_system_score_codex":0.000009324781,"about_ca_system_score_gemma":0.000062217885,"threshold_uncertainty_score":0.31176072},"labels":[],"label_agreement":null},{"id":"W4399449118","doi":"10.1145/3662158.3662788","title":"On the Power of Quantum Distributed Proofs","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Computer science; Quantum; Power (physics); Distributed computing; Computer security; Mathematics; Quantum mechanics; Physics","score_opus":0.009267473468055103,"score_gpt":0.23130101235268788,"score_spread":0.2220335388846328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399449118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07390173,0.0001398981,0.9130779,0.009916847,0.0005413433,0.00010156733,0.000007186887,0.0003015341,0.0020120225],"genre_scores_gemma":[0.9972804,8.9237795e-7,0.0022976894,0.0002404485,0.00002545567,0.000002687938,9.075734e-7,0.000004665599,0.00014681285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928874,0.00003674808,0.0001228504,0.00021110153,0.00019298821,0.00014758023],"domain_scores_gemma":[0.99920505,0.00033202942,0.000019874313,0.0003895555,0.000024740984,0.00002876206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022006221,0.00008171917,0.000076910736,0.000043201388,0.000059467566,0.00011913117,0.0005641811,0.000022912214,0.00003986014],"category_scores_gemma":[0.000037781792,0.000039947525,0.000066283625,0.0004015631,0.000036547262,0.000045925917,0.00014890598,0.00015042737,0.000049156166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.4643525e-7,0.000021278112,0.0000030396218,0.0000082814795,0.000010898184,0.000009464224,0.00030055444,0.00076801016,0.000099479155,0.9823996,0.0071397023,0.009238766],"study_design_scores_gemma":[0.000028833216,0.0001105789,0.00022663151,0.000053390995,0.0000013166003,0.000009413047,0.000009884067,0.9293054,0.0013472717,0.06369866,0.0051421453,0.00006647977],"about_ca_topic_score_codex":0.0000064196793,"about_ca_topic_score_gemma":3.1899373e-7,"teacher_disagreement_score":0.92853737,"about_ca_system_score_codex":0.000007236955,"about_ca_system_score_gemma":0.000037518537,"threshold_uncertainty_score":0.16290128},"labels":[],"label_agreement":null},{"id":"W4399477061","doi":"10.1007/978-3-031-62743-9","title":"Post-Quantum Cryptography","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Standards and Technology; University of Waterloo; KU Leuven; Indian Statistical Institute; Lunds Universitet; Sogang University; Ewha Womans University; Shanghai Jiao Tong University; Tsinghua University; National Institute of Advanced Industrial Science and Technology","keywords":"Computer science; Quantum cryptography; Cryptography; Neural cryptography; Theoretical computer science; Quantum; Computer security; Public-key cryptography; Encryption; Quantum information; Quantum mechanics; Physics","score_opus":0.007546158104078718,"score_gpt":0.23331539585552466,"score_spread":0.22576923775144594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399477061","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023827776,0.002310757,0.9850014,0.0023224761,0.007042792,0.00039792195,0.000017519771,0.0008401397,0.0018287254],"genre_scores_gemma":[0.03438487,0.0000817096,0.95433545,0.0061578993,0.0036017387,0.000029187691,0.00002935767,0.00017395821,0.0012058263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993579,0.00008799948,0.000704733,0.0027675391,0.0015294548,0.001331301],"domain_scores_gemma":[0.9963064,0.0006413915,0.00024309993,0.0021588434,0.00032378375,0.00032643232],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011635149,0.00089850643,0.00076698663,0.0024053308,0.00038581475,0.0018156107,0.006353704,0.00046827502,0.000012919589],"category_scores_gemma":[0.00010435397,0.00075558893,0.00041185805,0.0031938138,0.00089506694,0.0004778546,0.003223008,0.0022310866,0.0002325199],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041158796,0.000060780276,0.00001123861,0.00019158497,0.000033789824,0.0005861334,0.0015652225,0.046432264,0.00017115043,0.026765654,0.0008744193,0.92330366],"study_design_scores_gemma":[0.00011918142,0.00022048969,0.00004348338,0.0005916097,0.000009337816,0.00017748977,9.971042e-8,0.68198544,0.00020739953,0.30989102,0.006040523,0.00071390247],"about_ca_topic_score_codex":0.000025056055,"about_ca_topic_score_gemma":0.000022438671,"teacher_disagreement_score":0.9225897,"about_ca_system_score_codex":0.000324749,"about_ca_system_score_gemma":0.0020418672,"threshold_uncertainty_score":0.9994895},"labels":[],"label_agreement":null},{"id":"W4399487636","doi":"10.1109/tit.2024.3411919","title":"Capacity of Finite State Channels With Feedback: Algorithmic and Optimization Theoretic Properties","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"Bundesministerium für Bildung und Forschung; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Computer science; Mathematical optimization; Finite state; State (computer science); Algorithm; Theoretical computer science; Mathematics; Markov chain","score_opus":0.00788907769546026,"score_gpt":0.18740917849742497,"score_spread":0.1795201008019647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399487636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0129936375,0.000053690223,0.9857524,0.00020044771,0.00038790383,0.00020122885,0.000021072845,0.0002392542,0.00015037315],"genre_scores_gemma":[0.9696983,0.000046981215,0.030053424,0.00009741195,0.000014658954,0.00002037008,0.0000016752261,0.000008548766,0.000058615944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991732,0.0000800426,0.00025084123,0.00014416414,0.00020303897,0.0001486676],"domain_scores_gemma":[0.99943984,0.0001456584,0.000069751,0.00020639409,0.000089283596,0.00004907401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035044912,0.00014073186,0.00012097473,0.00029550356,0.00015500098,0.00023400033,0.00018045273,0.00004117993,0.000011869253],"category_scores_gemma":[0.0000049921337,0.00009859036,0.000039791892,0.00037210793,0.00015164449,0.0010868977,0.0000035152673,0.00019585567,0.000012613351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026170892,0.0000141290275,7.886986e-8,0.00011600661,0.00002623255,9.3230057e-7,0.006540484,0.83796275,0.000021236732,0.007912098,0.0000026282369,0.14737727],"study_design_scores_gemma":[0.00019470966,0.00019393324,0.0000028705697,0.00021418132,0.000011399376,0.000047756934,0.00009358627,0.9856157,0.008089776,0.0053370246,0.00006515493,0.00013394847],"about_ca_topic_score_codex":0.000006927683,"about_ca_topic_score_gemma":4.515162e-7,"teacher_disagreement_score":0.9567047,"about_ca_system_score_codex":0.000019527279,"about_ca_system_score_gemma":0.00005573866,"threshold_uncertainty_score":0.40203983},"labels":[],"label_agreement":null},{"id":"W4399500535","doi":"10.1007/978-3-031-62746-0","title":"Post-Quantum Cryptography","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Standards and Technology; University of Waterloo; KU Leuven; Indian Statistical Institute; Lunds Universitet; Sogang University; Ewha Womans University; Shanghai Jiao Tong University; Tsinghua University; National Institute of Advanced Industrial Science and Technology","keywords":"Computer science; Quantum cryptography; Cryptography; Neural cryptography; Quantum; Theoretical computer science; Computer security; Public-key cryptography; Encryption; Quantum information; Physics; Quantum mechanics","score_opus":0.007546158104078718,"score_gpt":0.23331539585552466,"score_spread":0.22576923775144594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399500535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023827776,0.002310757,0.9850014,0.0023224761,0.007042792,0.00039792195,0.000017519771,0.0008401397,0.0018287254],"genre_scores_gemma":[0.03438487,0.0000817096,0.95433545,0.0061578993,0.0036017387,0.000029187691,0.00002935767,0.00017395821,0.0012058263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993579,0.00008799948,0.000704733,0.0027675391,0.0015294548,0.001331301],"domain_scores_gemma":[0.9963064,0.0006413915,0.00024309993,0.0021588434,0.00032378375,0.00032643232],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011635149,0.00089850643,0.00076698663,0.0024053308,0.00038581475,0.0018156107,0.006353704,0.00046827502,0.000012919589],"category_scores_gemma":[0.00010435397,0.00075558893,0.00041185805,0.0031938138,0.00089506694,0.0004778546,0.003223008,0.0022310866,0.0002325199],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041158796,0.000060780276,0.00001123861,0.00019158497,0.000033789824,0.0005861334,0.0015652225,0.046432264,0.00017115043,0.026765654,0.0008744193,0.92330366],"study_design_scores_gemma":[0.00011918142,0.00022048969,0.00004348338,0.0005916097,0.000009337816,0.00017748977,9.971042e-8,0.68198544,0.00020739953,0.30989102,0.006040523,0.00071390247],"about_ca_topic_score_codex":0.000025056055,"about_ca_topic_score_gemma":0.000022438671,"teacher_disagreement_score":0.9225897,"about_ca_system_score_codex":0.000324749,"about_ca_system_score_gemma":0.0020418672,"threshold_uncertainty_score":0.9994895},"labels":[],"label_agreement":null},{"id":"W4399510435","doi":"10.48550/arxiv.2406.04418","title":"Geometric Quantum Machine Learning with Horizontal Quantum Gates","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Government of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Quantum; Physics; Computer science; Theoretical physics; Quantum mechanics","score_opus":0.026863679535330618,"score_gpt":0.17450208974090645,"score_spread":0.14763841020557583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399510435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60999024,0.0010327087,0.3855209,0.0002861792,0.0011381522,0.0002559732,0.000021575983,0.0011617253,0.00059255614],"genre_scores_gemma":[0.9961144,0.0001838326,0.0024698582,0.00004135679,0.00021762427,0.0000011836938,0.000030827854,0.00006399577,0.0008769232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654526,0.00020516179,0.00028748706,0.0019712388,0.00025202674,0.00073881896],"domain_scores_gemma":[0.9978908,0.00024156521,0.0002903428,0.0011386797,0.00014803582,0.0002906109],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0003976645,0.0006677622,0.0005931326,0.0011498678,0.0003749291,0.0005017721,0.0022591406,0.00031569667,0.000020350328],"category_scores_gemma":[0.00004654504,0.0006001728,0.00032484424,0.002653425,0.00015624221,0.0001817385,0.0046887742,0.002732087,0.0001996729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047584035,0.0001317457,0.0018772309,0.00031017553,0.00030554156,0.0030071738,0.00043721066,0.82095873,0.00003256757,0.16766238,0.00020683705,0.005022831],"study_design_scores_gemma":[0.00035738558,0.0004210114,0.00037478513,0.0003119315,0.00009385177,0.00008260189,0.000047239126,0.95764303,0.00006614187,0.03873977,0.0010797483,0.0007824735],"about_ca_topic_score_codex":0.00054187095,"about_ca_topic_score_gemma":0.00004159819,"teacher_disagreement_score":0.38612416,"about_ca_system_score_codex":0.0001878116,"about_ca_system_score_gemma":0.00029990444,"threshold_uncertainty_score":0.999645},"labels":[],"label_agreement":null},{"id":"W4399522253","doi":"10.1145/3618260.3649638","title":"Classical Simulation of Peaked Shallow Quantum Circuits","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Qubit; Polynomial; Quantum computer; Inverse; Algorithm; Quantum circuit; Electronic circuit; Mathematics; Scaling; Observable; Exponential function; Discrete mathematics; Computer science; Topology (electrical circuits); Quantum; Combinatorics; Quantum mechanics; Physics; Quantum error correction; Mathematical analysis","score_opus":0.018109113320866177,"score_gpt":0.2677655401340604,"score_spread":0.24965642681319422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399522253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057607792,0.00016512586,0.93821263,0.0011643546,0.0005670211,0.000060199276,0.0000010512715,0.00042533473,0.001796496],"genre_scores_gemma":[0.9919497,0.0000016012056,0.0075329035,0.00007667682,0.000118859956,0.0000011026278,0.000001139145,0.0000074726104,0.00031059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904025,0.00003675101,0.00019816722,0.0003077559,0.00024281976,0.00017426675],"domain_scores_gemma":[0.99932283,0.00026830632,0.000026562619,0.00028372277,0.00004112333,0.00005744247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017673099,0.00009648941,0.00012383872,0.00010964874,0.000043980832,0.00012294679,0.000397936,0.000047886384,0.00002143906],"category_scores_gemma":[0.00002904671,0.00007349048,0.00008880566,0.00041259904,0.00003032183,0.00014644841,0.00013323782,0.0001415812,0.00004244378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001119987,0.000052742264,0.0000490843,0.00007162872,0.000024522407,0.00003516964,0.0008514133,0.2670452,0.0012756431,0.33861217,0.00044950866,0.3915318],"study_design_scores_gemma":[0.00006273377,0.00006437065,0.00068473566,0.0000484374,0.0000029264863,0.000008885974,0.0000041541975,0.98444355,0.0002373732,0.010664698,0.0036822923,0.00009585821],"about_ca_topic_score_codex":0.0000062507906,"about_ca_topic_score_gemma":0.0000017027145,"teacher_disagreement_score":0.93434185,"about_ca_system_score_codex":0.00001208384,"about_ca_system_score_gemma":0.000057571568,"threshold_uncertainty_score":0.29968548},"labels":[],"label_agreement":null},{"id":"W4399629990","doi":"10.22331/q-2024-06-13-1367","title":"Estimating Coherent Contributions to the Error Profile Using Cycle Error Reconstruction","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"U.S. Department of Energy","keywords":"Computer science; Algorithm; Benchmark (surveying); Generalization; Fidelity; Mathematics","score_opus":0.020280130711705126,"score_gpt":0.307400890923835,"score_spread":0.28712076021212984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399629990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23219612,0.00022470344,0.7573124,0.0057818214,0.0036008712,0.00030449475,0.000029585672,0.00045282836,0.00009713302],"genre_scores_gemma":[0.8381444,4.992155e-7,0.16093971,0.00019173147,0.00061675854,0.000027487036,0.0000036628467,0.000016383536,0.000059338803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985323,0.0001007697,0.0002668334,0.00044280104,0.00023459112,0.00042270188],"domain_scores_gemma":[0.9991644,0.00014630958,0.000059067577,0.0004336377,0.00008832476,0.00010823537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048938364,0.00016147939,0.00014965903,0.000109575514,0.0006003912,0.00045988738,0.0005262024,0.000050809133,0.000021990025],"category_scores_gemma":[0.00011277534,0.000110907116,0.00009356366,0.00067207054,0.000047845206,0.00019296553,0.00026792596,0.00030670495,0.00016028203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008146492,0.00007679823,0.00006428328,0.00011073549,0.00009106024,0.00006852349,0.0036256795,0.33529326,0.0044740946,0.123781785,0.0052441447,0.5271615],"study_design_scores_gemma":[0.00006943569,0.000060352548,0.00010801407,0.00021731932,0.000010742731,0.00024346332,0.00004463513,0.98850733,0.0003686129,0.007281374,0.002925014,0.00016371674],"about_ca_topic_score_codex":0.00008340753,"about_ca_topic_score_gemma":0.000008822683,"teacher_disagreement_score":0.6532141,"about_ca_system_score_codex":0.00009395589,"about_ca_system_score_gemma":0.00015358813,"threshold_uncertainty_score":0.46177843},"labels":[],"label_agreement":null},{"id":"W4399671437","doi":"10.1103/physreva.109.062422","title":"Exploring thermal equilibria of the Fermi-Hubbard model with variational quantum algorithms","year":2024,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Particle Physics","funders":"Thomas Jefferson National Accelerator Facility; Science and Technology Facilities Council; Office of Science; Nuclear Physics; University of Cambridge; U.S. Department of Energy","keywords":"Hubbard model; Fermi Gamma-ray Space Telescope; Hamiltonian (control theory); Coherence (philosophical gambling strategy); Quantum; Statistical physics; Thermal; Physics; Computer science; Algorithm; Quantum mechanics; Mathematics; Mathematical optimization; Superconductivity; Thermodynamics","score_opus":0.047274891722964126,"score_gpt":0.32916143984422996,"score_spread":0.28188654812126585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399671437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45899734,0.096098766,0.42298123,0.016532661,0.0009533111,0.0024722547,0.00006089748,0.00071797223,0.0011855661],"genre_scores_gemma":[0.9683461,0.017805973,0.01031218,0.0019084283,0.0011443312,0.0003296986,0.0000101991445,0.00008933038,0.00005376449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996166,0.00034526415,0.00064057054,0.00096340425,0.0012894718,0.0005952748],"domain_scores_gemma":[0.99744993,0.000571112,0.0002655686,0.001312566,0.00018438855,0.00021640901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058573275,0.00052923476,0.0011661493,0.000053738477,0.00016788866,0.0001307232,0.0018081897,0.000028301325,0.0000061384003],"category_scores_gemma":[0.00019209294,0.0002911575,0.00088434014,0.0016233858,0.00017787117,0.00066435715,0.0007787099,0.00075838447,0.000085583604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018373059,0.0011192916,0.000024614701,0.019217288,0.0003939115,0.000047883317,0.0011026148,0.021560775,0.020258008,0.55520463,0.0016926968,0.37935993],"study_design_scores_gemma":[0.00011740689,0.00014314776,0.00022034846,0.0162618,0.00018429964,0.000018570357,0.000001104067,0.93172103,0.0014367219,0.047079396,0.0024242378,0.00039195849],"about_ca_topic_score_codex":0.000010301093,"about_ca_topic_score_gemma":3.6945832e-7,"teacher_disagreement_score":0.91016024,"about_ca_system_score_codex":0.000058016616,"about_ca_system_score_gemma":0.00033062155,"threshold_uncertainty_score":0.99995404},"labels":[],"label_agreement":null},{"id":"W4399671637","doi":"10.1103/physreva.109.062607","title":"Characterization of overparametrization in the simulation of realistic quantum systems","year":2024,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Shared Hierarchical Academic Research Computing Network; Compute Canada","keywords":"Quantum; Robustness (evolution); Realization (probability); Noise (video); Statistical physics; Computer science; Logarithm; Quantum simulator; Bounding overwatch; Unitary state; Quantum computer; Control theory (sociology); Mathematics; Physics; Quantum mechanics; Control (management); Mathematical analysis; Artificial intelligence; Statistics","score_opus":0.018344283607527483,"score_gpt":0.34990845813686133,"score_spread":0.33156417452933384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399671637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39522278,0.055900063,0.54470474,0.0014833232,0.00037859974,0.0019825667,0.000039189308,0.00012429661,0.00016443685],"genre_scores_gemma":[0.98393124,0.015335434,0.00011201502,0.0002896298,0.00021922018,0.00005127682,0.000042506737,0.000015563879,0.000003111268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729496,0.00057168544,0.00075091247,0.00044782955,0.0007063446,0.00022826511],"domain_scores_gemma":[0.9975384,0.0011985637,0.00037419118,0.00068188546,0.00015247836,0.00005451532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008277958,0.00023609436,0.0008706184,0.000100744,0.000038457332,0.00006588799,0.00071401783,0.000026691738,0.0000012336674],"category_scores_gemma":[0.00066550146,0.00014887894,0.0003205185,0.0024908073,0.00006407517,0.00026423816,0.000116228926,0.0002825928,0.000019180608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103594975,0.0012605382,0.000069471316,0.06819991,0.00008189201,0.00002007996,0.0012740081,0.029597623,0.06115256,0.67003447,0.0002272644,0.1680718],"study_design_scores_gemma":[0.000056799738,0.00012428279,0.0007057289,0.019376082,0.00007945603,0.0000033458716,0.000001389713,0.967528,0.000506081,0.009722964,0.0017448526,0.00015104441],"about_ca_topic_score_codex":0.000024994066,"about_ca_topic_score_gemma":3.1781215e-7,"teacher_disagreement_score":0.93793035,"about_ca_system_score_codex":0.000031483207,"about_ca_system_score_gemma":0.00006877772,"threshold_uncertainty_score":0.60711074},"labels":[],"label_agreement":null},{"id":"W4399742950","doi":"10.1038/s41598-024-64558-8","title":"CS-count-optimal quantum circuits for arbitrary multi-qubit unitaries","year":2024,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science","score_opus":0.020040590247427544,"score_gpt":0.2610404411144593,"score_spread":0.24099985086703174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399742950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16863576,0.0017675988,0.7951791,0.0008765844,0.031583667,0.0005352607,0.000011505504,0.0011333927,0.0002771352],"genre_scores_gemma":[0.8847887,0.0000040591344,0.11120093,0.0001815549,0.0004995926,0.00006842662,0.000055916524,0.00005168345,0.0031491325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657106,0.000043221567,0.000563966,0.0015447794,0.0006058726,0.0006711169],"domain_scores_gemma":[0.9980567,0.0001874787,0.00014233823,0.0012450265,0.00017901768,0.00018940702],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017571249,0.00027374935,0.00025706124,0.00037582178,0.0007715597,0.0027675517,0.00071168103,0.0000978977,0.000016395517],"category_scores_gemma":[0.0001504706,0.00023090797,0.00023855247,0.0011103894,0.00027266913,0.0005900826,0.00029996157,0.00029503202,0.000046347417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018374494,0.00088865735,0.0008849985,0.0015734391,0.00045682496,0.013438963,0.023158493,0.024745997,0.03220761,0.35331413,0.18920732,0.36010522],"study_design_scores_gemma":[0.000092740935,0.000057225883,0.00014347126,0.00012356856,0.0000129358,0.0007496514,0.000028168244,0.7893482,0.0026817028,0.050006792,0.15642774,0.00032781338],"about_ca_topic_score_codex":0.00001773418,"about_ca_topic_score_gemma":0.000006244383,"teacher_disagreement_score":0.7646022,"about_ca_system_score_codex":0.000047834725,"about_ca_system_score_gemma":0.00046633068,"threshold_uncertainty_score":0.99826765},"labels":[],"label_agreement":null},{"id":"W4399765741","doi":"10.32920/26052517.v1","title":"EP-PQM: Efficient parametric Probabilistic Quantum Memory With Fewer Qubits and Gates","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Probabilistic logic; Qubit; Parametric statistics; Quantum; Computer science; Quantum gate; Quantum memory; Quantum computer; Theoretical computer science; Quantum mechanics; Quantum network; Physics; Mathematics; Artificial intelligence","score_opus":0.009552156114078511,"score_gpt":0.22537036759150764,"score_spread":0.21581821147742913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399765741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8102545,0.0047206343,0.17386477,0.0034923134,0.0023991624,0.0012492548,0.00001740054,0.0015428875,0.0024590383],"genre_scores_gemma":[0.93649656,0.000020530411,0.062174156,0.00014759302,0.00021340126,0.0000386751,0.0000066877733,0.000052396783,0.0008500018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645555,0.00012187057,0.00043645618,0.001736626,0.00063847896,0.0006109935],"domain_scores_gemma":[0.99779695,0.00043282317,0.00017131535,0.0011888696,0.00015758425,0.00025243527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051745656,0.0006138417,0.00058636675,0.0005558276,0.0001970192,0.0010360735,0.0011509218,0.00023391067,0.000010760032],"category_scores_gemma":[0.00010854259,0.00040373323,0.00013514126,0.0009907326,0.00019467797,0.000035306955,0.0043865843,0.0013320905,0.000065798784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000276556,0.00040289504,0.00010169175,0.0027159138,0.00030869604,0.0005406135,0.0037048934,0.78519076,0.00003252446,0.12163591,0.0015298496,0.08380862],"study_design_scores_gemma":[0.0001839847,0.00020112396,0.00048617035,0.00056221685,0.000047819187,0.00017496193,0.000030516558,0.9544725,0.00009223565,0.04291944,0.00021361602,0.00061544497],"about_ca_topic_score_codex":0.00015488768,"about_ca_topic_score_gemma":0.00001249193,"teacher_disagreement_score":0.16928174,"about_ca_system_score_codex":0.000089265486,"about_ca_system_score_gemma":0.0004995854,"threshold_uncertainty_score":0.99984145},"labels":[],"label_agreement":null},{"id":"W4399765802","doi":"10.32920/26052517","title":"EP-PQM: Efficient parametric Probabilistic Quantum Memory With Fewer Qubits and Gates","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Probabilistic logic; Qubit; Parametric statistics; Quantum; Quantum gate; Computer science; Quantum memory; Quantum computer; Theoretical computer science; Quantum mechanics; Physics; Quantum network; Mathematics; Artificial intelligence","score_opus":0.009552156114078511,"score_gpt":0.22537036759150764,"score_spread":0.21581821147742913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399765802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8102545,0.0047206343,0.17386477,0.0034923134,0.0023991624,0.0012492548,0.00001740054,0.0015428875,0.0024590383],"genre_scores_gemma":[0.93649656,0.000020530411,0.062174156,0.00014759302,0.00021340126,0.0000386751,0.0000066877733,0.000052396783,0.0008500018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645555,0.00012187057,0.00043645618,0.001736626,0.00063847896,0.0006109935],"domain_scores_gemma":[0.99779695,0.00043282317,0.00017131535,0.0011888696,0.00015758425,0.00025243527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051745656,0.0006138417,0.00058636675,0.0005558276,0.0001970192,0.0010360735,0.0011509218,0.00023391067,0.000010760032],"category_scores_gemma":[0.00010854259,0.00040373323,0.00013514126,0.0009907326,0.00019467797,0.000035306955,0.0043865843,0.0013320905,0.000065798784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000276556,0.00040289504,0.00010169175,0.0027159138,0.00030869604,0.0005406135,0.0037048934,0.78519076,0.00003252446,0.12163591,0.0015298496,0.08380862],"study_design_scores_gemma":[0.0001839847,0.00020112396,0.00048617035,0.00056221685,0.000047819187,0.00017496193,0.000030516558,0.9544725,0.00009223565,0.04291944,0.00021361602,0.00061544497],"about_ca_topic_score_codex":0.00015488768,"about_ca_topic_score_gemma":0.00001249193,"teacher_disagreement_score":0.16928174,"about_ca_system_score_codex":0.000089265486,"about_ca_system_score_gemma":0.0004995854,"threshold_uncertainty_score":0.99984145},"labels":[],"label_agreement":null},{"id":"W4399768158","doi":"10.1109/jsac.2024.3379106","title":"Guest Editorial The Quantum Internet: Principles, Protocols and Architectures","year":2024,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; The Internet; World Wide Web","score_opus":0.024513454646586823,"score_gpt":0.3131574253531464,"score_spread":0.28864397070655956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399768158","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034026653,0.0010226778,0.0017776655,0.0034449624,0.9899754,0.0028541943,0.000048677426,0.0002542849,0.00028187947],"genre_scores_gemma":[0.0019920843,0.00037419883,0.0032135858,0.00008830543,0.99298185,0.0010552789,0.000031700147,0.00007617716,0.00018681353],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99535716,0.0011802664,0.00097146124,0.0006475412,0.0012725276,0.0005710329],"domain_scores_gemma":[0.9917373,0.004209883,0.00059590436,0.0026404536,0.0006151741,0.0002013038],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017185684,0.00055289635,0.0005579162,0.00060417945,0.0006686561,0.0018441073,0.0072820075,0.00061661453,0.0000019483298],"category_scores_gemma":[0.0015161837,0.00036758705,0.00017397944,0.0011655814,0.00029300177,0.00011043364,0.0014332859,0.009901847,0.000024528175],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029490691,0.00016360852,0.0000072069147,0.00004522623,0.000092217844,0.000027800434,0.0013896825,0.0006938905,0.000016022577,0.0014507096,0.9926835,0.0034006538],"study_design_scores_gemma":[0.000410707,0.00034774467,0.00006068092,0.0016898146,0.000024339184,0.00016163762,0.000009619123,0.060003355,0.000018155348,0.004782362,0.9321031,0.00038851443],"about_ca_topic_score_codex":0.00008603446,"about_ca_topic_score_gemma":0.00027156266,"teacher_disagreement_score":0.060580418,"about_ca_system_score_codex":0.00025094597,"about_ca_system_score_gemma":0.0012145356,"threshold_uncertainty_score":0.99987763},"labels":[],"label_agreement":null},{"id":"W4399856244","doi":"10.1103/physrevresearch.6.023294","title":"Low-depth Clifford circuits approximately solve MaxCut","year":2024,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Sherbrooke","funders":"Office of Science; Canada First Research Excellence Fund; U.S. Department of Energy","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Clifford algebra; Graph; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.07557673831340554,"score_gpt":0.40964930769521535,"score_spread":0.3340725693818098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399856244","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06472259,0.41092834,0.40851372,0.04143086,0.002816353,0.005089541,0.000037516133,0.0042762016,0.062184878],"genre_scores_gemma":[0.9724714,0.01670695,0.006542546,0.001248846,0.002056065,0.0002332615,0.00001306966,0.000091697846,0.00063617737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630433,0.0003129906,0.00029431863,0.0008853882,0.0013013837,0.00090160634],"domain_scores_gemma":[0.9978444,0.0007527733,0.000030952542,0.00091191335,0.00018806016,0.0002718753],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018179733,0.00022627828,0.00041659304,0.00011835236,0.00024552495,0.0005753125,0.0017132072,0.00003966642,0.00001934097],"category_scores_gemma":[0.00024580667,0.000162871,0.00025685952,0.0020134135,0.00015775848,0.00026473292,0.00097084197,0.0011838723,0.0015097848],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.6103e-7,0.00013619606,0.0000020598675,0.0029773684,0.000022280494,0.000113891576,0.00021752164,0.000018957808,0.0006645178,0.0957385,0.006756192,0.89335173],"study_design_scores_gemma":[0.00012644303,0.00029947388,0.00013376964,0.008203884,0.000014779961,0.0000758388,0.0000056361264,0.7733381,0.0021750813,0.089416616,0.12575196,0.00045843434],"about_ca_topic_score_codex":0.000016358787,"about_ca_topic_score_gemma":0.0000014867679,"teacher_disagreement_score":0.9077488,"about_ca_system_score_codex":0.00006387532,"about_ca_system_score_gemma":0.00018643093,"threshold_uncertainty_score":0.99926764},"labels":[],"label_agreement":null},{"id":"W4399922836","doi":"10.1038/s41534-024-00856-3","title":"A benchmarking study of quantum algorithms for combinatorial optimization","year":2024,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; QLT (Canada)","funders":"Office of International Science and Engineering; Directorate for Computer and Information Science and Engineering; Innovation, Science and Economic Development Canada","keywords":"Benchmarking; Quantum computer; Algorithm; Computer science; Quantum algorithm; Quantum; Combinatorial optimization; Theoretical computer science; Quantum mechanics; Physics","score_opus":0.013564784189649211,"score_gpt":0.26049904429052234,"score_spread":0.24693426010087313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399922836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053874727,0.000080688515,0.94045794,0.00019823393,0.0041626906,0.0007478003,0.000010972417,0.00036763604,0.00009930739],"genre_scores_gemma":[0.9521909,0.000011768204,0.047317583,0.0000467734,0.0003048529,0.000060162576,0.000051245443,0.000013373741,0.0000033757208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982477,0.00006087574,0.00068254373,0.00026165147,0.00046282556,0.00028444134],"domain_scores_gemma":[0.9988728,0.00023807431,0.00022074256,0.00036744028,0.00023692347,0.0000640198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070727244,0.00019721303,0.0002423847,0.0003307618,0.00021010391,0.00044670136,0.0005257165,0.00009266605,0.000004928444],"category_scores_gemma":[0.00007213081,0.0001761731,0.000106569285,0.00075129495,0.000023857483,0.0017220662,0.00015604308,0.00017946244,0.00000925353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051553303,0.0002961568,0.000046396428,0.00034087384,0.00009083571,0.0000057116836,0.015771743,0.5330541,0.000027852995,0.26081318,0.00092622807,0.18857533],"study_design_scores_gemma":[0.00078907947,0.001046934,0.00011999588,0.0000964584,0.000017670664,0.000015327563,0.0002831907,0.9896275,0.0000492751,0.0053609954,0.002389066,0.00020450348],"about_ca_topic_score_codex":0.000042076626,"about_ca_topic_score_gemma":7.550067e-7,"teacher_disagreement_score":0.89831614,"about_ca_system_score_codex":0.000050510665,"about_ca_system_score_gemma":0.00011491652,"threshold_uncertainty_score":0.71841305},"labels":[],"label_agreement":null},{"id":"W4399964136","doi":"10.1007/s11128-024-04473-z","title":"QRP: quantum reliability polynomial for stochastic reliability analysis of reversible circuits","year":2024,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Reliability (semiconductor); Quantum computer; Reliability engineering; Computer science; Polynomial; Quantum; Electronic circuit; Mathematics; Physics; Quantum mechanics; Engineering","score_opus":0.011499596884544343,"score_gpt":0.259895711607983,"score_spread":0.24839611472343867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399964136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10794094,0.00022974858,0.88950664,0.00067783403,0.0006839851,0.00035054685,0.00005435886,0.0004271621,0.00012879989],"genre_scores_gemma":[0.9835912,0.0000030302122,0.01609768,0.00012193543,0.00007510023,0.000027315438,0.000054614742,0.000010973321,0.00001814891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975257,0.00006402886,0.0010289024,0.0004646077,0.0004956097,0.00042113545],"domain_scores_gemma":[0.9979446,0.00046246435,0.0003754781,0.0006182412,0.00048214648,0.00011707322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015875025,0.0002487868,0.0004700457,0.0008672973,0.0003279563,0.0005482481,0.00072447915,0.00013477166,0.000009096776],"category_scores_gemma":[0.000536643,0.00021961977,0.0003430679,0.0029905604,0.00010991824,0.0026538596,0.00017283187,0.00027550678,0.00001337682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050698374,0.00012909593,0.00014319902,0.0029998184,0.00027578385,0.0000017743196,0.01217655,0.5708387,0.00025152956,0.0264561,0.0014187992,0.385258],"study_design_scores_gemma":[0.0002140667,0.000113621994,0.0007972078,0.00017923691,0.00017442337,0.000005562549,0.00011045204,0.99045116,0.00019131007,0.005707764,0.0017959666,0.00025923227],"about_ca_topic_score_codex":0.000045758497,"about_ca_topic_score_gemma":0.0000013203327,"teacher_disagreement_score":0.8756503,"about_ca_system_score_codex":0.00012539925,"about_ca_system_score_gemma":0.0004729982,"threshold_uncertainty_score":0.89558345},"labels":[],"label_agreement":null},{"id":"W4399980528","doi":"10.3233/atde240359","title":"A Hybrid Quantum Algorithm for Load Flow","year":2024,"lang":"en","type":"book-chapter","venue":"Advances in transdisciplinary engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Algorithm; Quantum; Computer science; Flow (mathematics); Mathematics; Physics; Quantum mechanics; Geometry","score_opus":0.006303902786487861,"score_gpt":0.23117696306532587,"score_spread":0.22487306027883802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399980528","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017664672,0.03357246,0.9528201,0.00029228936,0.0032230036,0.0005172498,0.00014310925,0.00067254936,0.008741562],"genre_scores_gemma":[0.0015486641,0.0029478555,0.95607865,0.00006837189,0.0017045952,0.00020932773,0.000092305,0.0003988324,0.03695141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720144,0.000005463983,0.00058480405,0.0011295959,0.00043120715,0.0006474714],"domain_scores_gemma":[0.9988674,0.0002462872,0.00008448507,0.0006045691,0.000060450056,0.00013680814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028362378,0.00069211755,0.00064767123,0.00041334642,0.00010203354,0.0001351341,0.0011263666,0.0001957562,0.000007716382],"category_scores_gemma":[0.0000073827055,0.0006827843,0.00038654718,0.00013271984,0.000051252453,0.00042051435,0.00027300906,0.0009040032,0.00002967927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073118895,0.000023568475,5.068402e-8,0.00073072227,0.0000573289,0.0005258102,0.0010520832,0.4425093,0.00001482426,0.11424842,0.00007985566,0.44075075],"study_design_scores_gemma":[0.00025342917,0.00015009983,4.2123204e-7,0.0011001439,0.000020631782,0.00010808145,0.000004115579,0.75847596,0.000035714722,0.12616837,0.11305577,0.0006272808],"about_ca_topic_score_codex":7.843146e-7,"about_ca_topic_score_gemma":0.0000039328443,"teacher_disagreement_score":0.44012347,"about_ca_system_score_codex":0.00018672919,"about_ca_system_score_gemma":0.0001162981,"threshold_uncertainty_score":0.9995623},"labels":[],"label_agreement":null},{"id":"W4400026835","doi":"10.1016/j.physleta.2024.129668","title":"Quantum resources in Harrow-Hassidim-Lloyd algorithm","year":2024,"lang":"en","type":"article","venue":"Physics Letters A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum entanglement; Multipartite; Multipartite entanglement; Bipartite graph; Algorithm; Coherence (philosophical gambling strategy); Computer science; Quantum algorithm; Quantum; Mathematics; Squashed entanglement; Statistical physics; Theoretical computer science; Quantum mechanics; Physics","score_opus":0.009143057348884112,"score_gpt":0.22756653499885132,"score_spread":0.21842347764996722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400026835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17187102,0.00055019447,0.8133897,0.0122469235,0.0010918502,0.0001114011,0.000005439557,0.00054300873,0.00019041989],"genre_scores_gemma":[0.90705144,0.000014254173,0.086743794,0.0043497626,0.0016629918,0.000027096332,0.0000060911093,0.000056828394,0.000087743465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828386,0.0000805474,0.00022768014,0.0006149832,0.0003321466,0.0004607518],"domain_scores_gemma":[0.99923426,0.00015450566,0.000040583833,0.0004745077,0.000015572285,0.0000805434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023778752,0.00022213774,0.00020994035,0.00015241772,0.000102307764,0.0005223906,0.0007839813,0.00004169358,0.000003316702],"category_scores_gemma":[0.000007848723,0.00019670441,0.00012730443,0.00087849144,0.00006194437,0.00031962662,0.00027895859,0.00045590615,0.000099255776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028525737,0.00011651927,0.000113255395,0.00009267082,0.000052185344,0.00080580835,0.0068701305,0.008683216,0.013378511,0.03914072,0.010190646,0.9205535],"study_design_scores_gemma":[0.00014140263,0.00003180533,0.0003559987,0.00014701001,0.0000038921035,0.000023736648,0.0000104138135,0.97068644,0.00086095167,0.012303772,0.015152098,0.0002825035],"about_ca_topic_score_codex":0.00008910146,"about_ca_topic_score_gemma":0.0000022824752,"teacher_disagreement_score":0.9620032,"about_ca_system_score_codex":0.000047913676,"about_ca_system_score_gemma":0.000038121274,"threshold_uncertainty_score":0.8021373},"labels":[],"label_agreement":null},{"id":"W4400027424","doi":"10.1088/1402-4896/ad5c17","title":"Q-Map: quantum circuit implementation of boolean functions","year":2024,"lang":"en","type":"article","venue":"Physica Scripta","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Boolean function; Quantum; Computer science; Circuit minimization for Boolean functions; Quantum circuit; Boolean circuit; Physics; Algorithm; Quantum computer; Quantum mechanics; Quantum error correction","score_opus":0.016764799839417234,"score_gpt":0.26788388327887874,"score_spread":0.2511190834394615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400027424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07371101,0.0007941932,0.9143509,0.004307396,0.004985018,0.0002280087,0.000047894577,0.00062686065,0.00094869523],"genre_scores_gemma":[0.99724317,0.00000301196,0.0020197274,0.00009486067,0.00028498305,0.000008211493,0.0000105293275,0.000011880045,0.00032365587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901724,0.000033889984,0.00019213314,0.00033818683,0.00019983272,0.00021869937],"domain_scores_gemma":[0.99943274,0.000029060042,0.000047130266,0.00039049322,0.000045658322,0.000054932818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012025456,0.00011545104,0.00012918473,0.000110323694,0.000100964164,0.0001524083,0.00042807654,0.000019514839,0.000027107571],"category_scores_gemma":[0.0000035052149,0.0001027487,0.00011402396,0.00039502233,0.00003450671,0.00026469305,0.00014767729,0.00014444413,0.00013778044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015478065,0.000098494034,0.00007992399,0.00014072619,0.000100345045,0.000012014678,0.0033654554,0.0003317867,0.016355794,0.3978478,0.07496293,0.5067032],"study_design_scores_gemma":[0.00018750693,0.00020167444,0.0023261034,0.00008747492,0.000025833036,0.000011645897,0.00022949562,0.8175228,0.0036582446,0.051558852,0.123922974,0.000267349],"about_ca_topic_score_codex":0.00010771525,"about_ca_topic_score_gemma":0.000004719258,"teacher_disagreement_score":0.9235321,"about_ca_system_score_codex":0.000020501213,"about_ca_system_score_gemma":0.000079947225,"threshold_uncertainty_score":0.41899705},"labels":[],"label_agreement":null},{"id":"W4400089995","doi":"10.22331/q-2024-06-27-1387","title":"Relating non-local quantum computation to information theoretic cryptography","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Government of Canada; Ministerie van Economische Zaken en Klimaat; Ministry of Colleges and Universities; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Quantum cryptography; Cryptography; Computer science; Computation; Theoretical computer science; Quantum computer; Quantum information; Quantum; Computer security; Algorithm; Physics; Quantum mechanics","score_opus":0.006129752230098936,"score_gpt":0.23892806665061103,"score_spread":0.2327983144205121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400089995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07480853,0.00013188848,0.91925824,0.002003355,0.0017007109,0.00023782646,0.0000043891473,0.00082808,0.0010269904],"genre_scores_gemma":[0.9584519,0.000005166088,0.040743273,0.0005914942,0.0001528834,0.00001555251,0.000013268883,0.000018237872,0.000008177735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981545,0.00008266221,0.00045466318,0.0004195076,0.00044247392,0.00044618294],"domain_scores_gemma":[0.99901986,0.00026428656,0.00007821635,0.00036609772,0.00009447105,0.00017706855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055754546,0.0002416546,0.00020152896,0.0005558711,0.00026777972,0.000762641,0.0005841446,0.00009443064,0.0000074686113],"category_scores_gemma":[0.00005168277,0.0002084638,0.00014624464,0.0015174815,0.000069561494,0.00082953245,0.00025771104,0.00038677533,0.000539252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000583557,0.000020369833,0.000026770213,0.00010574692,0.000022851053,0.000022866996,0.004778804,0.05022,0.00015594006,0.68950105,0.0024075569,0.2527322],"study_design_scores_gemma":[0.0001164397,0.00020757272,0.0005851095,0.00021566008,0.000006915179,0.000039845178,0.00010379332,0.9059555,0.00012609415,0.08819751,0.004179402,0.00026613715],"about_ca_topic_score_codex":0.000040752133,"about_ca_topic_score_gemma":0.0000011442502,"teacher_disagreement_score":0.88364345,"about_ca_system_score_codex":0.00004580292,"about_ca_system_score_gemma":0.00008807552,"threshold_uncertainty_score":0.8500907},"labels":[],"label_agreement":null},{"id":"W4400113450","doi":"10.1103/prxquantum.5.020368","title":"Generalized Quantum Signal Processing","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Science; U.S. Department of Energy","keywords":"Quantum; Quantum computer; Algorithm; Mathematics; Quantum algorithm; SIGNAL (programming language); Pure mathematics; Discrete mathematics; Computer science; Algebra over a field; Physics; Quantum mechanics","score_opus":0.01644423244687121,"score_gpt":0.26130017794861005,"score_spread":0.24485594550173884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400113450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0907291,0.0067428676,0.8945103,0.0037675262,0.0014478661,0.000191017,0.000004859437,0.0020386558,0.00056775636],"genre_scores_gemma":[0.96432227,0.000030265823,0.03421119,0.00044203288,0.00063080643,0.000019118312,0.000005332236,0.00004168837,0.00029729985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976656,0.000107448985,0.00036094556,0.000789613,0.00046477304,0.0006116402],"domain_scores_gemma":[0.99911976,0.0001263138,0.00006698093,0.0004449592,0.00007013081,0.00017184293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004848737,0.00029339522,0.00026613224,0.00024018846,0.0002978613,0.0010150332,0.0010052458,0.000094381314,0.000039026138],"category_scores_gemma":[0.000018090175,0.0002362437,0.00016574516,0.00087620196,0.00006968611,0.00045011222,0.00033538867,0.00042675933,0.00022463685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008259878,0.00007946697,0.00003513214,0.00025081856,0.000043897096,0.0003405764,0.0019075876,0.002998448,0.0031491371,0.4597008,0.0050750137,0.5264109],"study_design_scores_gemma":[0.00014920504,0.00008785724,0.000116086536,0.00018215961,0.00000936746,0.00013695963,0.000010722569,0.91192514,0.0005459254,0.049987476,0.036521118,0.00032800558],"about_ca_topic_score_codex":0.000030250743,"about_ca_topic_score_gemma":0.000001462842,"teacher_disagreement_score":0.90892667,"about_ca_system_score_codex":0.000040736064,"about_ca_system_score_gemma":0.00023615066,"threshold_uncertainty_score":0.97879887},"labels":[],"label_agreement":null},{"id":"W4400179166","doi":"10.1021/acs.jctc.4c00298","title":"Probing Quantum Efficiency: Exploring System Hardness in Electronic Ground State Energy Estimation","year":2024,"lang":"en","type":"article","venue":"Journal of Chemical Theory and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Mitacs; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Ground state; Computer science; Quantum; Energy (signal processing); Efficient energy use; State (computer science); Statistical physics; Engineering physics; Physics; Algorithm; Atomic physics; Quantum mechanics; Electrical engineering; Engineering","score_opus":0.011389212634304022,"score_gpt":0.23804862264023324,"score_spread":0.2266594100059292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400179166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45914912,0.00063987676,0.53980154,0.00006425342,0.00027308264,0.00002175306,1.2788216e-7,0.00004098335,0.00000924218],"genre_scores_gemma":[0.9957226,0.000019669122,0.0041311765,0.000018416704,0.0000936906,0.0000027689846,7.372564e-7,0.000008137976,0.0000028137788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988239,0.00017204449,0.00038899682,0.00019269135,0.0002152731,0.00020709445],"domain_scores_gemma":[0.9993495,0.00033992,0.00013467131,0.0000661053,0.000054047698,0.000055802757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012156393,0.00011292757,0.00018209254,0.00021530766,0.000050947318,0.00024024227,0.00020340511,0.000033119763,2.752039e-7],"category_scores_gemma":[0.000029856563,0.00009109133,0.000056974208,0.00038682175,0.00003093369,0.00049822207,0.000062236286,0.00027793972,7.221071e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048965685,0.000040998464,0.0000025554139,0.00018571076,0.00002552688,0.00007854504,0.0027797753,0.14356196,0.0056800568,0.5070966,0.000005437444,0.3404939],"study_design_scores_gemma":[0.00016204538,0.00008143683,0.000020101888,0.0004654372,0.000005796887,0.00031205022,0.000052363197,0.8248624,0.0027225441,0.17120306,0.000025152951,0.00008758816],"about_ca_topic_score_codex":0.0000026537818,"about_ca_topic_score_gemma":1.0479859e-7,"teacher_disagreement_score":0.68130046,"about_ca_system_score_codex":0.00010985779,"about_ca_system_score_gemma":0.000092710354,"threshold_uncertainty_score":0.37145966},"labels":[],"label_agreement":null},{"id":"W4400319061","doi":"10.22331/q-2024-07-04-1397","title":"The Gauge Theory of Measurement-Based Quantum Computation","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Introduction to gauge theory; Quantum gauge theory; Theoretical physics; Gauge theory; Lattice gauge theory; Gauge fixing; Gauge anomaly; Physics; BRST quantization; Supersymmetric gauge theory; Quantum mechanics; Gauge boson","score_opus":0.023186705121258682,"score_gpt":0.25273759764045595,"score_spread":0.22955089251919727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400319061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0285757,0.0034048536,0.9627661,0.0024378465,0.0018425352,0.00016577978,0.000005371951,0.0004192399,0.00038257852],"genre_scores_gemma":[0.99552023,0.000012509644,0.004169375,0.0001259279,0.000113171845,0.000008151313,0.0000024406902,0.00001841531,0.000029797004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979527,0.0002811746,0.00036173317,0.00038132447,0.0006866968,0.00033636426],"domain_scores_gemma":[0.9984521,0.0007347301,0.00010042449,0.00048214928,0.00016161482,0.00006897845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019946094,0.0001807757,0.00017450296,0.00012544407,0.00028988687,0.00030088084,0.0008066525,0.00005284537,0.0000030170045],"category_scores_gemma":[0.00011381662,0.00011604384,0.00015782357,0.00056682073,0.00013491401,0.00012103281,0.000115065086,0.00024866054,0.000042307616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009911538,0.000034640503,0.000008466831,0.00006908461,0.000033262033,0.000013779629,0.00031927228,0.0029854823,0.0009446254,0.86655205,0.0012247886,0.12780462],"study_design_scores_gemma":[0.00012365854,0.00012352716,0.00030418142,0.00014971047,0.000009251513,0.000008805528,0.000026467767,0.8378682,0.0011372975,0.15490678,0.0052097663,0.00013234623],"about_ca_topic_score_codex":0.0000179225,"about_ca_topic_score_gemma":0.0000035090575,"teacher_disagreement_score":0.9669445,"about_ca_system_score_codex":0.000041131665,"about_ca_system_score_gemma":0.00023330394,"threshold_uncertainty_score":0.47321305},"labels":[],"label_agreement":null},{"id":"W4400416841","doi":"10.1364/optica.510312","title":"Photonic quantum walk with ultrafast time-bin encoding","year":2024,"lang":"en","type":"article","venue":"Optica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum walk; Ultrashort pulse; Scalability; Quantum; Computer science; Testbed; Encoding (memory); Photonics; Interferometry; Quantum computer; Physics; Optoelectronics; Optics; Quantum mechanics; Laser; Computer network","score_opus":0.005584770380461276,"score_gpt":0.21136126103086633,"score_spread":0.20577649065040504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400416841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4410428,0.00088954315,0.5204282,0.0047604023,0.0012388241,0.00033472414,0.000008553065,0.002097538,0.029199444],"genre_scores_gemma":[0.9377133,0.0000111002055,0.061375048,0.00012377293,0.00014763753,0.000004342141,0.000002260967,0.000018073884,0.00060446066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986769,0.00003160691,0.00014845635,0.00049785763,0.00026094978,0.00038423983],"domain_scores_gemma":[0.99923646,0.00016711965,0.00002516732,0.00042977365,0.000028321185,0.00011313331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020152703,0.00017668834,0.00015547863,0.000110990266,0.00014363852,0.0004896495,0.0005944991,0.000045936446,0.00006434755],"category_scores_gemma":[0.000012752399,0.00012668465,0.00006605739,0.0005082132,0.000055488414,0.00018045247,0.00010752047,0.00028182962,0.0004881982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003548911,0.00022937969,0.00012152015,0.00035377013,0.00031625704,0.0025460431,0.006360099,0.026972556,0.041755755,0.260297,0.0017624905,0.65924966],"study_design_scores_gemma":[0.000103088656,0.00017297988,0.00012444858,0.00018713575,0.000008694303,0.00025001596,0.000008833908,0.9891485,0.002871217,0.000980483,0.0059236446,0.00022094302],"about_ca_topic_score_codex":0.00001232994,"about_ca_topic_score_gemma":0.0000015130207,"teacher_disagreement_score":0.96217597,"about_ca_system_score_codex":0.000023146038,"about_ca_system_score_gemma":0.00011084861,"threshold_uncertainty_score":0.6274963},"labels":[],"label_agreement":null},{"id":"W4400426931","doi":"10.1103/physreva.110.012420","title":"Block Lanczos method for excited states on a quantum computer","year":2024,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of York; University of Victoria","keywords":"Lanczos resampling; Recursion (computer science); Block (permutation group theory); Hermitian matrix; Quantum; Excited state; Transpose; Quantum computer; Mathematics; Physics; Algebra over a field; Discrete mathematics; Quantum mechanics; Pure mathematics; Eigenvalues and eigenvectors; Algorithm; Combinatorics","score_opus":0.01732745460397136,"score_gpt":0.38223068771864493,"score_spread":0.3649032331146736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400426931","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062758494,0.07068784,0.9035121,0.015381215,0.00070426817,0.0022927637,0.00006309348,0.0008837673,0.00019908906],"genre_scores_gemma":[0.22728288,0.23504603,0.39591482,0.1160332,0.019791117,0.004078331,0.0004337751,0.0008326078,0.0005872512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955261,0.0005242892,0.00072328973,0.0015418878,0.0008094543,0.00087503006],"domain_scores_gemma":[0.9952875,0.0026571555,0.00021671626,0.0012600403,0.00019617917,0.0003824305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008983068,0.00071957783,0.0017518557,0.00010752275,0.00019079614,0.00027992154,0.0014496822,0.000048129245,0.0000063567427],"category_scores_gemma":[0.0002929748,0.0004941454,0.0013457608,0.0014676464,0.00008185378,0.00024408508,0.0004539737,0.00078194996,0.00049343606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012548634,0.00084590295,0.0000015499821,0.019974992,0.00019863354,0.00006014582,0.00026339665,0.000738395,0.0011273981,0.22609355,0.048781697,0.7019018],"study_design_scores_gemma":[0.00015261048,0.0005240084,0.000016762035,0.016432857,0.00013853675,0.00002034444,5.1984966e-7,0.72582847,0.00047193823,0.07452479,0.18141192,0.00047722767],"about_ca_topic_score_codex":0.000009692496,"about_ca_topic_score_gemma":5.1114597e-7,"teacher_disagreement_score":0.7250901,"about_ca_system_score_codex":0.000067913235,"about_ca_system_score_gemma":0.0001166222,"threshold_uncertainty_score":0.99975103},"labels":[],"label_agreement":null},{"id":"W4400453408","doi":"10.1103/physrevd.110.025006","title":"Toward a physically motivated notion of Gaussian complexity geometry","year":2024,"lang":"en","type":"article","venue":"Physical review. D/Physical review. D.","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Ministry of Colleges and Universities; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Geometry; Gaussian; Computer science; Mathematics; Physics; Quantum mechanics","score_opus":0.028535841845404714,"score_gpt":0.3944700553343836,"score_spread":0.3659342134889789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400453408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6581684,0.18324386,0.10759648,0.034395438,0.0016753101,0.004538485,0.00017739198,0.0026434797,0.0075611714],"genre_scores_gemma":[0.9709708,0.02003271,0.005213918,0.0024494894,0.0010974911,0.00008694727,0.000048659847,0.00007119282,0.000028801052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950783,0.000506115,0.000980088,0.001374379,0.0012629328,0.0007981494],"domain_scores_gemma":[0.9967918,0.00071340177,0.00037584762,0.001433621,0.0002643351,0.00042102332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066272006,0.0007173337,0.002046228,0.00014782783,0.00013863077,0.000154409,0.0018445014,0.000057728936,0.000014263373],"category_scores_gemma":[0.00049437385,0.0005266777,0.0014438889,0.0033642545,0.00029996457,0.00049537065,0.00077601074,0.0010305615,0.0005245893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009993655,0.0019671074,0.000066083616,0.03715681,0.00028179507,0.00008787329,0.00042509483,0.00016120354,0.02075568,0.41187125,0.005767734,0.5214494],"study_design_scores_gemma":[0.00041618934,0.00085952634,0.0035819812,0.057304982,0.000557284,0.000060969942,0.0000039734887,0.61386395,0.010162055,0.27998778,0.031578425,0.0016228805],"about_ca_topic_score_codex":0.000024447758,"about_ca_topic_score_gemma":5.380594e-7,"teacher_disagreement_score":0.6137028,"about_ca_system_score_codex":0.000088929206,"about_ca_system_score_gemma":0.00017589555,"threshold_uncertainty_score":0.9997185},"labels":[],"label_agreement":null},{"id":"W4400459006","doi":"10.21105/joss.06720","title":"Catalyst: a Python JIT compiler for auto-differentiablehybrid quantum programs","year":2024,"lang":"en","type":"article","venue":"The Journal of Open Source Software","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Python (programming language); Compiler; Programming language; Computer science; Differentiable function; Mathematics; Pure mathematics","score_opus":0.024063865598360882,"score_gpt":0.2836028758598334,"score_spread":0.2595390102614725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400459006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04827523,0.0016286572,0.94474506,0.003359353,0.0011875172,0.00053334853,0.000011451079,0.00023551614,0.000023871009],"genre_scores_gemma":[0.80430096,0.000040014766,0.19220881,0.00058356754,0.0011225982,0.000025551746,0.000015658066,0.00011422851,0.0015885871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980904,0.00018359115,0.00053934666,0.0002883899,0.00046581574,0.00043249238],"domain_scores_gemma":[0.99814934,0.00058337045,0.00031148232,0.0005856129,0.0002149091,0.00015528078],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017898655,0.00024385282,0.0004087393,0.00014523118,0.00040999934,0.0017055899,0.003838475,0.000056884764,0.000015320393],"category_scores_gemma":[0.00009114315,0.00014224075,0.0002805213,0.00049237005,0.00008785814,0.0005053097,0.0009889541,0.00056073745,0.000020171625],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012866098,0.00024200232,0.00016764691,0.00029598668,0.00045865262,0.00012731014,0.009094974,0.009937605,0.0003356967,0.0033933993,0.036873236,0.9389448],"study_design_scores_gemma":[0.0007455441,0.0007961188,0.0002797774,0.00094840437,0.00013259513,0.0018840635,0.0001885216,0.7246664,0.0003979438,0.013229947,0.25634795,0.0003827211],"about_ca_topic_score_codex":0.0000427386,"about_ca_topic_score_gemma":0.0000062775594,"teacher_disagreement_score":0.9385621,"about_ca_system_score_codex":0.000044998837,"about_ca_system_score_gemma":0.00022593664,"threshold_uncertainty_score":0.99933076},"labels":[],"label_agreement":null},{"id":"W4400494337","doi":"10.22331/q-2024-07-10-1402","title":"Algebra of Nonlocal Boxes and the Collapse of Communication Complexity","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"Artificial and Natural Intelligence Toulouse Institute; Mitacs; Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Région Occitanie Pyrénées-Méditerranée; Agence Nationale de la Recherche","keywords":"Algorithm; Computer science; Artificial intelligence; Machine learning","score_opus":0.015363168465953267,"score_gpt":0.2518457801849077,"score_spread":0.23648261171895446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400494337","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64035505,0.007149677,0.34386253,0.0072235824,0.0003571263,0.00024179823,0.000013676087,0.00014905627,0.00064748485],"genre_scores_gemma":[0.98748094,0.000070811824,0.012343698,0.000059120564,0.000020674448,0.0000024414135,0.0000014132266,0.0000046426658,0.000016259666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991806,0.00015762458,0.00022911529,0.00015790176,0.00016489925,0.000109825465],"domain_scores_gemma":[0.99882084,0.0005300596,0.00007231074,0.0005012356,0.000047392627,0.00002817645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058070634,0.00007895773,0.000182695,0.000055933608,0.00009031181,0.00006283294,0.00059496594,0.000029133304,0.0000032860291],"category_scores_gemma":[0.000035361045,0.000049176582,0.000059819173,0.0003050946,0.0005503014,0.000071082555,0.0003515026,0.00014008486,0.000002351551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010821701,0.000022434806,0.00003462059,0.00006166749,0.000021724429,0.0000015781543,0.0019294405,0.00014275852,0.00016588694,0.9757189,0.00033911158,0.021551063],"study_design_scores_gemma":[0.00022677628,0.000053626565,0.0008975293,0.000097074146,0.0000069233097,0.000017683471,0.000039699396,0.9046199,0.00055939646,0.09260096,0.0008260507,0.000054394968],"about_ca_topic_score_codex":0.00013773222,"about_ca_topic_score_gemma":0.00000964188,"teacher_disagreement_score":0.9044771,"about_ca_system_score_codex":0.0000049753003,"about_ca_system_score_gemma":0.000043286047,"threshold_uncertainty_score":0.20276085},"labels":[],"label_agreement":null},{"id":"W4400582834","doi":"10.1287/mnsc.2023.00314","title":"Improving the Efficiency of Payments Systems Using Quantum Computing","year":2024,"lang":"en","type":"article","venue":"Management Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo; Bank of Canada","funders":"","keywords":"Payment; Computer science; Quantum computer; Quantum; Physics","score_opus":0.01374502326919115,"score_gpt":0.2537030375078959,"score_spread":0.23995801423870478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400582834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21629077,0.0005032153,0.7800326,0.0001448684,0.0020326057,0.00023949711,6.408312e-7,0.00018530691,0.0005705187],"genre_scores_gemma":[0.9812339,0.000003933932,0.01857965,0.000050626048,0.000068078705,0.0000020741113,1.3226799e-7,0.000007367277,0.000054220407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761915,0.0000555005,0.00032521214,0.00064406433,0.00086166174,0.0004943851],"domain_scores_gemma":[0.9989837,0.000103612765,0.000118658034,0.0006805376,0.000051614752,0.0000619246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021742226,0.00015024276,0.00013744165,0.0003336776,0.0006282644,0.00095688744,0.0024032923,0.000017537652,9.392655e-7],"category_scores_gemma":[0.000022783037,0.00009643167,0.00006268375,0.002523299,0.00032870172,0.00035427825,0.0015422989,0.00015026578,0.0000099221925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001587539,0.00008438323,0.00019810956,0.00069355365,0.00004262755,0.00009806358,0.0027114963,0.31497544,0.010528579,0.48042938,0.00010936513,0.19012739],"study_design_scores_gemma":[0.000053627886,0.000032554515,0.0002932936,0.0002232617,0.000009084248,0.00002142901,0.00014267203,0.99770635,0.0006222543,0.0004795788,0.00029036845,0.00012550433],"about_ca_topic_score_codex":0.00009541863,"about_ca_topic_score_gemma":1.9812292e-7,"teacher_disagreement_score":0.7649431,"about_ca_system_score_codex":0.00006823153,"about_ca_system_score_gemma":0.00007200294,"threshold_uncertainty_score":0.9227288},"labels":[],"label_agreement":null},{"id":"W4400583045","doi":"10.1103/physreva.110.012612","title":"Doubling the efficiency of Hamiltonian simulation via generalized quantum signal processing","year":2024,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Xanadu Quantum Technologies (Canada); University of Toronto","funders":"Australian Research Council; Office of Science; U.S. Department of Energy","keywords":"Hamiltonian (control theory); Quantum; Computer science; Quantum information processing; Algorithm; Physics; Statistical physics; Mathematics; Quantum mechanics; Mathematical optimization","score_opus":0.019002810084595614,"score_gpt":0.3579862935411411,"score_spread":0.3389834834565455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400583045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0761274,0.20957838,0.7086149,0.0038597388,0.0002135983,0.0010958267,0.0000053341228,0.00032870797,0.00017612045],"genre_scores_gemma":[0.9864373,0.00932652,0.0020449809,0.0013668358,0.00070125563,0.0000660893,0.0000068115737,0.00003875258,0.000011411032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632645,0.00043428966,0.0007905531,0.00088321173,0.0010070727,0.0005584277],"domain_scores_gemma":[0.99753237,0.00087999244,0.00033617203,0.0008454368,0.0002272255,0.00017881651],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009557689,0.00045999157,0.0011130999,0.00007478131,0.0002657205,0.00021427676,0.0014003217,0.00003431706,0.000007742498],"category_scores_gemma":[0.00020002096,0.00026952944,0.0008191642,0.0022068392,0.00017804805,0.00036957386,0.00039882268,0.00064677675,0.00009575487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000603614,0.00049888564,0.0000055239584,0.015539406,0.00006214604,0.000019006435,0.0006350522,0.01072163,0.015616154,0.04123533,0.00034536896,0.91531545],"study_design_scores_gemma":[0.000103039005,0.00013136395,0.000030537278,0.015050679,0.00014636297,0.000009819048,0.0000010235336,0.9466808,0.0015654092,0.026814854,0.009142589,0.0003235198],"about_ca_topic_score_codex":0.000013545491,"about_ca_topic_score_gemma":4.2385676e-7,"teacher_disagreement_score":0.93595916,"about_ca_system_score_codex":0.00004611223,"about_ca_system_score_gemma":0.00018393957,"threshold_uncertainty_score":0.9999757},"labels":[],"label_agreement":null},{"id":"W4400587008","doi":"10.26634/jmat.13.1.20387","title":"Estimation of quantum entropies","year":2024,"lang":"en","type":"article","venue":"i-manager’s Journal on Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Quantum relative entropy; Quantum discord; Generalized relative entropy; Joint quantum entropy; Quantum entanglement; Entropy estimation; Quantum algorithm; Quantum; Entropy (arrow of time); Mathematics; Quantum information; Statistical physics; Algorithm; Computer science; Quantum mechanics; Physics; Statistics","score_opus":0.012350979871033499,"score_gpt":0.2618308964462879,"score_spread":0.24947991657525437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400587008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04830758,0.00048744254,0.9478233,0.0014828154,0.0009436116,0.00007701413,0.0000016206566,0.00016669215,0.00070995744],"genre_scores_gemma":[0.74248993,0.0000735938,0.2568567,0.00010352955,0.00020124023,0.0000015597042,6.255152e-7,0.000021432636,0.00025138754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985746,0.0000512244,0.00046501902,0.00018970216,0.0004909413,0.00022851225],"domain_scores_gemma":[0.99895716,0.00035572855,0.00019699156,0.0003520211,0.00005383836,0.00008427323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051857776,0.00016410285,0.00024270848,0.00031619318,0.00012716396,0.00046243242,0.00064704823,0.000046526184,0.000016014386],"category_scores_gemma":[0.00010772455,0.000118847805,0.00016008536,0.0003869305,0.00004057212,0.0002441363,0.0001225848,0.00037681338,0.00008328822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020447083,0.00011327838,0.0000020373595,0.0003643924,0.00007304769,0.00020443917,0.0025086657,0.07969393,0.00012219402,0.7100659,0.001907237,0.20494284],"study_design_scores_gemma":[0.0000730778,0.00012457902,0.000029588138,0.0005489023,0.000013668993,0.0002921628,0.00003332727,0.81340814,0.0002974209,0.18358943,0.0014844805,0.00010525303],"about_ca_topic_score_codex":9.308365e-7,"about_ca_topic_score_gemma":1.0622568e-7,"teacher_disagreement_score":0.73371416,"about_ca_system_score_codex":0.000033219447,"about_ca_system_score_gemma":0.00005043998,"threshold_uncertainty_score":0.4846473},"labels":[],"label_agreement":null},{"id":"W4400649092","doi":"10.1103/physrevresearch.6.033062","title":"Scalable simulation of nonequilibrium quantum dynamics via classically optimized unitary circuits","year":2024,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"German Academic Exchange Service New Delhi; European Research Council; Horizon 2020; Engineering and Physical Sciences Research Council; University of Toronto; Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst","keywords":"Quantum; Scalability; Unitary state; Computer science; Hamiltonian (control theory); Electronic circuit; Quantum circuit; Quantum dynamics; Quantum computer; Statistical physics; Quantum network; Physics; Quantum mechanics; Mathematics; Mathematical optimization","score_opus":0.04503417326134943,"score_gpt":0.37964714385593135,"score_spread":0.3346129705945819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400649092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018296508,0.029875107,0.94378215,0.004780795,0.0003733298,0.00088783295,0.00001547935,0.00037785387,0.0016109402],"genre_scores_gemma":[0.9947068,0.0012081121,0.0035308392,0.00009210774,0.00026042285,0.000024590057,0.00001589145,0.000030312698,0.00013089406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965424,0.0005969912,0.0004255489,0.00064294675,0.0012023784,0.00058974826],"domain_scores_gemma":[0.9964937,0.0020329056,0.00005927465,0.0007988127,0.0004141618,0.00020116322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001520769,0.00019852049,0.0005173364,0.00021274078,0.00013298784,0.0001692562,0.0011873675,0.00005041973,0.000014879334],"category_scores_gemma":[0.00039658652,0.0001539955,0.00025230472,0.0024432733,0.00019209845,0.00032191983,0.0006993181,0.0008679841,0.00014763833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012587434,0.0005246031,0.0000069775983,0.0057708044,0.00010597737,0.00009382124,0.00029569629,0.1549483,0.0030818947,0.16158234,0.0017617764,0.6718152],"study_design_scores_gemma":[0.0001032391,0.000185414,0.000041863033,0.0022273685,0.000015297726,0.0000066201583,0.0000017287816,0.9672794,0.00009664864,0.027497666,0.0023876096,0.00015715267],"about_ca_topic_score_codex":0.000027495022,"about_ca_topic_score_gemma":9.495946e-7,"teacher_disagreement_score":0.9764103,"about_ca_system_score_codex":0.000083556966,"about_ca_system_score_gemma":0.00026388039,"threshold_uncertainty_score":0.6279754},"labels":[],"label_agreement":null},{"id":"W4400652348","doi":"10.22331/q-2024-07-15-1410","title":"Efficiently improving the performance of noisy quantum computers","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Advanced Scientific Computing Research; Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Office of Science; Canada First Research Excellence Fund; Government of Canada; U.S. Department of Energy","keywords":"Computer science; Noise (video); Testbed; Probabilistic logic; Quantum computer; Extrapolation; Qubit; Computer engineering; Quantum; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Computer network; Physics; Quantum mechanics","score_opus":0.007768766591462026,"score_gpt":0.219789851143805,"score_spread":0.21202108455234298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400652348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7071229,0.0010120415,0.28746685,0.0011574123,0.0026229387,0.000145934,0.0000034766047,0.00037330794,0.00009514572],"genre_scores_gemma":[0.99402803,0.00001822486,0.005466038,0.00018783624,0.00021486085,0.0000055801293,0.0000016131917,0.000020235964,0.000057564153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811983,0.00008593646,0.00038094085,0.000518507,0.00044139757,0.00045339335],"domain_scores_gemma":[0.99859905,0.00038953562,0.000103842256,0.00076297834,0.00006604894,0.000078544035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067434384,0.00022503012,0.00022937595,0.0001693567,0.0002610811,0.0003017518,0.0014990437,0.000059859252,0.00000485192],"category_scores_gemma":[0.00002570822,0.00014347077,0.00016364091,0.00084104337,0.00014789666,0.00021886604,0.00048462956,0.00039702756,0.000063630556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002074936,0.0001890431,0.0003279437,0.00089574774,0.00012850427,0.0001117485,0.0072115334,0.063012384,0.012418538,0.44802988,0.003950887,0.46370304],"study_design_scores_gemma":[0.00010701572,0.00025479202,0.00079216197,0.0001903673,0.000009166684,0.000067429646,0.00002608096,0.99229395,0.0020518182,0.00070563325,0.0033061164,0.00019543925],"about_ca_topic_score_codex":0.000046839657,"about_ca_topic_score_gemma":9.1816696e-7,"teacher_disagreement_score":0.9292816,"about_ca_system_score_codex":0.000027796657,"about_ca_system_score_gemma":0.00013023852,"threshold_uncertainty_score":0.5850568},"labels":[],"label_agreement":null},{"id":"W4400710856","doi":"10.1088/1367-2630/ad6635","title":"Randomised benchmarking for universal qudit gates","year":2024,"lang":"en","type":"preprint","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Alberta","keywords":"Benchmarking; Computer science; Business; Marketing","score_opus":0.015079141891691867,"score_gpt":0.2525739270056611,"score_spread":0.23749478511396924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400710856","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008916449,0.0012212591,0.9821294,0.0018918096,0.005363055,0.00022323121,0.000007978566,0.000059050755,0.00018776688],"genre_scores_gemma":[0.24996413,0.00016369674,0.7258317,0.0002941449,0.023233553,0.0000042710817,0.000009643954,0.000083601975,0.00041529324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985899,0.000054248194,0.00043930687,0.00031017672,0.0003566937,0.00024970673],"domain_scores_gemma":[0.99833804,0.00035817266,0.0006137116,0.00032157372,0.00021858604,0.00014992623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004185579,0.0002546423,0.00050275715,0.00012703259,0.00008339093,0.0003586754,0.0012386128,0.00011640114,0.0000030379229],"category_scores_gemma":[0.000035305347,0.00020772943,0.0006489987,0.00017802558,0.000026996167,0.000094535804,0.0009655523,0.0010635336,0.000003445057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016821238,0.00006153321,0.000003888951,0.00032879104,0.00045280872,0.00010401133,0.0022667856,0.19315109,0.00041002381,0.025205083,0.021296471,0.75655127],"study_design_scores_gemma":[0.0028524823,0.00016905385,0.0000063931725,0.0007851257,0.00009964216,0.000046840334,0.0000102132535,0.6087944,0.0009677874,0.38074344,0.005286141,0.0002384831],"about_ca_topic_score_codex":0.000011421172,"about_ca_topic_score_gemma":7.28945e-7,"teacher_disagreement_score":0.7563128,"about_ca_system_score_codex":0.00007082873,"about_ca_system_score_gemma":0.00081539084,"threshold_uncertainty_score":0.847096},"labels":[],"label_agreement":null},{"id":"W4400737701","doi":"10.1145/3678184","title":"Optimization Applications as Quantum Performance Benchmarks","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Quantum Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; Quantum; Computer architecture; Parallel computing; Physics; Quantum mechanics","score_opus":0.01013412588121792,"score_gpt":0.250089047943811,"score_spread":0.23995492206259306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400737701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035155986,0.000437985,0.95890844,0.0018092135,0.0013633426,0.0003813346,0.0000064597666,0.0014154068,0.00052185147],"genre_scores_gemma":[0.87971425,0.00010539559,0.11945403,0.0003052774,0.00024402699,0.000041159656,0.000018427892,0.000042818276,0.00007463971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997306,0.00010444282,0.0005239932,0.0009857366,0.00048105503,0.0005987834],"domain_scores_gemma":[0.99776226,0.0006085433,0.00009986399,0.0012417808,0.000103360166,0.00018416542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046421523,0.00037740267,0.00027356052,0.0004936871,0.0010066762,0.00065817835,0.0015362882,0.0001444726,0.000086442895],"category_scores_gemma":[0.000018831319,0.00036020577,0.00021304729,0.0016261255,0.00008064614,0.0004958444,0.000080440506,0.0007978366,0.00026175746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003962274,0.00008051836,0.0000052865325,0.000068493995,0.000036883343,0.000011967632,0.0004803663,0.6713432,0.00004663918,0.015754983,0.00008222687,0.31208545],"study_design_scores_gemma":[0.00016759551,0.00023000731,0.000056261088,0.0002497636,0.00002220086,0.00016974215,0.000046166322,0.98962665,0.00038253624,0.0044413623,0.004184859,0.00042283128],"about_ca_topic_score_codex":0.000027858192,"about_ca_topic_score_gemma":8.758237e-7,"teacher_disagreement_score":0.84455824,"about_ca_system_score_codex":0.000095814175,"about_ca_system_score_gemma":0.00017964288,"threshold_uncertainty_score":0.99988496},"labels":[],"label_agreement":null},{"id":"W4400865631","doi":"","title":"Quantum Information Processing with industry-based Silicon devices and Dopants","year":2023,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut interdisciplinaire d'innovation technologique; Institut quantique; Université de Sherbrooke","funders":"","keywords":"Silicon; Dopant; Computer science; Optoelectronics; Materials science; Doping; Engineering physics; Engineering","score_opus":0.009631693189933331,"score_gpt":0.21603294984560106,"score_spread":0.20640125665566772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400865631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59337497,0.00008614815,0.39530605,0.0090254415,0.00004463205,0.00014343217,0.0000041522144,0.00053526665,0.0014798997],"genre_scores_gemma":[0.9607347,0.000009326867,0.03882006,0.00022524029,0.000008731403,0.000012275678,0.00003115576,0.000010282039,0.00014817447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814653,0.00069809885,0.00023528465,0.00031954996,0.00031316717,0.0002873908],"domain_scores_gemma":[0.9980137,0.00045668444,0.00020932905,0.0006168849,0.00057810865,0.00012529656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019461545,0.00015837423,0.0001418664,0.00021743747,0.00044671504,0.0006823717,0.00066159625,0.00010251012,0.0000039747965],"category_scores_gemma":[0.0002266071,0.00013470184,0.000029062738,0.00104268,0.00011042277,0.0006112773,0.00029330747,0.00030995332,0.000020739035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012348148,0.00016032816,0.012758755,0.00024555603,0.000025014368,0.000012416975,0.01627098,0.003137227,0.0008540679,0.047059976,0.00036317972,0.91910017],"study_design_scores_gemma":[0.00038586368,0.0000011266305,0.028784994,0.0005509484,0.0000047106673,0.000014448781,0.000090252186,0.96183926,0.0043057576,0.0006521957,0.0031734854,0.0001969627],"about_ca_topic_score_codex":0.00015730006,"about_ca_topic_score_gemma":0.00012301639,"teacher_disagreement_score":0.958702,"about_ca_system_score_codex":0.000018170205,"about_ca_system_score_gemma":0.0001702537,"threshold_uncertainty_score":0.6580126},"labels":[],"label_agreement":null},{"id":"W4400872115","doi":"10.1088/1751-8121/ad6653","title":"Quantum walks on blow-up graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Science and Engineering Research Board","keywords":"Quantum walk; Quantum; Mathematics; Combinatorics; Computer science; Physics; Quantum algorithm; Quantum mechanics","score_opus":0.007788696045023475,"score_gpt":0.2407512450208123,"score_spread":0.23296254897578883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400872115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45810694,0.0002615292,0.5363423,0.0036082373,0.0006682975,0.00006178001,0.0000017994855,0.00007410373,0.00087502523],"genre_scores_gemma":[0.9877419,0.000017410683,0.011743273,0.00016535044,0.00030346884,7.628304e-7,1.15365985e-7,0.000012130542,0.000015590282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877095,0.00006700103,0.00034031185,0.0001953461,0.00040400116,0.00022241187],"domain_scores_gemma":[0.9987929,0.00070346706,0.00006520515,0.0001981881,0.00005944476,0.00018078562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005172883,0.00015618202,0.00028871986,0.000080959704,0.000069145164,0.0002891662,0.00037990633,0.00005281627,0.00003563581],"category_scores_gemma":[0.00008089318,0.00009233808,0.0002004467,0.00023176808,0.00026949457,0.00012107098,0.00013218148,0.00048917154,0.000031947147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008524468,0.00010143126,5.125958e-7,0.00007126715,0.000037444275,0.000098059165,0.0004935236,0.000020702648,0.00011884453,0.94220185,0.00014288173,0.056704935],"study_design_scores_gemma":[0.000099360404,0.00025767897,0.0000039884335,0.00024385707,0.000014264304,0.00026059852,0.000007928081,0.37940422,0.00041744552,0.6191177,0.00009858684,0.00007438816],"about_ca_topic_score_codex":8.7066184e-8,"about_ca_topic_score_gemma":4.9582147e-9,"teacher_disagreement_score":0.52963495,"about_ca_system_score_codex":0.000008856978,"about_ca_system_score_gemma":0.000040473176,"threshold_uncertainty_score":0.37654376},"labels":[],"label_agreement":null},{"id":"W4400877210","doi":"10.1109/access.2024.3432330","title":"NISQ Computers: A Path to Quantum Supremacy","year":2024,"lang":"en","type":"article","venue":"IEEE Access","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; Path (computing); Quantum computer; Quantum; Parallel computing; Theoretical computer science; Computer network; Physics","score_opus":0.021036970562002152,"score_gpt":0.30440444664642236,"score_spread":0.2833674760844202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400877210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14728734,0.0003043829,0.8427182,0.0035268134,0.0046610553,0.00017996601,0.000005787383,0.000980975,0.00033549775],"genre_scores_gemma":[0.97061014,0.0000070648507,0.026843375,0.0016863815,0.00072313345,0.0000150159185,0.0000017493213,0.000025568856,0.00008758449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981447,0.000060972954,0.00024789287,0.00072825677,0.00035146295,0.00046674968],"domain_scores_gemma":[0.9987888,0.0002387157,0.00003208805,0.00067041675,0.000053568732,0.00021645367],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00024843283,0.00022388826,0.00020951129,0.0002524786,0.00015098951,0.0020071638,0.0024005747,0.000054318705,0.000011083068],"category_scores_gemma":[0.000019685827,0.00018529761,0.00011471601,0.0010492222,0.00002710792,0.00062595535,0.000695292,0.00026953605,0.00026958148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012620024,0.00017799657,0.0002538131,0.00039748417,0.000121031655,0.0012863576,0.0055257105,0.056333903,0.0017861704,0.07952413,0.105077945,0.74950284],"study_design_scores_gemma":[0.00010183674,0.00009036883,0.000572829,0.00024055035,0.0000046422388,0.00007499466,0.000003870809,0.9675635,0.0008874666,0.009853892,0.020313302,0.00029272685],"about_ca_topic_score_codex":0.00009249355,"about_ca_topic_score_gemma":0.0000054268708,"teacher_disagreement_score":0.9112296,"about_ca_system_score_codex":0.000035143294,"about_ca_system_score_gemma":0.00009637333,"threshold_uncertainty_score":0.99902886},"labels":[],"label_agreement":null},{"id":"W4400877627","doi":"10.1109/access.2024.3431540","title":"Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems","year":2024,"lang":"en","type":"article","venue":"IEEE Access","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science","keywords":"Simulated annealing; Quantum annealing; Computer science; Mathematical optimization; Stochastic optimization; Combinatorial optimization; Annealing (glass); Quantum; Quantum computer; Theoretical computer science; Algorithm; Materials science; Mathematics; Quantum mechanics; Physics","score_opus":0.02316529880778273,"score_gpt":0.29230154830256877,"score_spread":0.26913624949478604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400877627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024412405,0.000184343,0.9700259,0.0002264133,0.004472447,0.0003561149,0.000010299783,0.0002998562,0.000012226379],"genre_scores_gemma":[0.98370695,0.000002381995,0.015909765,0.000019860285,0.0003147602,0.000010677531,0.000010782004,0.000017019587,0.000007825349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988741,0.00003507454,0.00028679427,0.00035516187,0.00020514395,0.00024370762],"domain_scores_gemma":[0.99924946,0.00022091683,0.000097666794,0.00023130066,0.00015182966,0.000048807357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026606486,0.00013130519,0.00017060713,0.00016295967,0.0001326478,0.00036109053,0.0006575379,0.00007232952,0.0000016738568],"category_scores_gemma":[0.000038882696,0.000117674885,0.000078088844,0.00056218373,0.00003103856,0.0004438575,0.000117983436,0.00012154371,0.0000015718294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071963973,0.000028175014,0.0000026184703,0.00013316952,0.00001893777,0.0000015137916,0.00034739389,0.98563933,0.0004574378,0.0054802555,0.0001131648,0.0077708177],"study_design_scores_gemma":[0.00032635833,0.00012224335,0.000008650662,0.0002043675,0.0000118613425,0.0000043055234,0.0000023330279,0.98633677,0.0008579348,0.011930231,0.000055763696,0.00013916302],"about_ca_topic_score_codex":0.00004222148,"about_ca_topic_score_gemma":7.4052093e-7,"teacher_disagreement_score":0.9592945,"about_ca_system_score_codex":0.000026244175,"about_ca_system_score_gemma":0.00007932889,"threshold_uncertainty_score":0.47986424},"labels":[],"label_agreement":null},{"id":"W4401024415","doi":"10.1103/prxquantum.5.030317","title":"Effect of Nonunital Noise on Random-Circuit Sampling","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Air Force Office of Scientific Research; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Noise (video); Electronic circuit; Mathematics; Distribution (mathematics); Sampling (signal processing); Statistical physics; Computer science; Physics; Mathematical analysis; Quantum mechanics; Telecommunications; Artificial intelligence","score_opus":0.013652622743499827,"score_gpt":0.2686046392942671,"score_spread":0.25495201655076727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401024415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5756907,0.0008209621,0.41966608,0.00033223187,0.0017374926,0.00024998444,0.0000072290763,0.00049544516,0.000999906],"genre_scores_gemma":[0.9978788,0.000008426754,0.0017468622,0.000062149615,0.00021534144,0.000009716218,0.0000022131196,0.00002027117,0.000056250992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845636,0.00016426793,0.0002622702,0.00045365482,0.00034034313,0.000323079],"domain_scores_gemma":[0.99799275,0.0013578515,0.000055215765,0.00047323096,0.000031507217,0.000089422334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008492491,0.00021089824,0.00030052508,0.00021575605,0.00010506526,0.00018454618,0.00064578524,0.00006198896,0.0000090740605],"category_scores_gemma":[0.00012811276,0.00015404628,0.00019269019,0.0004956816,0.000048443453,0.00012755489,0.00017228413,0.0003262471,0.000107706735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016042277,0.00013831182,0.00012540593,0.0009663491,0.00014299394,0.00021442834,0.0025157642,0.015564497,0.008326849,0.19442183,0.0006784291,0.7767447],"study_design_scores_gemma":[0.00071258744,0.0010224095,0.00016850811,0.0004148033,0.000017517646,0.000050978735,0.0000032973244,0.9808661,0.0074097277,0.00702287,0.0020805164,0.00023073319],"about_ca_topic_score_codex":0.000015417356,"about_ca_topic_score_gemma":2.9760318e-7,"teacher_disagreement_score":0.9653016,"about_ca_system_score_codex":0.00002123482,"about_ca_system_score_gemma":0.00005079713,"threshold_uncertainty_score":0.62818253},"labels":[],"label_agreement":null},{"id":"W4401030971","doi":"10.1145/3674151","title":"ARQUIN: Architectures for Multinode Superconducting Quantum Computers","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Quantum Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Lawrence Berkeley National Laboratory; Office of Science; National Energy Research Scientific Computing Center; U.S. Department of Energy","keywords":"Computer science; Quantum entanglement; Quantum computer; Scalability; Modular design; Computer engineering; Compiler; Software; Context (archaeology); Construct (python library); Quantum; Computer architecture; Quantum technology; Physics; Quantum mechanics; Computer network; Open quantum system; Programming language","score_opus":0.02631370093592012,"score_gpt":0.28226193523350473,"score_spread":0.2559482342975846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401030971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25696477,0.00046930579,0.73311734,0.0028586036,0.0040868656,0.00047705453,0.000023778113,0.001973825,0.000028437118],"genre_scores_gemma":[0.7835243,0.0000073763135,0.21526399,0.0005306547,0.0005211291,0.000026624415,0.000007550165,0.00008337929,0.00003501593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956768,0.0002089325,0.00080582633,0.0015950394,0.0005436772,0.0011697281],"domain_scores_gemma":[0.9946448,0.0034073624,0.00012741155,0.0014150406,0.00012894363,0.0002764075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009128434,0.00066138397,0.0005655028,0.00074786175,0.0012596814,0.00093097653,0.0022227494,0.0001975116,0.000013088962],"category_scores_gemma":[0.00012333038,0.0006054705,0.00061600347,0.0011111517,0.00014056689,0.00022241456,0.00013019728,0.0011567103,0.00006771218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022611486,0.00016526986,0.000013412404,0.00027076845,0.00018399964,0.00006549744,0.0040085725,0.3831446,0.0015856385,0.011390246,0.00028447926,0.5988649],"study_design_scores_gemma":[0.0005335025,0.00040994457,0.00007042556,0.000581691,0.000037998132,0.00028615983,0.00014946183,0.9786797,0.002712144,0.013923959,0.0018882722,0.00072671345],"about_ca_topic_score_codex":0.00007106741,"about_ca_topic_score_gemma":0.0000051111956,"teacher_disagreement_score":0.5981382,"about_ca_system_score_codex":0.0001131757,"about_ca_system_score_gemma":0.0001706117,"threshold_uncertainty_score":0.9996397},"labels":[],"label_agreement":null},{"id":"W4401160501","doi":"10.1088/2058-9565/ad69bc","title":"A differentiable quantum phase estimation algorithm","year":2024,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Università degli Studi di Padova; Ministero dell’Istruzione, dell’Università e della Ricerca; European Commission; Dipartimenti di Eccellenza","keywords":"Differentiable function; Algorithm; Phase (matter); Estimation; Quantum; Quantum phase estimation algorithm; Computer science; Quantum algorithm; Mathematics; Physics; Quantum error correction; Pure mathematics; Quantum mechanics; Engineering","score_opus":0.007683559143226941,"score_gpt":0.26896569672672727,"score_spread":0.26128213758350033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401160501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24859585,0.0012876202,0.74229,0.0053744805,0.0007494411,0.00014352283,0.0000040048853,0.0014550027,0.00010003364],"genre_scores_gemma":[0.92507285,0.00004968762,0.07464609,0.000093466064,0.000052456766,0.000018242186,0.000001550539,0.000011624457,0.000054013202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770504,0.000020689704,0.00025074527,0.00091368594,0.000491837,0.0006179812],"domain_scores_gemma":[0.99900484,0.00008019577,0.00005209008,0.0005797314,0.00014987697,0.00013325714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070559594,0.00021013066,0.00021284858,0.0012063849,0.00056585803,0.0007478017,0.0012148991,0.00012000233,0.000006462654],"category_scores_gemma":[0.000108669505,0.00016756722,0.00003570619,0.004152183,0.0008797499,0.0007147752,0.0006143489,0.00036619927,0.000057157893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.2518345e-7,0.00004302454,0.000005217404,0.000016113434,0.000005066523,0.000044388933,0.00013145484,0.000017976334,0.00390962,0.42456234,0.00016716387,0.57109714],"study_design_scores_gemma":[0.00018868067,0.0002778788,0.000024615674,0.000064525746,0.0000056836525,0.00026428097,0.000030143437,0.8470097,0.004176178,0.14382747,0.00393933,0.0001915086],"about_ca_topic_score_codex":0.000016365248,"about_ca_topic_score_gemma":7.113591e-7,"teacher_disagreement_score":0.8469917,"about_ca_system_score_codex":0.000048965027,"about_ca_system_score_gemma":0.00031453263,"threshold_uncertainty_score":0.7211069},"labels":[],"label_agreement":null},{"id":"W4401161503","doi":"10.1587/transinf.2023lop0011","title":"Geometric Refactoring of Quantum and Reversible Circuits Using Graph Algorithms","year":2024,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Qubit; Algorithm; Quantum circuit; Quantum computer; Quantum gate; Quantum algorithm; Quantum; Graph; Theoretical computer science; Quantum error correction","score_opus":0.02258909350059323,"score_gpt":0.24814131644318682,"score_spread":0.22555222294259358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401161503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046053957,0.00072344235,0.951623,0.00006112963,0.0010840383,0.0001316395,0.000015156835,0.00014361434,0.0001640107],"genre_scores_gemma":[0.9975142,0.00012097588,0.0022823429,0.000020548987,0.000027413256,0.0000037007205,0.0000012699221,0.000004743946,0.000024800544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990772,0.000035370293,0.000348186,0.00015356476,0.00023678652,0.00014888009],"domain_scores_gemma":[0.9994841,0.00012103734,0.00008339496,0.00017040374,0.00006553096,0.00007548868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033386503,0.00011510178,0.00015625272,0.000836181,0.00020662221,0.0003631292,0.00012959643,0.00006238823,0.0000017636188],"category_scores_gemma":[0.00000642264,0.000100056954,0.000046042616,0.0010375994,0.000030645613,0.0010742287,0.000007949978,0.00017236178,0.0000043370096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072341463,0.000052871757,0.00006416026,0.0021454936,0.000160879,0.000008974311,0.010376929,0.2059267,0.0005692617,0.022056751,0.00007431936,0.7585564],"study_design_scores_gemma":[0.00014199424,0.00007235202,0.00015414676,0.00026671862,0.000010929861,0.00011620634,0.00027449414,0.99674594,0.00022624645,0.00010998223,0.0017621077,0.00011886605],"about_ca_topic_score_codex":0.00017520347,"about_ca_topic_score_gemma":5.8394465e-7,"teacher_disagreement_score":0.95146024,"about_ca_system_score_codex":0.000026107318,"about_ca_system_score_gemma":0.000040278326,"threshold_uncertainty_score":0.4080204},"labels":[],"label_agreement":null},{"id":"W4401205799","doi":"10.1088/2058-9565/ad6a36","title":"A square-root speedup for finding the smallest eigenvalue","year":2024,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Algorithm; Computer science; Artificial intelligence","score_opus":0.016173311836135844,"score_gpt":0.27194472243618056,"score_spread":0.2557714106000447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401205799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6408285,0.0024836592,0.3106202,0.04279504,0.0015796061,0.0004539657,0.0000049947967,0.0009608623,0.00027317659],"genre_scores_gemma":[0.9869807,0.000019724543,0.012625127,0.00016338263,0.00010222979,0.000032526914,3.3917422e-7,0.000009033281,0.00006696308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817646,0.0000152532475,0.00018721205,0.0007246115,0.00031696112,0.00057951245],"domain_scores_gemma":[0.99895644,0.00024776405,0.000042839696,0.00055627513,0.00012633573,0.0000703435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012630841,0.00015945603,0.00014843227,0.0005934426,0.00095462974,0.0006177389,0.0017384953,0.000093137074,0.0000023904504],"category_scores_gemma":[0.00023736816,0.00010031047,0.000046411827,0.002911196,0.001034837,0.000204324,0.0006090916,0.0002951781,0.000017847757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.083259e-7,0.000009513714,0.00012145081,0.000020526551,0.000005823816,0.000016803182,0.00036450117,0.000037101137,0.0031618867,0.8544858,0.00031211448,0.14146353],"study_design_scores_gemma":[0.00009346862,0.00024178733,0.00032248316,0.000064707754,0.000005890328,0.00026438426,0.00012032068,0.80853975,0.003255428,0.16805504,0.018855363,0.0001813703],"about_ca_topic_score_codex":0.000013573079,"about_ca_topic_score_gemma":0.000009697207,"teacher_disagreement_score":0.8085027,"about_ca_system_score_codex":0.00003612116,"about_ca_system_score_gemma":0.00032365427,"threshold_uncertainty_score":0.7342337},"labels":[],"label_agreement":null},{"id":"W4401243900","doi":"10.1117/12.3027035","title":"A reconfigurable multi-user quantum network with ground to space link","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Satellite; Multiplexing; Topology (electrical circuits); Network topology; Link (geometry); Key (lock); Ground segment; Communications satellite; Computer network; Point (geometry); Scheme (mathematics); Telecommunications; Electrical engineering; Physics; Engineering; Mathematics","score_opus":0.013020934198537053,"score_gpt":0.23925894955033156,"score_spread":0.2262380153517945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401243900","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010682359,0.00043992163,0.9707334,0.0129477475,0.001098001,0.00021796094,0.000001028938,0.0010557491,0.002823833],"genre_scores_gemma":[0.2489207,0.000013006877,0.7261871,0.0021941715,0.0010891126,0.000025467192,0.0000019568195,0.000052353294,0.021516152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831414,0.00004993737,0.00017739824,0.0006765983,0.00023118331,0.00055076485],"domain_scores_gemma":[0.9989864,0.0001544565,0.000024871111,0.00056621485,0.000050910934,0.00021709684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003264483,0.00021878531,0.00019129187,0.00010795755,0.00018100464,0.0007966427,0.00067717495,0.00006221342,0.000040518407],"category_scores_gemma":[0.000011819059,0.00014776501,0.00006479567,0.0010220979,0.000025381947,0.000220063,0.00015935942,0.00031585208,0.00036850918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020244795,0.00007241521,0.0001314725,0.00009510457,0.0001242378,0.00044801764,0.0025613406,0.1426509,0.00037692903,0.5831066,0.04012369,0.23028907],"study_design_scores_gemma":[0.0001345202,0.00022240018,0.0004518267,0.00019097028,0.0000049365694,0.000094180585,0.000014625072,0.8074262,0.00016215262,0.002185675,0.18882677,0.00028571335],"about_ca_topic_score_codex":0.00015364155,"about_ca_topic_score_gemma":0.00007172036,"teacher_disagreement_score":0.6647753,"about_ca_system_score_codex":0.000028326212,"about_ca_system_score_gemma":0.000099521436,"threshold_uncertainty_score":0.76820433},"labels":[],"label_agreement":null},{"id":"W4401331420","doi":"10.1103/prxquantum.5.037001","title":"Quantum Computing for High-Energy Physics: State of the Art and Challenges","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; York University","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; HORIZON EUROPE Framework Programme; QuantERA; Centre for Quantum Technologies; Helmholtz-Gemeinschaft; Eusko Jaurlaritza; CERN; Deutsche Forschungsgemeinschaft; Agencia Estatal de Investigación; Fundação para a Ciência e a Tecnologia; University of Tokyo; European Regional Development Fund; European Commission","keywords":"Quantum computer; Computer science; Qubit; Large Hadron Collider; Computational science; Computer engineering; Physics; Quantum; Theoretical computer science; Quantum mechanics","score_opus":0.01996030046430071,"score_gpt":0.23680136742770264,"score_spread":0.21684106696340194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401331420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05461807,0.008028081,0.92943525,0.005741683,0.0016275938,0.00018687146,0.000016195672,0.0002702837,0.00007596357],"genre_scores_gemma":[0.98978007,0.00035550998,0.009364548,0.00012471335,0.00026383033,0.000008384223,0.0000019316922,0.000025130163,0.000075906006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985172,0.00008655099,0.00028765714,0.0005111077,0.00024735308,0.00035011824],"domain_scores_gemma":[0.99881667,0.00047434546,0.00011113948,0.00046628283,0.00006905192,0.000062493295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003805356,0.00020502001,0.00026003388,0.00006718864,0.00018861622,0.0001619322,0.00065126445,0.000040689836,6.2658097e-7],"category_scores_gemma":[0.000030452837,0.00013891891,0.00012033038,0.00028602683,0.00010738073,0.0001402515,0.0004657896,0.00017351341,0.0000037506063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031396369,0.000026144788,0.000008808014,0.00023056964,0.000035557518,0.0000032746077,0.0009308751,0.0013763914,0.00016676159,0.734311,0.000358428,0.26254907],"study_design_scores_gemma":[0.00011691573,0.00010150955,0.0005380292,0.0001846548,0.0000080051905,0.00001322693,0.000012334039,0.6892984,0.0008424192,0.30334833,0.0053994935,0.00013667406],"about_ca_topic_score_codex":0.000027492724,"about_ca_topic_score_gemma":0.0000063610005,"teacher_disagreement_score":0.93516195,"about_ca_system_score_codex":0.000013516098,"about_ca_system_score_gemma":0.00006865482,"threshold_uncertainty_score":0.56649494},"labels":[],"label_agreement":null},{"id":"W4401429436","doi":"10.1088/2058-9565/ad692c","title":"Optimal and robust quantum state tomography of star-topology register","year":2024,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Anhui Province; National Natural Science Foundation of China","keywords":"Topology (electrical circuits); Quantum tomography; Computer science; Quantum state; Robustness (evolution); POVM; Controllability; Hilbert space; Quantum; Algorithm; Parameterized complexity; Quantum process; Mathematics; Physics; Quantum mechanics; Quantum dynamics; Applied mathematics; Pure mathematics","score_opus":0.009549376745331238,"score_gpt":0.23733284190761592,"score_spread":0.22778346516228468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401429436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91699433,0.0032213526,0.07221394,0.0064318925,0.00046680958,0.00012897,0.000005669599,0.00045483647,0.00008216556],"genre_scores_gemma":[0.97125316,0.00019074148,0.028394902,0.00008913155,0.000023266379,0.000006466352,3.7290675e-7,0.000009940661,0.000031996253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978421,0.000031088293,0.0003114631,0.00089323125,0.00034413004,0.0005780041],"domain_scores_gemma":[0.9989431,0.0001124912,0.00008866785,0.00056703493,0.00017175238,0.000116937845],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00084023824,0.00020353492,0.000293512,0.0014215736,0.00028636938,0.00022712718,0.0010145742,0.00012247615,0.0000026658045],"category_scores_gemma":[0.00008749133,0.00016221823,0.000039120783,0.0031997229,0.0032083404,0.0003907044,0.0008536455,0.000356503,0.0000038257344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007679442,0.000049184993,0.0008077275,0.00011801262,0.000027053067,0.00014881449,0.0011049099,0.00021732072,0.0111499075,0.849242,0.0002337431,0.13689369],"study_design_scores_gemma":[0.00016122437,0.00077362644,0.00077199156,0.000095494805,0.000008057676,0.00048740138,0.00015295602,0.9157369,0.0039814743,0.07508506,0.0024876327,0.00025815406],"about_ca_topic_score_codex":0.00005121511,"about_ca_topic_score_gemma":0.000006653855,"teacher_disagreement_score":0.9155196,"about_ca_system_score_codex":0.000016844308,"about_ca_system_score_gemma":0.00022223998,"threshold_uncertainty_score":0.9995043},"labels":[],"label_agreement":null},{"id":"W4401448033","doi":"10.1088/1751-8121/ad6daf","title":"Training quantum neural networks using the quantum information bottleneck method","year":2024,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Google; U.S. Department of Energy","keywords":"Bottleneck; Artificial neural network; Quantum; Computer science; Artificial intelligence; Physics; Embedded system; Quantum mechanics","score_opus":0.02005916225170132,"score_gpt":0.2848385199932427,"score_spread":0.2647793577415414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401448033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052980058,0.00023454682,0.9445206,0.001689535,0.00039692712,0.000061973726,0.0000011082727,0.00003859698,0.00007667604],"genre_scores_gemma":[0.9172884,0.000008538618,0.08199532,0.00020813479,0.00048798858,7.8610594e-7,2.596311e-7,0.000009507686,0.0000010417931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998563,0.00016575585,0.00050631765,0.00012760887,0.00036758065,0.00026976052],"domain_scores_gemma":[0.9983675,0.0010903818,0.00014412278,0.00018475954,0.000084263025,0.00012897818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013279589,0.0001622646,0.00029723384,0.00005984433,0.00015507302,0.00060160947,0.00043755572,0.000059567414,0.000007779371],"category_scores_gemma":[0.00011531126,0.00008540475,0.00018463394,0.00029557827,0.00023939097,0.0004944375,0.00018452281,0.0006059457,0.0000025850077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052436126,0.00002009774,3.7903123e-7,0.000044898916,0.000033059925,0.000017347602,0.0019509075,0.008789578,0.000030118666,0.8941942,0.000017186916,0.09489699],"study_design_scores_gemma":[0.000056696495,0.00006869968,0.0000020688221,0.00010332815,0.000021970955,0.00055129384,0.000069118156,0.5218847,0.000020580706,0.47710732,0.00005421953,0.00006003297],"about_ca_topic_score_codex":4.669739e-7,"about_ca_topic_score_gemma":1.0073808e-8,"teacher_disagreement_score":0.86430836,"about_ca_system_score_codex":0.000013448912,"about_ca_system_score_gemma":0.000056326666,"threshold_uncertainty_score":0.5801334},"labels":[],"label_agreement":null},{"id":"W4401460213","doi":"10.4204/eptcs.406.1","title":"A Sound and Complete Equational Theory for 3-Qubit Toffoli-Hadamard Circuits","year":2024,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Simon Fraser University","funders":"","keywords":"Toffoli gate; Hadamard transform; Arithmetic; Qubit; Computer science; Mathematics; Physics; Quantum gate; Quantum; Quantum mechanics","score_opus":0.00939213605732696,"score_gpt":0.2490098491788436,"score_spread":0.23961771312151664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401460213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047740493,0.00066995685,0.9478384,0.0018840028,0.00045618837,0.0004010397,0.0000031512586,0.00031655154,0.0006901841],"genre_scores_gemma":[0.95688486,0.0000105677445,0.042276237,0.00047166232,0.00029505053,0.000032382297,9.3072083e-7,0.00001761827,0.000010677331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965809,0.000033858465,0.00034502233,0.001248631,0.0006102446,0.0011813447],"domain_scores_gemma":[0.9983769,0.0009773324,0.000054329463,0.00023045814,0.0001670408,0.00019391609],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034264484,0.0002765135,0.00026705157,0.00043967072,0.0004414493,0.0014187943,0.0016567371,0.0000752923,0.0000073498923],"category_scores_gemma":[0.00023457849,0.0002323819,0.00008382995,0.0014998341,0.001308597,0.00068727206,0.0007517694,0.00050680025,0.000008713895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071438885,0.000023526107,0.000014650342,0.000047387945,0.00000840704,0.0000041279322,0.0007659346,0.00011694713,0.0004715005,0.8982448,0.000020290698,0.10027529],"study_design_scores_gemma":[0.00014151516,0.0002034502,0.00010252678,0.000055952056,0.0000033013928,0.00009083636,0.000004028333,0.49911454,0.00017481663,0.49961463,0.00032921575,0.00016518559],"about_ca_topic_score_codex":9.329722e-7,"about_ca_topic_score_gemma":5.8945164e-7,"teacher_disagreement_score":0.9091444,"about_ca_system_score_codex":0.0001927667,"about_ca_system_score_gemma":0.00035853166,"threshold_uncertainty_score":0.9996178},"labels":[],"label_agreement":null},{"id":"W4401548439","doi":"10.1016/j.dib.2024.110789","title":"QF-LCA dataset: Quantum Field Lens Coding Algorithm for system state simulation and strong predictions","year":2024,"lang":"en","type":"article","venue":"Data in Brief","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Victoria","keywords":"Coding (social sciences); Algorithm; Computer science; Lens (geology); Field (mathematics); Quantum; Through-the-lens metering; State (computer science); Mathematics; Optics; Physics; Statistics; Quantum mechanics","score_opus":0.03746899776755722,"score_gpt":0.3072662405696709,"score_spread":0.26979724280211365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401548439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012517474,0.0003206791,0.98852736,0.0004989506,0.00074784947,0.00025101958,0.008152217,0.00023317647,0.000016979044],"genre_scores_gemma":[0.8506893,0.00004417759,0.14210826,0.00029789464,0.00057543017,0.000032652395,0.006178051,0.000036749352,0.000037510825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986868,0.00004326342,0.0002528496,0.0006099462,0.00015908867,0.00024807866],"domain_scores_gemma":[0.9984777,0.00061994535,0.000042562675,0.00077412935,0.000020596233,0.000065049535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047384802,0.0001268881,0.00014204689,0.000133697,0.00016615452,0.00043064237,0.0006357072,0.000045215867,0.0000013426978],"category_scores_gemma":[0.00007030104,0.00011929408,0.000018675672,0.00025164324,0.000023634711,0.00075040176,0.00060869055,0.00019057235,0.000003233913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008508186,0.00005238063,0.00007957975,0.00049965084,0.00007010456,0.000101092555,0.0007714685,0.08599423,0.00003170806,0.038314335,0.016266616,0.8578103],"study_design_scores_gemma":[0.00017557754,0.000066236265,0.00013494732,0.00021920953,0.00000880646,0.000024154038,0.000023649021,0.949486,0.000012543171,0.0002502441,0.049473073,0.00012554608],"about_ca_topic_score_codex":0.00017666219,"about_ca_topic_score_gemma":0.000026477006,"teacher_disagreement_score":0.8634918,"about_ca_system_score_codex":0.000028871938,"about_ca_system_score_gemma":0.00005825419,"threshold_uncertainty_score":0.48646715},"labels":[],"label_agreement":null},{"id":"W4401568511","doi":"10.1109/tcomm.2024.3443737","title":"Counterfactual Quantum Protocols for Dialogue, Teleportation, and Comparison","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Queen's University; Kyung Hee University; Queen's University Belfast","keywords":"Teleportation; Quantum teleportation; Computer science; Quantum channel; Superdense coding; Counterfactual thinking; Quantum; Quantum entanglement; Electronic engineering; Computer network; Telecommunications; Physics; Quantum mechanics; Engineering; Psychology","score_opus":0.047096189818737665,"score_gpt":0.34189919099485916,"score_spread":0.2948030011761215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401568511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001490017,0.0002532047,0.99087095,0.0036055406,0.0003513382,0.0027613179,0.000059116413,0.0004917267,0.00011677191],"genre_scores_gemma":[0.930574,0.000043863536,0.06559639,0.000121048506,0.000036443693,0.0034834244,0.000010412322,0.000019522953,0.00011492451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988973,0.00007935546,0.00033661767,0.00033334957,0.00015393994,0.00019939663],"domain_scores_gemma":[0.997809,0.00084036414,0.00005860298,0.0011199573,0.00009281476,0.00007923824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025921015,0.00015564673,0.00016992514,0.0001788838,0.0006344608,0.00040223316,0.00087215396,0.000064661566,0.000004259494],"category_scores_gemma":[0.000009434951,0.00014356257,0.00008707728,0.0003534936,0.00012077081,0.00023976424,0.000010782423,0.00034558718,0.00001955862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038354017,0.0010802515,0.0000256033,0.00030552445,0.0002602989,0.000005961881,0.009589669,0.044500247,0.0015965886,0.13073774,0.0046718903,0.80718786],"study_design_scores_gemma":[0.00019551102,0.00019753381,0.000062618914,0.00011992975,0.000016702483,0.00002002192,0.000046172478,0.9603164,0.0010673475,0.005379568,0.03240497,0.00017318253],"about_ca_topic_score_codex":0.000025407018,"about_ca_topic_score_gemma":0.00005900939,"teacher_disagreement_score":0.92908394,"about_ca_system_score_codex":0.000030702366,"about_ca_system_score_gemma":0.00010415721,"threshold_uncertainty_score":0.58543116},"labels":[],"label_agreement":null},{"id":"W4401597033","doi":"10.1145/3674625","title":"How to Bake a Quantum Π","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Morphism; Unitary state; Categorical variable; Property (philosophy); Quantum; Construct (python library); Layering; Pure mathematics; Rotation (mathematics); Computer science; Mathematics; Algorithm; Algebra over a field; Programming language; Geometry; Physics; Quantum mechanics","score_opus":0.011010964300566608,"score_gpt":0.255551729874872,"score_spread":0.2445407655743054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401597033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8986163,0.0014005402,0.007179162,0.08891603,0.0010860622,0.0007088735,0.000004880009,0.0014619152,0.00062619906],"genre_scores_gemma":[0.8856954,0.000002865429,0.11318498,0.00026508133,0.000184591,0.00002588507,2.3024147e-7,0.000021366413,0.0006196191],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986547,0.000007349561,0.00014850314,0.00045018425,0.00039280878,0.00034645086],"domain_scores_gemma":[0.9990952,0.00010905487,0.00006789243,0.00055497244,0.00008733261,0.000085545355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035291343,0.00017768014,0.00016340481,0.0001593056,0.00012254098,0.0009447791,0.0032406526,0.000049383034,0.0000010425777],"category_scores_gemma":[0.00080708414,0.00010805267,0.0001404337,0.0009056842,0.000045429715,0.0001810871,0.0014572352,0.00026330445,0.000010104909],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007298319,0.00006798488,0.00020396472,0.00038828768,0.000050442235,0.000012764889,0.005630204,0.00004001426,0.0109828245,0.12314801,0.005554463,0.8539137],"study_design_scores_gemma":[0.0008275211,0.0029448874,0.0047356095,0.006733625,0.00012509167,0.0004991678,0.0038046497,0.18071795,0.2520553,0.10077681,0.44442222,0.0023571937],"about_ca_topic_score_codex":0.000010413898,"about_ca_topic_score_gemma":5.7171013e-7,"teacher_disagreement_score":0.85155654,"about_ca_system_score_codex":0.000021169753,"about_ca_system_score_gemma":0.00002457205,"threshold_uncertainty_score":0.91105264},"labels":[],"label_agreement":null},{"id":"W4401628819","doi":"10.1007/978-3-031-68391-6_3","title":"Quantum Lattice Enumeration in Limited Depth","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Zurich Information Security and Privacy Center; Fundação para a Ciência e a Tecnologia; NOVA Laboratory for Computer Science and Informatics; Agence Nationale de la Recherche; Government of Canada","keywords":"Enumeration; Computer science; Lattice (music); Quantum; Theoretical computer science; Discrete mathematics; Quantum mechanics; Physics; Mathematics","score_opus":0.016066985763121218,"score_gpt":0.24822265255740783,"score_spread":0.23215566679428662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401628819","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081639877,0.0012597106,0.98870385,0.002156442,0.003423441,0.00038259552,0.000004388298,0.00037327432,0.0028798794],"genre_scores_gemma":[0.47019964,0.000112812,0.52409077,0.0027139117,0.001641284,0.000020123185,0.000018692075,0.00013255043,0.0010701779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99524367,0.000053062064,0.0007209365,0.0020803963,0.0010336338,0.0008682809],"domain_scores_gemma":[0.9974686,0.00064354116,0.00021489094,0.0013392457,0.00015286237,0.00018085714],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010938242,0.0006730137,0.0006067761,0.001734225,0.00020884874,0.0010508943,0.0029204683,0.00040329038,0.000009800729],"category_scores_gemma":[0.00010119631,0.0006041693,0.00016447573,0.0015080161,0.00038047272,0.00047236955,0.0015235143,0.0017987668,0.00013527469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052927326,0.00004271566,0.00004545586,0.00009392887,0.000013772433,0.0005159082,0.0016513934,0.16633217,0.00010343874,0.111384995,0.000024364597,0.7197866],"study_design_scores_gemma":[0.00015169264,0.00011630545,0.00015602222,0.0006299162,0.000005557024,0.00009505358,1.2670304e-7,0.7447306,0.00018915822,0.2519386,0.0014631863,0.000523751],"about_ca_topic_score_codex":0.000057371723,"about_ca_topic_score_gemma":0.00026533412,"teacher_disagreement_score":0.71926284,"about_ca_system_score_codex":0.00031979653,"about_ca_system_score_gemma":0.0005142921,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null},{"id":"W4401693477","doi":"10.1109/isit57864.2024.10619505","title":"Quantum Codes Derived from One-Generator Quasi-Twisted Codes","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Generator (circuit theory); Quantum; Physics; Quantum mechanics; Power (physics)","score_opus":0.0193090352586172,"score_gpt":0.24793151962530205,"score_spread":0.22862248436668486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401693477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3084638,0.0013491205,0.6849694,0.0023644103,0.0010611984,0.000094106224,0.00002764799,0.0013023067,0.00036797248],"genre_scores_gemma":[0.86026555,0.000034683566,0.13815151,0.000800834,0.00042589664,0.000008691508,0.000026895592,0.000024653693,0.0002612839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803513,0.00012482182,0.00030632384,0.0007665316,0.0003582023,0.00040901662],"domain_scores_gemma":[0.9987411,0.00036031156,0.000042825897,0.00062747695,0.00005959275,0.00016870875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022710909,0.00025868695,0.00029013652,0.00013262274,0.00019756693,0.00086455216,0.0009261322,0.00009687627,0.00007680645],"category_scores_gemma":[0.000033491808,0.00020658755,0.00013401467,0.00051091606,0.00007157026,0.00022157205,0.00035907942,0.00028665725,0.00027189445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024446994,0.0005764104,0.000265792,0.00016192636,0.0005823661,0.0005465009,0.0067448113,0.004868301,0.14802095,0.45297572,0.014056313,0.37117645],"study_design_scores_gemma":[0.00015083363,0.00010442416,0.00058605534,0.000096147094,0.000012307887,0.000014848102,0.0000307167,0.9633794,0.014285204,0.013264365,0.007749299,0.0003264187],"about_ca_topic_score_codex":0.00052165793,"about_ca_topic_score_gemma":0.00007069677,"teacher_disagreement_score":0.95851105,"about_ca_system_score_codex":0.00003364132,"about_ca_system_score_gemma":0.00012256006,"threshold_uncertainty_score":0.84243953},"labels":[],"label_agreement":null},{"id":"W4401722424","doi":"10.1088/1402-4896/ad71ff","title":"Periodicity of bipartite walk on biregular graphs with conditional spectra","year":2024,"lang":"en","type":"article","venue":"Physica Scripta","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Bipartite graph; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Unitary state; Random walk; Discrete mathematics; Algebraic number; Edge-transitive graph; Self-avoiding walk; Spectrum (functional analysis); Quantum; Graph; Voltage graph; Line graph; Physics; Quantum algorithm; Quantum mechanics; Mathematical analysis","score_opus":0.00850196001952205,"score_gpt":0.2196168432337373,"score_spread":0.21111488321421526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401722424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7037371,0.0005583096,0.28193513,0.008509688,0.0014770429,0.00030300854,0.00009128478,0.0008883761,0.0025000738],"genre_scores_gemma":[0.99193776,0.000002824026,0.0075636213,0.00019573905,0.00015145849,0.000005678791,0.0000069819444,0.00001212671,0.00012380535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883467,0.0000347999,0.00013275645,0.0004034496,0.00037157064,0.00022275427],"domain_scores_gemma":[0.999418,0.00003517501,0.00004127913,0.00039536908,0.00004080313,0.000069340225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085474065,0.00015187006,0.00017370122,0.00012663321,0.00010455456,0.0001443051,0.00042915207,0.00002183556,0.000010828111],"category_scores_gemma":[0.000004437346,0.00010949185,0.0001047846,0.0005787211,0.00014363653,0.00015844019,0.00007876753,0.00018893692,0.00003237802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001395961,0.00019891182,0.000058667756,0.0000768171,0.000095557654,0.000075196935,0.0010395923,0.001797359,0.008690145,0.96500677,0.005406029,0.017541004],"study_design_scores_gemma":[0.00028523058,0.0007462525,0.006789851,0.00031066168,0.00002205159,0.000042972082,0.000014506017,0.819499,0.019023886,0.12960014,0.02330708,0.0003583759],"about_ca_topic_score_codex":0.00002376462,"about_ca_topic_score_gemma":0.0000015916953,"teacher_disagreement_score":0.8354066,"about_ca_system_score_codex":0.000013485958,"about_ca_system_score_gemma":0.00006713991,"threshold_uncertainty_score":0.44649482},"labels":[],"label_agreement":null},{"id":"W4401729673","doi":"10.7759/cureus.67486","title":"Revolutionizing Healthcare: The Emerging Role of Quantum Computing in Enhancing Medical Technology and Treatment","year":2024,"lang":"en","type":"review","venue":"Cureus","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum computer; Health care; Computer science; Personalized medicine; Data science; Big data; Precision medicine; Safeguarding; Medicine; Quantum; Bioinformatics; Data mining; Nursing","score_opus":0.021520190164889198,"score_gpt":0.322349895265613,"score_spread":0.30082970510072377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401729673","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013697278,0.98424,0.013143253,0.0014396426,0.0005398213,0.0003205043,0.000002686594,0.00015437642,0.000022718894],"genre_scores_gemma":[0.002944785,0.99304074,0.0037159186,0.000023543065,0.00022087648,0.000018061504,0.0000025831218,0.000025874022,0.0000076040083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763757,0.00021864992,0.00077660254,0.000635457,0.00030396626,0.00042776723],"domain_scores_gemma":[0.99869156,0.00031562097,0.0002830298,0.0005927455,0.00003257944,0.00008449453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007630092,0.0003480564,0.0010577556,0.0004337577,0.00017919824,0.00006542975,0.00096974114,0.00030906082,0.000001221016],"category_scores_gemma":[0.0001147072,0.00020939647,0.00018270231,0.001450541,0.00012023354,0.000043285774,0.0009045455,0.00078942644,0.0000049921596],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.697024e-7,0.000018950437,0.0000049535256,0.0014312314,0.000043092372,0.000033318895,0.00066330447,0.0000141587,4.493528e-7,0.035476297,0.000009418829,0.96230465],"study_design_scores_gemma":[0.00013940947,0.00020688454,0.0000052639243,0.03180297,0.00013920374,0.0006981081,0.0001687126,0.49530765,0.0000037481009,0.007892151,0.46322137,0.00041452298],"about_ca_topic_score_codex":0.00026026575,"about_ca_topic_score_gemma":0.00014139223,"teacher_disagreement_score":0.9618901,"about_ca_system_score_codex":0.00019782671,"about_ca_system_score_gemma":0.0005135344,"threshold_uncertainty_score":0.853894},"labels":[],"label_agreement":null},{"id":"W4401752670","doi":"10.1109/nano61778.2024.10628658","title":"An Efficient Simulated Oscillator-Based Ising Machine on FPGAs","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Field-programmable gate array; Computer science; Ising model; Parallel computing; Embedded system; Physics; Statistical physics","score_opus":0.008193570629048394,"score_gpt":0.25908919132565267,"score_spread":0.25089562069660426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401752670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33773002,0.0001313789,0.6579561,0.0011958696,0.0007198008,0.000085952284,0.000002473935,0.0013488394,0.0008295433],"genre_scores_gemma":[0.96796066,3.2196232e-7,0.031021314,0.000811889,0.00011240428,5.617001e-7,0.000003168094,0.000016590848,0.00007310554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854285,0.00006968112,0.00017228811,0.0005801279,0.00032510416,0.00030996068],"domain_scores_gemma":[0.99905056,0.00018423022,0.000021112459,0.00057542406,0.00003001631,0.00013865228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028359183,0.00018098259,0.00012923531,0.00020773866,0.00017133538,0.00051811524,0.00054773,0.0000507545,0.00002909477],"category_scores_gemma":[0.000013323407,0.00012961547,0.00008089499,0.0006112666,0.00002579512,0.000065525084,0.00008427091,0.0002350404,0.00011160179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002813726,0.000060002425,0.00000995028,0.000010899343,0.000006134579,0.00005874432,0.00015211655,0.93726283,0.0004439538,0.010221107,0.0000989915,0.051672455],"study_design_scores_gemma":[0.00014605424,0.0002295549,0.0001182141,0.00007452052,0.000002709464,0.0000098443015,0.0000019962727,0.99426895,0.0018661852,0.00045823268,0.0026330873,0.00019062031],"about_ca_topic_score_codex":0.00003711479,"about_ca_topic_score_gemma":0.0000016405589,"teacher_disagreement_score":0.6302306,"about_ca_system_score_codex":0.000036660123,"about_ca_system_score_gemma":0.000071134695,"threshold_uncertainty_score":0.5285565},"labels":[],"label_agreement":null},{"id":"W4401752872","doi":"10.1109/ismvl60454.2024.00029","title":"Qudit non-Clifford interleaved benchmarking","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Alberta","keywords":"Benchmarking; Scheme (mathematics); Computer science; Theoretical computer science; Set (abstract data type); Representation (politics); Noise (video); Algorithm; Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.01040772005802799,"score_gpt":0.24785487322238794,"score_spread":0.23744715316435996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401752872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02746312,0.00046017388,0.9311551,0.0035678847,0.011536089,0.0003278296,0.000008043053,0.0013323415,0.02414944],"genre_scores_gemma":[0.6193706,0.000030037689,0.37435725,0.0008660237,0.0023278308,0.00003564806,0.000018514374,0.000058857386,0.0029352407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973462,0.000050064908,0.00044311665,0.0012746729,0.00038795685,0.0004979903],"domain_scores_gemma":[0.9982285,0.000108776294,0.0001387612,0.001306932,0.00006883964,0.00014821043],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003881942,0.0004571519,0.00043210475,0.00031158936,0.00011992226,0.0011199699,0.0023940923,0.00027577757,0.000057729034],"category_scores_gemma":[0.000016312706,0.0003677864,0.00035001614,0.0003199924,0.00004570085,0.00005538503,0.012337389,0.0017823855,0.0003215556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038406347,0.000077067874,0.000038890026,0.00072003726,0.00023957684,0.0003478792,0.0032028884,0.018214125,0.00011610357,0.027535252,0.033493724,0.9160106],"study_design_scores_gemma":[0.0000691558,0.000054082968,0.0001139255,0.0006012713,0.000013152054,0.000034897137,0.000007957682,0.91622686,0.00020196804,0.07635241,0.005871463,0.00045283075],"about_ca_topic_score_codex":0.00012608105,"about_ca_topic_score_gemma":0.000020190977,"teacher_disagreement_score":0.9155578,"about_ca_system_score_codex":0.00007262256,"about_ca_system_score_gemma":0.00021609549,"threshold_uncertainty_score":0.999917},"labels":[],"label_agreement":null},{"id":"W4401766978","doi":"10.1007/jhep08(2024)152","title":"Security of quantum position-verification limits Hamiltonian simulation via holography","year":2024,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"SLAC National Accelerator Laboratory; Government of Canada; Ministry of Colleges and Universities; Ministerio de Ciencia e Innovación; Air Force Office of Scientific Research; UK Research and Innovation; Engineering and Physical Sciences Research Council; Universidad Complutense de Madrid; U.S. Department of Energy; European Commission; Institut Périmètre de physique théorique; Canadian Institute for Advanced Research","keywords":"Physics; Quantum entanglement; Hamiltonian (control theory); Holography; Quantum; Theoretical physics; Scaling; Quantum mechanics; Position (finance); Statistical physics; Classical mechanics; Mathematical physics; Mathematics; Geometry","score_opus":0.008034688304350442,"score_gpt":0.23575554660499073,"score_spread":0.2277208583006403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401766978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13328817,0.00038743767,0.8649787,0.00046259296,0.000788971,0.000018733375,0.0000030040108,0.00004518052,0.000027253409],"genre_scores_gemma":[0.98995805,0.000038315724,0.00946209,0.00007216832,0.0004504242,5.306514e-7,0.0000036882097,0.000010431948,0.0000043032974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886304,0.00008285917,0.00039509617,0.00017973184,0.00033962354,0.0001396666],"domain_scores_gemma":[0.9989898,0.00013860299,0.0003249411,0.00024409161,0.00024014439,0.00006240683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001970273,0.00012348326,0.00020944196,0.00018261309,0.000071701135,0.00009167555,0.00038781896,0.000058775142,9.879928e-7],"category_scores_gemma":[0.000008850129,0.00010235185,0.00020005355,0.00066321425,0.000037557907,0.000382164,0.000043918924,0.00020940689,0.0000013380372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001167654,0.00014874598,0.000023800781,0.00003873983,0.0000898225,0.000038548893,0.0005678989,0.41126403,0.0026061793,0.5048102,0.00014363174,0.080256715],"study_design_scores_gemma":[0.00009647368,0.00018789954,0.0009971277,0.00008367474,0.00001625896,0.0000397191,0.0000033510598,0.6980462,0.0048195804,0.29528955,0.00033451084,0.000085664054],"about_ca_topic_score_codex":0.000023203553,"about_ca_topic_score_gemma":7.1852793e-7,"teacher_disagreement_score":0.8566699,"about_ca_system_score_codex":0.000023705812,"about_ca_system_score_gemma":0.00007183294,"threshold_uncertainty_score":0.41737872},"labels":[],"label_agreement":null},{"id":"W4401822013","doi":"10.22331/q-2024-08-23-1444","title":"Taming Quantum Time Complexity","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; QuantERA; European Commission; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Quantum; Computer science; Physics; Quantum mechanics","score_opus":0.019102111718950102,"score_gpt":0.25440151384244486,"score_spread":0.23529940212349476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401822013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17102717,0.0021796646,0.80908066,0.006386835,0.0036280146,0.00024290687,0.000017639264,0.0035304478,0.0039066705],"genre_scores_gemma":[0.9736416,0.000012666854,0.024579505,0.00043590734,0.0005325287,0.000007780167,0.00000946196,0.000039305964,0.0007412879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792403,0.00010314548,0.0003072007,0.0007067513,0.00040223528,0.000556662],"domain_scores_gemma":[0.9988262,0.00024698573,0.000049399143,0.0006739785,0.00004441288,0.00015902812],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048176135,0.00025943137,0.00025939857,0.00020758591,0.00026585435,0.0006297814,0.001069277,0.0000814259,0.00007453866],"category_scores_gemma":[0.000032675496,0.0002192078,0.00016968143,0.0007337949,0.0001137437,0.00032349347,0.0004332456,0.0004146647,0.0016739599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031693862,0.00005778169,0.000012781613,0.000090202055,0.00004427077,0.00022952832,0.0015512994,0.00046681816,0.00159827,0.88727987,0.010321238,0.098344766],"study_design_scores_gemma":[0.00008521293,0.00008891124,0.00021281006,0.00011803549,0.0000056696827,0.000094104515,0.000011537964,0.88070315,0.00021508659,0.08278056,0.035406142,0.00027875244],"about_ca_topic_score_codex":0.000042264393,"about_ca_topic_score_gemma":9.181588e-7,"teacher_disagreement_score":0.8802363,"about_ca_system_score_codex":0.000044980425,"about_ca_system_score_gemma":0.00010486981,"threshold_uncertainty_score":0.99910337},"labels":[],"label_agreement":null},{"id":"W4401871156","doi":"10.1103/physrevresearch.6.033142","title":"Quantum dynamical Hamiltonian Monte Carlo","year":2024,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov chain Monte Carlo; Hybrid Monte Carlo; Quantum Monte Carlo; Computer science; Quantum computer; Monte Carlo method; Statistical physics; Quantum annealing; Importance sampling; Quantum algorithm; Monte Carlo integration; Theoretical computer science; Algorithm; Quantum; Computational science; Mathematics; Physics; Bayesian probability; Artificial intelligence; Quantum mechanics","score_opus":0.04490942447293231,"score_gpt":0.4030941009153848,"score_spread":0.35818467644245244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401871156","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21294674,0.56786186,0.095856674,0.101532385,0.0025928747,0.0030031896,0.000039316958,0.003309984,0.012856953],"genre_scores_gemma":[0.9913933,0.0050124303,0.0020591267,0.00041328202,0.000624824,0.00006267436,0.0000018610417,0.000031420517,0.00040105192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965323,0.00049119326,0.00024879802,0.0007873981,0.0011731772,0.00076710613],"domain_scores_gemma":[0.99787277,0.00080667366,0.000019426383,0.0008695691,0.0001564226,0.0002751279],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001458447,0.00019644602,0.00036791447,0.00015488807,0.00022003037,0.0004336589,0.0015102611,0.0000353394,0.0000125249635],"category_scores_gemma":[0.00026545662,0.00013932867,0.0002640144,0.0018012158,0.00016238075,0.0002083862,0.0008735725,0.0012581995,0.0008676572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026638445,0.000202516,0.000007968708,0.0027985878,0.000048111135,0.00036287613,0.0004960674,0.00022275437,0.0008591094,0.37425712,0.016711235,0.60403097],"study_design_scores_gemma":[0.00003866379,0.000118255,0.00013919343,0.0022101677,0.000005519022,0.000026240663,0.000001998618,0.89222044,0.00004093941,0.021814737,0.0832224,0.0001614505],"about_ca_topic_score_codex":0.00006431042,"about_ca_topic_score_gemma":0.0000035010607,"teacher_disagreement_score":0.8919977,"about_ca_system_score_codex":0.00008012819,"about_ca_system_score_gemma":0.00019918116,"threshold_uncertainty_score":0.9999103},"labels":[],"label_agreement":null},{"id":"W4401894189","doi":"10.1007/s00453-024-01262-z","title":"Parameterized Complexity of Reconfiguration of Atoms","year":2024,"lang":"en","type":"article","venue":"Algorithmica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Control reconfiguration; Computer science; Theory of computation; Combinatorics; Discrete mathematics; Mathematics; Algorithm","score_opus":0.024990078766560394,"score_gpt":0.2611977659682862,"score_spread":0.2362076872017258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401894189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19292912,0.00029129052,0.8040633,0.0011738748,0.0006312565,0.00012809307,0.000019040092,0.00021009505,0.0005539102],"genre_scores_gemma":[0.8085813,0.000004922739,0.19127962,0.000028002054,0.00005759021,0.0000028251097,0.000004919207,0.0000073975184,0.00003341007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989114,0.000066509674,0.00034988645,0.00029295933,0.00021315984,0.00016609237],"domain_scores_gemma":[0.9992312,0.00016715734,0.00009684804,0.00038824868,0.00006953191,0.000046997753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024360724,0.00011366355,0.00023853999,0.000132629,0.00003607887,0.000055093136,0.00048512462,0.000050654213,0.000018823506],"category_scores_gemma":[0.000025004521,0.00009621421,0.00011956143,0.0004659208,0.00014722564,0.00013648777,0.000117822725,0.00013348194,0.000010589592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007830446,0.000076487784,0.000012136545,0.00017624437,0.00008263752,0.000018865298,0.001069409,0.0001873951,0.015957214,0.22350088,0.00034996175,0.75856096],"study_design_scores_gemma":[0.00013148722,0.00013009686,0.00039934058,0.00008351295,0.000007432344,0.000029532532,0.0000068187915,0.89932823,0.044904612,0.053291984,0.0015732322,0.00011374686],"about_ca_topic_score_codex":0.000044809178,"about_ca_topic_score_gemma":0.0000012110671,"teacher_disagreement_score":0.89914083,"about_ca_system_score_codex":0.000011325952,"about_ca_system_score_gemma":0.000067792054,"threshold_uncertainty_score":0.39235014},"labels":[],"label_agreement":null},{"id":"W4401918511","doi":"10.1145/3689826","title":"Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Quantum Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"UT-Battelle","keywords":"Computer science; Compiler; MAGIC (telescope); Electronic circuit; Quantum computer; Computation; Computer engineering; Quantum; Parallel computing; Theoretical computer science; Algorithm; Programming language; Physics; Quantum mechanics","score_opus":0.0674841984912325,"score_gpt":0.33429306513273094,"score_spread":0.26680886664149844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401918511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09000005,0.00015241718,0.89996713,0.0036512439,0.0039859014,0.00050374755,0.000045417066,0.0015418092,0.00015231068],"genre_scores_gemma":[0.918697,0.000019899902,0.07997869,0.00072934356,0.00042766368,0.000014513155,0.000017328133,0.00008436734,0.00003121825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953128,0.00045406976,0.0009513789,0.0014206234,0.0008197465,0.0010413917],"domain_scores_gemma":[0.99219495,0.005602443,0.0001933056,0.0013824599,0.00018739629,0.0004394405],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015537321,0.00056215376,0.00065301516,0.0009079475,0.001172004,0.0010895608,0.0009878643,0.00019452699,0.000017810944],"category_scores_gemma":[0.00036898942,0.00055950857,0.0003823678,0.0024542399,0.00009512945,0.00060586847,0.000118688535,0.0010333173,0.00015178189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035838963,0.00044986466,0.000073120566,0.00026432212,0.00022036185,0.0005136528,0.0021482836,0.5371913,0.00062849326,0.021753093,0.0011776575,0.43554404],"study_design_scores_gemma":[0.000187923,0.00015064787,0.00038509755,0.0008695619,0.00007663449,0.00048173338,0.000056468456,0.99229515,0.0003059405,0.0021980351,0.0023230673,0.00066972047],"about_ca_topic_score_codex":0.00014925614,"about_ca_topic_score_gemma":0.000010560615,"teacher_disagreement_score":0.8286969,"about_ca_system_score_codex":0.00026133715,"about_ca_system_score_gemma":0.00039775428,"threshold_uncertainty_score":0.9999474},"labels":[],"label_agreement":null},{"id":"W4402116431","doi":"10.20944/preprints202408.2138.v1","title":"Quantum Security of A Compact Multi-Signature","year":2024,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Signature (topology); Computer security; Quantum; Computer science; Physics; Quantum mechanics; Mathematics","score_opus":0.06976812405667625,"score_gpt":0.33624928934073384,"score_spread":0.2664811652840576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402116431","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9600384,0.001761957,0.028690595,0.0018414515,0.003938091,0.0007493935,0.00009064026,0.0011384498,0.0017510141],"genre_scores_gemma":[0.99338496,0.00004972051,0.005859173,0.00011674655,0.00027728567,0.00001705865,0.000016613832,0.000052373365,0.00022605433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958096,0.0002835749,0.0007962096,0.0018355051,0.0006798233,0.00059526006],"domain_scores_gemma":[0.9960827,0.00017536915,0.0004827964,0.0027948297,0.00022464956,0.00023964679],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010115482,0.0006438757,0.0008813221,0.00037888813,0.00011333978,0.000114969494,0.0034681964,0.0005857695,0.00006651007],"category_scores_gemma":[0.00016661778,0.0005801811,0.0006130859,0.00052503584,0.00015976702,0.00008120149,0.010071139,0.0035657906,0.00048290135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026473895,0.0069573885,0.2045437,0.021856166,0.0053277407,0.0023015891,0.12294495,0.28311872,0.054344706,0.24694693,0.006766279,0.04462709],"study_design_scores_gemma":[0.0003360804,0.00004135878,0.037656534,0.0011245426,0.000055968198,0.000046814104,0.000028858543,0.85028857,0.01726688,0.09058002,0.0017955017,0.0007788605],"about_ca_topic_score_codex":0.0003033594,"about_ca_topic_score_gemma":0.000011480125,"teacher_disagreement_score":0.56716985,"about_ca_system_score_codex":0.00009436054,"about_ca_system_score_gemma":0.00040655403,"threshold_uncertainty_score":0.99966496},"labels":[],"label_agreement":null},{"id":"W4402169532","doi":"10.1103/prxquantum.5.030343","title":"Simulating Quantum Computation: How Many “Bits” for “It”?","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; HORIZON EUROPE Framework Programme; Air Force Office of Scientific Research; Alexander von Humboldt-Stiftung","keywords":"Computation; Quantum computer; Computer science; Quantum; Theoretical computer science; Algorithm; Physics; Quantum mechanics","score_opus":0.02554516597027576,"score_gpt":0.28936818072487686,"score_spread":0.26382301475460107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402169532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02049304,0.0010236468,0.9560769,0.017680723,0.0028475982,0.00043410252,0.00001543861,0.0011832444,0.0002452654],"genre_scores_gemma":[0.91748756,0.000009492588,0.08069142,0.0005895981,0.0007748508,0.000036893907,0.000016539007,0.00005019952,0.0003434216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975639,0.00009121502,0.00037879572,0.0008870091,0.00042031737,0.00065877166],"domain_scores_gemma":[0.99812925,0.0009944076,0.00010956645,0.0004690329,0.00013584632,0.00016187874],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00063341163,0.0003345216,0.00032764356,0.00023916096,0.00041895578,0.0012052701,0.0008338209,0.00011141927,0.0000066813877],"category_scores_gemma":[0.00013272793,0.00029366778,0.0002514946,0.0006968379,0.00006125769,0.0004535027,0.0003172615,0.0003555568,0.00006802475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000139266085,0.00009923908,0.000046355293,0.0006217335,0.00011963045,0.00013911015,0.003179603,0.06934121,0.0006613182,0.6774074,0.02305872,0.2253118],"study_design_scores_gemma":[0.0002652757,0.00019555535,0.000102939404,0.00021025722,0.000014091289,0.000059259997,0.00005285468,0.9036741,0.0001363066,0.05618563,0.038731083,0.00037261238],"about_ca_topic_score_codex":0.000010801353,"about_ca_topic_score_gemma":0.000001962769,"teacher_disagreement_score":0.89699453,"about_ca_system_score_codex":0.000048188762,"about_ca_system_score_gemma":0.00013873764,"threshold_uncertainty_score":0.99995154},"labels":[],"label_agreement":null},{"id":"W4402172131","doi":"10.1038/s41567-024-02621-x","title":"Complexity and order in approximate quantum error-correcting codes","year":2024,"lang":"en","type":"article","venue":"Nature Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"National Science Foundation","keywords":"Physics; Quantum; Order (exchange); Quantum error correction; Statistical physics; Quantum mechanics; Quantum computer; Algorithm; Computer science","score_opus":0.018125469153367532,"score_gpt":0.2824920924417024,"score_spread":0.2643666232883349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402172131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3850965,0.0031302196,0.60663545,0.0019826586,0.0018167294,0.00018592301,0.00000882473,0.0006626704,0.00048101973],"genre_scores_gemma":[0.95679176,0.000009957305,0.042639494,0.00024791455,0.0002669891,0.0000036041642,0.0000039541305,0.000015096568,0.000021206451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881554,0.00005793945,0.00014762832,0.00048074292,0.00020208527,0.0002960382],"domain_scores_gemma":[0.9994265,0.00018229081,0.000033924698,0.00026122757,0.0000430865,0.000053008796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024212337,0.00017525964,0.00019140333,0.00007624289,0.0001160207,0.00029498627,0.0003581463,0.000117933654,0.0000010709085],"category_scores_gemma":[0.00003274969,0.00014506109,0.000042942534,0.0008658976,0.00006607835,0.00020993322,0.00028029116,0.0010882133,0.0000058182927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005732129,0.000088890214,0.000567839,0.0002886703,0.000030658797,0.00009722069,0.0037183107,0.004510547,0.00046145,0.537248,0.0005540455,0.4524286],"study_design_scores_gemma":[0.00009174023,0.000021737047,0.0007787108,0.00012035582,0.0000027963501,0.000037819373,0.000026486183,0.8744068,0.00036583983,0.12333286,0.0006461926,0.00016863836],"about_ca_topic_score_codex":0.00003741521,"about_ca_topic_score_gemma":0.000019956226,"teacher_disagreement_score":0.8698963,"about_ca_system_score_codex":0.00002306663,"about_ca_system_score_gemma":0.000051213934,"threshold_uncertainty_score":0.59154195},"labels":[],"label_agreement":null},{"id":"W4402203289","doi":"10.3389/fcomp.2024.1481330","title":"Editorial: Experience with quantum annealing computation","year":2024,"lang":"en","type":"editorial","venue":"Frontiers in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Quantum annealing; Computation; Annealing (glass); Quantum computer; Quantum; Computer science; Materials science; Physics; Quantum mechanics; Algorithm; Metallurgy","score_opus":0.005540109103368078,"score_gpt":0.24893877841233705,"score_spread":0.24339866930896897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402203289","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011428706,0.00035042097,0.49570414,0.000120400015,0.50312364,0.00019452925,0.0000075810226,0.00036389622,0.000021095424],"genre_scores_gemma":[0.0007172249,0.00003383079,0.36226726,0.000045442055,0.6368286,0.0000259675,0.000015061304,0.000045571487,0.000021078513],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99119186,0.0001463173,0.00078910973,0.0028973543,0.0036331094,0.0013422605],"domain_scores_gemma":[0.9968515,0.00043738558,0.0003727505,0.0013382032,0.0006591724,0.00034101275],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018868794,0.00078940473,0.00085655256,0.0015528543,0.0005233304,0.0027942336,0.005546732,0.0005487943,6.885098e-7],"category_scores_gemma":[0.00016847493,0.00066225743,0.000143066,0.004509579,0.00091663416,0.0012561703,0.001884295,0.0021727576,0.00002634739],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011025751,0.00003731734,0.000027529766,0.00009455407,0.000015231447,0.00011008981,0.0020777045,0.047363814,0.0000044287576,0.00015453048,0.9029384,0.04716535],"study_design_scores_gemma":[0.0002990399,0.0002508619,0.000013232454,0.0006689953,0.000008106515,0.00001203209,0.000017402817,0.7484552,0.000017493627,0.0032779805,0.24628647,0.0006931488],"about_ca_topic_score_codex":0.00009116906,"about_ca_topic_score_gemma":0.0000058171627,"teacher_disagreement_score":0.7010914,"about_ca_system_score_codex":0.0005230479,"about_ca_system_score_gemma":0.0020683878,"threshold_uncertainty_score":0.99983376},"labels":[],"label_agreement":null},{"id":"W4402223131","doi":"10.1016/j.simpa.2024.100703","title":"QF-LCS: Quantum Field Lens Coding Simulator and Game Tool for Strong System State Predictions","year":2024,"lang":"en","type":"article","venue":"Software Impacts","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Victoria","keywords":"Coding (social sciences); Computer science; Simulation; Lens (geology); Field (mathematics); State (computer science); Quantum; Statistical physics; Physics; Optics; Algorithm; Mathematics; Quantum mechanics; Statistics","score_opus":0.013797464712914678,"score_gpt":0.2615874246178057,"score_spread":0.24778995990489103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402223131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15218018,0.00048648944,0.8438453,0.0005538081,0.0012416403,0.00030888422,0.00008063219,0.001284526,0.000018526953],"genre_scores_gemma":[0.983847,0.000015952846,0.015605963,0.00016266387,0.00026990933,0.000015372938,0.000004579461,0.000025811842,0.00005275346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985222,0.000038814098,0.00026113415,0.000474591,0.000208665,0.00049457356],"domain_scores_gemma":[0.9983148,0.001021369,0.0000571108,0.00035253793,0.0000635092,0.00019070107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002889111,0.00020961836,0.00021434209,0.00014689392,0.00024347201,0.0006438665,0.0002950462,0.00007475413,0.0000031267714],"category_scores_gemma":[0.0003397673,0.00017619679,0.00010320448,0.0002542281,0.000029294535,0.0004379969,0.00017944457,0.0002399215,0.000008340645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013635057,0.00022142839,0.0046379813,0.00829035,0.0009751175,0.00062449696,0.0241863,0.2753576,0.0011694372,0.15995395,0.02235804,0.50208896],"study_design_scores_gemma":[0.0002412728,0.0003110084,0.0007363447,0.0005521046,0.00001907959,0.00008667202,0.000042549946,0.9934382,0.00018122379,0.0014495152,0.0027113091,0.00023076289],"about_ca_topic_score_codex":0.000025790987,"about_ca_topic_score_gemma":0.000003580259,"teacher_disagreement_score":0.8316668,"about_ca_system_score_codex":0.00006844637,"about_ca_system_score_gemma":0.00017221177,"threshold_uncertainty_score":0.7185097},"labels":[],"label_agreement":null},{"id":"W4402242858","doi":"10.4086/toc.2024.v020a003","title":"","year":2024,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Institute for Quantum Information and Matter, California Institute of Technology; Simons Institute for the Theory of Computing, University of California Berkeley; Multidisciplinary University Research Initiative; Canadian Institute for Advanced Research; Centre National de la Recherche Scientifique; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Gordon and Betty Moore Foundation; National Science Foundation","keywords":"Verifiable secret sharing; Quantum computer; Computation; Computer science; Quantum; Theoretical computer science; Scheme (mathematics); Mathematics; Algorithm; Quantum mechanics; Physics; Programming language","score_opus":0.009970453124143758,"score_gpt":0.244478803283203,"score_spread":0.23450835015905924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402242858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.460563,0.0010048134,0.5361586,0.00044370934,0.0006644566,0.00007947725,7.012512e-7,0.0009279157,0.00015730184],"genre_scores_gemma":[0.8766198,0.000003907633,0.1228938,0.00017177017,0.00026953724,0.0000010037678,7.337886e-7,0.00002140328,0.00001805196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701387,0.00044921998,0.00066257844,0.0007740043,0.0004735485,0.00062675506],"domain_scores_gemma":[0.9964746,0.0023034934,0.00014208462,0.00084264134,0.000095114134,0.00014205922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032871605,0.0003076864,0.00042063193,0.00040317257,0.00028051852,0.00039565013,0.002054865,0.00007224324,0.0000023601604],"category_scores_gemma":[0.000108708744,0.00026013696,0.00026826074,0.001284318,0.0001857366,0.00043511792,0.0010852139,0.00045477302,0.0000061965584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005435421,0.000027442968,0.000045468125,0.00011629814,0.000045666733,0.0000592476,0.008957499,0.033661913,0.0022350007,0.53532845,0.0000101690275,0.4195074],"study_design_scores_gemma":[0.00014843873,0.00013623189,0.0012657444,0.00047777902,0.000008622805,0.00017552881,0.00008399295,0.7627841,0.0057592466,0.2288103,0.000109486806,0.00024048807],"about_ca_topic_score_codex":0.000009600818,"about_ca_topic_score_gemma":3.4376765e-7,"teacher_disagreement_score":0.7291222,"about_ca_system_score_codex":0.000025487267,"about_ca_system_score_gemma":0.00011812249,"threshold_uncertainty_score":0.9999851},"labels":[],"label_agreement":null},{"id":"W4402264015","doi":"10.1109/cnna60945.2023.10652656","title":"Approximate Parallel Annealing Ising Machines (APAIMs): Controller and Arithmetic Design","year":2023,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council; University of Alberta","keywords":"Computer science; Parallel computing; Arithmetic; Simulated annealing; Ising model; Mathematics; Algorithm; Physics; Statistical physics","score_opus":0.020839488618742588,"score_gpt":0.2460367704038862,"score_spread":0.2251972817851436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402264015","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032644592,0.00021662643,0.9636417,0.0019555676,0.00018411367,0.00019188972,8.496434e-7,0.00090354995,0.00026108054],"genre_scores_gemma":[0.38418028,0.000032329084,0.6146682,0.0006122216,0.0001238103,0.000012656147,0.0000016223842,0.000020214911,0.00034867664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985733,0.000115006675,0.0002172026,0.00046296784,0.00020739116,0.0004241353],"domain_scores_gemma":[0.9991688,0.00036137193,0.000058324033,0.0002651361,0.000035311863,0.00011104153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069625356,0.00018487533,0.0002320397,0.0001820907,0.00030524956,0.0003561713,0.00041020254,0.000050763043,0.000003325531],"category_scores_gemma":[0.000047854748,0.00013892191,0.000054007716,0.00054021965,0.000047691334,0.00015060641,0.00031914454,0.00015399639,0.00002940577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029365445,0.000052827727,0.00048089126,0.0000802776,0.00008824532,0.00014413368,0.0028487954,0.35232306,0.0021285615,0.032480452,0.0018477382,0.60749567],"study_design_scores_gemma":[0.000496065,0.00005202496,0.0007201232,0.00002424369,0.0000042533993,0.000046913356,0.00002021843,0.9778343,0.00011102256,0.020353783,0.00014300719,0.00019408601],"about_ca_topic_score_codex":0.000030330988,"about_ca_topic_score_gemma":9.975732e-7,"teacher_disagreement_score":0.6255112,"about_ca_system_score_codex":0.000007297931,"about_ca_system_score_gemma":0.000020183828,"threshold_uncertainty_score":0.5665071},"labels":[],"label_agreement":null},{"id":"W4402264139","doi":"10.1109/icccas62034.2024.10652827","title":"A Permutation Dispatch Circuit Design for Quantum Permutation Pad Symmetric Encryption","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Computer science; Encryption; Pseudorandom permutation; Symmetric-key algorithm; Quantum; Theoretical computer science; Computer network; Public-key cryptography; Physics; Block cipher; Quantum mechanics","score_opus":0.02869231341489335,"score_gpt":0.26760130234882995,"score_spread":0.2389089889339366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402264139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023990102,0.0003617077,0.97205925,0.0011283087,0.00092531944,0.00046993993,0.0000043478094,0.0009011966,0.00015983482],"genre_scores_gemma":[0.8858759,0.000012892664,0.113421366,0.00013238369,0.00021241124,0.00007122366,0.000018029996,0.000020272979,0.00023553232],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841815,0.00009535002,0.00026895502,0.0005870557,0.00030385627,0.0003266337],"domain_scores_gemma":[0.9988441,0.000646706,0.00005381298,0.00026044296,0.00011228761,0.000082689796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005959124,0.00018288082,0.00014875816,0.00041887423,0.0002204593,0.0006105988,0.00037785457,0.00007745315,0.000010661242],"category_scores_gemma":[0.00011061305,0.00015042217,0.00012912984,0.0011751776,0.00002180884,0.00045682577,0.00006159666,0.00014701701,0.00006664818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005820241,0.0000374815,0.000016924583,0.00013061492,0.000029410045,0.000016001177,0.0022612226,0.02927902,0.0020797749,0.47970638,0.00088540564,0.48555195],"study_design_scores_gemma":[0.00015309892,0.00020250704,0.0005712723,0.000050923718,0.000012757319,0.00003805213,0.000032835775,0.89204067,0.0006273936,0.10547611,0.000594405,0.00019999634],"about_ca_topic_score_codex":0.000030127609,"about_ca_topic_score_gemma":0.0000015819909,"teacher_disagreement_score":0.8627616,"about_ca_system_score_codex":0.000101700956,"about_ca_system_score_gemma":0.00014825402,"threshold_uncertainty_score":0.61340386},"labels":[],"label_agreement":null},{"id":"W4402267247","doi":"10.1364/cleo_fs.2024.ftu4f.7","title":"Frequency Bin Encoding and Graphs","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Toronto","funders":"","keywords":"Encoding (memory); Computer science; Bin; Algorithm; Artificial intelligence","score_opus":0.008914055112499954,"score_gpt":0.23037587524509429,"score_spread":0.22146182013259433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402267247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20823161,0.002632015,0.77116543,0.0027736446,0.0009803966,0.000067775116,8.636683e-7,0.0011345852,0.013013684],"genre_scores_gemma":[0.88720626,0.000025494968,0.11227946,0.00019300016,0.00005620717,0.0000014096325,2.1460613e-7,0.0000047073604,0.00023324034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993899,0.00001542183,0.000080541235,0.00027234547,0.000092084505,0.0001497033],"domain_scores_gemma":[0.99969614,0.000072825875,0.0000070865904,0.00016137466,0.000008612571,0.00005399177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013146254,0.000073532625,0.00005925373,0.00011129739,0.000077661076,0.0003262669,0.00023218231,0.000022657841,0.0000106158495],"category_scores_gemma":[0.000006327822,0.000053109958,0.000029820021,0.00032961962,0.000022685272,0.00014795252,0.00013760837,0.00010975095,0.00002314309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.539484e-8,0.0000037661166,0.000105941384,0.000017041297,0.0000063663397,0.00004867103,0.00044681752,0.000030286494,0.0011220851,0.741188,0.0002592823,0.25677165],"study_design_scores_gemma":[0.00003919745,0.000039019033,0.00043618592,0.00005047133,0.000001814238,0.000106264044,0.000007506762,0.8343055,0.00044462088,0.16238843,0.0020495239,0.00013143416],"about_ca_topic_score_codex":0.00002630638,"about_ca_topic_score_gemma":0.0000020861635,"teacher_disagreement_score":0.83427525,"about_ca_system_score_codex":0.0000046768128,"about_ca_system_score_gemma":0.000020110176,"threshold_uncertainty_score":0.31461993},"labels":[],"label_agreement":null},{"id":"W4402301242","doi":"10.1109/access.2024.3455997","title":"Inexact Quantum Square Root Circuit for NISQ Devices","year":2024,"lang":"en","type":"article","venue":"IEEE Access","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CMC Microsystems (Canada); Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Square root; Computer science; Root (linguistics); Square (algebra); Quantum computer; Parallel computing; Theoretical computer science; Algorithm; Quantum; Mathematics; Physics","score_opus":0.03524063424981766,"score_gpt":0.3138244458492912,"score_spread":0.27858381159947354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402301242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11093928,0.0011153675,0.881566,0.0015375847,0.0034165417,0.00026622872,0.00001639303,0.00075818156,0.00038445613],"genre_scores_gemma":[0.99596107,0.000004803515,0.002656287,0.0003826417,0.0007850161,0.000039992243,0.0000049555215,0.00002764584,0.0001375903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837804,0.000038552604,0.00025297183,0.00063423056,0.00026583247,0.00043035636],"domain_scores_gemma":[0.9988437,0.00040824432,0.000058954625,0.0005048245,0.00007614503,0.00010810038],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00028308464,0.0002133707,0.00020654897,0.00019113191,0.00021257895,0.0016514438,0.0019048484,0.00007691272,0.000009444323],"category_scores_gemma":[0.000030492523,0.0001735573,0.00015262078,0.00063787546,0.000030648054,0.00074817974,0.00023300154,0.00021939503,0.000047323785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016600927,0.00019291221,0.001964636,0.001569275,0.00022414143,0.0002994686,0.002611971,0.025416657,0.0011018651,0.1661075,0.03699581,0.76349914],"study_design_scores_gemma":[0.00015854691,0.00010061054,0.0016226728,0.00019004139,0.000011931716,0.000039406852,0.0000061430324,0.9271138,0.0011540923,0.033473436,0.03581715,0.00031216792],"about_ca_topic_score_codex":0.000055683635,"about_ca_topic_score_gemma":0.00003029683,"teacher_disagreement_score":0.90169716,"about_ca_system_score_codex":0.00002946324,"about_ca_system_score_gemma":0.00011849002,"threshold_uncertainty_score":0.99938494},"labels":[],"label_agreement":null},{"id":"W4402415693","doi":"10.1038/s41598-024-69077-0","title":"Solving linear systems on quantum hardware with hybrid HHL++","year":2024,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Massachusetts Institute of Technology","keywords":"Computer science; Quantum; Physics; Quantum mechanics","score_opus":0.011056927595396197,"score_gpt":0.2311923922005399,"score_spread":0.2201354646051437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402415693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36088166,0.0019777548,0.5691687,0.0012183508,0.06132154,0.00060648524,0.000006590774,0.0024231614,0.002395752],"genre_scores_gemma":[0.98922914,0.0000017334635,0.0071472307,0.000047058445,0.00039452087,0.000014390618,0.000012065448,0.000029607378,0.0031242534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965924,0.000061955725,0.00042003478,0.0014836831,0.000928559,0.00051337696],"domain_scores_gemma":[0.99796116,0.000096780575,0.00014144767,0.0014839954,0.00013760144,0.00017898418],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013923236,0.00024306623,0.00022961608,0.0003335949,0.0005479593,0.002757637,0.00055144046,0.00004087245,0.000008397502],"category_scores_gemma":[0.000055424487,0.00016752034,0.00010790016,0.0009359486,0.00013452121,0.00031822594,0.00022731144,0.00032825762,0.00011293768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027997194,0.00047933246,0.00071547093,0.0013895347,0.00033842982,0.09335542,0.006607141,0.43021646,0.007892916,0.08239537,0.22165145,0.15493047],"study_design_scores_gemma":[0.00004148707,0.00010568917,0.000034049164,0.0005999051,0.000006836208,0.0026928142,0.0000187509,0.88475615,0.0017183309,0.0028412393,0.10692285,0.00026187327],"about_ca_topic_score_codex":0.000028328877,"about_ca_topic_score_gemma":0.0000017946877,"teacher_disagreement_score":0.62834746,"about_ca_system_score_codex":0.000051951494,"about_ca_system_score_gemma":0.00029416045,"threshold_uncertainty_score":0.9982776},"labels":[],"label_agreement":null},{"id":"W4402466789","doi":"10.48550/arxiv.2407.18301","title":"Adiabatic Dynamics of Entanglement","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Quantum entanglement; Dynamics (music); Transfer (computing); Statistical physics; Physics; Quantum mechanics; Computer science; Quantum","score_opus":0.02838093160374475,"score_gpt":0.1784192821018794,"score_spread":0.15003835049813466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402466789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4833578,0.00012531264,0.5129221,0.00020934519,0.0010598425,0.00017387874,0.000036419657,0.00022971303,0.0018856237],"genre_scores_gemma":[0.99419445,0.000029838302,0.0050064647,0.000028123426,0.000058375816,3.4630446e-7,0.000013242313,0.000015295545,0.0006538901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985759,0.00007113882,0.0002082217,0.0007855415,0.00010077783,0.00025839973],"domain_scores_gemma":[0.9986547,0.00006802704,0.00017526408,0.00093205593,0.00006743644,0.000102484424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017025124,0.000244467,0.0002860808,0.00025951662,0.000059176033,0.000072232746,0.001559362,0.00014097537,0.0000123312975],"category_scores_gemma":[0.000009393566,0.00025655868,0.00023791545,0.00051197887,0.00007917723,0.000045519937,0.003990694,0.00056957675,0.000038507067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033037165,0.00006701116,0.00031634106,0.0002990418,0.000121790006,0.00032165757,0.00055076095,0.56734324,0.000013613792,0.4252823,0.0001322851,0.00554865],"study_design_scores_gemma":[0.0000981597,0.000045664354,0.00014505896,0.00019040475,0.000044273198,0.000004880162,0.000039683928,0.82994366,0.00006662671,0.16915666,0.000056526256,0.00020840998],"about_ca_topic_score_codex":0.000102144615,"about_ca_topic_score_gemma":0.000048717608,"teacher_disagreement_score":0.51083666,"about_ca_system_score_codex":0.0002029583,"about_ca_system_score_gemma":0.00017641135,"threshold_uncertainty_score":0.9999887},"labels":[],"label_agreement":null},{"id":"W4402474140","doi":"10.1109/ccece59415.2024.10667126","title":"Towards Secure and Efficient Communication: Leveraging Quantum Internet Technologies","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University","funders":"","keywords":"Computer science; The Internet; Computer network; Computer security; Internet privacy; World Wide Web","score_opus":0.011767693483820913,"score_gpt":0.2405156154339892,"score_spread":0.22874792195016827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402474140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10650406,0.006945332,0.8652241,0.015875816,0.0003822163,0.00009061293,9.04386e-7,0.002699612,0.0022773298],"genre_scores_gemma":[0.93758225,0.000052614003,0.06208077,0.00011165764,0.000018177505,0.00000423244,8.186252e-7,0.0000066160064,0.00014283726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991664,0.00003248296,0.00013513229,0.00033888416,0.00014108505,0.00018600994],"domain_scores_gemma":[0.999348,0.00009150591,0.00001895752,0.00048680074,0.000024238738,0.000030516045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023463894,0.00012040015,0.00010448404,0.0001323216,0.00010034899,0.00051548163,0.00078733487,0.000051951913,0.0000058793753],"category_scores_gemma":[0.000018593986,0.00008813463,0.000036128855,0.00034925487,0.00008346887,0.000088428176,0.0011017313,0.0002827851,0.000017943572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.893807e-7,0.000014934214,0.000017290089,0.00003983811,0.000016978473,0.00002400335,0.0028537593,0.0011303251,0.00005714446,0.5510445,0.0016214054,0.4431792],"study_design_scores_gemma":[0.000046648547,0.00002930643,0.00014455363,0.000117122116,0.0000022495947,0.00009916207,0.00014893753,0.96684366,0.0005362944,0.019191135,0.01271516,0.00012578085],"about_ca_topic_score_codex":0.000037208687,"about_ca_topic_score_gemma":0.0000018100211,"teacher_disagreement_score":0.9657133,"about_ca_system_score_codex":0.00001822443,"about_ca_system_score_gemma":0.000032343756,"threshold_uncertainty_score":0.49708012},"labels":[],"label_agreement":null},{"id":"W4402481734","doi":"10.22331/q-2024-09-12-1472","title":"The Complexity of Being Entangled","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Yukawa Institute for Theoretical Physics, Kyoto University; Azrieli Foundation; Israel Science Foundation; Deutsche Forschungsgemeinschaft; Stony Brook University; Government of Canada; Brandeis University","keywords":"Computer science","score_opus":0.022169428213748944,"score_gpt":0.25909068723083617,"score_spread":0.23692125901708722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402481734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26908916,0.003193299,0.7051036,0.014157817,0.004448295,0.00021108384,0.0000055210735,0.0008248741,0.002966397],"genre_scores_gemma":[0.99264526,0.000016881171,0.0070561217,0.000058221973,0.00012085285,0.0000021329572,6.209659e-7,0.000006835636,0.00009306444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991225,0.000057490906,0.00018343264,0.00021630523,0.00020756626,0.00021267612],"domain_scores_gemma":[0.9992562,0.0002589492,0.000034579818,0.00038252986,0.000028283504,0.000039453495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003170979,0.00008728476,0.00010273728,0.00004708838,0.0002014019,0.00019685377,0.00071696786,0.000023215243,0.0000040089567],"category_scores_gemma":[0.00002486295,0.000053419833,0.000087170825,0.00034134518,0.00018415463,0.00007759108,0.000225865,0.0001601157,0.000027662603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011428251,0.000009693801,0.000018466435,0.000020470126,0.000014837176,0.000015389352,0.00065734435,0.000077000295,0.0005118794,0.9380641,0.0006880369,0.059921626],"study_design_scores_gemma":[0.000037217007,0.000041732208,0.00034601925,0.000048675214,0.0000024106455,0.000015041405,0.000016116588,0.7619135,0.00081561925,0.22519085,0.011508799,0.00006401252],"about_ca_topic_score_codex":0.000021850632,"about_ca_topic_score_gemma":0.0000037553589,"teacher_disagreement_score":0.7618365,"about_ca_system_score_codex":0.000011846769,"about_ca_system_score_gemma":0.000043740944,"threshold_uncertainty_score":0.21783976},"labels":[],"label_agreement":null},{"id":"W4402618610","doi":"10.1103/physrevresearch.7.023215","title":"Simulating open-system molecular dynamics on analog quantum computers","year":2025,"lang":"en","type":"preprint","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Army Research Office; Air Force Office of Scientific Research; Office of Naval Research Global; Australian Research Council; Office of Naval Research; U.S. Air Force; Australian Government","keywords":"Computer science; Dynamics (music); Open system (computing); Quantum; Physics; Quantum mechanics; Operating system; Software","score_opus":0.06594663814605498,"score_gpt":0.4300021405334983,"score_spread":0.36405550238744333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402618610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014020707,0.02110048,0.91506433,0.015247393,0.0023440556,0.00716619,0.00015874644,0.001030246,0.023867825],"genre_scores_gemma":[0.95759857,0.0016878522,0.03664054,0.0023344273,0.0008076815,0.0003962796,0.00015530242,0.00009448469,0.00028488768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99235564,0.002089776,0.00069942593,0.0019496904,0.0018527379,0.0010527244],"domain_scores_gemma":[0.99357396,0.0020874853,0.00028387527,0.0029797896,0.0007513542,0.00032352045],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0031088728,0.00057782297,0.001420424,0.00036439585,0.00047292645,0.0010881516,0.008708177,0.00015351055,0.0000019503643],"category_scores_gemma":[0.00063827465,0.0004831165,0.0004653413,0.002139398,0.00014389015,0.000109957815,0.01901376,0.0037924072,0.00009472106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008426786,0.00034508161,0.000005899223,0.010468104,0.00012510332,0.00020634585,0.00018193536,0.089722894,0.000017534796,0.644767,0.001650387,0.2525013],"study_design_scores_gemma":[0.00016044361,0.00017413228,0.00002360327,0.025499335,0.000019452413,0.000004404167,0.000005397819,0.94501615,0.00003403627,0.026872575,0.0017772123,0.0004132382],"about_ca_topic_score_codex":0.00022255025,"about_ca_topic_score_gemma":0.00000388866,"teacher_disagreement_score":0.9435778,"about_ca_system_score_codex":0.0006770057,"about_ca_system_score_gemma":0.0010716976,"threshold_uncertainty_score":0.9999488},"labels":[],"label_agreement":null},{"id":"W4402692326","doi":"10.1007/s10462-024-10932-x","title":"Review of medical image processing using quantum-enabled algorithms","year":2024,"lang":"en","type":"article","venue":"Artificial Intelligence Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Jilin Scientific and Technological Development Program; Department of Science and Technology of Jilin Province","keywords":"Computer science; Image processing; Algorithm; Quantum; Image (mathematics); Computer vision; Artificial intelligence","score_opus":0.06344783206658251,"score_gpt":0.37514444593264296,"score_spread":0.31169661386606046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402692326","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043948818,0.4877762,0.5065685,0.004768768,0.00036324596,0.00025200847,0.000001646913,0.00015480173,0.00007089105],"genre_scores_gemma":[0.0041724625,0.89076674,0.09976189,0.0047391127,0.00047083315,0.000024569534,0.000005682551,0.00004554068,0.000013189771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632823,0.0002409173,0.0012691495,0.0006851015,0.0010142737,0.00046234723],"domain_scores_gemma":[0.9984628,0.000223268,0.0002251498,0.0006280101,0.0002542149,0.0002065778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032904746,0.00028764008,0.0007150635,0.00013804609,0.00014299054,0.00022457,0.0015763332,0.0000923685,0.00020997196],"category_scores_gemma":[0.0006089815,0.00021865944,0.00031225572,0.0020600252,0.00016454112,0.00041263827,0.00042288427,0.00048463297,0.00014194877],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.3330996e-7,0.000042288964,2.0238653e-7,0.051016312,0.0000152364,0.000082009916,0.00009082728,0.000036881902,0.00009600462,0.01942389,0.0005475485,0.92864835],"study_design_scores_gemma":[0.000005505538,0.000038178943,2.7424062e-7,0.21993527,0.000046441335,0.00020016976,0.000007039311,0.75440156,0.0012213279,0.008792667,0.015128271,0.00022326627],"about_ca_topic_score_codex":0.000052875715,"about_ca_topic_score_gemma":0.0000016598365,"teacher_disagreement_score":0.9284251,"about_ca_system_score_codex":0.00004214191,"about_ca_system_score_gemma":0.000628183,"threshold_uncertainty_score":0.89166725},"labels":[],"label_agreement":null},{"id":"W4402713726","doi":"10.48550/arxiv.2408.05351","title":"Distributed Quantum Computing for Chemical Applications","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Computer science; Quantum computer; Quantum chemical; Distributed computing; Quantum; Physics; Quantum mechanics","score_opus":0.03809776188953272,"score_gpt":0.203143276373403,"score_spread":0.16504551448387028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402713726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101860195,0.0001331462,0.89543176,0.00037318567,0.0005942518,0.0005517964,0.00014727964,0.0007809432,0.00012743997],"genre_scores_gemma":[0.98231214,0.000010018369,0.016990056,0.00006539687,0.00035765942,0.000004842286,0.00012743124,0.000028075629,0.00010436811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977662,0.000047280373,0.0002469743,0.0014055602,0.00008402298,0.0004499802],"domain_scores_gemma":[0.99821454,0.00025936624,0.00017615779,0.0010285076,0.00014724427,0.0001741799],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021940266,0.00034578066,0.0003468971,0.00017456821,0.00022351406,0.00025469196,0.0019591039,0.00027262795,0.0000021202077],"category_scores_gemma":[0.000023973305,0.00037682758,0.00035392135,0.0006744103,0.00009496215,0.000053564898,0.003860361,0.00084840175,0.000049216524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008049997,0.000086819426,0.00003796331,0.00033313184,0.00011023548,0.000060630788,0.00016806851,0.4436998,0.000093527924,0.54895544,0.0009906703,0.0054556374],"study_design_scores_gemma":[0.00016315684,0.00001875609,0.00002294679,0.00009988744,0.00004575273,0.000007534544,0.000012380964,0.77370363,0.00010250624,0.22356908,0.0019242121,0.00033011756],"about_ca_topic_score_codex":0.000021308104,"about_ca_topic_score_gemma":0.0000014197556,"teacher_disagreement_score":0.880452,"about_ca_system_score_codex":0.00014199446,"about_ca_system_score_gemma":0.00019636232,"threshold_uncertainty_score":0.9998684},"labels":[],"label_agreement":null},{"id":"W4402743878","doi":"10.1109/cleo-pr60912.2024.10676859","title":"Evidence-Based Quantum-Information Processing: Applications on Photonic Quantum Systems","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Photonics; Computer science; Quantum; Quantum information processing; Quantum imaging; Quantum information; Quantum network; Optoelectronics; Physics; Quantum mechanics","score_opus":0.02652493280876534,"score_gpt":0.26670919812830773,"score_spread":0.2401842653195424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402743878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026173245,0.0024169234,0.9882617,0.0028403972,0.0006790599,0.00052584225,0.0000037757122,0.0015966143,0.0010583341],"genre_scores_gemma":[0.99082714,0.000028077924,0.008021422,0.0006296348,0.00017116798,0.00018679876,0.0000073937636,0.000013385144,0.000114985436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983136,0.000058979,0.000374439,0.0004352029,0.00048530698,0.00033245227],"domain_scores_gemma":[0.99878514,0.00030460555,0.000088676774,0.00059114513,0.00011516306,0.00011527891],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004791395,0.00021043733,0.00016649069,0.0003195467,0.0002728422,0.0015770575,0.00082473125,0.00007619075,0.00000897303],"category_scores_gemma":[0.000030062647,0.00015694751,0.000094744115,0.0010099757,0.000038934668,0.0011031132,0.000090831585,0.00027565568,0.000546555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007126757,0.00006519942,0.0000075023636,0.00065492984,0.000015457468,0.000010082634,0.0004907245,0.06602042,0.00027578566,0.59220195,0.0024381764,0.33781263],"study_design_scores_gemma":[0.00007811967,0.00013248569,0.00003608635,0.0008472931,0.0000057387633,0.000021199197,0.000025518815,0.9582545,0.00043769774,0.0017636432,0.038184285,0.00021341143],"about_ca_topic_score_codex":0.00004219653,"about_ca_topic_score_gemma":6.250844e-7,"teacher_disagreement_score":0.9882098,"about_ca_system_score_codex":0.00008272685,"about_ca_system_score_gemma":0.00037799764,"threshold_uncertainty_score":0.9994594},"labels":[],"label_agreement":null},{"id":"W4402776192","doi":"10.1109/ojcoms.2024.3461334","title":"When are Quantum Algorithms Applicable for Signal Decoding in Wireless Communication?","year":2024,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canada First Research Excellence Fund; Canada Excellence Research Chairs, Government of Canada","keywords":"Decoding methods; Computer science; Wireless; Algorithm; SIGNAL (programming language); Telecommunications","score_opus":0.04618232938895371,"score_gpt":0.3244534723087414,"score_spread":0.27827114291978766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402776192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015748465,0.0051329928,0.91969454,0.057390064,0.0007311303,0.00088348315,0.000020616273,0.000068679765,0.00033004937],"genre_scores_gemma":[0.60567445,0.00041642622,0.39319885,0.00044217674,0.00008409945,0.00003712075,0.0000016856623,0.000020160533,0.00012502984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983379,0.0003372137,0.0006156317,0.00020734266,0.000249464,0.00025243993],"domain_scores_gemma":[0.99599576,0.001137002,0.00042627947,0.0021314996,0.0002368405,0.00007261609],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0024479467,0.00015420037,0.00029998866,0.00007059581,0.0007212202,0.0009564445,0.0127379205,0.0000788382,0.000003651692],"category_scores_gemma":[0.00003054718,0.00011179312,0.00037945007,0.00065186655,0.00016712052,0.00060983974,0.002325411,0.00087165186,0.000003829986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000479178,0.0015957906,0.0019819005,0.00039816962,0.0010737932,0.000013846228,0.050664015,0.042826295,0.004597765,0.2797348,0.17636663,0.4406991],"study_design_scores_gemma":[0.00038307338,0.000035269033,0.00020084047,0.0006474087,0.00001960559,0.00007518195,0.00040312787,0.93773204,0.00030803235,0.04262425,0.017419545,0.00015160863],"about_ca_topic_score_codex":0.0000798949,"about_ca_topic_score_gemma":0.0000520295,"teacher_disagreement_score":0.89490575,"about_ca_system_score_codex":0.00015487574,"about_ca_system_score_gemma":0.0003114265,"threshold_uncertainty_score":0.99260366},"labels":[],"label_agreement":null},{"id":"W4402842758","doi":"10.1103/physrevlett.133.130803","title":"Optimal Twirling Depth for Classical Shadows in the Presence of Noise","year":2024,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Division of Materials Sciences and Engineering; Basic Energy Sciences; Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Office of Science; U.S. Department of Energy","keywords":"Observable; Quantum entanglement; Pauli exclusion principle; Upper and lower bounds; Noise (video); Entropy (arrow of time); Statistical physics; Algorithm; Mathematics; Physics; Computer science; Quantum mechanics; Mathematical analysis; Quantum","score_opus":0.020908841886594923,"score_gpt":0.3027363440183094,"score_spread":0.2818275021317145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402842758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20100187,0.011855007,0.71788126,0.06784647,0.0003320148,0.00088079873,0.0000049909618,0.0001161844,0.0000813957],"genre_scores_gemma":[0.96413374,0.0002700879,0.027754894,0.0073978654,0.000347617,0.00007941683,0.0000017264325,0.000011361341,0.0000032623575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883366,0.00011048436,0.00022063483,0.0003347152,0.00025805994,0.00024245688],"domain_scores_gemma":[0.99862844,0.0009201129,0.00004326458,0.00035596546,0.000016352109,0.000035876692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004375593,0.00012499881,0.00025410013,0.000038504862,0.000037603397,0.00008040385,0.000898555,0.000007721503,6.253972e-7],"category_scores_gemma":[0.00008731081,0.00007442596,0.00021482752,0.0004705468,0.00006137002,0.000114073686,0.00013141571,0.00025360376,0.0000072783178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014994777,0.00051689445,0.00007534237,0.009371812,0.00008274912,0.00014368581,0.00670281,0.09344301,0.014740424,0.09860807,0.0255546,0.7507456],"study_design_scores_gemma":[0.00006194576,0.00004990723,0.00018144911,0.0017005183,0.0000133775,0.00000852989,0.0000029032822,0.98680305,0.0001128111,0.000692844,0.010270621,0.000102018625],"about_ca_topic_score_codex":0.000003994587,"about_ca_topic_score_gemma":5.95498e-7,"teacher_disagreement_score":0.8933601,"about_ca_system_score_codex":0.000011579348,"about_ca_system_score_gemma":0.000028289114,"threshold_uncertainty_score":0.30350024},"labels":[],"label_agreement":null},{"id":"W4402844014","doi":"10.1103/physreva.110.032624","title":"Occupation-number quantum-subspace-expansion approach to computing the single-particle Green function: An opportunity for noise filtering","year":2024,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Subspace topology; Noise (video); Particle filter; Function (biology); Quantum; Particle (ecology); Computer science; Physics; Statistical physics; Mathematics; Applied mathematics; Quantum mechanics; Mathematical analysis; Artificial intelligence; Geology; Kalman filter; Biology","score_opus":0.046966042632403726,"score_gpt":0.36045423810275873,"score_spread":0.313488195470355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402844014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21513233,0.011255575,0.76311094,0.006779801,0.0004861666,0.002198816,0.00001912651,0.00059225765,0.0004250109],"genre_scores_gemma":[0.9787747,0.0014421042,0.010600616,0.006871136,0.0018640938,0.00029803778,0.00004078503,0.000071171045,0.000037328267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962484,0.0004876814,0.000650651,0.0011808897,0.0007333605,0.0006990155],"domain_scores_gemma":[0.9968762,0.0008278424,0.0001997172,0.0013174486,0.0002304213,0.0005483733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011242045,0.0005120699,0.0009449215,0.000039056136,0.0004676955,0.00034661213,0.0012318222,0.000037877548,0.000006686168],"category_scores_gemma":[0.00042615336,0.00033351456,0.0006736941,0.0014766162,0.00008090447,0.0005152212,0.00057467626,0.00054489996,0.00019974455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023369594,0.0014866533,0.000026816808,0.010980211,0.000111473084,0.00001162034,0.001380081,0.0014607778,0.010771802,0.08388034,0.0062310435,0.8836358],"study_design_scores_gemma":[0.00012071472,0.0004008826,0.00023282925,0.0060237683,0.00015625867,0.00002512381,0.0000100293055,0.9458177,0.0008178709,0.014827332,0.031063141,0.00050434825],"about_ca_topic_score_codex":0.000027114596,"about_ca_topic_score_gemma":0.0000018842379,"teacher_disagreement_score":0.9443569,"about_ca_system_score_codex":0.000073317875,"about_ca_system_score_gemma":0.00013358769,"threshold_uncertainty_score":0.99991167},"labels":[],"label_agreement":null},{"id":"W4402857023","doi":"10.48550/arxiv.2407.15357","title":"Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canada First Research Excellence Fund","keywords":"Lipschitz continuity; Quantum; Upper and lower bounds; Computer science; Statistical physics; Mathematics; Applied mathematics; Mathematical optimization; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.07241325948869441,"score_gpt":0.2375501983689754,"score_spread":0.16513693888028097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402857023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1555708,0.00018346016,0.83928543,0.00004081471,0.0018303299,0.0016383652,0.000102935286,0.00019864785,0.0011492049],"genre_scores_gemma":[0.99412626,0.00001045207,0.0047331583,0.00002358635,0.00017300043,0.000006062172,0.000032714794,0.000030840558,0.0008639041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975825,0.00016894245,0.00037663252,0.001364299,0.00013257483,0.00037507806],"domain_scores_gemma":[0.9975432,0.00034170752,0.00043100756,0.0012555966,0.00029141654,0.0001370749],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068694644,0.0003678131,0.000623212,0.00027446248,0.00018365298,0.0007280551,0.0031939954,0.00029803318,0.0000021521014],"category_scores_gemma":[0.000052716234,0.00037553726,0.0003085423,0.0005668442,0.00011291423,0.00021747965,0.005797702,0.0006292371,0.000011584026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003984616,0.00010484892,0.000044111668,0.00049414084,0.00010163902,0.000024932704,0.00022569485,0.80393296,0.0000072791686,0.19400063,0.00018655584,0.0008373584],"study_design_scores_gemma":[0.00048427016,0.00009617312,0.00007901875,0.0003432325,0.00008100905,0.0000037122534,0.000045571913,0.94726163,0.00001360364,0.049738552,0.0014619074,0.0003913452],"about_ca_topic_score_codex":0.00028799608,"about_ca_topic_score_gemma":0.000010108432,"teacher_disagreement_score":0.83855546,"about_ca_system_score_codex":0.00012921514,"about_ca_system_score_gemma":0.00032620833,"threshold_uncertainty_score":0.99986964},"labels":[],"label_agreement":null},{"id":"W4402858618","doi":"10.2139/ssrn.4968521","title":"Quantum Information Recast Via Multiresolution in $L_2(0,1]$","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Quantum; Multiresolution analysis; Physics; Artificial intelligence; Wavelet; Quantum mechanics","score_opus":0.006745463765970042,"score_gpt":0.23146003324368342,"score_spread":0.22471456947771337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402858618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095894635,0.005642337,0.8884497,0.005201063,0.0038379568,0.00033607506,0.0000058063856,0.00032877634,0.00030364233],"genre_scores_gemma":[0.9921674,0.0012764925,0.005637943,0.00012903489,0.0006295319,0.000013660662,0.000016914804,0.000027225258,0.00010176501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566746,0.00019668817,0.0007667497,0.00046414026,0.0005357776,0.002369211],"domain_scores_gemma":[0.9987935,0.00005756067,0.00039750096,0.0005283974,0.00011492572,0.000108128566],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0027084758,0.0003850797,0.00035717446,0.0008173628,0.00018759337,0.0006949229,0.0014604641,0.00032470448,0.0000024548062],"category_scores_gemma":[0.000062571846,0.00034358376,0.0002482109,0.00054288295,0.000035529574,0.00042130833,0.001601499,0.010208013,0.00012307457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022080078,0.00006317991,0.000038750102,0.00011377632,0.00010849363,0.000035928173,0.0019687694,0.056641635,0.000032566368,0.2255786,0.00018263356,0.7152136],"study_design_scores_gemma":[0.00017092552,0.00008659962,0.00012996692,0.00019399775,0.0000076142114,0.0005194396,0.000048514936,0.53318053,0.000007672247,0.46486774,0.0005698255,0.00021717604],"about_ca_topic_score_codex":0.00030981997,"about_ca_topic_score_gemma":0.00032446856,"teacher_disagreement_score":0.8962728,"about_ca_system_score_codex":0.0016067906,"about_ca_system_score_gemma":0.0033453186,"threshold_uncertainty_score":0.9999016},"labels":[],"label_agreement":null},{"id":"W4402915697","doi":"10.1109/tcomm.2024.3469555","title":"Quantum Property Learning for NISQ Networks: Universal Quantum Witness Machines","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Queen's University; Kyung Hee University; Queen's University Belfast","keywords":"Computer science; Property (philosophy); Quantum; Quantum computer; Theoretical computer science; Quantum network; Physics; Quantum mechanics","score_opus":0.02382551532390113,"score_gpt":0.27054382374946895,"score_spread":0.24671830842556783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402915697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007032484,0.0006145456,0.985176,0.010573898,0.0011810408,0.00037662082,0.000015402038,0.0011263817,0.0002328475],"genre_scores_gemma":[0.96820915,0.00024976744,0.030162329,0.00017712935,0.00008835524,0.00012289148,0.000013968201,0.00004258534,0.0009338436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985001,0.00022018651,0.00029141124,0.00045475434,0.00018255864,0.00035099426],"domain_scores_gemma":[0.9972842,0.0009677398,0.00005950799,0.001444367,0.0001364031,0.0001078345],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003287891,0.00023896604,0.0002047246,0.00025533387,0.0013481658,0.0003734767,0.0018574051,0.00009846535,0.000009229315],"category_scores_gemma":[0.0000119327615,0.00018213346,0.00019553959,0.0009932311,0.00014660564,0.00033850307,0.000029169561,0.00085456285,0.000035409645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015838295,0.00022827771,0.0000022707588,0.000052371524,0.00010598135,0.0000043274586,0.0012359327,0.69165903,0.00020295651,0.05725866,0.0004750359,0.24875933],"study_design_scores_gemma":[0.00020451755,0.00015912214,0.000012188924,0.00015373435,0.00003274696,0.000031430292,0.00005437729,0.97088075,0.000102391044,0.003399076,0.024708802,0.00026089477],"about_ca_topic_score_codex":0.00013360943,"about_ca_topic_score_gemma":0.00008991359,"teacher_disagreement_score":0.9675059,"about_ca_system_score_codex":0.00006786729,"about_ca_system_score_gemma":0.00015618351,"threshold_uncertainty_score":0.99995196},"labels":[],"label_agreement":null},{"id":"W4402927618","doi":"10.5070/c64264238","title":"Pretty good state transfer among large sets of vertices","year":2024,"lang":"en","type":"article","venue":"Combinatorial Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universidade Federal de Minas Gerais; University of Waterloo","keywords":"Transfer (computing); State (computer science); Computer science; Mathematics; Algorithm; Parallel computing","score_opus":0.005422228960363721,"score_gpt":0.22938682702706534,"score_spread":0.2239645980667016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402927618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7912473,0.0011887938,0.19678321,0.000118261385,0.008367275,0.00018401945,0.000016448193,0.00045357842,0.0016410912],"genre_scores_gemma":[0.9991396,0.000010842009,0.0005338912,0.00003211391,0.00015639375,0.000005449897,0.0000018896051,0.000017251463,0.000102547965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849725,0.00023278789,0.00025932462,0.00038661226,0.00029334886,0.00033068476],"domain_scores_gemma":[0.9989965,0.00039723775,0.000027323878,0.00043695507,0.00004969465,0.00009228263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009625515,0.00016796085,0.00021564415,0.0001047029,0.00009782415,0.00015835684,0.0007632091,0.00007017887,0.00001875869],"category_scores_gemma":[0.00004103733,0.00013761499,0.00013313796,0.00040010203,0.000088840294,0.00026240875,0.00019860335,0.00027822595,0.00001556188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019617622,0.00009804949,0.00009398561,0.000094928815,0.000060364397,0.000037288344,0.002940165,0.00012557908,0.00047474707,0.96777695,0.00012704305,0.028151263],"study_design_scores_gemma":[0.0006627394,0.00024101614,0.0009119603,0.00020608657,0.000020818894,0.000007004665,0.000020674483,0.14506325,0.009908251,0.8385344,0.004148846,0.000274953],"about_ca_topic_score_codex":0.000005507407,"about_ca_topic_score_gemma":8.2096665e-7,"teacher_disagreement_score":0.2078923,"about_ca_system_score_codex":0.000018111894,"about_ca_system_score_gemma":0.000082544764,"threshold_uncertainty_score":0.5611776},"labels":[],"label_agreement":null},{"id":"W4403082442","doi":"10.1016/b978-0-323-95703-8.00197-x","title":"Capacities Enhanced by Entanglement","year":2006,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum entanglement; Physics; Quantum mechanics; Quantum","score_opus":0.007753538822417697,"score_gpt":0.20858304661167085,"score_spread":0.20082950778925315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403082442","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007225979,0.00013000338,0.46303007,0.000071514776,0.0001644143,0.00015380228,0.000040987463,0.0000922464,0.5362447],"genre_scores_gemma":[0.0059107845,0.00033417685,0.19083378,0.0002752076,0.0017931385,0.000039832827,0.00014214263,0.00020751418,0.80046344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793416,0.000018562174,0.0005994912,0.00045992085,0.0006703864,0.00031747113],"domain_scores_gemma":[0.99844897,0.0002646444,0.0003836445,0.00072666665,0.000082998464,0.00009308475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012572279,0.00042836714,0.0006404735,0.000049212293,0.00006989825,0.000041803272,0.00086568855,0.00016757658,0.00008610928],"category_scores_gemma":[0.000014892693,0.00037340884,0.0002595297,0.00004953026,0.00021843956,0.00011738112,0.00033216536,0.00038947584,0.000113580136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000134826,0.00012246042,1.01661605e-7,0.00028013,0.00005703853,0.000004799253,0.0006980409,0.000163405,0.00007957279,0.92966694,0.033382267,0.03554392],"study_design_scores_gemma":[0.00016191091,0.00010504856,3.5245048e-7,0.00033074289,0.00003381883,0.0000026943778,0.000006062322,0.007809139,0.0012677808,0.9312456,0.05857,0.00046682218],"about_ca_topic_score_codex":0.0000036323338,"about_ca_topic_score_gemma":3.0227213e-7,"teacher_disagreement_score":0.2721963,"about_ca_system_score_codex":0.00004109765,"about_ca_system_score_gemma":0.00006356744,"threshold_uncertainty_score":0.9998718},"labels":[],"label_agreement":null},{"id":"W4403109897","doi":"10.1016/b978-0-323-95703-8.00259-7","title":"Quantum Computation","year":2024,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computation; Quantum computer; Quantum; Physics; Quantum mechanics; Algorithm","score_opus":0.013579559998415792,"score_gpt":0.2433160613484928,"score_spread":0.229736501350077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403109897","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002145532,0.00023443426,0.46167588,0.00018242717,0.00044636521,0.0001434115,0.000011568351,0.00020512495,0.53707933],"genre_scores_gemma":[0.0065006353,0.00048363677,0.34848797,0.0002505743,0.003573899,0.000023428991,0.00007657627,0.0003941775,0.6402091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980607,0.000013371259,0.000573977,0.0005144062,0.0005927506,0.00024478513],"domain_scores_gemma":[0.9985726,0.00038777885,0.00026614667,0.0005712381,0.00009703327,0.00010521554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017270884,0.00039157667,0.00060440967,0.00009439555,0.00005163377,0.00007574446,0.00073004613,0.00019479665,0.000032339394],"category_scores_gemma":[0.000023423592,0.00032962055,0.00031472792,0.00009540054,0.00011947761,0.00009664971,0.00047440518,0.0005778578,0.00074098614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.995153e-7,0.00003757515,5.2838892e-8,0.0004663371,0.000049419054,0.000021416396,0.0003740946,0.00055406435,0.00000254116,0.95375985,0.0019766723,0.042757172],"study_design_scores_gemma":[0.000049770813,0.00005756673,5.300363e-7,0.00045808865,0.000034150544,0.000010132087,0.0000013907021,0.2943389,0.000008866908,0.6903906,0.014413433,0.0002365681],"about_ca_topic_score_codex":8.1989026e-7,"about_ca_topic_score_gemma":9.438451e-8,"teacher_disagreement_score":0.29378486,"about_ca_system_score_codex":0.000027682452,"about_ca_system_score_gemma":0.00009290359,"threshold_uncertainty_score":0.9999156},"labels":[],"label_agreement":null},{"id":"W4403124577","doi":"10.1117/12.3025644","title":"Searching for a pixel's position in a grayscale quantum image with Grover's algorithm","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Grayscale; Pixel; Computer science; Position (finance); Algorithm; Image (mathematics); Quantum; Computer vision; Artificial intelligence; Physics","score_opus":0.006116287056459584,"score_gpt":0.24568122734706696,"score_spread":0.23956494029060738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403124577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020627262,0.00013556503,0.9739839,0.003781169,0.00026430938,0.0003068317,0.0000073849696,0.0004626273,0.00043098137],"genre_scores_gemma":[0.2286609,0.000005307478,0.7706648,0.00025391896,0.00017429891,0.000042906573,0.000008187619,0.00002532663,0.00016433095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853003,0.000051704053,0.00018539985,0.000556798,0.0002476468,0.00042841933],"domain_scores_gemma":[0.9992655,0.0003003045,0.000023356779,0.00028074486,0.00004197918,0.000088136505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034220837,0.00017260524,0.00016197102,0.00026330663,0.00012603795,0.00058536977,0.00042876205,0.00004362298,0.000004225163],"category_scores_gemma":[0.000013757242,0.00012504453,0.000080541955,0.00061894505,0.000041137537,0.0004369114,0.00015183365,0.00025917715,0.000015097675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020218476,0.00012531396,0.000018666638,0.00019382188,0.000038003465,0.0002624501,0.0023586475,0.0013324044,0.0024048435,0.19837628,0.0006700137,0.79419935],"study_design_scores_gemma":[0.00031205892,0.0003025133,0.00016858589,0.00020294968,0.00000379108,0.00014483226,0.00003209223,0.95856404,0.00045202565,0.03753076,0.0020821088,0.00020426785],"about_ca_topic_score_codex":0.0001359423,"about_ca_topic_score_gemma":0.000048676015,"teacher_disagreement_score":0.9572316,"about_ca_system_score_codex":0.000058078178,"about_ca_system_score_gemma":0.00013635289,"threshold_uncertainty_score":0.56447345},"labels":[],"label_agreement":null},{"id":"W4403131059","doi":"10.1103/prxquantum.5.040302","title":"Weight-Reduced Stabilizer Codes with Lower Overhead","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Government of Canada","keywords":"Stabilizer (aeronautics); Overhead (engineering); Computer science; Environmental science; Engineering; Structural engineering; Operating system","score_opus":0.009640880205485536,"score_gpt":0.2381806472808631,"score_spread":0.22853976707537757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403131059","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65524644,0.0019586056,0.33180353,0.004647043,0.0027019067,0.00026269053,0.000009777876,0.0015433662,0.0018266205],"genre_scores_gemma":[0.980869,0.000018486353,0.018102631,0.00021225869,0.00029641914,0.000014156023,0.000002904226,0.000033549197,0.00045059595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809134,0.00006878159,0.00022620251,0.0007065501,0.00041691327,0.0004901897],"domain_scores_gemma":[0.9989274,0.0001784562,0.000042194806,0.0006447911,0.00006137288,0.00014577658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026857035,0.00026123936,0.00023299493,0.00014333907,0.000160798,0.0004910228,0.00070839055,0.000066447334,0.000053973108],"category_scores_gemma":[0.000020133828,0.00017628356,0.000101054306,0.0006330976,0.00008660494,0.000308799,0.00022659733,0.00034968235,0.00017472438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105891035,0.0005472942,0.0005886416,0.00047926093,0.00035038905,0.001430569,0.006515261,0.0050388444,0.008089097,0.7945164,0.020923175,0.16141522],"study_design_scores_gemma":[0.00023356265,0.00036260302,0.0005496643,0.00023306152,0.000013658773,0.00014240404,0.000014603445,0.93934906,0.0014216448,0.014902349,0.042375434,0.0004019819],"about_ca_topic_score_codex":0.00003191577,"about_ca_topic_score_gemma":0.0000065542463,"teacher_disagreement_score":0.9343102,"about_ca_system_score_codex":0.00003807127,"about_ca_system_score_gemma":0.00017645721,"threshold_uncertainty_score":0.71886355},"labels":[],"label_agreement":null},{"id":"W4403139636","doi":"10.22331/q-2024-10-04-1493","title":"Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Argonne National Laboratory; U.S. Department of Energy; Office of Science; University of Chicago; National Science Foundation","keywords":"Quantum; Quantum algorithm; Algorithm; Computer science; Quantum mechanics; Mathematics; Physics","score_opus":0.015568687651079934,"score_gpt":0.2678512443770853,"score_spread":0.25228255672600536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403139636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11038332,0.0024584876,0.8727217,0.010763157,0.002171305,0.0005635038,0.000037624315,0.0007781693,0.00012274926],"genre_scores_gemma":[0.93428886,0.00008332519,0.06460819,0.00033755726,0.00039579612,0.00008242677,0.000022234797,0.000048489313,0.00013312172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656606,0.00030240061,0.00075713336,0.0011031388,0.0005171024,0.00075415225],"domain_scores_gemma":[0.99810225,0.000947217,0.00010757942,0.00050259073,0.000064556145,0.00027583327],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008450223,0.00044278905,0.0006339859,0.0005813307,0.0003209104,0.00074443215,0.0007258758,0.00019414363,0.00002165769],"category_scores_gemma":[0.00009505014,0.00037480786,0.00024268472,0.00094943243,0.0001455618,0.0004848306,0.00028514405,0.0007818937,0.00008995058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007226046,0.00061639043,0.00015280319,0.000110247354,0.00015731952,0.00063876045,0.0024428722,0.0067986404,0.0014235817,0.9494635,0.0008535026,0.03727012],"study_design_scores_gemma":[0.0024812324,0.00017836013,0.0045310054,0.0001929938,0.000023421368,0.00023605858,0.000030446981,0.951499,0.000035447345,0.03854369,0.0017880633,0.00046030432],"about_ca_topic_score_codex":0.0000925227,"about_ca_topic_score_gemma":0.000025880752,"teacher_disagreement_score":0.94470036,"about_ca_system_score_codex":0.000090428235,"about_ca_system_score_gemma":0.00024404401,"threshold_uncertainty_score":0.99987036},"labels":[],"label_agreement":null},{"id":"W4403162317","doi":"10.48550/arxiv.2409.18420","title":"Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Ministry of Colleges and Universities; National Science Foundation; Government of Canada; Institut Périmètre de physique théorique; National Centres of Competence in Research SwissMAP; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Quantum; Electronic circuit; Exponential function; Quantum algorithm; Quantum circuit; Physics; Quantum mechanics; Statistical physics; Mathematics; Quantum error correction; Mathematical analysis","score_opus":0.05925099623037153,"score_gpt":0.22854326184814278,"score_spread":0.16929226561777125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403162317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6755778,0.000032193682,0.3225203,0.00050390355,0.0004580182,0.0005766019,0.00007565756,0.00015349817,0.0001020272],"genre_scores_gemma":[0.99849254,0.000005772856,0.00122547,0.000054832646,0.00008624104,0.000002273778,0.00001334812,0.000037890168,0.000081657396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686193,0.0003461261,0.00043759253,0.001435537,0.00041115133,0.00050767814],"domain_scores_gemma":[0.99735445,0.00019926348,0.00037259757,0.0016081687,0.000298577,0.00016696232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004155016,0.0004936063,0.0006078075,0.0005860814,0.0002769277,0.00021994562,0.0017995206,0.00020916005,0.000007885903],"category_scores_gemma":[0.000037084075,0.00037708686,0.00019528667,0.002244365,0.0002937744,0.00018418273,0.002062221,0.0011831622,0.000012126397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014072853,0.00008763037,0.0013051168,0.00011503424,0.000076836324,0.0001479116,0.0016752122,0.8298965,0.00015306857,0.16619742,0.000050967257,0.0001535406],"study_design_scores_gemma":[0.0005657251,0.00035024676,0.005948016,0.000806715,0.00006309559,0.000015332575,0.00012449175,0.912098,0.0002836965,0.079183,0.0000731001,0.00048860715],"about_ca_topic_score_codex":0.0009777053,"about_ca_topic_score_gemma":0.0019232965,"teacher_disagreement_score":0.3229147,"about_ca_system_score_codex":0.000356114,"about_ca_system_score_gemma":0.0008313074,"threshold_uncertainty_score":0.9998681},"labels":[],"label_agreement":null},{"id":"W4403162319","doi":"10.48550/arxiv.2409.18202","title":"Simulating the quantum switch with quantum circuits is computationally hard","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; National Science Foundation; Government of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Quantum; Computer science; Physics; Quantum mechanics","score_opus":0.048140224413976744,"score_gpt":0.19740386145874655,"score_spread":0.1492636370447698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403162319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44971356,0.0001722626,0.5462948,0.001570336,0.0008729964,0.00032521723,0.000021557207,0.0005260668,0.0005031731],"genre_scores_gemma":[0.99606407,0.000017898325,0.0024232718,0.0005942546,0.00026171972,0.0000013242342,0.000013414148,0.000048957718,0.00057506916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682903,0.00019307055,0.00033317265,0.0017323281,0.00032780092,0.000584621],"domain_scores_gemma":[0.99727136,0.0005044685,0.00033805,0.001418333,0.00028565805,0.00018214372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044480566,0.0005645916,0.00045131255,0.0002846358,0.00054607034,0.00065388455,0.002707877,0.0002422666,0.000016394035],"category_scores_gemma":[0.000027654567,0.00043128876,0.00030581688,0.001150439,0.00018560758,0.00015717086,0.0033409402,0.0017108216,0.00016845351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007163992,0.00004002666,0.00026328914,0.00011661267,0.0001702583,0.00038828,0.0012496718,0.8377171,0.000009283151,0.15737621,0.00043456416,0.0022275099],"study_design_scores_gemma":[0.00024945242,0.00008219655,0.0009091092,0.0003445324,0.00007395871,0.000030530962,0.00007074827,0.8336511,0.000014136015,0.16366337,0.0004060143,0.0005047968],"about_ca_topic_score_codex":0.00014417156,"about_ca_topic_score_gemma":0.0000139503745,"teacher_disagreement_score":0.54635054,"about_ca_system_score_codex":0.00013555815,"about_ca_system_score_gemma":0.0005373222,"threshold_uncertainty_score":0.9998139},"labels":[],"label_agreement":null},{"id":"W4403176415","doi":"10.62056/abe0fhbmo","title":"Uncloneable Quantum Advice","year":2024,"lang":"en","type":"article","venue":"IACR Communications in Cryptology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; University of Ottawa","keywords":"Advice (programming); Computer science","score_opus":0.024803725680860478,"score_gpt":0.31371025333196717,"score_spread":0.2889065276511067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403176415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019130802,0.01632692,0.89565676,0.049597237,0.001581131,0.00024824103,0.0000057544453,0.0017630943,0.015690057],"genre_scores_gemma":[0.61124057,0.0002926096,0.387916,0.00040648325,0.000044263412,0.000035360536,0.000006707238,0.000013261659,0.000044787666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865156,0.00025828966,0.00030141938,0.0003575735,0.000111192625,0.0003199875],"domain_scores_gemma":[0.99683625,0.00077480095,0.000037796148,0.0022573988,0.0000425358,0.000051209736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004310504,0.00013075859,0.00017696364,0.00030571525,0.00018807004,0.00015483484,0.002906187,0.00009676795,0.000014028873],"category_scores_gemma":[0.0000620996,0.00012369982,0.00006108374,0.0010625228,0.0001609273,0.00019594908,0.0012585714,0.0005682644,0.00021508201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.866485e-7,0.000059623344,0.00013857738,0.0000148767285,0.000010926979,0.000024429113,0.0009783074,0.0009167414,0.000077322526,0.9471139,0.0012909522,0.049373455],"study_design_scores_gemma":[0.00008111057,0.000027336195,0.00036608687,0.000048982587,0.0000023158454,0.00009215554,0.00002479785,0.7466332,0.000019122783,0.13513632,0.11745226,0.000116351715],"about_ca_topic_score_codex":0.00011739421,"about_ca_topic_score_gemma":0.000113721464,"teacher_disagreement_score":0.81197757,"about_ca_system_score_codex":0.000050741917,"about_ca_system_score_gemma":0.00012647815,"threshold_uncertainty_score":0.5400467},"labels":[],"label_agreement":null},{"id":"W4403225249","doi":"10.1007/s11128-024-04553-0","title":"NISQ-friendly measurement-based quantum clustering algorithms","year":2024,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Algorithm; Computer science; Cluster analysis; Quantum computer; Qubit; Quantum algorithm; Quantum entanglement; Quantum sort; Theoretical computer science; Quantum; Quantum error correction; Artificial intelligence; Physics","score_opus":0.017515412640124475,"score_gpt":0.24960746069919368,"score_spread":0.2320920480590692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403225249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002777543,0.0009833323,0.99037707,0.0015287928,0.001484505,0.00020766558,0.0000068718186,0.0018372762,0.00079692097],"genre_scores_gemma":[0.9211003,0.0000060631346,0.07791209,0.0006912193,0.00019873453,0.000029715075,0.000017705506,0.000026391763,0.000017738437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704003,0.000064052576,0.0007489966,0.0004219392,0.001119974,0.00060502446],"domain_scores_gemma":[0.9987325,0.00008081706,0.00021127869,0.00045427194,0.0003517524,0.00016938272],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012095781,0.00034375978,0.00025033407,0.00055299216,0.0005623944,0.0026607667,0.0008898048,0.00011930938,0.000011873404],"category_scores_gemma":[0.000113638336,0.0003009629,0.00013624303,0.0011359435,0.0000642421,0.004063592,0.00022084078,0.00044062696,0.0002088188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008918029,0.000036377027,0.000008211439,0.0009868052,0.000024118015,0.000030122439,0.0028620788,0.030800208,0.0003462221,0.020496571,0.0008642277,0.94353616],"study_design_scores_gemma":[0.00028415586,0.00011004934,0.000048474933,0.0006209569,0.000010200034,0.00008080702,0.000111768306,0.97713995,0.00087011413,0.0022532572,0.018061236,0.00040903175],"about_ca_topic_score_codex":0.000021553373,"about_ca_topic_score_gemma":0.0000017100592,"teacher_disagreement_score":0.9463397,"about_ca_system_score_codex":0.000162695,"about_ca_system_score_gemma":0.0005893217,"threshold_uncertainty_score":0.99994427},"labels":[],"label_agreement":null},{"id":"W4403279016","doi":"10.1109/fpl64840.2024.00018","title":"SERI: High-Throughput Streaming Acceleration of Electron Repulsion Integral Computation in Quantum Chemistry using HBM-based FPGAs","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Throughput; Acceleration; Field-programmable gate array; Computation; Computational science; Quantum computer; Computer science; Electron; Hardware acceleration; Quantum dot; Quantum; Parallel computing; Physics; Computational physics; Optoelectronics; Quantum mechanics; Algorithm; Embedded system; Telecommunications","score_opus":0.013494836786637605,"score_gpt":0.27550654802703184,"score_spread":0.26201171124039424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403279016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5484893,0.000068152294,0.450741,0.00022995095,0.00019103296,0.00006981436,0.0000010707981,0.00015142822,0.0000582623],"genre_scores_gemma":[0.91386014,0.0000023832722,0.08595213,0.000033988388,0.00009031602,0.000002397271,0.00002107746,0.000014391659,0.000023165905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841267,0.00007007095,0.00041986947,0.00051725877,0.00028115543,0.0002989807],"domain_scores_gemma":[0.9994037,0.00012249865,0.00010112342,0.0002580608,0.00006793608,0.00004666133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002992596,0.0001907241,0.00022654116,0.00017512731,0.00007879223,0.00020600564,0.00030782673,0.00009512528,0.000007619137],"category_scores_gemma":[0.000024572855,0.00016733288,0.000075157724,0.0007979148,0.000032344135,0.0003240179,0.00011348516,0.00030121004,0.0000021794242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012692798,0.000088094275,0.000072675844,0.0002034541,0.000012265714,0.00003387129,0.00067850965,0.7614035,0.16847533,0.0024435532,0.000060471637,0.06651559],"study_design_scores_gemma":[0.00019066491,0.00007455743,0.0003605703,0.00027825322,0.0000044354692,0.000018441866,0.000033474014,0.8845315,0.1119949,0.0023304806,0.000023069528,0.00015964944],"about_ca_topic_score_codex":0.00045054787,"about_ca_topic_score_gemma":0.000013910914,"teacher_disagreement_score":0.36537084,"about_ca_system_score_codex":0.00013447774,"about_ca_system_score_gemma":0.00022314025,"threshold_uncertainty_score":0.6823637},"labels":[],"label_agreement":null},{"id":"W4403284986","doi":"10.1038/s41467-024-53101-y","title":"Learning quantum properties from short-range correlations using multi-task networks","year":2024,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"John Templeton Foundation","keywords":"Range (aeronautics); Task (project management); Computer science; Quantum; Physics; Materials science; Quantum mechanics","score_opus":0.04196483484761316,"score_gpt":0.29494434005496545,"score_spread":0.2529795052073523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403284986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035051674,0.059811458,0.8986936,0.0034034434,0.0014090276,0.0002526299,0.000012690036,0.0011724932,0.00019293804],"genre_scores_gemma":[0.87132347,0.0002660891,0.12791896,0.0001553288,0.00018117797,0.000015635516,0.0000431855,0.000025724168,0.000070410344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851334,0.0002801633,0.0002864881,0.00041881634,0.00021346244,0.0002877312],"domain_scores_gemma":[0.997579,0.00050140783,0.000053369837,0.0016623957,0.00011682548,0.000087028566],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00027141676,0.00020266484,0.00017859915,0.00016709176,0.00095858995,0.0005525463,0.0021384237,0.0002733591,0.000003657676],"category_scores_gemma":[0.0001090611,0.00017303147,0.00012554864,0.0008384933,0.00012432919,0.00034656367,0.0010376861,0.0026588724,0.000023748988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008169819,0.00041113453,0.008741019,0.000049141912,0.0003927218,0.000044177872,0.013331254,0.68662953,0.0036046167,0.1049651,0.0019897236,0.17983341],"study_design_scores_gemma":[0.00006394249,0.000018302355,0.0024705436,0.00019580225,0.000025141086,0.000017927496,0.00005608359,0.9792095,0.000014384985,0.00037746495,0.01733148,0.00021944544],"about_ca_topic_score_codex":0.00011612,"about_ca_topic_score_gemma":0.000102358696,"teacher_disagreement_score":0.8362718,"about_ca_system_score_codex":0.0000629252,"about_ca_system_score_gemma":0.000104041326,"threshold_uncertainty_score":0.999642},"labels":[],"label_agreement":null},{"id":"W4403311440","doi":"10.1007/s42484-024-00200-0","title":"An inductive bias from quantum mechanics: learning order effects with non-commuting measurements","year":2024,"lang":"en","type":"article","venue":"Quantum Machine Intelligence","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Order (exchange); Inductive bias; Physics; Inductive effect; Quantum mechanics; Mechanics; Statistical physics; Theoretical physics; Engineering; Chemistry; Multi-task learning; Economics","score_opus":0.025338620059054236,"score_gpt":0.2781255449763107,"score_spread":0.25278692491725646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403311440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1900703,0.0010352493,0.80595285,0.0003028256,0.001285358,0.00031908118,0.000005272213,0.00093772647,0.000091354086],"genre_scores_gemma":[0.9578819,0.000028572173,0.041442834,0.00019001802,0.00030962325,0.000028346327,0.000019535528,0.000082646235,0.000016474267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956685,0.00054089347,0.00056598196,0.0014600822,0.0009437487,0.00082079356],"domain_scores_gemma":[0.9973134,0.0008690819,0.0002106315,0.0010703226,0.00024679097,0.00028977575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011938144,0.00062892475,0.0005209112,0.00036931882,0.00055097206,0.0009731086,0.002000977,0.00015951562,0.000028002616],"category_scores_gemma":[0.000265331,0.0004796132,0.00013482904,0.0016047037,0.00008529811,0.00076170266,0.00048272102,0.0015733625,0.00017539709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010308558,0.00055606064,0.002831833,0.0003727469,0.0006321058,0.00086374354,0.017813109,0.17926621,0.016421886,0.08314901,0.00007775916,0.69791245],"study_design_scores_gemma":[0.00013979246,0.0010251782,0.00027475224,0.0006995606,0.000033283108,0.000060404866,0.00014255005,0.95547473,0.010652871,0.030569816,0.0002668165,0.0006602554],"about_ca_topic_score_codex":0.0015287084,"about_ca_topic_score_gemma":0.000071113274,"teacher_disagreement_score":0.7762085,"about_ca_system_score_codex":0.00010460396,"about_ca_system_score_gemma":0.00022398974,"threshold_uncertainty_score":0.9997656},"labels":[],"label_agreement":null},{"id":"W4403317304","doi":"10.1002/qute.202400172","title":"Maximum Entropy Methods for Quantum State Compatibility Problems","year":2024,"lang":"en","type":"article","venue":"Advanced Quantum Technologies","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University Grants Committee; National Natural Science Foundation of China","keywords":"Compatibility (geochemistry); Principle of maximum entropy; Quantum; Quantum relative entropy; Statistical physics; Mathematics; Computer science; Physics; Quantum discord; Quantum mechanics; Materials science; Statistics; Quantum entanglement","score_opus":0.018857004431763445,"score_gpt":0.3232711210801872,"score_spread":0.3044141166484237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403317304","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025919689,0.0074556335,0.94923633,0.0048436327,0.0014161505,0.0009140774,0.000029197021,0.010153697,0.000031599826],"genre_scores_gemma":[0.33196324,0.00024925245,0.6674022,0.00006114774,0.0000312676,0.00020083015,0.000007939368,0.000041072977,0.000043010277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671584,0.00012564342,0.0006136454,0.0013491873,0.00026337613,0.0009322772],"domain_scores_gemma":[0.99712306,0.0010880486,0.00016014912,0.0014067988,0.00014636073,0.00007558098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095450156,0.00046632977,0.0005408016,0.00039295113,0.00033261615,0.0004139707,0.0019346059,0.00018275011,0.0000023395849],"category_scores_gemma":[0.00046905258,0.00037057095,0.00025824195,0.0011840514,0.0003011979,0.00056103675,0.00081073045,0.00063009775,0.000026250103],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010725194,0.000054800264,0.000014436702,0.00023255839,0.00004183237,0.000013620345,0.0002973826,0.006538589,0.0069869254,0.22002333,0.00019686503,0.76558894],"study_design_scores_gemma":[0.00016805147,0.00026671085,0.000028001301,0.000107347885,0.0000062447693,0.000018976572,0.000061972525,0.5078746,0.009192606,0.45336482,0.0286336,0.00027703066],"about_ca_topic_score_codex":0.000013617528,"about_ca_topic_score_gemma":0.000003994924,"teacher_disagreement_score":0.7653119,"about_ca_system_score_codex":0.00010216579,"about_ca_system_score_gemma":0.00011036984,"threshold_uncertainty_score":0.99987465},"labels":[],"label_agreement":null},{"id":"W4403342723","doi":"10.3389/frqst.2024.1462004","title":"qCLUE: a quantum clustering algorithm for multi-dimensional datasets","year":2024,"lang":"en","type":"article","venue":"Frontiers in Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"NTT Research; Engineering and Physical Sciences Research Council; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Bundesministerium für Bildung und Forschung; Government of Canada; Ministry of Colleges and Universities; CERN","keywords":"Cluster analysis; Computer science; Algorithm; Quantum; Data mining; Artificial intelligence; Physics","score_opus":0.013176839596101669,"score_gpt":0.27008243691107864,"score_spread":0.256905597314977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403342723","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014308702,0.0030491082,0.9754572,0.003030123,0.0032144226,0.00033193536,0.000051992945,0.00054983486,0.000006690771],"genre_scores_gemma":[0.09525718,0.000058317557,0.9042959,0.00021233996,0.000069045964,0.000056776833,0.0000095877285,0.000018688655,0.000022122607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972837,0.000024712757,0.0003282551,0.001176538,0.0003904131,0.00079636666],"domain_scores_gemma":[0.99906886,0.00008292323,0.00005812432,0.00057129795,0.00009578631,0.000123024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012360106,0.00024349928,0.0003037127,0.0017027595,0.00043651028,0.00035405403,0.0015099584,0.0001646896,8.3145375e-7],"category_scores_gemma":[0.00016864052,0.00021096825,0.000043702174,0.00314332,0.0009354057,0.0005182127,0.0009943075,0.00041298135,0.0000048277257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037480952,0.0000656294,0.00014544332,0.00005482569,0.0000151539825,0.00013702341,0.00023795529,0.0002858738,0.0012058512,0.045206144,0.0036585166,0.94898385],"study_design_scores_gemma":[0.0003498585,0.00016166073,0.00007630307,0.000120357116,0.000004652893,0.0001861232,0.000081658945,0.9617275,0.00056801323,0.025487918,0.01096109,0.00027486993],"about_ca_topic_score_codex":0.000021826649,"about_ca_topic_score_gemma":0.000006902976,"teacher_disagreement_score":0.96144164,"about_ca_system_score_codex":0.000095711264,"about_ca_system_score_gemma":0.0004042532,"threshold_uncertainty_score":0.8603036},"labels":[],"label_agreement":null},{"id":"W4403346167","doi":"10.1103/tyhj-1wlq","title":"Separable ellipsoids around multipartite states","year":2025,"lang":"en","type":"preprint","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Australian Research Council; National Research Council Canada; Natural Sciences and Engineering Research Council of Canada; Courtois Foundation","keywords":"Ellipsoid; Separable state; Separable space; Multipartite; Quantum entanglement; Mathematics; State (computer science); Eigenvalues and eigenvectors; Ball (mathematics); Qubit; Pure mathematics; Mathematical analysis; Physics; Quantum mechanics; Quantum; Algorithm; Quantum discord","score_opus":0.01624363198001599,"score_gpt":0.3618991452949116,"score_spread":0.3456555133148956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403346167","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047035005,0.6522181,0.2676233,0.016519839,0.0024054784,0.007080028,0.00032896336,0.0018640409,0.0049252273],"genre_scores_gemma":[0.08857758,0.8567331,0.02335952,0.023526896,0.0041014245,0.0017781535,0.00041813927,0.00019903904,0.0013061618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922729,0.000944463,0.0013891304,0.0026398844,0.001418554,0.0013350442],"domain_scores_gemma":[0.9930732,0.0012442244,0.0009218216,0.0037135982,0.00043990827,0.00060720404],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0009878826,0.001459237,0.0038698232,0.00013484916,0.0003111768,0.00038796873,0.0042592627,0.00014772102,0.000013858988],"category_scores_gemma":[0.00068939157,0.0011424008,0.0022851215,0.0015751773,0.00023534338,0.00031035466,0.0046857405,0.0027938448,0.00071752514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025628739,0.004869808,0.00011659718,0.16467875,0.0010358081,0.00017217953,0.00085569744,0.02684557,0.0010009182,0.06011988,0.07957227,0.6607069],"study_design_scores_gemma":[0.00019927594,0.00013760262,0.000047705,0.058429617,0.00044183005,0.000007657354,0.0000012818209,0.6727833,0.00065893226,0.13110062,0.13498755,0.0012045944],"about_ca_topic_score_codex":0.00008052677,"about_ca_topic_score_gemma":0.0000033565361,"teacher_disagreement_score":0.65950227,"about_ca_system_score_codex":0.00017646953,"about_ca_system_score_gemma":0.00052835455,"threshold_uncertainty_score":0.9998157},"labels":[],"label_agreement":null},{"id":"W4403363011","doi":"","title":"Quanti, A multidisciplinary knowledge-based system for quantum information processing","year":2001,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Multidisciplinary approach; Computer science; Quantum information processing; Quantum; Knowledge management; Physics","score_opus":0.011768837363795661,"score_gpt":0.236475927562472,"score_spread":0.22470709019867632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403363011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05022332,0.0003281194,0.9395064,0.0043924055,0.00021720561,0.00038796393,0.00000807093,0.00064584636,0.00429067],"genre_scores_gemma":[0.7730648,0.000007830533,0.22641997,0.000047127876,0.000024963636,0.00005472196,0.00005297289,0.000016346967,0.00031126334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728763,0.0011257919,0.00047222635,0.0004387146,0.00026972446,0.00040588502],"domain_scores_gemma":[0.99595153,0.0009878328,0.00034365643,0.0010349277,0.001529,0.00015303964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034125405,0.0002289353,0.00023259182,0.00024287209,0.00080992794,0.0006185563,0.0012595549,0.000103833336,0.0000026268597],"category_scores_gemma":[0.00041156425,0.00021773139,0.00014594685,0.0007815894,0.00009137945,0.0006235156,0.00037172547,0.00019746655,0.000033331773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036102658,0.0006721404,0.00094977376,0.000691822,0.000029685923,0.000006980808,0.020642957,0.0031948043,0.001373915,0.27279696,0.000512245,0.6990926],"study_design_scores_gemma":[0.00072872627,0.0000015005111,0.0010502303,0.0009087832,0.000008059162,0.000028773495,0.00012354698,0.9821873,0.0053646574,0.00086602505,0.008470257,0.0002621955],"about_ca_topic_score_codex":0.000103033715,"about_ca_topic_score_gemma":0.00007064226,"teacher_disagreement_score":0.97899246,"about_ca_system_score_codex":0.00009570584,"about_ca_system_score_gemma":0.0003217213,"threshold_uncertainty_score":0.8878828},"labels":[],"label_agreement":null},{"id":"W4403412891","doi":"10.1080/17445760.2024.2388245","title":"Advanced swarm intelligence algorithms in quantum circuit design","year":2024,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"School of Graduate Studies, Queen's University; European Commission","keywords":"Computer science; Swarm intelligence; Swarm behaviour; Quantum computer; Quantum; Quantum circuit; Algorithm; Computer engineering; Artificial intelligence; Particle swarm optimization; Quantum network; Physics","score_opus":0.029971066380653003,"score_gpt":0.2892045683903734,"score_spread":0.2592335020097204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403412891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01657658,0.0076142647,0.9687709,0.0008810177,0.0059268028,0.000122007295,0.000020488247,0.000057202386,0.00003070479],"genre_scores_gemma":[0.9912307,0.00062321866,0.007650422,0.000028571509,0.00039989824,0.00000614571,0.000009171669,0.000010219957,0.00004165181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979238,0.00012500772,0.0008114312,0.0002898093,0.00060384924,0.00024611806],"domain_scores_gemma":[0.9990275,0.00018878587,0.00022670515,0.00014468249,0.0002733485,0.00013896983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079086877,0.00018300652,0.00026954172,0.00035728604,0.000046232257,0.00038874501,0.0009400193,0.000063953856,0.0000070702536],"category_scores_gemma":[0.000074888936,0.00014714237,0.000120469216,0.00037060492,0.000034145,0.0003970055,0.00014221366,0.00031358402,0.00001054443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038787202,0.00008127261,0.00018720681,0.000043351632,0.00018192267,0.0010490587,0.0008573989,0.90079236,0.00027315487,0.03848021,0.0012237291,0.05679157],"study_design_scores_gemma":[0.00026739173,0.00013497117,0.00031641693,0.00041063715,0.0000069875355,0.00063284975,0.00013373813,0.9849717,0.00006845267,0.0062877187,0.006596636,0.0001724783],"about_ca_topic_score_codex":0.000042483196,"about_ca_topic_score_gemma":0.0000018523261,"teacher_disagreement_score":0.97465414,"about_ca_system_score_codex":0.00012873349,"about_ca_system_score_gemma":0.00016082315,"threshold_uncertainty_score":0.60002923},"labels":[],"label_agreement":null},{"id":"W4403590343","doi":"10.48550/arxiv.2409.05939","title":"Fast gradient-free optimization of excitations in variational quantum eigensolvers","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum; Physics; Mathematical optimization; Statistical physics; Computer science; Mathematics; Quantum mechanics","score_opus":0.03180478121713828,"score_gpt":0.18354776740322082,"score_spread":0.15174298618608253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403590343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111533366,0.00006942298,0.8860555,0.00028625477,0.0010181526,0.00018918936,0.00005162491,0.00015146915,0.000644977],"genre_scores_gemma":[0.954776,0.000040503204,0.044869278,0.000025210104,0.00005976805,9.0885607e-7,0.000034525907,0.000016061007,0.00017773749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839664,0.000112162124,0.00028337195,0.0008179425,0.00013505525,0.00025483],"domain_scores_gemma":[0.99851775,0.00014529628,0.0002169223,0.00089118973,0.00014530619,0.000083556086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023001766,0.00023310697,0.0002635051,0.00066587015,0.00008277507,0.00008318739,0.0015161667,0.00017911746,0.00001438347],"category_scores_gemma":[0.00005618708,0.0002697584,0.00017436636,0.0011374687,0.00007968293,0.00013073378,0.0021948325,0.0005626493,0.000012258569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004448139,0.00005022062,0.00014576995,0.00005908778,0.000033163262,0.00005686278,0.0005580329,0.72845614,0.000004109497,0.27035573,0.000089887224,0.00018651532],"study_design_scores_gemma":[0.00026839017,0.000028645874,0.0008096346,0.00013675296,0.000021969656,0.0000027909216,0.00004265591,0.79910904,0.000006436416,0.19935793,0.000015509024,0.00020022636],"about_ca_topic_score_codex":0.00017486111,"about_ca_topic_score_gemma":0.000044857534,"teacher_disagreement_score":0.84324265,"about_ca_system_score_codex":0.00013913785,"about_ca_system_score_gemma":0.00027971194,"threshold_uncertainty_score":0.99997544},"labels":[],"label_agreement":null},{"id":"W4403661571","doi":"10.48550/arxiv.2409.08265","title":"Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Advanced Research Projects Agency; Defense Advanced Research Projects Agency; King Abdullah University of Science and Technology","keywords":"Product (mathematics); Quantum; Statistical physics; Applied mathematics; Mathematics; Computer science; Mathematical economics; Physics; Quantum mechanics; Geometry","score_opus":0.029279050736842054,"score_gpt":0.19104670195446324,"score_spread":0.16176765121762118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403661571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5688362,0.00035516362,0.427151,0.00080271054,0.001512884,0.00040760566,0.00008791993,0.00064305094,0.0002034602],"genre_scores_gemma":[0.9947324,0.00003345316,0.0030937744,0.0000920596,0.00021349647,8.999153e-7,0.00003938855,0.000033151144,0.0017614053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738026,0.0001300592,0.0002483513,0.0016501697,0.00013331564,0.0004578317],"domain_scores_gemma":[0.99836653,0.00017523437,0.00014833052,0.0009710423,0.00011979032,0.0002190453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014576963,0.0004373784,0.00038482473,0.0002918212,0.00023728792,0.00036673536,0.0010394473,0.00024329363,0.000009287234],"category_scores_gemma":[0.000034352837,0.00043672594,0.00016508094,0.00066682487,0.00014998963,0.00016529865,0.003537931,0.0012528701,0.000050070397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034171455,0.00029762625,0.0005564169,0.00042226276,0.00032813585,0.0006320014,0.0014666227,0.8627105,0.00042147894,0.090227775,0.009153305,0.033749722],"study_design_scores_gemma":[0.00025329794,0.00006276545,0.0001965767,0.00013537669,0.000059255843,0.000023160086,0.000011684889,0.95011663,0.000081512,0.04651593,0.0020598457,0.00048397676],"about_ca_topic_score_codex":0.00005678116,"about_ca_topic_score_gemma":0.000014142426,"teacher_disagreement_score":0.42589617,"about_ca_system_score_codex":0.000101826474,"about_ca_system_score_gemma":0.00017973043,"threshold_uncertainty_score":0.99980843},"labels":[],"label_agreement":null},{"id":"W4403708689","doi":"","title":"Sur la méthode des moments pour les matrices inhomogènes : ses graphes réguliers aux canaux quantiques","year":2024,"lang":"en","type":"dissertation","venue":"theses.fr (ABES)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université Gustave Eiffel; Agence Nationale de la Recherche; York University","keywords":"Moment (physics); Quantum; Mathematics; Quantum graph; Computer science; Physics; Quantum mechanics","score_opus":0.026728971919429426,"score_gpt":0.2922025092259979,"score_spread":0.2654735373065685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403708689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9570964,0.013062993,0.008265564,0.0005194233,0.001843908,0.00045772042,0.00007765065,0.0014911667,0.017185157],"genre_scores_gemma":[0.97094905,0.0019151777,0.023707246,0.00009354559,0.0004781987,0.0000629163,0.0001249744,0.0001597242,0.0025091355],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99624753,0.00037517562,0.0006286208,0.0011550288,0.00078403595,0.00080958847],"domain_scores_gemma":[0.99748087,0.0008372739,0.00036082193,0.0007858298,0.00031090926,0.00022428056],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00064463745,0.00083365303,0.00076940394,0.0007654937,0.00050106156,0.0011545271,0.002085,0.00042302863,0.000038075174],"category_scores_gemma":[0.00024195744,0.0006869044,0.00039055766,0.0010023698,0.00017913757,0.00049262744,0.00035654657,0.0008558746,0.000074157164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001072354,0.0006997684,0.0025484287,0.00524935,0.0016307845,0.0012819896,0.08409511,0.0033046107,0.0020700023,0.27942452,0.007204684,0.6123835],"study_design_scores_gemma":[0.0020263027,0.001031419,0.026451038,0.016110878,0.001235606,0.0007261132,0.033657365,0.3516013,0.025591316,0.43478042,0.09776565,0.009022581],"about_ca_topic_score_codex":0.018739672,"about_ca_topic_score_gemma":0.0056329104,"teacher_disagreement_score":0.60336095,"about_ca_system_score_codex":0.0001166214,"about_ca_system_score_gemma":0.00060009374,"threshold_uncertainty_score":0.99988234},"labels":[],"label_agreement":null},{"id":"W4403759024","doi":"10.1109/access.2024.3486333","title":"A Quantum Algorithm for Boolean Functions Processing","year":2024,"lang":"en","type":"article","venue":"IEEE Access","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Prince Sattam bin Abdulaziz University","keywords":"Computer science; Boolean function; Boolean expression; And-inverter graph; Boolean network; Product term; Quantum; Theoretical computer science; Algorithm; Two-element Boolean algebra; Mathematics; Algebra over a field; Physics","score_opus":0.02515047285941267,"score_gpt":0.30628031881442563,"score_spread":0.28112984595501295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403759024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040834057,0.00088772486,0.98950523,0.001228205,0.0030520244,0.00021551312,0.000018047896,0.000804914,0.00020492704],"genre_scores_gemma":[0.72820336,0.000016796188,0.2660214,0.0010223242,0.0029761835,0.00019014651,0.000017325052,0.000083900086,0.0014685878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863505,0.000021163014,0.00020634448,0.00055823504,0.00020606209,0.00037311533],"domain_scores_gemma":[0.9993288,0.00012114553,0.00004323912,0.00033085854,0.00008181642,0.00009412379],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022998145,0.00017122671,0.0001491013,0.00018615524,0.00033404987,0.0017163933,0.0010522174,0.000058484275,0.000004763869],"category_scores_gemma":[0.000012504482,0.00014186898,0.00011995575,0.0006880335,0.000034790202,0.000794599,0.00016585826,0.00020806312,0.000034805907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.961116e-7,0.000024642119,0.0000039753404,0.00007536475,0.000016096057,0.000019348783,0.0002583686,0.0013182454,0.000099126046,0.0015694464,0.0060193106,0.9905951],"study_design_scores_gemma":[0.00011311797,0.00005901489,0.00005011844,0.00012075992,0.000010493584,0.000047495123,0.000008398929,0.94653153,0.00052433606,0.010580893,0.04175366,0.00020019736],"about_ca_topic_score_codex":0.000019062298,"about_ca_topic_score_gemma":0.000002876141,"teacher_disagreement_score":0.9903949,"about_ca_system_score_codex":0.000027961589,"about_ca_system_score_gemma":0.00015099772,"threshold_uncertainty_score":0.9993199},"labels":[],"label_agreement":null},{"id":"W4403787567","doi":"10.48550/arxiv.2409.16109","title":"Measurement-based quantum computation in symmetry protected topological states of one-dimensional integer spin systems","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Nankai University","keywords":"Computation; Integer (computer science); Symmetry (geometry); Half-integer; Physics; Spin (aerodynamics); Quantum computer; Theoretical physics; Topology (electrical circuits); Quantum; Symmetry protected topological order; Quantum mechanics; Topological order; Mathematics; Computer science; Geometry; Combinatorics; Algorithm","score_opus":0.06532157307905563,"score_gpt":0.21120410412777163,"score_spread":0.145882531048716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403787567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5545597,0.00022602912,0.4436814,0.00016897514,0.00067090493,0.00043219913,0.000013137525,0.00020983917,0.00003781595],"genre_scores_gemma":[0.9958266,0.0000052695386,0.004031435,0.000034038458,0.000048436348,0.0000026264795,0.000016344864,0.000018047542,0.000017176284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728805,0.00042459398,0.0004610449,0.0011223423,0.00033829946,0.00036567426],"domain_scores_gemma":[0.99850917,0.00014125343,0.00032432057,0.0005541968,0.00035952366,0.00011155112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079029513,0.0003547855,0.00054095156,0.00069052755,0.00007378358,0.00011679713,0.0009615726,0.0003051255,0.0000037766426],"category_scores_gemma":[0.000065746994,0.00034675378,0.00019694773,0.0010566661,0.00013819584,0.0000682171,0.0014321379,0.0011278281,0.000017459795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036015383,0.00020144797,0.00023380388,0.0005270089,0.00006993383,0.00020573502,0.00009641402,0.9601859,0.00018155118,0.03768567,0.000031649455,0.0005448722],"study_design_scores_gemma":[0.0003636493,0.00016101076,0.0008252744,0.0014549552,0.000029592664,0.0000042866045,0.00003583834,0.95211124,0.00027338674,0.044392794,0.0000072383214,0.0003407228],"about_ca_topic_score_codex":0.0006820257,"about_ca_topic_score_gemma":0.00002930146,"teacher_disagreement_score":0.44126692,"about_ca_system_score_codex":0.00030929912,"about_ca_system_score_gemma":0.00041995963,"threshold_uncertainty_score":0.99989843},"labels":[],"label_agreement":null},{"id":"W4403794708","doi":"10.48550/arxiv.2409.12432","title":"Qoncord: A Multi-Device Job Scheduling Framework for Variational Quantum Algorithms","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Lawrence Berkeley National Laboratory; Office of Science; National Energy Research Scientific Computing Center; University of Texas at Austin","keywords":"Computer science; Quantum; Scheduling (production processes); Algorithm; Mathematical optimization; Distributed computing; Mathematics; Physics; Quantum mechanics","score_opus":0.06877178789054929,"score_gpt":0.23807939654274735,"score_spread":0.16930760865219807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403794708","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040209286,0.0003561362,0.9533695,0.00073722476,0.0038333344,0.00053956854,0.00008634536,0.0007785009,0.000090086076],"genre_scores_gemma":[0.4621007,0.000033693344,0.5365773,0.00019655717,0.0006660798,0.0000050840777,0.000022861432,0.00004774419,0.0003499945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661547,0.00013589358,0.0003790415,0.0020169413,0.00019479962,0.0006578657],"domain_scores_gemma":[0.99721634,0.00067882595,0.00031176492,0.0012383931,0.00029797267,0.0002566757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005516184,0.00056622864,0.0005237702,0.00043575544,0.00039052643,0.00048707885,0.0024531092,0.0005936348,0.000012011361],"category_scores_gemma":[0.00016629786,0.0006151687,0.00053213147,0.00093688717,0.00009099948,0.00017246482,0.0037836349,0.0018145314,0.00011316544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010670813,0.0000672424,0.00006183028,0.000188354,0.00014028364,0.00012259858,0.0003587638,0.53235334,0.0000066780353,0.46426976,0.00007289063,0.0023475718],"study_design_scores_gemma":[0.00026937787,0.000047438407,0.00014213295,0.00034274484,0.00006424168,0.000008458885,0.00002811125,0.6270018,0.000010749903,0.3712503,0.00038275498,0.00045187015],"about_ca_topic_score_codex":0.00011383819,"about_ca_topic_score_gemma":0.000012327595,"teacher_disagreement_score":0.42189142,"about_ca_system_score_codex":0.00020956749,"about_ca_system_score_gemma":0.0005743291,"threshold_uncertainty_score":0.99963},"labels":[],"label_agreement":null},{"id":"W4403828696","doi":"10.3390/cryptography8040050","title":"Quantum Security of a Compact Multi-Signature","year":2024,"lang":"en","type":"article","venue":"Cryptography","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Signature (topology); Computer security; Computer science; Mathematics","score_opus":0.011502753136420362,"score_gpt":0.2568706857925195,"score_spread":0.24536793265609913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403828696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11385995,0.0063854824,0.8760174,0.00080990925,0.0013788529,0.0001662945,0.000020706968,0.0008027935,0.0005585866],"genre_scores_gemma":[0.96385205,0.000025496278,0.03590055,0.000100427584,0.0000983485,0.0000018474827,0.0000028154448,0.000013419089,0.000005060106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871933,0.000066811255,0.00023028297,0.00042802296,0.0002614466,0.00029410212],"domain_scores_gemma":[0.9991619,0.00013473621,0.00005390515,0.00048381838,0.00005889096,0.000106770254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022807241,0.00018651082,0.00022530119,0.000397943,0.00008614113,0.00017172816,0.0007593176,0.000091515656,0.000010655918],"category_scores_gemma":[0.0000141527935,0.00014787153,0.00031085455,0.0014918892,0.000107316606,0.00016016004,0.00012955177,0.00040494523,0.000014014781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020361993,0.00052873074,0.001815076,0.0007005207,0.0003542226,0.00022672604,0.010581948,0.0021501672,0.0066730287,0.87158686,0.014504697,0.09085766],"study_design_scores_gemma":[0.00020060806,0.0001485907,0.0027982232,0.00020861565,0.000011028121,0.000030118352,0.000023936265,0.9332514,0.0018423692,0.048608016,0.0126259755,0.00025113949],"about_ca_topic_score_codex":0.000023692635,"about_ca_topic_score_gemma":0.000002100459,"teacher_disagreement_score":0.9311012,"about_ca_system_score_codex":0.000006614255,"about_ca_system_score_gemma":0.000051409374,"threshold_uncertainty_score":0.6030026},"labels":[],"label_agreement":null},{"id":"W4403834027","doi":"10.1038/s42254-024-00770-9","title":"Challenges and opportunities in quantum optimization","year":2024,"lang":"en","type":"review","venue":"Nature Reviews Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":154,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; National Research Foundation Singapore; National Research Foundation; Government of Canada","keywords":"Quantum; Computer science; Physics; Quantum mechanics","score_opus":0.11459048823855525,"score_gpt":0.3493538105257625,"score_spread":0.23476332228720723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403834027","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.1312443e-8,0.987873,0.009791503,0.0003022587,0.0007288426,0.00061118044,0.000006148738,0.00013907228,0.0005479514],"genre_scores_gemma":[4.070182e-7,0.9886491,0.010546013,0.000112834416,0.0005105397,0.000059726004,0.00002653166,0.000045931196,0.000048973277],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99761623,0.0003752142,0.00063503935,0.0008333429,0.00023291931,0.0003072246],"domain_scores_gemma":[0.9986959,0.00014833687,0.00031831217,0.00071526977,0.000034749864,0.00008741838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066087994,0.0005843143,0.0019168968,0.00021774051,0.00005193851,0.00019105794,0.00081337255,0.0005079444,7.419251e-7],"category_scores_gemma":[0.000038732313,0.00039388373,0.00037835774,0.00049746176,0.000041347233,0.00019189417,0.00050724216,0.0019076593,0.000021554004],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.1494036e-8,0.000015819613,2.58457e-9,0.021161562,0.00001840593,0.000027316519,0.00013949322,0.00007739782,2.3031224e-9,0.06419777,0.000259355,0.9141028],"study_design_scores_gemma":[0.000030143583,0.000021959213,5.982253e-8,0.032532785,0.00012777037,0.000060607294,0.0000020526572,0.08001334,1.4611032e-8,0.003530912,0.883318,0.00036237488],"about_ca_topic_score_codex":7.2641427e-7,"about_ca_topic_score_gemma":9.828086e-7,"teacher_disagreement_score":0.9137404,"about_ca_system_score_codex":0.000048996015,"about_ca_system_score_gemma":0.0001580299,"threshold_uncertainty_score":0.9998513},"labels":[],"label_agreement":null},{"id":"W4403884712","doi":"10.48550/arxiv.2410.03628","title":"Supporting Data for PRX Quantum (Universal Adapters between quantum LDPC codes)","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; U.S. Department of Energy","keywords":"Low-density parity-check code; Computer science; Quantum; Error floor; Theoretical computer science; Physics; Algorithm; Decoding methods; Quantum mechanics","score_opus":0.09568873070373073,"score_gpt":0.24303155381237224,"score_spread":0.1473428231086415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403884712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20265554,0.00015505192,0.792049,0.0007877631,0.0018484012,0.00064421643,0.000757425,0.00089646445,0.00020614613],"genre_scores_gemma":[0.9861334,0.00003178157,0.012004079,0.00009053349,0.0005742905,0.000001430297,0.00045965653,0.00007489565,0.0006299467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950288,0.00018036229,0.00049315114,0.0030272268,0.00023237058,0.0010381229],"domain_scores_gemma":[0.9948388,0.0005499314,0.0005369097,0.0035236892,0.0001804412,0.0003702484],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010448709,0.0006811732,0.0007932169,0.00056096324,0.00042761437,0.0004969793,0.007029431,0.00045598153,0.000011101966],"category_scores_gemma":[0.000102623584,0.0007587672,0.00042656212,0.000838978,0.00019158101,0.00044152106,0.01428885,0.0015130154,0.00007713748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000825379,0.00017463816,0.0008889536,0.0013192063,0.0011182777,0.0017406561,0.0015784178,0.34591803,0.000059479476,0.6203472,0.01128443,0.015488204],"study_design_scores_gemma":[0.0004092272,0.00012328438,0.00014077197,0.0003100099,0.00023371966,0.000011852896,0.00014690813,0.87138385,0.00001541932,0.122492425,0.003956622,0.00077589],"about_ca_topic_score_codex":0.00029674056,"about_ca_topic_score_gemma":0.000039943603,"teacher_disagreement_score":0.78347784,"about_ca_system_score_codex":0.00019995807,"about_ca_system_score_gemma":0.0006501462,"threshold_uncertainty_score":0.9994863},"labels":[],"label_agreement":null},{"id":"W4403912171","doi":"10.1007/978-3-031-73494-6_23","title":"NPQuant: A Robust Quantum Inspired Computation Algorithms as an Efficient Solution to NP-Complete Problems","year":2024,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computation; Computer science; Quantum computer; Quantum; Algorithm; Quantum algorithm; Physics; Quantum mechanics","score_opus":0.04508632951023637,"score_gpt":0.2905272982830646,"score_spread":0.24544096877282826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403912171","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008103547,0.00042252263,0.9676267,0.0033425465,0.0010027337,0.0010628033,0.000041176194,0.0005195214,0.02517165],"genre_scores_gemma":[0.15850644,0.0006579822,0.83502036,0.0036315639,0.00033076954,0.00015712123,0.00036404462,0.000086603664,0.0012451239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962812,0.00007506163,0.0011936314,0.00088484876,0.0009943148,0.0005709603],"domain_scores_gemma":[0.9960987,0.00020746018,0.00041387693,0.0023070504,0.0006063327,0.0003666039],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015652297,0.00051020103,0.00046737873,0.0022957404,0.0010308761,0.0020213583,0.0040988866,0.00020892259,0.000003986512],"category_scores_gemma":[0.000043722448,0.0004996827,0.000102232836,0.0013591797,0.0006754886,0.00323372,0.0039523123,0.0008720598,0.00032169122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034492602,0.000048858376,0.0000012713202,0.000072298164,0.000010501783,0.000002407897,0.006865128,0.21519785,0.000014543727,0.5456491,0.00015299143,0.23198158],"study_design_scores_gemma":[0.0002441215,0.00034123994,0.00012182018,0.0005099205,0.000009297402,0.00011549286,0.000023287803,0.9338806,0.0000032832604,0.024957165,0.03922981,0.0005639259],"about_ca_topic_score_codex":0.00009855636,"about_ca_topic_score_gemma":0.000023825249,"teacher_disagreement_score":0.71868277,"about_ca_system_score_codex":0.00030014958,"about_ca_system_score_gemma":0.0004303044,"threshold_uncertainty_score":0.9997455},"labels":[],"label_agreement":null},{"id":"W4403920275","doi":"10.1103/wfcg-39f4","title":"Entanglement in dual unitary quantum circuits with impurities","year":2025,"lang":"en","type":"preprint","venue":"Physical review. B./Physical review. B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; European Commission","keywords":"Quantum entanglement; Unitary state; Dual (grammatical number); Electronic circuit; Physics; Quantum; Quantum mechanics; Political science; Law","score_opus":0.016410532164789122,"score_gpt":0.33821016853625885,"score_spread":0.32179963637146974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403920275","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21002871,0.5303525,0.19490278,0.040414248,0.0027393517,0.013304824,0.00054897973,0.0017336899,0.0059749456],"genre_scores_gemma":[0.68332714,0.28259283,0.0052033504,0.023390708,0.002821088,0.0018718179,0.00039832844,0.00019035455,0.00020439085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923611,0.0009935376,0.0013904452,0.0023460148,0.0016303896,0.0012784932],"domain_scores_gemma":[0.99479467,0.0008642144,0.0007429919,0.0028212331,0.00033367088,0.00044321633],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0009100209,0.0014179399,0.003526442,0.0002443188,0.00019417946,0.00021307461,0.002655781,0.00012889045,0.000013625981],"category_scores_gemma":[0.0003258231,0.0010751022,0.001169511,0.0018925428,0.00024120606,0.00029094695,0.003997292,0.0029283797,0.000112178845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016978418,0.0032889575,0.00018413321,0.069989726,0.00045030235,0.0006468658,0.0009554844,0.0019520823,0.0001134608,0.62166524,0.011479655,0.28925708],"study_design_scores_gemma":[0.00087093085,0.0007778489,0.0009763977,0.18782768,0.0007352479,0.000071076385,0.000015170688,0.43378186,0.00034671265,0.3410791,0.030623088,0.002894905],"about_ca_topic_score_codex":0.00012450393,"about_ca_topic_score_gemma":0.000018402958,"teacher_disagreement_score":0.47329843,"about_ca_system_score_codex":0.00027258156,"about_ca_system_score_gemma":0.00077956496,"threshold_uncertainty_score":0.99985707},"labels":[],"label_agreement":null},{"id":"W4404040885","doi":"10.1103/physreva.110.052405","title":"Information scrambling in quantum walks: Discrete-time formulation of Krylov complexity","year":2024,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Scrambling; Computer science; Statistical physics; Quantum walk; Quantum; Mathematics; Algorithm; Theoretical computer science; Quantum mechanics; Physics; Quantum computer","score_opus":0.018283049557760108,"score_gpt":0.34931398990590734,"score_spread":0.33103094034814723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404040885","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5182638,0.094231725,0.3712499,0.009628132,0.00058589655,0.00346501,0.00007073614,0.00081935443,0.0016853987],"genre_scores_gemma":[0.9838893,0.011705085,0.0029954598,0.00097293395,0.00027790744,0.00006566432,0.000063418986,0.000024075844,0.000006158573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969543,0.000277723,0.0009865041,0.00048988557,0.0008021946,0.0004893624],"domain_scores_gemma":[0.9980497,0.0005309244,0.0003197496,0.0007727581,0.00015681576,0.00017009197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078087783,0.00039834162,0.0012230795,0.0001489926,0.0000864834,0.00014289728,0.0008885002,0.000038554394,0.000009564438],"category_scores_gemma":[0.000470774,0.0002952509,0.0006144458,0.0019432156,0.00009600235,0.0013187784,0.0004172542,0.00058502884,0.00038042263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001116796,0.0006019265,0.0000591736,0.028529994,0.0000719405,0.000012122498,0.0010306345,0.0008597242,0.004290913,0.40523338,0.0014178954,0.5578811],"study_design_scores_gemma":[0.00012998612,0.00015014914,0.0007880795,0.020777894,0.000059875518,0.0000061927067,0.0000017667726,0.8829317,0.00039897015,0.087874584,0.0065484135,0.00033236],"about_ca_topic_score_codex":0.00003298187,"about_ca_topic_score_gemma":0.0000012019335,"teacher_disagreement_score":0.882072,"about_ca_system_score_codex":0.00007911162,"about_ca_system_score_gemma":0.0001091691,"threshold_uncertainty_score":0.99995},"labels":[],"label_agreement":null},{"id":"W4404133584","doi":"10.1145/3649329.3655927","title":"A High-Performance Stochastic Simulated Bifurcation Ising Machine","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Shanghai Rising-Star Program; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bifurcation; Computer science; Ising model; Statistical physics; Control theory (sociology); Physics; Artificial intelligence; Nonlinear system","score_opus":0.006816445109501092,"score_gpt":0.2258829622561872,"score_spread":0.21906651714668612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404133584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2683014,0.00023802869,0.72893304,0.00090147386,0.00063538534,0.00005921122,7.2594605e-7,0.0007993207,0.00013142709],"genre_scores_gemma":[0.96353906,0.0000026409882,0.03584866,0.00017845693,0.00012276588,0.0000010956965,0.0000033856963,0.000010399049,0.0002935472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991011,0.000020568752,0.00015570215,0.00033153218,0.00017764428,0.00021346472],"domain_scores_gemma":[0.9995098,0.00010180496,0.00002053081,0.00028679398,0.000028809154,0.000052257514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016079516,0.0001198267,0.0000947043,0.00015349255,0.00012287681,0.00030454178,0.00036040528,0.000034655044,0.000018330122],"category_scores_gemma":[0.000011908595,0.00009013559,0.000032084845,0.0006217709,0.000017118982,0.00024531077,0.00013996051,0.00017496322,0.00013292325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013345941,0.000013523237,0.000006185115,0.000026311358,0.000012014636,0.000009706473,0.0003025538,0.6812552,0.00041582354,0.013312308,0.00010098231,0.30454403],"study_design_scores_gemma":[0.000082187165,0.00005604215,0.0002922958,0.00008167254,0.0000033742922,0.000029992205,0.000001215258,0.99658155,0.0005665655,0.0018548273,0.00031970747,0.00013059308],"about_ca_topic_score_codex":0.00004581518,"about_ca_topic_score_gemma":0.0000011656667,"teacher_disagreement_score":0.69523764,"about_ca_system_score_codex":0.000023728075,"about_ca_system_score_gemma":0.00004165653,"threshold_uncertainty_score":0.36756226},"labels":[],"label_agreement":null},{"id":"W4404133623","doi":"10.1145/3649329.3655908","title":"TITAN: A Fast and Distributed Large-Scale Trapped-Ion NISQ Computer","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Titan (rocket family); Computer science; Scale (ratio); Parallel computing; Computational science; Astrobiology; Physics","score_opus":0.00559518780939153,"score_gpt":0.21920333776312953,"score_spread":0.213608149953738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404133623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025822595,0.00037315505,0.969104,0.0027058641,0.00066935725,0.000086292326,0.000021243546,0.0007435599,0.0004739661],"genre_scores_gemma":[0.81088465,0.000017985974,0.18756759,0.0005468917,0.00049672317,0.000005120637,0.000021082818,0.000018692153,0.00044129038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988227,0.000035036606,0.00015788869,0.0004891086,0.00017674046,0.00031854905],"domain_scores_gemma":[0.9994764,0.00008949138,0.000017262912,0.00027648947,0.00002369237,0.000116681564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017675881,0.00015591929,0.0001452239,0.00008534289,0.00014159297,0.0005125331,0.00033156696,0.00005683378,0.00001788567],"category_scores_gemma":[0.0000029235332,0.00011725369,0.0000647377,0.00038466882,0.000033844528,0.00017833812,0.00033221146,0.00019627056,0.00005219687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055239907,0.0001626831,0.00031272043,0.00015915949,0.00007546832,0.00026208948,0.0036469614,0.0046789143,0.00044249257,0.10347186,0.023907114,0.862875],"study_design_scores_gemma":[0.0001431218,0.0000834804,0.0009889662,0.000052947733,0.000003951603,0.00010443292,0.000014773268,0.9702852,0.00011381982,0.002075656,0.025964538,0.00016915223],"about_ca_topic_score_codex":0.000008539957,"about_ca_topic_score_gemma":0.000008328015,"teacher_disagreement_score":0.9656063,"about_ca_system_score_codex":0.000013691956,"about_ca_system_score_gemma":0.000029355808,"threshold_uncertainty_score":0.4942369},"labels":[],"label_agreement":null},{"id":"W4404310846","doi":"10.4230/lipics.itcs.2026.2","title":"Oracle Separations for the Quantum-Classical Polynomial Hierarchy","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Oracle; Hierarchy; Quantum; Polynomial; Computer science; Mathematics; Physics; Quantum mechanics; Political science; Programming language; Mathematical analysis","score_opus":0.05401666438801043,"score_gpt":0.21602124517414384,"score_spread":0.16200458078613342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404310846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0671111,0.00033926414,0.9235256,0.004728863,0.0026443517,0.0005617526,0.000067845845,0.00050762936,0.00051363086],"genre_scores_gemma":[0.9918072,0.000039729148,0.0049760845,0.00018326375,0.00064393773,0.000005179826,0.000012681857,0.000027945416,0.002303931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980499,0.00010569808,0.00020766034,0.0011041397,0.000106294596,0.0004263209],"domain_scores_gemma":[0.9978202,0.0006355183,0.00012770607,0.0011677973,0.00010533019,0.00014347216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030119484,0.00031933287,0.0002783923,0.000194801,0.0005191693,0.00044333457,0.0022163696,0.00022590102,0.000008005982],"category_scores_gemma":[0.000042532592,0.00025721348,0.00041975532,0.00057109393,0.00017489959,0.00009813886,0.0031149955,0.0010501543,0.00009581466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002481161,0.00006922368,0.00001872797,0.000072435345,0.00016324712,0.00010133407,0.0005034812,0.5555151,0.000020702928,0.4248391,0.011211686,0.007460165],"study_design_scores_gemma":[0.00019727662,0.00006223003,0.00008268041,0.00005210699,0.00007444713,0.0000088761935,0.000018030116,0.87816334,0.000023700093,0.103498675,0.017531162,0.00028750056],"about_ca_topic_score_codex":0.000083040715,"about_ca_topic_score_gemma":0.00003859893,"teacher_disagreement_score":0.92469615,"about_ca_system_score_codex":0.00010981012,"about_ca_system_score_gemma":0.0004183868,"threshold_uncertainty_score":0.999988},"labels":[],"label_agreement":null},{"id":"W4404346748","doi":"10.1145/3704873","title":"Linear and Non-linear Relational Analyses for Quantum Program Optimization","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Quantum circuit; Quantum; Computer science; Electronic circuit; Quantum algorithm; Affine transformation; Quantum gate; Compiler; Representation (politics); Optimizing compiler; Algebra over a field; Mathematics; Pure mathematics; Quantum error correction; Quantum mechanics; Physics","score_opus":0.02384835767695466,"score_gpt":0.33013043255121305,"score_spread":0.3062820748742584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404346748","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6150875,0.0007828641,0.36520138,0.014375868,0.000483693,0.0026696953,0.000009889668,0.0008077231,0.0005813743],"genre_scores_gemma":[0.28313023,0.0000059338577,0.716466,0.00011781638,0.000071520306,0.00006476825,0.0000027275728,0.000009412271,0.00013159648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989902,0.000007317168,0.00023415143,0.00034302645,0.0002048073,0.00022052701],"domain_scores_gemma":[0.999059,0.0001762441,0.00019133642,0.00030731715,0.00023044187,0.000035639452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031828202,0.00014926253,0.00018131065,0.00014733544,0.00023983953,0.00011899681,0.0010798856,0.00006818861,4.4400787e-7],"category_scores_gemma":[0.00097234466,0.00010083522,0.000101184196,0.0005911869,0.000082358274,0.00013237492,0.0006078699,0.00015253905,2.8079918e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011117495,0.00068774016,0.0071288324,0.0009816834,0.00029564794,0.0000014105707,0.002537259,0.059355333,0.0034293411,0.08382702,0.0014984078,0.8401461],"study_design_scores_gemma":[0.00037574407,0.0002611415,0.0014342532,0.0002431907,0.000034566736,0.000004097704,0.00012448267,0.9860126,0.0061803535,0.0037628333,0.0014271725,0.00013957689],"about_ca_topic_score_codex":0.000009293933,"about_ca_topic_score_gemma":3.6728676e-7,"teacher_disagreement_score":0.92665726,"about_ca_system_score_codex":0.000013211287,"about_ca_system_score_gemma":0.000033282773,"threshold_uncertainty_score":0.4111941},"labels":[],"label_agreement":null},{"id":"W4404347871","doi":"10.52202/079017-1004","title":"Quantum Deep Equilibrium Models","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Resources Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"MNIST database; Quantum; Computer science; Qubit; Solver; Artificial neural network; Quantum computer; Electronic circuit; Quantum circuit; Deep learning; Algorithm; Theoretical computer science; Artificial intelligence; Quantum error correction; Quantum mechanics; Physics","score_opus":0.015331595265074268,"score_gpt":0.24132983576286746,"score_spread":0.22599824049779318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404347871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009290072,0.0011056839,0.97448236,0.002631785,0.0011032458,0.000054942033,6.0046597e-7,0.0014613562,0.009869959],"genre_scores_gemma":[0.9055016,0.000006186023,0.09296075,0.0004183355,0.0002177011,0.0000035198607,9.019578e-7,0.000014270535,0.00087672827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988939,0.000026572858,0.00014517456,0.00042376044,0.00020875508,0.00030180326],"domain_scores_gemma":[0.99937063,0.00009173409,0.000011685956,0.00041273708,0.000022167407,0.00009105236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017004144,0.00012579102,0.00010306963,0.000108638116,0.00005481406,0.0004865469,0.0006966825,0.000041124586,0.000023221868],"category_scores_gemma":[0.000005440416,0.00009299154,0.00008673187,0.00041957834,0.000023142777,0.00040719236,0.0003563094,0.00017105187,0.00019625714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.9634593e-7,0.000013123456,0.000001134067,0.000021796426,0.000012235227,0.00006850376,0.0005194795,0.040564563,0.00031893543,0.830741,0.001891726,0.125847],"study_design_scores_gemma":[0.000031502917,0.00003027196,0.000007339818,0.0000203074,0.0000015502494,0.00005105682,0.000004275811,0.8288247,0.00022098265,0.16665243,0.0040333625,0.0001222204],"about_ca_topic_score_codex":0.000016290185,"about_ca_topic_score_gemma":0.0000012943075,"teacher_disagreement_score":0.8962115,"about_ca_system_score_codex":0.000013410703,"about_ca_system_score_gemma":0.00005082603,"threshold_uncertainty_score":0.4691783},"labels":[],"label_agreement":null},{"id":"W4404355331","doi":"10.48550/arxiv.2411.02369","title":"A Criterion for Post-Selected Quantum Advantage","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Quantum; Computer science; Mathematics; Physics; Quantum mechanics","score_opus":0.030879281243833157,"score_gpt":0.20001840049381117,"score_spread":0.16913911924997801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404355331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36754116,0.00025694363,0.6282514,0.0005441646,0.0018055534,0.0004622895,0.00009118352,0.00085281883,0.00019452524],"genre_scores_gemma":[0.9892075,0.00004449006,0.009324954,0.000178819,0.00025442336,0.0000028492068,0.000053896583,0.000044033433,0.0008890403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744576,0.00010182464,0.0002406717,0.0015665655,0.00010093927,0.0005442131],"domain_scores_gemma":[0.99806476,0.00018648064,0.00016630984,0.0010670436,0.00033754687,0.00017788315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023270654,0.00043458003,0.0003996833,0.00042106718,0.00021483192,0.00033303784,0.0018405685,0.00030077324,0.000008671432],"category_scores_gemma":[0.00006387923,0.0004553903,0.0003601846,0.0008270768,0.00006945313,0.00013740918,0.0030856282,0.00091113255,0.00007222052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018120765,0.0003243607,0.00012817813,0.001760735,0.00045586898,0.0018351672,0.0020544508,0.29323736,0.0021139407,0.6743077,0.0030237432,0.020577269],"study_design_scores_gemma":[0.00028388377,0.00017415016,0.00013020227,0.00022029597,0.000058916237,0.000020297162,0.000029233026,0.8803599,0.00012885164,0.11657854,0.0015262117,0.00048952625],"about_ca_topic_score_codex":0.00006792857,"about_ca_topic_score_gemma":0.000016648713,"teacher_disagreement_score":0.6216663,"about_ca_system_score_codex":0.00012782276,"about_ca_system_score_gemma":0.0003491666,"threshold_uncertainty_score":0.9997898},"labels":[],"label_agreement":null},{"id":"W4404378607","doi":"10.1007/s11082-024-07831-4","title":"Retraction Note: An efficient quantum based D2D computation and communication approach for the internet of things","year":2024,"lang":"en","type":"article","venue":"Optical and Quantum Electronics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":true,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Computation; Quantum computer; Internet of Things; Quantum; The Internet; Telecommunications; Theoretical computer science; Computer network; Algorithm; World Wide Web; Physics; Quantum mechanics","score_opus":0.011229139100484457,"score_gpt":0.2591845447908359,"score_spread":0.24795540569035146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404378607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06774724,0.0029646412,0.92733645,0.0014340156,0.00014311042,0.00023463018,0.000001589572,0.000100971236,0.000037342677],"genre_scores_gemma":[0.8648132,0.000080351565,0.13493179,0.00009627241,0.000033790973,0.000011740345,0.000015453781,0.0000108209415,0.0000065896425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889493,0.0000823121,0.00023564254,0.00035302233,0.00019170056,0.00024239619],"domain_scores_gemma":[0.9987751,0.0007604386,0.0000661438,0.00026365233,0.00007150777,0.00006311864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008216091,0.00013665242,0.0001555686,0.000070203896,0.00019344072,0.00026703175,0.0003012768,0.00010405771,4.5586222e-7],"category_scores_gemma":[0.000036602494,0.00009288397,0.000052543906,0.00022324522,0.0001300336,0.00016185115,0.00010401751,0.00042503653,3.888319e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043686257,0.00015049426,0.0000045890188,0.00017498451,0.000026817219,7.8766647e-7,0.0012779275,0.027613927,0.0008288463,0.70858264,0.00007324688,0.26122203],"study_design_scores_gemma":[0.00018775015,0.0004870716,0.00010797115,0.000048806614,0.000025813259,0.000025967965,0.00002866725,0.9876511,0.00048000118,0.010254116,0.00058209396,0.00012060628],"about_ca_topic_score_codex":0.000025131865,"about_ca_topic_score_gemma":0.0000015386382,"teacher_disagreement_score":0.96003723,"about_ca_system_score_codex":0.000027874772,"about_ca_system_score_gemma":0.00007344138,"threshold_uncertainty_score":0.37876984},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":["research_integrity"],"domain":null,"study_design":"not_applicable","genre":"editorial","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W4404397080","doi":"10.48550/arxiv.2411.04790","title":"Quantum state preparation with optimal T-count","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research; National Science Foundation","keywords":"State (computer science); Computer science; Mathematics; Mathematical economics; Algorithm","score_opus":0.026613633262176917,"score_gpt":0.18868649869841553,"score_spread":0.1620728654362386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404397080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.514067,0.000081602055,0.48407617,0.00013897223,0.0005230306,0.00018885701,0.00001311954,0.00045785113,0.00045338852],"genre_scores_gemma":[0.9906306,0.000036261743,0.007927064,0.000056090354,0.00011427929,0.0000011579624,0.000012545575,0.00002839247,0.0011935815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772996,0.00009589446,0.00019815084,0.0014138677,0.00015489054,0.00040726806],"domain_scores_gemma":[0.99836254,0.00006339121,0.00018832891,0.001101332,0.00013171339,0.00015267312],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023355184,0.00038978056,0.00030614974,0.000269734,0.00016447718,0.00041001473,0.0013630874,0.00016090568,0.0000068601184],"category_scores_gemma":[0.000007074753,0.00035456207,0.0001554438,0.0006113552,0.00009589842,0.00017561436,0.0024401436,0.00093344395,0.00012455083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036934387,0.000040899475,0.000047804024,0.000094181494,0.000091769194,0.0006418997,0.0007004442,0.9438219,0.000011633896,0.05320262,0.00029433926,0.0010155829],"study_design_scores_gemma":[0.0001960198,0.00018954105,0.00012663205,0.00019955896,0.0000443652,0.000026584596,0.000018739885,0.9434593,0.00008322052,0.054567117,0.00064037176,0.0004485985],"about_ca_topic_score_codex":0.00012548274,"about_ca_topic_score_gemma":0.00003012604,"teacher_disagreement_score":0.47656363,"about_ca_system_score_codex":0.0001442449,"about_ca_system_score_gemma":0.00038497325,"threshold_uncertainty_score":0.9998906},"labels":[],"label_agreement":null},{"id":"W4404408242","doi":"10.48550/arxiv.2411.08877","title":"Quantum cryptography beyond key distribution: theory and experiment","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; École Normale Supérieure; HORIZON EUROPE Framework Programme; Austrian Science Fund; Science and Technology Facilities Council; Natural Sciences and Engineering Research Council of Canada; European Commission; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Quantum key distribution; Quantum cryptography; Key (lock); Cryptography; Computer science; Computer security; Theoretical computer science; Quantum; Quantum mechanics; Physics; Quantum information","score_opus":0.021286615361271514,"score_gpt":0.18686713764918786,"score_spread":0.16558052228791634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404408242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40702727,0.0014747168,0.58888716,0.00025274383,0.0010879419,0.00017488518,0.0000477077,0.00042262167,0.0006249621],"genre_scores_gemma":[0.9972577,0.00015811961,0.0021355213,0.000091027665,0.00015737605,0.000001335069,0.000029105835,0.000019732717,0.00015008922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977221,0.00022734726,0.00019237808,0.0013518094,0.00011667786,0.00038969825],"domain_scores_gemma":[0.9984853,0.0001676348,0.00009024042,0.00097051146,0.000072974166,0.00021330133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042540836,0.00039480926,0.00032008067,0.00022156119,0.00024758498,0.00033932124,0.0011532381,0.00023202626,0.0000123381205],"category_scores_gemma":[0.00001607843,0.00039346534,0.00025614133,0.0006067924,0.00021719692,0.00009862921,0.0044667767,0.0008574317,0.000035524623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001648951,0.00005095222,0.00006445076,0.00008746363,0.00010649126,0.0003175762,0.00063875684,0.016929656,0.000028417597,0.9793068,0.00056029024,0.001892657],"study_design_scores_gemma":[0.00013914464,0.000053092677,0.0001649277,0.00010738573,0.000038483373,0.000013904673,0.000051620227,0.47073674,0.00012177353,0.52699876,0.001234295,0.00033988082],"about_ca_topic_score_codex":0.000029868042,"about_ca_topic_score_gemma":0.0000020149218,"teacher_disagreement_score":0.5902304,"about_ca_system_score_codex":0.00007676728,"about_ca_system_score_gemma":0.00011708268,"threshold_uncertainty_score":0.9998517},"labels":[],"label_agreement":null},{"id":"W4404447912","doi":"10.1007/s10115-024-02282-5","title":"Quantum computing and quantum-inspired techniques for feature subset selection: a review","year":2024,"lang":"en","type":"review","venue":"Knowledge and Information Systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Feature selection; Quantum; Feature (linguistics); Computer science; Quantum computer; Selection (genetic algorithm); Artificial intelligence; Quantum machine learning; Theoretical computer science; Pattern recognition (psychology); Physics; Quantum mechanics","score_opus":0.023840847655537144,"score_gpt":0.31531260652412096,"score_spread":0.29147175886858384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404447912","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.5131986e-7,0.9242911,0.07131718,0.00012120253,0.0011442302,0.0020501118,0.0000697327,0.00062185334,0.0003841795],"genre_scores_gemma":[0.000017687784,0.9960237,0.00277803,0.000135899,0.0005596746,0.00018717397,0.00016306131,0.000029461145,0.00010528092],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976296,0.00018099824,0.0011220683,0.0004866306,0.00021394188,0.00036678318],"domain_scores_gemma":[0.99833816,0.00022737276,0.0006225963,0.00037780762,0.00029042698,0.00014365769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011875598,0.0005695162,0.0016030072,0.00047562463,0.00036990474,0.0009858372,0.0004971641,0.00035663036,3.6119488e-7],"category_scores_gemma":[0.00006679343,0.0004045129,0.00029033658,0.0009457907,0.00004155964,0.0009526941,0.00036175453,0.00053730485,0.00004138896],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.765753e-7,0.0000062714853,1.5756054e-7,0.13445729,0.000057367844,8.2510195e-7,0.00040879223,6.9876563e-7,3.5519204e-8,0.018878553,0.02793827,0.81825125],"study_design_scores_gemma":[0.000066276014,0.000093923045,3.4343546e-7,0.06216473,0.00017717342,0.00048740703,0.000009318413,0.18678504,2.2969822e-7,0.000053270716,0.7498036,0.00035867374],"about_ca_topic_score_codex":0.0000069053312,"about_ca_topic_score_gemma":8.403733e-7,"teacher_disagreement_score":0.8178926,"about_ca_system_score_codex":0.00007173961,"about_ca_system_score_gemma":0.0002510406,"threshold_uncertainty_score":0.9998407},"labels":[],"label_agreement":null},{"id":"W4404450770","doi":"10.48550/arxiv.2411.09131","title":"Artificial Intelligence for Quantum Computing","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Research Executive Agency; Engineering and Physical Sciences Research Council; European Commission; Government of Canada; Ministero dello Sviluppo Economico; Natural Resources Canada; UK Research and Innovation; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada","keywords":"Quantum computer; Computer science; Quantum; Data science; Physics; Quantum mechanics","score_opus":0.08235524372634985,"score_gpt":0.2227170033704733,"score_spread":0.14036175964412345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404450770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12057185,0.00015634726,0.874708,0.00047234524,0.0027627216,0.00037466484,0.00002500491,0.0006969195,0.00023214951],"genre_scores_gemma":[0.977682,0.000017068025,0.021460008,0.00009713696,0.000510293,9.074601e-7,0.0000121602925,0.000033762954,0.00018664294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724245,0.0000914186,0.00036095158,0.0016332533,0.000109127395,0.0005627997],"domain_scores_gemma":[0.99806887,0.00035885218,0.00021288388,0.00103581,0.00015378594,0.00016977033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048626223,0.00041916672,0.00040500093,0.00034396336,0.0002915957,0.00042718498,0.0022799205,0.00028714244,0.000005164589],"category_scores_gemma":[0.000054720203,0.0004516795,0.0004202041,0.0006989844,0.00011294721,0.00008403925,0.004456849,0.0010413295,0.00010728604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007377219,0.000033736345,0.0000060375746,0.00014130742,0.00004600255,0.00011312687,0.00029328288,0.49734515,0.00001153079,0.47735187,0.00014451251,0.024506072],"study_design_scores_gemma":[0.00002184082,0.000046501485,0.000007633876,0.00014343762,0.000027337735,0.0000061356104,0.000026465283,0.56754386,0.0001322717,0.43152964,0.00021913386,0.00029571887],"about_ca_topic_score_codex":0.000052664967,"about_ca_topic_score_gemma":0.000010463455,"teacher_disagreement_score":0.85711014,"about_ca_system_score_codex":0.00011954268,"about_ca_system_score_gemma":0.00025928422,"threshold_uncertainty_score":0.99979347},"labels":[],"label_agreement":null},{"id":"W4404465645","doi":"10.1103/physrevlett.133.210601","title":"Approximate Quantum Error Correcting Codes from Conformal Field Theory","year":2024,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Périmètre de physique théorique; Kavli Institute for Theoretical Physics, University of California, Santa Barbara; Ministry of Colleges and Universities; National Science Foundation","keywords":"Conformal field theory; Field (mathematics); Conformal map; Quantum; Physics; Computer science; Quantum mechanics; Theoretical physics; Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.013992101122338908,"score_gpt":0.28317841716552367,"score_spread":0.26918631604318477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404465645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19432555,0.015666252,0.76826143,0.018889632,0.0015775732,0.00028727064,0.000009830649,0.0007592554,0.00022321269],"genre_scores_gemma":[0.945889,0.0005736542,0.010526749,0.04195377,0.0009666345,0.00003174242,0.00001179798,0.000029656043,0.000016989561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853235,0.00015069146,0.00024593683,0.00046123922,0.0002622508,0.00034754732],"domain_scores_gemma":[0.9982962,0.0011048324,0.00006525703,0.00042402602,0.0000178077,0.000091861395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036935788,0.00021592318,0.0003515705,0.00003955282,0.00011455792,0.00023542515,0.0006841727,0.000013201052,0.000016977667],"category_scores_gemma":[0.00009207232,0.0001576337,0.00023403006,0.00031426933,0.00004651268,0.00024117154,0.0002565492,0.00044069716,0.00013835367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082655815,0.00008143713,0.000018688506,0.0022857632,0.00013669491,0.00016002465,0.0020374788,0.0009093694,0.003946708,0.08188485,0.012684139,0.8958466],"study_design_scores_gemma":[0.000057015808,0.00004611745,0.00003766794,0.0029485368,0.000032356984,0.00002180257,0.000009065516,0.979958,0.0008012809,0.008918018,0.00690819,0.00026194556],"about_ca_topic_score_codex":0.000024325427,"about_ca_topic_score_gemma":5.0070474e-7,"teacher_disagreement_score":0.9790486,"about_ca_system_score_codex":0.000016944396,"about_ca_system_score_gemma":0.00002843853,"threshold_uncertainty_score":0.64281154},"labels":[],"label_agreement":null},{"id":"W4404495576","doi":"10.3390/medsci12040067","title":"Quantum Computing in Medicine","year":2024,"lang":"en","type":"review","venue":"Medical Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Princess Margaret Cancer Centre; University of Toronto; University Health Network","funders":"Canadian Institutes of Health Research; Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Transformative learning; Quantum computer; Qubit; Computer science; Quantum technology; Quantum nanoscience; Scalability; Quantum; Field (mathematics); Quantum entanglement; Data science; Medicine; Quantum network; Physics; Open quantum system; Quantum mechanics; Mathematics; Sociology","score_opus":0.07650272473196261,"score_gpt":0.3891847623746573,"score_spread":0.3126820376426947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404495576","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004865384,0.97363687,0.01863037,0.0033833096,0.0027936236,0.00019376459,9.5181895e-7,0.00027391678,0.0010823425],"genre_scores_gemma":[0.00003634564,0.9953937,0.0033716508,0.00024228085,0.00087567145,0.0000070112455,0.000002298023,0.000015030563,0.00005601954],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99502957,0.00034365314,0.0009269298,0.0012028599,0.0017682145,0.00072874874],"domain_scores_gemma":[0.99809706,0.00093981164,0.00019587668,0.00042386213,0.000014414085,0.00032894526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043426394,0.00043778363,0.0014998474,0.0006972855,0.00021337683,0.00023150156,0.0043666093,0.0002974049,0.000056656336],"category_scores_gemma":[0.00054596236,0.00023361639,0.0002367829,0.0038552394,0.0008423366,0.00010296233,0.001386197,0.0013092045,0.00019396597],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.6478543e-8,0.000014079681,8.3508405e-7,0.0016546047,0.000007618075,0.00029113647,0.00016925232,0.000009649592,4.1147885e-9,0.028845623,0.0012500645,0.9677571],"study_design_scores_gemma":[0.00004855177,0.00009062135,0.0000012798313,0.028847817,0.000025730988,0.0002493958,0.0000060203974,0.28067416,1.0958483e-8,0.004293281,0.68552196,0.00024118269],"about_ca_topic_score_codex":0.00012129826,"about_ca_topic_score_gemma":0.00001956262,"teacher_disagreement_score":0.9675159,"about_ca_system_score_codex":0.000066045926,"about_ca_system_score_gemma":0.0009549958,"threshold_uncertainty_score":0.95265996},"labels":[],"label_agreement":null},{"id":"W4404569756","doi":"10.48550/arxiv.2411.10406","title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","year":2024,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Regional Municipality of Waterloo; Perimeter Institute; University of Waterloo","funders":"","keywords":"Supercomputer; Qubit; Scaling; Quantum computer; Computer science; Quantum; Parallel computing; Computational science; Physics; Quantum mechanics; Mathematics","score_opus":0.026554088973592238,"score_gpt":0.2603251357908643,"score_spread":0.23377104681727207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404569756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.654025,0.0007607989,0.32883358,0.011965844,0.0034808097,0.00038528926,0.00009887978,0.0004182098,0.000031571122],"genre_scores_gemma":[0.85280234,0.00001717689,0.1449189,0.0009090641,0.0010875086,0.000036881047,0.000022597585,0.00006813756,0.000137404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584746,0.00015272328,0.00066934957,0.001932119,0.0006491133,0.00074921374],"domain_scores_gemma":[0.9966485,0.00028603524,0.00016536447,0.0021609196,0.00022251497,0.0005166477],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00038314486,0.0006467642,0.00089308585,0.0006814021,0.00017709464,0.00065367867,0.003299771,0.00035080258,0.0000060946472],"category_scores_gemma":[0.00012604041,0.00061565754,0.0004608569,0.0011284372,0.00006040264,0.0001038213,0.009925633,0.0013309394,0.00020239595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009916541,0.0012989462,0.038141277,0.0024273682,0.002226609,0.0013416415,0.06670825,0.35282296,0.047869656,0.028985547,0.03200331,0.42607528],"study_design_scores_gemma":[0.00045402983,0.00048079214,0.03999851,0.0047561754,0.00014063883,0.000046035864,0.00015078804,0.8929432,0.010311364,0.029640505,0.018713906,0.002364071],"about_ca_topic_score_codex":0.00090749183,"about_ca_topic_score_gemma":0.00005947279,"teacher_disagreement_score":0.54012024,"about_ca_system_score_codex":0.000095086645,"about_ca_system_score_gemma":0.00026871017,"threshold_uncertainty_score":0.9996295},"labels":[],"label_agreement":null},{"id":"W4404574164","doi":"10.48550/arxiv.2411.12625","title":"Quantum ergodicity and scrambling in quantum annealers","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Science; Canada First Research Excellence Fund; U.S. Department of Energy","keywords":"Scrambling; Quantum; Ergodicity; Physics; Quantum mechanics; Computer science; Algorithm","score_opus":0.04680270182466959,"score_gpt":0.19732090861174634,"score_spread":0.15051820678707675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404574164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.934744,0.00064969587,0.061836477,0.0005197208,0.001188696,0.00022907881,0.000013322382,0.00044041366,0.00037860338],"genre_scores_gemma":[0.9981643,0.00019917267,0.0012340045,0.00011457351,0.00011836016,6.8513117e-7,0.0000053074814,0.00002731042,0.00013630149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971558,0.0001739334,0.00029229507,0.0016869977,0.0001302785,0.0005607315],"domain_scores_gemma":[0.99846953,0.00017125215,0.00015576143,0.0009159754,0.00006593698,0.00022153219],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005028956,0.00043967256,0.00047159803,0.0006918124,0.0001646451,0.00033529522,0.0013937105,0.00033862665,0.0000042743895],"category_scores_gemma":[0.000039799594,0.0004731142,0.00017957395,0.0010307949,0.00017057803,0.00016074041,0.004616141,0.0016865412,0.000036942758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014327313,0.0000577497,0.0010420348,0.00023735296,0.00004565406,0.0012702162,0.00068827695,0.8871497,0.0000208492,0.10724553,0.00016051711,0.0020678092],"study_design_scores_gemma":[0.00025701546,0.000050987335,0.001450998,0.00041687864,0.00002302523,0.000018616825,0.00006177369,0.8740759,0.000013851667,0.123013936,0.00016246898,0.0004545372],"about_ca_topic_score_codex":0.0005216557,"about_ca_topic_score_gemma":0.00008119979,"teacher_disagreement_score":0.063420296,"about_ca_system_score_codex":0.00014310132,"about_ca_system_score_gemma":0.00022896387,"threshold_uncertainty_score":0.9997721},"labels":[],"label_agreement":null},{"id":"W4404636185","doi":"10.3390/e26121009","title":"A Hybrid Quantum Solver for the Lorenz System","year":2024,"lang":"en","type":"article","venue":"Entropy","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Lorenz system; Discretization; Solver; Nonlinear system; Applied mathematics; Quantum; Hybrid system; Euler method; Backward Euler method; Computer science; Set (abstract data type); Mathematics; Quantum system; Euler equations; Differential equation; Mathematical optimization; Mathematical analysis; Physics; Quantum mechanics; Attractor","score_opus":0.009369817358140633,"score_gpt":0.23165485270492658,"score_spread":0.22228503534678595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404636185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058998726,0.0020753744,0.98484886,0.0031498917,0.0031351044,0.00022013024,0.000008306934,0.0005801927,0.00008227411],"genre_scores_gemma":[0.97879684,0.000007127144,0.019808967,0.00020453881,0.0008866605,0.000036004145,0.000001650691,0.000016552494,0.00024163321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903464,0.00002914989,0.00014094896,0.0003243193,0.00018180477,0.00028912755],"domain_scores_gemma":[0.99911475,0.0003718762,0.000026204256,0.00041064603,0.00002636255,0.000050138897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002592532,0.00011910561,0.00010680104,0.000048851736,0.00021852636,0.00043088294,0.000703061,0.00001984958,0.000004373699],"category_scores_gemma":[0.000016448139,0.00006854416,0.00014100278,0.0001480492,0.00002927822,0.00008280612,0.00015319829,0.000144216,0.0000939576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036629706,0.000010328591,0.0000036171823,0.000086092594,0.000045912784,0.000048222144,0.00041573442,0.001896095,0.0001758799,0.93524015,0.019125301,0.042949017],"study_design_scores_gemma":[0.000098721604,0.000048846727,0.000028665661,0.000068810616,0.000009642294,0.00007477067,0.000015841928,0.9098727,0.00042882402,0.006697919,0.082561344,0.00009387538],"about_ca_topic_score_codex":0.000014977937,"about_ca_topic_score_gemma":4.193457e-7,"teacher_disagreement_score":0.972897,"about_ca_system_score_codex":0.000031873828,"about_ca_system_score_gemma":0.000051795865,"threshold_uncertainty_score":0.41550142},"labels":[],"label_agreement":null},{"id":"W4404746781","doi":"10.22331/q-2024-11-26-1539","title":"Bosonic Pauli+: Efficient Simulation of Concatenated Gottesman-Kitaev-Preskill Codes","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Army Research Office","keywords":"Pauli exclusion principle; Pauli matrices; Physics; Mathematics; Quantum mechanics","score_opus":0.01120676720321339,"score_gpt":0.2647724723922979,"score_spread":0.2535657051890845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404746781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5486426,0.0013956924,0.44740328,0.00065188546,0.0009055281,0.00017225691,0.000011028955,0.0005613124,0.0002564099],"genre_scores_gemma":[0.99658024,0.0000107048545,0.0031094516,0.00007839625,0.000102942846,0.000004384805,0.0000064186615,0.000018888868,0.00008858314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983029,0.00009399734,0.00040484933,0.000494005,0.00035462677,0.00034965563],"domain_scores_gemma":[0.9986105,0.000619468,0.00009930601,0.00049126305,0.00009167123,0.00008782218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003964118,0.00019588867,0.0002609984,0.00019737615,0.000108578155,0.00016732443,0.00064508244,0.00008297219,0.000014802967],"category_scores_gemma":[0.00009370272,0.00015722417,0.0001358346,0.00068685715,0.000080380705,0.00011110228,0.00022675774,0.00023716217,0.00008309579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008988658,0.00008870124,0.00003203583,0.00017171822,0.00005918991,0.000063222826,0.0012566852,0.91285527,0.0020026,0.06373489,0.00035191892,0.019374756],"study_design_scores_gemma":[0.0001788157,0.0001292156,0.0005222593,0.00020821711,0.000012163618,0.000014950181,0.0000140236425,0.98817194,0.0020301016,0.006546766,0.0019753373,0.00019621276],"about_ca_topic_score_codex":0.000033402634,"about_ca_topic_score_gemma":0.0000016241704,"teacher_disagreement_score":0.44793764,"about_ca_system_score_codex":0.000038251677,"about_ca_system_score_gemma":0.00008565751,"threshold_uncertainty_score":0.6411416},"labels":[],"label_agreement":null},{"id":"W4404800790","doi":"10.1017/9781009417020.006","title":"Optics","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Optics; Physics","score_opus":0.01430598313308078,"score_gpt":0.19146682384114763,"score_spread":0.17716084070806684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404800790","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012815095,0.00031529664,0.035841055,0.00008163328,0.0009021921,0.0001597028,0.00006038176,0.00063611596,0.96199083],"genre_scores_gemma":[0.00011892759,0.000048549296,0.005249684,0.00007545958,0.00027476266,1.5255452e-7,0.000008249208,0.00003977351,0.99418443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851674,0.000014599896,0.00015389804,0.0007156175,0.00029628506,0.00030284663],"domain_scores_gemma":[0.99871,0.0000621891,0.000107626496,0.00086101994,0.00008727563,0.00017191937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000080160724,0.0003696996,0.00031028347,0.00022126311,0.00016528335,0.00020775398,0.0014984374,0.00027708133,0.0000010110174],"category_scores_gemma":[0.0000028045065,0.00039618628,0.00025717606,0.000015004396,0.0001239748,0.00006783207,0.0015652216,0.0007584754,0.000071498966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029092253,0.0000031118961,2.2940844e-8,0.000063000385,0.000077518765,0.000980891,0.000043849173,0.000069722104,0.0000055199903,0.9766417,0.01560987,0.0065018455],"study_design_scores_gemma":[0.00012817862,0.000047490215,5.5754293e-7,0.00022363244,0.00006622627,0.000071031965,0.000002290597,0.06534293,0.000056886747,0.0005223885,0.933094,0.00044436252],"about_ca_topic_score_codex":0.000016739954,"about_ca_topic_score_gemma":2.3206235e-7,"teacher_disagreement_score":0.97611934,"about_ca_system_score_codex":0.00008911925,"about_ca_system_score_gemma":0.00010835495,"threshold_uncertainty_score":0.999849},"labels":[],"label_agreement":null},{"id":"W4404800815","doi":"10.1017/9781009417020","title":"Building Quantum Computers","year":2024,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.01255408776605771,"score_gpt":0.20472476695979355,"score_spread":0.19217067919373584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404800815","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006169131,0.00039554303,0.3524919,0.000090608446,0.0023269574,0.0002518719,0.000062773324,0.0011088004,0.6432099],"genre_scores_gemma":[0.0001614855,0.00002025457,0.020909078,0.00015770902,0.0005343551,5.078867e-7,0.000015916788,0.00006140178,0.9781393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99743855,0.00009685618,0.00025307646,0.0011809855,0.00045978758,0.00057072454],"domain_scores_gemma":[0.9981527,0.00018996323,0.00019209825,0.0010938596,0.00010693779,0.00026445833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018525754,0.00056057546,0.0005269426,0.00043680656,0.00029305,0.0004303145,0.0027295707,0.00036210346,3.4925216e-7],"category_scores_gemma":[0.0000069314606,0.0006121309,0.0004003142,0.00006390547,0.00017459253,0.00013576302,0.0025789596,0.0011737117,0.000041369105],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040246196,0.000006729931,4.677837e-8,0.00014456488,0.00010050251,0.0009945639,0.00007033734,0.00020246922,0.000013629328,0.7456933,0.24324815,0.009521678],"study_design_scores_gemma":[0.00018502337,0.000053780008,0.0000014472006,0.00049244234,0.00006204864,0.00008588032,0.000002407731,0.24864145,0.00005195822,0.00025671272,0.7496302,0.0005366219],"about_ca_topic_score_codex":0.00004938678,"about_ca_topic_score_gemma":2.4510396e-7,"teacher_disagreement_score":0.7454366,"about_ca_system_score_codex":0.0003354599,"about_ca_system_score_gemma":0.00046508698,"threshold_uncertainty_score":0.999633},"labels":[],"label_agreement":null},{"id":"W4404800852","doi":"10.1017/9781009417020.009","title":"Benchmarking","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Benchmarking; Business","score_opus":0.013206653195812372,"score_gpt":0.1894690448662341,"score_spread":0.1762623916704217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404800852","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001731316,0.00035555617,0.034688096,0.000057770743,0.0011256365,0.00016259786,0.000043891327,0.0006027478,0.9629464],"genre_scores_gemma":[0.00025756969,0.00003298014,0.0041706157,0.00007514157,0.00042847762,1.9184036e-7,0.000010142215,0.000037996753,0.9949869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983719,0.000017828766,0.00016176884,0.00081293896,0.00030970847,0.00032585408],"domain_scores_gemma":[0.9987727,0.00007086649,0.00012202768,0.00079993583,0.00007288019,0.00016163311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010254499,0.00038353287,0.00031852105,0.00026077675,0.00020742293,0.00022369124,0.0014260153,0.0002662681,0.0000017298617],"category_scores_gemma":[0.0000021263343,0.00041469073,0.00027833806,0.000016999014,0.000109961744,0.0000795003,0.0016146607,0.000776615,0.000049128543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002863124,0.0000025011136,6.271573e-8,0.000064750406,0.00007625627,0.000931922,0.000054996864,0.000052145406,0.0000059441063,0.9611402,0.017229384,0.020438973],"study_design_scores_gemma":[0.00011594899,0.000046854933,0.0000014756653,0.0003336681,0.000056658217,0.0000670129,0.000001812503,0.058326222,0.000038192313,0.0003277084,0.9402314,0.0004530659],"about_ca_topic_score_codex":0.000032601936,"about_ca_topic_score_gemma":4.5061444e-7,"teacher_disagreement_score":0.9608125,"about_ca_system_score_codex":0.000112062036,"about_ca_system_score_gemma":0.0001027717,"threshold_uncertainty_score":0.9998305},"labels":[],"label_agreement":null},{"id":"W4404800952","doi":"10.1017/9781009417020.011","title":"Index","year":2024,"lang":"en","type":"paratext","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Index (typography); Computer science; World Wide Web","score_opus":0.011906675194300661,"score_gpt":0.20970835110131272,"score_spread":0.19780167590701206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404800952","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016982204,0.00072786375,0.16482227,0.000091351336,0.004321122,0.00019908704,0.00012465502,0.00038810036,0.82915574],"genre_scores_gemma":[0.0017135087,0.000054940578,0.0017166759,0.000130021,0.00053480343,7.10053e-7,0.000026927499,0.000035261903,0.99578714],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800515,0.00011090572,0.00016682295,0.00092149223,0.0003294902,0.00046613303],"domain_scores_gemma":[0.9985598,0.00007184258,0.00012091743,0.0009671574,0.00008718933,0.00019311145],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010341973,0.00040535544,0.00038188705,0.00032368014,0.00021689468,0.00036990046,0.0023050068,0.00034641984,0.000003743369],"category_scores_gemma":[0.0000045954584,0.00042024764,0.00025770976,0.00009718075,0.00010815331,0.00009529135,0.0020518068,0.001044752,0.0008824546],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005550769,0.000010984047,1.4787965e-7,0.00016243658,0.000090304995,0.00043772164,0.00008574578,0.00040827267,0.000013338651,0.11008873,0.8801179,0.008578849],"study_design_scores_gemma":[0.0001758266,0.000035651483,0.000004043886,0.00021093935,0.000028889115,0.000045647095,0.0000067073283,0.08834236,0.00017132684,0.0000033731371,0.91053426,0.00044098924],"about_ca_topic_score_codex":0.00021622138,"about_ca_topic_score_gemma":4.1954792e-7,"teacher_disagreement_score":0.16663142,"about_ca_system_score_codex":0.000119167686,"about_ca_system_score_gemma":0.000262703,"threshold_uncertainty_score":0.99989545},"labels":[],"label_agreement":null},{"id":"W4404801211","doi":"10.1017/9781009417020.010","title":"References","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.019050401187309583,"score_gpt":0.19759349170731008,"score_spread":0.1785430905200005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404801211","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023024133,0.00042279524,0.012110594,0.00008847473,0.00082901487,0.00014500669,0.0000592301,0.00064168195,0.98568016],"genre_scores_gemma":[0.00040816027,0.00005048489,0.002213496,0.000061961015,0.00022144963,1.9937114e-7,0.000008605282,0.000028432883,0.9970072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984688,0.000019204013,0.00015235388,0.0007695265,0.0003041308,0.0002859708],"domain_scores_gemma":[0.99881744,0.00006530305,0.00011537286,0.00076797407,0.00008093889,0.00015296116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000087222776,0.00035955152,0.00031299324,0.00023123069,0.00017709985,0.00021476917,0.0015985117,0.00026152827,0.000001638129],"category_scores_gemma":[0.0000026987223,0.00036070947,0.00022468102,0.000015832373,0.00013057077,0.00007774798,0.0013387477,0.0007146533,0.00007696833],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032707374,0.00000249679,4.909135e-8,0.000054319626,0.00006742817,0.00057109026,0.000051507184,0.000016874597,0.0000043909486,0.96729004,0.019719498,0.012219027],"study_design_scores_gemma":[0.00010456846,0.0000529754,0.0000014786634,0.00027077663,0.000051711464,0.000046142657,0.0000034455788,0.016270617,0.000050616756,0.0007193997,0.98200077,0.00042748905],"about_ca_topic_score_codex":0.000044443754,"about_ca_topic_score_gemma":7.8284404e-7,"teacher_disagreement_score":0.9665707,"about_ca_system_score_codex":0.00007675276,"about_ca_system_score_gemma":0.00011542817,"threshold_uncertainty_score":0.9998845},"labels":[],"label_agreement":null},{"id":"W4404801292","doi":"10.1017/9781009417020.004","title":"Review of Quantum Mechanics for Quantum Computing","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum mechanics; Physics; Theoretical physics; Statistical physics; Computer science","score_opus":0.02177184890905035,"score_gpt":0.22500781905827147,"score_spread":0.20323597014922112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404801292","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032150708,0.014406332,0.6439299,0.00014621137,0.0013007732,0.0008727533,0.00027409598,0.00041273117,0.33865398],"genre_scores_gemma":[0.0002857334,0.005078062,0.011668518,0.00067213486,0.0004727924,0.000001655247,0.000077556964,0.00014898517,0.98159456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977763,0.000041860105,0.00047584984,0.00093394064,0.00036051185,0.00041149586],"domain_scores_gemma":[0.99767464,0.0002731275,0.00050618267,0.0010366766,0.00034703384,0.00016232861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043654582,0.0005063191,0.00085108593,0.00025906667,0.0001972453,0.00007392323,0.0018239854,0.0002870079,9.356885e-7],"category_scores_gemma":[0.000025655207,0.00053484633,0.0006446825,0.000037774385,0.0000941718,0.00007016965,0.0014195536,0.00062596967,0.000009835507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008414949,0.000008091678,8.6292244e-9,0.008176365,0.0001349424,0.00007702283,0.00004169358,0.000048924037,0.000012875116,0.9573234,0.028230265,0.005938035],"study_design_scores_gemma":[0.00018041574,0.00010370922,7.1627404e-8,0.01304578,0.0001640678,0.000034084274,0.0000033459962,0.37291747,0.000048835747,0.0016500794,0.6114475,0.00040460424],"about_ca_topic_score_codex":0.000026040289,"about_ca_topic_score_gemma":2.0203493e-7,"teacher_disagreement_score":0.9556733,"about_ca_system_score_codex":0.00010181907,"about_ca_system_score_gemma":0.00020911092,"threshold_uncertainty_score":0.9997103},"labels":[],"label_agreement":null},{"id":"W4404848023","doi":"10.1109/focs61266.2024.00138","title":"Constant-Depth Arithmetic Circuits for Linear Algebra Problems","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Constant (computer programming); Arithmetic; Algebra over a field; Mathematics; Saturation arithmetic; Linear algebra; Computer science; Arbitrary-precision arithmetic; Pure mathematics","score_opus":0.02017759522979822,"score_gpt":0.25835048522451415,"score_spread":0.23817288999471592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404848023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021582753,0.0007904819,0.98811686,0.002540285,0.0010123743,0.0003541853,0.0000066331263,0.0011173683,0.0039035557],"genre_scores_gemma":[0.7278571,0.000016665765,0.26878062,0.0008138935,0.00048348,0.00004957498,0.0000058662376,0.0000376341,0.0019551371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859506,0.000026013284,0.00022962796,0.0005502701,0.00020410256,0.00039492987],"domain_scores_gemma":[0.9991503,0.00028339325,0.000027187061,0.0003670153,0.00006175352,0.00011034977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031880467,0.0001712194,0.00016777018,0.00014162985,0.00013438206,0.000405532,0.00060236885,0.0000616387,0.0000137305615],"category_scores_gemma":[0.000031395834,0.00012932092,0.00012468746,0.00046344023,0.000048086098,0.0001627923,0.00016676675,0.00018558855,0.00008108411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.65113e-7,0.000040304018,0.000012754289,0.00019095658,0.00004471341,0.000033306576,0.0006431066,0.002003161,0.0005964196,0.39589128,0.0030513727,0.597492],"study_design_scores_gemma":[0.00015423687,0.00013229523,0.00002406693,0.00009618301,0.0000066121215,0.00009034348,0.000006505675,0.92113274,0.0006126671,0.04144084,0.036100663,0.00020282979],"about_ca_topic_score_codex":0.000009967868,"about_ca_topic_score_gemma":0.0000052593987,"teacher_disagreement_score":0.9191296,"about_ca_system_score_codex":0.00001910805,"about_ca_system_score_gemma":0.00013257899,"threshold_uncertainty_score":0.5273554},"labels":[],"label_agreement":null},{"id":"W4404955759","doi":"10.1109/micro61859.2024.00060","title":"Qoncord: A Multi-Device Job Scheduling Framework for Variational Quantum Algorithms","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Council Sri Lanka","keywords":"Computer science; Quantum; Scheduling (production processes); Algorithm; Distributed computing; Mathematical optimization; Mathematics; Physics; Quantum mechanics","score_opus":0.02916871311480128,"score_gpt":0.3097457619310362,"score_spread":0.2805770488162349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404955759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017378,0.0007002519,0.9887645,0.0045819194,0.0027736994,0.0002601705,0.000011757625,0.0010443191,0.000125555],"genre_scores_gemma":[0.050301243,0.0000070192873,0.9477005,0.00073652033,0.00089388073,0.000039171475,0.000005531194,0.000027820899,0.0002883018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981061,0.00004615228,0.00032331463,0.000738021,0.00032538868,0.0004609989],"domain_scores_gemma":[0.99827117,0.0009954496,0.00005175666,0.00042788405,0.00011638194,0.00013736374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005361057,0.00023428573,0.00020791563,0.00017985654,0.0002800924,0.0007054082,0.0008300867,0.00013819616,0.000026337088],"category_scores_gemma":[0.00016923936,0.00019183193,0.00018769024,0.00066837436,0.00002993489,0.000300702,0.000268803,0.0004013845,0.000101189165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000266531,0.00004780223,0.000027037466,0.000070846116,0.000053319338,0.000017919321,0.0006969451,0.010477791,0.00008293245,0.8984636,0.00035570815,0.08970344],"study_design_scores_gemma":[0.00017184117,0.0000716542,0.00025332093,0.00014020722,0.000008475225,0.000031413747,0.00001754932,0.86958396,0.00007258696,0.1225066,0.006888319,0.0002540878],"about_ca_topic_score_codex":0.000034332632,"about_ca_topic_score_gemma":0.000003381708,"teacher_disagreement_score":0.8591061,"about_ca_system_score_codex":0.00004099299,"about_ca_system_score_gemma":0.00020288235,"threshold_uncertainty_score":0.7822679},"labels":[],"label_agreement":null},{"id":"W4404986612","doi":"10.48550/arxiv.2411.15631","title":"Understanding and Estimating the Execution Time of Quantum Circuits","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Computer science; Quantum; Execution time; Parallel computing; Physics; Quantum mechanics","score_opus":0.09009053770045673,"score_gpt":0.19724585308897544,"score_spread":0.1071553153885187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404986612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2648246,0.00013105437,0.73363626,0.00022111046,0.0004909227,0.00012424297,0.000005885405,0.00015182684,0.00041408907],"genre_scores_gemma":[0.99771833,0.000015334692,0.0020246063,0.00002495987,0.00007784464,2.038943e-7,0.000002292918,0.0000122058045,0.0001242417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874395,0.000106018706,0.00016987893,0.00066532,0.00009367837,0.00022117184],"domain_scores_gemma":[0.99890774,0.00021173488,0.0001882559,0.0005832218,0.000044505385,0.000064541426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003741757,0.00020822005,0.00023170417,0.00017584678,0.00020614451,0.0001548694,0.00085587887,0.00013193418,0.0000029632902],"category_scores_gemma":[0.000027721127,0.00017526021,0.000114299284,0.0004477508,0.00015506275,0.00007590277,0.002400548,0.000613453,0.0000129024165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019835134,0.000014565144,0.000046377278,0.00018089126,0.00006347297,0.0000759908,0.0011074924,0.6492392,0.000068763205,0.34748098,0.0001189938,0.0016013103],"study_design_scores_gemma":[0.00006590115,0.000023313485,0.00007835257,0.00025875116,0.000033463944,0.000012588682,0.000049199454,0.72206366,0.000021824535,0.27724883,0.0000074569784,0.00013664187],"about_ca_topic_score_codex":0.000045920056,"about_ca_topic_score_gemma":0.0000020224984,"teacher_disagreement_score":0.7328937,"about_ca_system_score_codex":0.0001014379,"about_ca_system_score_gemma":0.000107806605,"threshold_uncertainty_score":0.7146904},"labels":[],"label_agreement":null},{"id":"W4405098288","doi":"10.1088/1402-4896/ad9b5c","title":"Stream ciphers for digital image transactions by learning quantum true random numbers","year":2024,"lang":"en","type":"article","venue":"Physica Scripta","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"State Key Laboratory of Particle Detection and Electronics","keywords":"Computer science; Stream cipher; Image (mathematics); Theoretical computer science; Algorithm; Cryptography; Artificial intelligence","score_opus":0.00635564843455739,"score_gpt":0.2322639252962869,"score_spread":0.2259082768617295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405098288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010415273,0.00026644042,0.9839876,0.0018134094,0.0013965197,0.00022841721,0.00006449676,0.0007778212,0.0010499851],"genre_scores_gemma":[0.9892009,0.000007542257,0.00839427,0.00007964844,0.00024829363,0.00003806359,0.000025013314,0.000037638307,0.0019686236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857926,0.00003653562,0.00019175287,0.000567326,0.00021934512,0.00040575516],"domain_scores_gemma":[0.99933535,0.00016404374,0.000041278185,0.00030268522,0.000039090224,0.000117563766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112814836,0.00021796151,0.00022344642,0.00006434191,0.00029349353,0.0010334015,0.0005138765,0.00004027189,0.000010905614],"category_scores_gemma":[0.0000203058,0.0001931926,0.00028303516,0.00033656124,0.00006991668,0.00071306835,0.000042079286,0.00033005312,0.00006164251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007565041,0.00043829725,0.00000798191,0.00027179468,0.00039675186,0.00004076391,0.0071879784,0.008083426,0.02135196,0.019363282,0.14529991,0.7974822],"study_design_scores_gemma":[0.00053072127,0.00012191257,0.0000057722364,0.00005275126,0.000018442453,0.000009905511,0.0001065548,0.90144897,0.0008336044,0.0043894285,0.09223507,0.00024684094],"about_ca_topic_score_codex":0.000029371206,"about_ca_topic_score_gemma":9.93533e-7,"teacher_disagreement_score":0.97878563,"about_ca_system_score_codex":0.000030722138,"about_ca_system_score_gemma":0.000058792524,"threshold_uncertainty_score":0.9965114},"labels":[],"label_agreement":null},{"id":"W4405187177","doi":"10.1103/prxquantum.5.040339","title":"Initial State Preparation for Quantum Chemistry on Quantum Computers","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Institute for Information and Communications Technology Promotion; Ministry of Education, Science and Technology; National Research Foundation of Korea","keywords":"Computer science; Ground state; State (computer science); Ansatz; Statistical physics; Metric (unit); Quality (philosophy); Quantum; Work (physics); Mathematical optimization; Scaling; Algorithm; Mathematics; Physics; Quantum mechanics; Engineering","score_opus":0.016584298511534333,"score_gpt":0.2916766647550958,"score_spread":0.2750923662435615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405187177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17267512,0.00045425104,0.8180271,0.0025565927,0.0039198236,0.0005795204,0.00006197396,0.0014127543,0.00031286743],"genre_scores_gemma":[0.9875316,0.000020354862,0.010611335,0.0005007583,0.0008832198,0.00009316585,0.000059440794,0.000069003945,0.00023112106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967807,0.00010426668,0.00060513953,0.0011936431,0.00053627434,0.0007799992],"domain_scores_gemma":[0.9979822,0.0007154051,0.00015272212,0.0008004884,0.00012435025,0.00022484308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065338553,0.00046297122,0.0003942951,0.0001936511,0.000357015,0.0008704922,0.0010926883,0.00014574506,0.000013540739],"category_scores_gemma":[0.00009859377,0.00041422292,0.00029118356,0.00055715843,0.00009597507,0.0004079265,0.00028447356,0.0004917501,0.00013309623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047067535,0.00079240114,0.000025685293,0.0019557162,0.00044618887,0.0004623809,0.008426441,0.06726026,0.014429219,0.62823063,0.057163563,0.22033685],"study_design_scores_gemma":[0.0004095538,0.0005589425,0.00004857443,0.00027880014,0.000014462176,0.00006480755,0.000015519117,0.9115091,0.0059966845,0.053755775,0.02684924,0.0004985324],"about_ca_topic_score_codex":0.000023082528,"about_ca_topic_score_gemma":0.0000015612045,"teacher_disagreement_score":0.84424883,"about_ca_system_score_codex":0.000098477285,"about_ca_system_score_gemma":0.00026385885,"threshold_uncertainty_score":0.99983096},"labels":[],"label_agreement":null},{"id":"W4405187315","doi":"10.1103/physreva.110.062412","title":"Quadratic quantum speedup for perceptron training","year":2024,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Speedup; Quadratic equation; Training (meteorology); Quantum; Computer science; Perceptron; Parallel computing; Artificial intelligence; Algorithm; Machine learning; Mathematics; Artificial neural network; Physics; Quantum mechanics; Geometry","score_opus":0.029751578056825375,"score_gpt":0.3789949209688409,"score_spread":0.34924334291201553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405187315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070002496,0.34470916,0.55121124,0.025371047,0.001564081,0.004156972,0.000051192674,0.0015258231,0.0014079764],"genre_scores_gemma":[0.9095847,0.05954357,0.016317474,0.00917274,0.004226034,0.0007303757,0.00005304932,0.00017387158,0.00019820391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958509,0.0003123294,0.00074272044,0.0013630483,0.0007934279,0.00093758194],"domain_scores_gemma":[0.9968792,0.001272948,0.0001900198,0.0011233673,0.0001384203,0.00039599813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085244764,0.0006565342,0.0016813099,0.00008108333,0.00023108562,0.00029419144,0.0014803606,0.00004351113,0.000017403027],"category_scores_gemma":[0.0006324343,0.00047177513,0.0014950013,0.0012637766,0.00013011313,0.00043266936,0.0003518252,0.00074756355,0.0006032701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042170363,0.00040554366,0.0000018859553,0.023275498,0.000107366264,0.0000348024,0.0010515405,0.000060896105,0.0061610783,0.2604956,0.012329937,0.6960716],"study_design_scores_gemma":[0.00015144706,0.0004250586,0.000038394166,0.026686192,0.00026608765,0.000035643734,0.000007732196,0.7388496,0.00037068457,0.112806164,0.11966726,0.00069577806],"about_ca_topic_score_codex":0.000007221283,"about_ca_topic_score_gemma":8.121452e-7,"teacher_disagreement_score":0.8395822,"about_ca_system_score_codex":0.0000802287,"about_ca_system_score_gemma":0.00023118412,"threshold_uncertainty_score":0.9997734},"labels":[],"label_agreement":null},{"id":"W4405219046","doi":"10.36227/techrxiv.173388214.48550690/v1","title":"An In-Depth Comparative Study of Quantum-Classical Encoding Methods for Network Intrusion Detection","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec en Outaouais","funders":"Mitacs","keywords":"Computer science; Encoding (memory); Quantum; Intrusion detection system; Theoretical computer science; Key (lock); Quantum computer; Exploit; Qubit; Embedding; ENCODE; Curse of dimensionality; Algorithm; Artificial intelligence; Computer security","score_opus":0.053549132241425317,"score_gpt":0.3884286706096716,"score_spread":0.3348795383682463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405219046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2606362,0.00014206658,0.7358112,0.000086103806,0.002029162,0.0009213943,0.0000014375091,0.00022735562,0.00014512263],"genre_scores_gemma":[0.65619326,0.0000027592544,0.343394,0.000015395675,0.00030340184,0.00006604118,0.000002386663,0.000014889021,0.00000785475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665374,0.0008134539,0.0007195533,0.0011564122,0.0002656939,0.0003911444],"domain_scores_gemma":[0.9979366,0.0007493714,0.00027307938,0.00081706187,0.00012284126,0.000101061225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018455894,0.0003721871,0.0007822843,0.00036060796,0.00013897935,0.00024773917,0.0011448743,0.00023271127,0.000001920094],"category_scores_gemma":[0.000040608553,0.0003004576,0.00017136835,0.00066542847,0.00004371114,0.000079472775,0.0023627733,0.0011611781,0.0000018241489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050303468,0.0006480402,0.00007513849,0.00019860215,0.000095195996,0.000008822085,0.013559425,0.49628586,0.0014331031,0.014050691,0.00005910619,0.47353572],"study_design_scores_gemma":[0.00030433288,0.0011060587,0.00057785667,0.00021141284,0.000025077605,0.000005077006,0.00039459032,0.9099709,0.0013051614,0.08572589,0.000074586416,0.00029905883],"about_ca_topic_score_codex":0.00016972423,"about_ca_topic_score_gemma":0.00034585752,"teacher_disagreement_score":0.47323665,"about_ca_system_score_codex":0.00008549455,"about_ca_system_score_gemma":0.00012392177,"threshold_uncertainty_score":0.99994475},"labels":[],"label_agreement":null},{"id":"W4405319517","doi":"10.1103/physreva.110.062418","title":"Disentangling quantum neural networks for unified estimation of quantum entropies and distance measures","year":2024,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning","keywords":"Quantum; Artificial neural network; Estimation; Statistical physics; Computer science; Mathematics; Artificial intelligence; Physics; Quantum mechanics; Engineering","score_opus":0.01575163856763138,"score_gpt":0.3292399995289899,"score_spread":0.3134883609613585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405319517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033988852,0.22804525,0.7340152,0.0024696963,0.0003154942,0.00093985,0.000019797644,0.00018918868,0.000016658698],"genre_scores_gemma":[0.95613587,0.04036963,0.0023444958,0.00049877225,0.00046962925,0.0001198784,0.00002167559,0.00003478372,0.0000052480414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997342,0.00023139275,0.000626539,0.00079162675,0.0005295835,0.00047886453],"domain_scores_gemma":[0.99768966,0.0011094018,0.00025166915,0.0006186352,0.00013496865,0.00019565265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045787657,0.00041951393,0.0011659295,0.000048792244,0.00015032882,0.00015074252,0.0006381895,0.00003030313,0.0000010050936],"category_scores_gemma":[0.0005028603,0.00030065404,0.00057948736,0.0007843006,0.00016367475,0.00032653945,0.00024574422,0.00037990868,0.000007290746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013382385,0.00024551776,0.000025435927,0.017962966,0.000083735584,0.000011658697,0.00021518851,0.0056693503,0.0005612305,0.48921418,0.0009016827,0.48509568],"study_design_scores_gemma":[0.00011320099,0.00017912657,0.00006622769,0.012520454,0.00017815937,0.000007684308,0.0000020128123,0.9207289,0.00021491414,0.062484894,0.0031994134,0.0003050087],"about_ca_topic_score_codex":0.000005630383,"about_ca_topic_score_gemma":7.246172e-7,"teacher_disagreement_score":0.92214704,"about_ca_system_score_codex":0.000032987788,"about_ca_system_score_gemma":0.000049967664,"threshold_uncertainty_score":0.99994457},"labels":[],"label_agreement":null},{"id":"W4405467377","doi":"10.1016/j.cose.2024.104272","title":"Evaluation framework for quantum security risk assessment: A comprehensive strategy for quantum-safe transition","year":2024,"lang":"en","type":"article","venue":"Computers & Security","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Université de Montréal","funders":"","keywords":"Computer science; Quantum; Risk analysis (engineering); Computer security; Business; Quantum mechanics; Physics","score_opus":0.030072223620043567,"score_gpt":0.33326368270097917,"score_spread":0.3031914590809356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405467377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07088488,0.0019840389,0.91719115,0.0024780054,0.004173446,0.0021637292,0.0002972589,0.00078723143,0.000040250903],"genre_scores_gemma":[0.83645976,0.000062538544,0.1617195,0.0003937811,0.0009422033,0.00023218321,0.00014015539,0.00004837098,0.0000015108677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953874,0.00063732476,0.0007064729,0.0015153587,0.000923492,0.0008299958],"domain_scores_gemma":[0.99544907,0.0023258852,0.00026530406,0.00086677534,0.00084586965,0.00024711475],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022596917,0.00056005,0.000602026,0.0002981263,0.0007393952,0.0011291144,0.0011070055,0.0003188383,0.000011191382],"category_scores_gemma":[0.0001264751,0.00054293865,0.00058309943,0.0007328424,0.00012689174,0.0006551127,0.00021679605,0.00092496356,0.0000121390785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069018206,0.00040930317,0.000009490311,0.0008895052,0.00042386074,0.000025725347,0.011213149,0.07390529,0.00008258792,0.6900748,0.0057653547,0.21713191],"study_design_scores_gemma":[0.00055957044,0.00046437175,0.00016314382,0.0002455428,0.00010429817,0.000021014335,0.00007150198,0.54773736,0.000043936318,0.44693422,0.0032960495,0.0003589918],"about_ca_topic_score_codex":0.00006343785,"about_ca_topic_score_gemma":0.000011688755,"teacher_disagreement_score":0.7655749,"about_ca_system_score_codex":0.00023355919,"about_ca_system_score_gemma":0.00052501366,"threshold_uncertainty_score":0.9999078},"labels":[],"label_agreement":null},{"id":"W4405499747","doi":"10.22331/q-2024-12-17-1567","title":"Quantum simulation of time-dependent Hamiltonians via commutator-free quasi-Magnus operators","year":2024,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Commutator; Mathematical physics; Quantum; Mathematics; Physics; Quantum mechanics; Pure mathematics; Algebra over a field","score_opus":0.00884330167285071,"score_gpt":0.24756007079365758,"score_spread":0.23871676912080686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405499747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20831369,0.0011817581,0.78660405,0.0010902854,0.0015454653,0.0002461651,0.00003139678,0.0007760311,0.0002111479],"genre_scores_gemma":[0.9941525,0.000015805294,0.0052546305,0.00015077292,0.00019193861,0.000007912283,0.000009152731,0.000049858554,0.00016743717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972421,0.00022666815,0.0006360083,0.0007065441,0.00066616933,0.000522529],"domain_scores_gemma":[0.9976282,0.00054514036,0.0001311257,0.0013868795,0.00013741358,0.00017123902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006708248,0.00035334416,0.00042890338,0.00032590542,0.00023063461,0.0003476549,0.0017281077,0.00014579446,0.000046541976],"category_scores_gemma":[0.00009626117,0.00030745508,0.00021361253,0.00081425585,0.00012294088,0.00038853535,0.0006215189,0.0004510603,0.0002899022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047233105,0.00078198203,0.0003272985,0.0005466871,0.00030035275,0.0005994822,0.008356315,0.76440233,0.011949962,0.07539558,0.0044345227,0.13285826],"study_design_scores_gemma":[0.00029732662,0.0003587954,0.00016565333,0.00017327876,0.000015798467,0.000059214475,0.000029552175,0.9798347,0.0012650972,0.014937785,0.0024947543,0.00036808697],"about_ca_topic_score_codex":0.0001364747,"about_ca_topic_score_gemma":0.000011606492,"teacher_disagreement_score":0.7858388,"about_ca_system_score_codex":0.000071281516,"about_ca_system_score_gemma":0.00018024158,"threshold_uncertainty_score":0.9999378},"labels":[],"label_agreement":null},{"id":"W4405562843","doi":"10.1038/s41467-025-67694-5","title":"Factoring an integer with three oscillators and a qubit","year":2025,"lang":"en","type":"preprint","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Integer (computer science); Factoring; Qubit; Mathematics; Combinatorics; Discrete mathematics; Computer science; Physics; Quantum mechanics; Business; Quantum; Operating system","score_opus":0.01999318081709288,"score_gpt":0.29459987211444594,"score_spread":0.27460669129735304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405562843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11670761,0.031333584,0.8027264,0.034872435,0.0027042648,0.0017907318,0.00017294078,0.0023619253,0.007330113],"genre_scores_gemma":[0.74538386,0.00016681683,0.25389895,0.00035453195,0.00006899738,0.00003329734,0.000031658357,0.000013075825,0.00004880865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853027,0.00013085663,0.00022765333,0.00062891137,0.00024289022,0.00023939325],"domain_scores_gemma":[0.9943062,0.0002967857,0.00016338567,0.0049114614,0.00020017287,0.00012197297],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00024609565,0.0003068432,0.00030338758,0.0002439187,0.0004528564,0.00042056057,0.004669909,0.0004991279,0.0000010131356],"category_scores_gemma":[0.000056320245,0.00024511942,0.00006718424,0.00040831833,0.00015225075,0.0001486395,0.0071213106,0.003774805,0.0000012642373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025561187,0.0005569772,0.026460132,0.00038363738,0.0006136918,0.000019323845,0.016629307,0.0150395,0.00007035363,0.6192689,0.0010420646,0.31989053],"study_design_scores_gemma":[0.0002915754,0.0001006072,0.019646496,0.00075092114,0.000052056366,0.00003400799,0.000044094166,0.92591405,0.000045114823,0.016464887,0.035896204,0.00075997424],"about_ca_topic_score_codex":0.0001153392,"about_ca_topic_score_gemma":0.0008110739,"teacher_disagreement_score":0.91087455,"about_ca_system_score_codex":0.000054021046,"about_ca_system_score_gemma":0.00027017953,"threshold_uncertainty_score":0.9995679},"labels":[],"label_agreement":null},{"id":"W4405564322","doi":"","title":"Quantum Codes from Group Ring Codes","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; United Arab Emirates University; Agence Nationale de la Recherche","keywords":"Ring (chemistry); Group (periodic table); Quantum; Group code; Computer science; Block code; Physics; Linear code; Algorithm; Quantum mechanics; Decoding methods; Chemistry","score_opus":0.03856490608072963,"score_gpt":0.18843120263848243,"score_spread":0.1498662965577528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405564322","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54281265,0.00048808957,0.45295498,0.00020290085,0.0017472784,0.00014241751,0.000067836896,0.00084279774,0.0007410313],"genre_scores_gemma":[0.9908692,0.00014315937,0.008067049,0.00012571353,0.00036539792,7.762441e-7,0.00004545929,0.000037292182,0.00034594105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708074,0.00017088777,0.00026118517,0.0018161322,0.00015567339,0.00051535346],"domain_scores_gemma":[0.9978213,0.00027482014,0.0001913721,0.001419528,0.00007611327,0.00021687166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026983503,0.0004958963,0.00050276786,0.00031698673,0.00024357867,0.00049430487,0.0026208868,0.00032661826,0.000018574896],"category_scores_gemma":[0.000023561946,0.0005176166,0.0003499665,0.0006081235,0.00013442499,0.00013905243,0.0065871403,0.0014366722,0.00021831223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015646481,0.00009723709,0.0003621407,0.00017034616,0.0002853566,0.0015544166,0.00095574436,0.6114617,0.00012335156,0.37978312,0.0006231027,0.004567833],"study_design_scores_gemma":[0.00015107862,0.00003258271,0.0003475297,0.00030357894,0.000054593038,0.0000057105444,0.000038105773,0.72097623,0.00006437687,0.27686596,0.0007191455,0.00044113636],"about_ca_topic_score_codex":0.0011511695,"about_ca_topic_score_gemma":0.00009472148,"teacher_disagreement_score":0.44805655,"about_ca_system_score_codex":0.00014249599,"about_ca_system_score_gemma":0.00013465538,"threshold_uncertainty_score":0.99972755},"labels":[],"label_agreement":null},{"id":"W4405612265","doi":"10.4018/979-8-3693-8135-9.ch003","title":"Investigating the Potential","year":2024,"lang":"en","type":"book-chapter","venue":"Advances in computational intelligence and robotics book series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Quantum computer; Computer science; Quantum; Artificial intelligence; Health care; Data science; Physics; Quantum mechanics","score_opus":0.014793555726730082,"score_gpt":0.26115174991005374,"score_spread":0.24635819418332366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405612265","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003784783,0.06499971,0.89041984,0.0065057157,0.0013882966,0.0002464378,0.000010555352,0.00017055857,0.036255088],"genre_scores_gemma":[0.0110545745,0.03760468,0.7216223,0.0039384603,0.0016319139,0.000031584575,0.00007557382,0.00017584636,0.22386506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833226,0.000019978783,0.00046171417,0.0005659594,0.0003753315,0.00024475972],"domain_scores_gemma":[0.9990605,0.00035179232,0.00016115497,0.00026338742,0.0000965568,0.00006661878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018542257,0.00033642547,0.00027247745,0.00015953937,0.00027150023,0.0003259996,0.00066433055,0.00012539388,0.000008630911],"category_scores_gemma":[0.000019010546,0.00024612632,0.00008740829,0.000106860076,0.00050112064,0.0006686307,0.0005605665,0.0007026318,0.000037465295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.3807823e-7,0.0000020861135,8.4520696e-7,0.00003678123,0.00000952977,0.000023167659,0.00017542735,0.4897075,1.8363889e-7,0.48784342,0.000023521252,0.022176905],"study_design_scores_gemma":[0.000012227218,0.000041356827,0.0000034534692,0.0002775088,0.000006982391,0.00010639171,0.000015315212,0.43432012,0.0000033271021,0.5399599,0.02507778,0.00017561762],"about_ca_topic_score_codex":0.0000027690114,"about_ca_topic_score_gemma":0.000012259748,"teacher_disagreement_score":0.18760997,"about_ca_system_score_codex":0.000030909272,"about_ca_system_score_gemma":0.00010972286,"threshold_uncertainty_score":0.9999991},"labels":[],"label_agreement":null},{"id":"W4405783403","doi":"10.48550/arxiv.2412.17917","title":"A dynamical algebra of protocol-induced transformations on Dicke states","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Protocol (science); Algebra over a field; Mathematics; Physics; Pure mathematics; Medicine","score_opus":0.034418879413914305,"score_gpt":0.20852079118891423,"score_spread":0.17410191177499992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405783403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5235964,0.0000026357511,0.4624804,0.0007255291,0.00035529697,0.011404502,0.00005045402,0.00038840505,0.0009963689],"genre_scores_gemma":[0.99633986,0.0000016123039,0.0031827176,0.00009242818,0.000044697215,0.00018321992,0.000008561785,0.000018216137,0.0001287185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839574,0.000094551586,0.00027033847,0.0008042174,0.00013724678,0.00029792837],"domain_scores_gemma":[0.9986945,0.00010380924,0.0001229254,0.0008111008,0.00009248701,0.00017517402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018423023,0.00028766735,0.00031045996,0.00045075925,0.000096995165,0.00010712197,0.0013957873,0.00017263404,0.000007624188],"category_scores_gemma":[0.000014221334,0.00027537404,0.00023048553,0.00079805346,0.000049742877,0.000072996416,0.001339281,0.00081406307,0.00007799889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034933473,0.00017205169,0.000016982844,0.00038125415,0.00009018631,0.00012763326,0.0015421935,0.79511225,0.00010086179,0.1941445,0.00018877043,0.0080883615],"study_design_scores_gemma":[0.00022183191,0.00022999615,0.00013048564,0.00035006483,0.00001946277,0.0000031497796,0.000020461059,0.8914966,0.00039652377,0.10657145,0.00029274146,0.00026723402],"about_ca_topic_score_codex":0.00006139039,"about_ca_topic_score_gemma":0.000015221414,"teacher_disagreement_score":0.4727434,"about_ca_system_score_codex":0.000097888806,"about_ca_system_score_gemma":0.00021018102,"threshold_uncertainty_score":0.99996984},"labels":[],"label_agreement":null},{"id":"W4405812396","doi":"10.1109/lcomm.2024.3523421","title":"Optimal Service Placement for 6G Edge Computing With Quantum-Centric Optimization in Real Quantum Hardware","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Canada Excellence Research Chairs, Government of Canada","keywords":"Computer science; Quantum computer; Enhanced Data Rates for GSM Evolution; Quantum; Service (business); Computer hardware; Computer network; Computer architecture; Telecommunications; Physics","score_opus":0.02505966446870764,"score_gpt":0.27588410906342137,"score_spread":0.2508244445947137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405812396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08066595,0.00038550972,0.8948532,0.02252,0.0004667687,0.00056209945,0.00001370123,0.00047252676,0.000060260176],"genre_scores_gemma":[0.5377516,0.00009208651,0.46030322,0.0015188017,0.00012698512,0.000076534656,0.00007700584,0.000042076597,0.00001168178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980592,0.00019611724,0.00044164323,0.0005608766,0.0002650924,0.00047707342],"domain_scores_gemma":[0.99742705,0.0006401155,0.00012353595,0.0015939382,0.00012507089,0.000090321926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051495427,0.00026334092,0.0002464151,0.000397425,0.00043514685,0.0004671711,0.0021753747,0.00006669696,0.0000022266074],"category_scores_gemma":[0.000017308419,0.00024163253,0.000080981205,0.0014907209,0.0000777767,0.0003269828,0.00046480322,0.00043279305,0.00001426378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013180592,0.00008738455,0.000083160645,0.000091952264,0.000036196245,0.000011605031,0.002373165,0.98590714,0.00028436724,0.0054033315,0.0011740472,0.004534501],"study_design_scores_gemma":[0.00052692066,0.00008480046,0.00018216575,0.000353121,0.00001709486,0.000029722916,0.000096224656,0.9956779,0.00006615077,0.000054029726,0.002600588,0.00031129166],"about_ca_topic_score_codex":0.00014402863,"about_ca_topic_score_gemma":0.00004283551,"teacher_disagreement_score":0.45708567,"about_ca_system_score_codex":0.00017057938,"about_ca_system_score_gemma":0.0001452501,"threshold_uncertainty_score":0.9853488},"labels":[],"label_agreement":null},{"id":"W4405812813","doi":"10.1080/23311916.2024.2438806","title":"Quantum computing for solving Bayesian networks of bridges – method and recommendations","year":2024,"lang":"en","type":"article","venue":"Cogent Engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bayesian network; Bayesian probability; Computer science; Quantum computer; Quantum; Artificial intelligence; Physics","score_opus":0.010410953992309608,"score_gpt":0.2623302925675716,"score_spread":0.251919338575262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405812813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047113434,0.0020364823,0.9912007,0.0007190757,0.0009152977,0.0001225561,0.0000037611023,0.0002842335,0.000006579934],"genre_scores_gemma":[0.60582626,0.000022312483,0.3939577,0.000022884156,0.00014445421,0.0000038448716,0.0000030477781,0.000013881588,0.0000056365902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991864,0.000014135867,0.00021546577,0.0002809622,0.0000734988,0.00022955997],"domain_scores_gemma":[0.9991613,0.0005615328,0.000035099594,0.000150951,0.000030215318,0.000060912538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041842478,0.00012190124,0.00015688126,0.00012906778,0.00008580021,0.00014209107,0.00021751286,0.000037191836,9.0760847e-7],"category_scores_gemma":[0.000043347445,0.00011901687,0.00006841887,0.00023558913,0.000008917694,0.0000938255,0.0001668126,0.00012911716,2.670566e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.38051e-7,0.000007342073,0.000023813338,0.00018281657,0.00003793886,0.0000035930425,0.00045267917,0.7263508,0.0014083465,0.039564613,0.00016892802,0.23179851],"study_design_scores_gemma":[0.00007188315,0.00003298169,0.00014244262,0.00029303483,0.000009405253,0.00003125319,0.000009914324,0.9959589,0.0007055174,0.00044576745,0.0021675753,0.00013129269],"about_ca_topic_score_codex":0.00000475435,"about_ca_topic_score_gemma":3.7954283e-7,"teacher_disagreement_score":0.6011149,"about_ca_system_score_codex":0.000015389036,"about_ca_system_score_gemma":0.000017805436,"threshold_uncertainty_score":0.48533672},"labels":[],"label_agreement":null},{"id":"W4405813211","doi":"10.1103/prxquantum.5.040349","title":"Designs from Local Random Quantum Circuits with <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\"> <mml:mi>SU</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:mi>d</mml:mi> <mml:mo stretchy=\"false\">)</mml:mo> </mml:math> Symmetry","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Army Research Office; Air Force Office of Scientific Research; Multidisciplinary University Research Initiative; Office of Science; Tsinghua University; University of Chicago; National Natural Science Foundation of China; U.S. Department of Energy; International Business Machines Corporation; Division of Mathematical Sciences; National Science Foundation","keywords":"Scroll; Order (exchange); Algorithm; Discrete mathematics; Mathematics; Theology","score_opus":0.0159032680608573,"score_gpt":0.23449465110329296,"score_spread":0.21859138304243567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405813211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9067526,0.0027620518,0.08342663,0.0010047584,0.0035814822,0.00018824259,0.00044166044,0.0010747361,0.0007678372],"genre_scores_gemma":[0.9882691,0.00041520435,0.0064180875,0.0011277292,0.0022637001,0.0004326949,0.0004391361,0.0005857382,0.000048616635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9885536,0.0005966883,0.0020288764,0.0030956361,0.0029320281,0.0027931712],"domain_scores_gemma":[0.9921861,0.0025948128,0.0012730551,0.0024655256,0.0002556703,0.0012247997],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0022194388,0.001447672,0.0008629937,0.000648186,0.0017086054,0.0028745634,0.0035301258,0.0016085184,0.00023126321],"category_scores_gemma":[0.0007716393,0.0017948315,0.0015399068,0.0019336945,0.0012070355,0.0014321026,0.002186693,0.002677287,0.001579023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067866425,0.00045427785,0.000037195856,0.0007642606,0.0012484937,0.0019164371,0.0025026316,0.0074457778,0.0011965423,0.96549255,0.0054954616,0.012767688],"study_design_scores_gemma":[0.0026931718,0.001889912,0.00008799502,0.0019740819,0.00074743247,0.0011858803,0.000785481,0.91495305,0.03258615,0.038639195,0.0025581608,0.0018994965],"about_ca_topic_score_codex":0.0019206527,"about_ca_topic_score_gemma":0.0004235032,"teacher_disagreement_score":0.92685336,"about_ca_system_score_codex":0.000065030676,"about_ca_system_score_gemma":0.0015553387,"threshold_uncertainty_score":0.9998273},"labels":[],"label_agreement":null},{"id":"W4405842602","doi":"10.1038/s41598-024-80761-z","title":"Cyclic quantum annealing: searching for deep low-energy states in 5000-qubit spin glass","year":2024,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"Division of Materials Research; National Science Foundation","keywords":"Qubit; Speedup; Quantum annealing; Quantum; Simulated annealing; Spin glass; Computer science; Energy landscape; Quantum computer; Annealing (glass); Physics; Algorithm; Quantum mechanics; Parallel computing","score_opus":0.010924294933118145,"score_gpt":0.2665819816540472,"score_spread":0.25565768672092903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405842602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39065334,0.0012582936,0.5931521,0.0011750916,0.012821219,0.0002905115,0.0000036921392,0.0004971347,0.00014862568],"genre_scores_gemma":[0.98001826,0.00000944796,0.018724829,0.00009629328,0.00026488566,0.000045693687,0.000044216507,0.00003555697,0.0007607893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961178,0.00009562026,0.0007026084,0.0016069819,0.0006472235,0.0008298048],"domain_scores_gemma":[0.9982423,0.0002541925,0.00014934348,0.0010479022,0.00010788318,0.00019836528],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027577053,0.0002534201,0.00028152694,0.00065613294,0.00045332147,0.002310938,0.0006991678,0.00007968341,0.0000064118144],"category_scores_gemma":[0.00014147942,0.00021750014,0.0001873913,0.0015890605,0.00015379312,0.00041250273,0.00039329779,0.00028878712,0.000011761223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019919844,0.00030927118,0.0006708337,0.0007801826,0.000091995054,0.0076178177,0.012898134,0.23385228,0.01845123,0.06942881,0.0147090275,0.6411705],"study_design_scores_gemma":[0.00008111693,0.000044291657,0.0001203528,0.0002239249,0.0000032634866,0.0002330058,0.00003934832,0.8404574,0.003303061,0.124970555,0.030278262,0.00024544177],"about_ca_topic_score_codex":0.00015903533,"about_ca_topic_score_gemma":0.00009308354,"teacher_disagreement_score":0.64092505,"about_ca_system_score_codex":0.000082446255,"about_ca_system_score_gemma":0.0002869562,"threshold_uncertainty_score":0.99872476},"labels":[],"label_agreement":null},{"id":"W4405845721","doi":"10.1145/3710795.3710801","title":"SIGACT News Complexity Theory Column 123","year":2024,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Column (typography); Computer science; Telecommunications","score_opus":0.028776591691234487,"score_gpt":0.27605657984042287,"score_spread":0.2472799881491884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405845721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26160967,0.0034327747,0.6851888,0.023743287,0.0066604274,0.00088107015,0.000044060613,0.0042518936,0.0141880475],"genre_scores_gemma":[0.9084678,0.0000622793,0.08438435,0.0037443957,0.0012899616,0.000022091388,0.000016799897,0.000073061216,0.0019392548],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719924,0.0002957554,0.00041210515,0.00093852426,0.00046226766,0.00069213595],"domain_scores_gemma":[0.99664116,0.0011331755,0.000091801274,0.0018153265,0.00005200915,0.000266507],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005970743,0.00037233683,0.00037737205,0.00019639812,0.00032559363,0.0009701693,0.0026575213,0.00013137996,0.00011723308],"category_scores_gemma":[0.00027478646,0.00031050292,0.0002772344,0.0008639181,0.00015940331,0.00043307373,0.0012057531,0.0006529237,0.0008194895],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018848707,0.00012705813,0.00032710665,0.000097534175,0.00012441985,0.00035798005,0.00279772,0.00086023123,0.001763612,0.11151941,0.038936,0.8430701],"study_design_scores_gemma":[0.0004395572,0.0003388651,0.0025437223,0.00021950397,0.00003207352,0.00019863117,0.00011219396,0.33751145,0.0013973756,0.3651136,0.29118276,0.0009102762],"about_ca_topic_score_codex":0.00032172503,"about_ca_topic_score_gemma":0.00009470701,"teacher_disagreement_score":0.8421598,"about_ca_system_score_codex":0.00006959362,"about_ca_system_score_gemma":0.00021382052,"threshold_uncertainty_score":0.9999585},"labels":[],"label_agreement":null},{"id":"W4405934797","doi":"10.1109/icm63406.2024.10815765","title":"Arithmetic Calculus Modeling for Approximate Circuits","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Calculus (dental); Arithmetic; Electronic circuit; Theoretical computer science; Algebra over a field; Mathematics; Electrical engineering; Engineering","score_opus":0.021306819273648334,"score_gpt":0.260669736809054,"score_spread":0.23936291753540564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405934797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027990858,0.0005250304,0.9924567,0.0012753374,0.00076711137,0.00017181406,0.0000024235576,0.00089913676,0.0011033881],"genre_scores_gemma":[0.7587599,0.000004114569,0.24021699,0.00026304642,0.0002237946,0.000025250549,0.0000019701968,0.000017570303,0.00048737248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891514,0.000014633312,0.00016132953,0.00044308105,0.00015014544,0.00031564833],"domain_scores_gemma":[0.9994857,0.00009818901,0.000011499766,0.00029081936,0.00003925277,0.000074590695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026160557,0.00012350957,0.00011800253,0.00011092993,0.00012088609,0.0004393598,0.00047872332,0.000041642954,0.0000036767435],"category_scores_gemma":[0.000017866347,0.000094559524,0.000104149236,0.0003037016,0.0000124164135,0.00014276076,0.00014550806,0.00012263635,0.000024434934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.759408e-7,0.000019150215,6.43702e-7,0.00011512791,0.000021288104,0.000019226703,0.0005067781,0.16711368,0.00021885186,0.31540865,0.00041197604,0.5161642],"study_design_scores_gemma":[0.00007989458,0.000036449823,7.66992e-7,0.00004351943,0.0000044209746,0.00004187992,0.000005838042,0.96643996,0.00024092376,0.031176258,0.0017840778,0.00014602918],"about_ca_topic_score_codex":0.000012236676,"about_ca_topic_score_gemma":0.000001002438,"teacher_disagreement_score":0.79932624,"about_ca_system_score_codex":0.000017596765,"about_ca_system_score_gemma":0.00005665111,"threshold_uncertainty_score":0.42367566},"labels":[],"label_agreement":null},{"id":"W4406016486","doi":"10.1038/s42005-024-01914-0","title":"Physical implementability for reversible magic state manipulation","year":2025,"lang":"en","type":"article","venue":"Communications Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"MAGIC (telescope); State (computer science); Computer science; Physics; Algorithm; Quantum mechanics","score_opus":0.03661129711799251,"score_gpt":0.3377775313462077,"score_spread":0.3011662342282152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406016486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023029057,0.00006409722,0.97208947,0.003048834,0.00011382581,0.00034119183,0.000017682662,0.00015497478,0.0011408399],"genre_scores_gemma":[0.8265943,0.000010435196,0.17287186,0.00023201527,0.0000402304,0.0000361621,0.000039291783,0.0000057090438,0.00017002028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992641,0.00007744195,0.00017169685,0.00022776866,0.00008439338,0.00017458145],"domain_scores_gemma":[0.99742043,0.0003344919,0.00007133952,0.0020259938,0.000119568555,0.000028159115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018608692,0.00009771704,0.00012251451,0.000040320883,0.00038127752,0.000094869356,0.001560416,0.00001592743,6.1678867e-7],"category_scores_gemma":[0.00002166342,0.00009828246,0.00009300053,0.00047432457,0.00006603503,0.00017824087,0.0008666956,0.00013407077,0.0000083441555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030809945,0.00035057683,0.00062184513,0.00004659521,0.000036144582,6.934934e-8,0.001025239,0.004109922,0.00063995144,0.6346581,0.0017925861,0.35671586],"study_design_scores_gemma":[0.00017396739,0.000018824205,0.0014229415,0.000012368979,0.0000070508095,2.0259873e-7,0.000012412812,0.6755412,0.000645544,0.31454653,0.007541637,0.000077312194],"about_ca_topic_score_codex":0.000020147216,"about_ca_topic_score_gemma":0.000008297737,"teacher_disagreement_score":0.8035652,"about_ca_system_score_codex":0.000052378477,"about_ca_system_score_gemma":0.00007616922,"threshold_uncertainty_score":0.40078422},"labels":[],"label_agreement":null},{"id":"W4406031817","doi":"10.48550/arxiv.2501.00579","title":"The phase diagram of quantum chromodynamics in one dimension on a quantum computer","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; U.S. Department of Energy; Office of Science; Canada First Research Excellence Fund; National Science Foundation","keywords":"Dimension (graph theory); Phase diagram; Quantum; Quantum chromodynamics; Physics; Theoretical physics; Phase (matter); Quantum mechanics; Mathematics; Pure mathematics","score_opus":0.0394722463483489,"score_gpt":0.20530128119837388,"score_spread":0.16582903485002498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406031817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.674727,0.0001496024,0.32272792,0.00043478614,0.0013645862,0.00030929403,0.000018260684,0.00018169988,0.00008681145],"genre_scores_gemma":[0.9982422,0.00017853083,0.0012662226,0.00006323753,0.0001294042,0.0000011531264,0.000011633471,0.00002899388,0.00007863849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973658,0.0002620764,0.00041085482,0.0012487209,0.00021182693,0.00050075905],"domain_scores_gemma":[0.9975087,0.0004553131,0.00030385013,0.0014951742,0.00010549684,0.00013145132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005346444,0.00042582216,0.00051339477,0.00042737165,0.00019156461,0.00017637172,0.0020146987,0.0002677506,0.0000018400578],"category_scores_gemma":[0.000025187686,0.0003584248,0.00030756733,0.00094367604,0.00020521496,0.000072052855,0.0036751574,0.0014735083,0.000034562076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052009415,0.00043693243,0.00003111132,0.00012413519,0.00007784217,0.00040019891,0.00039611774,0.5925356,0.000047906167,0.3916909,0.00010838688,0.014098846],"study_design_scores_gemma":[0.0006082429,0.00038055776,0.00024537306,0.0005990045,0.000029235567,0.0000056634694,0.000013809096,0.874596,0.000056762412,0.12301738,0.00011002148,0.00033796488],"about_ca_topic_score_codex":0.00017279235,"about_ca_topic_score_gemma":0.000046241435,"teacher_disagreement_score":0.32351515,"about_ca_system_score_codex":0.00017797897,"about_ca_system_score_gemma":0.00021538635,"threshold_uncertainty_score":0.99988675},"labels":[],"label_agreement":null},{"id":"W4406049530","doi":"10.20935/acadquant7457","title":"Quantum permutation pad for quantum secure symmetric and asymmetric cryptography","year":2025,"lang":"en","type":"article","venue":"Academia quantum.","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Quantum cryptography; Permutation (music); Computer science; Quantum; Cryptography; Theoretical computer science; Computer security; Physics; Quantum information; Quantum mechanics","score_opus":0.009600823930003504,"score_gpt":0.26637779772834697,"score_spread":0.25677697379834347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406049530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19972453,0.006619835,0.7833046,0.006965514,0.0014766279,0.00086623675,0.000042831543,0.0006514966,0.00034834637],"genre_scores_gemma":[0.97338,0.0005067234,0.02368485,0.001975651,0.00023023585,0.00010707379,0.000029171326,0.00003495987,0.000051326097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627805,0.0002213544,0.000757406,0.0012616314,0.0005455914,0.00093599706],"domain_scores_gemma":[0.9968408,0.0016290948,0.00031752893,0.0006979626,0.00025572913,0.000258902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012116455,0.0005273586,0.00062388653,0.0021550923,0.00069659017,0.00036305748,0.001347785,0.00071291835,0.0000026719601],"category_scores_gemma":[0.0007506611,0.00047790204,0.00031815036,0.005626334,0.00016212508,0.00046503387,0.00049092504,0.0013934077,0.000017875544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029016208,0.00007789603,0.0014058531,0.00023460994,0.000107921194,0.000009187562,0.00057444937,0.00037639926,0.0002817396,0.88596416,0.0073280283,0.10361075],"study_design_scores_gemma":[0.0011203842,0.00029397116,0.008872735,0.0001461936,0.00005990952,0.00003240079,0.000099946774,0.76568675,0.00042711952,0.20420167,0.018518433,0.00054049195],"about_ca_topic_score_codex":0.000042320622,"about_ca_topic_score_gemma":0.0000016371857,"teacher_disagreement_score":0.7736555,"about_ca_system_score_codex":0.00007114257,"about_ca_system_score_gemma":0.00019646822,"threshold_uncertainty_score":0.99976724},"labels":[],"label_agreement":null},{"id":"W4406165543","doi":"10.22331/q-2025-01-08-1586","title":"Fast algorithms for classical specifications of stabiliser states and Clifford gates","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; European Commission","keywords":"Stabiliser; Algorithm; Computer science; Arithmetic; Mathematics; Nanotechnology; Materials science","score_opus":0.024861848417145997,"score_gpt":0.27543851353708376,"score_spread":0.25057666511993776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406165543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14393584,0.00039642036,0.8495028,0.005162657,0.00039616,0.00027412997,0.00003581441,0.0001117978,0.00018436168],"genre_scores_gemma":[0.76800925,0.0001289096,0.23070452,0.00029881735,0.00014368835,0.0000557242,0.000021526599,0.000019165793,0.00061840063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998921,0.00003719807,0.00029714318,0.00037104727,0.00012480177,0.0002488211],"domain_scores_gemma":[0.99886996,0.00046638466,0.00008641252,0.00039136905,0.00012136195,0.00006450846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002211396,0.00013228368,0.00021929308,0.0001262405,0.00015641062,0.000087858585,0.00043582288,0.00005178604,0.0000030696099],"category_scores_gemma":[0.000059581944,0.0001097441,0.000073230454,0.0003323003,0.00013277585,0.000097256365,0.00017855725,0.000112186426,0.0000018683336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021643213,0.00022641403,0.0009083501,0.00015920826,0.000055296572,0.0000018110613,0.0012908474,0.0010906828,0.0013672502,0.7623134,0.004161793,0.2284033],"study_design_scores_gemma":[0.00033125706,0.00013519009,0.003733245,0.000049069477,0.000008873711,0.0000024904768,0.0001316396,0.89524794,0.0020026139,0.08580648,0.012423487,0.00012772995],"about_ca_topic_score_codex":0.000012921631,"about_ca_topic_score_gemma":0.0000061095116,"teacher_disagreement_score":0.89415723,"about_ca_system_score_codex":0.000012763557,"about_ca_system_score_gemma":0.00006657435,"threshold_uncertainty_score":0.44752344},"labels":[],"label_agreement":null},{"id":"W4406261104","doi":"10.1109/qce60285.2024.00005","title":"Message from the Chairs","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.008070980097872904,"score_gpt":0.2226303519724966,"score_spread":0.21455937187462368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406261104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01578922,0.0015706484,0.9426907,0.024542732,0.001294075,0.000055583776,0.0000041543813,0.0008988482,0.013154094],"genre_scores_gemma":[0.964631,0.000009787468,0.031625427,0.0015715106,0.00043360188,0.0000028047814,0.0000011711691,0.000007249157,0.0017174388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994218,0.000026791517,0.000066855486,0.00022860726,0.0001275248,0.0001284643],"domain_scores_gemma":[0.99936384,0.00025255315,0.0000065932013,0.0003410863,0.0000067708525,0.000029181314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012787082,0.000065056774,0.000047399863,0.000016016029,0.0000931191,0.00037089386,0.00069076807,0.00001818823,0.0000569956],"category_scores_gemma":[0.0000071441764,0.000032399654,0.000047994716,0.00019423391,0.000019751134,0.00005713891,0.00023105594,0.00013686571,0.00014721615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.7898633e-7,0.000009796089,0.000031773496,0.0000042840306,0.00002577247,0.00006652164,0.0023020399,0.0006711313,0.00019319059,0.30668038,0.042608537,0.6474062],"study_design_scores_gemma":[0.000023143919,0.0000094615,0.00057111494,0.000020342299,0.0000015472632,0.000007839425,0.000012021073,0.87638164,0.00022828158,0.022732686,0.09994728,0.00006462038],"about_ca_topic_score_codex":0.000094044226,"about_ca_topic_score_gemma":0.000009007765,"teacher_disagreement_score":0.9488418,"about_ca_system_score_codex":0.000004960253,"about_ca_system_score_gemma":0.000023182747,"threshold_uncertainty_score":0.3576538},"labels":[],"label_agreement":null},{"id":"W4406261114","doi":"10.1109/qce60285.2024.00117","title":"An Abstraction Hierarchy Toward Productive Quantum Programming","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Abstraction; Hierarchy; Computer science; Programming language; Theoretical computer science; Epistemology","score_opus":0.015025451959563701,"score_gpt":0.2755614246416156,"score_spread":0.26053597268205186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406261114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08732638,0.00024870128,0.9044336,0.003552763,0.0015885684,0.00021066864,8.6006406e-7,0.0019954024,0.00064304034],"genre_scores_gemma":[0.8524437,0.0000036530314,0.1468127,0.00007264719,0.00047386816,0.00001224702,0.0000028136242,0.000013032146,0.00016536005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858046,0.000049459275,0.00016572305,0.00064455194,0.00024728035,0.0003125187],"domain_scores_gemma":[0.999359,0.00005001179,0.000025728297,0.00040682824,0.00005114396,0.0001072856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032531575,0.00014602575,0.00010528321,0.00015740952,0.00013197331,0.00074650365,0.00050000666,0.000046449542,0.000010908814],"category_scores_gemma":[0.000014431124,0.00011170845,0.00006401159,0.00051544275,0.00003762114,0.0007075987,0.00009707813,0.00030046294,0.00007392686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001992377,0.000064626336,0.000011720218,0.000039013263,0.000016545657,0.000052045096,0.0023708094,0.0013411773,0.0010816057,0.0795547,0.0002501506,0.9152156],"study_design_scores_gemma":[0.0000452534,0.00021875529,0.00056938303,0.000037341713,0.0000037565671,0.00010955709,0.00007407656,0.96069926,0.0018301777,0.013259316,0.02295048,0.00020266796],"about_ca_topic_score_codex":0.0000526946,"about_ca_topic_score_gemma":0.000002349122,"teacher_disagreement_score":0.95935804,"about_ca_system_score_codex":0.00003171401,"about_ca_system_score_gemma":0.00008471905,"threshold_uncertainty_score":0.7198552},"labels":[],"label_agreement":null},{"id":"W4406261225","doi":"10.1109/qce60285.2024.00206","title":"Improving Qubit Routing by Using Entanglement Mediated Remote Gates","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum entanglement; Routing (electronic design automation); Computer science; Qubit; Computer network; Quantum mechanics; Physics; Quantum","score_opus":0.01012360320214775,"score_gpt":0.24193646914633674,"score_spread":0.23181286594418898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406261225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059995152,0.0008370839,0.93568593,0.001232185,0.00077034696,0.00011114423,0.0000037047948,0.0009278291,0.00043661016],"genre_scores_gemma":[0.7789255,0.0000075094376,0.22004429,0.0004598042,0.00023032389,9.2913507e-7,0.000007141071,0.000025245963,0.00029927358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849623,0.000046324763,0.00025797723,0.000509096,0.0002792925,0.00041109583],"domain_scores_gemma":[0.9993724,0.00015988704,0.000048022743,0.00029216465,0.000028278218,0.00009921941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038312032,0.00017277198,0.00013428587,0.000101284124,0.00018110883,0.00057156937,0.0004950691,0.0000463543,0.000026345482],"category_scores_gemma":[0.00003534793,0.00013704503,0.00007214767,0.00046611516,0.000021190102,0.00021149075,0.0004147761,0.00021216241,0.00003643358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014896195,0.000027566388,0.000053649077,0.000076267446,0.00005404475,0.00011667747,0.001350948,0.002039463,0.080794446,0.0055840653,0.0017565363,0.90814483],"study_design_scores_gemma":[0.00008664843,0.000033532724,0.0000064969963,0.000093183844,0.0000054909883,0.000039756917,0.000028265296,0.98926115,0.0068460335,0.00051962986,0.0028873656,0.00019241581],"about_ca_topic_score_codex":0.000483834,"about_ca_topic_score_gemma":0.000005723762,"teacher_disagreement_score":0.9872217,"about_ca_system_score_codex":0.000069161215,"about_ca_system_score_gemma":0.000070441696,"threshold_uncertainty_score":0.5588534},"labels":[],"label_agreement":null},{"id":"W4406261274","doi":"10.1109/qce60285.2024.00203","title":"Secret Addressing Scheme using Distributed Quantum Computing","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Ericsson (Canada)","funders":"","keywords":"Computer science; Scheme (mathematics); Quantum computer; Distributed computing; Theoretical computer science; Quantum; Mathematics","score_opus":0.03624040523575373,"score_gpt":0.2981338198998107,"score_spread":0.26189341466405697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406261274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1647998,0.00059253763,0.83131117,0.00060440233,0.0010032092,0.00007125765,0.0000062186996,0.0013424567,0.00026895275],"genre_scores_gemma":[0.72968894,0.0000016654424,0.2697864,0.00015785445,0.00030644637,5.064766e-7,0.000009763525,0.000018559209,0.000029881574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981946,0.000070569535,0.00029863336,0.0006163261,0.00031113258,0.0005087544],"domain_scores_gemma":[0.99907905,0.00025056998,0.000051088828,0.00043081047,0.000053998483,0.00013450999],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00037908668,0.00022409692,0.00020526798,0.00015956795,0.00034003454,0.0010902525,0.0007022617,0.00007550677,0.000019486944],"category_scores_gemma":[0.000049642083,0.00018399881,0.0001203179,0.0009227071,0.000052266576,0.00031934248,0.00058288925,0.00037506013,0.0000372295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007983439,0.00015867561,0.00068616477,0.00049887237,0.00025389937,0.001231272,0.004090395,0.08590956,0.033724796,0.5639986,0.005590666,0.30384916],"study_design_scores_gemma":[0.000087957975,0.000024065703,0.00014565757,0.0004093341,0.0000050931626,0.00018203785,0.000021389653,0.99268657,0.0005126635,0.003397012,0.0022581234,0.00027010601],"about_ca_topic_score_codex":0.000046937457,"about_ca_topic_score_gemma":9.798507e-7,"teacher_disagreement_score":0.906777,"about_ca_system_score_codex":0.000056349363,"about_ca_system_score_gemma":0.00013073138,"threshold_uncertainty_score":0.9999467},"labels":[],"label_agreement":null},{"id":"W4406261609","doi":"10.1109/qce60285.2024.10270","title":"Distributed Quantum Computing for Chemical Applications","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Computer science; Quantum computer; Distributed computing; Quantum; Physics; Quantum mechanics","score_opus":0.010753486762710438,"score_gpt":0.2648034940586741,"score_spread":0.25405000729596366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406261609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004133438,0.0002178818,0.9915697,0.0022301893,0.00027846982,0.00024287896,0.00001669194,0.0010993899,0.00021135279],"genre_scores_gemma":[0.74697274,0.000001217939,0.25237188,0.00017405293,0.00034698923,0.00003500436,0.00003054446,0.000011291385,0.000056297402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990481,0.000010405837,0.00016949124,0.00040362627,0.0001114388,0.00025692963],"domain_scores_gemma":[0.9992786,0.00030277576,0.000019261368,0.00028389567,0.00004139761,0.00007406899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016023881,0.000107904816,0.00010455672,0.00005377585,0.00012805087,0.00030537203,0.0005347144,0.00004227205,0.000003111922],"category_scores_gemma":[0.000011360755,0.00008686724,0.0000965469,0.0004161936,0.000026088192,0.00007626705,0.00019131953,0.00012462829,0.000033227512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.692741e-7,0.000032569285,0.0000071860577,0.00006841869,0.000019730405,0.0000036231113,0.00015861371,0.0009901518,0.0015223937,0.7305294,0.0045906394,0.2620764],"study_design_scores_gemma":[0.00006499265,0.0000172772,0.000017522258,0.000021167081,0.000003330017,0.000022881193,0.0000051986804,0.92490834,0.0010782639,0.02501966,0.048720896,0.000120447155],"about_ca_topic_score_codex":0.0000033583847,"about_ca_topic_score_gemma":1.6897901e-7,"teacher_disagreement_score":0.9239182,"about_ca_system_score_codex":0.000020471412,"about_ca_system_score_gemma":0.000045916924,"threshold_uncertainty_score":0.35423434},"labels":[],"label_agreement":null},{"id":"W4406261678","doi":"10.1109/qce60285.2024.00210","title":"Masking Countermeasures Against Side-Channel Attacks on Quantum Computers","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Side channel attack; Masking (illustration); Computer science; Computer security; Channel (broadcasting); Cryptography; Computer network; Quantum computer; Quantum; Physics","score_opus":0.01593791777455363,"score_gpt":0.2495534127572403,"score_spread":0.23361549498268666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406261678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028365802,0.00035445674,0.9559023,0.0032576623,0.0037752555,0.00013906287,0.0000038740127,0.0016355105,0.00656608],"genre_scores_gemma":[0.9872318,0.00001597851,0.0094649,0.0025423737,0.000429951,0.000005201786,0.000003536167,0.000029395069,0.0002768558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997844,0.00007621552,0.00028671647,0.00077694893,0.0005055402,0.00051059783],"domain_scores_gemma":[0.9988336,0.000341091,0.000044052133,0.00058456446,0.000050384493,0.00014630864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038722812,0.0002970243,0.00022917669,0.000266894,0.00023158113,0.00091673154,0.0009911242,0.00008036245,0.0000057094358],"category_scores_gemma":[0.000021731877,0.00023060551,0.00017131228,0.0004750782,0.000055819157,0.00023344862,0.0003350073,0.0004126698,0.0002422072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010767538,0.00012778277,0.000019984995,0.00016017225,0.00013831255,0.00090883626,0.0027593179,0.39766324,0.00058869994,0.13304247,0.029407343,0.43517306],"study_design_scores_gemma":[0.00012775324,0.00012938652,0.00017051809,0.00036195415,0.0000034737384,0.00005302338,0.000019330479,0.9825696,0.00038966956,0.0049310797,0.010926107,0.0003181521],"about_ca_topic_score_codex":0.00001859782,"about_ca_topic_score_gemma":0.0000037127138,"teacher_disagreement_score":0.958866,"about_ca_system_score_codex":0.000057946814,"about_ca_system_score_gemma":0.00007871177,"threshold_uncertainty_score":0.94038194},"labels":[],"label_agreement":null},{"id":"W4406261699","doi":"10.1109/qce60285.2024.00192","title":"Innovative Quantum K-Means Clustering Using a Multi-Distance Measurement Circuit","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cluster analysis; Computer science; Optoelectronics; Physics; Artificial intelligence","score_opus":0.0679000730117456,"score_gpt":0.28211732242740384,"score_spread":0.21421724941565823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406261699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066249305,0.00061696384,0.98965853,0.00042360064,0.0011832693,0.00014869061,0.0000023192968,0.0007609517,0.00058072235],"genre_scores_gemma":[0.80763334,0.0000026451241,0.1918791,0.0002248028,0.00013286067,0.000004800449,5.233568e-7,0.000019274996,0.000102650585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981063,0.000057585035,0.00029896127,0.00061455596,0.00051122135,0.00041138098],"domain_scores_gemma":[0.99919224,0.000050193732,0.000047933212,0.00042121432,0.00020821455,0.000080231286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006094759,0.0002162131,0.00017993011,0.00019396987,0.00019398752,0.00050113304,0.0006267438,0.000048532573,0.000009236628],"category_scores_gemma":[0.000038803362,0.00017849579,0.00007161398,0.001356731,0.00004201065,0.00028195782,0.00032933778,0.0002852583,0.000030520092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008526792,0.00025652235,0.00023532807,0.00053525553,0.00028757736,0.00056040887,0.014556684,0.104717486,0.03330292,0.4309363,0.00070003624,0.41390294],"study_design_scores_gemma":[0.00014043182,0.000035427474,0.00018498102,0.00027834266,0.0000035718701,0.000058030437,0.00003877556,0.9933005,0.0005329702,0.001864183,0.0033042338,0.00025855945],"about_ca_topic_score_codex":0.00006833386,"about_ca_topic_score_gemma":0.000030540315,"teacher_disagreement_score":0.888583,"about_ca_system_score_codex":0.00016775803,"about_ca_system_score_gemma":0.00018471605,"threshold_uncertainty_score":0.72788465},"labels":[],"label_agreement":null},{"id":"W4406261816","doi":"10.1109/qce60285.2024.00197","title":"Quantum-Assisted Machine Learning Framework: Training and Evaluation of Boltzmann Machines Using Quantum Annealers","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quantum; Computer science; Boltzmann machine; Training (meteorology); Quantum computer; Artificial intelligence; Machine learning; Physics; Deep learning; Quantum mechanics","score_opus":0.05835250924447513,"score_gpt":0.32165633174519614,"score_spread":0.26330382250072104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406261816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60091937,0.0032890898,0.3941907,0.00046821038,0.0005159487,0.0001277399,0.000002899831,0.00032711012,0.00015890779],"genre_scores_gemma":[0.92823917,0.000023828976,0.071512565,0.000055742512,0.00011396312,0.0000032097478,0.000004770298,0.000023034965,0.000023738126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771166,0.00031154187,0.0003967489,0.0005812652,0.00064745283,0.00035132043],"domain_scores_gemma":[0.9989173,0.0004250506,0.0001187378,0.00029968817,0.00013411921,0.00010514251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001872794,0.00024000584,0.00030648764,0.00032373847,0.0002538676,0.0003073437,0.00035724492,0.000107825705,0.000025641675],"category_scores_gemma":[0.00020935768,0.00019467088,0.000101832644,0.0007329286,0.000083915,0.0002910134,0.00023703833,0.0005068479,0.0000029969212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006431455,0.000043580185,0.0005843275,0.00015753243,0.00009742217,0.000024477786,0.00746195,0.2566815,0.0023114693,0.038304098,0.000027025468,0.6943002],"study_design_scores_gemma":[0.0001907447,0.000111191315,0.001631063,0.00035275216,0.000046923706,0.00012719526,0.00013288647,0.98463726,0.00011274913,0.012191671,0.00023054378,0.0002350342],"about_ca_topic_score_codex":0.00017586326,"about_ca_topic_score_gemma":0.000008752417,"teacher_disagreement_score":0.72795576,"about_ca_system_score_codex":0.000036876914,"about_ca_system_score_gemma":0.00015821813,"threshold_uncertainty_score":0.79384476},"labels":[],"label_agreement":null},{"id":"W4406261864","doi":"10.1109/qce60285.2024.10434","title":"Towards a Distributed Quantum Computing Platform for Algorithm Experiments","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Quantum computer; Distributed computing; Distributed algorithm; Quantum algorithm; Quantum; Theoretical computer science; Algorithm; Parallel computing; Physics","score_opus":0.022712869132634362,"score_gpt":0.2913235652348779,"score_spread":0.26861069610224353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406261864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051888605,0.0005696936,0.98924214,0.0009754401,0.001901802,0.00029325282,0.000042056072,0.001409213,0.00037752854],"genre_scores_gemma":[0.3419054,0.000004452399,0.6570765,0.0002893422,0.00047673323,0.000022252836,0.000044217926,0.000029434344,0.00015171585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981537,0.000019077017,0.00032208816,0.0006534036,0.000296542,0.0005551795],"domain_scores_gemma":[0.9991475,0.0001997952,0.00004320872,0.00039603794,0.000067163186,0.00014633221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033756084,0.00024964625,0.00023244182,0.00013792425,0.0002637557,0.0006978194,0.0008143365,0.00007931377,0.000011125563],"category_scores_gemma":[0.000024609179,0.00019555852,0.00018885017,0.0005198737,0.000035967307,0.00028084355,0.00042279015,0.00019691105,0.000034177876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023368345,0.000049826907,0.0000021127223,0.000048968166,0.000053115626,0.00003597117,0.0008882252,0.000822569,0.00018468805,0.11688782,0.003734717,0.87728965],"study_design_scores_gemma":[0.0002474206,0.000145477,0.000045560733,0.00008120504,0.0000055207083,0.000059255424,0.000044164557,0.95909894,0.0022376343,0.014657969,0.023098433,0.000278448],"about_ca_topic_score_codex":0.000034916102,"about_ca_topic_score_gemma":6.152043e-7,"teacher_disagreement_score":0.95827633,"about_ca_system_score_codex":0.000063914806,"about_ca_system_score_gemma":0.00012167893,"threshold_uncertainty_score":0.7974645},"labels":[],"label_agreement":null},{"id":"W4406262066","doi":"10.1109/qce60285.2024.00131","title":"Graph-Based Identification of Qubit Network (GidNET) for Qubit Reuse","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Qubit; Identification (biology); Computer science; Reuse; Graph; Theoretical computer science; Quantum; Physics; Engineering; Quantum mechanics","score_opus":0.010073950104569433,"score_gpt":0.25007148929060435,"score_spread":0.23999753918603492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406262066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011388802,0.00044890295,0.9840005,0.0023936303,0.0009447244,0.00024221053,0.000005511981,0.00040286296,0.00017287042],"genre_scores_gemma":[0.71648777,0.000006071229,0.28221595,0.0003076345,0.00035178362,0.000033048054,0.000010763853,0.000018782854,0.0005681991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988003,0.000036335616,0.00033153157,0.00039653186,0.00019146828,0.00024385733],"domain_scores_gemma":[0.9987545,0.0002845445,0.00007326425,0.00075243495,0.00007784306,0.000057415422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005164178,0.000116508185,0.00014110643,0.00012797661,0.00009796388,0.00019992983,0.00090075633,0.00005051353,0.000008398295],"category_scores_gemma":[0.000053196538,0.00009493932,0.00015028857,0.00069140794,0.000036520032,0.00011543672,0.0001351369,0.00009723124,0.000016432028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025210067,0.00014555095,0.00020766107,0.0005509454,0.00011119052,0.000014904222,0.000994313,0.25043556,0.0054780105,0.45140886,0.10304,0.1875878],"study_design_scores_gemma":[0.00012578024,0.00008203957,0.00031897062,0.00007426488,0.000008486605,0.0000031335771,0.0000027672195,0.9407078,0.0042898236,0.046030976,0.008234797,0.000121180805],"about_ca_topic_score_codex":0.000018722343,"about_ca_topic_score_gemma":0.0000048207594,"teacher_disagreement_score":0.7050989,"about_ca_system_score_codex":0.000012046193,"about_ca_system_score_gemma":0.00008893783,"threshold_uncertainty_score":0.3871513},"labels":[],"label_agreement":null},{"id":"W4406262153","doi":"10.1109/qce60285.2024.00106","title":"Design and Architecture of the IBM Quantum Engine Compiler","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"IBM; Compiler; Computer science; Architecture; Computer architecture; Operating system; Physics","score_opus":0.009494812789248968,"score_gpt":0.2151583782876652,"score_spread":0.20566356549841625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406262153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021564238,0.00083320437,0.9731472,0.0034270394,0.0004852513,0.00012538036,0.0000010513644,0.00019817357,0.00021844941],"genre_scores_gemma":[0.7960057,0.0000090558715,0.20345643,0.00023752307,0.000072114075,0.0000023928144,2.1582328e-7,0.000009545957,0.0002069922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991612,0.000082248596,0.00014116822,0.00026749555,0.00017667991,0.00017122498],"domain_scores_gemma":[0.9992763,0.00027841775,0.000023501376,0.00035823943,0.000019725741,0.000043839118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024290878,0.00011625581,0.0001195511,0.000070482296,0.00007842528,0.00011386708,0.0005432618,0.00003568686,0.0000080033205],"category_scores_gemma":[0.000012577896,0.00006158483,0.000057878566,0.00038275096,0.00007297756,0.00005099905,0.00032401524,0.00022411406,0.0000044178128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006023141,0.000050429226,0.000056791356,0.00017716002,0.00007427486,0.000028311872,0.0038832524,0.11143829,0.0057355994,0.18938759,0.0035710544,0.6855912],"study_design_scores_gemma":[0.000064768465,0.000053860105,0.00044689304,0.00007521905,0.000004326848,0.00007824403,0.000004246973,0.9750175,0.0030151056,0.016546184,0.0045997333,0.00009390201],"about_ca_topic_score_codex":0.000009824906,"about_ca_topic_score_gemma":7.230895e-7,"teacher_disagreement_score":0.8635792,"about_ca_system_score_codex":0.0000049585656,"about_ca_system_score_gemma":0.000044668726,"threshold_uncertainty_score":0.25113568},"labels":[],"label_agreement":null},{"id":"W4406262406","doi":"10.1109/icasc63229.2024.10785069","title":"Quantum Computing Circuit Design: A Tutorial","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Quantum computer; Computer architecture; Physical design; Circuit design; Theoretical computer science; Quantum; Embedded system; Physics","score_opus":0.02604446689191696,"score_gpt":0.2554902577206276,"score_spread":0.22944579082871064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406262406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036868497,0.00040342752,0.985852,0.00069140934,0.0053479197,0.000116535906,6.736597e-7,0.0021915382,0.0017096163],"genre_scores_gemma":[0.8451112,0.000003220932,0.15262406,0.00029171715,0.0015845912,0.0000024090975,9.242081e-7,0.000019906336,0.000362001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984197,0.000090053356,0.0002298655,0.0005592179,0.00029990976,0.0004012589],"domain_scores_gemma":[0.99903554,0.0003995336,0.000025982281,0.00039568247,0.00003492121,0.00010834889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005471649,0.00017734295,0.00016019346,0.00014933934,0.00017940298,0.0008258832,0.00080026576,0.00006245768,0.000021265994],"category_scores_gemma":[0.000031626765,0.00013977295,0.00010701877,0.0006287837,0.000031043815,0.00020613716,0.00031094227,0.0002787102,0.00022852681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018200061,0.000022013328,0.0000044816734,0.000038269125,0.000035803518,0.00021783228,0.0012813412,0.016134586,0.0007898078,0.67776847,0.007993999,0.2957116],"study_design_scores_gemma":[0.00009224345,0.0000777426,0.0000354664,0.000060958708,0.0000034816494,0.000111329544,0.0000058950263,0.9520991,0.00030411396,0.03202514,0.01498194,0.00020261318],"about_ca_topic_score_codex":0.000026170743,"about_ca_topic_score_gemma":4.008636e-7,"teacher_disagreement_score":0.93596447,"about_ca_system_score_codex":0.00004700797,"about_ca_system_score_gemma":0.00018329262,"threshold_uncertainty_score":0.7964011},"labels":[],"label_agreement":null},{"id":"W4406276279","doi":"10.1109/qce60285.2024.20446","title":"Message from the Chairs","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.008070980097872904,"score_gpt":0.2226303519724966,"score_spread":0.21455937187462368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406276279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01578922,0.0015706484,0.9426907,0.024542732,0.001294075,0.000055583776,0.0000041543813,0.0008988482,0.013154094],"genre_scores_gemma":[0.964631,0.000009787468,0.031625427,0.0015715106,0.00043360188,0.0000028047814,0.0000011711691,0.000007249157,0.0017174388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994218,0.000026791517,0.000066855486,0.00022860726,0.0001275248,0.0001284643],"domain_scores_gemma":[0.99936384,0.00025255315,0.0000065932013,0.0003410863,0.0000067708525,0.000029181314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012787082,0.000065056774,0.000047399863,0.000016016029,0.0000931191,0.00037089386,0.00069076807,0.00001818823,0.0000569956],"category_scores_gemma":[0.0000071441764,0.000032399654,0.000047994716,0.00019423391,0.000019751134,0.00005713891,0.00023105594,0.00013686571,0.00014721615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.7898633e-7,0.000009796089,0.000031773496,0.0000042840306,0.00002577247,0.00006652164,0.0023020399,0.0006711313,0.00019319059,0.30668038,0.042608537,0.6474062],"study_design_scores_gemma":[0.000023143919,0.0000094615,0.00057111494,0.000020342299,0.0000015472632,0.000007839425,0.000012021073,0.87638164,0.00022828158,0.022732686,0.09994728,0.00006462038],"about_ca_topic_score_codex":0.000094044226,"about_ca_topic_score_gemma":0.000009007765,"teacher_disagreement_score":0.9488418,"about_ca_system_score_codex":0.000004960253,"about_ca_system_score_gemma":0.000023182747,"threshold_uncertainty_score":0.3576538},"labels":[],"label_agreement":null},{"id":"W4406276558","doi":"10.1109/qce60285.2024.20453","title":"QuantumCrypto: A Web Framework for Quantum Cryptography Education","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; University of Victoria","funders":"","keywords":"Computer science; Quantum cryptography; Cryptography; World Wide Web; Computer security; Quantum; Quantum information; Physics; Quantum mechanics","score_opus":0.010756838896991609,"score_gpt":0.28392166175099376,"score_spread":0.2731648228540022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406276558","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009005336,0.0016616271,0.9773712,0.005720004,0.0038452311,0.00028249892,0.0000051668767,0.0011994774,0.00090946606],"genre_scores_gemma":[0.30037844,0.0000261225,0.6979753,0.00083466945,0.00057952455,0.00007070005,0.0000048207576,0.000023181437,0.00010725458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985556,0.000034696037,0.00023396786,0.0005941644,0.00021422871,0.0003673626],"domain_scores_gemma":[0.9987822,0.0004655775,0.00003709418,0.00051663857,0.00007635448,0.000122146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026985185,0.00019450331,0.00015847333,0.00031422393,0.00018212044,0.0006645465,0.0007188284,0.00010076443,0.000021316264],"category_scores_gemma":[0.000061641,0.0001534102,0.000227155,0.00096471334,0.000037068672,0.00023292772,0.00013077342,0.00025085759,0.000068108326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016422189,0.000047624017,0.000010812018,0.000057201785,0.000017700768,0.0000017902154,0.00026504946,0.00006844184,0.00012968678,0.84963787,0.008536555,0.1412256],"study_design_scores_gemma":[0.000036031503,0.00006933576,0.000039499624,0.00010853095,0.000004156513,0.00001319044,0.000020073712,0.5116934,0.00009504283,0.4289352,0.058844317,0.0001412096],"about_ca_topic_score_codex":0.000012122572,"about_ca_topic_score_gemma":0.0000018952851,"teacher_disagreement_score":0.511625,"about_ca_system_score_codex":0.000019440788,"about_ca_system_score_gemma":0.0003769885,"threshold_uncertainty_score":0.6408237},"labels":[],"label_agreement":null},{"id":"W4406276768","doi":"10.1109/qce60285.2024.10235","title":"Message from the Chairs","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.008070980097872904,"score_gpt":0.2226303519724966,"score_spread":0.21455937187462368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406276768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01578922,0.0015706484,0.9426907,0.024542732,0.001294075,0.000055583776,0.0000041543813,0.0008988482,0.013154094],"genre_scores_gemma":[0.964631,0.000009787468,0.031625427,0.0015715106,0.00043360188,0.0000028047814,0.0000011711691,0.000007249157,0.0017174388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994218,0.000026791517,0.000066855486,0.00022860726,0.0001275248,0.0001284643],"domain_scores_gemma":[0.99936384,0.00025255315,0.0000065932013,0.0003410863,0.0000067708525,0.000029181314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012787082,0.000065056774,0.000047399863,0.000016016029,0.0000931191,0.00037089386,0.00069076807,0.00001818823,0.0000569956],"category_scores_gemma":[0.0000071441764,0.000032399654,0.000047994716,0.00019423391,0.000019751134,0.00005713891,0.00023105594,0.00013686571,0.00014721615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.7898633e-7,0.000009796089,0.000031773496,0.0000042840306,0.00002577247,0.00006652164,0.0023020399,0.0006711313,0.00019319059,0.30668038,0.042608537,0.6474062],"study_design_scores_gemma":[0.000023143919,0.0000094615,0.00057111494,0.000020342299,0.0000015472632,0.000007839425,0.000012021073,0.87638164,0.00022828158,0.022732686,0.09994728,0.00006462038],"about_ca_topic_score_codex":0.000094044226,"about_ca_topic_score_gemma":0.000009007765,"teacher_disagreement_score":0.9488418,"about_ca_system_score_codex":0.000004960253,"about_ca_system_score_gemma":0.000023182747,"threshold_uncertainty_score":0.3576538},"labels":[],"label_agreement":null},{"id":"W4406309084","doi":"10.1021/acs.jctc.4c01390","title":"Global Minimization of Electronic Hamiltonian 1-Norm via Linear Programming in the Block Invariant Symmetry Shift (BLISS) Method","year":2025,"lang":"en","type":"article","venue":"Journal of Chemical Theory and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Government of Canada","keywords":"Hamiltonian (control theory); BLISS; Linear subspace; Computer science; Linear programming; Mathematics; Quantum mechanics; Mathematical optimization; Algorithm; Physics; Pure mathematics","score_opus":0.005344207928441588,"score_gpt":0.2759327014890293,"score_spread":0.27058849356058773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406309084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28974977,0.00026451048,0.7091475,0.0006409764,0.00006860106,0.000068163936,3.190028e-7,0.0000087521,0.00005143536],"genre_scores_gemma":[0.9074409,0.000005318766,0.09226968,0.00022103287,0.00005761496,9.38283e-7,9.433307e-7,0.000002458664,0.0000011100025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858814,0.0004165182,0.00045492148,0.00015077306,0.0002178216,0.00017182443],"domain_scores_gemma":[0.9988324,0.00063242926,0.00029514416,0.000108699816,0.00009689135,0.00003442734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018993306,0.00010494543,0.00021594783,0.00013001611,0.00005096844,0.00006922487,0.00041831526,0.000068931244,3.6089133e-7],"category_scores_gemma":[0.00013944971,0.000072577655,0.00007735353,0.00080909353,0.00004659151,0.00013183673,0.00008869767,0.0002747331,1.0965228e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019780916,0.0002977402,0.0003963051,0.00009365259,0.00008880343,0.000018443163,0.002203705,0.038592737,0.0012665815,0.3211839,0.000026786956,0.6356335],"study_design_scores_gemma":[0.00061864924,0.00016121387,0.002002625,0.00013451508,0.000028503247,0.00017057265,0.000068795234,0.5688768,0.002254737,0.42548078,0.000108700755,0.000094114],"about_ca_topic_score_codex":0.000004210497,"about_ca_topic_score_gemma":7.5398435e-7,"teacher_disagreement_score":0.6355394,"about_ca_system_score_codex":0.00003814658,"about_ca_system_score_gemma":0.00010959178,"threshold_uncertainty_score":0.2959631},"labels":[],"label_agreement":null},{"id":"W4406460477","doi":"10.1109/tps-isa62245.2024.00063","title":"Pragmatic Obfuscation of Factoring in Hamiltonian Simulation and Ground State Estimation","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Factoring; Obfuscation; Computer science; Ground state; Hamiltonian (control theory); Computer security; Mathematical optimization; Mathematics; Physics; Quantum mechanics; Economics","score_opus":0.010905218789900173,"score_gpt":0.2741584986778719,"score_spread":0.2632532798879717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406460477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44279402,0.00006838939,0.5567442,0.00014607824,0.000077664125,0.000054868182,3.2126886e-7,0.00006191205,0.000052522904],"genre_scores_gemma":[0.93871105,0.0000027839549,0.061232977,0.000010125653,0.000008255612,0.0000015209134,0.0000013988283,0.000003492773,0.000028404678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943554,0.00002609689,0.00017335087,0.0001671565,0.000111422305,0.00008641112],"domain_scores_gemma":[0.9996337,0.00018292795,0.000032229178,0.0001138645,0.00001708158,0.000020165538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019981124,0.00006028925,0.00007214703,0.00015318117,0.000025552792,0.00012514123,0.000088837696,0.000018207276,0.0000013811613],"category_scores_gemma":[0.000023537723,0.000050699062,0.000012789695,0.00029148144,0.000013214492,0.00032409956,0.000051852006,0.00006665204,0.000002130238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.232976e-7,0.000008655023,0.00019187777,0.00009774917,0.000003078119,0.0000018056633,0.0039536846,0.6249188,0.0002692617,0.0061054574,9.3905754e-7,0.36444816],"study_design_scores_gemma":[0.000056588233,0.00002267197,0.033288557,0.000102519305,0.0000010966535,0.000002564271,0.000007550969,0.9551951,0.00017688796,0.011058405,0.000033750446,0.000054288703],"about_ca_topic_score_codex":0.0000704458,"about_ca_topic_score_gemma":0.000014418192,"teacher_disagreement_score":0.49591702,"about_ca_system_score_codex":0.00002034644,"about_ca_system_score_gemma":0.00002170139,"threshold_uncertainty_score":0.20674478},"labels":[],"label_agreement":null},{"id":"W4406464666","doi":"10.1007/s10623-024-01552-1","title":"Additive twisted codes: new distance bounds and infinite families of quantum codes","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación; Ministerio de Economía y Competitividad","keywords":"Mathematics; Quantum; Cryptography; Discrete mathematics; Combinatorics; Algorithm; Quantum mechanics","score_opus":0.011477188684224376,"score_gpt":0.2414844077531521,"score_spread":0.23000721906892774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406464666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1089113,0.003565372,0.8859681,0.00034093158,0.00016128492,0.00018542037,0.00007219493,0.00014859374,0.0006467941],"genre_scores_gemma":[0.93253213,0.0013597502,0.06553351,0.00044265058,0.0000412119,0.0000119502765,0.000016690656,0.0000125544375,0.000049555987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836683,0.00012107539,0.00037089735,0.0005582118,0.00022503277,0.0003579549],"domain_scores_gemma":[0.9986386,0.00052460784,0.00016048933,0.0004099768,0.00011949442,0.00014686404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024944817,0.0002966275,0.00045947023,0.00042730806,0.00030314483,0.00027930265,0.00045454403,0.00009930539,0.0000032412647],"category_scores_gemma":[0.000042850923,0.00025717032,0.00012483225,0.0012178292,0.00048286945,0.00016636577,0.00023256757,0.00020628859,5.5606387e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009517796,0.00014648166,0.006848117,0.00023625791,0.00029861293,0.000020597307,0.0046700407,0.00041403866,0.0015193281,0.7899239,0.003524868,0.19230255],"study_design_scores_gemma":[0.002451841,0.0010936988,0.051769406,0.001239337,0.00014381025,0.000043747186,0.0014831325,0.61463225,0.0034589435,0.26868066,0.05371719,0.0012859729],"about_ca_topic_score_codex":0.00021887808,"about_ca_topic_score_gemma":0.000047803842,"teacher_disagreement_score":0.8236208,"about_ca_system_score_codex":0.0000074790246,"about_ca_system_score_gemma":0.00009869454,"threshold_uncertainty_score":0.9999881},"labels":[],"label_agreement":null},{"id":"W4406548235","doi":"10.48550/arxiv.2501.09413","title":"Quantum algorithm for the gradient of a logarithm-determinant","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; U.S. Department of State; US-UK Fulbright Commission; University of Victoria; Canada Research Chairs","keywords":"Logarithm; Algorithm; Quantum; Quantum algorithm; Mathematics; Computer science; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.02970079912870094,"score_gpt":0.27617718804892444,"score_spread":0.2464763889202235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406548235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059007656,0.0013430116,0.93198013,0.0019933928,0.004323352,0.00094057206,0.000119048425,0.00019842508,0.00009443393],"genre_scores_gemma":[0.6012631,0.0004579069,0.39337283,0.0012776789,0.0014756375,0.00058164133,0.00005203683,0.000084058156,0.0014351276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972973,0.000113848604,0.000652874,0.0010040574,0.00035603327,0.0005758961],"domain_scores_gemma":[0.99645543,0.0008219331,0.00047599158,0.0019109205,0.00023834484,0.000097397424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069228065,0.00045817147,0.0006362418,0.00020681809,0.00031724008,0.000117942094,0.0032294474,0.00026090132,0.0000027126648],"category_scores_gemma":[0.0000824737,0.0003123883,0.0005425731,0.00035168132,0.00017551969,0.00005888003,0.0032181619,0.0008140521,0.0000064613782],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011648162,0.00025503253,0.0017855078,0.00045558353,0.00030801588,0.00003592217,0.0016720828,0.0067853746,0.000069381866,0.005977279,0.0014636336,0.98118055],"study_design_scores_gemma":[0.00034201023,0.00015859347,0.007844456,0.00039110493,0.00006767089,0.000017431023,0.000024399398,0.9745618,0.0008343659,0.0069777393,0.008414605,0.00036581032],"about_ca_topic_score_codex":0.00020547594,"about_ca_topic_score_gemma":0.000011325679,"teacher_disagreement_score":0.98081475,"about_ca_system_score_codex":0.000054000593,"about_ca_system_score_gemma":0.00035733488,"threshold_uncertainty_score":0.9999328},"labels":[],"label_agreement":null},{"id":"W4406583398","doi":"10.1038/s41534-025-00960-y","title":"Noise-agnostic quantum error mitigation with data augmented neural models","year":2025,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; Research Grants Council, University Grants Committee; Natural Science Foundation of Guangdong Province; Government of Canada; John Templeton Foundation","keywords":"Computer science; Noise (video); Quantum error correction; Quantum noise; Quantum; Quantum computer; Artificial neural network; Artificial intelligence; Computer engineering; Algorithm; Physics","score_opus":0.017925028831475766,"score_gpt":0.25164698768510885,"score_spread":0.2337219588536331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406583398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18040368,0.00006518248,0.8148961,0.0026049155,0.00063452,0.0003557421,0.000027157575,0.00044606283,0.00056660955],"genre_scores_gemma":[0.9853575,0.000013024289,0.013021779,0.0011921648,0.000051895553,0.000019626217,0.00030766576,0.000009064354,0.000027277696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980466,0.00008192266,0.0005627691,0.00038757446,0.00050899084,0.00041218678],"domain_scores_gemma":[0.9978692,0.00021076067,0.00027538504,0.0013298996,0.00021753393,0.00009722554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003977012,0.00026666973,0.00023098827,0.00036653967,0.00036417044,0.00048564363,0.0016036095,0.000096401964,0.0000040287036],"category_scores_gemma":[0.00012897082,0.00021778599,0.000046567202,0.0009292165,0.00006656606,0.0048210076,0.0005888487,0.00030561502,0.000050046787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011918228,0.000121922196,0.00032210685,0.00025110992,0.00008594999,0.000014119448,0.0022358948,0.5354892,0.00011865467,0.23668656,0.0049216384,0.21963364],"study_design_scores_gemma":[0.00071465527,0.00012331374,0.0029522525,0.000151827,0.000019928142,0.00002574771,0.000088118824,0.9844805,0.000084682935,0.009173979,0.0019245137,0.00026049573],"about_ca_topic_score_codex":0.00008868736,"about_ca_topic_score_gemma":0.000016132153,"teacher_disagreement_score":0.8049538,"about_ca_system_score_codex":0.000058590947,"about_ca_system_score_gemma":0.00020829252,"threshold_uncertainty_score":0.88810545},"labels":[],"label_agreement":null},{"id":"W4406604134","doi":"10.48550/arxiv.2501.10077","title":"Double descent in quantum kernel methods","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Volkswagen Aktiengesellschaft; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Natural Sciences and Engineering Research Council of Canada; European Commission; Bundesministerium für Bildung und Forschung; Compute Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Quantum; Computer science; Descent (aeronautics); Quantum machine learning; Artificial intelligence; Physics; Quantum mechanics; Quantum algorithm","score_opus":0.05400424538659947,"score_gpt":0.34532707240163857,"score_spread":0.2913228270150391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406604134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46371815,0.0009622018,0.528546,0.0017872858,0.003291956,0.00037359033,0.0000052092314,0.00038702833,0.0009286114],"genre_scores_gemma":[0.6025398,0.00013590214,0.39472198,0.00093302416,0.00041732047,0.00008249021,0.000015600883,0.000036582387,0.0011173517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996731,0.00036421863,0.00061283325,0.0013347288,0.0002982233,0.0006590167],"domain_scores_gemma":[0.9975477,0.0002578088,0.00023964449,0.0017164574,0.000095396324,0.00014299079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011640617,0.00047670412,0.0006287588,0.00040070305,0.0001342822,0.00021035229,0.0026838658,0.00035912596,0.000009694034],"category_scores_gemma":[0.00007423574,0.00044396342,0.0002585863,0.00066621794,0.00006389387,0.00009699974,0.004877062,0.0016665213,0.000046790487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011217595,0.0012613964,0.2525265,0.0015720365,0.00039353553,0.0005833271,0.009607064,0.24002457,0.0010801095,0.0499096,0.0027973973,0.4401323],"study_design_scores_gemma":[0.00074936904,0.000046001944,0.07477372,0.00070521975,0.000017597344,0.000012209829,0.000016611133,0.9025099,0.0020890555,0.012674949,0.005711355,0.0006939657],"about_ca_topic_score_codex":0.0006035055,"about_ca_topic_score_gemma":0.000034658413,"teacher_disagreement_score":0.66248536,"about_ca_system_score_codex":0.00014373321,"about_ca_system_score_gemma":0.00042347622,"threshold_uncertainty_score":0.9998012},"labels":[],"label_agreement":null},{"id":"W4406693713","doi":"10.1038/s41586-024-08406-9","title":"Scaling and networking a modular photonic quantum computer","year":2025,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Modular design; Scaling; Photonics; Quantum; Computer science; Physics; Optoelectronics; Quantum mechanics; Mathematics; Operating system","score_opus":0.004330653573058053,"score_gpt":0.23268373494277808,"score_spread":0.22835308136972002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406693713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22223409,0.008914239,0.7606245,0.004177855,0.0030090378,0.00016994843,0.0000011107962,0.0004025856,0.0004666201],"genre_scores_gemma":[0.9269653,0.00004815882,0.06909135,0.003454238,0.00035948167,0.0000025942595,0.0000013906912,0.000007999339,0.00006951998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988418,0.000051806193,0.00015031958,0.00047250782,0.00017189293,0.0003116638],"domain_scores_gemma":[0.99932265,0.00013798896,0.000046834604,0.0003850572,0.000046275167,0.00006121658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000237327,0.00016129085,0.00018222762,0.00012906865,0.00023918258,0.00024166313,0.0005634099,0.00046689846,9.962271e-7],"category_scores_gemma":[0.000011599787,0.00013753654,0.00006141575,0.00052621256,0.000035962395,0.000095568306,0.0004921534,0.0016555728,0.0000024555295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007728948,0.000047780588,0.00054101466,0.00007601425,0.00006871917,0.00006736811,0.000573057,0.011140627,0.0005732484,0.08954591,0.0034913404,0.8938672],"study_design_scores_gemma":[0.00021209625,0.000020273474,0.0015721241,0.00014326062,0.0000049713954,0.00002462097,0.0000030347978,0.9515353,0.0001698007,0.010816548,0.03535401,0.00014395264],"about_ca_topic_score_codex":0.0000063158454,"about_ca_topic_score_gemma":0.0000013171317,"teacher_disagreement_score":0.9403947,"about_ca_system_score_codex":0.000018715897,"about_ca_system_score_gemma":0.000043914984,"threshold_uncertainty_score":0.7192732},"labels":[],"label_agreement":null},{"id":"W4406799095","doi":"10.1103/physreva.111.012215","title":"Nonadiabatic quantum optimization for crossing quantum phase transitions","year":2025,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Horizon 2020; Fonds National de la Recherche Luxembourg","keywords":"Quantum; Physics; Quantum phase transition; Quantum mechanics","score_opus":0.015694194763368387,"score_gpt":0.37593549057548475,"score_spread":0.3602412958121164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406799095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014605646,0.048662096,0.92294925,0.010868632,0.00033830688,0.0019948937,0.000045365116,0.00029211486,0.00024367277],"genre_scores_gemma":[0.8435736,0.053052098,0.073735334,0.025757037,0.0016285133,0.0017195544,0.0002629871,0.00015661941,0.000114313014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965637,0.0003237914,0.00081238,0.0010481938,0.0005059107,0.00074607093],"domain_scores_gemma":[0.9971131,0.00085986056,0.000317902,0.0011000698,0.0003142986,0.00029478443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000570707,0.0005481663,0.0014768908,0.00011173722,0.0006776153,0.0003079474,0.0011714394,0.00004745463,0.000009172513],"category_scores_gemma":[0.0006626611,0.00044609117,0.0010654343,0.0017904892,0.00020863715,0.00041772472,0.00019840404,0.00047837844,0.000056744768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025164765,0.0036279974,0.0000037349585,0.024638347,0.00019590351,0.000016991075,0.000486682,0.0076745213,0.0055483887,0.45227113,0.008632712,0.49687845],"study_design_scores_gemma":[0.00062664546,0.00026321967,0.000010739891,0.014199724,0.00028516087,0.0000055232417,0.000002060455,0.90578336,0.0005519059,0.055980023,0.021841506,0.0004501493],"about_ca_topic_score_codex":0.0000073266574,"about_ca_topic_score_gemma":9.605909e-7,"teacher_disagreement_score":0.89810884,"about_ca_system_score_codex":0.00008193361,"about_ca_system_score_gemma":0.00034034514,"threshold_uncertainty_score":0.9997991},"labels":[],"label_agreement":null},{"id":"W4406849107","doi":"10.1016/j.jss.2025.112362","title":"Introduction to the Special Section on software engineering for hybrid quantum computing systems","year":2025,"lang":"en","type":"article","venue":"Journal of Systems and Software","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Toronto Metropolitan University","funders":"JST-Mirai Program; Natural Sciences and Engineering Research Council of Canada","keywords":"Special section; Section (typography); Computer science; Software engineering; Software; Systems engineering; Engineering; Operating system; Engineering physics","score_opus":0.006792106591332196,"score_gpt":0.21888009141706094,"score_spread":0.21208798482572874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406849107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07206849,0.00068842375,0.90385157,0.00158626,0.021406874,0.0003150434,0.000006377201,0.00007440047,0.0000025714994],"genre_scores_gemma":[0.83046657,0.00003109368,0.06961066,0.00041659543,0.09901094,0.000021950631,0.0000037905897,0.000046949102,0.0003914593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986687,0.0000699829,0.0005063199,0.0002534338,0.00026932877,0.00023226661],"domain_scores_gemma":[0.9987474,0.00035275755,0.0002829322,0.00025052612,0.00028320166,0.00008315797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009772028,0.0001627301,0.00032128269,0.00026779211,0.00035662332,0.00045913286,0.0003847428,0.000051565166,2.9971235e-7],"category_scores_gemma":[0.0004472557,0.00010949296,0.000105821295,0.00029463568,0.00001154219,0.00013120747,0.00009641395,0.00029910324,0.0000012140541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004143577,0.000036627214,0.00023275758,0.00039524102,0.00009941878,0.000015084582,0.00078942406,0.885412,0.000055134566,0.010338118,0.069060564,0.0335242],"study_design_scores_gemma":[0.00042590586,0.00048106833,0.00097317505,0.0009186548,0.000021039517,0.0005554496,0.00014187973,0.75827783,0.000045779132,0.00010393175,0.23786992,0.0001853397],"about_ca_topic_score_codex":0.000019011697,"about_ca_topic_score_gemma":0.0000013516168,"teacher_disagreement_score":0.8342409,"about_ca_system_score_codex":0.00009278736,"about_ca_system_score_gemma":0.00006351958,"threshold_uncertainty_score":0.44649932},"labels":[],"label_agreement":null},{"id":"W4406957844","doi":"10.1145/3712002","title":"Quantum Software Engineering: Roadmap and Challenges Ahead","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación; European Commission","keywords":"Computer science; Software engineering; Software requirements; Software; Systems engineering; Software development; Software construction; Programming language; Engineering","score_opus":0.05628912930751191,"score_gpt":0.285834054176502,"score_spread":0.22954492486899009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406957844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017580694,0.005322182,0.97327214,0.0016098894,0.0011384533,0.00011541739,0.0000051456227,0.00095308153,0.0000029776706],"genre_scores_gemma":[0.04477303,0.001289062,0.9535711,0.00017931305,0.00005534202,0.00003252354,0.000001176205,0.000025411739,0.000073040595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848825,0.00012745477,0.00024626037,0.0006126711,0.000115082636,0.0004102742],"domain_scores_gemma":[0.99627835,0.002855425,0.000036673468,0.0006457125,0.00004399422,0.00013984244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057111954,0.000302666,0.0003944357,0.00043175646,0.00018042907,0.000063197775,0.0004700702,0.000201615,0.0000025010427],"category_scores_gemma":[0.0010709402,0.00029474436,0.00008181645,0.00033147607,0.000045721947,0.00011007199,0.0000674632,0.0005169221,0.0000022229303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015328083,0.000063064996,0.000082191444,0.00039812067,0.00013970316,0.000023880755,0.001060279,0.1108961,0.00025947927,0.01315779,0.000028963346,0.8738751],"study_design_scores_gemma":[0.0019941882,0.0009010138,0.023507377,0.0007687487,0.0001555312,0.00067537953,0.00013612886,0.8909385,0.003367182,0.009790581,0.06604826,0.0017171218],"about_ca_topic_score_codex":0.000015803986,"about_ca_topic_score_gemma":0.0000023448001,"teacher_disagreement_score":0.872158,"about_ca_system_score_codex":0.000022827608,"about_ca_system_score_gemma":0.000039058395,"threshold_uncertainty_score":0.99995047},"labels":[],"label_agreement":null},{"id":"W4406961340","doi":"10.48550/arxiv.2501.17008","title":"Dephasing-induced leakage in multi-level superconducting quantum circuits","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Army Research Office; Williams College","keywords":"Dephasing; Leakage (economics); Superconductivity; Condensed matter physics; Electronic circuit; Physics; Quantum; Materials science; Quantum mechanics","score_opus":0.14638436380436368,"score_gpt":0.32119110006201423,"score_spread":0.17480673625765056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406961340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8623423,0.00036054233,0.13139968,0.0009671201,0.0038394784,0.0004213484,0.00001888491,0.0004996788,0.0001509556],"genre_scores_gemma":[0.9732913,0.000022912167,0.025674671,0.0004013502,0.00028770047,0.000036120928,0.000017155464,0.000040794337,0.00022801418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558896,0.00033016296,0.00084779813,0.0018458866,0.0004228603,0.00096430554],"domain_scores_gemma":[0.9972602,0.0003298434,0.000291908,0.0017785344,0.00015758321,0.00018191917],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0008481196,0.0006908434,0.0008038682,0.000633913,0.00030452135,0.00031984664,0.0028867219,0.0005537986,0.0000066846496],"category_scores_gemma":[0.00039143502,0.0007036864,0.0002957355,0.0008468126,0.00006736448,0.0002798995,0.0036888088,0.0025705234,0.00006200848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019657433,0.0021289329,0.33080262,0.002204913,0.0005639733,0.0026563914,0.027473407,0.037750922,0.068972394,0.007815931,0.0004265152,0.51918435],"study_design_scores_gemma":[0.0013206139,0.00008624361,0.18690445,0.001855696,0.000030465422,0.00008406238,0.00017297154,0.79888743,0.0069043622,0.0018637988,0.00032178615,0.0015681434],"about_ca_topic_score_codex":0.0006344518,"about_ca_topic_score_gemma":0.00017228693,"teacher_disagreement_score":0.7611365,"about_ca_system_score_codex":0.00019050147,"about_ca_system_score_gemma":0.0006263309,"threshold_uncertainty_score":0.9997306},"labels":[],"label_agreement":null},{"id":"W4406968123","doi":"10.1038/s41928-025-01337-x","title":"The success and failure of quantum computing start-ups","year":2025,"lang":"en","type":"article","venue":"Nature Electronics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Quantum computer; Computer science; Computer security; Business; Quantum; Physics; Quantum mechanics","score_opus":0.002417796958530269,"score_gpt":0.23367164201850732,"score_spread":0.23125384505997704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406968123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38656673,0.04251809,0.552564,0.015944108,0.0011277986,0.00033613184,0.000003566847,0.0002814647,0.0006580949],"genre_scores_gemma":[0.9923766,0.00013545675,0.0069761802,0.000358243,0.00006278878,0.0000011878134,0.0000012113888,0.000007127678,0.000081180195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986446,0.00008926537,0.00023554036,0.00034257467,0.00024080946,0.0004472258],"domain_scores_gemma":[0.99873984,0.0004998656,0.00012061512,0.00047491948,0.00012298579,0.000041761406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049654604,0.00016054412,0.0001944722,0.00009040729,0.00044957545,0.00017340019,0.001001413,0.00017993849,3.8642344e-7],"category_scores_gemma":[0.00009226726,0.00010931028,0.00006297255,0.00068076875,0.0000917175,0.00007908584,0.00039826852,0.0011485384,5.11455e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009637108,0.00002609716,0.00046558198,0.000041347816,0.000055501376,0.0000033492252,0.0002552198,0.0011160978,0.000419452,0.8455015,0.0020964954,0.15000974],"study_design_scores_gemma":[0.0003045926,0.000113590824,0.0017607062,0.00006841641,0.000010777058,0.000018806422,0.000024193369,0.90528303,0.002434279,0.03875386,0.051062405,0.00016532744],"about_ca_topic_score_codex":0.000007634279,"about_ca_topic_score_gemma":0.00004305776,"teacher_disagreement_score":0.90416694,"about_ca_system_score_codex":0.000032014384,"about_ca_system_score_gemma":0.0002125382,"threshold_uncertainty_score":0.4989892},"labels":[],"label_agreement":null},{"id":"W4406972291","doi":"10.1016/j.compfluid.2025.106559","title":"On solving for shocks and travelling waves using a quantum algorithm","year":2025,"lang":"en","type":"article","venue":"Computers & Fluids","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Algorithm; Quantum; Computer science; Mathematics; Applied mathematics; Physics; Quantum mechanics","score_opus":0.013612440323229337,"score_gpt":0.2584330706650854,"score_spread":0.24482063034185608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406972291","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07468096,0.00057261804,0.92206925,0.0005066139,0.001585657,0.00027091164,0.0000041557246,0.00024014259,0.00006968548],"genre_scores_gemma":[0.1774406,0.000015986328,0.82098794,0.0012059623,0.00025068698,0.000008789014,0.0000031905608,0.0000225745,0.000064291155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981665,0.000060363724,0.00033708758,0.0007376189,0.0001893812,0.00050903275],"domain_scores_gemma":[0.9986553,0.0006181728,0.00006691433,0.00046866125,0.00007695363,0.00011395908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035618994,0.00029241832,0.0003344544,0.000312228,0.0005261256,0.0004084527,0.0007099561,0.000098745455,7.7870135e-7],"category_scores_gemma":[0.00003407532,0.00027478815,0.00013403392,0.00040621727,0.00007726747,0.00014796262,0.00038823226,0.00023205373,0.0000014032715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001703351,0.00010034648,0.000040401424,0.00011970832,0.00010051749,0.000022954526,0.0014542816,0.0310078,0.0026850004,0.090847954,0.0011526948,0.8724513],"study_design_scores_gemma":[0.0005599255,0.00018607729,0.00018086952,0.00031584894,0.00001370981,0.000025588428,0.000017653627,0.97217786,0.00090264156,0.024462992,0.0008710915,0.0002857615],"about_ca_topic_score_codex":0.000014265854,"about_ca_topic_score_gemma":4.1871638e-7,"teacher_disagreement_score":0.94117004,"about_ca_system_score_codex":0.00005095862,"about_ca_system_score_gemma":0.00009393714,"threshold_uncertainty_score":0.99997044},"labels":[],"label_agreement":null},{"id":"W4407051598","doi":"10.1109/ojcoms.2025.3537957","title":"An In-Depth Comparative Study of Quantum-Classical Encoding Methods for Network Intrusion Detection","year":2025,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec en Outaouais","funders":"Mitacs","keywords":"Intrusion detection system; Encoding (memory); Intrusion; Quantum; Computer science; Artificial intelligence; Geology; Physics; Quantum mechanics","score_opus":0.08357359346310905,"score_gpt":0.43270622162760375,"score_spread":0.3491326281644947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407051598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14608781,0.00021314679,0.85092765,0.0015561873,0.00056990946,0.00053292175,5.37254e-7,0.000008889383,0.00010296167],"genre_scores_gemma":[0.6608994,0.000024552823,0.33895558,0.00007006101,0.000030918276,0.000009833843,1.3159024e-7,0.0000030558383,0.0000064427227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753803,0.0014378227,0.0005953882,0.00014819161,0.00013420994,0.00014635557],"domain_scores_gemma":[0.9966053,0.0011788179,0.00058434455,0.0013187522,0.00027551496,0.00003727758],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0031986383,0.00010350548,0.00034076805,0.000058315327,0.00065225427,0.00016231762,0.0058562313,0.000051446474,3.2813549e-7],"category_scores_gemma":[0.000067697314,0.00007217323,0.00018842559,0.00092868344,0.00010382374,0.00029801,0.0012684367,0.0005519124,8.994487e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015544688,0.0040144767,0.002569393,0.00004529815,0.0005595053,5.94869e-7,0.07569436,0.39276823,0.022755465,0.022669522,0.0020060532,0.47676164],"study_design_scores_gemma":[0.0008024508,0.0003792114,0.0034061915,0.00015835038,0.000028942928,0.000006967562,0.0021205316,0.978784,0.001500091,0.012018564,0.00071744004,0.00007723458],"about_ca_topic_score_codex":0.000040492137,"about_ca_topic_score_gemma":0.00011410694,"teacher_disagreement_score":0.58601576,"about_ca_system_score_codex":0.000086561195,"about_ca_system_score_gemma":0.00016587698,"threshold_uncertainty_score":0.99952257},"labels":[],"label_agreement":null},{"id":"W4407121537","doi":"10.1016/j.laa.2025.02.005","title":"Quantum state transfer in graphs with tails","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Directorate for Mathematical and Physical Sciences; Université de Montréal; National Science Foundation","keywords":"Mathematics; Quantum; Transfer (computing); Quantum graph; Combinatorics; State (computer science); Quantum state; Discrete mathematics; Graph; Quantum mechanics; Physics; Algorithm; Computer science","score_opus":0.0057711949564411965,"score_gpt":0.22846685259850028,"score_spread":0.2226956576420591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407121537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27982843,0.00041931964,0.7168595,0.0021074824,0.000026666812,0.0003082253,0.0000054174357,0.000107430926,0.0003375378],"genre_scores_gemma":[0.990145,0.000079770565,0.00903584,0.0004357283,0.000017447193,0.00009240063,0.0000037212626,0.00000659401,0.0001834573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999208,0.000022745913,0.0001596513,0.0003306156,0.00008730624,0.00019171757],"domain_scores_gemma":[0.999554,0.00006991321,0.000016135364,0.00026675378,0.00003868155,0.000054545646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009391052,0.000109735476,0.00012293915,0.00015407354,0.00013222352,0.0000659532,0.0003057506,0.000032451662,0.000001898316],"category_scores_gemma":[0.0000028728011,0.00008595371,0.0000231801,0.0008340081,0.00003524217,0.00009248466,0.000060072103,0.00015955439,0.000007453944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064543665,0.000103213744,0.00045558883,0.000040670704,0.00001921084,0.0000035596456,0.00059742044,0.0008025939,0.0005504048,0.91521066,0.00005611788,0.08215412],"study_design_scores_gemma":[0.00069823663,0.00009147797,0.0065997504,0.000072792136,0.0000097257,0.000011558822,0.000028389739,0.8885484,0.0020260687,0.08599682,0.015634406,0.00028237407],"about_ca_topic_score_codex":0.000015457626,"about_ca_topic_score_gemma":0.000019687881,"teacher_disagreement_score":0.8877458,"about_ca_system_score_codex":0.0000054032207,"about_ca_system_score_gemma":0.00004969552,"threshold_uncertainty_score":0.35050905},"labels":[],"label_agreement":null},{"id":"W4407123949","doi":"10.48550/arxiv.2502.00670","title":"Gaussian quantum data hiding","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Canada First Research Excellence Fund; Innovation, Science and Economic Development Canada","keywords":"Gaussian; Computer science; Quantum; Statistical physics; Physics; Quantum mechanics","score_opus":0.06870069545591137,"score_gpt":0.30486511240743464,"score_spread":0.23616441695152326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407123949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33402812,0.001508426,0.64120805,0.010054117,0.008187568,0.0004654292,0.00015480204,0.00137171,0.0030217618],"genre_scores_gemma":[0.9379139,0.00012619776,0.057708275,0.0013867596,0.001219561,0.00001997786,0.00021849398,0.000039892395,0.0013669309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964548,0.00016929487,0.0005038886,0.0018600286,0.00039083048,0.00062119396],"domain_scores_gemma":[0.9940444,0.00020914273,0.00028061483,0.0052214423,0.00007583025,0.000168548],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006248053,0.0004804161,0.0005202931,0.00026214414,0.00031946972,0.0003837233,0.0080417115,0.00044162033,0.000012512097],"category_scores_gemma":[0.0001572746,0.00043982491,0.00016065969,0.0004617714,0.00006966621,0.00022695494,0.018694622,0.0020887991,0.00008985546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040613344,0.0010045319,0.17658345,0.0028714947,0.0013809323,0.0014106398,0.0068660537,0.044097297,0.0006017029,0.11664442,0.07139459,0.5771043],"study_design_scores_gemma":[0.00018508136,0.000029830822,0.017826252,0.0006573602,0.000030546125,0.00001925766,0.000013378221,0.95053273,0.00017791642,0.006640975,0.023258092,0.0006285683],"about_ca_topic_score_codex":0.00018681597,"about_ca_topic_score_gemma":0.000010091707,"teacher_disagreement_score":0.90643543,"about_ca_system_score_codex":0.000058239923,"about_ca_system_score_gemma":0.00046459027,"threshold_uncertainty_score":0.99980533},"labels":[],"label_agreement":null},{"id":"W4407199389","doi":"","title":"Definability, Undecidability, and Geometric Embeddings in Compressed Quantum States","year":2025,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"","keywords":"Quantum; Pure mathematics; Theoretical physics; Mathematics; Physics; Mathematical physics; Quantum mechanics","score_opus":0.0105781821302512,"score_gpt":0.23749237430363201,"score_spread":0.22691419217338082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407199389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36577085,0.0015448261,0.6162916,0.01162541,0.00030173737,0.0005746878,0.0000470506,0.00036481043,0.003479046],"genre_scores_gemma":[0.86575526,0.0004758686,0.1328165,0.00014517918,0.000012811527,0.000054176417,0.000100391684,0.00002141523,0.00061843003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99269795,0.0040500406,0.00074064353,0.0014920778,0.00048616139,0.00053310493],"domain_scores_gemma":[0.9911573,0.004438611,0.00039467073,0.002680091,0.0011387643,0.00019059636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0065368866,0.00044351094,0.00061358244,0.0007990943,0.0003082068,0.0009139412,0.0027295393,0.00030378322,0.00001060387],"category_scores_gemma":[0.0017908822,0.00046056937,0.00017298371,0.0015981655,0.00030020453,0.000194639,0.0073427875,0.0011215804,0.000004324153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025182664,0.0024842888,0.03674163,0.0020901307,0.0001538384,0.000036134214,0.0282708,0.019943167,0.00023233471,0.53562826,0.001012804,0.37338144],"study_design_scores_gemma":[0.0004710395,8.7870495e-7,0.023401996,0.0014340605,0.000012765747,0.000008030959,0.000039110353,0.86083055,0.0015440797,0.11001611,0.0017732346,0.00046813212],"about_ca_topic_score_codex":0.0025135526,"about_ca_topic_score_gemma":0.0008979788,"teacher_disagreement_score":0.84088737,"about_ca_system_score_codex":0.00016691827,"about_ca_system_score_gemma":0.00040832435,"threshold_uncertainty_score":0.9997846},"labels":[],"label_agreement":null},{"id":"W4407316165","doi":"10.1109/mnet.2025.3540169","title":"Integrated Non-Terrestrial and Terrestrial Quantum Anonymous Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Network","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Terrestrial ecosystem; Computer network; Telecommunications; Ecosystem","score_opus":0.009385068255156238,"score_gpt":0.23614081195459843,"score_spread":0.2267557436994422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407316165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14775367,0.0007077314,0.8212188,0.0007052211,0.027859792,0.00037615432,0.0000015429371,0.0004158865,0.00096123305],"genre_scores_gemma":[0.97774744,0.000053538803,0.010485566,0.00066153257,0.010754978,0.000018224227,0.000008296263,0.000022812366,0.00024763492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979138,0.00017177543,0.0004054114,0.0006545036,0.00018371077,0.0006707915],"domain_scores_gemma":[0.9987845,0.00034836735,0.00012283768,0.00058021635,0.00001963282,0.00014448188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042503932,0.00031316752,0.00038647203,0.00012337317,0.00036099646,0.00042639425,0.00085806736,0.00019992593,0.0000013805209],"category_scores_gemma":[0.00003600471,0.00026299257,0.00011002644,0.00100777,0.00010814644,0.00013258081,0.00028019704,0.00058985036,0.0000070884903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002721076,0.00011436815,0.00060348876,0.0000115414405,0.0001313165,0.00014336963,0.00024583432,0.61179066,0.00006227879,0.0019274006,0.17214467,0.21255293],"study_design_scores_gemma":[0.0010607501,0.00013644692,0.00066002033,0.00015986775,0.000012775611,0.000021657204,0.0000043086284,0.97429454,0.000027418047,0.0061859204,0.017169869,0.00026644865],"about_ca_topic_score_codex":0.0001679909,"about_ca_topic_score_gemma":0.00002423121,"teacher_disagreement_score":0.8299937,"about_ca_system_score_codex":0.000030041618,"about_ca_system_score_gemma":0.00014944679,"threshold_uncertainty_score":0.99998224},"labels":[],"label_agreement":null},{"id":"W4407319397","doi":"10.1103/physrevresearch.7.013148","title":"Geometric quantum machine learning with horizontal quantum gates","year":2025,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Waterloo","funders":"Simons Foundation; National Science Foundation","keywords":"Quantum; Physics; Computer science; Quantum mechanics","score_opus":0.029735112134032918,"score_gpt":0.36321438976928044,"score_spread":0.33347927763524754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407319397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2917139,0.29633853,0.36325184,0.033399113,0.0007141595,0.0031438095,0.000013505789,0.0015081267,0.009917061],"genre_scores_gemma":[0.98999614,0.006698507,0.0023308138,0.0003028738,0.00018777681,0.00007013718,0.000007884925,0.00002422874,0.00038166397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961681,0.00070397614,0.00029170813,0.0007903366,0.0011682338,0.00087769737],"domain_scores_gemma":[0.997243,0.0013636304,0.00007718368,0.00077043514,0.00034339007,0.0002023488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017685011,0.00026171806,0.0005575008,0.0005151212,0.0005519647,0.0002582442,0.0016014797,0.000035923124,0.000011900638],"category_scores_gemma":[0.00082308834,0.00017502841,0.00016881725,0.006283103,0.00018684597,0.00019043229,0.0009979312,0.001609822,0.00016439876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036849742,0.00075888,0.0010803491,0.0029458478,0.00013518735,0.00014572604,0.00023063779,0.00057358673,0.0009828013,0.40891522,0.004298518,0.5798964],"study_design_scores_gemma":[0.00034390378,0.00092825387,0.001120252,0.0028410018,0.000018328165,0.00002152559,0.000010253592,0.92213875,0.0005705385,0.018788759,0.05288842,0.00033001235],"about_ca_topic_score_codex":0.00014928519,"about_ca_topic_score_gemma":0.000004549929,"teacher_disagreement_score":0.9215652,"about_ca_system_score_codex":0.000072624505,"about_ca_system_score_gemma":0.0002273947,"threshold_uncertainty_score":0.7137451},"labels":[],"label_agreement":null},{"id":"W4407437711","doi":"10.1088/1751-8121/adb5df","title":"Leveraging Hamiltonian simulation techniques to compile operations on bosonic devices","year":2025,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Canadian Institute for Advanced Research","funders":"Advanced Scientific Computing Research; Basic Energy Sciences; UCL Engineering, University College London","keywords":"Compiler; Computer science; Compile time; Hamiltonian (control theory); Programming language; Mathematics; Mathematical optimization","score_opus":0.009894133750762335,"score_gpt":0.28115348922785827,"score_spread":0.27125935547709595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407437711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22377945,0.00001316339,0.77239776,0.003123473,0.000045301775,0.000077813274,4.805701e-7,0.000026866983,0.0005356769],"genre_scores_gemma":[0.8858665,0.0000013391224,0.11317818,0.00084050297,0.000097539334,0.0000015240945,1.0746613e-7,0.0000041542703,0.000010108682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991449,0.00006243176,0.00030504927,0.00013896362,0.00020656544,0.00014209957],"domain_scores_gemma":[0.9991302,0.00044915683,0.000051703144,0.00016483713,0.00010754952,0.000096571486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003538588,0.00010709242,0.0002270737,0.000087662906,0.00013343728,0.00019430168,0.00030045692,0.00003373511,0.0000056457575],"category_scores_gemma":[0.00010515629,0.00007291087,0.00007041977,0.00022114825,0.00008953582,0.000095840536,0.00014710784,0.00022469752,0.000005048624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006138823,0.00010534768,0.000004272932,0.000028139048,0.00001700978,0.0000041421767,0.00039814366,0.009815587,0.00015493149,0.96713144,0.000013255332,0.022321617],"study_design_scores_gemma":[0.00006941103,0.00011970714,0.00004255953,0.0002386792,0.000007519681,0.000009154197,0.000010071982,0.48317522,0.0012085952,0.51499814,0.00007116721,0.000049779275],"about_ca_topic_score_codex":2.5031366e-7,"about_ca_topic_score_gemma":5.4720232e-8,"teacher_disagreement_score":0.6620871,"about_ca_system_score_codex":0.0000170428,"about_ca_system_score_gemma":0.000042539592,"threshold_uncertainty_score":0.29732192},"labels":[],"label_agreement":null},{"id":"W4407545940","doi":"10.1145/3717450","title":"Lower Bounds for Learning Quantum States with Single-Copy Measurements","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quantum; Quantum state; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.020655054141640625,"score_gpt":0.2656118194055775,"score_spread":0.24495676526393687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407545940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019859772,0.000049627582,0.97718805,0.0012228799,0.00072916754,0.00030851061,0.0000039841198,0.00043469446,0.00020333541],"genre_scores_gemma":[0.84082896,0.000002715166,0.15809241,0.00053041236,0.00002758148,0.000041641946,0.000008858819,0.000019417388,0.00044798697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847746,0.0002049098,0.00025644797,0.00047769764,0.00027934686,0.00030415886],"domain_scores_gemma":[0.9982194,0.0009920667,0.00010380993,0.00039906506,0.00022288908,0.00006277604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005559132,0.0002158179,0.00019185433,0.0002987717,0.00069801236,0.00025665355,0.000570156,0.00006039575,0.000007324746],"category_scores_gemma":[0.000054119006,0.00018585518,0.000108570726,0.0005805158,0.00007501784,0.00019702557,0.000016504313,0.00027378337,0.000010151601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001652976,0.00024263521,0.000018206943,0.000032004522,0.0001108643,0.0000018876842,0.0006150723,0.6469666,0.00019965024,0.008328447,0.000060468203,0.34325886],"study_design_scores_gemma":[0.0012480188,0.0010208329,0.0001305196,0.00017273866,0.00004036601,0.000008335162,0.000110560235,0.8029749,0.0032713276,0.18897486,0.0017486782,0.0002988984],"about_ca_topic_score_codex":0.0000057410216,"about_ca_topic_score_gemma":0.00000395884,"teacher_disagreement_score":0.8209692,"about_ca_system_score_codex":0.00007391073,"about_ca_system_score_gemma":0.00010524339,"threshold_uncertainty_score":0.7578954},"labels":[],"label_agreement":null},{"id":"W4407601626","doi":"10.1007/978-3-031-78679-2_5","title":"Short Paper: Breaking X-VRF, A Post-quantum Verifiable Random Function","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Verifiable secret sharing; Function (biology); Quantum; Algorithm; Theoretical computer science; Quantum mechanics; Physics; Programming language","score_opus":0.007691092377264427,"score_gpt":0.2207841602312895,"score_spread":0.21309306785402507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407601626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028564647,0.0008845372,0.9869524,0.0011205751,0.0050791963,0.0005605602,0.0000113636415,0.00050909555,0.0045965724],"genre_scores_gemma":[0.53009117,0.00014536886,0.45417574,0.010680646,0.0026038147,0.000046001765,0.000050046936,0.00015619978,0.002051028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942292,0.00007821595,0.00080904475,0.0024443225,0.0013022627,0.0011369791],"domain_scores_gemma":[0.9962491,0.00079999317,0.00026561026,0.002017788,0.00042913452,0.00023837796],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001258414,0.0008943463,0.0009323668,0.0013028124,0.000708559,0.0011056446,0.0039322563,0.000497194,0.000027359063],"category_scores_gemma":[0.00014918514,0.0007970476,0.0003398825,0.0011684013,0.0005655267,0.0007341582,0.0021555552,0.0015705823,0.000037030095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036072535,0.000035480316,0.000014820356,0.00007223908,0.000033753502,0.0001300411,0.00035973324,0.07864452,0.00027658054,0.02449428,0.000077566496,0.8958249],"study_design_scores_gemma":[0.0005418013,0.00027817473,0.00016848485,0.000884862,0.000025083102,0.00014272302,2.7208026e-7,0.8941673,0.00025413054,0.0960453,0.0066056303,0.0008862181],"about_ca_topic_score_codex":0.00007210882,"about_ca_topic_score_gemma":0.000045739333,"teacher_disagreement_score":0.8949387,"about_ca_system_score_codex":0.00031106023,"about_ca_system_score_gemma":0.0009563033,"threshold_uncertainty_score":0.9999313},"labels":[],"label_agreement":null},{"id":"W4407630614","doi":"10.1007/s00220-025-05240-6","title":"Lower Bound for Simulation Cost of Open Quantum Systems: Lipschitz Continuity Approach","year":2025,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Canada First Research Excellence Fund","keywords":"Lipschitz continuity; Complex system; Quantum; Mathematics; Upper and lower bounds; Lipschitz domain; Pure mathematics; Statistical physics; Applied mathematics; Physics; Mathematical analysis; Computer science; Quantum mechanics; Artificial intelligence","score_opus":0.06344890296775468,"score_gpt":0.36492223226971854,"score_spread":0.30147332930196385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407630614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024037927,0.00015270947,0.9897494,0.00033879312,0.00009962272,0.0012448761,0.00000988332,0.00005173989,0.005949184],"genre_scores_gemma":[0.77511054,0.000004879192,0.22458543,0.00004607162,0.000015597527,0.00015127129,0.0000101186015,0.0000074640525,0.00006865665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987579,0.00017489515,0.0005058065,0.00024345983,0.00013506504,0.00018287447],"domain_scores_gemma":[0.9955824,0.0017960533,0.00018350649,0.002229218,0.00017632122,0.00003247643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076699484,0.00012810726,0.0003645653,0.00007429526,0.00019256466,0.00027028794,0.0037253532,0.00006144227,4.8033326e-7],"category_scores_gemma":[0.0002597472,0.00011690327,0.000079572375,0.0006244102,0.00016341101,0.0002236942,0.0017771799,0.00021545941,0.0000030007404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004993791,0.00060477754,0.00002139313,0.00017785118,0.000016717437,5.996688e-8,0.000422311,0.067988075,0.000023959032,0.92085034,0.00008419528,0.009805328],"study_design_scores_gemma":[0.00026775003,0.000016758391,0.00006110097,0.00017576593,0.000007134214,3.2234252e-7,0.000037722737,0.66940904,0.00001878278,0.32928956,0.0006407231,0.000075352626],"about_ca_topic_score_codex":0.000013833654,"about_ca_topic_score_gemma":0.0000015369532,"teacher_disagreement_score":0.77270675,"about_ca_system_score_codex":0.0000428708,"about_ca_system_score_gemma":0.000097109674,"threshold_uncertainty_score":0.6922695},"labels":[],"label_agreement":null},{"id":"W4407681249","doi":"10.1088/1402-4896/adb7a1","title":"Digital quantum simulations of Hong-Ou-Mandel interference","year":2025,"lang":"en","type":"article","venue":"Physica Scripta","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Interference (communication); Physics; Quantum; Computer science; Quantum mechanics; Telecommunications","score_opus":0.013457452819403758,"score_gpt":0.25520650761280356,"score_spread":0.2417490547933998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407681249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15085179,0.00010016439,0.8401688,0.0018003928,0.0010116075,0.00012280578,0.000022547436,0.00020074494,0.0057211565],"genre_scores_gemma":[0.99595267,0.0000012194191,0.0029759223,0.00014614227,0.000053259766,0.0000020278267,0.0000038592166,0.000005246473,0.00085963175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908483,0.000023514423,0.00021482965,0.00031775417,0.0001547629,0.0002042954],"domain_scores_gemma":[0.9991436,0.000081308695,0.00008009791,0.00055849995,0.00009245714,0.000044007553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045966437,0.00013185355,0.000189569,0.00011499487,0.00010042621,0.00016209201,0.00086320844,0.000026763253,0.0000026023201],"category_scores_gemma":[0.000047001988,0.00011595857,0.00009429155,0.00056821987,0.000073621275,0.00030608478,0.00042882925,0.00014504313,0.000013254376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018320343,0.00072485267,0.0013679125,0.00011224894,0.00013797001,0.0000075425596,0.0015126279,0.018863713,0.006761843,0.629256,0.010846813,0.33039016],"study_design_scores_gemma":[0.00017139557,0.000055019642,0.002019771,0.000085627835,0.0000053411245,8.3700604e-7,0.000012051355,0.95284057,0.0010880418,0.0406694,0.0029332582,0.00011866124],"about_ca_topic_score_codex":0.000012162061,"about_ca_topic_score_gemma":0.0000013764009,"teacher_disagreement_score":0.9339769,"about_ca_system_score_codex":0.000011982099,"about_ca_system_score_gemma":0.00006295416,"threshold_uncertainty_score":0.47286534},"labels":[],"label_agreement":null},{"id":"W4407722549","doi":"10.1016/j.laa.2025.02.021","title":"State transfer and readout times for trees of diameter 4","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; State (computer science); Transfer (computing); Combinatorics; Geometry; Pure mathematics; Algorithm; Computer science; Parallel computing","score_opus":0.007541436979440628,"score_gpt":0.24627485333106103,"score_spread":0.2387334163516204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407722549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06260666,0.0007265764,0.93467116,0.001391041,0.00002231496,0.00032567928,0.000022695443,0.0000459213,0.00018794318],"genre_scores_gemma":[0.9217389,0.00014371393,0.07675496,0.00031931367,0.00004611708,0.000111613444,0.0000071635973,0.000007743947,0.00087043265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995028,0.000010260935,0.00013488845,0.00021079696,0.00004270706,0.00009858149],"domain_scores_gemma":[0.999584,0.00015719111,0.000018137202,0.00016799007,0.0000383004,0.00003435543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007037609,0.00007096416,0.000111840745,0.0000620278,0.00009521356,0.000031988056,0.00015519348,0.000025557309,0.000001169093],"category_scores_gemma":[0.0000065531112,0.000058071746,0.000028786159,0.00016534528,0.000035632536,0.000048614464,0.000053985314,0.000046209374,8.5277145e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000830085,0.000079388505,0.00014040609,0.00011694271,0.00005068197,1.7452513e-7,0.00093518704,0.00015245473,0.003936665,0.42665905,0.0002764783,0.56764424],"study_design_scores_gemma":[0.0005939301,0.00012649919,0.0024564113,0.000050128783,0.000030124276,0.0000035305768,0.000018322437,0.8664367,0.015801515,0.07383332,0.040450685,0.0001987861],"about_ca_topic_score_codex":0.0000036680497,"about_ca_topic_score_gemma":0.0000026805794,"teacher_disagreement_score":0.8662843,"about_ca_system_score_codex":0.0000015833406,"about_ca_system_score_gemma":0.000018963205,"threshold_uncertainty_score":0.2368097},"labels":[],"label_agreement":null},{"id":"W4407783076","doi":"10.3390/quantum7010010","title":"Cost-Efficient Pipelined Modular Polynomial Multiplier for Post-Quantum Cryptography Saber","year":2025,"lang":"en","type":"article","venue":"Quantum Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Modular design; Multiplier (economics); Cryptography; Computer science; Polynomial; Arithmetic; Modular arithmetic; Mathematics; Parallel computing; Algorithm; Programming language; Economics","score_opus":0.012575163247347095,"score_gpt":0.26975409443617976,"score_spread":0.25717893118883267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407783076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26292074,0.0003406261,0.7285899,0.001959868,0.004060964,0.0012471429,0.000017401446,0.000547394,0.0003160021],"genre_scores_gemma":[0.9380338,0.0000068123964,0.059959974,0.0011910183,0.00032501726,0.00018225679,0.000036143527,0.00004322252,0.00022174713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597883,0.00010286649,0.0010352876,0.0014114102,0.0005189588,0.00095267245],"domain_scores_gemma":[0.9968181,0.00033998382,0.0004314903,0.0016616908,0.00050404464,0.00024469075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010114555,0.0004884979,0.00057288475,0.0005745168,0.0005776151,0.00036944778,0.000850612,0.00021603685,0.0000117478485],"category_scores_gemma":[0.00039542964,0.00043239357,0.0005479743,0.0010375706,0.00013572528,0.00016382916,0.00049732183,0.0003718989,0.00001241495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059462764,0.003749322,0.00391733,0.0007486219,0.0010118026,0.002733668,0.0044248924,0.23241253,0.04379966,0.19026841,0.090411365,0.42592776],"study_design_scores_gemma":[0.0007398741,0.00017029878,0.0026615036,0.000103645885,0.00003454039,0.00016876751,0.000031991796,0.94389665,0.0019299021,0.007609948,0.042140353,0.0005125259],"about_ca_topic_score_codex":0.000093129696,"about_ca_topic_score_gemma":0.0000055737705,"teacher_disagreement_score":0.71148413,"about_ca_system_score_codex":0.00007095962,"about_ca_system_score_gemma":0.00033439146,"threshold_uncertainty_score":0.9998128},"labels":[],"label_agreement":null},{"id":"W4407824639","doi":"10.1007/s42484-025-00256-6","title":"Stochastic security as a performance metric for quantum-enhanced generative AI","year":2025,"lang":"en","type":"article","venue":"Quantum Machine Intelligence","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Spinal Cord Injury BC; University of Waterloo; Perimeter Institute","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; U.S. Department of Homeland Security; Critical Infrastructure Resilience Institute, University of Illinois; National Science Foundation","keywords":"Metric (unit); Generative grammar; Computer science; Quantum; Theoretical computer science; Artificial intelligence; Mathematics; Economics; Physics; Quantum mechanics","score_opus":0.010048649006847788,"score_gpt":0.289314411169032,"score_spread":0.27926576216218424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407824639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07286706,0.0011764524,0.92079365,0.002153599,0.0015433065,0.0007235285,0.00001932895,0.0004093901,0.00031366604],"genre_scores_gemma":[0.98044676,0.0000640428,0.017106816,0.001804424,0.00015895627,0.00012526814,0.000011440287,0.000025940704,0.00025637198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674505,0.00014696109,0.0007057948,0.0011347173,0.0004568066,0.00081065245],"domain_scores_gemma":[0.9973514,0.0008575987,0.0002311408,0.0009858705,0.0003930019,0.00018100471],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007314065,0.00050722924,0.0005468565,0.00064501085,0.00063771603,0.00033136725,0.0020581235,0.00014567844,0.000022163214],"category_scores_gemma":[0.0006080033,0.00044108529,0.0002496411,0.002269679,0.0001536613,0.0003825909,0.00055437844,0.0006623817,0.00008946027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012558444,0.00032117736,0.000048861457,0.00023602613,0.00013168874,0.000012080709,0.0022925786,0.16494665,0.0007516985,0.5833561,0.0008288447,0.2469487],"study_design_scores_gemma":[0.00021978506,0.0005070611,0.00006838153,0.00012331073,0.000017435239,0.000021887368,0.000032953987,0.83574194,0.014674141,0.14751847,0.000658142,0.00041646344],"about_ca_topic_score_codex":0.00011295971,"about_ca_topic_score_gemma":0.000014476434,"teacher_disagreement_score":0.90757966,"about_ca_system_score_codex":0.000105990504,"about_ca_system_score_gemma":0.0003419754,"threshold_uncertainty_score":0.9998041},"labels":[],"label_agreement":null},{"id":"W4407901096","doi":"10.1109/tit.2025.3544970","title":"Bounding the Graph Capacity With Quantum Mechanics and Finite Automata","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Quantum finite automata; Automaton; Deterministic finite automaton; Computer science; Nondeterministic finite automaton; Theoretical computer science; Discrete mathematics; Mathematics; Automata theory; Artificial intelligence","score_opus":0.00695810918766361,"score_gpt":0.2052179497389063,"score_spread":0.1982598405512427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407901096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076258793,0.00001202277,0.9900021,0.00091630645,0.0005556213,0.00016296512,0.000008343399,0.0002615688,0.00045516744],"genre_scores_gemma":[0.9919234,0.000015947206,0.0068791416,0.00111002,0.000008603486,0.000020081829,8.535157e-7,0.000003695502,0.000038239334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992151,0.000099141485,0.00020400192,0.00012894363,0.0001810446,0.00017175394],"domain_scores_gemma":[0.99902904,0.00039977024,0.000081155275,0.00039502204,0.000055917648,0.000039105085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056628365,0.00013012649,0.00009883225,0.00024970085,0.0007454942,0.00030417772,0.00037765995,0.000048814767,0.0000040795007],"category_scores_gemma":[0.000009869999,0.00008331203,0.000044238237,0.0005434844,0.00006162576,0.00070726254,0.000005901085,0.0002953048,0.000012884564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003158471,0.000027279008,9.473464e-7,0.000035698227,0.00004811032,5.436808e-7,0.0033778946,0.10098053,0.000012164696,0.76102865,0.00005066392,0.13440594],"study_design_scores_gemma":[0.0003121584,0.0000804024,0.000045319935,0.00006785199,0.000014012938,0.000017909306,0.00017978251,0.88372856,0.00059675437,0.1138603,0.0009817489,0.00011521479],"about_ca_topic_score_codex":0.0000099911485,"about_ca_topic_score_gemma":0.000003863879,"teacher_disagreement_score":0.9842975,"about_ca_system_score_codex":0.00002153468,"about_ca_system_score_gemma":0.00005361324,"threshold_uncertainty_score":0.57338136},"labels":[],"label_agreement":null},{"id":"W4407950140","doi":"10.1109/cdc56724.2024.10886823","title":"Quantum Markov Decision Processes","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"","keywords":"Computer science; Markov process; Markov decision process; Mathematics; Statistics","score_opus":0.008669609283071051,"score_gpt":0.2500574502362754,"score_spread":0.24138784095320434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407950140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01782035,0.0013763375,0.97408134,0.001613161,0.0009610679,0.00005435724,6.935928e-7,0.0010375157,0.0030551702],"genre_scores_gemma":[0.7548611,0.000037464488,0.24375823,0.00033388156,0.00020532873,0.0000043022987,7.427984e-7,0.000012146282,0.00078675855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903286,0.000014864124,0.00013267921,0.00038408666,0.00022508702,0.00021042302],"domain_scores_gemma":[0.999278,0.00030364457,0.000011749104,0.0002972971,0.000043086693,0.00006621695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017872114,0.00010631358,0.000084675194,0.000114434486,0.000088758265,0.0005159775,0.00060139643,0.000033284028,0.00003284364],"category_scores_gemma":[0.000056540444,0.00007158479,0.000044474655,0.0007445588,0.000017292026,0.00022588747,0.00024227264,0.00012838049,0.00020866691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014432217,0.000019493873,0.00001655826,0.000081437654,0.0000082961615,0.00008212911,0.00030481623,0.00044515062,0.00007773102,0.08165421,0.009860806,0.90744793],"study_design_scores_gemma":[0.00003892976,0.000043753153,0.00012316239,0.00011201227,0.000001452399,0.00007316798,0.0000046417967,0.9129773,0.0003667509,0.04098696,0.045148358,0.00012350788],"about_ca_topic_score_codex":0.000007974693,"about_ca_topic_score_gemma":0.000003005534,"teacher_disagreement_score":0.91253215,"about_ca_system_score_codex":0.000010092797,"about_ca_system_score_gemma":0.00011506365,"threshold_uncertainty_score":0.49755833},"labels":[],"label_agreement":null},{"id":"W4407957950","doi":"10.22331/q-2025-02-26-1647","title":"Synthesis and Arithmetic of Single Qutrit Circuits","year":2025,"lang":"lv","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Arithmetic; Qutrit; Mathematics; Computer science; Physics","score_opus":0.015075146689290789,"score_gpt":0.23684543329011845,"score_spread":0.22177028660082765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407957950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8124562,0.010033016,0.16747078,0.0043723374,0.0023180372,0.000375455,0.000037614544,0.000191394,0.0027451417],"genre_scores_gemma":[0.99526536,0.00010948327,0.0039161607,0.00020644402,0.00010469561,0.0000066057455,8.0356784e-7,0.000017752405,0.00037269352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975283,0.00022486567,0.0006001268,0.000758324,0.0003466695,0.00054167846],"domain_scores_gemma":[0.99763066,0.0010512804,0.00024022546,0.0007898753,0.00014943421,0.00013854742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054122246,0.00033609723,0.00062096014,0.00041229653,0.00024238958,0.000235123,0.0008652949,0.00018486069,0.000014833191],"category_scores_gemma":[0.00038420755,0.00032504316,0.00016116964,0.0010692971,0.0003090882,0.00012288996,0.00058786623,0.00032714944,0.000016845655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019137398,0.000910411,0.0019663088,0.0014023379,0.00026424814,0.000084195686,0.0019342568,0.00049476273,0.014592607,0.2098863,0.0011187512,0.7673267],"study_design_scores_gemma":[0.0006490656,0.00049891195,0.013808389,0.0023877523,0.0001654903,0.000067195084,0.0001394145,0.916688,0.01755825,0.042953543,0.004443251,0.0006406922],"about_ca_topic_score_codex":0.0001135882,"about_ca_topic_score_gemma":0.000006235681,"teacher_disagreement_score":0.9161933,"about_ca_system_score_codex":0.00002896104,"about_ca_system_score_gemma":0.00016735164,"threshold_uncertainty_score":0.9999202},"labels":[],"label_agreement":null},{"id":"W4407974542","doi":"10.3390/robotics14030025","title":"The Concept of Quantum Teleportation for Remote Control of a Car-like Mobile Robot","year":2025,"lang":"en","type":"article","venue":"Robotics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Mobile robot; Quantum teleportation; Teleportation; Computer science; Control (management); Quantum; Human–computer interaction; Control engineering; Robot; Engineering; Physics; Quantum channel; Artificial intelligence; Quantum mechanics; Quantum information","score_opus":0.007117770545123872,"score_gpt":0.25377815553007005,"score_spread":0.2466603849849462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407974542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00457907,0.00054567255,0.9931263,0.00061073265,0.0006885737,0.0003729624,0.00000648307,0.000037065645,0.000033151642],"genre_scores_gemma":[0.8899231,0.000009252782,0.10979911,0.00009246242,0.000035036504,0.0000054500574,0.0000020312577,0.000005720547,0.00012786128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990443,0.000048845402,0.00037731597,0.00018422434,0.00015816727,0.00018716618],"domain_scores_gemma":[0.99839395,0.000678301,0.00024685342,0.00042425134,0.00023027709,0.000026335249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028423377,0.000096713324,0.00022192765,0.00004975882,0.00013263995,0.000031622996,0.00050861255,0.000048636983,2.6261077e-7],"category_scores_gemma":[0.00009837036,0.000069396396,0.000110251516,0.0002659034,0.00009220415,0.00003539076,0.000067627385,0.000089391026,2.9883117e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009917584,0.000026371097,0.0000456688,0.00003320201,0.00003971001,7.934948e-7,0.00034481785,0.8434124,0.0005073053,0.085930064,0.00022207588,0.06942767],"study_design_scores_gemma":[0.00044629004,0.0001631702,0.00031162472,0.00005064836,0.00001952069,0.0000019318989,0.000042980155,0.98709595,0.0022878537,0.008555438,0.00095761404,0.000066969995],"about_ca_topic_score_codex":0.00003809776,"about_ca_topic_score_gemma":0.0000068549616,"teacher_disagreement_score":0.885344,"about_ca_system_score_codex":0.000012394375,"about_ca_system_score_gemma":0.00012641252,"threshold_uncertainty_score":0.28299028},"labels":[],"label_agreement":null},{"id":"W4408016884","doi":"10.1109/iotm.001.2400149","title":"Quantum Machine Learning for Multi-Robot-Assisted Tactical Augmented Reality","year":2025,"lang":"en","type":"article","venue":"IEEE Internet of Things Magazine","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec","funders":"","keywords":"Augmented reality; Computer science; Robot; Human–computer interaction; Quantum machine learning; Quantum; Artificial intelligence; Physics; Quantum computer; Quantum mechanics","score_opus":0.031546444328096945,"score_gpt":0.305289798237203,"score_spread":0.27374335390910604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408016884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02482599,0.000124386,0.97014016,0.0026136946,0.0012479256,0.0002707334,0.0000046501923,0.00033241083,0.00044004899],"genre_scores_gemma":[0.8178279,0.0000055712626,0.17802194,0.0004963352,0.00005534942,0.000015179816,0.000013321174,0.000018278397,0.00354613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980245,0.0001387633,0.00059143617,0.0005856365,0.0002601685,0.00039950036],"domain_scores_gemma":[0.998522,0.00037678203,0.00031125016,0.00048267597,0.00021343543,0.00009385707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006912296,0.00026324598,0.0004413231,0.0002333783,0.00010723187,0.0001354633,0.001119409,0.00011587006,0.000008875564],"category_scores_gemma":[0.00043292312,0.00022973292,0.00022613826,0.00040427636,0.00009426247,0.00022403542,0.00039925188,0.0005010006,0.000013245856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091601553,0.0037518942,0.0037158194,0.0020163457,0.0013501622,0.00014897501,0.005939855,0.021917159,0.11550398,0.11394659,0.032351717,0.6984415],"study_design_scores_gemma":[0.0011123834,0.00025897383,0.0037665088,0.0002536102,0.000025522046,0.000020813304,0.0000053538197,0.97775495,0.0073791137,0.0014786633,0.0077371066,0.00020699894],"about_ca_topic_score_codex":0.00026404232,"about_ca_topic_score_gemma":0.000016955779,"teacher_disagreement_score":0.9558378,"about_ca_system_score_codex":0.0000610792,"about_ca_system_score_gemma":0.000065262044,"threshold_uncertainty_score":0.93682367},"labels":[],"label_agreement":null},{"id":"W4408054303","doi":"10.1103/prxquantum.6.010337","title":"Classical Simulability of Quantum Circuits with Shallow Magic Depth","year":2025,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; National Science Foundation","keywords":"MAGIC (telescope); Electronic circuit; Quantum; Physics; Geology; Theoretical physics; Quantum mechanics","score_opus":0.01189977646854925,"score_gpt":0.25088172305379924,"score_spread":0.23898194658525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408054303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39734885,0.00025633868,0.5973402,0.0022448653,0.0004745623,0.0002633328,0.0000047564045,0.0002846868,0.0017823664],"genre_scores_gemma":[0.9914123,0.0000062027348,0.008027446,0.00030482124,0.000057921534,0.000007995965,0.000002737185,0.00001549935,0.00016508372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975076,0.00018538091,0.0004872935,0.00079467066,0.000479785,0.00054527464],"domain_scores_gemma":[0.99789023,0.00047148607,0.00017817742,0.0011180817,0.00020053347,0.00014146259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005014966,0.00030328674,0.0004826421,0.00021306712,0.00015550513,0.000114238595,0.0013462165,0.00011674286,0.000010028284],"category_scores_gemma":[0.00015204358,0.00023144583,0.00015188706,0.0010823875,0.00024136477,0.00018626734,0.00043115442,0.00043275848,0.000021178314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007717623,0.0010224254,0.024950238,0.0005127998,0.00018502616,0.00010085852,0.0011544256,0.01769036,0.0013535634,0.8098818,0.0010025009,0.14206882],"study_design_scores_gemma":[0.000644084,0.00031771592,0.034812704,0.00016358793,0.000019007675,0.000017387621,0.000023004288,0.9198955,0.00068366114,0.04117846,0.0019638874,0.00028095045],"about_ca_topic_score_codex":0.00004728161,"about_ca_topic_score_gemma":0.000026281059,"teacher_disagreement_score":0.90220517,"about_ca_system_score_codex":0.000049224687,"about_ca_system_score_gemma":0.00031554673,"threshold_uncertainty_score":0.9438087},"labels":[],"label_agreement":null},{"id":"W4408081570","doi":"10.1007/s10515-025-00493-w","title":"Quantum software engineering and potential of quantum computing in software engineering research: a review","year":2025,"lang":"en","type":"review","venue":"Automated Software Engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Software engineering; Social software engineering; Software requirements; Software; Quantum computer; Software development; Quantum; Computational science; Software construction; Programming language; Physics; Quantum mechanics","score_opus":0.02519809214927829,"score_gpt":0.29818134138585317,"score_spread":0.2729832492365749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408081570","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015218412,0.6435645,0.35029054,0.00001978881,0.0011449787,0.0010096601,0.000045736964,0.0037720837,5.4877927e-7],"genre_scores_gemma":[0.00029965586,0.8070913,0.19190456,0.000032379452,0.00021837169,0.0001154024,0.00008782105,0.00023940667,0.000011121242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922917,0.00034349115,0.0023955193,0.0018657842,0.0011666797,0.0019368441],"domain_scores_gemma":[0.9925708,0.0044648983,0.00057276787,0.0016364655,0.000354748,0.00040032185],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0025574397,0.0015307588,0.003948255,0.002788061,0.00023293775,0.0003140112,0.0026134478,0.0007993625,0.0000044561225],"category_scores_gemma":[0.008494581,0.0015529505,0.0007281558,0.0050353445,0.000080629245,0.0003910363,0.0024561468,0.0030439626,0.000011864619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033885779,0.00013449808,0.000033754088,0.34080547,0.00044836482,0.000750428,0.00035527823,0.2526781,0.000009112592,0.0012937095,0.00067106396,0.40281686],"study_design_scores_gemma":[0.0002814608,0.00008061847,0.00008771358,0.21065675,0.00015270548,0.00024622417,0.0000034711122,0.7533882,0.000004010905,0.000013096411,0.033939607,0.0011460843],"about_ca_topic_score_codex":0.00006101895,"about_ca_topic_score_gemma":0.0000010582625,"teacher_disagreement_score":0.5007102,"about_ca_system_score_codex":0.00035815776,"about_ca_system_score_gemma":0.0006798158,"threshold_uncertainty_score":0.9998573},"labels":[],"label_agreement":null},{"id":"W4408100138","doi":"10.1109/access.2025.3546956","title":"NR-QNN: Noise-Resilient Quantum Neural Network","year":2025,"lang":"en","type":"article","venue":"IEEE Access","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CMC Microsystems (Canada); Lakehead University","funders":"Mitacs","keywords":"Computer science; Artificial neural network; Noise (video); Artificial intelligence","score_opus":0.014497054075467886,"score_gpt":0.2851993022394757,"score_spread":0.27070224816400784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408100138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43855688,0.000541893,0.54774225,0.0036144427,0.006890557,0.00021718818,0.0000023473622,0.00050471356,0.0019297347],"genre_scores_gemma":[0.9921328,0.000009495901,0.0044715824,0.0024141152,0.0005998073,0.0000129719665,0.0000015164569,0.000011526605,0.00034618462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819845,0.00009681572,0.0002944347,0.0005728962,0.00027596875,0.0005614583],"domain_scores_gemma":[0.99874234,0.00017671702,0.000094627685,0.0008075784,0.000073582625,0.000105147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024304094,0.00021699046,0.00023705853,0.00013154186,0.00033972214,0.00062188605,0.0026005975,0.00007339931,0.000008044364],"category_scores_gemma":[0.000024700454,0.0001848537,0.00011630098,0.0010763545,0.00005604239,0.00034898374,0.00069691805,0.0003083902,0.000029467128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002341113,0.00015105188,0.0058628432,0.000072781644,0.000066639535,0.00008113542,0.00029518016,0.642542,0.0003239064,0.05358093,0.09282678,0.20417333],"study_design_scores_gemma":[0.00024500268,0.000040220533,0.011157759,0.000066969034,0.000007177484,0.000010094072,0.0000023543528,0.96037245,0.0006833644,0.018836034,0.008351298,0.00022728687],"about_ca_topic_score_codex":0.00009895319,"about_ca_topic_score_gemma":0.00001588771,"teacher_disagreement_score":0.55357593,"about_ca_system_score_codex":0.000027935648,"about_ca_system_score_gemma":0.00008939914,"threshold_uncertainty_score":0.75381154},"labels":[],"label_agreement":null},{"id":"W4408211186","doi":"10.1038/s41534-025-00977-3","title":"Quantum error mitigation in quantum annealing","year":2025,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; D-Wave Systems (Canada)","funders":"Office of Science; Canada First Research Excellence Fund; Natural Sciences and Engineering Research Council of Canada; European Commission; Canadian Institute for Advanced Research; U.S. Department of Energy","keywords":"Extrapolation; Quantum annealing; Hamiltonian (control theory); Ising model; Quantum computer; Quantum; Statistical physics; Computer science; Physics; Quantum mechanics; Mathematics; Mathematical optimization; Statistics","score_opus":0.008178440066634542,"score_gpt":0.24859355130579444,"score_spread":0.2404151112391599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408211186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53530025,0.00013532607,0.45824587,0.0030187068,0.0014075326,0.0003245639,0.000005388644,0.00041104192,0.0011513376],"genre_scores_gemma":[0.9926664,0.000030323023,0.0058517805,0.0012534295,0.00007153135,0.00003171755,0.00005243753,0.000009218506,0.000033161097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975834,0.00013231493,0.0009335414,0.00034569568,0.00044595337,0.00055907585],"domain_scores_gemma":[0.9986119,0.00018178536,0.00030470686,0.00062304485,0.0001846006,0.000093943774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086650735,0.0002882747,0.00030922738,0.00091173715,0.00030394635,0.0004394882,0.0008961001,0.00018350796,0.0000069082926],"category_scores_gemma":[0.00020356831,0.00027943496,0.000114792034,0.0016188574,0.000057304787,0.0024560196,0.00026346106,0.00045354315,0.000126548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050874314,0.00009894694,0.0024917475,0.00027273732,0.00002919248,0.000015900518,0.005300065,0.07018137,0.0003578514,0.76786,0.0025965269,0.1507448],"study_design_scores_gemma":[0.000624072,0.00007039602,0.015192594,0.00022030262,0.0000049093355,0.00001619978,0.00026159224,0.945481,0.00032433658,0.030266417,0.007249303,0.0002888717],"about_ca_topic_score_codex":0.00016943789,"about_ca_topic_score_gemma":0.000028690522,"teacher_disagreement_score":0.87529963,"about_ca_system_score_codex":0.00013923501,"about_ca_system_score_gemma":0.00022430619,"threshold_uncertainty_score":0.9999658},"labels":[],"label_agreement":null},{"id":"W4408275769","doi":"10.3390/a18030156","title":"Quantum Computing and Machine Learning in Medical Decision-Making: A Comprehensive Review","year":2025,"lang":"en","type":"review","venue":"Algorithms","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Princess Margaret Cancer Centre; University of Toronto; University Health Network","funders":"","keywords":"Computer science; Quantum computer; Quantum machine learning; Artificial intelligence; Machine learning; Quantum; Data science; Physics; Quantum mechanics","score_opus":0.02532823859094355,"score_gpt":0.34200575095454755,"score_spread":0.316677512363604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408275769","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.730591e-7,0.8433521,0.1545619,0.00031349098,0.0007202994,0.00068206224,0.000007899081,0.00027542617,0.000085847074],"genre_scores_gemma":[0.0000036185806,0.94652694,0.052260205,0.0009007229,0.00018915987,0.000023543576,0.000024525965,0.000043151635,0.000028103459],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943625,0.00086655293,0.0015188371,0.001511849,0.00096066226,0.0007796168],"domain_scores_gemma":[0.99278724,0.0053831525,0.0005777664,0.00086765684,0.000121051395,0.00026310532],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0014005277,0.0008547185,0.003294506,0.00071505347,0.00030415587,0.0002253583,0.0022010792,0.00046778523,0.000019525365],"category_scores_gemma":[0.0011733182,0.0006803581,0.00047767206,0.0021649033,0.00012455453,0.00012193832,0.0028543202,0.0025752652,0.000028146886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.6274134e-7,0.000037231268,0.0000021881237,0.024737177,0.000048467744,0.0006394408,0.00005865217,0.000039386163,2.9132414e-9,0.0004612791,0.00023414417,0.97374135],"study_design_scores_gemma":[0.00015205635,0.000044562028,0.000004194621,0.20953137,0.00006303381,0.00077209267,0.0000017424085,0.31450668,7.0811907e-9,0.00041787073,0.47409308,0.00041330562],"about_ca_topic_score_codex":0.000038019436,"about_ca_topic_score_gemma":0.00000560129,"teacher_disagreement_score":0.97332805,"about_ca_system_score_codex":0.000093025905,"about_ca_system_score_gemma":0.00077003683,"threshold_uncertainty_score":0.9997258},"labels":[],"label_agreement":null},{"id":"W4408632924","doi":"10.5267/j.ijdns.2024.12.003","title":"A comprehensive review of post-quantum cryptography: Challenges and advances","year":2025,"lang":"en","type":"review","venue":"International Journal of Data and Network Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quantum cryptography; Computer science; Cryptography; Computer security; Quantum; Quantum information; Physics; Quantum mechanics","score_opus":0.04312138522161328,"score_gpt":0.36264043488858155,"score_spread":0.31951904966696826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408632924","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036302645,0.98987544,0.008004857,0.0006659033,0.0012078775,0.00012111138,0.000054125318,0.000007856739,0.000059173264],"genre_scores_gemma":[0.0000069131715,0.96998155,0.029447587,0.0002595877,0.0002889266,9.373954e-7,0.0000091798165,0.000004073971,0.000001248091],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766517,0.00012526406,0.0007651727,0.00047952103,0.00075864204,0.00020623072],"domain_scores_gemma":[0.99673516,0.0006904504,0.0011084238,0.0005315663,0.00082479266,0.00010963732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001283896,0.0002208023,0.0009709383,0.00042213293,0.000095249015,0.00012984998,0.00492586,0.000048112728,0.000001347744],"category_scores_gemma":[0.00020120853,0.0001509467,0.00013720997,0.0006032409,0.00041307745,0.0009202451,0.0024669722,0.0003297642,2.7900066e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001981631,0.000014784572,7.4829126e-7,0.010616359,0.000066277746,0.000019925597,0.000031965523,0.0000058305445,1.9892391e-7,0.0040674782,0.00019001518,0.98498446],"study_design_scores_gemma":[0.00008904758,0.00011236552,0.000025373849,0.14640893,0.00008319616,0.0006478052,0.0000073285423,0.0024639713,1.720898e-7,0.0020082623,0.84800553,0.00014803126],"about_ca_topic_score_codex":0.0000014530469,"about_ca_topic_score_gemma":5.174267e-7,"teacher_disagreement_score":0.9848364,"about_ca_system_score_codex":0.000012872753,"about_ca_system_score_gemma":0.0005449336,"threshold_uncertainty_score":0.91535556},"labels":[],"label_agreement":null},{"id":"W4408686664","doi":"10.1039/d4dd00321g","title":"Efficient strategies for reducing sampling error in quantum Krylov subspace diagonalization","year":2025,"lang":"en","type":"article","venue":"Digital Discovery","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Institute for Information and Communications Technology Promotion; Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; Ministry of Education, Science and Technology; Ministry of Trade, Industry and Energy; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Krylov subspace; Subspace topology; Quantum; Computer science; Sampling (signal processing); Mathematics; Algorithm; Applied mathematics; Mathematical optimization; Physics; Artificial intelligence; Quantum mechanics; Iterative method; Telecommunications","score_opus":0.016818536553868106,"score_gpt":0.27953111759847676,"score_spread":0.26271258104460865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408686664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43874305,0.00011098259,0.5598202,0.0002828467,0.0003807975,0.00014252536,0.000012916567,0.00006868755,0.0004380168],"genre_scores_gemma":[0.9955178,0.0000015720972,0.0041269073,0.000092671005,0.000049065256,0.000018926776,0.000020943564,0.000009537548,0.0001625814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878997,0.00001785388,0.0002545924,0.0004513714,0.00015680441,0.00032941843],"domain_scores_gemma":[0.999328,0.00022864692,0.00006936941,0.0002956636,0.00004383235,0.000034490793],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00014277048,0.00015962447,0.00017532422,0.00020422919,0.00012150228,0.0013958574,0.00041304866,0.00004739122,2.6763684e-7],"category_scores_gemma":[0.00010848771,0.00014536025,0.00009347771,0.000580231,0.00003782195,0.0006236901,0.00020504853,0.00010688825,0.0000021966512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013791684,0.0001293838,0.00063890964,0.00007220846,0.000011532046,0.0000039375022,0.00069684157,0.72504985,0.00024858766,0.25811312,0.00011530701,0.014906539],"study_design_scores_gemma":[0.0002722,0.000043714725,0.0061139427,0.00021797842,0.000002509696,0.0000021915932,0.00022957959,0.96418583,0.000105527964,0.028321458,0.00032357484,0.00018146719],"about_ca_topic_score_codex":0.000023532106,"about_ca_topic_score_gemma":0.00000884139,"teacher_disagreement_score":0.55677474,"about_ca_system_score_codex":0.000053040098,"about_ca_system_score_gemma":0.0002031408,"threshold_uncertainty_score":0.99964076},"labels":[],"label_agreement":null},{"id":"W4408690901","doi":"10.1103/prxquantum.6.010356","title":"Quantum Advantage from Measurement-Induced Entanglement in Random Shallow Circuits","year":2025,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; National Science Foundation","keywords":"Quantum entanglement; Electronic circuit; Quantum metrology; Quantum sensor; Physics; Quantum; Computer science; Quantum mechanics; Statistical physics; Quantum network","score_opus":0.0210439713124143,"score_gpt":0.2560363838911339,"score_spread":0.2349924125787196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408690901","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6280748,0.001538609,0.36071777,0.0034387964,0.0031260925,0.00083433813,0.000016619666,0.0005236207,0.0017293],"genre_scores_gemma":[0.9963732,0.00003671241,0.0025603962,0.00077284384,0.00012609329,0.000054891316,0.0000101636215,0.000022013464,0.000043686126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625206,0.00032687967,0.00072894926,0.0010312162,0.00086777075,0.0007931307],"domain_scores_gemma":[0.99824935,0.0002827959,0.00017936814,0.0010041143,0.00013040609,0.000153991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012560941,0.00040803946,0.0005526247,0.00043186353,0.0002184965,0.00026092835,0.0016125176,0.00012981554,0.00003018881],"category_scores_gemma":[0.00019755079,0.00037805157,0.00018871127,0.0009538172,0.000038733917,0.00028501102,0.000564694,0.00051505736,0.000063416606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032113088,0.002392746,0.022160666,0.00033112135,0.00061670324,0.00086728367,0.007136454,0.0030164956,0.09765473,0.32407355,0.00343868,0.53799045],"study_design_scores_gemma":[0.0069072484,0.00025502744,0.021702828,0.000725355,0.00003590698,0.000009141847,0.000221933,0.8951231,0.0057009393,0.0613063,0.007150014,0.0008621938],"about_ca_topic_score_codex":0.00042196177,"about_ca_topic_score_gemma":0.00028205366,"teacher_disagreement_score":0.8921066,"about_ca_system_score_codex":0.00023388579,"about_ca_system_score_gemma":0.0003308772,"threshold_uncertainty_score":0.99986714},"labels":[],"label_agreement":null},{"id":"W4408780269","doi":"10.1007/978-3-031-86599-2","title":"Post-Quantum Cryptography","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; National Institute of Standards and Technology; Indian Statistical Institute; University of Illinois at Chicago; Masarykova Univerzita; National Cheng Kung University; Universität Regensburg; University of Waterloo; Lunds Universitet; Universidad Nacional de Colombia; Technische Universiteit Eindhoven; KU Leuven; Université de Limoges; Universidad del Atlántico; Florida Atlantic University; Sapienza Università di Roma; Amazon Web Services; Indian Institute of Science; Université de Rouen; Kungliga Tekniska Högskolan; Radboud Universiteit; Virginia Polytechnic Institute and State University; Cisco Systems","keywords":"Computer science; Quantum cryptography; Cryptography; Neural cryptography; Theoretical computer science; Quantum; Computer security; Encryption; Public-key cryptography; Quantum information; Quantum mechanics; Physics","score_opus":0.006561304879401995,"score_gpt":0.23120128278223695,"score_spread":0.22463997790283496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408780269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015015203,0.0009911215,0.98799145,0.00203207,0.0047084885,0.00044611574,0.000015499018,0.0005374399,0.00312764],"genre_scores_gemma":[0.015110427,0.00006247046,0.97368485,0.008135127,0.001520813,0.00002399342,0.000026705464,0.00006642947,0.0013692031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994036,0.00011654178,0.0007217109,0.0025007895,0.0013273825,0.0012975658],"domain_scores_gemma":[0.99557394,0.000939306,0.0003294904,0.0024257097,0.00046274977,0.00026880435],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010863,0.000850245,0.0008353598,0.0025146536,0.00053247646,0.0010963691,0.007407819,0.0004830287,0.000010222192],"category_scores_gemma":[0.0001887579,0.00075518014,0.0003671444,0.0033482225,0.00084032514,0.0004516904,0.003206523,0.0017951732,0.000039930306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005246986,0.00007245394,0.000030390052,0.00011739153,0.000024620465,0.0001709689,0.0007041206,0.054797012,0.00008949309,0.021177266,0.00058208394,0.92222893],"study_design_scores_gemma":[0.00024301636,0.0002084273,0.00015141958,0.00063511735,0.000008532744,0.00006662486,1.0019968e-7,0.7596823,0.00030694992,0.23290421,0.005024058,0.00076924864],"about_ca_topic_score_codex":0.000032992175,"about_ca_topic_score_gemma":0.00002545679,"teacher_disagreement_score":0.9214597,"about_ca_system_score_codex":0.00031682083,"about_ca_system_score_gemma":0.0029512066,"threshold_uncertainty_score":0.9999406},"labels":[],"label_agreement":null},{"id":"W4408788451","doi":"10.1007/978-3-031-86602-9","title":"Post-Quantum Cryptography","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; National Institute of Standards and Technology; Indian Statistical Institute; University of Illinois at Chicago; Masarykova Univerzita; National Cheng Kung University; Universität Regensburg; University of Waterloo; Lunds Universitet; Universidad Nacional de Colombia; Technische Universiteit Eindhoven; KU Leuven; Université de Limoges; Universidad del Atlántico; Florida Atlantic University; Sapienza Università di Roma; Amazon Web Services; Indian Institute of Science; Université de Rouen; Kungliga Tekniska Högskolan; Radboud Universiteit; Virginia Polytechnic Institute and State University; Cisco Systems","keywords":"Computer science; Quantum cryptography; Cryptography; Neural cryptography; Computer security; Theoretical computer science; Quantum; Public-key cryptography; Encryption; Quantum information; Quantum mechanics; Physics","score_opus":0.006561304879401995,"score_gpt":0.23120128278223695,"score_spread":0.22463997790283496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408788451","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015015203,0.0009911215,0.98799145,0.00203207,0.0047084885,0.00044611574,0.000015499018,0.0005374399,0.00312764],"genre_scores_gemma":[0.015110427,0.00006247046,0.97368485,0.008135127,0.001520813,0.00002399342,0.000026705464,0.00006642947,0.0013692031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994036,0.00011654178,0.0007217109,0.0025007895,0.0013273825,0.0012975658],"domain_scores_gemma":[0.99557394,0.000939306,0.0003294904,0.0024257097,0.00046274977,0.00026880435],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010863,0.000850245,0.0008353598,0.0025146536,0.00053247646,0.0010963691,0.007407819,0.0004830287,0.000010222192],"category_scores_gemma":[0.0001887579,0.00075518014,0.0003671444,0.0033482225,0.00084032514,0.0004516904,0.003206523,0.0017951732,0.000039930306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005246986,0.00007245394,0.000030390052,0.00011739153,0.000024620465,0.0001709689,0.0007041206,0.054797012,0.00008949309,0.021177266,0.00058208394,0.92222893],"study_design_scores_gemma":[0.00024301636,0.0002084273,0.00015141958,0.00063511735,0.000008532744,0.00006662486,1.0019968e-7,0.7596823,0.00030694992,0.23290421,0.005024058,0.00076924864],"about_ca_topic_score_codex":0.000032992175,"about_ca_topic_score_gemma":0.00002545679,"teacher_disagreement_score":0.9214597,"about_ca_system_score_codex":0.00031682083,"about_ca_system_score_gemma":0.0029512066,"threshold_uncertainty_score":0.9999406},"labels":[],"label_agreement":null},{"id":"W4408810019","doi":"10.26443/msurj.v1i2.316","title":"Generating and Testing a Many-qubit Entangled State for Controlled Quantum Teleportation","year":2025,"lang":"en","type":"article","venue":"McGill Science Undergraduate Research Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Quantum teleportation; Superdense coding; Teleportation; Qubit; Bell state; One-way quantum computer; Physics; Quantum mechanics; Quantum channel; Computer science; Quantum; Quantum entanglement","score_opus":0.043386110167711565,"score_gpt":0.35078379746919125,"score_spread":0.3073976873014797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408810019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3155865,0.0002947079,0.6676511,0.014129136,0.0006538706,0.00090897596,0.000005235404,0.00012512897,0.00064530957],"genre_scores_gemma":[0.8676134,0.000056452707,0.13164471,0.00020528816,0.000098776116,0.000037647063,4.9207057e-7,0.000010768967,0.0003325152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958775,0.00033756046,0.0006029221,0.00070063485,0.0013070215,0.0011743786],"domain_scores_gemma":[0.99595094,0.0016403829,0.00025386835,0.00032489846,0.0014843123,0.00034559928],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010203787,0.00019919439,0.00033201557,0.001111273,0.005530086,0.0018471889,0.0012121884,0.000041074232,7.1644627e-7],"category_scores_gemma":[0.0036348596,0.00015315735,0.00009196043,0.0028286471,0.00048371914,0.00073601323,0.0005141458,0.0007001395,0.0000020522805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014693223,0.00016903672,0.0004998302,0.00009191982,0.00009018161,0.00016195992,0.00046935026,0.030866629,0.10306923,0.21221295,0.0006409031,0.6515811],"study_design_scores_gemma":[0.0017647516,0.0002478746,0.00027746774,0.00012333735,0.0000051896627,0.00018199862,0.000062246385,0.8457278,0.0020255414,0.14894201,0.0004945606,0.0001472166],"about_ca_topic_score_codex":0.00004873925,"about_ca_topic_score_gemma":0.000013628116,"teacher_disagreement_score":0.8148612,"about_ca_system_score_codex":0.0002287069,"about_ca_system_score_gemma":0.0007976704,"threshold_uncertainty_score":0.99918896},"labels":[],"label_agreement":null},{"id":"W4408818792","doi":"10.1103/physrevlett.134.120601","title":"Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits","year":2025,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Sherbrooke","funders":"Army Research Office; National Center of Competence in Research Quantum Science and Technology; ETH Zürich Foundation; Canada First Research Excellence Fund; U.S. Department of Energy; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Natural Sciences and Engineering Research Council of Canada; European Commission; Intelligence Advanced Research Projects Activity; Eidgenössische Technische Hochschule Zürich; Office of the Director of National Intelligence","keywords":"Magnetic flux quantum; Leakage (economics); Superconductivity; Electronic circuit; Reduction (mathematics); Materials science; Rapid single flux quantum; Quantum; Flux (metallurgy); Condensed matter physics; Physics; Quantum mechanics; Josephson effect","score_opus":0.02069471466885244,"score_gpt":0.2930201192719917,"score_spread":0.27232540460313925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408818792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45841503,0.002617935,0.49772352,0.038588207,0.0012135998,0.00085891475,0.000004396306,0.00041958046,0.0001588228],"genre_scores_gemma":[0.9722159,0.0002105604,0.011245005,0.015384121,0.00069824635,0.00012108166,0.000019546736,0.000028769993,0.00007676705],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848837,0.000108971915,0.000274414,0.00056395005,0.00018547448,0.00037880434],"domain_scores_gemma":[0.99908274,0.00019545294,0.00009499821,0.00049322436,0.00006599896,0.0000676033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026400774,0.00021552101,0.00039505123,0.00007886884,0.00022995325,0.00010146946,0.0006032325,0.000014760735,0.0000024356882],"category_scores_gemma":[0.00012145854,0.00018423091,0.00024323519,0.00070003053,0.000052708067,0.0002799538,0.00014696261,0.00026910444,0.000018362585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002531001,0.00013335704,0.0000047817566,0.0015575753,0.00006936859,0.000004796887,0.00042980726,0.0012613127,0.6226445,0.019511065,0.010919702,0.34346122],"study_design_scores_gemma":[0.0009102374,0.00019279827,0.00038674747,0.0068153176,0.0001428258,0.000053050062,0.000047776673,0.8946301,0.04131134,0.01080668,0.043581728,0.0011214056],"about_ca_topic_score_codex":0.000009194217,"about_ca_topic_score_gemma":1.1962507e-7,"teacher_disagreement_score":0.8933688,"about_ca_system_score_codex":0.000048017406,"about_ca_system_score_gemma":0.00004223396,"threshold_uncertainty_score":0.7512719},"labels":[],"label_agreement":null},{"id":"W4408847956","doi":"10.1038/s42254-025-00813-9","title":"Barren plateaus in variational quantum computing","year":2025,"lang":"en","type":"review","venue":"Nature Reviews Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":173,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; ArcelorMittal (Canada); Université du Québec à Montréal","funders":"","keywords":"Quantum; Quantum computer; Statistical physics; Computer science; Physics; Geology; Quantum mechanics","score_opus":0.02311131219892335,"score_gpt":0.3357677398580395,"score_spread":0.3126564276591161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408847956","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.798453e-8,0.87288004,0.12375201,0.000063534746,0.0016910223,0.0009865559,0.000018740418,0.00014471421,0.00046326968],"genre_scores_gemma":[0.000002124072,0.9638986,0.03461331,0.00025959345,0.0009807242,0.000036679146,0.00010719121,0.00003306609,0.00006871765],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.995675,0.0007467961,0.0013081519,0.0011927722,0.00047403816,0.00060321955],"domain_scores_gemma":[0.9967499,0.0009899617,0.00084623555,0.0012209826,0.00008494491,0.00010802551],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0011166484,0.0008285004,0.0031259905,0.00032129636,0.00016955276,0.00022961298,0.0025050396,0.00081399304,0.0000036051465],"category_scores_gemma":[0.0002569479,0.00063463894,0.00096953,0.0027965936,0.000032706852,0.00017382957,0.00092585053,0.0037098941,0.0000864891],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.467471e-7,0.00005126966,5.556207e-7,0.011939444,0.000032913616,0.000015563752,0.000051128827,0.00017686943,1.7029489e-8,0.049450304,0.0012152067,0.9370665],"study_design_scores_gemma":[0.00011615009,0.000015460306,0.0000033611498,0.04043649,0.00007225809,0.000025062307,2.8959445e-7,0.057032276,7.659848e-8,0.0060672173,0.89567953,0.0005518044],"about_ca_topic_score_codex":0.0000058269884,"about_ca_topic_score_gemma":0.0000015236121,"teacher_disagreement_score":0.9365147,"about_ca_system_score_codex":0.00017579907,"about_ca_system_score_gemma":0.0007420351,"threshold_uncertainty_score":0.9996105},"labels":[],"label_agreement":null},{"id":"W4408850289","doi":"10.1038/s41567-025-02797-w","title":"Simulating two-dimensional lattice gauge theories on a qudit quantum computer","year":2025,"lang":"en","type":"article","venue":"Nature Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; HORIZON EUROPE Framework Programme; QuantERA; Austrian Science Fund; Canada First Research Excellence Fund; Österreichische Forschungsförderungsgesellschaft; Bundesministerium für Bildung und Forschung; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Physics; Lattice gauge theory; Quantum simulator; Quantum computer; Gauge theory; Qubit; Open quantum system; Quantum algorithm; Quantum mechanics; Quantum information; Quantum; Theoretical physics; Quantum technology","score_opus":0.006074158088161644,"score_gpt":0.2679105824526971,"score_spread":0.26183642436453547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408850289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24548607,0.0004466826,0.73780924,0.00632695,0.005069325,0.00035184858,0.000018978591,0.0008776664,0.0036132298],"genre_scores_gemma":[0.9351048,6.715276e-7,0.059232112,0.0046004355,0.00092791475,0.000003443894,0.00000850306,0.000015257116,0.00010688134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982739,0.00011440438,0.00022041985,0.0005886909,0.0004181853,0.00038441233],"domain_scores_gemma":[0.9981466,0.000896431,0.00010707306,0.00063369673,0.00014944325,0.000066785346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002332575,0.00027777883,0.0002686257,0.00008797094,0.0003720834,0.00019736451,0.0007799839,0.0001506983,0.0000025395861],"category_scores_gemma":[0.00005009152,0.000224865,0.00014120477,0.00072079233,0.000065068394,0.0001565439,0.00048201092,0.0011508815,0.000029312363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001057245,0.00008618347,0.000040996227,0.000018522438,0.000035014647,0.00001384953,0.00019211162,0.13894707,0.000114140086,0.8040948,0.0011771537,0.055269573],"study_design_scores_gemma":[0.000343659,0.000051505966,0.00034866633,0.00012251225,0.0000075791513,0.000003529238,0.0000021739095,0.7372458,0.0006298047,0.25964695,0.0014092777,0.00018854508],"about_ca_topic_score_codex":0.000009491192,"about_ca_topic_score_gemma":0.000001262061,"teacher_disagreement_score":0.6896187,"about_ca_system_score_codex":0.000037576832,"about_ca_system_score_gemma":0.00009450136,"threshold_uncertainty_score":0.9169729},"labels":[],"label_agreement":null},{"id":"W4408967317","doi":"10.1145/3715885.3715895","title":"An Investigation of Privacy and Software Engineering in the Context of Quantum Computing","year":2024,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Context (archaeology); Privacy software; Software; Quantum computer; Information privacy; Quantum; Computer security; Programming language; Physics","score_opus":0.01122435391642584,"score_gpt":0.23516944082926744,"score_spread":0.2239450869128416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408967317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6563059,0.00016381986,0.34318691,0.00018413221,0.00005340456,0.000045719175,3.6396577e-7,0.00005718016,0.0000025858672],"genre_scores_gemma":[0.9550031,0.0000021283408,0.04490423,0.00006248056,0.000022345392,5.240504e-7,6.755983e-7,0.0000037737616,7.517788e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993834,0.000045113582,0.0001899637,0.00016352315,0.0001210428,0.000096980846],"domain_scores_gemma":[0.9993952,0.00032658875,0.00003331297,0.0002007581,0.000020811913,0.000023323712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040170428,0.0000678304,0.00010281988,0.000104460414,0.000021600044,0.00006420419,0.00035223181,0.000022822598,4.100825e-7],"category_scores_gemma":[0.00003695995,0.000045178735,0.0000205347,0.0003384659,0.000033394736,0.00012819738,0.000093254625,0.00011410187,2.377855e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000334351,0.00005817348,0.02778549,0.0007776475,0.000030304622,0.000029214334,0.11413908,0.040391307,0.0073749507,0.4457176,0.000105800806,0.36358708],"study_design_scores_gemma":[0.000068833215,0.00007982892,0.020862564,0.00014293406,0.0000013798044,0.000014163047,0.00010505853,0.97578543,0.0013942833,0.0014726128,0.000019956555,0.000052933763],"about_ca_topic_score_codex":0.00007502525,"about_ca_topic_score_gemma":0.0000023184475,"teacher_disagreement_score":0.93539417,"about_ca_system_score_codex":0.0000042318875,"about_ca_system_score_gemma":0.000026751482,"threshold_uncertainty_score":0.18423353},"labels":[],"label_agreement":null},{"id":"W4409048807","doi":"10.1038/s41598-025-95283-5","title":"A quantum random access memory (QRAM) using a polynomial encoding of binary strings","year":2025,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Qubit; Computer science; Speedup; Quantum; Arithmetic; Quantum computer; Binary logarithm; Polynomial; Binary number; Discrete mathematics; Quantum algorithm; Dimension (graph theory); Algorithm; Mathematics; Parallel computing; Combinatorics; Physics; Quantum mechanics","score_opus":0.019285552772968204,"score_gpt":0.2836913155832633,"score_spread":0.2644057628102951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409048807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87747955,0.00028511774,0.10879897,0.00021847068,0.012159824,0.0002627857,9.677004e-7,0.00015643786,0.00063787197],"genre_scores_gemma":[0.98903865,0.0000013824451,0.010396526,0.000043944416,0.00007867057,0.000004273051,0.0000021913422,0.000008297147,0.0004260971],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721634,0.00009532436,0.00073699333,0.0009903671,0.00052797346,0.00043301116],"domain_scores_gemma":[0.99786115,0.00013321856,0.0004877819,0.0012433126,0.00017512863,0.00009941969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019266821,0.00019593036,0.00036631303,0.0006585452,0.00054094114,0.0008166557,0.001070906,0.00007368249,0.000008769152],"category_scores_gemma":[0.00019371508,0.00017310123,0.00019121198,0.0018399858,0.0002484095,0.0004777417,0.0011303312,0.0002069366,0.0000013391983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014462027,0.000714079,0.0068493667,0.00068157597,0.00025441794,0.002981385,0.0058471453,0.1549345,0.6895935,0.003996737,0.021599986,0.112402715],"study_design_scores_gemma":[0.0006205144,0.00003439446,0.0008378657,0.00038530276,0.00002452731,0.00026762136,0.000049918024,0.92901134,0.057562564,0.008281951,0.0026239008,0.00030007452],"about_ca_topic_score_codex":0.00015268919,"about_ca_topic_score_gemma":0.000003435362,"teacher_disagreement_score":0.7740769,"about_ca_system_score_codex":0.00005335641,"about_ca_system_score_gemma":0.0005959209,"threshold_uncertainty_score":0.787503},"labels":[],"label_agreement":null},{"id":"W4409065770","doi":"10.22331/q-2025-04-01-1682","title":"Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"European Climate, Infrastructure and Environment Executive Agency; QuantERA; European Regional Development Fund; European Commission; Barcelona Supercomputing Center; NextGenerationEU; Agència de Gestió d'Ajuts Universitaris i de Recerca; Generalitat de Catalunya; Institut de Ciències Fotòniques; HORIZON EUROPE Framework Programme; Université de Genève; Centres de Recerca de Catalunya; Agencia Estatal de Investigación; “la Caixa” Foundation","keywords":"Ground state; Quantum; Energy (signal processing); Fault tolerance; Algorithm; Estimation; Computer science; State (computer science); Quantum algorithm; Distributed computing; Mathematics; Engineering; Physics; Quantum mechanics; Statistics; Systems engineering","score_opus":0.006174147047540594,"score_gpt":0.2677384799202673,"score_spread":0.2615643328727267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409065770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08184027,0.00015461631,0.91014165,0.0060904413,0.0007326048,0.00031904186,0.0000040630125,0.00032871446,0.00038861798],"genre_scores_gemma":[0.9096123,0.000020037582,0.08818827,0.001779525,0.000078600955,0.00011212025,0.000011095739,0.000021985541,0.00017604699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973408,0.00020268642,0.0005873189,0.00085431937,0.00044305535,0.0005718154],"domain_scores_gemma":[0.9982832,0.000351766,0.00019059119,0.0008605098,0.00016676684,0.00014718632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006567196,0.00029841004,0.00032455608,0.0005475334,0.00023040583,0.0003626292,0.0010357399,0.00010930002,0.0000013802714],"category_scores_gemma":[0.00015104332,0.0002900178,0.00008314869,0.001852293,0.000045776098,0.00057784317,0.00035693002,0.00033194135,0.00007425246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003812596,0.00024734985,0.00006752553,0.000029109478,0.000030124096,0.000046978468,0.0018608309,0.07340246,0.00057624263,0.36837083,0.00044217138,0.55488825],"study_design_scores_gemma":[0.00040644105,0.00014960582,0.0043753106,0.000101749865,0.000008183673,0.000019530802,0.000041483032,0.9389184,0.00028086506,0.044765603,0.010625006,0.00030779134],"about_ca_topic_score_codex":0.0019162244,"about_ca_topic_score_gemma":0.00005116473,"teacher_disagreement_score":0.86551595,"about_ca_system_score_codex":0.00013760803,"about_ca_system_score_gemma":0.00015731408,"threshold_uncertainty_score":0.9999552},"labels":[],"label_agreement":null},{"id":"W4409238193","doi":"10.1007/s11128-025-04728-3","title":"Comparative investigation of quantum and classical kernel functions applied in support vector machine algorithms","year":2025,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Quantum computer; Support vector machine; Computer science; Algorithm; Quantum; Quantum algorithm; Kernel (algebra); Artificial intelligence; Physics; Mathematics; Quantum mechanics; Discrete mathematics","score_opus":0.013643411273125879,"score_gpt":0.2555144115763202,"score_spread":0.24187100030319433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409238193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114789136,0.00010760467,0.88195443,0.0012882936,0.00023835084,0.00025004038,0.000011477786,0.00015529254,0.0012053488],"genre_scores_gemma":[0.98639536,0.000004500336,0.01308689,0.00040221322,0.000019499432,0.000021743608,0.00003840745,0.000004132976,0.000027224212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851143,0.000049009697,0.0006941014,0.00023692564,0.00026659906,0.00024194496],"domain_scores_gemma":[0.999144,0.00010932661,0.00032022526,0.00020897719,0.00014514252,0.000072292365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041722096,0.00018730471,0.0003164434,0.00050060113,0.00021275996,0.00021338165,0.00030033026,0.00009223061,0.0000028971822],"category_scores_gemma":[0.000037428817,0.00017016489,0.000035331475,0.0010399041,0.00014594926,0.0012023558,0.0001702356,0.00030157366,0.000008652123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115479175,0.00021881158,0.0035621605,0.0014224898,0.00007316093,0.000005090476,0.042296126,0.022266006,0.0018290252,0.42201796,0.0016360655,0.5045576],"study_design_scores_gemma":[0.0005665449,0.00006721738,0.015519495,0.00010960606,0.000007164478,0.000009774293,0.00033411145,0.97321904,0.00094634364,0.00817747,0.0008755057,0.00016773997],"about_ca_topic_score_codex":0.000026216218,"about_ca_topic_score_gemma":0.000004023975,"teacher_disagreement_score":0.950953,"about_ca_system_score_codex":0.000046946097,"about_ca_system_score_gemma":0.0002749247,"threshold_uncertainty_score":0.69391227},"labels":[],"label_agreement":null},{"id":"W4409291956","doi":"10.22331/q-2025-04-09-1700","title":"Hamiltonian Learning via Shadow Tomography of Pseudo-Choi States","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Toronto","funders":"Pacific Northwest National Laboratory; Office of Science; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; U.S. Department of Energy","keywords":"Tomography; Shadow (psychology); Artificial intelligence; Computer science; Psychology; Medicine; Radiology; Psychoanalysis","score_opus":0.0042988262209225445,"score_gpt":0.22510260560928444,"score_spread":0.2208037793883619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409291956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33091894,0.0005309399,0.6649485,0.0012685875,0.00067841396,0.00012248228,0.0000025688498,0.00034983113,0.0011797178],"genre_scores_gemma":[0.97597843,0.000023647559,0.023438651,0.00026063566,0.00004160686,0.000004821916,0.0000034911325,0.000010398043,0.00023830197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985312,0.00010759821,0.0003238545,0.00042396176,0.00024065064,0.0003726937],"domain_scores_gemma":[0.9990054,0.0001966137,0.00013106134,0.00050037866,0.00009271897,0.000073850446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003116541,0.00018530422,0.000268317,0.00035271834,0.00020755868,0.00009782129,0.0008662899,0.00006813093,0.000008485242],"category_scores_gemma":[0.000040695508,0.00016457618,0.00015369871,0.0010837439,0.0000935293,0.000120752426,0.00032210076,0.00033766282,0.000013010911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004209764,0.00047625817,0.028403373,0.00042048245,0.00030820066,0.00008479972,0.00543425,0.052074704,0.011252904,0.2993813,0.0039520194,0.5981696],"study_design_scores_gemma":[0.00024756955,0.00016370851,0.010366804,0.0001211999,0.000007971774,0.000008163394,0.000037976963,0.94376695,0.0017822932,0.038342595,0.004961754,0.00019301608],"about_ca_topic_score_codex":0.0001502428,"about_ca_topic_score_gemma":0.0000088337265,"teacher_disagreement_score":0.8916922,"about_ca_system_score_codex":0.000013288577,"about_ca_system_score_gemma":0.00006402537,"threshold_uncertainty_score":0.6711222},"labels":[],"label_agreement":null},{"id":"W4409559965","doi":"10.21203/rs.3.rs-6419602/v1","title":"Transient Hyperlogic Circuit: An Ultrafast and Metastability Self-Loopback Solver for NP-Hard Problems","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Metastability; Transient (computer programming); Solver; Ultrashort pulse; Transient analysis; Computer science; Problem solver; Parallel computing; Physics; Transient response; Electrical engineering; Computational science; Engineering; Quantum mechanics","score_opus":0.07985990634947228,"score_gpt":0.35369571864674276,"score_spread":0.2738358122972705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409559965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30678576,0.0023063202,0.6765157,0.0032945068,0.0010639315,0.007178957,0.00081001275,0.0011633226,0.000881488],"genre_scores_gemma":[0.8515709,0.000370427,0.14508893,0.0002453349,0.0006128989,0.0011829913,0.00018515953,0.00007705278,0.0006663051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99339837,0.0012900361,0.0005702073,0.002266223,0.0011899264,0.0012852118],"domain_scores_gemma":[0.99528366,0.0012292004,0.000121974335,0.0019865853,0.0009183009,0.0004602785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0056830454,0.0005212361,0.000720119,0.0005148715,0.00071434316,0.0009267321,0.0023384094,0.0003988126,0.000013814987],"category_scores_gemma":[0.00028326522,0.00044302654,0.0003305854,0.0007354965,0.00024871394,0.00021828563,0.0018419531,0.0020479038,0.000006279697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024563045,0.0053139213,0.0023789096,0.036760196,0.0013700491,0.00014279645,0.056028116,0.07953441,0.0030142905,0.077143274,0.0027930073,0.7352754],"study_design_scores_gemma":[0.0015370621,0.0016737456,0.008647267,0.0011363483,0.000082157065,0.000053139593,0.0002877106,0.8454984,0.00076223887,0.11955252,0.019442813,0.0013266203],"about_ca_topic_score_codex":0.00010320451,"about_ca_topic_score_gemma":0.000045226752,"teacher_disagreement_score":0.765964,"about_ca_system_score_codex":0.00017698135,"about_ca_system_score_gemma":0.0008513658,"threshold_uncertainty_score":0.9998022},"labels":[],"label_agreement":null},{"id":"W4409561850","doi":"10.36227/techrxiv.174495254.42330972/v1","title":"Resilience Analysis of Quantum Network Against Targeted Attacks: Recovery via Rerouting and Purification","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Resilience (materials science); Quantum; Computer security; Computer science; Business; Physics; Quantum mechanics","score_opus":0.010282642877074536,"score_gpt":0.2488951594228583,"score_spread":0.23861251654578378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409561850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09618818,0.0009129478,0.9005588,0.00047094197,0.00069841277,0.00023674656,0.00001767092,0.00022545684,0.00069080683],"genre_scores_gemma":[0.7316345,0.00028192077,0.26714298,0.00034388565,0.00015676915,0.000014957708,0.00008059084,0.000012021304,0.00033238644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695027,0.00026149928,0.00079841673,0.0012064368,0.0003707878,0.00041256176],"domain_scores_gemma":[0.9971105,0.00044852405,0.00066067337,0.0014689596,0.0002150108,0.00009634972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010446545,0.0003425274,0.000766773,0.0006262157,0.00021281448,0.00021321129,0.0013855146,0.0002731551,0.000003943509],"category_scores_gemma":[0.00013928629,0.00031500406,0.00029759266,0.0023636369,0.000089374764,0.000113738075,0.002211159,0.0006061004,0.0000012319817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064373585,0.000030932224,0.0019751948,0.00010993113,0.00047773088,0.0000033004349,0.0004863994,0.8957135,0.00015796286,0.0037553706,0.00022057048,0.097062685],"study_design_scores_gemma":[0.00006582443,0.00003133709,0.014634856,0.00025042545,0.00018022108,0.0000012060805,0.000012674865,0.97829515,0.00022268768,0.0059059532,0.000096239026,0.0003034058],"about_ca_topic_score_codex":0.00019417507,"about_ca_topic_score_gemma":0.000026558531,"teacher_disagreement_score":0.6354463,"about_ca_system_score_codex":0.000060046485,"about_ca_system_score_gemma":0.0002624385,"threshold_uncertainty_score":0.9999302},"labels":[],"label_agreement":null},{"id":"W4409891331","doi":"10.12700/aph.22.5.2025.5.5","title":"Design and Implementation of a Laboratory Prototype for Boolean Function Simplification in Real Time","year":2025,"lang":"en","type":"article","venue":"Acta Polytechnica Hungarica","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Function (biology); Boolean function; Programming language; Algorithm","score_opus":0.008767194731108869,"score_gpt":0.2739395831564304,"score_spread":0.26517238842532154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409891331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047350705,0.000061479346,0.9491032,0.0015485156,0.00006093437,0.0016006534,0.0000052636815,0.0001807031,0.00008857418],"genre_scores_gemma":[0.9047078,0.000013639772,0.09498968,0.00009574911,0.000013702252,0.00014793393,0.0000052836544,0.0000066384796,0.00001961283],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991205,0.0000715357,0.00026072745,0.00029017875,0.000093439245,0.00016364046],"domain_scores_gemma":[0.999274,0.00020042999,0.00012439731,0.0003075457,0.000068022804,0.000025614752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044064736,0.00009552152,0.00014052397,0.00021123329,0.00007940282,0.000037379137,0.0002656219,0.000066052715,0.0000017071214],"category_scores_gemma":[0.000028467268,0.000093133414,0.00002374745,0.00053475145,0.000028871467,0.00012008231,0.00009818749,0.00009106813,6.612026e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022176042,0.00019070346,0.0006881779,0.00015304831,0.00005433038,0.000001067272,0.0008689188,0.0006577542,0.5122925,0.028471751,0.0023907572,0.45400923],"study_design_scores_gemma":[0.0018537124,0.0017263745,0.0750031,0.00013252143,0.00004933873,0.0000032195876,0.00007053422,0.8377564,0.06023408,0.0171381,0.005593157,0.00043945777],"about_ca_topic_score_codex":0.000040255993,"about_ca_topic_score_gemma":0.000004926652,"teacher_disagreement_score":0.8573571,"about_ca_system_score_codex":0.000031746484,"about_ca_system_score_gemma":0.00014026498,"threshold_uncertainty_score":0.37978703},"labels":[],"label_agreement":null},{"id":"W4410031248","doi":"10.1016/j.physleta.2025.130601","title":"Quantum information recast via multiresolution in L2(0,1]","year":2025,"lang":"en","type":"article","venue":"Physics Letters A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"University of Saskatchewan","keywords":"Physics; Quantum; Quantum information; Quantum mechanics","score_opus":0.0063886036716775925,"score_gpt":0.21848953975830057,"score_spread":0.21210093608662298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410031248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115652606,0.000016857708,0.87592465,0.0075689345,0.0004044115,0.00010395499,9.543958e-7,0.000112742004,0.00021488583],"genre_scores_gemma":[0.97930396,0.0000017053532,0.016565925,0.004025083,0.000078012854,0.000009781461,0.000005832762,0.0000033735446,0.0000063548605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919826,0.00004661212,0.00019945117,0.0001796499,0.00014340268,0.00023261101],"domain_scores_gemma":[0.9995236,0.000055219694,0.000068075184,0.0003023605,0.000025920019,0.000024814928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001406441,0.00011002806,0.00011427993,0.00013664465,0.00009127442,0.000114931885,0.00039400376,0.000029396128,4.459586e-7],"category_scores_gemma":[0.000013803962,0.00010771097,0.00004866487,0.0006509333,0.000020018722,0.0005385602,0.00017206803,0.00019484326,0.000028717539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011558327,0.00010838217,0.0007675243,0.00006562064,0.000019527673,0.000010620542,0.002900131,0.06059154,0.009633343,0.11911007,0.0035187076,0.80326295],"study_design_scores_gemma":[0.00027862607,0.000012241645,0.003708478,0.00005319052,0.0000015304158,0.0000017392074,0.0000050634358,0.9835415,0.0005945665,0.010101598,0.0015836958,0.00011777302],"about_ca_topic_score_codex":0.000110887406,"about_ca_topic_score_gemma":0.0000033473557,"teacher_disagreement_score":0.92294997,"about_ca_system_score_codex":0.000053514792,"about_ca_system_score_gemma":0.000026101186,"threshold_uncertainty_score":0.4392326},"labels":[],"label_agreement":null},{"id":"W4410038839","doi":"10.1021/acsinfocus.7e9012","title":"Quantum Computing for Quantum Chemistry","year":2025,"lang":"en","type":"book","venue":"ACS in focus","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum computer; Quantum chemistry; Quantum; Computer science; Chemistry; Physics; Quantum mechanics; Molecule; Organic chemistry","score_opus":0.011808275423565046,"score_gpt":0.2520248802406837,"score_spread":0.24021660481711865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410038839","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013033936,0.0043798876,0.8614205,0.0019388641,0.0035961596,0.0011580636,0.000084965424,0.00090747926,0.12521067],"genre_scores_gemma":[0.054858584,0.00018758171,0.12913503,0.0017611055,0.005491221,0.00016103622,0.000308082,0.00037446572,0.8077229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969748,0.00004790757,0.000689265,0.0011604807,0.00037799182,0.00074954657],"domain_scores_gemma":[0.997344,0.00090003764,0.00034532338,0.0011688205,0.00013470257,0.00010710474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056940224,0.0005584717,0.0007472239,0.00024047923,0.00022178554,0.00023380965,0.0024832617,0.0005398297,0.0000052901814],"category_scores_gemma":[0.00012790097,0.0005632171,0.0002796481,0.00033924164,0.00008711332,0.00008321895,0.0011132847,0.0010714725,0.000016703187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032975164,0.00022166224,0.000032536187,0.0018113344,0.00020331271,0.0002695549,0.0013823705,0.0055265804,0.00024185627,0.47558612,0.14776112,0.36693057],"study_design_scores_gemma":[0.0006540364,0.00007832744,0.000020391291,0.0011901736,0.000019875291,0.000031363532,0.000007863589,0.6159465,0.0005108484,0.25102755,0.1297555,0.000757605],"about_ca_topic_score_codex":0.000031136693,"about_ca_topic_score_gemma":0.000005942894,"teacher_disagreement_score":0.7322855,"about_ca_system_score_codex":0.00023703795,"about_ca_system_score_gemma":0.0008804834,"threshold_uncertainty_score":0.99968195},"labels":[],"label_agreement":null},{"id":"W4410078066","doi":"10.22331/q-2025-05-05-1727","title":"Improving the efficiency of learning-based error mitigation","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Los Alamos National Laboratory; Laboratory Directed Research and Development","keywords":"Computer science; Artificial intelligence","score_opus":0.006563147124845507,"score_gpt":0.2362031233527883,"score_spread":0.2296399762279428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410078066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29326394,0.0001308301,0.7041402,0.0017396552,0.00034506185,0.00008715183,4.1763286e-7,0.00010820863,0.00018456568],"genre_scores_gemma":[0.9942734,5.7112834e-7,0.0053876494,0.00020732217,0.000027156726,0.0000043160335,9.204374e-7,0.0000041153476,0.00009449911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999062,0.00010981433,0.0002055701,0.00023924356,0.00018834346,0.00019503493],"domain_scores_gemma":[0.9991295,0.00026595796,0.00012572407,0.000383058,0.000071971925,0.000023829492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042063708,0.00009550297,0.0001151042,0.00010383726,0.00024627105,0.000063955296,0.0007088255,0.000037450664,0.0000024722983],"category_scores_gemma":[0.00015462164,0.00006435168,0.00007656685,0.00059926906,0.00008073268,0.000051789015,0.00014055289,0.00021967363,0.000005290051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024191255,0.00033057545,0.002955714,0.0003286074,0.000048994763,0.000013886771,0.0026785,0.3664604,0.026349928,0.32864708,0.00096999883,0.2711921],"study_design_scores_gemma":[0.00015886719,0.000085491214,0.0012836913,0.00005009579,0.000004513035,0.0000012104748,0.000032237043,0.98642576,0.008906147,0.0023467266,0.0006339359,0.0000713311],"about_ca_topic_score_codex":0.000043218013,"about_ca_topic_score_gemma":0.0000018574868,"teacher_disagreement_score":0.7010095,"about_ca_system_score_codex":0.000013202738,"about_ca_system_score_gemma":0.00013756163,"threshold_uncertainty_score":0.26241854},"labels":[],"label_agreement":null},{"id":"W4410329223","doi":"10.22331/q-2025-05-13-1741","title":"Quantum and classical algorithms for nonlinear unitary dynamics","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Northwest National Laboratory; Office of Science; University of Toronto; U.S. Department of Energy","keywords":"Unitary state; Algorithm; Nonlinear system; Quantum; Dynamics (music); Computer science; Mathematics; Physics; Quantum mechanics; Political science","score_opus":0.012464529902766164,"score_gpt":0.26716931342186245,"score_spread":0.2547047835190963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410329223","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050604086,0.0004391928,0.93764436,0.0091095455,0.0012837946,0.0002963727,0.000042061416,0.00033249528,0.0002480745],"genre_scores_gemma":[0.47250524,0.00010387762,0.5217954,0.0031116249,0.0007063449,0.00007792482,0.0000994462,0.000067425026,0.0015327471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983022,0.000066178254,0.00032214553,0.0006285548,0.00019324625,0.00048764574],"domain_scores_gemma":[0.9986761,0.0004580895,0.00007481101,0.000549538,0.000108017615,0.00013342898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034706426,0.00025159802,0.0003110673,0.00020750161,0.00035040476,0.00019407638,0.0007485318,0.00013406249,0.0000014366927],"category_scores_gemma":[0.0000980174,0.00022145873,0.00011496622,0.00050330843,0.00013076542,0.0001533607,0.0004276191,0.0003132256,0.0000067489696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001953266,0.00013215361,0.0001365487,0.00009537992,0.00005206821,0.00002196955,0.00019411636,0.00046854818,0.00006083639,0.80143464,0.003329002,0.1940552],"study_design_scores_gemma":[0.00050015934,0.00019179481,0.0005310462,0.00006188352,0.000013403965,0.0000216427,0.00004131051,0.9099121,0.00008038058,0.06988816,0.01852,0.0002380955],"about_ca_topic_score_codex":0.00002770077,"about_ca_topic_score_gemma":0.000013858907,"teacher_disagreement_score":0.90944356,"about_ca_system_score_codex":0.000046743826,"about_ca_system_score_gemma":0.00014457609,"threshold_uncertainty_score":0.9030825},"labels":[],"label_agreement":null},{"id":"W4410341078","doi":"10.1109/icnc64010.2025.10994128","title":"Scalable quantum based solutions for Blockchain Systems","year":2025,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Blockchain; Scalability; Computer science; Quantum; Distributed computing; Computer security; Database; Physics; Quantum mechanics","score_opus":0.0151144873512459,"score_gpt":0.2454254835532793,"score_spread":0.2303109962020334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410341078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031160093,0.00024990912,0.9885893,0.004514799,0.001108001,0.00030418613,0.000005009402,0.0004263162,0.0016864554],"genre_scores_gemma":[0.86826503,5.75992e-7,0.12660232,0.0010017352,0.00011176884,0.00008297048,0.0000024180279,0.000008960266,0.00392424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988605,0.000046199602,0.00019712457,0.00034216116,0.00012062163,0.00043342554],"domain_scores_gemma":[0.9990487,0.00029453685,0.0000391273,0.00046350557,0.00009467147,0.00005947196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046393476,0.00011653118,0.00015241343,0.00016116642,0.00044013932,0.00018676266,0.0006137414,0.000053348016,0.0000028447814],"category_scores_gemma":[0.00004972167,0.000095982294,0.0000900659,0.00049529824,0.000027312013,0.000023579449,0.00017832418,0.000087955916,0.0000102485765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023384944,0.000056996065,0.000021252954,0.00005363172,0.000014397219,0.000001241184,0.000027294169,0.21344015,0.00018996515,0.7668079,0.01214074,0.0072441073],"study_design_scores_gemma":[0.0003110479,0.00004496655,0.00005300859,0.000055755223,0.000004500711,0.0000022392483,0.000011683925,0.97785664,0.00019408642,0.0075980197,0.013752217,0.00011583954],"about_ca_topic_score_codex":0.00008284724,"about_ca_topic_score_gemma":0.000005582889,"teacher_disagreement_score":0.865149,"about_ca_system_score_codex":0.000027465714,"about_ca_system_score_gemma":0.00015928947,"threshold_uncertainty_score":0.39140442},"labels":[],"label_agreement":null},{"id":"W4410341754","doi":"10.1109/cpeee64598.2025.10987353","title":"Quantum Algorithms for Optimal Power Flow","year":2025,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Alliance de recherche numérique du Canada","keywords":"Computer science; Power flow; Algorithm; Flow (mathematics); Quantum; Power (physics); Mathematics; Physics; Electric power system; Quantum mechanics","score_opus":0.010679425117586454,"score_gpt":0.2629238014524532,"score_spread":0.25224437633486674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410341754","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003332049,0.00011719596,0.9876493,0.004038928,0.0013002764,0.00021101911,0.0000040836753,0.0004040738,0.0029430445],"genre_scores_gemma":[0.067876734,0.000002210725,0.927948,0.0014924172,0.0000916757,0.000024402018,0.0000026212206,0.000009323514,0.0025526353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880534,0.000023957227,0.00020184559,0.00045249736,0.00014245328,0.0003739124],"domain_scores_gemma":[0.9991351,0.00018324837,0.000034791832,0.0004895981,0.0000886822,0.0000686022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024598913,0.00015659408,0.00017378575,0.00013731202,0.00021008811,0.00019174308,0.00086399604,0.00006368824,0.000014972046],"category_scores_gemma":[0.00004155546,0.00012522214,0.00013168086,0.0003927581,0.00003186515,0.00012191477,0.00030531862,0.00012523391,0.000019596713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012260567,0.0001306777,0.000028588525,0.00003006703,0.000065861626,0.000011228417,0.00045174922,0.024123948,0.00022220665,0.5325931,0.031074515,0.41125587],"study_design_scores_gemma":[0.00034320238,0.00010131862,0.00016800992,0.000018637931,0.000003467947,0.000006722158,0.000013635707,0.94707227,0.0006735976,0.012268381,0.039174266,0.0001564682],"about_ca_topic_score_codex":0.000008533015,"about_ca_topic_score_gemma":8.820436e-7,"teacher_disagreement_score":0.92294836,"about_ca_system_score_codex":0.0000180695,"about_ca_system_score_gemma":0.00009324467,"threshold_uncertainty_score":0.51064104},"labels":[],"label_agreement":null},{"id":"W4410416070","doi":"10.1007/978-3-031-92886-4_16","title":"A Quantum Algorithm for Assessing Node Importance in the st-Connectivity Attack","year":2025,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Node (physics); Quantum; Algorithm; Computer network; Physics; Quantum mechanics","score_opus":0.012691802147450255,"score_gpt":0.28836953917821756,"score_spread":0.2756777370307673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410416070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027388413,0.01085964,0.9486668,0.007393085,0.00024353359,0.000961341,0.000034005097,0.0002938999,0.0312738],"genre_scores_gemma":[0.055089522,0.02483167,0.9113473,0.005289675,0.00008688902,0.0009438419,0.0004006213,0.00004915767,0.0019612862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986578,0.000055202072,0.00065048836,0.00025303866,0.00015880457,0.00022464457],"domain_scores_gemma":[0.9975996,0.00056731456,0.00051502977,0.0011800064,0.00012089268,0.000017154154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007451009,0.0002347154,0.0003217114,0.00072445883,0.000244956,0.00019720019,0.001686768,0.00032343462,0.0000016551581],"category_scores_gemma":[0.00011676693,0.00019972834,0.000053194515,0.0003490899,0.00019131113,0.0012407601,0.00047341807,0.00082665554,0.0000022006197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013317192,0.000009009898,0.00003566044,0.00003376684,0.0000029903308,4.7742236e-7,0.00024735936,0.00016292489,1.2547834e-7,0.41145957,0.000055407574,0.5879914],"study_design_scores_gemma":[0.00037086426,0.000032461943,0.00007895709,0.00028962924,0.0000037392388,0.000019452398,0.00020377795,0.4182258,0.0000053326075,0.29364032,0.28691566,0.00021402507],"about_ca_topic_score_codex":0.000006770371,"about_ca_topic_score_gemma":0.000078433,"teacher_disagreement_score":0.5877774,"about_ca_system_score_codex":0.00007757448,"about_ca_system_score_gemma":0.00010295693,"threshold_uncertainty_score":0.8144685},"labels":[],"label_agreement":null},{"id":"W4410545814","doi":"10.1007/s10773-025-06014-5","title":"Comments on “Quantum Adder for Superposition States”","year":2025,"lang":"en","type":"article","venue":"International Journal of Theoretical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Superposition principle; Physics; Adder; Quantum; Quantum mechanics; Theoretical physics; Mathematical physics; Mathematics; Optoelectronics","score_opus":0.006580772870637136,"score_gpt":0.2851626989805735,"score_spread":0.2785819261099364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410545814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021495854,0.000017973083,0.9629325,0.013009699,0.001892951,0.000066017164,0.000011719211,0.000017860933,0.0005554055],"genre_scores_gemma":[0.9790537,0.0000071351833,0.017243622,0.0032443313,0.00041988946,0.0000019150118,0.000005049529,0.000005605614,0.000018782452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990787,0.00004976066,0.00026768158,0.00012399015,0.00034931154,0.00013054948],"domain_scores_gemma":[0.99881923,0.00046534353,0.000120971796,0.00013367998,0.00041262314,0.00004813278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002462508,0.00009371685,0.00013382177,0.00008860003,0.00005862315,0.00013574718,0.0009179206,0.000029822148,0.000006342431],"category_scores_gemma":[0.00007784123,0.0000721427,0.00015639477,0.0000958806,0.00008519578,0.0001235092,0.0001257964,0.00019064602,0.000003948349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007968102,0.0001722597,0.000012045677,0.000003763461,0.000095152245,0.000006764343,0.00009670468,0.0047528497,0.0001626772,0.94106567,0.002487851,0.051064584],"study_design_scores_gemma":[0.0004512517,0.000176165,0.000058001984,0.000093799455,0.0000069175762,0.000008505743,0.000005570712,0.3609195,0.0019591341,0.6348529,0.00141839,0.00004990783],"about_ca_topic_score_codex":5.5859863e-7,"about_ca_topic_score_gemma":2.4655362e-8,"teacher_disagreement_score":0.9575578,"about_ca_system_score_codex":0.000051884133,"about_ca_system_score_gemma":0.00004960855,"threshold_uncertainty_score":0.29418936},"labels":[],"label_agreement":null},{"id":"W4410550324","doi":"10.1103/physreva.111.052618","title":"Geodesic algorithm for unitary gate design with time-independent Hamiltonians","year":2025,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Shared Hierarchical Academic Research Computing Network; Compute Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Unitary state; Geodesic; Algorithm; Algebra over a field; Mathematics; Computer science; Pure mathematics; Mathematical analysis","score_opus":0.011428765870277262,"score_gpt":0.31507506724397993,"score_spread":0.3036463013737027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410550324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016180045,0.042149622,0.94753575,0.0047390927,0.00015698088,0.0029147689,0.000025023892,0.0003600803,0.00050065585],"genre_scores_gemma":[0.060414974,0.12329584,0.74779475,0.05827022,0.0028957122,0.00433653,0.00019348839,0.00043835395,0.002360102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955822,0.00056302734,0.0006794536,0.0013768075,0.0008194459,0.0009790137],"domain_scores_gemma":[0.996168,0.0012352002,0.0003303805,0.001563173,0.0003500983,0.00035312542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008800882,0.00076138834,0.0018318618,0.00010590731,0.00034925697,0.00014172436,0.0019569495,0.000053816835,0.0000067663786],"category_scores_gemma":[0.00025575102,0.0005304367,0.00080529955,0.001712764,0.00014755712,0.000311142,0.00051034073,0.0006825124,0.00025182668],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015952864,0.00093656935,0.0000041071944,0.0051943245,0.00022997858,0.000042750195,0.00007741153,0.0007594369,0.001001778,0.014564807,0.008215077,0.9689578],"study_design_scores_gemma":[0.0006053594,0.0006782144,0.0000754467,0.017725674,0.00046065229,0.00002497037,0.0000013233978,0.8998236,0.0018790623,0.045323502,0.032598626,0.0008035875],"about_ca_topic_score_codex":0.000013687833,"about_ca_topic_score_gemma":8.2315773e-7,"teacher_disagreement_score":0.9681542,"about_ca_system_score_codex":0.00010755871,"about_ca_system_score_gemma":0.00037478996,"threshold_uncertainty_score":0.99971473},"labels":[],"label_agreement":null},{"id":"W4410610634","doi":"10.61091/jcmcc126-13","title":"Real-time big data processing using quantum computing to enhance speed and efficiency","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Big data; Quantum computer; Quantum; Computational science; Physics; Data mining; Quantum mechanics","score_opus":0.02070098351518983,"score_gpt":0.29591085378904264,"score_spread":0.2752098702738528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410610634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6608241,0.00036306516,0.32953933,0.0003156942,0.008414454,0.0002650966,0.0000017661641,0.00009277494,0.00018366742],"genre_scores_gemma":[0.9035373,0.00002342172,0.094935164,0.00006306106,0.0014016548,2.3261242e-7,9.991772e-7,0.00003163265,0.000006573452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961354,0.00019758187,0.0015141087,0.0007295511,0.0007842492,0.00063908164],"domain_scores_gemma":[0.99608535,0.0009745996,0.0011703932,0.0008331386,0.00061498693,0.00032155612],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032167512,0.0004660837,0.001084641,0.00054867344,0.00081070565,0.0010373051,0.002104475,0.00017170608,5.938144e-7],"category_scores_gemma":[0.0007344433,0.0004219112,0.000108906956,0.001278264,0.00012654149,0.0003919771,0.0029480443,0.0006489714,0.000001463852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021195205,0.0020784987,0.00038436745,0.0019567448,0.00043473704,0.00023037316,0.011947095,0.008949233,0.033106633,0.6247352,0.0007284595,0.31523675],"study_design_scores_gemma":[0.0012800017,0.00039887085,0.0000795638,0.0015409441,0.00007105904,0.00016778451,0.00011667796,0.8917277,0.0008828482,0.10310507,0.00020816832,0.0004213071],"about_ca_topic_score_codex":0.00003040051,"about_ca_topic_score_gemma":2.1476411e-7,"teacher_disagreement_score":0.88277847,"about_ca_system_score_codex":0.00009588913,"about_ca_system_score_gemma":0.00048471335,"threshold_uncertainty_score":0.9999997},"labels":[],"label_agreement":null},{"id":"W4410632653","doi":"10.22215/etd/2025-16365","title":"Analysis of a Portable, Rb Vapour Based Quantum Memory for use in Quantum Communications","year":2025,"lang":"en","type":"dissertation","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Quantum memory; Quantum; Computer science; Optoelectronics; Physics; Quantum network; Quantum mechanics; Quantum computer","score_opus":0.028973724945903855,"score_gpt":0.29885238176952733,"score_spread":0.2698786568236235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410632653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12555367,0.0008546565,0.86806136,0.0008105405,0.0010861703,0.0012808728,0.00025676706,0.00031872914,0.0017772114],"genre_scores_gemma":[0.69185656,0.00009296964,0.2972423,0.0005109068,0.00004435262,0.00025911612,0.0041351193,0.000054113207,0.005804564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975086,0.0001786235,0.0009183662,0.00068972714,0.0003322601,0.00037246113],"domain_scores_gemma":[0.9950402,0.0015000915,0.00054350484,0.002449228,0.00039165784,0.00007534505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061663316,0.0003473639,0.00093483436,0.0022125053,0.0001641491,0.00015456365,0.0024894797,0.00026359988,0.000013562312],"category_scores_gemma":[0.00022272281,0.00032850495,0.0005730398,0.003511122,0.00003256566,0.00016122247,0.00019570503,0.00041112828,0.000001107765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032671334,0.0031957813,0.005212065,0.002440247,0.005370341,0.000040727464,0.0055340948,0.5756463,0.00059150264,0.2594752,0.0054817605,0.13668528],"study_design_scores_gemma":[0.00037879456,0.00005847493,0.008145961,0.00022867821,0.0004161219,3.0128828e-7,0.0001427662,0.98847437,0.00016099402,0.0011769538,0.0004963005,0.00032031254],"about_ca_topic_score_codex":0.00212509,"about_ca_topic_score_gemma":0.008329764,"teacher_disagreement_score":0.5708191,"about_ca_system_score_codex":0.00004985339,"about_ca_system_score_gemma":0.00065054785,"threshold_uncertainty_score":0.9999167},"labels":[],"label_agreement":null},{"id":"W4410640145","doi":"10.1103/53gd-2374","title":"Lagrangian duality in quantum optimization: Overcoming QUBO limitations for constrained problems","year":2025,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Duality (order theory); Quantum; Mathematical optimization; Lagrangian; Computer science; Augmented Lagrangian method; Mathematics; Physics; Quantum mechanics; Applied mathematics; Combinatorics","score_opus":0.09791758588585439,"score_gpt":0.41142868069439226,"score_spread":0.3135110948085379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410640145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038186545,0.009257499,0.9508291,0.030352999,0.0001743831,0.002397467,0.0000118362495,0.0001446418,0.0030134118],"genre_scores_gemma":[0.8560054,0.004726129,0.13559043,0.0019394597,0.00031275518,0.0009809127,0.000039624683,0.000032433578,0.00037286285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978663,0.00044929414,0.00033054675,0.00047514512,0.00039984516,0.0004788887],"domain_scores_gemma":[0.9967781,0.0022883709,0.00005069425,0.00047633596,0.0003194781,0.00008702486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019803504,0.00012957893,0.00033698982,0.0001910653,0.0002575462,0.00014310944,0.0007404902,0.00003109636,0.0000028540546],"category_scores_gemma":[0.0013786138,0.00010926055,0.00013691492,0.00200862,0.00012240441,0.00015360098,0.00029090088,0.00041484504,0.000008507027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008435668,0.0005404777,0.00006290891,0.0034812475,0.000031989304,0.000006944382,0.00065460074,0.055022825,0.0002560397,0.7743849,0.0022808232,0.16326882],"study_design_scores_gemma":[0.00028287672,0.00007001293,0.00017522865,0.0019483902,0.000004832947,0.0000012373794,0.00001130171,0.9428065,0.000035512396,0.0470342,0.007519296,0.00011065744],"about_ca_topic_score_codex":0.000029432897,"about_ca_topic_score_gemma":0.000014156533,"teacher_disagreement_score":0.88778365,"about_ca_system_score_codex":0.00005721703,"about_ca_system_score_gemma":0.00025795944,"threshold_uncertainty_score":0.4455516},"labels":[],"label_agreement":null},{"id":"W4410791315","doi":"10.21203/rs.3.rs-5022498/v1","title":"Quantum Vision Clustering","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Materials Research; Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; Mississippi State University; Carnegie Mellon University; National Science Foundation; North Dakota State University; Institute for Catastrophic Loss Reduction","keywords":"Cluster analysis; Quantum; Computer science; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.039878902503426655,"score_gpt":0.3838183017472678,"score_spread":0.3439393992438411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410791315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015789917,0.002256783,0.96149206,0.00729182,0.002934953,0.0012241725,0.000055754976,0.0010348968,0.007919656],"genre_scores_gemma":[0.8723413,0.0005351696,0.12054275,0.0003149401,0.0015652572,0.00021804847,0.00007170982,0.00007356436,0.004337263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948849,0.0007804545,0.0004074637,0.0013704153,0.0015297338,0.0010270159],"domain_scores_gemma":[0.9962265,0.0006761494,0.00009978005,0.0022203845,0.0005387533,0.00023842532],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024306686,0.00035227966,0.00042443612,0.00096753275,0.00058792636,0.0010882629,0.0037009933,0.00038624497,0.00001675583],"category_scores_gemma":[0.00027979704,0.0003152688,0.00025395106,0.001070136,0.00012295166,0.00013037764,0.01653023,0.003250375,0.00008885559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044347544,0.000463268,0.00027727985,0.0053695096,0.00014333356,0.00048582107,0.004067749,0.17126773,0.0002486768,0.067851365,0.023682356,0.72609854],"study_design_scores_gemma":[0.00016154251,0.00015505315,0.00094174285,0.002200819,0.0000024720857,0.000008492261,0.000028047134,0.9558647,0.0001045685,0.027799362,0.012424703,0.00030845715],"about_ca_topic_score_codex":0.00024269569,"about_ca_topic_score_gemma":0.000025259842,"teacher_disagreement_score":0.85655135,"about_ca_system_score_codex":0.00019482963,"about_ca_system_score_gemma":0.0007290766,"threshold_uncertainty_score":0.9999487},"labels":[],"label_agreement":null},{"id":"W4410802239","doi":"10.2139/ssrn.5272847","title":"Demonstration of Operational Quantum Unity on Noisy Quantum Hardware: Reproducible Entanglement-Neutral Quantum Structures via Variational Optimization","year":2025,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Quantum Research Center","funders":"","keywords":"Quantum entanglement; Quantum; Quantum sensor; Physics; Quantum mechanics; Computer science; Quantum network","score_opus":0.007579458390860047,"score_gpt":0.24263912682157424,"score_spread":0.23505966843071419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410802239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060280405,0.00040128594,0.9336833,0.0040024356,0.0011052557,0.0002466912,0.0000113063725,0.00009143449,0.00017790167],"genre_scores_gemma":[0.9783613,0.0002060138,0.02047591,0.00032398934,0.00037191328,0.000008367336,0.00005173957,0.000019195439,0.0001815525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962791,0.00035451978,0.00079228776,0.0006719574,0.00064149604,0.0012606266],"domain_scores_gemma":[0.9982804,0.0001702323,0.0004531893,0.0005685689,0.00043317728,0.00009441503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021358912,0.00031338804,0.00032418748,0.00046300422,0.00059725007,0.00024881336,0.00092972646,0.00013361473,0.000018154311],"category_scores_gemma":[0.00015451355,0.0002817288,0.00017625294,0.00081873604,0.00007704795,0.00049235194,0.00014360821,0.0014974907,0.000004087586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045589986,0.00012503663,0.00020801031,0.000009503858,0.00009878087,0.0000018134701,0.00010180886,0.35775086,0.0005445651,0.63619024,0.000116253424,0.0048075705],"study_design_scores_gemma":[0.0005900914,0.00041615707,0.0009563668,0.000039987248,0.000022436703,0.00011940576,0.000061024395,0.66868263,0.0012633388,0.32753333,0.00012473922,0.00019050241],"about_ca_topic_score_codex":0.000101645164,"about_ca_topic_score_gemma":0.00005187567,"teacher_disagreement_score":0.9180809,"about_ca_system_score_codex":0.0005208659,"about_ca_system_score_gemma":0.0030937972,"threshold_uncertainty_score":0.99996346},"labels":[],"label_agreement":null},{"id":"W4410880138","doi":"10.1103/13m1-y3br","title":"Nearest-neighbor synthesis of controlled- <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi mathvariant=\"normal\" mathsize=\"small\">NOT</mml:mi> </mml:math> circuits on general quantum architectures","year":2025,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Nantong University; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; Natural Science Foundation of Nantong City","keywords":"Controlled NOT gate; Electronic circuit; k-nearest neighbors algorithm; Computer science; Quantum; Quantum circuit; Theoretical computer science; Topology (electrical circuits); Quantum computer; Quantum gate; Physics; Mathematics; Quantum network; Artificial intelligence; Quantum mechanics; Combinatorics","score_opus":0.013322463007745542,"score_gpt":0.2770776773553453,"score_spread":0.26375521434759974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410880138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96546465,0.012840039,0.015201411,0.002783259,0.0005143667,0.00050993817,0.000061804756,0.0002771201,0.0023474116],"genre_scores_gemma":[0.98034716,0.010679834,0.0024431462,0.0049285763,0.00084694027,0.0006051581,0.000019223,0.000096970325,0.000032989126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948794,0.0006262032,0.0011826244,0.0012057237,0.0011443526,0.0009617009],"domain_scores_gemma":[0.99407697,0.0027151462,0.00088618725,0.0018222448,0.00014293013,0.0003565359],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001171136,0.00070901815,0.001510081,0.00013109615,0.0003936949,0.000234738,0.0020172056,0.00016296904,0.000014873282],"category_scores_gemma":[0.0022561997,0.0006195252,0.0018202014,0.0009953517,0.00032903146,0.00018123865,0.00092037104,0.000978225,0.00048687917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006055337,0.0005047891,0.0000014752941,0.004699191,0.00023876158,0.000073010255,0.0001217133,0.00040339562,0.0021708368,0.923914,0.00058401446,0.06722822],"study_design_scores_gemma":[0.0006191714,0.00048778567,0.00013715125,0.014075371,0.00058706506,0.00005622965,0.0000051134907,0.9535125,0.010984227,0.014933266,0.004002257,0.0005998577],"about_ca_topic_score_codex":0.00007109072,"about_ca_topic_score_gemma":0.0000052776363,"teacher_disagreement_score":0.9531091,"about_ca_system_score_codex":0.000023639905,"about_ca_system_score_gemma":0.00038809582,"threshold_uncertainty_score":0.9996256},"labels":[],"label_agreement":null},{"id":"W4410900010","doi":"10.21203/rs.3.rs-6770684/v1","title":"Demonstration of Operational Quantum Unity on Noisy Quantum Hardware: Reproducible Entanglement-Neutral Quantum Structures via Variational Optimization","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Quantum Research Center","funders":"","keywords":"Quantum entanglement; Quantum; Quantum mechanics; Computer science; Quantum sensor; Physics; Quantum network","score_opus":0.03940770577673832,"score_gpt":0.342919384121426,"score_spread":0.3035116783446877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410900010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027976949,0.00037289519,0.96097714,0.005133234,0.0020941345,0.0018565762,0.0006281632,0.00031447137,0.0006464174],"genre_scores_gemma":[0.8954754,0.00017143921,0.10081691,0.00019866614,0.0010401199,0.00020975723,0.0016868014,0.000057989393,0.0003429203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99139625,0.0017259731,0.0012010693,0.0021492671,0.0025975402,0.00092991],"domain_scores_gemma":[0.9937699,0.0009485192,0.0005199907,0.002294798,0.0022103835,0.00025643766],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0036211482,0.00061402336,0.00069295475,0.0013586356,0.00081257307,0.0006912842,0.0023492777,0.0005324696,0.00008161059],"category_scores_gemma":[0.0007718572,0.0005861321,0.00032581645,0.0015542485,0.0002571596,0.0003763389,0.002211253,0.0024775025,0.000013373206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006634537,0.0003209235,0.00025942086,0.00042605266,0.00009396307,0.0000123523605,0.0004926241,0.6780019,0.00022804993,0.3163881,0.0012324301,0.0024778682],"study_design_scores_gemma":[0.0005170795,0.000505134,0.0024624744,0.00060958933,0.000018825858,0.000011885555,0.000054513173,0.9224087,0.0024680072,0.0701113,0.00036789515,0.00046459446],"about_ca_topic_score_codex":0.00070352404,"about_ca_topic_score_gemma":0.00003193796,"teacher_disagreement_score":0.86749846,"about_ca_system_score_codex":0.00041596126,"about_ca_system_score_gemma":0.0024419671,"threshold_uncertainty_score":0.9998238},"labels":[],"label_agreement":null},{"id":"W4410949594","doi":"10.1109/comst.2025.3575842","title":"Toward Quantum-Native Communication Systems: State-of-the-Art, Trends, and Challenges","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"State (computer science); Computer science; Telecommunications; Programming language","score_opus":0.0587717187250496,"score_gpt":0.2973940706600837,"score_spread":0.23862235193503412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410949594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054753717,0.20880947,0.57739663,0.117062114,0.01984592,0.0028640076,0.000314052,0.0014206601,0.017533401],"genre_scores_gemma":[0.98172903,0.0070802695,0.010486448,0.000053689495,0.000055502824,0.00007016409,0.000012189653,0.000014371328,0.00049834646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935437,0.0049222833,0.0006625253,0.00034787154,0.00027887258,0.00024473976],"domain_scores_gemma":[0.99223477,0.0025766327,0.00043146318,0.00432395,0.00037440978,0.000058798905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040432895,0.00021767961,0.00042884098,0.00028010053,0.00054872344,0.00018186348,0.0042152395,0.00008742645,9.541576e-7],"category_scores_gemma":[0.0003130635,0.00017618299,0.00010164509,0.0010102413,0.00045565557,0.00023679019,0.0016042874,0.0003492378,0.0000044102853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009715981,0.00040129112,0.00039868752,0.00019603118,0.00028986557,8.7481163e-7,0.009551613,0.004421312,0.00045700825,0.5427463,0.00455002,0.43697727],"study_design_scores_gemma":[0.0021232187,0.00023999249,0.06808724,0.0017198947,0.00012719832,0.000033815013,0.0006281108,0.5716519,0.002026895,0.069170855,0.2829471,0.0012438108],"about_ca_topic_score_codex":0.00033157968,"about_ca_topic_score_gemma":0.00016779914,"teacher_disagreement_score":0.9269753,"about_ca_system_score_codex":0.000059560825,"about_ca_system_score_gemma":0.00017150323,"threshold_uncertainty_score":0.7833034},"labels":[],"label_agreement":null},{"id":"W4411067281","doi":"10.22331/q-2025-06-05-1766","title":"Stabilizer codes for Heisenberg-limited many-body Hamiltonian estimation","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"","keywords":"Stabilizer (aeronautics); Hamiltonian (control theory); Mathematics; Physics; Mathematical optimization; Engineering; Structural engineering","score_opus":0.009899505747146316,"score_gpt":0.2677909575904924,"score_spread":0.25789145184334605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411067281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095139846,0.00014045047,0.8989403,0.0036508995,0.0008746695,0.00036088942,0.0000114599925,0.00042038,0.0004610883],"genre_scores_gemma":[0.8144282,0.0000064963706,0.18415847,0.0006857164,0.00008017649,0.000048900773,0.000017854089,0.000016046719,0.0005580971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985059,0.000067663415,0.00031150898,0.00051643595,0.00019276669,0.00040573545],"domain_scores_gemma":[0.99871993,0.00034939384,0.000092651455,0.0006433119,0.00011806191,0.000076627475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033592802,0.00020544512,0.00024531814,0.00020262664,0.0003202592,0.00022588676,0.0007146217,0.00008697281,0.000005200372],"category_scores_gemma":[0.00013393618,0.00018250379,0.00012554825,0.00053387025,0.000059118727,0.000170434,0.00020127908,0.00015860438,0.000020428819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023464892,0.00013346905,0.00019492346,0.00012285601,0.000052702802,0.000007328466,0.0004632487,0.009043512,0.001386786,0.86427134,0.004538822,0.11976157],"study_design_scores_gemma":[0.0004421575,0.000101932426,0.0025299264,0.000074366784,0.000011298208,0.0000051631114,0.000015165953,0.92880905,0.0013217081,0.05447956,0.0120128,0.00019686468],"about_ca_topic_score_codex":0.000022621447,"about_ca_topic_score_gemma":0.000004087359,"teacher_disagreement_score":0.91976553,"about_ca_system_score_codex":0.00004372319,"about_ca_system_score_gemma":0.00011029268,"threshold_uncertainty_score":0.74422884},"labels":[],"label_agreement":null},{"id":"W4411225517","doi":"10.1017/9781009504942.009","title":"Deep learning for quantum sciences: Selected topics","year":2025,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Waterloo; McMaster University","funders":"","keywords":"Computer science; Psychology; Mathematics education","score_opus":0.016175617235372825,"score_gpt":0.20918275440427164,"score_spread":0.1930071371688988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411225517","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021781068,0.00014695631,0.43082002,0.00007211344,0.00039522853,0.00030549784,0.000011820777,0.00033604828,0.5678905],"genre_scores_gemma":[0.00023652488,0.00003206347,0.014799181,0.000096789016,0.00020035464,0.0000010138637,0.000017199918,0.000019779414,0.9845971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99817175,0.000052855004,0.0002000575,0.00085346797,0.00027861915,0.00044325241],"domain_scores_gemma":[0.99864113,0.0002440401,0.0002201487,0.00048228962,0.0002931502,0.00011925846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018355275,0.0003650493,0.0003942913,0.00031169478,0.0008268164,0.00019218406,0.0017118661,0.00029028463,5.8148834e-7],"category_scores_gemma":[0.000045089404,0.00040217786,0.00022441418,0.000055617296,0.00020662858,0.00009130039,0.0008553904,0.00063550024,0.0000023948946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000989728,0.000005492475,7.8635367e-7,0.00008738124,0.000057054127,0.000041301788,0.00006808439,0.0007105153,0.000008309472,0.96540886,0.0051423353,0.028459962],"study_design_scores_gemma":[0.00025046075,0.00011595758,0.0000035440032,0.00014604107,0.00003861826,0.000008904403,0.0000053676104,0.39977178,0.000054170712,0.00014941934,0.599139,0.000316774],"about_ca_topic_score_codex":0.000033753087,"about_ca_topic_score_gemma":0.0000012902465,"teacher_disagreement_score":0.96525943,"about_ca_system_score_codex":0.00010945516,"about_ca_system_score_gemma":0.00031612677,"threshold_uncertainty_score":0.999843},"labels":[],"label_agreement":null},{"id":"W4411347945","doi":"10.1038/s41585-025-01058-y","title":"Quantum computing in surgery and urology — taking a quantum leap","year":2025,"lang":"en","type":"review","venue":"Nature Reviews Urology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Thomas Hospital","funders":"","keywords":"Medicine; Urology; General surgery","score_opus":0.031024043231854714,"score_gpt":0.33047240448074733,"score_spread":0.2994483612488926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411347945","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000111442505,0.9759551,0.018622626,0.00087173306,0.0029652468,0.0011820644,0.000007659827,0.00023516029,0.00014925971],"genre_scores_gemma":[0.00018416095,0.9938396,0.0032479018,0.0021057462,0.00045397267,0.00006283728,0.000031090425,0.00005447725,0.000020189933],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99080855,0.003209792,0.0022395435,0.00215883,0.00028614327,0.001297169],"domain_scores_gemma":[0.99029785,0.0061582616,0.0018317929,0.0014496562,0.00007744982,0.00018497449],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0036223365,0.0011671257,0.0062049613,0.0016916494,0.00024503894,0.00016104119,0.0020911093,0.0022962482,0.0000078377225],"category_scores_gemma":[0.002300842,0.0009165392,0.0010004067,0.0024591906,0.00019317154,0.00012840447,0.0017156092,0.005771118,0.00003780808],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002609378,0.000042822372,0.000018861028,0.011496131,0.000046302677,0.00022208181,0.000060976825,0.000026094338,6.399028e-8,0.0146597335,0.0009861581,0.97243816],"study_design_scores_gemma":[0.00012940553,0.00008068046,0.000028803031,0.007468133,0.00018357279,0.0011075664,7.278702e-7,0.041293163,2.49676e-8,0.00143335,0.947589,0.00068557373],"about_ca_topic_score_codex":0.000019624951,"about_ca_topic_score_gemma":0.00001999066,"teacher_disagreement_score":0.9717526,"about_ca_system_score_codex":0.00008281154,"about_ca_system_score_gemma":0.0006477781,"threshold_uncertainty_score":0.9993285},"labels":[],"label_agreement":null},{"id":"W4411366718","doi":"10.1021/acs.jctc.5c00345","title":"Optimization of the Qubit Coupled Cluster Ansatz on Classical Computers","year":2025,"lang":"en","type":"article","venue":"Journal of Chemical Theory and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"OTI Lumionics (Canada)","funders":"","keywords":"Ansatz; Qubit; Computer science; Quantum computer; Quantum; Coupled cluster; Quantum algorithm; Topology (electrical circuits); Algorithm; Physics; Mathematics; Quantum mechanics","score_opus":0.005220229237358431,"score_gpt":0.23701593855504619,"score_spread":0.23179570931768775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411366718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25206798,0.000048938502,0.74558324,0.0017982268,0.00035082625,0.000052783616,2.7927436e-7,0.000010404807,0.00008730936],"genre_scores_gemma":[0.9677605,0.00000363562,0.031401172,0.0007436815,0.00007335425,3.8521506e-7,4.2949534e-7,0.0000033139459,0.000013530951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989881,0.00021866425,0.00035534965,0.00012733294,0.00021616221,0.00009441122],"domain_scores_gemma":[0.99862754,0.00078962883,0.00028648827,0.00012271781,0.00013314412,0.000040494113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057829404,0.00009411264,0.00019189136,0.00008777539,0.00006455337,0.000053624884,0.00036566742,0.000057975867,9.745486e-7],"category_scores_gemma":[0.00010099179,0.00005972356,0.00010427661,0.00027801807,0.00009809631,0.00009084269,0.00012579837,0.00024629495,1.9305018e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019689494,0.00012781442,0.000032879383,0.000034707522,0.000053246204,0.0000022575157,0.0003952345,0.85859656,0.0023087433,0.081119455,0.00031234694,0.056819882],"study_design_scores_gemma":[0.0006114285,0.0000977987,0.00022059109,0.00018675545,0.000014635241,0.000029112929,0.000010758548,0.94035804,0.0043296292,0.05403598,0.00004696054,0.000058333146],"about_ca_topic_score_codex":2.5764828e-7,"about_ca_topic_score_gemma":1.8646002e-8,"teacher_disagreement_score":0.7156925,"about_ca_system_score_codex":0.000020459729,"about_ca_system_score_gemma":0.00005262436,"threshold_uncertainty_score":0.2435456},"labels":[],"label_agreement":null},{"id":"W4411378131","doi":"10.22331/q-2025-06-17-1771","title":"Exact, Average, and Broken Symmetries in a Simple Adaptive Monitored Circuit","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Government of Canada","keywords":"Simple (philosophy); Homogeneous space; Computer science; Mathematics; Theoretical physics; Statistical physics; Physics; Calculus (dental); Applied mathematics; Geometry; Philosophy; Epistemology; Medicine","score_opus":0.01192601544239207,"score_gpt":0.2438083785252083,"score_spread":0.23188236308281623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411378131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6159894,0.001154889,0.37868384,0.0011648784,0.0005750034,0.00025381334,0.0000064201085,0.00024448367,0.0019272974],"genre_scores_gemma":[0.9962612,0.000025337202,0.0031551777,0.0003394076,0.000049283874,0.000009060661,0.0000013377576,0.000007388451,0.00015183465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870414,0.00008962566,0.00023130837,0.0004576018,0.00017065935,0.00034667164],"domain_scores_gemma":[0.99914217,0.000301674,0.000056446017,0.00037726338,0.000053937998,0.00006851529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024935981,0.00016980655,0.00023895189,0.00034729502,0.000145774,0.00017545967,0.00049287366,0.000069693946,0.0000019607658],"category_scores_gemma":[0.000105282874,0.00015607824,0.000045271205,0.00090526306,0.000066553446,0.00016867476,0.00035226473,0.00025683784,0.0000071729987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034696423,0.00019529506,0.011582688,0.00009623752,0.000074947784,0.0002001738,0.0035480983,0.0023666027,0.0003878496,0.5837079,0.0024020192,0.39540347],"study_design_scores_gemma":[0.00056172756,0.00012935812,0.04389816,0.0000945557,0.0000042743723,0.00001425197,0.00009669781,0.8342941,0.00047657348,0.11724767,0.0029362538,0.0002463715],"about_ca_topic_score_codex":0.0002719978,"about_ca_topic_score_gemma":0.000017526216,"teacher_disagreement_score":0.8319275,"about_ca_system_score_codex":0.000036803754,"about_ca_system_score_gemma":0.000084790845,"threshold_uncertainty_score":0.6364686},"labels":[],"label_agreement":null},{"id":"W4411419162","doi":"10.22331/q-2025-06-18-1776","title":"Modular quantum signal processing in many variables","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Science; National Science Foundation","keywords":"Computer science; Modular design; Algorithm; Quantum; Python (programming language); Theoretical computer science; Algebra over a field; Programming language; Mathematics; Pure mathematics","score_opus":0.008649323933209841,"score_gpt":0.24112355330799237,"score_spread":0.23247422937478254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411419162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13804911,0.00097637484,0.85712975,0.0017405091,0.00044960063,0.0001613083,0.0000015083634,0.00031968215,0.0011721276],"genre_scores_gemma":[0.97464585,0.000010236899,0.024508204,0.00052216044,0.0000852594,0.000014483121,0.0000020509513,0.000013549183,0.00019820369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798447,0.00011723354,0.00039961864,0.00064601516,0.00028572086,0.0005669285],"domain_scores_gemma":[0.99916637,0.00009584722,0.00009510229,0.0004992679,0.00006611453,0.00007727821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005464512,0.00024167588,0.00030222684,0.00039114885,0.00022439445,0.0002828719,0.0011235515,0.000110234636,0.000009635836],"category_scores_gemma":[0.000033355213,0.00021955051,0.00007982955,0.0012573708,0.00006047245,0.00027456562,0.0003882799,0.00039357733,0.000022208847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015656762,0.00025547092,0.001059336,0.0001821808,0.000017946297,0.00015537563,0.00092053204,0.026310038,0.0035445436,0.74611175,0.0006987031,0.22072847],"study_design_scores_gemma":[0.00032262126,0.00004761268,0.004214655,0.00024828676,0.0000040855366,0.000012751088,0.000029383014,0.88737196,0.0002968788,0.10385226,0.0033740452,0.0002254412],"about_ca_topic_score_codex":0.000094186275,"about_ca_topic_score_gemma":0.0000058275177,"teacher_disagreement_score":0.86106193,"about_ca_system_score_codex":0.000054970533,"about_ca_system_score_gemma":0.00023455854,"threshold_uncertainty_score":0.895301},"labels":[],"label_agreement":null},{"id":"W4411486522","doi":"10.1145/3695053.3730992","title":"Accelerating Simulation of Quantum Circuits under Noise via Computational Reuse","year":2025,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Lawrence Berkeley National Laboratory; National Research Council Canada; Natural Sciences and Engineering Research Council of Canada; National Energy Research Scientific Computing Center; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Computer science; Reuse; Electronic circuit; Quantum computer; Noise (video); Electronic engineering; Quantum; Electrical engineering; Physics; Engineering; Quantum mechanics; Artificial intelligence","score_opus":0.02138461015922759,"score_gpt":0.27989553163722647,"score_spread":0.25851092147799887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411486522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09993511,0.000032215445,0.8975433,0.0010087847,0.0002492795,0.000093509254,8.327563e-7,0.00015145539,0.0009855069],"genre_scores_gemma":[0.91928804,4.1616107e-7,0.080085516,0.000494052,0.000031926633,0.0000015433998,0.00000309506,0.000004598776,0.00009080871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890894,0.000059142243,0.00032405797,0.00029899972,0.0002332573,0.00017558967],"domain_scores_gemma":[0.99879956,0.00044109797,0.00010694694,0.00044961562,0.00016373555,0.000039028317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020444779,0.000115946386,0.00015763396,0.00017226141,0.00015018498,0.000089067165,0.00069684174,0.00004997834,0.000010420949],"category_scores_gemma":[0.00007022114,0.000103747916,0.000062668354,0.00057961384,0.00003212363,0.00017352945,0.0003545614,0.0001224283,0.0000066448492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.534832e-7,0.000037537728,0.00014830288,0.000014871955,0.000012802062,9.244346e-7,0.00018441588,0.8803086,0.0004213365,0.084724925,0.00008536804,0.034059912],"study_design_scores_gemma":[0.00022021988,0.000027240605,0.0062249084,0.000035895846,0.000003121917,0.0000020262055,0.000008809152,0.9082806,0.00040210123,0.084644094,0.000054906548,0.00009607075],"about_ca_topic_score_codex":0.00002607761,"about_ca_topic_score_gemma":0.0000014367162,"teacher_disagreement_score":0.8193529,"about_ca_system_score_codex":0.000021684855,"about_ca_system_score_gemma":0.00009716875,"threshold_uncertainty_score":0.42307174},"labels":[],"label_agreement":null},{"id":"W4411498941","doi":"10.3390/electronics14132503","title":"Optimal Control-Based Grover’s Algorithm for a Six-Jointed Articulated Robotic Arm","year":2025,"lang":"en","type":"article","venue":"Electronics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Speedup; Quantum algorithm; Oracle; Algorithm; Embedding; Realization (probability); Quantum; Scalability; Quantum computer; Controller (irrigation); Mathematics; Parallel computing; Artificial intelligence","score_opus":0.005183173316557303,"score_gpt":0.2309865317798242,"score_spread":0.2258033584632669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411498941","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048375954,0.0016561757,0.9888876,0.0031412041,0.00047348993,0.0004814605,0.000004321466,0.0004399801,0.00007814232],"genre_scores_gemma":[0.43016312,0.00001682389,0.5658778,0.0031768852,0.00016438836,0.000084415005,0.000023595469,0.00003701503,0.0004559917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796695,0.00007802666,0.0003298281,0.0005740396,0.00021445948,0.00083668245],"domain_scores_gemma":[0.99874777,0.00034216075,0.00010674247,0.00054051593,0.00016554454,0.000097290154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003378922,0.00026302022,0.0003405428,0.00018108643,0.00026606428,0.00019556601,0.00072622346,0.00010952481,0.000004426218],"category_scores_gemma":[0.00008431364,0.00024247504,0.00020906838,0.0007032242,0.00004497515,0.00009539472,0.000095884665,0.00036212514,0.000009131973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004749816,0.0003695457,0.000013519061,0.000038512193,0.00019010104,0.000019372583,0.00007870081,0.6442963,0.0013360053,0.023766546,0.0019400009,0.3279039],"study_design_scores_gemma":[0.0020712002,0.00053583103,0.000069558795,0.000044847086,0.000036973262,0.000010774497,0.0000022724041,0.97953236,0.0038629076,0.003555076,0.010020901,0.0002573027],"about_ca_topic_score_codex":0.000005158102,"about_ca_topic_score_gemma":0.00000705123,"teacher_disagreement_score":0.4253255,"about_ca_system_score_codex":0.00014333992,"about_ca_system_score_gemma":0.0005268147,"threshold_uncertainty_score":0.9887845},"labels":[],"label_agreement":null},{"id":"W4411503728","doi":"10.22399/ijcesen.2484","title":"Exploring the Synergy Between Neuro-Inspired Algorithms and Quantum Computing in Machine Learning","year":2025,"lang":"en","type":"article","venue":"International Journal of Computational and Experimental Science and Engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Quantum machine learning; Artificial intelligence; Quantum computer; Deep learning; Artificial neural network; Scalability; Quantum; Machine learning; Algorithm","score_opus":0.016336792221811627,"score_gpt":0.2584388824207557,"score_spread":0.24210209019894408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411503728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9031187,0.00069562346,0.09396138,0.0016838916,0.0004751256,0.000031400705,4.8733244e-7,0.000016988231,0.00001637776],"genre_scores_gemma":[0.99008507,0.000049209317,0.00962566,0.0001387625,0.000095034506,0.0000010160323,4.2272717e-7,0.0000032101166,0.0000016086373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989442,0.00002303263,0.00027329332,0.00018478447,0.00041978114,0.00015489184],"domain_scores_gemma":[0.9993889,0.000310309,0.00008363204,0.000039687064,0.000109443354,0.00006806249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058275566,0.000103832135,0.00013116085,0.00035905928,0.00019957528,0.0002386446,0.0004200696,0.000012834406,2.3004296e-7],"category_scores_gemma":[0.00007863228,0.00007817633,0.000022184542,0.00030609698,0.00010167063,0.0005398759,0.00038788008,0.00022168808,1.0708525e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016568374,0.000046678622,0.0073739216,0.000014170233,0.000058502803,0.00005337417,0.0035571742,0.75423056,0.0059934887,0.021839906,0.000006189829,0.20680945],"study_design_scores_gemma":[0.00032182704,0.000056642297,0.056462593,0.00009823205,0.0000015681463,0.00013189876,0.00012379781,0.9407327,0.0008802934,0.00086026546,0.0002514641,0.0000786876],"about_ca_topic_score_codex":0.00003421877,"about_ca_topic_score_gemma":4.109545e-7,"teacher_disagreement_score":0.20673077,"about_ca_system_score_codex":0.000044571912,"about_ca_system_score_gemma":0.000052616633,"threshold_uncertainty_score":0.3187938},"labels":[],"label_agreement":null},{"id":"W4411506906","doi":"10.1007/978-3-031-95761-1_13","title":"Quantum-Safe Public Key Blinding from MPC-in-the-Head Signature Schemes","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; National Research Council Canada","funders":"","keywords":"Blinding; Computer science; Signature (topology); Key (lock); Head (geology); Public-key cryptography; Quantum; Scheme (mathematics); Theoretical computer science; Computer security; Mathematics; Medicine; Quantum mechanics; Physics; Surgery","score_opus":0.02033876263979523,"score_gpt":0.25705294278295904,"score_spread":0.2367141801431638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411506906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010941607,0.0023726502,0.98153013,0.007478423,0.0041011935,0.00057090865,0.000021505919,0.00026960648,0.0025614433],"genre_scores_gemma":[0.50741434,0.00011085277,0.4810002,0.008444447,0.0024512217,0.000026045116,0.00004127249,0.00007896009,0.00043261278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929694,0.00017694221,0.000940439,0.0027100006,0.0018177045,0.0013855359],"domain_scores_gemma":[0.9941806,0.0023167653,0.0004386384,0.0025787614,0.00027103277,0.00021416438],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018818529,0.0009987189,0.00093619875,0.001914404,0.00066301995,0.0019288043,0.009993664,0.0007405325,0.000019182127],"category_scores_gemma":[0.0003425043,0.0007688256,0.00027105646,0.0023303402,0.00074198155,0.0005406643,0.002644659,0.003470505,0.000036189],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073204124,0.00008423659,0.00012511881,0.000050333732,0.000027886832,0.00032699434,0.002044037,0.015931671,0.00010204192,0.08122436,0.00015975426,0.89991623],"study_design_scores_gemma":[0.0004189312,0.00014894827,0.00021257479,0.0010435164,0.000010308292,0.00005418641,8.686802e-7,0.7478083,0.00022724898,0.23476167,0.014420327,0.0008931239],"about_ca_topic_score_codex":0.000100113575,"about_ca_topic_score_gemma":0.000287088,"teacher_disagreement_score":0.8990231,"about_ca_system_score_codex":0.00031079416,"about_ca_system_score_gemma":0.0012409089,"threshold_uncertainty_score":0.99947625},"labels":[],"label_agreement":null},{"id":"W4411644012","doi":"10.1103/5bby-34zx","title":"Lattice gas automata with floating-point numbers: A connection between molecular dynamics and lattice Boltzmann method for quantum computers","year":2025,"lang":"en","type":"article","venue":"Physical review. E","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quanser (Canada)","funders":"Aix-Marseille Université","keywords":"Lattice gas automaton; Lattice Boltzmann methods; HPP model; Cellular automaton; Lattice (music); Statistical physics; Particle in a one-dimensional lattice; Condensed matter physics; Quantum; Physics; Materials science; Computer science; Mechanics; Quantum mechanics; Lattice field theory; Algorithm; Stochastic cellular automaton; Acoustics","score_opus":0.010295759611739536,"score_gpt":0.31877858440952983,"score_spread":0.3084828247977903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411644012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035381854,0.0009027643,0.95460546,0.007863845,0.00014806351,0.0006447373,0.000010398388,0.00025519787,0.00018767422],"genre_scores_gemma":[0.15475298,0.0001822211,0.8414652,0.0032248916,0.00021932583,0.00005593442,0.000031903324,0.000037943606,0.0000296431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810994,0.00024045716,0.00032326847,0.0006971342,0.00025335525,0.0003758239],"domain_scores_gemma":[0.997704,0.0012642514,0.00018471286,0.0005808857,0.00013866248,0.00012748736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006272138,0.00028884623,0.00061218144,0.00007162562,0.00021239714,0.00016790866,0.0005566696,0.000042963948,3.904397e-7],"category_scores_gemma":[0.00019723925,0.00023170294,0.0001518501,0.0006100744,0.00006350837,0.00018769267,0.00034096855,0.00028477501,0.00000448215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018426192,0.00019413084,0.00015169366,0.0028480086,0.000259898,0.000017170953,0.0005173801,0.0017176567,0.00018168346,0.5171747,0.0006894013,0.47622982],"study_design_scores_gemma":[0.00045350372,0.00023013735,0.00028094047,0.0016163934,0.00015767917,0.000016825697,0.000010015207,0.9489621,0.00027984878,0.046311475,0.0014124858,0.00026858234],"about_ca_topic_score_codex":0.000051185645,"about_ca_topic_score_gemma":0.000005276552,"teacher_disagreement_score":0.94724447,"about_ca_system_score_codex":0.00006418524,"about_ca_system_score_gemma":0.000090383815,"threshold_uncertainty_score":0.9448572},"labels":[],"label_agreement":null},{"id":"W4411787615","doi":"10.1007/s00023-025-01597-5","title":"Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding","year":2025,"lang":"en","type":"article","venue":"Annales Henri Poincaré","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Canadian Institute for Advanced Research; Simons Foundation; U.S. Department of Energy","keywords":"Decoding methods; Quantum; Quantum channel; Computer science; Computer network; Physics; Telecommunications; Quantum mechanics; Quantum information","score_opus":0.013054099342807142,"score_gpt":0.2532446488003448,"score_spread":0.24019054945753768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411787615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13091084,0.0014356853,0.8552086,0.009128891,0.0004802991,0.00034481392,0.000004557259,0.00043096536,0.0020553828],"genre_scores_gemma":[0.9432722,0.00019530008,0.054532334,0.0013798324,0.00016436218,0.000037235506,0.00001814416,0.00003308964,0.0003675104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976457,0.00017815043,0.00042518042,0.00072581286,0.00038012076,0.0006450549],"domain_scores_gemma":[0.9976453,0.00039699042,0.00018218822,0.0013817762,0.0002212689,0.0001724589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054847857,0.00038071116,0.00041857778,0.0003248999,0.00066537363,0.00039012823,0.0018425465,0.00015933992,0.000009370436],"category_scores_gemma":[0.000044178843,0.00031267785,0.00015945718,0.0009663261,0.00022561266,0.0003981255,0.0007589751,0.00068389485,0.000059809834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017642064,0.000670542,0.0029956403,0.00025782973,0.00038803954,0.00019882935,0.005809949,0.0081305895,0.00074116135,0.4361704,0.032947693,0.5115129],"study_design_scores_gemma":[0.0005583694,0.00021997465,0.0034760255,0.0004756783,0.000018291877,0.000053110474,0.00007485053,0.95626503,0.00040541557,0.02116017,0.016879361,0.00041370664],"about_ca_topic_score_codex":0.00016935068,"about_ca_topic_score_gemma":0.000115014496,"teacher_disagreement_score":0.9481345,"about_ca_system_score_codex":0.00006607379,"about_ca_system_score_gemma":0.00024282293,"threshold_uncertainty_score":0.9999325},"labels":[],"label_agreement":null},{"id":"W4411906390","doi":"10.15408/inprime.v7i1.44960","title":"Error-Resilient Quantum Machine Learning for Real-World Optimization Problems in Finance and Supply Chain Networks","year":2025,"lang":"en","type":"article","venue":"InPrime Indonesian Journal of Pure and Applied Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Supply chain; Computer science; Quantum; Chain (unit); Artificial intelligence; Machine learning; Business; Physics; Quantum mechanics","score_opus":0.008635387160241583,"score_gpt":0.23643955451793025,"score_spread":0.22780416735768866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411906390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08252204,0.00065226405,0.9155761,0.00068656466,0.0000996991,0.00031914844,9.089874e-7,0.000022527833,0.00012076134],"genre_scores_gemma":[0.77473086,0.00021203012,0.22484635,0.000067748275,0.000065973116,0.000011100998,0.0000018493938,0.0000132505775,0.00005083767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998766,0.000035094818,0.0005913356,0.000212156,0.00014915795,0.00024622487],"domain_scores_gemma":[0.9990398,0.00026672738,0.00042411243,0.00015207847,0.00005956879,0.000057657897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007881171,0.00018100567,0.0003914522,0.00031457123,0.0001443095,0.0001314163,0.00029932207,0.00008267943,5.823796e-7],"category_scores_gemma":[0.000025375866,0.00014830784,0.000045341316,0.00042857783,0.000047006768,0.00009322506,0.00012416723,0.00041733866,1.0849641e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002086765,0.00010639514,0.0009450963,0.00022338262,0.000024111512,0.000007684495,0.0012509144,0.9189415,0.00009832966,0.05757045,0.00005982934,0.020751433],"study_design_scores_gemma":[0.0008824968,0.000109295404,0.00085471076,0.00043198504,0.000015921813,0.00004078263,0.00005917923,0.98376113,0.00009954759,0.013427677,0.00017217653,0.00014512551],"about_ca_topic_score_codex":0.0000039526517,"about_ca_topic_score_gemma":0.0000113678325,"teacher_disagreement_score":0.6922088,"about_ca_system_score_codex":0.000022262973,"about_ca_system_score_gemma":0.000056632645,"threshold_uncertainty_score":0.6047818},"labels":[],"label_agreement":null},{"id":"W4411932352","doi":"10.1007/s00220-025-05358-7","title":"Quantum Differential Equation Solvers: Limitations and Fast-Forwarding","year":2025,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Advanced Scientific Computing Research; Army Research Office; Simons Foundation; U.S. Department of Defense; National Science Foundation","keywords":"Quantum; Complex system; Differential equation; Nonlinear system; Computer science; Mathematics; Applied mathematics; Physics; Mathematical analysis; Quantum mechanics; Artificial intelligence","score_opus":0.0622075130950493,"score_gpt":0.306902184257162,"score_spread":0.2446946711621127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411932352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0118877515,0.000113667855,0.9815973,0.0026755834,0.00007131478,0.0001571717,0.0000012267145,0.00010620581,0.0033897934],"genre_scores_gemma":[0.80337954,0.000051670013,0.19639261,0.00008747314,0.00001652351,0.000026750397,0.000005436142,0.0000052626815,0.000034719622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990996,0.00011412738,0.00028221388,0.0002060904,0.00012545446,0.00017249533],"domain_scores_gemma":[0.9975201,0.0011159859,0.000065610126,0.0012067561,0.000055046843,0.00003652354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020772783,0.00011472178,0.00017678273,0.0001106657,0.0002785529,0.00016844523,0.0010591422,0.000045791614,0.0000012810251],"category_scores_gemma":[0.00019066228,0.00010876259,0.00005085628,0.0005540438,0.00013977352,0.00020168678,0.000978796,0.0002694536,0.000012250063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.045777e-7,0.00013492546,0.00003501637,0.00002707192,0.000010430677,1.8903371e-7,0.0011437328,0.000645458,0.000086406646,0.918162,0.00003735455,0.07971675],"study_design_scores_gemma":[0.00010619372,0.000008852335,0.0003104899,0.000079873455,0.000005457607,6.083944e-7,0.000059974187,0.55997944,0.00002916881,0.439278,0.00008259357,0.000059320584],"about_ca_topic_score_codex":0.0000031307857,"about_ca_topic_score_gemma":0.0000028256989,"teacher_disagreement_score":0.7914918,"about_ca_system_score_codex":0.00003320402,"about_ca_system_score_gemma":0.000041869152,"threshold_uncertainty_score":0.443521},"labels":[],"label_agreement":null},{"id":"W4412014509","doi":"10.1017/jsl.2025.10100","title":"QUANTUM EXPANDERS AND QUANTIFIER REDUCTION FOR TRACIAL VONNEUMANN ALGEBRAS","year":2025,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Mathematics; Quantifier (linguistics); Reduction (mathematics); Von Neumann architecture; Pure mathematics; Quantifier elimination; Discrete mathematics; Mathematical economics; Philosophy; Epistemology","score_opus":0.015309973849526108,"score_gpt":0.2738600935505323,"score_spread":0.2585501197010062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412014509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5501309,0.0006939459,0.4430475,0.0042430726,0.0016504586,0.000108494736,7.142084e-7,0.000031734642,0.00009314495],"genre_scores_gemma":[0.98159045,0.00006240876,0.017601091,0.0002698555,0.00039213029,0.0000024546534,3.4013533e-7,0.00000568649,0.00007557835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893534,0.000057798727,0.00040028346,0.00021270863,0.00016955186,0.00022431524],"domain_scores_gemma":[0.99923205,0.00012329304,0.00024986296,0.00017043506,0.00014864076,0.000075685246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054721767,0.00012987554,0.00027661675,0.00027399976,0.00020269305,0.0001490682,0.00040775674,0.00007844484,0.0000017096563],"category_scores_gemma":[0.00008955846,0.000097488344,0.00013830021,0.0002712031,0.000066811364,0.0002132126,0.00007562097,0.00023062319,9.603646e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015256573,0.00032462462,0.00040354446,0.00018924965,0.00024863184,0.00005129768,0.005086619,0.0027240303,0.016307205,0.6134876,0.0064952956,0.35452932],"study_design_scores_gemma":[0.0025642908,0.00092772796,0.011583994,0.00032358037,0.000087953595,0.0012339907,0.00061300665,0.26961333,0.002989752,0.7050729,0.004518393,0.0004710949],"about_ca_topic_score_codex":0.0000053699337,"about_ca_topic_score_gemma":7.8115784e-7,"teacher_disagreement_score":0.43145952,"about_ca_system_score_codex":0.000023810091,"about_ca_system_score_gemma":0.00010841874,"threshold_uncertainty_score":0.3975459},"labels":[],"label_agreement":null},{"id":"W4412037450","doi":"10.18280/isi.300516","title":"Quantum-Resistant Identity Management via ZK-STARKs and Decentralized Storage","year":2025,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Identity (music); Quantum; Chemistry; Physics; Philosophy; Aesthetics; Quantum mechanics","score_opus":0.009474582804585678,"score_gpt":0.2387079921129651,"score_spread":0.2292334093083794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412037450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11433109,0.006130905,0.86946994,0.001132791,0.0032689103,0.0005838146,0.000028736737,0.00023746227,0.0048163254],"genre_scores_gemma":[0.96250534,0.0009087767,0.034121305,0.00087240705,0.000096414624,0.000036301924,0.000044965545,0.000016589232,0.0013978729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973275,0.00020543883,0.00092919235,0.00037021865,0.00047007934,0.0006975381],"domain_scores_gemma":[0.9985142,0.00011300258,0.00037925685,0.0005658618,0.00025217657,0.0001755378],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00093769137,0.00038456323,0.00039488453,0.00048025273,0.0007840491,0.0021671865,0.00068718015,0.0001923711,0.000038121547],"category_scores_gemma":[0.00009148153,0.00040120762,0.00012985154,0.0011515378,0.00033727946,0.0047071874,0.0007440476,0.0003335515,0.00006433539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064620726,0.00007206957,0.00025221478,0.002289313,0.00019678636,0.000049948507,0.0072804857,0.004649729,0.000041763265,0.4318614,0.0017670162,0.55147463],"study_design_scores_gemma":[0.0009639925,0.00010353423,0.0122527145,0.001363311,0.00008005268,0.000057477446,0.0004148189,0.8318678,0.000074709205,0.092666164,0.059727706,0.00042769924],"about_ca_topic_score_codex":0.00048220583,"about_ca_topic_score_gemma":0.00003398562,"teacher_disagreement_score":0.8481743,"about_ca_system_score_codex":0.00038290684,"about_ca_system_score_gemma":0.00012858414,"threshold_uncertainty_score":0.99984396},"labels":[],"label_agreement":null},{"id":"W4412066985","doi":"10.1038/s41534-025-01040-x","title":"Conditioned quantum-assisted deep generative surrogate for particle-calorimeter interactions","year":2025,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of British Columbia; University of Waterloo; Perimeter Institute; TRIUMF","funders":"National Research Council Canada; Natural Sciences and Engineering Research Council of Canada; Institut Périmètre de physique théorique; Mitacs; National Science Foundation; Government of Canada; University of Virginia","keywords":"Large Hadron Collider; Computer science; Scalability; Quantum computer; Quantum; Quantum annealing; Autoencoder; Computational science; Physics; Artificial intelligence; Algorithm; Deep learning; Particle physics; Quantum mechanics","score_opus":0.01605649785694728,"score_gpt":0.27281932729404906,"score_spread":0.25676282943710177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412066985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11286004,0.00004445725,0.88152385,0.002723185,0.001557947,0.00043346913,0.000019685034,0.00033171565,0.00050567405],"genre_scores_gemma":[0.9660172,0.000007948366,0.03194408,0.0015760631,0.00009236613,0.00014001738,0.00010914749,0.000007673272,0.00010551671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845374,0.00008921691,0.0006092022,0.0002533286,0.00022200403,0.00037252944],"domain_scores_gemma":[0.9985035,0.00037508746,0.00024647536,0.00042331588,0.0003636875,0.00008790761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035030246,0.00021399686,0.00022903833,0.00027218432,0.0005587791,0.00045770654,0.00045581226,0.000081030594,0.000013865859],"category_scores_gemma":[0.00018009663,0.00019330501,0.0001513022,0.0006456312,0.00005217567,0.0019307311,0.00013666772,0.0002038619,0.00009863629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012350066,0.00017385681,0.0001778705,0.00011635922,0.00016396331,0.0000033438325,0.0043046996,0.010550875,0.0020892974,0.7548538,0.004910132,0.22253233],"study_design_scores_gemma":[0.000866221,0.000113494265,0.002670678,0.000058136902,0.000018969624,0.000016380307,0.00012926119,0.96045053,0.0027200007,0.016572684,0.016167615,0.00021601195],"about_ca_topic_score_codex":0.000023429158,"about_ca_topic_score_gemma":0.000015248178,"teacher_disagreement_score":0.9498997,"about_ca_system_score_codex":0.0000898035,"about_ca_system_score_gemma":0.00011074815,"threshold_uncertainty_score":0.78827494},"labels":[],"label_agreement":null},{"id":"W4412107888","doi":"10.1103/csnn-vjhn","title":"Bootstrapping the Quantum Hall Problem","year":2025,"lang":"en","type":"article","venue":"Physical Review X","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Aspen Center for Physics; Simons Foundation; Kavli Institute for Theoretical Physics, University of California, Santa Barbara; National Science Foundation","keywords":"Bootstrapping (finance); Quantum Hall effect; Computer science; Quantum; Physics; Statistical physics; Quantum mechanics; Mathematics; Econometrics; Magnetic field","score_opus":0.011268603980338401,"score_gpt":0.2924596314852335,"score_spread":0.2811910275048951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412107888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0090032695,0.056235757,0.8277259,0.08390647,0.00056746707,0.0010152376,0.0000015271564,0.00053603237,0.02100838],"genre_scores_gemma":[0.98440427,0.0020750628,0.0032014004,0.00984867,0.00021987231,0.000050045743,8.266559e-7,0.000008256009,0.00019159932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990196,0.0001004303,0.00017439712,0.00029295593,0.00017758463,0.0002349868],"domain_scores_gemma":[0.9990978,0.00020554673,0.000059652313,0.0005579952,0.000038250153,0.000040758958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002535298,0.00012669599,0.00022817246,0.000021537664,0.00016958012,0.00008906606,0.0010118291,0.000011620541,0.0000018535029],"category_scores_gemma":[0.000049862218,0.0000714302,0.00015621062,0.00057157996,0.000044571334,0.00007106091,0.00031687168,0.00024690476,0.00004837326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.9413936e-7,0.00006419455,0.000007252539,0.00052505947,0.000020171152,0.0000030788833,0.000104852355,0.00041713737,0.00012577305,0.8406186,0.0025895634,0.15552393],"study_design_scores_gemma":[0.00007034527,0.000029939229,0.0003424538,0.0021825735,0.000019675448,0.0000050089448,0.0000017764366,0.6220496,0.00011380252,0.2918183,0.08322465,0.00014186831],"about_ca_topic_score_codex":0.000010822959,"about_ca_topic_score_gemma":7.068196e-7,"teacher_disagreement_score":0.975401,"about_ca_system_score_codex":0.000010809582,"about_ca_system_score_gemma":0.00005572597,"threshold_uncertainty_score":0.2912839},"labels":[],"label_agreement":null},{"id":"W4412119445","doi":"10.1145/3748260","title":"Quantum Multiplexer Simplification for State Preparation","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Quantum Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cybernet Systems Corporation (Canada)","funders":"","keywords":"Multiplexer; Computer science; State (computer science); Quantum; Multiplexing; Telecommunications; Physics; Quantum mechanics; Algorithm","score_opus":0.018271782716654437,"score_gpt":0.29765072025927336,"score_spread":0.27937893754261894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412119445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10789453,0.00006985624,0.8869764,0.0023180542,0.0013053206,0.0006727804,0.000014041424,0.0006950451,0.000053924046],"genre_scores_gemma":[0.8787785,0.000009770095,0.120404154,0.0005062108,0.000066877954,0.000047798807,0.0000114492195,0.000022175333,0.00015303367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975502,0.0001320441,0.00063042104,0.00086812483,0.00027336905,0.00054587226],"domain_scores_gemma":[0.9970396,0.0011749116,0.00021352286,0.0012587815,0.00021562174,0.000097566015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006065149,0.00031960392,0.0003106852,0.00041952461,0.001013279,0.000311638,0.0012479791,0.000110153785,0.0000035632072],"category_scores_gemma":[0.00011834368,0.0003163568,0.00022666556,0.00088824733,0.00005589899,0.00027560725,0.000052471543,0.0003544736,0.00002572347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008863648,0.00031526203,0.000039492028,0.00009693528,0.00009460302,0.000002245197,0.0014299478,0.45278513,0.0019250298,0.033699356,0.00046098296,0.5090624],"study_design_scores_gemma":[0.00071179616,0.00022636572,0.0005763603,0.00011979224,0.000018865161,0.000006938776,0.00004411308,0.9577466,0.004023998,0.033764474,0.0024514429,0.0003092364],"about_ca_topic_score_codex":0.000034522636,"about_ca_topic_score_gemma":0.000007691411,"teacher_disagreement_score":0.770884,"about_ca_system_score_codex":0.00009462177,"about_ca_system_score_gemma":0.00014398195,"threshold_uncertainty_score":0.99992883},"labels":[],"label_agreement":null},{"id":"W4412444461","doi":"10.1109/tnse.2025.3589296","title":"Controlled Quantum Semantic Communication for Industrial CPS Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea","keywords":"Computer science; Quantum; Computer network; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.010727406985459894,"score_gpt":0.2244002337364654,"score_spread":0.2136728267510055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412444461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010554334,0.00024439447,0.9861483,0.00076912815,0.0016827805,0.00036372957,7.694285e-7,0.00019150128,0.000045072473],"genre_scores_gemma":[0.9840477,0.00006227193,0.01546188,0.0002154496,0.00010845664,0.000058946065,3.125261e-7,0.0000066495722,0.000038319744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881256,0.000024531635,0.00022715346,0.00033409073,0.0001893992,0.00041227043],"domain_scores_gemma":[0.99898624,0.00042478731,0.000038146078,0.00037344647,0.00009397323,0.0000834221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001005248,0.00014785705,0.00022235895,0.0002211925,0.0007633284,0.00028430097,0.0006353268,0.00007385087,5.6205573e-7],"category_scores_gemma":[0.000026486716,0.00013278559,0.00006782657,0.0012771995,0.000098922195,0.00023391444,0.000011386752,0.000304026,5.6169455e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000185027,0.000016225027,0.0000019798115,0.0000062881613,0.00001464035,3.3444198e-7,0.00004524474,0.9517671,0.00010824318,0.0063015074,0.000131734,0.041588187],"study_design_scores_gemma":[0.0011232037,0.00006290792,0.000040176477,0.00013110654,0.000014767861,0.0000038598164,0.000006266075,0.99724007,0.00015264268,0.00038596283,0.000705339,0.00013371487],"about_ca_topic_score_codex":0.000010663328,"about_ca_topic_score_gemma":0.0000055179685,"teacher_disagreement_score":0.9734934,"about_ca_system_score_codex":0.00004207039,"about_ca_system_score_gemma":0.00012700417,"threshold_uncertainty_score":0.5870982},"labels":[],"label_agreement":null},{"id":"W4412447107","doi":"10.1016/j.prime.2025.101074","title":"Quantum space vector pulse width modulation for speed control of permanent magnet synchronous machines","year":2025,"lang":"en","type":"article","venue":"e-Prime - Advances in Electrical Engineering Electronics and Energy","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université du Québec à Trois-Rivières","funders":"","keywords":"Pulse-width modulation; Space vector; Magnet; Modulation (music); Permanent magnet synchronous generator; Vector control; Physics; Pulse (music); Permanent magnet synchronous motor; Quantum; Space vector modulation; Computer science; Control (management); Control theory (sociology); Electrical engineering; Optics; Engineering; Acoustics; Voltage; Quantum mechanics; Induction motor","score_opus":0.002098274143247034,"score_gpt":0.20648405228760136,"score_spread":0.20438577814435432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412447107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02384234,0.024647044,0.9506044,0.00035890914,0.00024359024,0.000117210875,0.0000030502763,0.00010127109,0.000082215935],"genre_scores_gemma":[0.9849954,0.00096506014,0.013810117,0.00005641778,0.000070584865,0.000017530572,0.000005777804,0.000016658458,0.00006243169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985512,0.000027882155,0.00031748405,0.00041336776,0.00015065691,0.0005394434],"domain_scores_gemma":[0.99930614,0.0002519153,0.000083728606,0.0002452598,0.00005097574,0.00006196578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017182798,0.00022793557,0.00035911394,0.0002737678,0.000065148284,0.000041180047,0.00034181587,0.00008306305,0.0000012677226],"category_scores_gemma":[0.000080883816,0.00021392792,0.00007560303,0.0006283144,0.000021539621,0.00014915172,0.00006261112,0.00021642049,1.6679915e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036233203,0.00007711934,0.0000375008,0.000052279684,0.000022579065,0.0000022217175,0.000026113836,0.51721036,0.0059989947,0.2837047,0.000011083278,0.19282077],"study_design_scores_gemma":[0.0007479988,0.0003977753,0.00054109044,0.000041128125,0.000009387121,0.000008400092,4.7269523e-7,0.9795766,0.002229963,0.009736543,0.006499035,0.00021160467],"about_ca_topic_score_codex":0.00004086191,"about_ca_topic_score_gemma":0.0000101839705,"teacher_disagreement_score":0.9611531,"about_ca_system_score_codex":0.000108732245,"about_ca_system_score_gemma":0.00008995439,"threshold_uncertainty_score":0.8723728},"labels":[],"label_agreement":null},{"id":"W4412486339","doi":"10.1139/cjp-2025-0120","title":"Quantum energy in quantum computers: insights from quantum energy teleportation","year":2025,"lang":"en","type":"article","venue":"Canadian Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Quantum teleportation; Superdense coding; Teleportation; Quantum mechanics; Quantum; Quantum network; Quantum technology; Quantum channel; Quantum computer; Theoretical physics; Open quantum system; Quantum entanglement","score_opus":0.007967119053163257,"score_gpt":0.20768248405132564,"score_spread":0.1997153649981624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412486339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2208549,0.0013527968,0.77351207,0.0010462905,0.0029855473,0.000038753173,0.000008611715,0.000029751569,0.00017127418],"genre_scores_gemma":[0.99392194,0.000028720675,0.004420791,0.0010472372,0.0005250113,0.0000016774196,0.000011316989,0.000017550472,0.000025752137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979093,0.0001766479,0.00074742496,0.0003788856,0.00031029189,0.00047743996],"domain_scores_gemma":[0.99814487,0.0002524833,0.0004548212,0.0004575444,0.00026070583,0.00042960542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016039268,0.00027845238,0.00047609728,0.0006253461,0.00020426727,0.00028323516,0.0012005112,0.00012146571,0.000003532968],"category_scores_gemma":[0.00004686796,0.00026399238,0.00018895006,0.0011464098,0.00008933061,0.00044786808,0.00007312061,0.00041623268,0.0000027033227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000896274,0.000075459284,0.000564896,0.000013453354,0.00009201147,0.0007126613,0.0016103336,0.04080958,0.00038742804,0.8397783,0.0033342934,0.11261263],"study_design_scores_gemma":[0.0004573118,0.00010708385,0.0029246914,0.00028612118,0.000012289451,0.00002291895,0.00006890729,0.7144025,0.0007415761,0.26999584,0.010729886,0.0002508928],"about_ca_topic_score_codex":0.027614612,"about_ca_topic_score_gemma":0.017646844,"teacher_disagreement_score":0.77306706,"about_ca_system_score_codex":0.00020545344,"about_ca_system_score_gemma":0.0020118007,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W4412516653","doi":"10.1039/d5dd00138b","title":"Generative quantum combinatorial optimization by means of a novel conditional generative quantum eigensolver","year":2025,"lang":"en","type":"article","venue":"Digital Discovery","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Resources Canada; National Institutes for Quantum and Radiological Science and Technology; Japan Society for the Promotion of Science; Council for Science, Technology and Innovation; National Institute of Advanced Industrial Science and Technology","keywords":"Generative grammar; Quantum; Computer science; Quantum computer; Theoretical computer science; Artificial intelligence; Physics; Quantum mechanics","score_opus":0.008860783315915964,"score_gpt":0.23336934295455367,"score_spread":0.2245085596386377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412516653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03402976,0.000146199,0.9619845,0.0004976299,0.0012486828,0.00021126146,0.0006830891,0.000087647335,0.0011112221],"genre_scores_gemma":[0.98047316,0.000008301101,0.018128214,0.00039385213,0.00014886355,0.000017210146,0.0004420368,0.000016404632,0.00037196372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823624,0.000051026167,0.00043321628,0.0005522479,0.00041487732,0.00031241064],"domain_scores_gemma":[0.998972,0.00019641525,0.00019539763,0.000364711,0.0001989534,0.000072535004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010814701,0.00027498422,0.00033716724,0.00015654461,0.00019970912,0.00062678324,0.0005775282,0.00009688375,0.0000053236527],"category_scores_gemma":[0.0000930834,0.00024629536,0.00017087694,0.00054614723,0.00017666433,0.001318226,0.00032032374,0.00018224532,0.0000036648296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027897537,0.0005546187,0.00007836421,0.000020859263,0.0001243963,0.000005004562,0.00036337605,0.39741343,0.0025718096,0.59291834,0.0051728785,0.00074901973],"study_design_scores_gemma":[0.0009960273,0.00015410982,0.00014229002,0.00005522064,0.000010662235,0.0000048249626,0.00003976383,0.9629142,0.004781409,0.030187279,0.0004412915,0.0002729154],"about_ca_topic_score_codex":0.000016628854,"about_ca_topic_score_gemma":8.200052e-7,"teacher_disagreement_score":0.9464434,"about_ca_system_score_codex":0.000061479535,"about_ca_system_score_gemma":0.00025709462,"threshold_uncertainty_score":0.9999989},"labels":[],"label_agreement":null},{"id":"W4412524209","doi":"10.22331/q-2025-07-21-1800","title":"Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Ansatz; Unitary state; Cluster (spacecraft); Coupled cluster; Mathematics; Approximation error; Mathematical physics; Physics; Applied mathematics; Quantum mechanics; Computer science; Political science; Law; Computer network","score_opus":0.007138213898733898,"score_gpt":0.2320573930421354,"score_spread":0.2249191791434015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412524209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86988467,0.00019944341,0.12854281,0.0008575409,0.00020746954,0.00015711748,8.824424e-7,0.000058678605,0.000091409434],"genre_scores_gemma":[0.98662883,0.000023421513,0.013040579,0.00020910638,0.000018138715,0.0000062944696,0.000002465276,0.000005555389,0.00006558322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898964,0.000066570574,0.0002841017,0.00029087157,0.0001460344,0.00022280819],"domain_scores_gemma":[0.9994341,0.00010284546,0.000082899714,0.00030244878,0.000044183795,0.00003348726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037758588,0.00012744904,0.00019329922,0.00023953385,0.00008989095,0.000048464153,0.00033274642,0.000048734983,0.000001621967],"category_scores_gemma":[0.000020809734,0.000114348004,0.000028093225,0.00049454457,0.000051204363,0.00021977638,0.00021244909,0.00021819433,0.0000014678128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038845686,0.000631594,0.06358448,0.002749726,0.00013059964,0.00004906838,0.026950533,0.36041853,0.0045000613,0.08299161,0.00051950413,0.45708585],"study_design_scores_gemma":[0.0004430201,0.00008700737,0.059787113,0.00021711693,0.0000033014592,0.0000069315106,0.000018783403,0.9365815,0.00026257485,0.00241711,0.00006457823,0.000110969435],"about_ca_topic_score_codex":0.00007911042,"about_ca_topic_score_gemma":0.000009202428,"teacher_disagreement_score":0.576163,"about_ca_system_score_codex":0.00001945918,"about_ca_system_score_gemma":0.000060568753,"threshold_uncertainty_score":0.46629763},"labels":[],"label_agreement":null},{"id":"W4412588932","doi":"10.1016/b978-0-443-29096-1.00008-8","title":"Quantum computing: vision and challenges","year":2025,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Digital Payment Technologies (Canada)","funders":"","keywords":"Computer science; Quantum computer; Quantum; Physics; Quantum mechanics","score_opus":0.016420700759228527,"score_gpt":0.24222680001856153,"score_spread":0.225806099259333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412588932","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022269789,0.02072388,0.0034093682,0.0017530988,0.0009913134,0.00032408378,0.0000060157113,0.00040418218,0.9723658],"genre_scores_gemma":[0.0010454332,0.0022366014,0.01852656,0.00069250976,0.0005398163,0.000004316657,0.0000056599783,0.000065984386,0.9768831],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976396,0.00005396994,0.00044440306,0.0010705931,0.00038788922,0.00040352746],"domain_scores_gemma":[0.9982344,0.00025416384,0.00024739903,0.0010037489,0.00009532161,0.00016496683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038093582,0.00058029994,0.0006675231,0.0003006,0.00027790348,0.0002266236,0.0010279386,0.00034669627,0.0000052933256],"category_scores_gemma":[0.000016634165,0.0004962683,0.00020042123,0.00002461677,0.00014488239,0.000053153053,0.0014481824,0.00072944484,0.00003058694],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015938982,0.0000053018257,1.7991333e-7,0.00015715072,0.000036575246,0.00003565759,0.00029908618,0.000006612217,0.0000020931345,0.21601942,0.00012185287,0.78331447],"study_design_scores_gemma":[0.00019456298,0.0001409414,0.000025589663,0.0012182903,0.00002515182,0.000057974463,0.000002791384,0.058637593,0.00000664909,0.07296867,0.8662144,0.0005073727],"about_ca_topic_score_codex":3.7319845e-7,"about_ca_topic_score_gemma":0.0000029408034,"teacher_disagreement_score":0.86609256,"about_ca_system_score_codex":0.00003380227,"about_ca_system_score_gemma":0.00012291629,"threshold_uncertainty_score":0.9997489},"labels":[],"label_agreement":null},{"id":"W4412603774","doi":"10.2139/ssrn.5363714","title":"Liquidity Optimization in Gross Settlement Systems with Quantum Reordering: Application to Target2","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada; Government of Canada","funders":"","keywords":"Market liquidity; Settlement (finance); Quantum; Business; Economics; Monetary economics; Finance; Physics","score_opus":0.005846105523809878,"score_gpt":0.2378677349982986,"score_spread":0.23202162947448873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412603774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017255133,0.0011981195,0.97780406,0.0020460682,0.0007513399,0.0007319106,0.000009963003,0.00013912897,0.000064265645],"genre_scores_gemma":[0.93019116,0.0011332817,0.06701678,0.00021787718,0.0007125815,0.00020755295,0.000056829052,0.00004828974,0.00041563477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996011,0.00022401831,0.0005890792,0.00079798745,0.0005092152,0.0018686798],"domain_scores_gemma":[0.99847883,0.000059497386,0.00041659322,0.00070961355,0.00020612557,0.00012932914],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023066222,0.0003746619,0.00042138962,0.00046887394,0.00023683462,0.0004382039,0.0015693688,0.00018839574,5.146512e-7],"category_scores_gemma":[0.00004193427,0.0003259977,0.00009208282,0.0006624614,0.000017953735,0.00012849981,0.00087868806,0.0033430455,0.0000039517686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016682494,0.00006147108,0.00007984058,0.0000586597,0.000055644305,0.000004986619,0.00035978536,0.9538093,0.000008575182,0.039424118,0.000045644014,0.0060752756],"study_design_scores_gemma":[0.00032607137,0.0003000784,0.00008615631,0.0003593076,0.000012926403,0.00011267936,0.0001569845,0.96937776,0.000022571925,0.028140882,0.00082871947,0.00027585324],"about_ca_topic_score_codex":0.00024001123,"about_ca_topic_score_gemma":0.0001954439,"teacher_disagreement_score":0.91293603,"about_ca_system_score_codex":0.0014123245,"about_ca_system_score_gemma":0.003386513,"threshold_uncertainty_score":0.99991924},"labels":[],"label_agreement":null},{"id":"W4412615279","doi":"10.1016/b978-0-443-29096-1.00011-8","title":"Top research priorities in quantum computing","year":2025,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Quantum computer; Quantum; Physics; Quantum mechanics","score_opus":0.027256882050954293,"score_gpt":0.29887935886768524,"score_spread":0.27162247681673096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412615279","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002868812,0.0021395066,0.001462181,0.00053631456,0.0011809953,0.0005680845,0.0000072759867,0.00027860815,0.99354017],"genre_scores_gemma":[0.0030884224,0.000063718275,0.011729136,0.0003341583,0.0005790648,0.000011001351,0.000004841347,0.00005444102,0.9841352],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961053,0.00020034499,0.00073792634,0.0011578538,0.00090422673,0.00089434185],"domain_scores_gemma":[0.99730885,0.0007817138,0.00018267675,0.0013314482,0.0002534791,0.00014181789],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017885242,0.0005151759,0.00074309506,0.0011395507,0.0003865551,0.00038928867,0.0022155414,0.00042138775,0.000012508089],"category_scores_gemma":[0.00008114981,0.00050167623,0.00023562608,0.00015491326,0.00024779807,0.00006892407,0.0021039606,0.0024599906,0.00007186107],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026008956,0.000007037626,0.000005413937,0.000118897246,0.000019403864,0.00013441332,0.00076800043,0.000060289483,0.0000028189959,0.1902352,0.0002450105,0.8084009],"study_design_scores_gemma":[0.0002758643,0.000102269434,0.000048375743,0.002540402,0.0000074888603,0.000031406824,0.000014419278,0.09069263,0.000019849182,0.13581435,0.76986057,0.00059235224],"about_ca_topic_score_codex":0.000007227249,"about_ca_topic_score_gemma":0.00002896913,"teacher_disagreement_score":0.8078086,"about_ca_system_score_codex":0.0001928755,"about_ca_system_score_gemma":0.00069879764,"threshold_uncertainty_score":0.9998414},"labels":[],"label_agreement":null},{"id":"W4412628373","doi":"10.1073/pnas.2425026122","title":"Tensor-based quantum phase difference estimation for large-scale demonstration","year":2025,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Qubit; Quantum phase estimation algorithm; Quantum Fourier transform; Quantum computer; Algorithm; Computer science; Tensor (intrinsic definition); Superposition principle; Quantum; Quantum error correction; Physics; Mathematics; Quantum mechanics","score_opus":0.025912578031406144,"score_gpt":0.31830880338059203,"score_spread":0.2923962253491859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412628373","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7038498,0.00007020054,0.28264427,0.012134719,0.00008512211,0.00044157848,0.000024528017,0.00006304499,0.00068676024],"genre_scores_gemma":[0.89299875,0.0000011833903,0.106581695,0.00034393038,0.000023953053,0.000013812614,2.10915e-7,0.0000015548906,0.000034881785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862784,0.0000075439657,0.00030414606,0.00028734226,0.00060728536,0.00016584352],"domain_scores_gemma":[0.99908197,0.00025434818,0.00032295493,0.000014677831,0.00030288505,0.000023172584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010683156,0.00009193865,0.00013405755,0.00020416525,0.00036839655,0.00006985089,0.0011671503,0.000059802544,6.665404e-7],"category_scores_gemma":[0.00037480405,0.00006203843,0.0000826449,0.0009654514,0.00023101906,0.00026615808,0.00011837872,0.00011250359,2.1258623e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021370275,0.0002667007,0.0013411684,0.00017648701,0.000012527664,3.4585124e-9,0.00027705467,0.011812851,0.10140358,0.86286247,0.0005178081,0.021308],"study_design_scores_gemma":[0.00033434958,0.000059933147,0.007597192,0.00010290361,0.000004995699,9.2846864e-7,0.000018491923,0.7853845,0.071788184,0.13460147,0.00005382176,0.000053226395],"about_ca_topic_score_codex":0.0000012313803,"about_ca_topic_score_gemma":3.910885e-8,"teacher_disagreement_score":0.77357167,"about_ca_system_score_codex":0.000019687435,"about_ca_system_score_gemma":0.00008482964,"threshold_uncertainty_score":0.28334457},"labels":[],"label_agreement":null},{"id":"W4412703017","doi":"10.36227/techrxiv.175372605.50310518/v1","title":"Quantum Information Refinement Theory (QIRT): Solving 3-Exact Cover with Entropic Shaping and Adaptive QEC on NISQ Processors","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cover (algebra); Computer science; Theoretical computer science; Information theory; Quantum; Algorithm; Computational science; Mathematical optimization; Mathematics; Statistics; Physics; Engineering; Quantum mechanics","score_opus":0.012206261434275232,"score_gpt":0.22959185048393652,"score_spread":0.2173855890496613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412703017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027193295,0.00019127516,0.96318907,0.0011279236,0.00044899934,0.00061668345,0.000015176724,0.00038896658,0.0068286196],"genre_scores_gemma":[0.9014914,0.000083258514,0.095058,0.0023219727,0.00016904178,0.0000840715,0.000034951732,0.000021405429,0.000735881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787235,0.00012083184,0.00042184177,0.0006772135,0.0005041164,0.00040365985],"domain_scores_gemma":[0.9984532,0.0002843647,0.0003572785,0.000640278,0.00016546345,0.000099414654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045681998,0.00044734465,0.0003919759,0.00034035477,0.00029037765,0.0005928867,0.0008126459,0.00016611438,0.000016600372],"category_scores_gemma":[0.0000645518,0.0003197428,0.000075444725,0.0002509337,0.00006600368,0.00035848716,0.0015791998,0.0008010254,0.000013210756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001823348,0.00012493045,0.00015017825,0.00088860065,0.00029244102,0.000019915837,0.007619076,0.20339827,0.000007943262,0.53039575,0.0006868343,0.25623375],"study_design_scores_gemma":[0.00047226885,0.00036624743,0.0009579393,0.0013152699,0.000024454142,0.000009541135,0.00011962686,0.9782745,0.0001352614,0.01654558,0.0013134442,0.00046583402],"about_ca_topic_score_codex":0.000079274934,"about_ca_topic_score_gemma":0.000007879009,"teacher_disagreement_score":0.8742981,"about_ca_system_score_codex":0.00010620565,"about_ca_system_score_gemma":0.00034972656,"threshold_uncertainty_score":0.99992543},"labels":[],"label_agreement":null},{"id":"W4412738375","doi":"10.1038/s42254-025-00853-1","title":"Tensor networks for quantum computing","year":2025,"lang":"en","type":"review","venue":"Nature Reviews Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Institut quantique; Université de Sherbrooke","funders":"","keywords":"Tensor (intrinsic definition); Computer science; Quantum computer; Quantum; Physics; Computational science; Quantum mechanics; Mathematics; Pure mathematics","score_opus":0.028652720049321814,"score_gpt":0.34472692556441437,"score_spread":0.3160742055150926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412738375","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.15602e-9,0.53983915,0.45659944,0.000040352224,0.0016749259,0.0015625986,0.00001602361,0.00018317593,0.0000843668],"genre_scores_gemma":[2.5501467e-7,0.90508205,0.09126785,0.0005435948,0.0026436402,0.00011871253,0.000112416914,0.00006098012,0.00017047627],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99570465,0.0004728845,0.0012572616,0.0014114048,0.00031704453,0.0008367629],"domain_scores_gemma":[0.99509037,0.0016648329,0.0011484702,0.0017562653,0.0001921568,0.00014790132],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010493628,0.0010550184,0.0041232696,0.00016712947,0.00039994743,0.0003298814,0.0030910769,0.0010327613,9.2867293e-7],"category_scores_gemma":[0.00031266708,0.0007504383,0.0023835094,0.0018822053,0.000048632457,0.00012524704,0.0008711143,0.0029326973,0.000025751675],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.0816755e-7,0.000036867736,3.8673193e-8,0.026581839,0.00006910541,0.0000034851555,0.000014750946,0.00025551577,9.581478e-9,0.031088417,0.008611334,0.9333382],"study_design_scores_gemma":[0.00009227552,0.000034458015,8.358164e-8,0.03717167,0.00028144062,0.000017766917,2.2996574e-7,0.19105367,7.809632e-8,0.0018040119,0.7689686,0.00057571044],"about_ca_topic_score_codex":9.85247e-7,"about_ca_topic_score_gemma":2.680374e-7,"teacher_disagreement_score":0.9327625,"about_ca_system_score_codex":0.00009888798,"about_ca_system_score_gemma":0.00039735012,"threshold_uncertainty_score":0.9994947},"labels":[],"label_agreement":null},{"id":"W4412748358","doi":"10.1364/quantum.2025.qm3b.3","title":"Device-independent Quantum Position Verification","year":2025,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Position paper; Position (finance); Quantum; Physics; Quantum mechanics; Business","score_opus":0.008431207551329697,"score_gpt":0.2523483609359214,"score_spread":0.2439171533845917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412748358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054370485,0.0000719505,0.93403864,0.005587087,0.00051127916,0.0000887871,3.5482304e-7,0.0003071833,0.0050242194],"genre_scores_gemma":[0.9612762,0.0000034786976,0.03715562,0.00096654886,0.000035857192,0.0000053778567,0.0000025449658,0.0000027128797,0.0005516843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992467,0.000039188766,0.00014067352,0.00027740342,0.00014182522,0.0001542125],"domain_scores_gemma":[0.9994722,0.000034106022,0.000034682416,0.00037296218,0.00005141674,0.00003462943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015515338,0.00008122077,0.00007487495,0.0001114965,0.00014313366,0.00014003638,0.00047131162,0.000040866358,0.000006926221],"category_scores_gemma":[0.000008539429,0.000069347065,0.000041182673,0.00037408152,0.000009549241,0.00012597049,0.00013583306,0.000101705,0.00007010395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031391126,0.00006894502,0.00020664427,0.000015710022,0.000015146189,0.0000062997,0.0001814032,0.0014940625,0.0028785649,0.8424435,0.0021633487,0.15052322],"study_design_scores_gemma":[0.00015956297,0.000025448457,0.012713208,0.000025869473,0.0000032742053,0.000009601327,0.000017403883,0.9571791,0.0035752074,0.023336057,0.0028486166,0.000106648775],"about_ca_topic_score_codex":0.000026861195,"about_ca_topic_score_gemma":0.000003198879,"teacher_disagreement_score":0.955685,"about_ca_system_score_codex":0.00003016609,"about_ca_system_score_gemma":0.00005482343,"threshold_uncertainty_score":0.2827891},"labels":[],"label_agreement":null},{"id":"W4412764996","doi":"10.18280/jesa.580607","title":"Quantum Leap in Automation: Exploring Quantum Machine Learning for Enhanced Precision in Optoelectronic Robotic Systems","year":2025,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quantum; Automation; Quantum dot; Computer science; Optoelectronics; Physics; Embedded system; Engineering; Mechanical engineering; Quantum mechanics","score_opus":0.02302071605863293,"score_gpt":0.267952490599255,"score_spread":0.2449317745406221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412764996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36202535,0.004076355,0.6313757,0.0002969517,0.0013827969,0.0004337295,7.3840664e-7,0.00031608043,0.00009234743],"genre_scores_gemma":[0.9844265,0.00027258406,0.014687248,0.00003507923,0.0001525325,0.00008775523,0.0000031205686,0.000040505944,0.00029468234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958376,0.00078182505,0.0013395395,0.00062463415,0.0005014285,0.0009149493],"domain_scores_gemma":[0.99794316,0.0007883599,0.00051862677,0.0004362381,0.00018088898,0.00013272386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002071861,0.00039636382,0.00073182554,0.0012115861,0.0005228882,0.00085987366,0.0011647891,0.00011907615,0.0000039036913],"category_scores_gemma":[0.0005259767,0.0003533131,0.000189478,0.0016671263,0.00004795203,0.00088332774,0.0003015545,0.0010305167,0.000013668395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027399528,0.00010406749,0.0005807135,0.00037683008,0.000040283132,0.00006865025,0.0014659455,0.751506,0.001728529,0.021395052,0.000053849108,0.2226527],"study_design_scores_gemma":[0.0011455859,0.00035445386,0.033132948,0.0025692289,0.00001127,0.00024531924,0.000098569435,0.9530157,0.0004916347,0.00840029,0.00020471927,0.0003303142],"about_ca_topic_score_codex":0.00008902398,"about_ca_topic_score_gemma":0.00004160557,"teacher_disagreement_score":0.6224012,"about_ca_system_score_codex":0.00060510327,"about_ca_system_score_gemma":0.00033289238,"threshold_uncertainty_score":0.9998919},"labels":[],"label_agreement":null},{"id":"W4412939410","doi":"10.1109/tqe.2025.3595778","title":"Fault-Tolerant Noise Guessing Decoding of Quantum Random Codes","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Quantum Engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Instituto de Telecomunicações; National Institute of Informatics; University of Toronto; European Commission","keywords":"Decoding methods; Computer science; Fault tolerance; Noise (video); Quantum; Algorithm; Distributed computing; Physics; Artificial intelligence; Quantum mechanics","score_opus":0.00817874487045951,"score_gpt":0.2303553864146485,"score_spread":0.222176641544189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412939410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10543419,0.0002466677,0.89134145,0.00028202293,0.0019944033,0.00016969086,0.000008605945,0.0004626825,0.000060267128],"genre_scores_gemma":[0.9696923,0.000035934525,0.03006661,0.000075797194,0.000042443866,0.000019018084,7.8181245e-7,0.000024815023,0.000042321637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815065,0.000058992562,0.000549059,0.00048131243,0.00030207643,0.0004578974],"domain_scores_gemma":[0.9986487,0.0004993894,0.000104578154,0.00055799336,0.00008602803,0.000103284314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036147752,0.00032103993,0.0004740978,0.0006088372,0.00027099313,0.00012940545,0.0006876358,0.00011237978,0.0000050063663],"category_scores_gemma":[0.00002199332,0.00030854496,0.0002509946,0.00093355373,0.000046797228,0.00023618534,0.000010422331,0.00047761996,0.00000692418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002793414,0.00010045419,0.0000035574647,0.0001241572,0.00007331763,0.000012070803,0.0003714681,0.9417987,0.017813882,0.007259518,0.000024898573,0.03239006],"study_design_scores_gemma":[0.00092704257,0.00006591622,0.000054302145,0.0005679101,0.000026852478,0.000016940674,0.000024723513,0.9431755,0.054202076,0.00040783116,0.00025414638,0.00027673662],"about_ca_topic_score_codex":0.00004250578,"about_ca_topic_score_gemma":0.000002901723,"teacher_disagreement_score":0.8642581,"about_ca_system_score_codex":0.00006086918,"about_ca_system_score_gemma":0.0000857713,"threshold_uncertainty_score":0.99993664},"labels":[],"label_agreement":null},{"id":"W4412968845","doi":"10.1117/12.3066117","title":"Simulating lossy and partially distinguishable quantum optical circuits: theory, algorithms and applications to experiment validation and state preparation","year":2025,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Lossy compression; Computer science; Electronic circuit; Algorithm; State (computer science); Quantum; Computer engineering; Theoretical computer science; Physics; Quantum mechanics; Artificial intelligence","score_opus":0.012702738148948246,"score_gpt":0.29629664147773666,"score_spread":0.2835939033287884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412968845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12628365,0.00017805607,0.87166,0.00054565223,0.00007315572,0.00039591853,0.0000019070042,0.00017163431,0.000690041],"genre_scores_gemma":[0.92394483,0.000009675356,0.07556756,0.00020230767,0.000047885515,0.000048363167,0.000002753322,0.000006279146,0.00017036185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988608,0.00005382084,0.00024894188,0.00050311646,0.00013099583,0.00020234667],"domain_scores_gemma":[0.99922556,0.0002891159,0.000052380285,0.0002467947,0.000068152345,0.00011798455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041035816,0.00013719469,0.0001414827,0.00008339231,0.0003252798,0.00043257888,0.00014113673,0.000034976718,0.0000019117895],"category_scores_gemma":[0.00008239632,0.00012192964,0.000013882485,0.00020098442,0.000056696466,0.000142339,0.00032561144,0.00007823799,0.0000015694028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009160954,0.00005511352,0.00040623522,0.000043588716,0.000025128691,0.0000017639336,0.0020206159,0.0138188945,0.0017835953,0.41535106,0.000037519192,0.5664473],"study_design_scores_gemma":[0.00021154388,0.0001068847,0.0011529768,0.000039672086,0.000007482841,0.00000714119,0.0000625585,0.9515395,0.0031278378,0.042848866,0.0007356511,0.00015989144],"about_ca_topic_score_codex":0.00002031207,"about_ca_topic_score_gemma":0.0000036980407,"teacher_disagreement_score":0.9377206,"about_ca_system_score_codex":0.000014435678,"about_ca_system_score_gemma":0.000029154495,"threshold_uncertainty_score":0.49721465},"labels":[],"label_agreement":null},{"id":"W4413122247","doi":"10.1109/ims40360.2025.11103791","title":"Quantum Method for Solving S-Parameters of Lossless Waveguides Based on the HHL Method and Finite-Element-Method","year":2025,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Finite element method; Lossless compression; Computer science; Algorithm; Engineering; Structural engineering; Data compression","score_opus":0.022476744917750053,"score_gpt":0.3170761403734238,"score_spread":0.29459939545567376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413122247","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011266421,0.00006643895,0.9895872,0.007714419,0.0003193922,0.00048951234,0.0000105880345,0.000109918925,0.0005759092],"genre_scores_gemma":[0.034808517,0.0000028123966,0.96190685,0.0030349146,0.00002737674,0.00003776882,0.0000017131262,0.000013438666,0.0001666331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997614,0.00054562633,0.00048290627,0.0006604412,0.0002785114,0.0004185018],"domain_scores_gemma":[0.9846626,0.014166899,0.00019246712,0.00077160995,0.00013651566,0.0000699349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040056095,0.0002683162,0.00041637072,0.00027612824,0.00032627984,0.00019566313,0.00095994974,0.000083432526,0.000008485789],"category_scores_gemma":[0.00074189843,0.00017143154,0.00019402924,0.0006059701,0.000063820284,0.000076477365,0.0003658074,0.00023471809,7.6686814e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039622697,0.000100364734,0.00005557694,0.00016780457,0.00010106255,0.000002510355,0.00056611985,0.1311421,0.0018041838,0.30255768,0.0011156545,0.56234735],"study_design_scores_gemma":[0.0004667058,0.00020409015,0.00010626171,0.00012439812,0.000026479982,0.0000024679832,0.00007635699,0.92921466,0.025741579,0.042803977,0.0010473541,0.00018564297],"about_ca_topic_score_codex":0.00010800718,"about_ca_topic_score_gemma":0.0000061153296,"teacher_disagreement_score":0.7980726,"about_ca_system_score_codex":0.00002204421,"about_ca_system_score_gemma":0.00011660903,"threshold_uncertainty_score":0.69907755},"labels":[],"label_agreement":null},{"id":"W4413132918","doi":"10.1137/23m1549353","title":"A Direct Product Theorem for Quantum Communication Complexity with Applications to Device-Independent Cryptography","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fujitsu Laboratories of America; National Research Foundation Singapore; Innovation, Science and Economic Development Canada","keywords":"Communication complexity; Quantum entanglement; Upper and lower bounds; Discrete mathematics; Quantum; Quantum information science; Mathematics; Quantum cryptography; Direct product; Quantum information; Quantum key distribution; Combinatorics; Physics; Quantum mechanics","score_opus":0.0230217637800299,"score_gpt":0.29755193218593035,"score_spread":0.27453016840590044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413132918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026425725,0.0003191567,0.9643668,0.0060199695,0.0002946355,0.0008910669,0.000003682136,0.00024283183,0.0014361441],"genre_scores_gemma":[0.6810386,0.0000063849698,0.31771943,0.0009770162,0.00019626741,0.000029001641,0.0000030022152,0.000015145324,0.000015121792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784684,0.00024334696,0.00047906023,0.00056437356,0.00038120308,0.0004851746],"domain_scores_gemma":[0.9975707,0.00060020183,0.00031671373,0.00092999195,0.00040228068,0.00018012151],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013688271,0.0002713048,0.0003407445,0.00046628254,0.0014927466,0.00056643866,0.0016967747,0.000045164772,0.0000014802821],"category_scores_gemma":[0.000068464324,0.00021064363,0.00016835297,0.0012963349,0.000081432,0.0001245744,0.00038350327,0.0005548545,0.000006562373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008117177,0.00035307725,0.0005908781,0.00008032896,0.00017126312,0.0000065438835,0.001187465,0.06505274,0.00023951237,0.65246433,0.0010670819,0.2787056],"study_design_scores_gemma":[0.0015801047,0.00075420766,0.008567466,0.0012483704,0.000049343762,0.0002172532,0.0001601053,0.83408874,0.0015909742,0.10502316,0.045953643,0.0007666255],"about_ca_topic_score_codex":0.000008966889,"about_ca_topic_score_gemma":0.000009590807,"teacher_disagreement_score":0.769036,"about_ca_system_score_codex":0.00008469802,"about_ca_system_score_gemma":0.00016958425,"threshold_uncertainty_score":0.9998072},"labels":[],"label_agreement":null},{"id":"W4413145037","doi":"10.1109/cloud-summit64795.2025.00037","title":"Reconfigurable and Compact Modular Polynomial Multiplier in Galois Field for the Security of IoT","year":2025,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Modular design; Computer science; Multiplier (economics); Galois theory; Polynomial; Internet of Things; Embedded system; Mathematics; Discrete mathematics; Programming language","score_opus":0.006797690866951381,"score_gpt":0.2454666376185972,"score_spread":0.2386689467516458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413145037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6186419,0.00050907535,0.36526802,0.01086247,0.00045103757,0.00046323673,0.0000048555103,0.000057165005,0.0037422192],"genre_scores_gemma":[0.99148256,0.0000068870727,0.007877988,0.0004615775,0.000024127534,0.0000034111272,2.2286487e-7,0.0000020930856,0.000141116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994125,0.000025793624,0.00015770028,0.00019436968,0.00005714347,0.00015252476],"domain_scores_gemma":[0.9989595,0.0006947636,0.00003477649,0.000263857,0.000025229492,0.000021877231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026252802,0.000075626216,0.00014046389,0.00006811643,0.00007864891,0.00004543546,0.00035494668,0.00004095393,0.0000049263585],"category_scores_gemma":[0.000058895374,0.000049270457,0.000044877586,0.00017517123,0.00002887557,0.000031700816,0.00006951866,0.00011604263,3.0344177e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020085435,0.00041176897,0.012785648,0.0003518192,0.0001946006,0.0000075312996,0.006561052,0.048122086,0.008408423,0.093567915,0.023803372,0.8055849],"study_design_scores_gemma":[0.0004411961,0.000053075,0.0059393262,0.000030742773,0.0000026695586,0.0000017051484,0.000027682745,0.9758577,0.00943306,0.0052433256,0.0029054224,0.000064095184],"about_ca_topic_score_codex":0.00056457124,"about_ca_topic_score_gemma":0.00008644496,"teacher_disagreement_score":0.9277356,"about_ca_system_score_codex":0.0000074591276,"about_ca_system_score_gemma":0.000034788267,"threshold_uncertainty_score":0.20091909},"labels":[],"label_agreement":null},{"id":"W4413161879","doi":"10.2139/ssrn.5373357","title":"The Art of Quantum Computing for Finance: Brief Overview and Prospects","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Finance; Computer science; Business; Economics","score_opus":0.010058342908861227,"score_gpt":0.26354440944597357,"score_spread":0.25348606653711236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413161879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017955173,0.050897416,0.9257882,0.003400227,0.0012388375,0.00053282775,0.000009039636,0.00006060393,0.000117623335],"genre_scores_gemma":[0.8733735,0.06649237,0.055369046,0.00046180593,0.0015471883,0.000040933814,0.000010460876,0.00006596492,0.0026387253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967226,0.00012752374,0.0005760943,0.00051513733,0.00031633786,0.00174231],"domain_scores_gemma":[0.9980353,0.00045449386,0.00067197066,0.0005647423,0.00022327842,0.000050214938],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002952689,0.00030411413,0.00047513607,0.00011172785,0.00067089417,0.00033667477,0.0015904002,0.00014751604,1.9540573e-7],"category_scores_gemma":[0.00012515736,0.0002169938,0.00026492772,0.00023278517,0.000099675235,0.00006438762,0.0012800655,0.0029928458,5.085414e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014299839,0.000027809214,0.000052646952,0.00016406222,0.00012969434,0.0000014116608,0.00020192534,0.004830086,0.0000045521533,0.80158,0.00029476688,0.19269873],"study_design_scores_gemma":[0.0002884909,0.0001838433,0.00024382997,0.0004477319,0.000020517506,0.0001400687,0.000022622067,0.46620548,0.000027476219,0.5273126,0.0049422686,0.00016508096],"about_ca_topic_score_codex":0.000018785893,"about_ca_topic_score_gemma":0.000045846988,"teacher_disagreement_score":0.8704192,"about_ca_system_score_codex":0.00021195249,"about_ca_system_score_gemma":0.0034504887,"threshold_uncertainty_score":0.9993073},"labels":[],"label_agreement":null},{"id":"W4413245391","doi":"10.2139/ssrn.5362526","title":"The Art of Quantum Computing for Finance: Brief Overview and Prospects","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Finance; Economics","score_opus":0.010058342908861227,"score_gpt":0.26354440944597357,"score_spread":0.25348606653711236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413245391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017955173,0.050897416,0.9257882,0.003400227,0.0012388375,0.00053282775,0.000009039636,0.00006060393,0.000117623335],"genre_scores_gemma":[0.8733735,0.06649237,0.055369046,0.00046180593,0.0015471883,0.000040933814,0.000010460876,0.00006596492,0.0026387253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967226,0.00012752374,0.0005760943,0.00051513733,0.00031633786,0.00174231],"domain_scores_gemma":[0.9980353,0.00045449386,0.00067197066,0.0005647423,0.00022327842,0.000050214938],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002952689,0.00030411413,0.00047513607,0.00011172785,0.00067089417,0.00033667477,0.0015904002,0.00014751604,1.9540573e-7],"category_scores_gemma":[0.00012515736,0.0002169938,0.00026492772,0.00023278517,0.000099675235,0.00006438762,0.0012800655,0.0029928458,5.085414e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014299839,0.000027809214,0.000052646952,0.00016406222,0.00012969434,0.0000014116608,0.00020192534,0.004830086,0.0000045521533,0.80158,0.00029476688,0.19269873],"study_design_scores_gemma":[0.0002884909,0.0001838433,0.00024382997,0.0004477319,0.000020517506,0.0001400687,0.000022622067,0.46620548,0.000027476219,0.5273126,0.0049422686,0.00016508096],"about_ca_topic_score_codex":0.000018785893,"about_ca_topic_score_gemma":0.000045846988,"teacher_disagreement_score":0.8704192,"about_ca_system_score_codex":0.00021195249,"about_ca_system_score_gemma":0.0034504887,"threshold_uncertainty_score":0.9993073},"labels":[],"label_agreement":null},{"id":"W4413287598","doi":"10.1002/qute.202500375","title":"Analysis of the Effect of Entanglement Operators and the Scalability of Players’ Payoff Computation in N‐Player Quantum Games","year":2025,"lang":"en","type":"article","venue":"Advanced Quantum Technologies","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Business Development Bank of Canada","funders":"","keywords":"Quantum entanglement; Scalability; Stochastic game; Computation; Quantum; Computer science; Mathematics; Mathematical economics; Physics; Quantum mechanics; Algorithm","score_opus":0.003444488790761192,"score_gpt":0.24651218457909854,"score_spread":0.24306769578833734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413287598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94175214,0.0013859717,0.05521107,0.000981215,0.00012265447,0.00044332375,0.000008363746,0.000081284285,0.000014009754],"genre_scores_gemma":[0.9967768,0.00009437481,0.0030825017,0.000014965866,0.0000012013336,0.00002373407,9.737067e-7,0.0000036519932,0.0000017847033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983245,0.00026392058,0.00059029687,0.00036620465,0.0002538493,0.00020120673],"domain_scores_gemma":[0.99752456,0.0012876816,0.00035025383,0.00074819464,0.00007936074,0.000009946673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008495074,0.00018256935,0.0006468128,0.00044874148,0.000087178916,0.00001786944,0.0009712097,0.00008709591,5.3714274e-7],"category_scores_gemma":[0.0005182808,0.00009553974,0.0001817473,0.00291912,0.00076920603,0.00009183595,0.00075056864,0.00023041213,8.070045e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024180299,0.00015278069,0.16301626,0.0003328039,0.00065307616,0.0000021269266,0.0015303317,0.29736516,0.0055380543,0.12687579,0.0000145252825,0.4042773],"study_design_scores_gemma":[0.0011930938,0.00025804172,0.054184318,0.00017715934,0.00011896071,8.102776e-7,0.00045764455,0.86748654,0.06297988,0.013019041,0.000017411638,0.000107093445],"about_ca_topic_score_codex":0.00008759503,"about_ca_topic_score_gemma":0.000038618353,"teacher_disagreement_score":0.5701214,"about_ca_system_score_codex":0.000030247527,"about_ca_system_score_gemma":0.000033959514,"threshold_uncertainty_score":0.38959974},"labels":[],"label_agreement":null},{"id":"W4413298911","doi":"10.1038/s41534-025-01084-z","title":"Further improving quantum algorithms for nonlinear differential equations via higher-order methods and rescaling","year":2025,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Centre of Excellence for Quantum Computation and Communication Technology, Australian Research Council; Advanced Research Projects Agency","keywords":"Nonlinear system; Algorithm; Quantum; Order (exchange); Quantum computer; Computer science; Quantum algorithm; Differential equation; Mathematics; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.015224815975827722,"score_gpt":0.3062110477606575,"score_spread":0.2909862317848298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413298911","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009083052,0.00014147785,0.9861773,0.0019679824,0.0016995851,0.00048545064,0.00001633268,0.00031736333,0.00011141415],"genre_scores_gemma":[0.19759454,0.000014716364,0.801102,0.0007240167,0.00027151534,0.00008225819,0.00008771397,0.000018669296,0.00010460208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821335,0.00011916116,0.0006558787,0.00033472286,0.0002503905,0.00042649577],"domain_scores_gemma":[0.99834675,0.00054498314,0.00026617284,0.00045436466,0.0002958932,0.00009186108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074126705,0.00026192394,0.0002815757,0.00038084455,0.00051285356,0.0005134327,0.0004953658,0.00016244726,0.000006691014],"category_scores_gemma":[0.00023192765,0.00023233135,0.000105291736,0.0006135141,0.000061749175,0.001139716,0.0003175124,0.0002731657,0.000009306166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029384255,0.000046991838,0.000018074612,0.00015970845,0.000048373797,5.6726685e-7,0.0017500721,0.002427944,0.0012640824,0.098451816,0.00016207775,0.8956409],"study_design_scores_gemma":[0.00070714025,0.00010160085,0.00046694122,0.000056487475,0.000024487656,0.000005412162,0.00006253094,0.9750153,0.0005874618,0.013803347,0.008905674,0.00026361327],"about_ca_topic_score_codex":0.00006474055,"about_ca_topic_score_gemma":0.0000031696404,"teacher_disagreement_score":0.97258735,"about_ca_system_score_codex":0.00004770656,"about_ca_system_score_gemma":0.00011418378,"threshold_uncertainty_score":0.94741976},"labels":[],"label_agreement":null},{"id":"W4413335348","doi":"10.1002/qute.202500115","title":"Use of Electron Paramagnetic Resonance (EPR) Technique to Build Quantum Computers: <i>n</i> ‐Qubit ( <i>n</i> = 1–4) Toffoli Gates","year":2025,"lang":"en","type":"article","venue":"Advanced Quantum Technologies","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Mitacs; Concordia University","keywords":"Toffoli gate; Qubit; Electron paramagnetic resonance; Quantum computer; Quantum gate; Physics; Resonance (particle physics); Quantum mechanics; Quantum","score_opus":0.009452738686230887,"score_gpt":0.24933762955719105,"score_spread":0.23988489087096015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413335348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15690744,0.0046122945,0.8234954,0.008300571,0.0005701241,0.0013975707,0.000020649211,0.0045840736,0.00011188048],"genre_scores_gemma":[0.6584951,0.0005646332,0.3398488,0.00068967347,0.000018869387,0.000248585,0.000004309497,0.000036490568,0.000093506904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99612445,0.000117816795,0.0008649225,0.0013314479,0.00044897382,0.0011123723],"domain_scores_gemma":[0.9960463,0.00093714695,0.0003371051,0.002319221,0.00026774913,0.00009247786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035293246,0.00061563693,0.000835785,0.0008774583,0.00029791705,0.00020915932,0.00313611,0.0003412653,8.9287886e-7],"category_scores_gemma":[0.00071524543,0.0005655421,0.00020973622,0.0033123184,0.00039001618,0.0007024631,0.0018200929,0.000769701,0.000013233813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009859869,0.00027629218,0.00027064834,0.0001694294,0.000054261138,0.00005720711,0.00016850063,0.021722442,0.084726125,0.52249664,0.003129424,0.36683044],"study_design_scores_gemma":[0.0005729037,0.0013672194,0.0004535409,0.0011624696,0.000022574255,0.000053004464,0.00008944281,0.19122942,0.5354218,0.16768385,0.100964285,0.0009795248],"about_ca_topic_score_codex":0.00007206818,"about_ca_topic_score_gemma":0.000013014867,"teacher_disagreement_score":0.5015877,"about_ca_system_score_codex":0.000100931546,"about_ca_system_score_gemma":0.00015635732,"threshold_uncertainty_score":0.9996796},"labels":[],"label_agreement":null},{"id":"W4413377982","doi":"10.1088/2058-9565/adfc08","title":"Quantum ergodicity and scrambling in quantum annealers","year":2025,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut quantique; Université de Sherbrooke","funders":"Basic Energy Sciences; Office of Science; Canada First Research Excellence Fund; U.S. Department of Energy","keywords":"Scrambling; Quantum; Ergodicity; Physics; Mathematics; Quantum mechanics; Algorithm","score_opus":0.008200068785771427,"score_gpt":0.25407048449621616,"score_spread":0.24587041571044474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413377982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96286255,0.0013229778,0.020566104,0.013833339,0.00051798066,0.00020768963,0.0000014224493,0.00043062202,0.00025728674],"genre_scores_gemma":[0.99449164,0.00015773243,0.0047922535,0.00050174026,0.000018080762,0.000013049022,3.2822896e-7,0.0000070425854,0.000018140707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971752,0.000049788392,0.00039427777,0.0011413083,0.00038854385,0.00085087353],"domain_scores_gemma":[0.9987217,0.00016266767,0.00010725939,0.00068600033,0.00018936009,0.00013299678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014977424,0.00026298276,0.0003759901,0.002268928,0.00068846735,0.00031049107,0.0014844165,0.00020671543,0.0000011061023],"category_scores_gemma":[0.0004972348,0.00023345342,0.000028241368,0.0061853626,0.0019390034,0.00048917264,0.00126208,0.00058282766,0.0000045087763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007316022,0.00007666137,0.00904661,0.000041477826,0.000007207166,0.000060631977,0.00035081393,0.00024496793,0.007035388,0.8976469,0.0001164945,0.08536551],"study_design_scores_gemma":[0.00039077463,0.00016185577,0.007992357,0.0001232677,0.0000035904861,0.00007231605,0.00023570812,0.870201,0.0014442325,0.1180711,0.0010547591,0.0002490157],"about_ca_topic_score_codex":0.00013918024,"about_ca_topic_score_gemma":0.000034200733,"teacher_disagreement_score":0.8699561,"about_ca_system_score_codex":0.00006689888,"about_ca_system_score_gemma":0.00041300073,"threshold_uncertainty_score":0.95199543},"labels":[],"label_agreement":null},{"id":"W4413411942","doi":"10.1145/3721145.3730427","title":"Loop Fusion in Matrix Multiplications with Sparse Dependence","year":2025,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Fusion; Computer science; Sparse matrix; Matrix (chemical analysis); Algorithm; Materials science; Chemistry; Computational chemistry","score_opus":0.007644001875189667,"score_gpt":0.2556519803847705,"score_spread":0.24800797850958084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413411942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16315973,0.000061085004,0.83147836,0.0024998006,0.00007544585,0.00012505372,3.3567525e-7,0.00016031535,0.0024398856],"genre_scores_gemma":[0.76075906,0.000004763277,0.23755495,0.00026371976,0.000010491996,0.000009208045,5.5877604e-7,0.0000026864886,0.0013945841],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992311,0.000026662798,0.00012801577,0.00031494346,0.00012016169,0.0001791421],"domain_scores_gemma":[0.99937284,0.00008691981,0.000027317732,0.00044150837,0.000035778583,0.00003563381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121201774,0.00008558064,0.00008726428,0.00015920046,0.000091441296,0.00007521342,0.0005731103,0.00003138988,0.000005956256],"category_scores_gemma":[0.000015431951,0.00006185971,0.00001902059,0.00080560177,0.000022817532,0.00009989244,0.00024901578,0.00013726688,0.000022014523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022448186,0.00042537195,0.028617382,0.0000501697,0.000021772299,0.0000888405,0.001027625,0.10423139,0.003185454,0.3672388,0.0011344244,0.49395633],"study_design_scores_gemma":[0.00029123822,0.00002670141,0.020669915,0.00005882393,0.0000013828899,0.000011993821,0.000015810652,0.9745473,0.00082649133,0.002639194,0.00080761797,0.00010351055],"about_ca_topic_score_codex":0.0001366397,"about_ca_topic_score_gemma":0.00018175373,"teacher_disagreement_score":0.8703159,"about_ca_system_score_codex":0.00001811855,"about_ca_system_score_gemma":0.00007683056,"threshold_uncertainty_score":0.2522566},"labels":[],"label_agreement":null},{"id":"W4413456051","doi":"10.1145/3760771","title":"The Computational Advantage of MIP* Vanishes in the Presence of Noise","year":2025,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Beijing Nova Program; Nanjing University; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Quantum entanglement; Class (philosophy); Nondeterministic algorithm; Noise (video); Quantum; Mathematics; Discrete mathematics; Gas meter prover; Computer science; Upper and lower bounds; State (computer science); Theoretical computer science; Algorithm; Quantum mechanics; Physics; Artificial intelligence","score_opus":0.007256635957413665,"score_gpt":0.26129563607023243,"score_spread":0.25403900011281877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413456051","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90546745,0.0012471708,0.055405095,0.03634703,0.0009200999,0.00016210206,0.0000026508776,0.0000061269557,0.00044227112],"genre_scores_gemma":[0.97755384,0.00002557347,0.022101957,0.00023458357,0.000042965956,4.1763164e-7,3.1295546e-8,0.0000017635176,0.000038874336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885696,0.00021196817,0.00037641288,0.00007147201,0.00037798184,0.00010522578],"domain_scores_gemma":[0.99724096,0.0016137204,0.00039589335,0.0006103008,0.000125915,0.00001321586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010350362,0.00006184285,0.0001336447,0.000055560857,0.00011579044,0.00004708267,0.0048131105,0.000018442217,6.6370114e-7],"category_scores_gemma":[0.00067219755,0.000025821051,0.00012141545,0.00040570032,0.000107789005,0.00008273834,0.0007461102,0.00025921848,2.447104e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014819289,0.0005865761,0.019220272,0.00014961092,0.00022352676,0.00005844394,0.013520711,0.73691845,0.004931796,0.06105335,0.02132361,0.14186546],"study_design_scores_gemma":[0.0007755273,0.00020169349,0.20807931,0.000546623,0.000024417008,0.00021401662,0.00052541436,0.4392929,0.0028489095,0.34432772,0.0030525953,0.00011086867],"about_ca_topic_score_codex":0.0000074496716,"about_ca_topic_score_gemma":0.000002730906,"teacher_disagreement_score":0.29762554,"about_ca_system_score_codex":0.000010286683,"about_ca_system_score_gemma":0.000116142335,"threshold_uncertainty_score":0.89440364},"labels":[],"label_agreement":null},{"id":"W4413477226","doi":"10.1007/978-3-031-84869-8_13","title":"Hamiltonian Engineering with Time-Ordered Evolution for Unitary Control of Electron Spins in Semiconductor Quantum Dots","year":2025,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Spins; Hamiltonian (control theory); Unitary state; Electron; Condensed matter physics; Quantum dot; Semiconductor; Physics; Quantum mechanics; Mathematics; Political science","score_opus":0.005300208759490612,"score_gpt":0.20628459957885242,"score_spread":0.2009843908193618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413477226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004369546,0.00034408286,0.99114513,0.00009076566,0.00017345256,0.0012763684,0.00018539286,0.00013854138,0.0022766932],"genre_scores_gemma":[0.029667504,0.00004737156,0.96474403,0.00003150823,0.00010507325,0.000063606356,0.00002408551,0.00012178126,0.0051950365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764633,0.0000053661765,0.00085045054,0.0005800226,0.00038997858,0.00052787026],"domain_scores_gemma":[0.9983681,0.00036315084,0.00053316884,0.0003137205,0.00035054446,0.00007131417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048263263,0.0005150323,0.0008642323,0.0007387691,0.000055500703,0.00008252021,0.0007423886,0.00025017405,0.0000026147475],"category_scores_gemma":[0.00021941184,0.00049886445,0.00007690327,0.00020824173,0.00006935894,0.00011496077,0.0001689203,0.00066708314,0.0000026022255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002672416,0.00009736441,0.000035331053,0.0028852767,0.000096955875,0.000021315283,0.0010477754,0.0030583914,0.001166269,0.99023795,0.00015633386,0.0011703185],"study_design_scores_gemma":[0.0008476152,0.0002849316,0.00008891139,0.0025585154,0.000053452004,0.00001676599,0.000013041062,0.83557516,0.00021872215,0.15927753,0.00056623504,0.0004991368],"about_ca_topic_score_codex":0.000015309954,"about_ca_topic_score_gemma":0.000019991288,"teacher_disagreement_score":0.83251673,"about_ca_system_score_codex":0.00025634383,"about_ca_system_score_gemma":0.00029304967,"threshold_uncertainty_score":0.9997463},"labels":[],"label_agreement":null},{"id":"W4413527309","doi":"10.1038/s41467-025-63099-6","title":"Does provable absence of barren plateaus imply classical simulability?","year":2025,"lang":"en","type":"review","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Waterloo","funders":"Los Alamos National Laboratory; California Institute of Technology; U.S. Department of Energy; Advanced Scientific Computing Research; Engineering and Physical Sciences Research Council; Walter Burke Institute for Theoretical Physics; National Research Council of Thailand; Laboratory Directed Research and Development; Consejo Nacional de Investigaciones Científicas y Técnicas; National Physical Laboratory; Chulalongkorn University; Office of Science","keywords":"Computer science; Quantum; Plateau (mathematics); Perspective (graphical); Curse of dimensionality; Theoretical computer science; Quantum computer; Artificial intelligence; Mathematics; Physics; Quantum mechanics","score_opus":0.02054148937942803,"score_gpt":0.34139628493560964,"score_spread":0.3208547955561816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413527309","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010474608,0.99135745,0.004362454,0.001450347,0.00073581113,0.00074350124,0.00008875483,0.00022412048,0.0010365188],"genre_scores_gemma":[0.00040090646,0.92654145,0.07230532,0.000082902756,0.00007369008,0.00007421736,0.000074617215,0.000019335219,0.00042753044],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99729323,0.0005521168,0.00081913476,0.0006639613,0.00032715962,0.00034436898],"domain_scores_gemma":[0.9896583,0.002990217,0.00049065525,0.0064946157,0.00026443857,0.000101801175],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005260861,0.00041625425,0.0012795314,0.00030769844,0.00034329045,0.00013077116,0.00823145,0.0007921339,0.0000041208464],"category_scores_gemma":[0.0005873001,0.00024693002,0.00051988784,0.0015216244,0.00026766452,0.00013550452,0.0036885184,0.0030819986,0.000011253482],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.928418e-7,0.00013116712,0.000004479372,0.0033023,0.000074327974,0.0000014466982,0.00008608935,0.000038981318,3.739321e-7,0.02938693,0.0009876349,0.96598566],"study_design_scores_gemma":[0.00007517044,0.000026498972,0.000011568154,0.005486573,0.00008177657,0.000008792382,0.0000031499867,0.017675221,0.0000018563255,0.0021160732,0.9742185,0.0002948313],"about_ca_topic_score_codex":0.000014969055,"about_ca_topic_score_gemma":0.000038179096,"teacher_disagreement_score":0.97323084,"about_ca_system_score_codex":0.00008537631,"about_ca_system_score_gemma":0.0009970383,"threshold_uncertainty_score":0.9999983},"labels":[],"label_agreement":null},{"id":"W4413755271","doi":"10.1109/isvlsi65124.2025.11130303","title":"Optimization of Quantum Error Correcting Code under Temporal Variation of Qubit Quality","year":2025,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Qubit; Computer science; Variation (astronomy); Quantum; Code (set theory); Quality (philosophy); Error detection and correction; Algorithm; Physics; Quantum mechanics","score_opus":0.023701812083465806,"score_gpt":0.301329737799945,"score_spread":0.2776279257164792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413755271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08509255,0.000023003357,0.9129798,0.0006265854,0.0004982018,0.000097607015,0.0000022935888,0.00009752439,0.00058247906],"genre_scores_gemma":[0.79682976,8.9213705e-7,0.20292395,0.000095092015,0.000014823913,0.0000012387986,0.0000028384864,0.0000032293217,0.00012815086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998804,0.00014439195,0.0004674732,0.00024987428,0.00020040473,0.00013385706],"domain_scores_gemma":[0.99892074,0.0002488197,0.00028909493,0.00034102518,0.00017537664,0.000024952693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006173434,0.00009553089,0.00021596841,0.00014015168,0.00007523871,0.000029483883,0.00037563394,0.00005801966,0.000009654537],"category_scores_gemma":[0.00011128633,0.00008359122,0.00006568354,0.0006179175,0.00003438318,0.00011992381,0.00017067466,0.00009790078,6.716314e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008080386,0.00008100074,0.0015561447,0.00006433182,0.000021296952,2.2239355e-7,0.0005496086,0.86043006,0.00050260295,0.12889291,0.00005817643,0.007835556],"study_design_scores_gemma":[0.0002293332,0.000043653432,0.012328951,0.00005219423,0.00000514142,0.0000013136914,0.000093759554,0.9789037,0.0019170262,0.0063296543,0.000013066505,0.000082185514],"about_ca_topic_score_codex":0.00054617436,"about_ca_topic_score_gemma":0.000030809104,"teacher_disagreement_score":0.7117372,"about_ca_system_score_codex":0.000020615826,"about_ca_system_score_gemma":0.00012366088,"threshold_uncertainty_score":0.34087512},"labels":[],"label_agreement":null},{"id":"W4413973988","doi":"10.1088/2058-9565/ae0364","title":"Adiabatic dynamics of entanglement","year":2025,"lang":"en","type":"article","venue":"Quantum Science and Technology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Australian Research Council; National Research Council Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum entanglement; Adiabatic process; Statistical physics; Dynamics (music); Physics; Quantum mechanics; Quantum","score_opus":0.003949628738970784,"score_gpt":0.23415377888181083,"score_spread":0.23020415014284004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413973988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75151515,0.0002630867,0.2370622,0.009381316,0.00035334754,0.00012169661,0.0000015435876,0.00020098446,0.0011006689],"genre_scores_gemma":[0.98341435,0.000014469905,0.016425412,0.00010226283,0.0000038539847,0.0000044682047,2.150853e-7,0.0000017100058,0.000033268905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989607,0.000010485708,0.00018345159,0.0003520935,0.00021916514,0.00027410968],"domain_scores_gemma":[0.999262,0.00004218515,0.00006735501,0.00044336513,0.00014889023,0.000036219953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043253155,0.00008559061,0.00014349117,0.00077392504,0.00021177894,0.000045532895,0.0011383791,0.000051611143,0.0000011052915],"category_scores_gemma":[0.000118003416,0.00007160826,0.000016276113,0.003110884,0.00091277197,0.00011437496,0.0006605394,0.00011687631,0.0000016375119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.877385e-7,0.000022523867,0.0015356772,0.000010916668,0.0000033254048,0.0000028093514,0.00007734728,0.000011705333,0.003381631,0.8746878,0.000021014954,0.1202449],"study_design_scores_gemma":[0.00013345966,0.00013223068,0.0013849334,0.000041246458,0.0000033743315,0.000017525657,0.00015627971,0.79192483,0.0120417345,0.19373666,0.00034250144,0.00008524577],"about_ca_topic_score_codex":0.000015827181,"about_ca_topic_score_gemma":0.000009891906,"teacher_disagreement_score":0.7919131,"about_ca_system_score_codex":0.000048717506,"about_ca_system_score_gemma":0.00023394053,"threshold_uncertainty_score":0.33631462},"labels":[],"label_agreement":null},{"id":"W4413981801","doi":"10.3390/biomedinformatics5030051","title":"Quantum-Enhanced Dual-Backbone Architecture for Accurate Gastrointestinal Disease Detection Using Endoscopic Imaging","year":2025,"lang":"en","type":"article","venue":"BioMedInformatics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Moncton","keywords":"Dual (grammatical number); Architecture; Computer science; Quantum; Medicine; Artificial intelligence; Computer vision; Physics; Philosophy; History; Quantum mechanics","score_opus":0.012015752937972588,"score_gpt":0.265816544482688,"score_spread":0.2538007915447154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413981801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10301411,0.00007533729,0.8945797,0.0006060986,0.0009262248,0.00042050486,0.000018516057,0.00030304032,0.000056476663],"genre_scores_gemma":[0.6916149,0.0000028850172,0.30775398,0.00037601165,0.00016631519,0.000024809442,0.000012359199,0.00001308354,0.0000356271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983076,0.000032693082,0.0005235575,0.00030686878,0.00026817273,0.00056109915],"domain_scores_gemma":[0.9987089,0.0002312604,0.00022879239,0.00048812965,0.00015444936,0.00018849406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027449572,0.00027872712,0.00024746094,0.00044921186,0.00041834547,0.00033751497,0.00054940133,0.00003570005,0.0000016154117],"category_scores_gemma":[0.00023568491,0.00024397968,0.00013550905,0.00078768196,0.00009399879,0.00038534208,0.00030553766,0.00022743299,0.0000057844604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024422194,0.00033993967,0.000753821,0.0031294276,0.00015563928,0.00007521854,0.0046636225,0.10505523,0.070634745,0.014955218,0.0010158726,0.798977],"study_design_scores_gemma":[0.0006606342,0.00006894079,0.0005894121,0.00040098687,0.000022097782,0.00005065944,0.00006301204,0.9874486,0.0036582467,0.005844138,0.0009779418,0.00021533368],"about_ca_topic_score_codex":0.000008108787,"about_ca_topic_score_gemma":0.0000020312357,"teacher_disagreement_score":0.88239336,"about_ca_system_score_codex":0.00008312784,"about_ca_system_score_gemma":0.00022200805,"threshold_uncertainty_score":0.99492025},"labels":[],"label_agreement":null},{"id":"W4414021351","doi":"10.22331/q-2025-09-05-1848","title":"A Theory of Direct Randomized Benchmarking","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Science; Office of the Director of National Intelligence; Advanced Scientific Computing Research; U.S. Department of Energy","keywords":"Benchmarking; Randomized controlled trial; Computer science; Business; Medicine; Internal medicine; Marketing","score_opus":0.006763334639812611,"score_gpt":0.23531111289470497,"score_spread":0.22854777825489236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414021351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05179518,0.0014561821,0.9292515,0.00058465335,0.0010684603,0.0002096375,0.0000012461741,0.00018837578,0.015444783],"genre_scores_gemma":[0.9846893,0.000037517828,0.014680281,0.00023662124,0.000054185173,0.000009412883,7.516112e-7,0.0000049192204,0.00028703187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870795,0.00034619626,0.00030259718,0.000278575,0.00015727674,0.00020739262],"domain_scores_gemma":[0.99815875,0.0011924611,0.00011319663,0.00045171144,0.00005138569,0.000032514912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013995338,0.00012093481,0.00042332392,0.00017940979,0.00009361164,0.0000478738,0.0006441097,0.00004328552,0.000009556525],"category_scores_gemma":[0.00021444552,0.00009071093,0.00018926345,0.00048298165,0.00011231912,0.00006298982,0.00025295766,0.00012623095,0.0000042252263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047294027,0.00004002306,0.000030403828,0.000032683703,0.000059620073,0.0000052672635,0.000567486,0.00041057344,0.00020097611,0.9177336,0.00038498902,0.0800614],"study_design_scores_gemma":[0.009853243,0.000035653055,0.00020811107,0.0001481608,0.000016282185,0.0000032641233,0.00001102257,0.76115096,0.0012288222,0.22560404,0.00161983,0.00012058791],"about_ca_topic_score_codex":0.00001804397,"about_ca_topic_score_gemma":5.4165804e-7,"teacher_disagreement_score":0.9328941,"about_ca_system_score_codex":0.000009628086,"about_ca_system_score_gemma":0.00007202634,"threshold_uncertainty_score":0.36990842},"labels":[],"label_agreement":null},{"id":"W4414067394","doi":"10.1007/s00607-025-01547-3","title":"An experience-based classification of quantum bugs in quantum software","year":2025,"lang":"en","type":"article","venue":"Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Bundesministerium für Digitalisierung und Wirtschaftsstandort; Technische Universität München; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; European Commission","keywords":"Debugging; Quantum; Software; Quantum computer; Set (abstract data type); Quantum algorithm; Software bug","score_opus":0.018729021149814503,"score_gpt":0.29190807941563596,"score_spread":0.27317905826582145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414067394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47678092,0.000073079515,0.5223232,0.00020470169,0.00032867803,0.00008391612,5.99589e-7,0.00016042216,0.000044476074],"genre_scores_gemma":[0.93873465,9.507918e-7,0.06099826,0.00019686767,0.000046891073,0.0000043219916,0.000004084332,0.000009015378,0.0000049491346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980775,0.000174274,0.0005319359,0.00058915856,0.00025134615,0.00037577524],"domain_scores_gemma":[0.9984844,0.0003320663,0.00020590583,0.0007920818,0.000115790914,0.00006981072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005020895,0.00018938615,0.000289421,0.00040246246,0.00017645306,0.00011247111,0.0012593283,0.000089538495,0.000002023861],"category_scores_gemma":[0.0001375256,0.00018588368,0.000078417994,0.0012497833,0.000092731556,0.00017224559,0.00021930736,0.0002593666,0.0000027806955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026548067,0.00063667144,0.07445324,0.00022612368,0.000017468552,0.000027947623,0.008065212,0.31265715,0.008706081,0.13794242,0.0001395733,0.45710155],"study_design_scores_gemma":[0.00033456527,0.000073595795,0.073425405,0.00024432375,0.000001942086,0.000002091978,0.00012670869,0.92085767,0.0014771438,0.0031736973,0.00011414622,0.0001687367],"about_ca_topic_score_codex":0.00007887041,"about_ca_topic_score_gemma":0.00000540428,"teacher_disagreement_score":0.6082005,"about_ca_system_score_codex":0.000052846506,"about_ca_system_score_gemma":0.00020093308,"threshold_uncertainty_score":0.75801164},"labels":[],"label_agreement":null},{"id":"W4414147946","doi":"10.21203/rs.3.rs-7333122/v1","title":"Monte-Carlo Option Pricing in Quantum Parallel","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Valuation of options; Monte Carlo methods for option pricing; Quantum computer; Derivative (finance); Quantum; Valuation (finance); Computation; Finite difference methods for option pricing; Portfolio","score_opus":0.04632545727943883,"score_gpt":0.36627476300855516,"score_spread":0.31994930572911634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414147946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4785119,0.0057272436,0.49512088,0.010261541,0.002544598,0.0033877573,0.000059281796,0.0010468868,0.0033398934],"genre_scores_gemma":[0.9552671,0.00037599134,0.04289699,0.00007858069,0.00034558366,0.00019132919,0.000012560286,0.00002614852,0.0008057188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99460304,0.0009797543,0.00053953147,0.0013807336,0.0013804189,0.0011164944],"domain_scores_gemma":[0.996941,0.00067448616,0.00012278701,0.0016672458,0.00041035915,0.00018416671],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0028846967,0.0003644501,0.00050550944,0.0014449143,0.00030861268,0.0006351307,0.0028193484,0.00041396607,0.0000057217594],"category_scores_gemma":[0.00038932697,0.00034151407,0.00021145161,0.0015554315,0.000097575125,0.00015463166,0.0063264226,0.0037137729,0.000035244357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027504973,0.00025305396,0.0014415061,0.0013205354,0.00003881795,0.0002490702,0.0033852288,0.8739196,0.000025708272,0.029383898,0.0012338869,0.08872116],"study_design_scores_gemma":[0.00029898027,0.0001029158,0.008017723,0.0021728412,0.0000020625612,0.0000052905207,0.00008384929,0.9667608,0.000021469066,0.020869017,0.0013495171,0.0003155099],"about_ca_topic_score_codex":0.0012547842,"about_ca_topic_score_gemma":0.00011693058,"teacher_disagreement_score":0.4767552,"about_ca_system_score_codex":0.00037082852,"about_ca_system_score_gemma":0.00082659547,"threshold_uncertainty_score":0.9999037},"labels":[],"label_agreement":null},{"id":"W4414173764","doi":"10.1103/3yk8-qn64","title":"Understanding the physics of D-Wave annealers: From Schrödinger to Lindblad to Markovian dynamics","year":2025,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Adidas (Canada)","funders":"Gauss Centre for Supercomputing; Bundesministerium für Bildung und Forschung; Ministerium für Kultur und Wissenschaft des Landes Nordrhein-Westfalen; Neumann János Egyetem; Jülich Supercomputing Centre, Forschungszentrum Jülich","keywords":"Markov process; Master equation; Quantum annealing; Quantum; Lindblad equation; Physical system; Quantum dynamics; Qubit","score_opus":0.04089429657820613,"score_gpt":0.3432835279352749,"score_spread":0.30238923135706874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414173764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03385024,0.014499912,0.91697884,0.030090965,0.0004302907,0.002107588,0.00006037765,0.0001818365,0.0017999231],"genre_scores_gemma":[0.9499758,0.010097304,0.013419922,0.025156185,0.0009907304,0.0001920016,0.000025849833,0.000063979904,0.00007825813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962439,0.00040877078,0.00073996244,0.0010683144,0.0008449557,0.00069408625],"domain_scores_gemma":[0.9960258,0.0012654604,0.00032207745,0.0018096269,0.00021546234,0.0003615718],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005981095,0.00056134124,0.0015584087,0.000082932434,0.0002624117,0.00013668669,0.0019855287,0.0000435241,0.00000507627],"category_scores_gemma":[0.0007280328,0.0003806154,0.0008090866,0.003023395,0.00013669705,0.00019876665,0.0012740127,0.00068385014,0.00011885854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027303187,0.0010467833,0.00008941343,0.006004905,0.00033811777,0.000020908456,0.0012127481,0.0018744845,0.0037198237,0.35636345,0.01430654,0.61499554],"study_design_scores_gemma":[0.00028621702,0.00033904024,0.0004276379,0.03621209,0.00035502168,0.0000029802611,0.000031922635,0.73575366,0.0018025589,0.21222432,0.011724123,0.00084043824],"about_ca_topic_score_codex":0.000040869963,"about_ca_topic_score_gemma":0.000008956084,"teacher_disagreement_score":0.91612554,"about_ca_system_score_codex":0.00023459208,"about_ca_system_score_gemma":0.00015924522,"threshold_uncertainty_score":0.9998646},"labels":[],"label_agreement":null},{"id":"W4414285078","doi":"10.31234/osf.io/vw8n3_v1","title":"Quantum Computing for Neuroscience: Theory, Methods and Opportunities","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Alliance de recherche numérique du Canada; Fondation Brain Canada; Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données; Canada First Research Excellence Fund","keywords":"Artificial neural network; Probabilistic logic; Scalability; Quantum computer; Quantum; Formalism (music)","score_opus":0.06941437189026725,"score_gpt":0.3669798431536893,"score_spread":0.29756547126342203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414285078","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019092967,0.0006799461,0.98865384,0.00313722,0.0030020417,0.0004680706,0.000027013026,0.0005387857,0.0015837853],"genre_scores_gemma":[0.015476132,0.00010579503,0.9792433,0.0030389216,0.00021033805,0.00002525854,0.000006714084,0.000016325026,0.0018772323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972457,0.0004755176,0.00042418946,0.001154064,0.00021520391,0.00048531982],"domain_scores_gemma":[0.9971793,0.0014388248,0.00022219394,0.00087406434,0.0001394151,0.00014615573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027122486,0.00039000102,0.0004963427,0.00030425607,0.00046647748,0.0007722832,0.0018481782,0.00019418827,0.0000017042047],"category_scores_gemma":[0.00022885346,0.00032445407,0.00017859557,0.00017263474,0.0001909781,0.000093318864,0.005329773,0.00057937094,2.8373424e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026407965,0.000016920661,0.00000538012,0.00018024692,0.000011773196,0.000003863749,0.00050881086,0.004051556,0.00003315575,0.5491228,0.00039753655,0.44566527],"study_design_scores_gemma":[0.00010683138,0.000053270116,0.000098348755,0.000120359124,0.000012622769,0.000015120888,0.000034947676,0.7553165,0.00014394493,0.23558357,0.008233168,0.00028134018],"about_ca_topic_score_codex":0.000017899234,"about_ca_topic_score_gemma":5.6694097e-7,"teacher_disagreement_score":0.7512649,"about_ca_system_score_codex":0.000018664825,"about_ca_system_score_gemma":0.00035334722,"threshold_uncertainty_score":0.9999207},"labels":[],"label_agreement":null},{"id":"W4414370616","doi":"10.1103/9dxw-4c7y","title":"Universal Pulses for Superconducting Qudit Ladder Gates","year":2025,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Gauss Centre for Supercomputing; Bundesministerium für Bildung und Forschung; Deutsche Forschungsgemeinschaft","keywords":"Transmon; Quantum gate; Quantum computer; Qubit; Quantum decoherence; Quantum circuit; Scalability; Quantum; Quantum logic; Controlled NOT gate","score_opus":0.013123282062039563,"score_gpt":0.25858156373522206,"score_spread":0.2454582816731825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414370616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22448239,0.00063450536,0.7611291,0.009561609,0.002116884,0.00034953648,0.000009117901,0.00056102965,0.0011558158],"genre_scores_gemma":[0.9464123,0.00001187177,0.051787343,0.00063489494,0.00022616073,0.000017515042,0.0000059637164,0.000014982965,0.00088893215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987728,0.000048684687,0.00019869611,0.00045061696,0.00012983973,0.0003993806],"domain_scores_gemma":[0.99900883,0.0003878323,0.00005134209,0.0003903122,0.00010121826,0.00006048476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026131,0.00016638852,0.00019255248,0.0001592326,0.0003349553,0.00018047492,0.0007569515,0.000063451866,0.00000925171],"category_scores_gemma":[0.00013985902,0.00014774261,0.00010935394,0.00041855828,0.00005236333,0.00025233766,0.00028714916,0.00016890722,0.0000133154945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019350273,0.00014621974,0.0008314913,0.00017164937,0.00012851416,0.00002274558,0.0017343896,0.0034091582,0.0046731397,0.84854287,0.013751386,0.12656908],"study_design_scores_gemma":[0.0004907321,0.000099978715,0.00054055714,0.00009182805,0.000015188606,0.000012770134,0.00020810255,0.8922477,0.0038028732,0.057557374,0.04465448,0.00027841283],"about_ca_topic_score_codex":0.000055485678,"about_ca_topic_score_gemma":0.000007795755,"teacher_disagreement_score":0.8888385,"about_ca_system_score_codex":0.000028101058,"about_ca_system_score_gemma":0.000118475116,"threshold_uncertainty_score":0.6024769},"labels":[],"label_agreement":null},{"id":"W4414460923","doi":"10.1088/1402-4896/ae0b08","title":"Iterative qubit coupled cluster using only clifford circuits","year":2025,"lang":"en","type":"article","venue":"Physica Scripta","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dow Chemical (Canada)","funders":"","keywords":"Qubit; Correctness; Quantum computer; Overhead (engineering); Quantum circuit; Quantum; Convergence (economics); Topology (electrical circuits); Quantum algorithm","score_opus":0.01639305882825837,"score_gpt":0.26728556703810596,"score_spread":0.2508925082098476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414460923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17793423,0.00016159264,0.8139167,0.0026124606,0.0021378924,0.0002695011,0.00000484563,0.00029761513,0.002665189],"genre_scores_gemma":[0.97636116,0.0000019170081,0.019252643,0.0027752696,0.00028277453,0.000006431924,0.0000032692371,0.0000138346995,0.0013026808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984592,0.00008758693,0.00024180821,0.0005596996,0.0002455834,0.00040609145],"domain_scores_gemma":[0.99900043,0.000062865976,0.0000943076,0.0006516748,0.00011194289,0.00007880816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014834802,0.00022507427,0.0002760897,0.00013511402,0.00032487948,0.00035083425,0.00090533425,0.000049086535,0.0000043743657],"category_scores_gemma":[0.000028132887,0.00019987606,0.00013003558,0.0007297305,0.00006566459,0.00030996927,0.00047356068,0.0002671832,0.000029366782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042048203,0.0010885247,0.0011381162,0.00024231066,0.00050110737,0.00008638949,0.01111948,0.019169956,0.04198069,0.3760004,0.044753514,0.50387746],"study_design_scores_gemma":[0.00040306678,0.00004595279,0.0010998697,0.000110731504,0.000012923034,0.00000891414,0.00001633013,0.97990394,0.0006545739,0.009818843,0.0076998356,0.00022503291],"about_ca_topic_score_codex":0.000059092068,"about_ca_topic_score_gemma":0.000005519182,"teacher_disagreement_score":0.96073395,"about_ca_system_score_codex":0.000054162036,"about_ca_system_score_gemma":0.00018020632,"threshold_uncertainty_score":0.8150709},"labels":[],"label_agreement":null},{"id":"W4414475428","doi":"10.1016/j.patter.2025.101372","title":"Automating quantum computing laboratory experiments with an agent-based AI framework","year":2025,"lang":"en","type":"article","venue":"Patterns","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Vector Institute; University of Toronto","funders":"","keywords":"State (computer science); Quantum computer; Automation; Quantum; Scientific discovery; Laboratory automation","score_opus":0.010722508431441458,"score_gpt":0.28772244524205554,"score_spread":0.2769999368106141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414475428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43599522,0.000041342108,0.56260425,0.00048617783,0.0003484982,0.000085194195,0.0000036223842,0.0004032434,0.000032432526],"genre_scores_gemma":[0.8592521,3.2485067e-7,0.1370006,0.0036063527,0.000103753584,0.000007324538,0.0000050247195,0.00001659851,0.0000079021665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820745,0.00016576877,0.0002680461,0.00059520954,0.00031238704,0.00045111743],"domain_scores_gemma":[0.99873,0.00016581612,0.00012330669,0.0007674777,0.0000913591,0.000122014426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002544735,0.00024663177,0.00022835979,0.00016693224,0.00036035103,0.00037411964,0.000927753,0.000081251645,0.000009614131],"category_scores_gemma":[0.00002676807,0.00020997762,0.000050257433,0.000576989,0.000037880036,0.00019084818,0.0002536119,0.00038777446,0.00001169794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070457834,0.0016571084,0.36526272,0.0007650447,0.00035577788,0.00059350056,0.015610465,0.13803142,0.0035738996,0.065346874,0.0008423509,0.40789038],"study_design_scores_gemma":[0.00035045488,0.00015597627,0.021731159,0.0005626629,0.000006143003,0.000003026382,0.000064972744,0.97308713,0.003044646,0.0005679542,0.0001557788,0.0002700679],"about_ca_topic_score_codex":0.000052247473,"about_ca_topic_score_gemma":0.0000050600997,"teacher_disagreement_score":0.8350557,"about_ca_system_score_codex":0.00004641212,"about_ca_system_score_gemma":0.00015156949,"threshold_uncertainty_score":0.8562639},"labels":[],"label_agreement":null},{"id":"W4414523484","doi":"10.21203/rs.3.rs-6890100/v1","title":"A Graph-Based Classical and Quantum Approach to Deterministic L-System Inference","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Sequence (biology); Set (abstract data type); Inference; Quantum; Process (computing); Polynomial; Quantum algorithm; Time complexity","score_opus":0.05377337142764865,"score_gpt":0.36218901480453775,"score_spread":0.3084156433768891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414523484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026813624,0.00034902303,0.9656306,0.0018273238,0.00053680444,0.0014658687,0.00009662331,0.0005717214,0.0027084288],"genre_scores_gemma":[0.9280823,0.000009611848,0.071092926,0.00010742642,0.00019956929,0.00031980933,0.00002017743,0.000021708825,0.00014649642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942576,0.0010211508,0.0004663496,0.0017858611,0.001421616,0.0010474216],"domain_scores_gemma":[0.99550474,0.0014404574,0.00009931216,0.001866829,0.00051800534,0.0005706305],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018739168,0.00045035436,0.0006227697,0.0012476237,0.0005384204,0.0010992361,0.002698179,0.00039134992,9.770092e-7],"category_scores_gemma":[0.0005901097,0.00039093455,0.00018661271,0.0014252863,0.00024838813,0.000058066937,0.0059677195,0.00242966,0.000019644207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022028213,0.0013248343,0.0011476984,0.024393564,0.00021208636,0.0005964472,0.0055243648,0.17460747,0.00009978614,0.55553687,0.0051686834,0.2311679],"study_design_scores_gemma":[0.00024457328,0.0002782238,0.0019118263,0.0020940027,0.0000071867726,0.000012752677,0.00006962959,0.9874965,0.000039223494,0.006155827,0.0012864136,0.0004038602],"about_ca_topic_score_codex":0.00013344557,"about_ca_topic_score_gemma":0.000009047308,"teacher_disagreement_score":0.90126866,"about_ca_system_score_codex":0.000174706,"about_ca_system_score_gemma":0.0012938441,"threshold_uncertainty_score":0.9999377},"labels":[],"label_agreement":null},{"id":"W4414542268","doi":"10.1103/d9yg-d3qr","title":"Quantum optimal control of superconducting qubits based on machine-learning characterization","year":2025,"lang":"en","type":"article","venue":"Physical Review Applied","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Science; U.S. Department of Energy","keywords":"Qubit; Superconducting quantum computing; Characterization (materials science); Superconductivity; Quantum; Optimal control; Control (management)","score_opus":0.008713214415251068,"score_gpt":0.25730788721029835,"score_spread":0.24859467279504727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414542268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10762105,0.00067955564,0.8883808,0.001723638,0.00014420433,0.0005071108,0.000005827914,0.00018543794,0.00075234554],"genre_scores_gemma":[0.99500436,0.00007719378,0.0031896986,0.0015927498,0.00007246558,0.000028749846,0.000016191021,0.000009825981,0.000008787539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987314,0.00011990033,0.00029899753,0.00038479362,0.00024309607,0.00022185265],"domain_scores_gemma":[0.9990613,0.00031575045,0.00015401952,0.00036144917,0.000055916116,0.000051584182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031382721,0.00018462159,0.00047907722,0.00007409517,0.00011329274,0.000038471386,0.0004607407,0.000025123189,0.000004357895],"category_scores_gemma":[0.000105760984,0.00014820138,0.00013614542,0.0005423596,0.00003209942,0.000062328094,0.0000954687,0.00031395516,0.000013826379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038454797,0.00054208504,0.00012333305,0.002241332,0.00005921429,0.000004176962,0.00024946078,0.034436475,0.18968923,0.34413943,0.000033792236,0.428443],"study_design_scores_gemma":[0.00036266667,0.000070069735,0.00031117612,0.0009089741,0.000022225106,4.6730966e-7,0.0000014652389,0.9925197,0.0037246107,0.00059572613,0.0013464453,0.00013651731],"about_ca_topic_score_codex":0.0000036446456,"about_ca_topic_score_gemma":6.968883e-8,"teacher_disagreement_score":0.95808315,"about_ca_system_score_codex":0.000015337107,"about_ca_system_score_gemma":0.0000545612,"threshold_uncertainty_score":0.6043477},"labels":[],"label_agreement":null},{"id":"W4414611168","doi":"10.22331/q-2025-09-29-1865","title":"Sequency Hierarchy Truncation (SeqHT) for Adiabatic State Preparation and Time Evolution in Quantum Simulations","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Nuclear Physics; Office of Science; University of Washington; U.S. Department of Energy","keywords":"Adiabatic process; Observable; Quantum; Adiabatic quantum computation; Truncation (statistics); Quantum algorithm; Quantum computer; Hierarchy; Scalar (mathematics); Quantum process","score_opus":0.0080529901991459,"score_gpt":0.2675790016610734,"score_spread":0.2595260114619275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414611168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4939089,0.00016960675,0.50403976,0.00097236113,0.00021793607,0.0004879135,0.000012127235,0.00011848011,0.00007289088],"genre_scores_gemma":[0.9863991,0.000007301046,0.013115215,0.00010685856,0.000038458344,0.00004609865,0.000029370463,0.000009382078,0.00024822875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854016,0.00012368747,0.00040425386,0.00047305445,0.00015182624,0.00030701864],"domain_scores_gemma":[0.99897575,0.0003922197,0.00011886256,0.00035366218,0.00010265755,0.000056822006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041802495,0.00016378051,0.00020455975,0.00040064816,0.00023390555,0.00014246047,0.00027759356,0.00006889973,0.0000024957812],"category_scores_gemma":[0.00017418938,0.00016244702,0.00004788169,0.0007044208,0.000047943984,0.00037295325,0.000089699584,0.00013823317,0.000009042886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009397256,0.00027478707,0.002299799,0.00025304715,0.00005103449,0.0000052010887,0.0041763987,0.2383518,0.010095085,0.69268066,0.0007955084,0.050922684],"study_design_scores_gemma":[0.00039049643,0.00013718734,0.008492006,0.00006795834,0.0000058312903,0.000002150777,0.000006832663,0.7577672,0.0001226582,0.23261227,0.0002663062,0.0001290974],"about_ca_topic_score_codex":0.00006750037,"about_ca_topic_score_gemma":0.000032716012,"teacher_disagreement_score":0.5194154,"about_ca_system_score_codex":0.0001255606,"about_ca_system_score_gemma":0.00021766187,"threshold_uncertainty_score":0.6624397},"labels":[],"label_agreement":null},{"id":"W4414646765","doi":"10.1007/978-3-031-98245-3_6","title":"Quantum Optimization Techniques","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum; Quantum computer; Quantum algorithm; Optimization problem; Quantum annealing; Quantum phase estimation algorithm; Process (computing); Superposition principle; Computation","score_opus":0.008694914503137804,"score_gpt":0.22405960381930815,"score_spread":0.21536468931617034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414646765","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.437652e-8,0.000107905056,0.54146713,0.0005468265,0.00023721634,0.00010025339,0.0000021076971,0.00068205304,0.45685643],"genre_scores_gemma":[0.00001525108,0.000077849254,0.47405723,0.0005618094,0.00014279266,0.000003398996,0.000010975,0.00001682163,0.5251139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874437,0.0000120075565,0.0002680856,0.00054284785,0.0002383276,0.00019437916],"domain_scores_gemma":[0.9989106,0.00007149536,0.0001269743,0.0007312785,0.000103454404,0.000056166944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012612855,0.00029362974,0.00027528865,0.000282733,0.00011617389,0.00016974278,0.0009879185,0.00026603785,0.000090323185],"category_scores_gemma":[0.000010978513,0.00025174094,0.00013896888,0.00007006503,0.000035388308,0.000083997016,0.0005454454,0.00036255023,0.000030530737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.1332063e-7,0.0000046903724,7.607198e-8,0.000017566457,0.000014775416,0.000010294667,0.000014478258,0.0027978478,0.0000010603682,0.8330694,0.010460271,0.15360901],"study_design_scores_gemma":[0.00003223333,0.00004193211,2.21038e-7,0.00017601156,0.0000067872356,0.000010506958,2.2279599e-7,0.715035,0.00006305829,0.06622085,0.21815073,0.00026240753],"about_ca_topic_score_codex":0.000006961318,"about_ca_topic_score_gemma":9.1869214e-7,"teacher_disagreement_score":0.76684856,"about_ca_system_score_codex":0.000033943612,"about_ca_system_score_gemma":0.0001246472,"threshold_uncertainty_score":0.9999935},"labels":[],"label_agreement":null},{"id":"W4414720860","doi":"10.1007/978-3-031-98245-3_2","title":"Intro to Quantum Mechanics and Computing","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subatomic particle; Quantum; Duality (order theory); Open quantum system; Foundation (evidence); Quantum information science; Categorical quantum mechanics","score_opus":0.009174496784141223,"score_gpt":0.22416148624555013,"score_spread":0.2149869894614089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414720860","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013879642,0.00026457678,0.8917865,0.0020564892,0.0008491195,0.00022267019,0.000005064645,0.0004089999,0.104392685],"genre_scores_gemma":[0.0048537557,0.00009765235,0.5542396,0.009324227,0.00097176293,0.000004399023,0.000013078376,0.00009940798,0.43039617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815255,0.00001795914,0.00034419846,0.00085107685,0.00028543244,0.0003487696],"domain_scores_gemma":[0.99869794,0.00020616753,0.000113346185,0.0006984737,0.000092867536,0.00019118086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025297713,0.00039952435,0.0004514841,0.000324163,0.00019890754,0.0002731954,0.0009705089,0.00021471494,0.00001784633],"category_scores_gemma":[0.000029463637,0.0003550736,0.00010510835,0.0000980835,0.000016010275,0.00004942701,0.0020186058,0.0005063148,0.000049855826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011086537,0.0000034881277,1.8037622e-7,0.000027935599,0.000022781382,0.000017257564,0.00012402222,0.00029742921,0.0000037359498,0.8242941,0.0042759026,0.17093208],"study_design_scores_gemma":[0.0000890196,0.00009167049,0.0000021331837,0.0002529859,0.000009645741,0.000029007038,0.0000021718877,0.6816184,0.0000073050614,0.201796,0.115741916,0.0003597513],"about_ca_topic_score_codex":0.000013773522,"about_ca_topic_score_gemma":0.0000059673716,"teacher_disagreement_score":0.68132097,"about_ca_system_score_codex":0.000034637607,"about_ca_system_score_gemma":0.000100587386,"threshold_uncertainty_score":0.99989015},"labels":[],"label_agreement":null},{"id":"W4414727342","doi":"10.1007/978-3-031-98245-3_3","title":"Quantum and Classical Circuits","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum; Interconnectivity; Quantum network; Quantum technology; Quantum error correction; Quantum computer; Open quantum system; Quantum algorithm","score_opus":0.0127537081928307,"score_gpt":0.22330783312723027,"score_spread":0.21055412493439957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414727342","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000060098055,0.00056771823,0.34038284,0.0022882312,0.0005620568,0.00010424821,0.000004343134,0.0003194694,0.65576506],"genre_scores_gemma":[0.0018041668,0.00010626578,0.012862148,0.001184089,0.00029023233,0.000002185066,0.0000045561433,0.000022929418,0.9837234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985971,0.000013139456,0.00023142037,0.0006715432,0.00024429875,0.00024253677],"domain_scores_gemma":[0.99900204,0.00017175013,0.000078129655,0.00057928567,0.000048545327,0.000120241246],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000110165674,0.0003019512,0.00033686784,0.00017407692,0.00012443363,0.00019204343,0.0006838812,0.00025320626,0.000032782777],"category_scores_gemma":[0.000013796595,0.00024839077,0.0001073467,0.000043801447,0.00008290432,0.000055330187,0.0007205714,0.0005180252,0.000047100337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.4287476e-7,0.0000037715452,5.394075e-7,0.000020137959,0.000017126582,0.000026139332,0.000025292378,0.000010017841,0.000001462777,0.761962,0.00839656,0.22953671],"study_design_scores_gemma":[0.00012270163,0.00006517903,0.000019907558,0.00018362117,0.000011726669,0.000051863277,5.59139e-7,0.33978078,0.000006161345,0.22539008,0.4340102,0.00035723104],"about_ca_topic_score_codex":0.000003823654,"about_ca_topic_score_gemma":0.0000025758347,"teacher_disagreement_score":0.5365719,"about_ca_system_score_codex":0.00001854753,"about_ca_system_score_gemma":0.000120302226,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W4414730260","doi":"10.1007/978-3-031-98245-3_1","title":"Introduction to Quantum Computing","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum computer; Quantum; Quantum technology; Quantum network; Quantum algorithm; Quantum information science; Open quantum system; Space (punctuation)","score_opus":0.008406110030642277,"score_gpt":0.22636055388530424,"score_spread":0.21795444385466195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414730260","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009589203,0.00009195991,0.7081624,0.011423091,0.0024925426,0.00019372348,0.0000025491715,0.00059709785,0.27702704],"genre_scores_gemma":[0.00036424713,0.0000094329425,0.14748898,0.0020481562,0.004019257,0.0000016882431,0.000011613632,0.000032812866,0.8460238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979039,0.000019022127,0.00038130695,0.0010144492,0.00033760606,0.0003437383],"domain_scores_gemma":[0.998458,0.000105223124,0.00012772331,0.0010337187,0.00013590767,0.00013941704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025952925,0.00038087813,0.00039727427,0.00042294778,0.00020444104,0.00023562514,0.0011722202,0.00019669165,0.000087487664],"category_scores_gemma":[0.00003435538,0.000346414,0.00016508506,0.00014992998,0.000027568798,0.00006620467,0.0010949374,0.00053858245,0.0003901406],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011699752,0.000005216798,2.0009448e-7,0.000019284109,0.000021463813,0.000008963118,0.000080031605,0.0015994951,0.0000068385507,0.6946822,0.109404914,0.19417024],"study_design_scores_gemma":[0.000060276696,0.00007365882,0.000005125272,0.00012930676,0.000007902003,0.000023675539,0.0000010837856,0.3057238,0.000031456464,0.03210998,0.6614746,0.00035915573],"about_ca_topic_score_codex":0.0000124599355,"about_ca_topic_score_gemma":0.0000031865868,"teacher_disagreement_score":0.6625722,"about_ca_system_score_codex":0.000067788285,"about_ca_system_score_gemma":0.00011802762,"threshold_uncertainty_score":0.9998988},"labels":[],"label_agreement":null},{"id":"W4414730452","doi":"10.1007/978-3-031-98245-3_5","title":"Quantum Algorithms","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum network; Quantum algorithm; Quantum computer; Quantum error correction; Quantum gate; Quantum operation; Quantum technology; Open quantum system; Quantum process","score_opus":0.012173976105518184,"score_gpt":0.2304128165164841,"score_spread":0.21823884041096592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414730452","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.1146095e-7,0.00044419488,0.40310204,0.0010267957,0.0010957983,0.000113939735,0.0000069854464,0.0005400108,0.59366983],"genre_scores_gemma":[0.000039695566,0.000068405476,0.09057437,0.0010282214,0.00034831924,0.0000031292707,0.000010275326,0.00002772476,0.90789986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99797595,0.000015166806,0.00036964196,0.00086298096,0.0004070072,0.00036927024],"domain_scores_gemma":[0.99826926,0.00015144274,0.0001459034,0.0012009309,0.000105696476,0.00012678056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017262046,0.00046206347,0.00045365083,0.00031384462,0.00016635911,0.00022387253,0.0017792473,0.00032737592,0.00014847078],"category_scores_gemma":[0.000013225294,0.0003895753,0.00028084632,0.00008690331,0.0000609599,0.00008435144,0.0009863692,0.0006649216,0.00032839668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.774276e-7,0.0000060002526,1.4664889e-7,0.000018336206,0.000033453653,0.000044110246,0.000024512616,0.0000375773,8.257815e-7,0.75702316,0.023523847,0.21928756],"study_design_scores_gemma":[0.00008863984,0.000045598255,0.0000024358217,0.00014290254,0.000009693463,0.000024679703,3.8312515e-7,0.32082427,0.0000105370455,0.1873599,0.49112833,0.0003626465],"about_ca_topic_score_codex":0.000014660858,"about_ca_topic_score_gemma":0.000002578252,"teacher_disagreement_score":0.5696632,"about_ca_system_score_codex":0.00004323404,"about_ca_system_score_gemma":0.00022418128,"threshold_uncertainty_score":0.99985564},"labels":[],"label_agreement":null},{"id":"W4414730750","doi":"10.1007/978-3-031-98245-3_4","title":"Quantum Data Structures and Encoding","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Encoding (memory); Process (computing); Quantum; Computation; Quantum computer; Quantum algorithm; Data compression","score_opus":0.027843948277201998,"score_gpt":0.2578844174320892,"score_spread":0.23004046915488718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414730750","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018238354,0.002176061,0.3627693,0.0013073827,0.0011524343,0.00017984427,0.000060314058,0.0004497309,0.63188666],"genre_scores_gemma":[0.003849306,0.00055406033,0.26693216,0.0017722235,0.00083631236,0.0000016953309,0.00012338976,0.000056663135,0.7258742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832845,0.000013234457,0.00024283092,0.0009432818,0.00024460026,0.00022758855],"domain_scores_gemma":[0.99785185,0.00017655753,0.000107576416,0.0017420475,0.000036877973,0.00008509565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001726001,0.00031637604,0.00031964696,0.00018780996,0.00017253766,0.00030296648,0.0022429521,0.00018684739,0.00003924827],"category_scores_gemma":[0.000025727084,0.00025255,0.000047429978,0.00004192969,0.00006695669,0.0001399594,0.003738539,0.0004560595,0.00000915284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.514987e-7,0.0000013117502,0.000001204379,0.00003214297,0.0000267392,0.00002048178,0.00003567832,0.000016117001,0.000002857453,0.8395713,0.008482575,0.15180905],"study_design_scores_gemma":[0.00009071768,0.000027544489,0.000021033202,0.0001587305,0.000016489941,0.000049878956,0.0000015851759,0.4212618,0.000008101277,0.31715792,0.26085207,0.00035414207],"about_ca_topic_score_codex":0.000020328178,"about_ca_topic_score_gemma":0.000007667483,"teacher_disagreement_score":0.5224134,"about_ca_system_score_codex":0.000011776855,"about_ca_system_score_gemma":0.00011306252,"threshold_uncertainty_score":0.99999267},"labels":[],"label_agreement":null},{"id":"W4414730832","doi":"10.1007/978-3-031-98245-3_9","title":"Quantum Neural Networks (QNNs)","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Leverage (statistics); Artificial neural network; Generative grammar; Quantum; Quantum computer","score_opus":0.009893426211716261,"score_gpt":0.21799554878454877,"score_spread":0.2081021225728325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414730832","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021330159,0.0008886768,0.56240606,0.0008812905,0.0017664531,0.00012923109,0.0000036205247,0.0005430892,0.43337944],"genre_scores_gemma":[0.0018088142,0.00009439967,0.0209079,0.0024107958,0.00082923647,0.0000038953895,0.000019597426,0.000043723594,0.97388166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980217,0.00003112104,0.00037301428,0.00082391006,0.000316313,0.0004339252],"domain_scores_gemma":[0.9982991,0.00023908349,0.00015468012,0.0010931715,0.00008196031,0.00013195368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001953177,0.0004720755,0.0004512249,0.00021869596,0.00023397608,0.00026315296,0.0017269349,0.00034591422,0.00013782654],"category_scores_gemma":[0.000013057799,0.00039244303,0.000293139,0.000092762355,0.000061694045,0.000082854924,0.0010502952,0.0011597454,0.00007467731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014135425,0.0000059018926,7.040795e-7,0.000014679273,0.000032561835,0.000056899018,0.000020060064,0.008789291,2.3299272e-7,0.7885098,0.025312277,0.17725621],"study_design_scores_gemma":[0.000086821114,0.000048746355,0.0000046583305,0.00009239913,0.0000104650235,0.000026642916,3.8872295e-7,0.79863495,0.0000010058418,0.039292052,0.16144705,0.00035485154],"about_ca_topic_score_codex":0.000018637065,"about_ca_topic_score_gemma":0.00000595773,"teacher_disagreement_score":0.78984565,"about_ca_system_score_codex":0.000031251737,"about_ca_system_score_gemma":0.00008894616,"threshold_uncertainty_score":0.9998527},"labels":[],"label_agreement":null},{"id":"W4414733331","doi":"10.1007/978-3-031-98245-3_8","title":"Introduction to Quantum AI","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum; Quantum computer; Quantum entanglement; Work (physics); Quantum information","score_opus":0.006891117941063554,"score_gpt":0.2254531281662404,"score_spread":0.21856201022517685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414733331","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018770621,0.00008261753,0.65798134,0.041161288,0.0024518985,0.00016781439,0.0000032923433,0.00045260382,0.2976973],"genre_scores_gemma":[0.000065220156,0.000010535861,0.055057745,0.0042336658,0.0025833028,0.0000036233844,0.0000074769728,0.000019590858,0.93801886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983488,0.000012337758,0.0002655496,0.0008339357,0.0002842185,0.00025520936],"domain_scores_gemma":[0.9986457,0.000046754893,0.00006879326,0.0010037128,0.00011869973,0.00011631878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015453465,0.00030200853,0.00029789007,0.00035360907,0.00012191537,0.000192147,0.0009703243,0.00017685957,0.0001628169],"category_scores_gemma":[0.000022625525,0.0002619892,0.00013629334,0.00011242099,0.000022122382,0.00007351614,0.0006820645,0.0004826405,0.0005597372],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010930903,0.0000039199667,8.533329e-8,0.000010954486,0.000014272105,0.00000623176,0.00003091865,0.00039222452,0.0000051984894,0.6692841,0.2119527,0.118298315],"study_design_scores_gemma":[0.000044324603,0.00007376135,0.0000031516106,0.00006475433,0.0000063237644,0.000015607848,4.0588478e-7,0.09591452,0.000037065594,0.08328782,0.82027817,0.00027411035],"about_ca_topic_score_codex":0.000015231458,"about_ca_topic_score_gemma":0.000006122229,"teacher_disagreement_score":0.64032155,"about_ca_system_score_codex":0.0000482814,"about_ca_system_score_gemma":0.00012063621,"threshold_uncertainty_score":0.99998325},"labels":[],"label_agreement":null},{"id":"W4414733901","doi":"10.26434/chemrxiv-2025-cjbft","title":"Three Wrongs Can Make a Right: Concealing Antiaromaticity in π-Expanded [4n]–[4n]–[4n] Frameworks","year":2025,"lang":"en","type":"preprint","venue":"ChemRxiv","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; Israel Science Foundation","keywords":"Antiaromaticity; Ring (chemistry); Term (time); Context (archaeology); Current (fluid)","score_opus":0.01272106355094532,"score_gpt":0.2559803182971559,"score_spread":0.24325925474621057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414733901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44735062,0.0007266174,0.5432356,0.0034275046,0.0023859227,0.00077491405,0.000017312463,0.0007258673,0.0013556362],"genre_scores_gemma":[0.88348716,0.000051161183,0.11452511,0.001067111,0.0005339007,0.000081302525,0.000039781244,0.000046001776,0.00016848619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952828,0.0001562212,0.000995785,0.0018555204,0.000647894,0.0010617271],"domain_scores_gemma":[0.9963342,0.00047745203,0.0005149851,0.0022496313,0.00016270713,0.00026104573],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.00083721033,0.0008428903,0.0011829056,0.00045789787,0.00030336945,0.0006266732,0.003236544,0.0013690729,0.000023214589],"category_scores_gemma":[0.0001991314,0.0007870068,0.00040056635,0.0009450737,0.0002023713,0.0000754183,0.0038384756,0.0043812715,0.000012595153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010195095,0.0021945236,0.031382818,0.0068165646,0.0015158769,0.0026773745,0.039415702,0.22461149,0.0014749094,0.08188694,0.0048110695,0.6031108],"study_design_scores_gemma":[0.0006503285,0.000041695243,0.005773207,0.002488062,0.000037805683,0.000027102158,0.000029091345,0.8834983,0.00321359,0.10256435,0.0006160584,0.0010604226],"about_ca_topic_score_codex":0.00083485554,"about_ca_topic_score_gemma":0.00076046924,"teacher_disagreement_score":0.6588868,"about_ca_system_score_codex":0.00020899466,"about_ca_system_score_gemma":0.0006559636,"threshold_uncertainty_score":0.99992734},"labels":[],"label_agreement":null},{"id":"W4414754227","doi":"10.22331/q-2025-10-02-1873","title":"Backpropagation scaling in parameterised quantum circuits","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Electronic circuit; Backpropagation; Scaling; Artificial neural network; Quantum; Line (geometry); Quantum circuit; Sampling (signal processing)","score_opus":0.011601455727102491,"score_gpt":0.2539600600521433,"score_spread":0.24235860432504078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414754227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57130426,0.00017520961,0.42586502,0.00086628896,0.000865934,0.00016223082,0.00000102427,0.00022246192,0.000537568],"genre_scores_gemma":[0.99292487,0.00000859673,0.0064452556,0.00046458095,0.00005546424,0.000015237153,0.0000032572148,0.000010651586,0.00007207608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981432,0.00015322432,0.00042229987,0.0005792994,0.00024147972,0.0004605054],"domain_scores_gemma":[0.9989615,0.00020912143,0.00009904036,0.0006020124,0.000058030066,0.00007030417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005233229,0.00020263805,0.0002682679,0.00038899106,0.00015335254,0.00021788354,0.000842224,0.00010052146,0.000005731137],"category_scores_gemma":[0.00012392543,0.0001907592,0.00008783458,0.0012277527,0.000046967383,0.00021637089,0.00023445327,0.00032480914,0.000045984034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001710319,0.0003206031,0.0060771555,0.00016917964,0.00004051664,0.00012930436,0.0018975108,0.014349567,0.008050534,0.5403006,0.00094129844,0.4277066],"study_design_scores_gemma":[0.00041276545,0.00004851982,0.017475361,0.0001716833,0.0000031243226,0.000007883144,0.00002918233,0.9147067,0.000732632,0.06565692,0.00054459966,0.00021063081],"about_ca_topic_score_codex":0.000053585813,"about_ca_topic_score_gemma":0.0000041836893,"teacher_disagreement_score":0.9003571,"about_ca_system_score_codex":0.000060172424,"about_ca_system_score_gemma":0.00009138664,"threshold_uncertainty_score":0.7778934},"labels":[],"label_agreement":null},{"id":"W4414763801","doi":"10.1088/1367-2630/ae0ea9","title":"Photonic processor benchmarking for variational quantum process tomography","year":2025,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Bundesministerium für Bildung und Forschung; Deutsche Forschungsgemeinschaft","keywords":"Benchmark (surveying); Dephasing; Photonics; Quantum computer; Quantum algorithm; Quantum; Quantum process; Noise (video); Quantum tomography; Quantum circuit","score_opus":0.009875567160503673,"score_gpt":0.2652528911322451,"score_spread":0.2553773239717414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414763801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018084796,0.00025203387,0.9793868,0.0011389722,0.00085353584,0.00012213916,0.0000018843011,0.000028906177,0.00013089794],"genre_scores_gemma":[0.7821512,0.000008198512,0.21596214,0.00048589578,0.0013239718,0.000004800521,0.0000015487707,0.000010589751,0.000051625837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892443,0.000022454573,0.00033879082,0.00018891097,0.0003065128,0.00021892558],"domain_scores_gemma":[0.9988099,0.00018433575,0.00036944103,0.00015812823,0.0004015728,0.00007662141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029001583,0.00012937884,0.00021859359,0.00014553253,0.00015999397,0.00014586374,0.00076746126,0.000041190822,0.0000017644497],"category_scores_gemma":[0.000043904718,0.000107556414,0.00019519575,0.0007523495,0.000020040286,0.0002992249,0.00006284508,0.00023076945,4.7462515e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007456428,0.00036436768,0.00075292547,0.00031572557,0.00028352262,0.0000097974935,0.0022603436,0.07182718,0.0012404223,0.30520284,0.0050222212,0.6126461],"study_design_scores_gemma":[0.00073144725,0.00021719179,0.0005591472,0.00021491143,0.000025257572,0.00001945727,0.000012670703,0.60812086,0.0035565484,0.384327,0.0020861146,0.00012940797],"about_ca_topic_score_codex":0.000002282457,"about_ca_topic_score_gemma":4.985818e-7,"teacher_disagreement_score":0.76406646,"about_ca_system_score_codex":0.000022520324,"about_ca_system_score_gemma":0.0007258941,"threshold_uncertainty_score":0.43860233},"labels":[],"label_agreement":null},{"id":"W4414792684","doi":"10.1016/j.laa.2025.10.001","title":"Laplacian quantum walks on blow-up graphs","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Science and Engineering Research Board; University of Manitoba","keywords":"Quantum walk; Adjacency matrix; Laplacian matrix; Laplace operator; Vertex (graph theory); Quantum; Graph; Hamiltonian (control theory); Quantum graph","score_opus":0.007649051680160051,"score_gpt":0.24914379038052673,"score_spread":0.24149473870036667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414792684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30135855,0.0013794111,0.6686819,0.01631395,0.00076891226,0.0010651598,0.000031089683,0.0009595496,0.00944146],"genre_scores_gemma":[0.9891351,0.00007938472,0.007324984,0.0021281606,0.00012372233,0.000096196745,0.000010633068,0.0000112107555,0.0010906489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901617,0.000026810283,0.00018064397,0.00043121263,0.00012446633,0.00022071142],"domain_scores_gemma":[0.99921453,0.00013009417,0.000047425856,0.00046384285,0.00005524357,0.00008885847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010693085,0.00014321804,0.00013741087,0.00015791756,0.0003680808,0.00009976346,0.00049205666,0.00006725839,0.00000748286],"category_scores_gemma":[0.000014091795,0.00012373347,0.00005575947,0.00064451556,0.000036016158,0.0000678044,0.00017223548,0.0002102185,0.000062455336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018541335,0.000047085476,0.00001665633,0.000013817182,0.000012603924,6.9962715e-7,0.00010608825,0.000059057205,0.00022187021,0.9040978,0.00054609217,0.09487638],"study_design_scores_gemma":[0.00034239521,0.00007666843,0.0008226535,0.000046864814,0.000013064749,0.000007473271,0.000018542134,0.7779386,0.0018476867,0.08758187,0.13105947,0.00024471618],"about_ca_topic_score_codex":0.0000056629474,"about_ca_topic_score_gemma":0.0000023329,"teacher_disagreement_score":0.8165159,"about_ca_system_score_codex":0.000007847087,"about_ca_system_score_gemma":0.000047454265,"threshold_uncertainty_score":0.5045704},"labels":[],"label_agreement":null},{"id":"W4414946487","doi":"10.1038/s41534-025-01045-6","title":"SU(d)-symmetric random unitaries: quantum scrambling, error correction, and machine learning","year":2025,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Army Research Office; Air Force Office of Scientific Research; Multidisciplinary University Research Initiative; U.S. Department of Energy; Office of Science; University of Chicago; International Business Machines Corporation; National Science Foundation","keywords":"Quantum error correction; Quantum algorithm; Quantum; Quantum information; Qubit; Basis (linear algebra); Quantum computer; Quantum capacity; Pauli exclusion principle","score_opus":0.010582398833568155,"score_gpt":0.23483728017448344,"score_spread":0.22425488134091529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414946487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09261654,0.00056705764,0.9002647,0.0014569629,0.0023816037,0.00028988777,0.000003506159,0.0006214441,0.0017983392],"genre_scores_gemma":[0.9946683,0.00011922446,0.004039286,0.00076545245,0.00006414425,0.000015223379,0.000054548174,0.000009306848,0.0002645117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826556,0.00013906568,0.00059507554,0.00027491077,0.00034407352,0.00038131175],"domain_scores_gemma":[0.9986418,0.00042492241,0.00027683013,0.00036055787,0.00019372048,0.0001021596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085690885,0.00025534714,0.00029168933,0.0010162859,0.0007807901,0.0007678342,0.00048336276,0.00013053624,0.00000568766],"category_scores_gemma":[0.0007567996,0.00022662323,0.00007901811,0.0019523484,0.00007340536,0.001547257,0.00029454014,0.0005639865,0.00004639496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020365303,0.00009446222,0.0042490633,0.00020396138,0.00010598195,0.000008676713,0.0065129846,0.029815461,0.000043022887,0.37260085,0.0050654816,0.5810964],"study_design_scores_gemma":[0.001219279,0.00013282521,0.0023035978,0.00008697576,0.000013279799,0.0000422001,0.0001954887,0.9373223,0.000056726247,0.005037654,0.053357404,0.00023224016],"about_ca_topic_score_codex":0.00034274955,"about_ca_topic_score_gemma":0.000014654277,"teacher_disagreement_score":0.9075069,"about_ca_system_score_codex":0.000058594575,"about_ca_system_score_gemma":0.00013733427,"threshold_uncertainty_score":0.9241427},"labels":[],"label_agreement":null},{"id":"W4414961962","doi":"10.1016/j.disc.2025.114832","title":"Quantum walks on join graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Adjacency matrix; Join (topology); Vertex (graph theory); Adjacency list; Graph; Laplacian matrix; Laplace operator","score_opus":0.010692196613908026,"score_gpt":0.2534811998179653,"score_spread":0.24278900320405727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414961962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07489926,0.00009711578,0.9020227,0.0030535294,0.0006812025,0.00021298132,0.0000045141883,0.00045752848,0.018571164],"genre_scores_gemma":[0.8134623,0.000012351778,0.18389514,0.0013443526,0.000061064035,0.000017266913,0.0000039366137,0.000023086837,0.0011804679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877673,0.000040057694,0.00028052146,0.0003338161,0.00026268268,0.00030620338],"domain_scores_gemma":[0.99878657,0.00021600345,0.000086916516,0.0008083827,0.000037181075,0.00006497014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002518029,0.00019419886,0.00023345639,0.00019050448,0.00018577056,0.0001878054,0.0008879667,0.000061247054,0.0000067394994],"category_scores_gemma":[0.000077008684,0.00014751039,0.00013133351,0.0005316276,0.00004727509,0.00006833266,0.00028303755,0.00022651539,0.000065805965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013301578,0.000071175775,0.00001370025,0.00006839725,0.000021783613,0.000010165311,0.0007842601,0.0004892532,0.00011885241,0.98521465,0.0017259083,0.011480515],"study_design_scores_gemma":[0.00014418499,0.000054158274,0.00015824754,0.00016705407,0.000006107566,0.000005824142,0.000040260908,0.62016135,0.00052591355,0.37722477,0.0013648052,0.00014729176],"about_ca_topic_score_codex":0.000004068663,"about_ca_topic_score_gemma":7.605539e-7,"teacher_disagreement_score":0.73856306,"about_ca_system_score_codex":0.00001743065,"about_ca_system_score_gemma":0.000040000094,"threshold_uncertainty_score":0.6015299},"labels":[],"label_agreement":null},{"id":"W4414974863","doi":"10.1098/rsta.2024.0420","title":"State transfer in chiral quantum walks","year":2025,"lang":"en","type":"article","venue":"Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McMaster University; University of Waterloo; York University","funders":"","keywords":"Quantum walk; Conjecture; Quantum; Transfer (computing); Quantum network; Graph; Spectral gap; Quantum state","score_opus":0.009682704339809207,"score_gpt":0.22586011351703486,"score_spread":0.21617740917722567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414974863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28764513,0.00004323706,0.7050032,0.0068742125,0.00009371738,0.000097504955,0.0000023264429,0.000059433125,0.00018123824],"genre_scores_gemma":[0.9914824,0.0000037243415,0.008373915,0.000078479985,0.000023842062,0.000008202858,4.4838263e-8,0.00000368098,0.00002570725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896103,0.000027826862,0.00022295916,0.0002757859,0.00025732905,0.00025505817],"domain_scores_gemma":[0.99941874,0.0003021048,0.000016186854,0.00018989046,0.000015373842,0.00005768468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024583848,0.0001417277,0.00024572524,0.000040840754,0.00018680478,0.00005623138,0.00061042485,0.000044671488,0.0000016942869],"category_scores_gemma":[0.000023632118,0.00008855621,0.0002361975,0.00073520094,0.00035823463,0.000094890325,0.000058075217,0.00035874546,7.863418e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033461247,0.0003617268,0.000015443191,0.00024771312,0.00003704066,6.05431e-7,0.0015422985,0.33699635,0.00054460607,0.6557288,0.0000041333615,0.004517942],"study_design_scores_gemma":[0.000101136095,0.00003290035,0.00039152126,0.000093336064,0.000005908295,9.3707575e-7,0.0000064192473,0.65666306,0.0003193047,0.34231234,0.0000051088305,0.00006802416],"about_ca_topic_score_codex":0.000007831508,"about_ca_topic_score_gemma":2.435928e-7,"teacher_disagreement_score":0.7038373,"about_ca_system_score_codex":0.000012967623,"about_ca_system_score_gemma":0.0000308594,"threshold_uncertainty_score":0.36112174},"labels":[],"label_agreement":null},{"id":"W4414993016","doi":"10.1103/cjb4-l57n","title":"Single-shot and measurement-based quantum error correction via fault complexes","year":2025,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; Xanadu Quantum Technologies (Canada)","funders":"Alliance de recherche numérique du Canada; University of Toronto; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Quantum; Quantum error correction; Quantum computer; Formalism (music); Computation; Quantum algorithm; Lattice (music); Topology (electrical circuits); Scalability","score_opus":0.03526146302989172,"score_gpt":0.34244460631454554,"score_spread":0.3071831432846538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414993016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06552974,0.16278134,0.7491848,0.015983902,0.0015732538,0.0028281198,0.000014971587,0.00085694843,0.001246956],"genre_scores_gemma":[0.9763542,0.009329858,0.002991231,0.010627411,0.0004332879,0.00017059466,0.000016936721,0.000042261203,0.00003422298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598247,0.0005749144,0.0006761883,0.0011280501,0.0010035458,0.0006348102],"domain_scores_gemma":[0.9973753,0.0005512587,0.00034124983,0.0010715282,0.00037769676,0.00028297637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007496703,0.0005922395,0.0014805152,0.000099712626,0.0003142326,0.00014957528,0.0009900182,0.000044294044,0.0000052402956],"category_scores_gemma":[0.0007968347,0.00045716218,0.00059714454,0.0014842241,0.00019919827,0.00024480186,0.0004048878,0.0006249129,0.00007773543],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019514087,0.0020457245,0.00007063895,0.012901696,0.00012731086,0.000013991306,0.000093385745,0.00020787465,0.053260453,0.01820953,0.013058701,0.89999115],"study_design_scores_gemma":[0.0004982742,0.00049502886,0.0006967212,0.026381385,0.00032595554,0.000014648825,0.0000028435702,0.87070245,0.009624103,0.021450466,0.06899362,0.00081449543],"about_ca_topic_score_codex":0.000033893677,"about_ca_topic_score_gemma":0.000007367288,"teacher_disagreement_score":0.9108245,"about_ca_system_score_codex":0.00011850129,"about_ca_system_score_gemma":0.00015039722,"threshold_uncertainty_score":0.999788},"labels":[],"label_agreement":null},{"id":"W4415070424","doi":"10.1016/j.comptc.2025.115541","title":"Systematic evaluation of hardware-efficient ansätze for accurate quantum chemistry calculation in hybrid quantum algorithms","year":2025,"lang":"en","type":"article","venue":"Computational and Theoretical Chemistry","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; National Research Council Canada","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Council Canada; Defence Research and Development Canada","keywords":"Qubit; Scalability; Quantum; Coupled cluster; Quantum circuit; Quantum chemistry; Quantum chemical; Quantum algorithm; Ansatz","score_opus":0.010743992055381806,"score_gpt":0.27765224964456464,"score_spread":0.26690825758918285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415070424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3280605,0.00040177812,0.67044705,0.00036532784,0.000094357376,0.0003666582,0.000018084771,0.000042172913,0.00020408879],"genre_scores_gemma":[0.99356884,0.0000019011807,0.006210152,0.000040762723,0.00004044193,0.00006672697,0.000047951944,0.000007898673,0.000015331516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807197,0.00010684021,0.00060614164,0.00048123187,0.0004917297,0.00024207355],"domain_scores_gemma":[0.9982141,0.0008407189,0.00018005769,0.00025785473,0.0004324443,0.00007481398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012952139,0.00019899443,0.00036050632,0.00006105795,0.000109968765,0.00008210549,0.00035490806,0.00008633051,0.000009308247],"category_scores_gemma":[0.00053498906,0.00017594677,0.00010178648,0.0003182159,0.00022110045,0.000052757165,0.00015836186,0.0001613785,7.615209e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003210936,0.00022205565,0.000038634673,0.0070748515,0.00006448415,0.0000040300843,0.00021575749,0.5051136,0.002094714,0.48158634,0.000027350752,0.0035260876],"study_design_scores_gemma":[0.000668847,0.000012622534,0.0002576772,0.0009422898,0.00003328335,0.000015660231,0.000020216658,0.76826066,0.0047484036,0.22490321,0.000002397552,0.0001347352],"about_ca_topic_score_codex":0.0000022993027,"about_ca_topic_score_gemma":3.8898552e-8,"teacher_disagreement_score":0.66550833,"about_ca_system_score_codex":0.00007107534,"about_ca_system_score_gemma":0.0002172747,"threshold_uncertainty_score":0.71749014},"labels":[],"label_agreement":null},{"id":"W4415264086","doi":"10.22331/q-2025-10-16-1885","title":"Conditional disclosure of secrets with quantum resources","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Ministry of Colleges and Universities; Institut Périmètre de physique théorique; Industry Canada; Government of Canada","keywords":"Quantum information science; Quantum entanglement; Context (archaeology); Quantum; Relevance (law); Task (project management); Cryptography; Quantum cryptography; Function (biology)","score_opus":0.005028231079314357,"score_gpt":0.22333775391621358,"score_spread":0.21830952283689922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415264086","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58609766,0.00032079653,0.40871432,0.002501924,0.00031094928,0.00013123764,0.000016064787,0.00018528411,0.0017217811],"genre_scores_gemma":[0.9915677,0.0000043891805,0.007806762,0.00026419017,0.000060764363,0.000007071788,0.000008983102,0.000009019547,0.00027114776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998557,0.000085183376,0.00028522176,0.00041398432,0.00036048185,0.0002981833],"domain_scores_gemma":[0.9989206,0.00020894973,0.00014296996,0.0005445227,0.00011198241,0.000070944036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022668508,0.0001861595,0.00026957426,0.0001953506,0.00017735634,0.0000812101,0.0008145015,0.000067088215,0.00001552729],"category_scores_gemma":[0.00003302309,0.00013606495,0.00008600236,0.00065716705,0.00017099951,0.00013055527,0.00022236755,0.00022487006,0.00001025232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038038153,0.00015069357,0.0028132864,0.000105967585,0.000093766146,0.00004208516,0.0009366237,0.0033570381,0.0007215281,0.9835458,0.002709858,0.005485315],"study_design_scores_gemma":[0.00085523655,0.0004735566,0.03392933,0.00035464458,0.00002270821,0.000045914927,0.000117301104,0.8145877,0.0017775552,0.13266549,0.014798463,0.00037206584],"about_ca_topic_score_codex":0.000037572747,"about_ca_topic_score_gemma":0.0000058960195,"teacher_disagreement_score":0.8508803,"about_ca_system_score_codex":0.000014948011,"about_ca_system_score_gemma":0.00013171665,"threshold_uncertainty_score":0.5548568},"labels":[],"label_agreement":null},{"id":"W4415272780","doi":"10.48550/arxiv.2510.12771","title":"Trajectory-Protected Quantum Computing","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; University of Waterloo; Institut Périmètre de physique théorique; Industry Canada; Government of Canada","keywords":"Quantum error correction; Quantum computer; Quantum network; Quantum gate; Quantum algorithm; Quantum decoherence; Open quantum system; Quantum information; Quantum technology; Quantum entanglement","score_opus":0.028595438282798556,"score_gpt":0.26690473018363475,"score_spread":0.2383092919008362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415272780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54284877,0.00046263033,0.4501869,0.0010884592,0.0032031198,0.00042556526,0.000014846308,0.0012221029,0.0005475785],"genre_scores_gemma":[0.9221854,0.000022034472,0.07570401,0.00073809887,0.00080584007,0.000025899644,0.000025947262,0.000039174025,0.00045356277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959943,0.00031834882,0.0007094147,0.0016644374,0.00048370654,0.00082976464],"domain_scores_gemma":[0.99679565,0.00030825287,0.0004284237,0.0020609526,0.00021081255,0.00019593102],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00055960595,0.0006797725,0.00075250136,0.0003983679,0.00044860883,0.00033387577,0.003483227,0.00048758558,0.000012664598],"category_scores_gemma":[0.00017080903,0.00065102323,0.00040349897,0.00077055796,0.000102572885,0.000101490186,0.0050670253,0.0023300336,0.00008916196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011338459,0.0014650434,0.09869315,0.004019058,0.001685626,0.0010983918,0.015435929,0.40135738,0.0035032104,0.037338406,0.009473121,0.42581728],"study_design_scores_gemma":[0.00037535184,0.00009932115,0.04883201,0.0007977172,0.000028832108,0.000021888503,0.000016976795,0.9415127,0.0007113905,0.0044360333,0.0023112278,0.0008565613],"about_ca_topic_score_codex":0.00022146378,"about_ca_topic_score_gemma":0.000010270466,"teacher_disagreement_score":0.5401553,"about_ca_system_score_codex":0.00011079941,"about_ca_system_score_gemma":0.00051702274,"threshold_uncertainty_score":0.9999716},"labels":[],"label_agreement":null},{"id":"W4415306018","doi":"10.1017/9781009514750.005","title":"Quantum Algorithms","year":2025,"lang":"","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum computer; Field (mathematics); Quantum information science; Reading (process); Quantum; Quantum information; Focus (optics)","score_opus":0.017449038761173506,"score_gpt":0.20784792382688538,"score_spread":0.19039888506571187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415306018","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009868643,0.0005490681,0.2156419,0.00022079868,0.0031024718,0.00079054316,0.00037199404,0.0005833236,0.7786412],"genre_scores_gemma":[0.001744197,0.0003496202,0.008631061,0.0003421564,0.00060918526,0.0000011149826,0.000037731224,0.000083569925,0.9882014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938596,0.0002579799,0.00079070585,0.0027182307,0.0010020575,0.0013714232],"domain_scores_gemma":[0.99469703,0.00045346087,0.0007662131,0.0027458475,0.0006316316,0.00070583244],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0004408246,0.0015426025,0.0014343843,0.0008964767,0.001475174,0.00057418767,0.0049192472,0.0010707137,0.000008400698],"category_scores_gemma":[0.000037707807,0.0018440754,0.0010737948,0.00010116502,0.0008790388,0.0002800519,0.0051219948,0.0023902175,0.000059956208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006231849,0.00004841728,9.078334e-7,0.00023288857,0.00038834804,0.0015105332,0.00013751735,0.00025204112,0.000021257523,0.89440453,0.015223888,0.08771737],"study_design_scores_gemma":[0.0008804627,0.00019773674,0.000014301452,0.00089916866,0.00025553154,0.00008716906,0.000019142,0.3411419,0.00016836492,0.000067887624,0.65499693,0.0012714027],"about_ca_topic_score_codex":0.00045912998,"about_ca_topic_score_gemma":0.0000012888125,"teacher_disagreement_score":0.89433664,"about_ca_system_score_codex":0.00036588096,"about_ca_system_score_gemma":0.00081708253,"threshold_uncertainty_score":0.9999113},"labels":[],"label_agreement":null},{"id":"W4415306198","doi":"10.1017/9781009514750.011","title":"Variations on the DiVincenzo Criteria","year":2025,"lang":"","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum computer; Field (mathematics); Reading (process); Focus (optics); Quantum information science; Quantum","score_opus":0.02067479179749771,"score_gpt":0.2126280422684803,"score_spread":0.1919532504709826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415306198","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012208048,0.00008208319,0.13458666,0.0013103144,0.0020522543,0.00077653397,0.00039176326,0.00026034017,0.86041796],"genre_scores_gemma":[0.015081671,0.000075681986,0.0020754505,0.0011251125,0.00046070048,0.0000017617559,0.000018349489,0.00004193575,0.98111933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963141,0.00035956863,0.0004447861,0.0014846248,0.0006644509,0.0007324794],"domain_scores_gemma":[0.99538463,0.0011544847,0.00046584144,0.0023562792,0.00036623894,0.00027254838],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00044080173,0.00087453483,0.0006547904,0.0003927025,0.0022148837,0.0006202874,0.0039810007,0.00047629775,0.000018443003],"category_scores_gemma":[0.00007025013,0.0007824972,0.00057561503,0.000072350376,0.0005639389,0.00013590312,0.0030925707,0.0016411904,0.000044085507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039544564,0.00003845112,5.2428226e-7,0.0000583336,0.00023095953,0.00021176714,0.00020761606,0.00017573712,0.000016886534,0.95500284,0.027158698,0.01685866],"study_design_scores_gemma":[0.0004321391,0.00016267493,0.00006641306,0.0008148921,0.00019486259,0.00001923978,0.000015632228,0.22041218,0.00011776837,0.00016830741,0.7768418,0.00075409963],"about_ca_topic_score_codex":0.00021450098,"about_ca_topic_score_gemma":0.0000015359872,"teacher_disagreement_score":0.9548345,"about_ca_system_score_codex":0.00024434773,"about_ca_system_score_gemma":0.0004350352,"threshold_uncertainty_score":0.9994626},"labels":[],"label_agreement":null},{"id":"W4415311431","doi":"10.48550/arxiv.2506.14075","title":"Comparing a Few Qubit Systems for Superconducting Hardware Compatibility and Circuit Design Sensitivity in Qiskit","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum computer; Qubit; IBM; Quantum circuit; Computation; Quantum; Electronic circuit; Compatibility (geochemistry)","score_opus":0.13763355954739767,"score_gpt":0.21548914767190833,"score_spread":0.07785558812451066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415311431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4377418,0.00012995706,0.5607811,0.000028770128,0.00042241468,0.0006309629,0.000019430488,0.00017240857,0.00007316975],"genre_scores_gemma":[0.9941207,0.000026171214,0.0056072185,0.00003100541,0.000071585324,0.0000033319018,0.000010768435,0.000012945626,0.00011627956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685544,0.0005428634,0.00035129272,0.0016458335,0.00009724078,0.00050735316],"domain_scores_gemma":[0.9975438,0.0009226106,0.0002167489,0.0009866413,0.00018333817,0.00014686551],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014115536,0.00041581524,0.0007853302,0.00037032407,0.00030553396,0.00029923485,0.00085107825,0.00026790815,6.394156e-7],"category_scores_gemma":[0.00011110614,0.00048504793,0.00016721076,0.0005426991,0.00010863097,0.0002434127,0.0019439816,0.0008308582,0.0000016636072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017363645,0.000051842875,0.016238252,0.00056418014,0.000051586794,0.00011652354,0.0007755924,0.9707509,0.000017910543,0.010634092,0.000026303489,0.00075544306],"study_design_scores_gemma":[0.0006060221,0.000038176502,0.0041452697,0.00068535755,0.0000358994,0.00001657482,0.00016156561,0.9848723,0.000040009003,0.008904987,0.000033381395,0.00046046686],"about_ca_topic_score_codex":0.002229623,"about_ca_topic_score_gemma":0.00031259513,"teacher_disagreement_score":0.5563789,"about_ca_system_score_codex":0.00033058278,"about_ca_system_score_gemma":0.00032896287,"threshold_uncertainty_score":0.9997601},"labels":[],"label_agreement":null},{"id":"W4415360672","doi":"10.3390/encyclopedia5040173","title":"Quantum Computing: A Concise Introduction","year":2025,"lang":"en","type":"article","venue":"Encyclopedia","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Quantum computer; Quantum information; Quantum algorithm; Quantum technology; Quantum; Quantum network; Qubit; Open quantum system; Quantum error correction","score_opus":0.004970491302619163,"score_gpt":0.23535589655989217,"score_spread":0.230385405257273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415360672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094030045,0.00038703444,0.8750248,0.0093955565,0.0047389055,0.00016716795,0.0000010024161,0.0006552797,0.015600213],"genre_scores_gemma":[0.9122955,0.000067220935,0.08001783,0.0014482423,0.0022400422,0.000008622868,0.0000072156886,0.000017757044,0.003897566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986694,0.000075726195,0.00025181848,0.00050025125,0.0001826775,0.00032014315],"domain_scores_gemma":[0.9990908,0.00011804465,0.00006997558,0.00058072474,0.00007029264,0.00007016482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028413656,0.00016078776,0.00018122513,0.00017382752,0.00021651523,0.00012745574,0.0007380891,0.00006123688,0.000012463494],"category_scores_gemma":[0.00010786824,0.00014533258,0.00007234702,0.00073161494,0.000049466766,0.00013995556,0.00036230427,0.00025916862,0.00006726768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008389921,0.00012912705,0.0012262352,0.000042460673,0.00003932317,0.00003318958,0.0014474185,0.004196062,0.00026462213,0.3585966,0.09336739,0.5406492],"study_design_scores_gemma":[0.00033930098,0.000054937933,0.0067377957,0.00003276583,0.000007706907,0.00002148031,0.00002420804,0.64648753,0.00022554095,0.016101092,0.32972047,0.00024719647],"about_ca_topic_score_codex":0.000015887852,"about_ca_topic_score_gemma":0.0000016656442,"teacher_disagreement_score":0.81826544,"about_ca_system_score_codex":0.000032246844,"about_ca_system_score_gemma":0.000109090455,"threshold_uncertainty_score":0.59264904},"labels":[],"label_agreement":null},{"id":"W4415366762","doi":"10.1109/isit63088.2025.11195355","title":"Quantum Capacity Amplification via Privacy","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Erasure; Classical capacity; Channel (broadcasting); Binary erasure channel; Quantum channel; Quantum; Quantum capacity; Coherent information; Amplitude damping channel","score_opus":0.019084963869908524,"score_gpt":0.256216174134182,"score_spread":0.2371312102642735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415366762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07753861,0.00039236137,0.9029789,0.010138851,0.0031757525,0.00038751052,0.0000036943215,0.000402926,0.00498141],"genre_scores_gemma":[0.9162881,0.000033715995,0.079712704,0.0014909988,0.00022743053,0.0000102787,0.0000030098543,0.000014445774,0.002219314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965285,0.0002587829,0.0007462662,0.001246945,0.00044309668,0.0007764013],"domain_scores_gemma":[0.9972164,0.0002605388,0.00023097114,0.0018280762,0.00026359552,0.00020041628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070356845,0.00044594434,0.00042710194,0.00036841288,0.00074876985,0.00069946237,0.0021731192,0.0002230047,0.00008503473],"category_scores_gemma":[0.0001352015,0.0004098556,0.0002372779,0.0018329344,0.00022001032,0.000317628,0.0010496256,0.00065569236,0.00025466073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008900659,0.00029783617,0.00033369634,0.00011757506,0.00007248954,0.000005717402,0.0013862303,0.0022062755,0.0014712434,0.38053125,0.0027123666,0.6108564],"study_design_scores_gemma":[0.0003313071,0.000090823385,0.008324348,0.00014620312,0.000022580898,0.000016709095,0.000013445333,0.8954959,0.0019441614,0.06996975,0.023249839,0.00039495146],"about_ca_topic_score_codex":0.00030858224,"about_ca_topic_score_gemma":0.000007822683,"teacher_disagreement_score":0.8932896,"about_ca_system_score_codex":0.00010898726,"about_ca_system_score_gemma":0.0003133037,"threshold_uncertainty_score":0.9998353},"labels":[],"label_agreement":null},{"id":"W4415368842","doi":"10.1109/isit63088.2025.11195623","title":"Additivity of Quantum Capacities in Simple Non-Degradable Quantum Channels","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Superadditivity; Additive function; Classical capacity; Quantum; Quantum channel; Coherent information; Channel (broadcasting); Amplitude damping channel; Quantum capacity","score_opus":0.011794531763191075,"score_gpt":0.2467103236537625,"score_spread":0.23491579189057143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415368842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45755377,0.00092465465,0.53147864,0.0017432497,0.003390345,0.0006048153,0.00008777472,0.00013892603,0.0040778043],"genre_scores_gemma":[0.9930525,0.00010943686,0.004354175,0.00042322313,0.00018664195,0.000025101976,0.000009961156,0.000028494798,0.0018104683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99470377,0.00041162904,0.0014249168,0.0013521238,0.00067818566,0.0014293744],"domain_scores_gemma":[0.9966497,0.0009798296,0.0004265377,0.0014479306,0.00028851075,0.00020751548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014078261,0.0007229347,0.0013197461,0.0011068075,0.0003939777,0.0003062052,0.0019576906,0.0003393549,0.00014948164],"category_scores_gemma":[0.00023341336,0.00067405147,0.0003968411,0.0030958904,0.0007198547,0.0005066751,0.0012889826,0.00096127216,0.000029078159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020068616,0.0030057717,0.002649829,0.002927769,0.00043835127,0.00027009423,0.019298902,0.07000663,0.0036137472,0.68190324,0.025624236,0.19006072],"study_design_scores_gemma":[0.0009453383,0.00038475383,0.0030839862,0.0008741921,0.000020798214,0.000011914587,0.000768753,0.9223932,0.008310085,0.0607763,0.0018182314,0.00061242766],"about_ca_topic_score_codex":0.0050766156,"about_ca_topic_score_gemma":0.00022536133,"teacher_disagreement_score":0.8523866,"about_ca_system_score_codex":0.00012532898,"about_ca_system_score_gemma":0.00087212346,"threshold_uncertainty_score":0.9995711},"labels":[],"label_agreement":null},{"id":"W4415379643","doi":"10.1098/rspa.2025.0035","title":"The Clifford hierarchy for one qubit or qudit","year":2025,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Quantum gate; Hierarchy; Quantum teleportation; Topology (electrical circuits); Clifford algebra; Teleportation; Qubit; Simple (philosophy); Controlled NOT gate","score_opus":0.009511224845336525,"score_gpt":0.23045119669438352,"score_spread":0.22093997184904698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415379643","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6236036,0.00020743281,0.35665724,0.017043171,0.00033458642,0.0006727223,0.0000032308299,0.00023645117,0.0012415646],"genre_scores_gemma":[0.88915163,0.000008085106,0.10992503,0.00014824497,0.00014539453,0.00004539229,3.895321e-8,0.0000065133618,0.0005696522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904287,0.0000026851496,0.00017019932,0.0002385005,0.00025899423,0.00028677244],"domain_scores_gemma":[0.9990402,0.00069937186,0.000061174826,0.00009351659,0.000059969865,0.00004580928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048201618,0.00011891039,0.0001882714,0.000013728843,0.00060544355,0.00024108644,0.00102321,0.00003161716,2.9669468e-7],"category_scores_gemma":[0.00026180013,0.000054329506,0.00017731982,0.0004733382,0.00037557655,0.000088923785,0.00044051124,0.00015004807,3.6630738e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005412427,0.00008908596,0.000015781943,0.00044244737,0.000042812724,2.073685e-8,0.0011038708,0.0022277453,0.000739314,0.9856954,0.0008220858,0.008816004],"study_design_scores_gemma":[0.00008701267,0.000068737005,0.00016517082,0.0001426254,0.0000100323905,6.3288763e-7,0.000050953553,0.8208289,0.0009885802,0.17714071,0.00044669613,0.00006994527],"about_ca_topic_score_codex":0.000001654642,"about_ca_topic_score_gemma":6.420834e-8,"teacher_disagreement_score":0.81860113,"about_ca_system_score_codex":0.000011099369,"about_ca_system_score_gemma":0.000030491527,"threshold_uncertainty_score":0.46566433},"labels":[],"label_agreement":null},{"id":"W4415389745","doi":"10.20944/preprints202510.1649.v1","title":"A Novel Quantum Circuit for Integer Factorization: Evaluation via Simulation and Real Quantum Hardware","year":2025,"lang":"","type":"preprint","venue":"Preprints.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum Fourier transform; Quantum circuit; Quantum algorithm; Quantum computer; Quantum phase estimation algorithm; Integer factorization; Quantum gate; Integer (computer science); Quantum error correction","score_opus":0.16077549205954286,"score_gpt":0.37731716026993667,"score_spread":0.2165416682103938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415389745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18824896,0.00020724133,0.8008061,0.0007268187,0.005060671,0.003926754,0.00018245826,0.0003911727,0.00044980738],"genre_scores_gemma":[0.9925207,0.00012879563,0.0048726797,0.0001731292,0.0009562146,0.00049029884,0.0003064148,0.00008027032,0.0004715061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990431,0.0006628013,0.0020139196,0.0041792924,0.001596079,0.0011168882],"domain_scores_gemma":[0.9911841,0.0015454039,0.0014818449,0.0028777963,0.002489634,0.0004211963],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0041091484,0.0013029967,0.0013321555,0.0007467645,0.0010867188,0.00047913002,0.0021989474,0.001047108,0.00016313908],"category_scores_gemma":[0.0017229385,0.0014173228,0.00060331,0.0009624198,0.00025744236,0.00058559753,0.0044645993,0.0015855891,0.000084654916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018336994,0.0006296261,0.03478361,0.0014872603,0.0005643334,0.0000053783338,0.011947177,0.8460545,0.0048405854,0.021494161,0.000018953351,0.07799106],"study_design_scores_gemma":[0.0016317772,0.00013194577,0.088373505,0.0010409532,0.00030386547,0.000019572952,0.00006972643,0.86869615,0.0008269178,0.03640934,0.0013297007,0.0011665703],"about_ca_topic_score_codex":0.0005891173,"about_ca_topic_score_gemma":0.000027763554,"teacher_disagreement_score":0.8042717,"about_ca_system_score_codex":0.0005895298,"about_ca_system_score_gemma":0.001432294,"threshold_uncertainty_score":0.99997216},"labels":[],"label_agreement":null},{"id":"W4415444424","doi":"10.1038/s41586-025-09526-6","title":"Observation of constructive interference at the edge of quantum ergodicity","year":2025,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"Lawrence Berkeley National Laboratory; Curtin University of Technology; Princeton University","keywords":"Pauli exclusion principle; Observable; Quantum; Quantum dynamics; Quantum entanglement; Open quantum system; Hamiltonian (control theory); Quantum discord; Constructive; Quantum process","score_opus":0.00958119555017784,"score_gpt":0.2523266956182914,"score_spread":0.24274550006811357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415444424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82017094,0.00081153924,0.17491958,0.002380434,0.00080162496,0.00011386717,0.0000099286,0.000036445086,0.00075562706],"genre_scores_gemma":[0.99359035,0.0000060730035,0.0058814697,0.00036766028,0.000021061003,0.0000014086709,0.000001494469,0.0000019298225,0.00012856767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928594,0.00006727954,0.00018350629,0.00019630381,0.00016073707,0.00010623087],"domain_scores_gemma":[0.9990204,0.0002537995,0.00014176521,0.0003885396,0.00018032693,0.000015176657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001889169,0.000084028215,0.00014978054,0.00006140011,0.00008214688,0.000014463122,0.00072042947,0.00024031528,0.0000038853527],"category_scores_gemma":[0.00012509199,0.000053526102,0.00006172575,0.0005097066,0.00015359832,0.00005802416,0.00039510068,0.0007715513,8.5621195e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049260136,0.000081820785,0.009098963,0.00013995323,0.00008200177,0.0000027820677,0.0019920068,0.0015031071,0.010978593,0.8471395,0.004506342,0.12442568],"study_design_scores_gemma":[0.0005244549,0.00015653748,0.13479938,0.0004217669,0.000020843025,0.000015180387,0.00009711775,0.6973104,0.095789544,0.0676885,0.0029734795,0.00020282718],"about_ca_topic_score_codex":0.000022107488,"about_ca_topic_score_gemma":0.000009598173,"teacher_disagreement_score":0.779451,"about_ca_system_score_codex":0.000021052894,"about_ca_system_score_gemma":0.000081652746,"threshold_uncertainty_score":0.33520493},"labels":[],"label_agreement":null},{"id":"W4415464680","doi":"10.1007/s11227-025-07970-9","title":"A quantum computing approach to model uncertainty in end-of-life prediction","year":2025,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Superposition principle; Process (computing); Noise (video); Computation; Quantum; Quantum computer; Quantum entanglement; Filter (signal processing); Uncertainty analysis","score_opus":0.019797886401757604,"score_gpt":0.25629616319236587,"score_spread":0.23649827679060825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415464680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45770976,0.00018644005,0.54082036,0.0006407577,0.00028307052,0.0000945638,0.0000010190633,0.000025690128,0.0002383163],"genre_scores_gemma":[0.90329796,0.000007509085,0.096127905,0.0004102351,0.00014130703,3.7439665e-7,4.760973e-7,0.000008600802,0.00000564468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756557,0.00030947852,0.0010460519,0.00024017201,0.00044704296,0.00039168634],"domain_scores_gemma":[0.9984013,0.00057203416,0.00030122933,0.00039443414,0.0002190492,0.00011196553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032312416,0.00019653146,0.00045899863,0.00052393175,0.00021445433,0.00007381073,0.001583988,0.000068907604,4.7629896e-7],"category_scores_gemma":[0.00022872219,0.00013701776,0.00014377414,0.0012630662,0.00006874909,0.00018125091,0.000605869,0.0006597646,7.2600915e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023852066,0.00009824876,0.0006538678,0.000042931664,0.000028511507,0.0000020545215,0.0055919806,0.96052015,0.0007149605,0.007286899,0.0001355174,0.024901045],"study_design_scores_gemma":[0.0004990482,0.00009372384,0.002884458,0.0004157696,0.000012718976,0.00006180659,0.0004593518,0.99211013,0.000106221974,0.0032040724,0.00004106046,0.000111618785],"about_ca_topic_score_codex":0.00010266277,"about_ca_topic_score_gemma":0.0000029759024,"teacher_disagreement_score":0.4455882,"about_ca_system_score_codex":0.00008734341,"about_ca_system_score_gemma":0.00037444744,"threshold_uncertainty_score":0.5587422},"labels":[],"label_agreement":null},{"id":"W4415500119","doi":"10.1007/978-3-031-90731-9_13","title":"Shor Algorithm","year":2025,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quantum algorithm; Quantum phase estimation algorithm; Quantum; Quantum computer; Basis (linear algebra); Prime (order theory); Algorithm design; Set (abstract data type)","score_opus":0.029960044838763543,"score_gpt":0.29978933308145944,"score_spread":0.2698292882426959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415500119","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065949524,0.01480106,0.3193936,0.06344999,0.02335705,0.009715045,0.0029017332,0.0055245534,0.5601975],"genre_scores_gemma":[0.00034595083,0.0016389823,0.069649264,0.00079562713,0.0023606275,0.00010682369,0.00009209721,0.000108222186,0.9249024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99523264,0.00032557375,0.0006782083,0.0010997431,0.0015763639,0.0010874425],"domain_scores_gemma":[0.9964322,0.00064541236,0.00021191385,0.0019444227,0.0005969256,0.00016915513],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0033008666,0.00059665885,0.0007212346,0.0001560269,0.0015783673,0.0016877704,0.0038309249,0.00056751934,0.0002212735],"category_scores_gemma":[0.00004333384,0.000421103,0.0004702244,0.0002819425,0.0009947029,0.00027302845,0.0037728928,0.0014408946,0.00020434205],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032016887,0.00005581456,2.5509948e-7,0.0005706833,0.000654661,0.00011107501,0.004112065,0.00005952571,0.0032279254,0.35923654,0.35876197,0.27317747],"study_design_scores_gemma":[0.00018771492,0.00020029618,0.0000036866827,0.00038419993,0.000018145189,0.000050397954,0.00007744808,0.010737208,0.0021435155,0.111569695,0.8740534,0.0005742488],"about_ca_topic_score_codex":0.00008077259,"about_ca_topic_score_gemma":0.000015975851,"teacher_disagreement_score":0.51529145,"about_ca_system_score_codex":0.00015844552,"about_ca_system_score_gemma":0.00071074895,"threshold_uncertainty_score":0.9998241},"labels":[],"label_agreement":null},{"id":"W4415500120","doi":"10.1007/978-3-031-90731-9_9","title":"Tensor Products","year":2025,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tensor (intrinsic definition); Representation (politics); Tensor product; Algebra over a field; Quantum","score_opus":0.03529192624696592,"score_gpt":0.29422785464139667,"score_spread":0.25893592839443075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415500120","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005129497,0.018168997,0.022599053,0.22687884,0.028058315,0.015804075,0.0019128587,0.0069036055,0.67454475],"genre_scores_gemma":[0.0016675199,0.001061223,0.017769141,0.0006387587,0.0022105935,0.0000851754,0.00005150085,0.00008477055,0.9764313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957073,0.00029674917,0.0005269041,0.0011311232,0.001371968,0.0009659788],"domain_scores_gemma":[0.99627525,0.0004586011,0.00019298187,0.0020780163,0.0008751735,0.000119990036],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028695804,0.0005180421,0.0006278706,0.00013095941,0.0013982066,0.0014024866,0.0032895242,0.00042122445,0.0001008211],"category_scores_gemma":[0.000104821695,0.00034984289,0.00028853343,0.00030846428,0.0009396873,0.0002457554,0.0031065615,0.0012188598,0.0001961805],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051515228,0.000051758416,6.788442e-7,0.0011950785,0.0004787623,0.000072802686,0.004284592,0.000056478595,0.011988485,0.48074967,0.47298068,0.02808952],"study_design_scores_gemma":[0.00016107247,0.00018814133,0.000012347782,0.00041774532,0.000015636775,0.000046869813,0.00005916129,0.0011564725,0.0054944786,0.07873236,0.913202,0.000513736],"about_ca_topic_score_codex":0.000054634173,"about_ca_topic_score_gemma":0.0000106541365,"teacher_disagreement_score":0.4402213,"about_ca_system_score_codex":0.000119950826,"about_ca_system_score_gemma":0.0008036767,"threshold_uncertainty_score":0.99990183},"labels":[],"label_agreement":null},{"id":"W4415500125","doi":"10.1007/978-3-031-90731-9_18","title":"DiVincenzo Criteria","year":2025,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Set (abstract data type); Selection (genetic algorithm); Fuzzy logic; Context (archaeology); Term (time)","score_opus":0.035455932495499075,"score_gpt":0.31803049737854044,"score_spread":0.2825745648830414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415500125","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004077105,0.01477094,0.07179262,0.08505091,0.029102089,0.009468049,0.0027147227,0.005757708,0.77726585],"genre_scores_gemma":[0.0062719374,0.0016933252,0.018267237,0.0011545585,0.0026305185,0.000116105766,0.00009461018,0.00012714877,0.96964455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.995397,0.00039185287,0.00062160456,0.0010825521,0.0014273094,0.001079707],"domain_scores_gemma":[0.99635315,0.0006767421,0.00020516262,0.0020392826,0.0005616147,0.00016402967],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0031127825,0.00059078104,0.0007202172,0.00014196846,0.0016668686,0.002104503,0.004018155,0.0005217342,0.00036084553],"category_scores_gemma":[0.000059897135,0.00041934018,0.00043167875,0.00024853265,0.0010399031,0.00032679058,0.004450247,0.0012581996,0.00019845042],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046097142,0.000044783625,8.062058e-7,0.00075890427,0.00042179495,0.00007402384,0.004055726,0.000023785567,0.008133784,0.5277725,0.43117654,0.027491279],"study_design_scores_gemma":[0.00019001761,0.00019070995,0.000017143426,0.00055422354,0.000016966733,0.000038483202,0.000063754465,0.0027776244,0.002276928,0.14314231,0.85013634,0.00059550686],"about_ca_topic_score_codex":0.00009319507,"about_ca_topic_score_gemma":0.000025997193,"teacher_disagreement_score":0.4189598,"about_ca_system_score_codex":0.0001653595,"about_ca_system_score_gemma":0.00063499494,"threshold_uncertainty_score":0.99982584},"labels":[],"label_agreement":null},{"id":"W4415500126","doi":"10.1007/978-3-031-90731-9_1","title":"Superposition","year":2025,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Superposition principle; Quantum superposition; Quantum; Power (physics); Quantization (signal processing); Open quantum system","score_opus":0.027929324353949046,"score_gpt":0.2936171511435109,"score_spread":0.2656878267895618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415500126","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057781837,0.0110687995,0.095888644,0.08481629,0.018405074,0.009253974,0.0017829243,0.004988308,0.7680178],"genre_scores_gemma":[0.006470541,0.0017921146,0.016843088,0.001014713,0.0022516607,0.000113797774,0.00014812154,0.000101059864,0.9712649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966282,0.00027555527,0.00043954118,0.0007800532,0.0011427877,0.00073382584],"domain_scores_gemma":[0.9974866,0.0004461991,0.00012366618,0.0013767257,0.00046011189,0.00010672988],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021995415,0.00040967917,0.00047893438,0.00011656297,0.0013898266,0.0013548698,0.0023993014,0.00042883414,0.00015556805],"category_scores_gemma":[0.000026019676,0.0002914465,0.00033228847,0.00019490511,0.00068286783,0.0002680887,0.0022204188,0.0009993028,0.00015506666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039297247,0.000034815068,4.3397145e-7,0.0005280415,0.00033489705,0.00004686081,0.0037705896,0.000056257213,0.011841771,0.76918167,0.18797795,0.026187396],"study_design_scores_gemma":[0.00022864991,0.0002808337,0.000013545251,0.00062648597,0.00002145697,0.00006128783,0.00009037999,0.0040298053,0.0056903637,0.21105911,0.77727085,0.0006272513],"about_ca_topic_score_codex":0.00006915699,"about_ca_topic_score_gemma":0.000017127039,"teacher_disagreement_score":0.5892929,"about_ca_system_score_codex":0.00013423996,"about_ca_system_score_gemma":0.00045212256,"threshold_uncertainty_score":0.99995375},"labels":[],"label_agreement":null},{"id":"W4415500131","doi":"10.1007/978-3-031-90731-9_10","title":"Quantum Parallelism and Computational Complexity","year":2025,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computational complexity theory; Quantum computer; Quantum complexity theory; Quantum algorithm; Quantum; Parallelism (grammar); Superposition principle; Quantum sort; Quantum error correction","score_opus":0.055500534426151146,"score_gpt":0.315315444999755,"score_spread":0.25981491057360384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415500131","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028715517,0.026566615,0.41763887,0.22050959,0.018919755,0.015917592,0.005240692,0.006558751,0.2599326],"genre_scores_gemma":[0.063417025,0.005015922,0.19220296,0.0043404605,0.0042855786,0.00025621968,0.00076138426,0.0003118406,0.7294086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641764,0.00032382223,0.0005251591,0.0008744532,0.00116222,0.00069670926],"domain_scores_gemma":[0.9974743,0.0008119512,0.00018885267,0.00089359836,0.00048490847,0.00014636746],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002135522,0.00045819368,0.0006129523,0.00011267186,0.0016398589,0.0013105316,0.0017379731,0.00034727497,0.00008764835],"category_scores_gemma":[0.000032875992,0.0003380813,0.00022661148,0.00015528275,0.0017869264,0.00022154437,0.0027226247,0.000982488,0.0000460427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021920188,0.000017435694,7.5484957e-7,0.0002659918,0.00016674961,0.00001638624,0.0016861494,0.00021412502,0.00019356582,0.9498327,0.04335094,0.0042332946],"study_design_scores_gemma":[0.00025354337,0.0001465698,0.000095415126,0.0002628716,0.0000121746625,0.00005756728,0.000066868306,0.04661844,0.000071792776,0.7526427,0.19934253,0.00042953485],"about_ca_topic_score_codex":0.000110357425,"about_ca_topic_score_gemma":0.000024023077,"teacher_disagreement_score":0.46947598,"about_ca_system_score_codex":0.000081211096,"about_ca_system_score_gemma":0.00043964235,"threshold_uncertainty_score":0.99990714},"labels":[],"label_agreement":null},{"id":"W4415500135","doi":"10.1007/978-3-031-90731-9_19","title":"Nuclear Magnetic Resonance","year":2025,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Spin echo; Nuclear magnetic resonance decoupling; Free induction decay; Molecule; Magnetic resonance force microscopy; Magnetic resonance imaging; Solid-state nuclear magnetic resonance","score_opus":0.022616863702434934,"score_gpt":0.2737445173626866,"score_spread":0.2511276536602517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415500135","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004393302,0.07186367,0.006772072,0.07448664,0.015952444,0.009069203,0.0015635197,0.0054589002,0.81044024],"genre_scores_gemma":[0.0016086726,0.0039969077,0.016206224,0.0011119166,0.0014550246,0.000056355384,0.00002694668,0.00012747046,0.97541046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99596375,0.00029714004,0.00051692076,0.0009845393,0.0012983108,0.0009393396],"domain_scores_gemma":[0.9969667,0.00046730274,0.00014557887,0.0018683445,0.00041898602,0.00013303877],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021475134,0.00048954424,0.0005818592,0.000112145644,0.0014718055,0.0014273371,0.0035826461,0.00045386772,0.00034315584],"category_scores_gemma":[0.00004561528,0.0003587761,0.00034012803,0.00025109784,0.0010651568,0.00021439913,0.0033572249,0.0012279578,0.00028814544],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049614348,0.000030588337,4.460449e-7,0.00041987374,0.00010032269,0.00006661471,0.003628566,0.000018418988,0.0029869743,0.62701565,0.27211872,0.09356421],"study_design_scores_gemma":[0.00015018345,0.00023701317,0.00001720875,0.00040046888,0.000009053932,0.0000311302,0.000052140418,0.0025488313,0.00038440325,0.06998606,0.9257956,0.00038789862],"about_ca_topic_score_codex":0.00006456892,"about_ca_topic_score_gemma":0.000015648855,"teacher_disagreement_score":0.6536769,"about_ca_system_score_codex":0.00012078174,"about_ca_system_score_gemma":0.00041859498,"threshold_uncertainty_score":0.9998864},"labels":[],"label_agreement":null},{"id":"W4415500136","doi":"10.1007/978-3-031-90731-9_21","title":"Trapped Ion Quantum Computing","year":2025,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Ion; Qubit; Trapped ion quantum computer; Quantum computer; Quantum; Space (punctuation); Quantum information; Quantum dot","score_opus":0.035465091148542474,"score_gpt":0.3041494089254966,"score_spread":0.2686843177769541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415500136","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03160045,0.018566167,0.36986047,0.09321851,0.04508692,0.01712122,0.0018116371,0.011066866,0.41166776],"genre_scores_gemma":[0.07765896,0.003237844,0.03723262,0.0021232804,0.007843086,0.000120376055,0.0002924262,0.0003918442,0.8710996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948248,0.00048007196,0.0007818235,0.0011718548,0.0015472851,0.0011941529],"domain_scores_gemma":[0.996337,0.00092678244,0.00030791768,0.001710632,0.0005506724,0.00016698192],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0039923685,0.0006447577,0.0008251908,0.00018560709,0.002102644,0.0016784435,0.0034599875,0.00057960063,0.00009135042],"category_scores_gemma":[0.000055088487,0.0004727453,0.00051125034,0.00033890895,0.0009231737,0.0002569832,0.0031179478,0.0015944445,0.00011992578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007090289,0.00006585637,0.0000010755133,0.001020465,0.00054954,0.00007676144,0.007664517,0.0002854438,0.012194079,0.802895,0.13291444,0.042261887],"study_design_scores_gemma":[0.0006096615,0.00053475937,0.000035467776,0.0016509488,0.000041806252,0.00010444178,0.0003368615,0.06414403,0.005744731,0.2243349,0.70105916,0.0014032306],"about_ca_topic_score_codex":0.00010164482,"about_ca_topic_score_gemma":0.00001809496,"teacher_disagreement_score":0.5785601,"about_ca_system_score_codex":0.0001590973,"about_ca_system_score_gemma":0.00063837843,"threshold_uncertainty_score":0.9997724},"labels":[],"label_agreement":null},{"id":"W4415500138","doi":"10.1007/978-3-031-90731-9_17","title":"Implementing Two-Qubit Gates","year":2025,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Controlled NOT gate; Set (abstract data type); Universal set; Class (philosophy); Field (mathematics)","score_opus":0.03149106420985382,"score_gpt":0.3207675825217622,"score_spread":0.28927651831190837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415500138","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0090370355,0.013552209,0.05611603,0.07485322,0.0165988,0.0122772185,0.002192483,0.0060940995,0.8092789],"genre_scores_gemma":[0.011624251,0.0015682915,0.03199227,0.0011439312,0.0036436238,0.00019432422,0.00017581723,0.00018664188,0.9494709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99503785,0.0003282529,0.0007003437,0.0010286758,0.0013616253,0.0015432647],"domain_scores_gemma":[0.9967003,0.00075132924,0.0002713915,0.0015970713,0.00053975265,0.00014018189],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0048541217,0.00056135986,0.00066425133,0.00014786578,0.002397202,0.0019482872,0.0032708168,0.0003056697,0.00029339534],"category_scores_gemma":[0.000050349005,0.00040613126,0.00042570115,0.00026081913,0.00070361106,0.00029290677,0.0058060833,0.0011630259,0.00013041549],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003552354,0.000035345834,0.0000036501829,0.0007758883,0.00064269063,0.000060232283,0.005091709,0.00008309076,0.013796939,0.8145219,0.12030494,0.044648077],"study_design_scores_gemma":[0.00031839884,0.00015893765,0.000009291496,0.0005021351,0.000022612465,0.00003693163,0.00016867642,0.0040735863,0.0064529073,0.14533606,0.8423022,0.00061827217],"about_ca_topic_score_codex":0.00018352528,"about_ca_topic_score_gemma":0.0000752916,"teacher_disagreement_score":0.72199726,"about_ca_system_score_codex":0.00013246154,"about_ca_system_score_gemma":0.0005391735,"threshold_uncertainty_score":0.99983907},"labels":[],"label_agreement":null},{"id":"W4415500139","doi":"10.1007/978-3-031-90731-9_23","title":"Adiabatic Quantum Computing","year":2025,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Adiabatic quantum computation; Adiabatic process; Quantum computer; Hamiltonian (control theory); Ground state; Quantum; Adiabatic invariant; Quantum algorithm","score_opus":0.03293159266510599,"score_gpt":0.30175644548898023,"score_spread":0.26882485282387425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415500139","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016887689,0.0230647,0.26675263,0.07867332,0.038630366,0.015946992,0.0017818082,0.009533918,0.5487286],"genre_scores_gemma":[0.043631732,0.0020683296,0.038918737,0.0020824498,0.005035461,0.00010422839,0.00018150867,0.0003066648,0.9076709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949441,0.00044959152,0.00077213225,0.0011138954,0.0015008466,0.0012194307],"domain_scores_gemma":[0.9958457,0.0012482541,0.0003030807,0.0018563275,0.0005669344,0.00017971396],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003811209,0.0006332658,0.0008365245,0.00018402227,0.0020115648,0.0017702184,0.0037368096,0.00050485955,0.00011798567],"category_scores_gemma":[0.00008365964,0.00046334285,0.00047131677,0.00033268819,0.000989981,0.0002527518,0.0038111005,0.0015681082,0.00019011127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029128192,0.000044705506,0.0000012030495,0.0010429348,0.0005206673,0.00007081603,0.0060949204,0.00027837398,0.002736357,0.8277694,0.1300248,0.03138671],"study_design_scores_gemma":[0.0004541396,0.00044716996,0.00003024048,0.0018242131,0.00004659947,0.000100066325,0.00027547454,0.085528366,0.0017510428,0.2767611,0.6314592,0.0013224153],"about_ca_topic_score_codex":0.000098821605,"about_ca_topic_score_gemma":0.000018343988,"teacher_disagreement_score":0.5510083,"about_ca_system_score_codex":0.00017490018,"about_ca_system_score_gemma":0.0007492816,"threshold_uncertainty_score":0.99978185},"labels":[],"label_agreement":null},{"id":"W4415500142","doi":"10.1007/978-3-031-90731-9_12","title":"Grover Algorithm","year":2025,"lang":"en","type":"book-chapter","venue":"˜The œMaterials Research Society series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quantum algorithm for linear systems of equations; Quantum algorithm; Quantum phase estimation algorithm; Quantum; Quantum computer; Time complexity; Speedup","score_opus":0.026409070508883293,"score_gpt":0.2920316089081594,"score_spread":0.2656225383992761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415500142","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006446584,0.011959036,0.273531,0.04999633,0.023126494,0.00825941,0.0025125646,0.004704492,0.625266],"genre_scores_gemma":[0.00033479155,0.0015211641,0.049863625,0.00093760906,0.0022380785,0.00008316841,0.000080498845,0.00010261326,0.94483846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99538755,0.000307628,0.00058655714,0.0010741722,0.0015897255,0.0010543634],"domain_scores_gemma":[0.9965217,0.0006452908,0.00020660194,0.0019022713,0.0005630744,0.00016103889],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027600273,0.00058722857,0.00069244346,0.00014611207,0.0014807337,0.0016163837,0.0035750216,0.00055897876,0.00023230651],"category_scores_gemma":[0.000038188962,0.0004147445,0.00046994965,0.00026992577,0.00095603295,0.00031428633,0.0037637015,0.0014134285,0.00023036855],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028616194,0.0000498936,3.4416166e-7,0.0005074153,0.000599758,0.00009612818,0.0034539697,0.00004294492,0.0020703676,0.43015274,0.39099336,0.17200445],"study_design_scores_gemma":[0.0002095236,0.00017829414,0.0000064296955,0.00034495053,0.000017136148,0.000045878613,0.00005971318,0.0072577456,0.0013388288,0.134359,0.8556297,0.0005528041],"about_ca_topic_score_codex":0.00010477673,"about_ca_topic_score_gemma":0.000014823086,"teacher_disagreement_score":0.46463633,"about_ca_system_score_codex":0.00016356085,"about_ca_system_score_gemma":0.0006482062,"threshold_uncertainty_score":0.9998304},"labels":[],"label_agreement":null},{"id":"W4415506491","doi":"10.1103/rrmd-fqx6","title":"Non-Abelian dynamics on a cube: Improving quantum compilation through qudit-based simulations","year":2025,"lang":"en","type":"article","venue":"Physical review. D/Physical review. D.","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Nuclear Physics; Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Office of Science; Canada Research Chairs; University of Washington; U.S. Department of Energy; National Science Foundation","keywords":"Lattice gauge theory; Quantum simulator; Quantum; Gauge theory; Lattice field theory; Lattice (music); Quantum computer; Quantum algorithm; Executable","score_opus":0.012077514955534002,"score_gpt":0.3945420165270012,"score_spread":0.3824645015714672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415506491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23948239,0.027648825,0.6695249,0.048471354,0.0017512214,0.0060348613,0.0002183027,0.001437548,0.005430582],"genre_scores_gemma":[0.9717597,0.0036652838,0.0070304987,0.016556349,0.000596519,0.00013837712,0.00015319177,0.000058790643,0.00004132583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959213,0.00035082005,0.0008658806,0.0012676999,0.0008518503,0.0007424422],"domain_scores_gemma":[0.9960948,0.0011553055,0.0004886473,0.0017477128,0.00028769512,0.00022580542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004128291,0.00068773044,0.0014943236,0.000121016936,0.000465142,0.0001690364,0.0015078572,0.00006488656,0.0000042244656],"category_scores_gemma":[0.0005665998,0.0005509783,0.0008596572,0.00239656,0.0001333458,0.00037950792,0.00044236812,0.0009231181,0.00022770665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022655986,0.002962641,0.0006997886,0.015114938,0.00015940024,0.000024771984,0.00017123634,0.030200357,0.003051501,0.52118254,0.0077999956,0.41861016],"study_design_scores_gemma":[0.0003370667,0.00023175261,0.0009471908,0.012154286,0.00016373047,0.0000013768914,0.0000011491433,0.9255241,0.00059275463,0.051193055,0.0083188405,0.0005346989],"about_ca_topic_score_codex":0.00003766553,"about_ca_topic_score_gemma":0.000006426119,"teacher_disagreement_score":0.89532375,"about_ca_system_score_codex":0.00021515145,"about_ca_system_score_gemma":0.0002752618,"threshold_uncertainty_score":0.99969417},"labels":[],"label_agreement":null},{"id":"W4415557138","doi":"10.1007/978-3-031-91266-5_19","title":"Two Toy Spin Chain Models of Decoherence","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; University of British Columbia","funders":"","keywords":"Quantum decoherence; Hamiltonian (control theory); Spins; Chain (unit); Qubit; Coupling constant; Ising model; Transverse field","score_opus":0.01632800180882083,"score_gpt":0.2474817949114632,"score_spread":0.23115379310264236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415557138","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011441741,0.00033640585,0.516877,0.00025420293,0.00028136317,0.00012226308,0.0000065440295,0.00012831991,0.48198244],"genre_scores_gemma":[0.00431559,0.000063097454,0.301491,0.0005304897,0.00016626697,0.000004369934,0.000005677351,0.00002558586,0.69339794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831796,0.000017945347,0.0004226785,0.0006368369,0.0003431381,0.00026147233],"domain_scores_gemma":[0.9984835,0.00012293993,0.00020569874,0.0009844488,0.0001208224,0.00008259171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020024023,0.00033423817,0.00047024278,0.00024264834,0.00006545951,0.00006520051,0.0015586572,0.00016937326,0.000060302205],"category_scores_gemma":[0.000009238251,0.00028549018,0.00020540785,0.00008740542,0.00006620264,0.00008632842,0.000855268,0.0003840922,0.00002158991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001073386,0.000007881496,3.6858532e-7,0.0000355899,0.000023807206,0.000010318571,0.00006304028,0.005458039,0.0000062664176,0.82269025,0.00093753205,0.17076583],"study_design_scores_gemma":[0.00012218498,0.000051956307,0.0000013469545,0.00029517536,0.0000071438744,0.0000073163037,7.5194004e-7,0.63968307,0.000090747744,0.35296127,0.006540279,0.00023874472],"about_ca_topic_score_codex":0.000076400924,"about_ca_topic_score_gemma":0.00002085704,"teacher_disagreement_score":0.634225,"about_ca_system_score_codex":0.000024880172,"about_ca_system_score_gemma":0.00022754309,"threshold_uncertainty_score":0.9999597},"labels":[],"label_agreement":null},{"id":"W4415602322","doi":"10.1007/978-3-032-07986-2_27","title":"Simple Quantum Computing Implemented in Silicon with Decoupling and Encoding Quantum Bits in Classical Data","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Quantum computer; Quantum error correction; Decoupling (probability); Encoding (memory); Quantum; Quantum algorithm; Quantum information; Quantum network; Quantum phase estimation algorithm","score_opus":0.02300624575960848,"score_gpt":0.26534761891479786,"score_spread":0.2423413731551894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415602322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027396765,0.01404843,0.95529336,0.00043650958,0.0009321196,0.0011154066,0.000031581807,0.00015131928,0.0005944886],"genre_scores_gemma":[0.9975011,0.00030320522,0.0014345846,0.00014901537,0.0004090735,0.0000070240258,0.00008906195,0.00004616806,0.000060790826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962155,0.00013852041,0.0009972409,0.0015369888,0.00033220492,0.00077950425],"domain_scores_gemma":[0.9968505,0.0016846998,0.00035449333,0.0009389119,0.000047577723,0.00012382634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012313438,0.0006370023,0.0011186814,0.00060422433,0.0001792236,0.00045657472,0.000965666,0.0005116658,0.0000011574515],"category_scores_gemma":[0.00008156564,0.0005240902,0.000045570472,0.00042318949,0.00009918454,0.00015053668,0.001369547,0.0016188998,2.8846912e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053333348,0.000046193003,0.015027399,0.0006270368,0.000080549464,0.00047946532,0.0008439794,0.82012886,0.000012395953,0.050952543,0.00009475736,0.11165349],"study_design_scores_gemma":[0.000784261,0.00011983363,0.00075776014,0.003888143,0.000013269177,0.00008155759,0.000013852669,0.9890578,9.303517e-7,0.0033370089,0.0013822475,0.00056335726],"about_ca_topic_score_codex":0.0005831226,"about_ca_topic_score_gemma":0.0029317483,"teacher_disagreement_score":0.97010434,"about_ca_system_score_codex":0.000098349934,"about_ca_system_score_gemma":0.00012465211,"threshold_uncertainty_score":0.99972105},"labels":[],"label_agreement":null},{"id":"W4415665770","doi":"10.1145/3772008.3772021","title":"Sixth International Workshop on Quantum Software Engineering (Q-SE 2025)","year":2025,"lang":"en","type":"article","venue":"ACM SIGSOFT Software Engineering Notes","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Software; Software requirements; Social software engineering; Software development; Software construction; Software system; Software development process","score_opus":0.012983915454716487,"score_gpt":0.2505877114172944,"score_spread":0.2376037959625779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415665770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10145824,0.00056195504,0.88883835,0.0016254004,0.004380719,0.0002059817,0.000016934364,0.0029037993,0.00000859983],"genre_scores_gemma":[0.7010281,0.000027907463,0.29757857,0.0005797341,0.00042849767,0.00004103743,0.000027597842,0.00006489724,0.00022362711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742025,0.00002675423,0.00046078514,0.00086851785,0.000501587,0.00072209205],"domain_scores_gemma":[0.9731374,0.025041185,0.00009757863,0.0013999817,0.00013937948,0.0001845004],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028497208,0.0005394476,0.0004055368,0.00063710386,0.00018565581,0.00037603307,0.002720897,0.00020922352,0.000023141145],"category_scores_gemma":[0.06710661,0.0005427302,0.00022172504,0.0009856237,0.0000278599,0.00030112974,0.0011666092,0.0007898053,0.000066211316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030250698,0.0002471004,0.030297274,0.00029687322,0.00033461646,0.00019500419,0.0009284414,0.79725283,0.0010273758,0.019215127,0.0038107233,0.14636439],"study_design_scores_gemma":[0.0013427743,0.00018377443,0.103659794,0.0024373045,0.000046647307,0.000058746995,0.000015556589,0.8419252,0.004517082,0.00081656926,0.04298012,0.0020164503],"about_ca_topic_score_codex":0.00001819744,"about_ca_topic_score_gemma":0.0000010981166,"teacher_disagreement_score":0.5995699,"about_ca_system_score_codex":0.00013744939,"about_ca_system_score_gemma":0.00010148227,"threshold_uncertainty_score":0.9997024},"labels":[],"label_agreement":null},{"id":"W4415668484","doi":"10.2139/ssrn.5677864","title":"Fixed-Energy Learning: Causal Evidence for the r * -Capability Link (S6)","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Energy (signal processing); Mediation; Set (abstract data type); Association (psychology); Core (optical fiber); Stress (linguistics); Test (biology); Link (geometry)","score_opus":0.023813858432114077,"score_gpt":0.29373575358390047,"score_spread":0.2699218951517864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415668484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031431874,0.04863667,0.90775335,0.033260256,0.0061104246,0.0008138308,0.0000114793,0.00017942053,0.00009137057],"genre_scores_gemma":[0.88850206,0.07065328,0.010499191,0.0013743546,0.011304883,0.00020757626,0.000013747265,0.00012915723,0.017315727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98504776,0.0017654018,0.0018550268,0.002328873,0.00136168,0.007641254],"domain_scores_gemma":[0.9877902,0.0067550316,0.0016885485,0.0022344673,0.0011510869,0.00038063468],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.015471687,0.0012881059,0.001240303,0.00039888572,0.0041719335,0.0017875301,0.008002007,0.0007937047,0.000025899417],"category_scores_gemma":[0.0026219385,0.00094536843,0.0017351789,0.0010670312,0.00049110386,0.00053692446,0.0036632866,0.022029996,0.000013460384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019292968,0.00010189416,0.00015175797,0.00013489352,0.000794055,0.0000067335077,0.00079956633,0.19189993,0.000019139194,0.16857529,0.0001705264,0.63715327],"study_design_scores_gemma":[0.0006064248,0.001127322,0.0003323963,0.00093463267,0.0002718246,0.0005852819,0.00018036125,0.666811,0.00004536256,0.29822305,0.030114673,0.00076767866],"about_ca_topic_score_codex":0.00071008364,"about_ca_topic_score_gemma":0.000761598,"teacher_disagreement_score":0.89725417,"about_ca_system_score_codex":0.0025784287,"about_ca_system_score_gemma":0.028597822,"threshold_uncertainty_score":0.99998707},"labels":[],"label_agreement":null},{"id":"W4415695393","doi":"10.1038/s42005-025-02375-9","title":"Fast gradient-free optimization of excitations in variational quantum eigensolvers","year":2025,"lang":"en","type":"article","venue":"Communications Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"First Quantum Minerals (Canada); University of British Columbia; University of British Columbia Hospital","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsches Zentrum für Luft- und Raumfahrt; Bundesministerium für Wirtschaft und Energie; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Quantum; Unitary state; Operator (biology); Scalability; Excitation; Ground state; Energy (signal processing)","score_opus":0.017485324284675,"score_gpt":0.2663152569985339,"score_spread":0.24882993271385892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415695393","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001660619,0.00014659119,0.9927835,0.0026021649,0.0001560159,0.00013302847,0.000014129535,0.00006729672,0.0024366593],"genre_scores_gemma":[0.48162743,0.00005419143,0.51809776,0.00010097093,0.000014049357,0.000020376867,0.00004123742,0.0000052300106,0.00003874696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913186,0.00012074634,0.00029458638,0.00018035005,0.00013697834,0.00013550298],"domain_scores_gemma":[0.99721503,0.00035110192,0.0001281895,0.0021082135,0.00017295664,0.000024507885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017070024,0.00009269854,0.00013301427,0.00018170866,0.00020445902,0.000045619086,0.0023121214,0.00003629681,0.000001694585],"category_scores_gemma":[0.0000942632,0.000102156664,0.000058420006,0.0014045082,0.000105570034,0.00019860151,0.00082816405,0.00017332526,0.000002257146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.821557e-7,0.0001315292,0.00021760789,0.0000066753814,0.000010426859,9.047066e-8,0.000656042,0.42070845,0.00003184379,0.5716425,0.0001429112,0.0064510885],"study_design_scores_gemma":[0.00027774958,0.000011955935,0.003318849,0.000044465563,0.000004935632,3.9981055e-7,0.000044538912,0.87086207,0.000038030248,0.12510645,0.00021606297,0.00007448257],"about_ca_topic_score_codex":0.00004520976,"about_ca_topic_score_gemma":0.000018744788,"teacher_disagreement_score":0.47996682,"about_ca_system_score_codex":0.000044221157,"about_ca_system_score_gemma":0.00014940432,"threshold_uncertainty_score":0.42965353},"labels":[],"label_agreement":null},{"id":"W4415720135","doi":"10.21203/rs.3.rs-7301044/v1","title":"GroverAttention: Quantum-Enhanced Attention Mechanism for Effcient Transformers","year":2025,"lang":"","type":"preprint","venue":"Research Square","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ","funders":"","keywords":"Inference; Transformer; Mechanism (biology); Security token; Computational complexity theory; Deep learning","score_opus":0.04061279948994976,"score_gpt":0.3630747202422467,"score_spread":0.3224619207522969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415720135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037622422,0.00064492336,0.9381793,0.0073441328,0.00664665,0.0072420104,0.0005553984,0.00038075523,0.0013843704],"genre_scores_gemma":[0.9560061,0.0014872988,0.029890642,0.00031996053,0.0017047154,0.0021272087,0.00041480776,0.00012480114,0.0079244785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9850934,0.0016895534,0.0018283102,0.004133414,0.003928029,0.0033272884],"domain_scores_gemma":[0.98999196,0.0017265955,0.000497412,0.0023150982,0.004701863,0.0007670433],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0072284173,0.0012324188,0.0014291329,0.0020769108,0.0034715803,0.0022354515,0.0040076734,0.0010971164,0.00009490818],"category_scores_gemma":[0.00065115665,0.001224843,0.001995639,0.0029734967,0.00049419916,0.0004700753,0.0030602093,0.004138619,0.00013606294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005811639,0.0017386588,0.000028486415,0.01589798,0.0007722294,0.00006512503,0.005168992,0.017661877,0.010559511,0.5667338,0.003043781,0.3777484],"study_design_scores_gemma":[0.002236727,0.0017977712,0.00042545988,0.0063082683,0.000078302204,0.00001606413,0.0005751992,0.8704582,0.005655748,0.107827626,0.0034425342,0.0011781229],"about_ca_topic_score_codex":0.00025444114,"about_ca_topic_score_gemma":0.000052938463,"teacher_disagreement_score":0.91838366,"about_ca_system_score_codex":0.0008827282,"about_ca_system_score_gemma":0.0023646466,"threshold_uncertainty_score":0.99902016},"labels":[],"label_agreement":null},{"id":"W4415748036","doi":"10.1109/lra.2025.3627071","title":"Quantum Machine Learning and Grover's Algorithm for Quantum Optimization of Robotic Manipulators","year":2025,"lang":"","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Quantum machine learning; Kinematics; Oracle; Robotics; Parameterized complexity; Quantum; Quantum algorithm; Robot; Dimensionality reduction","score_opus":0.009307229253889743,"score_gpt":0.23742717849078998,"score_spread":0.22811994923690024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415748036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014688356,0.001185312,0.9755684,0.005682056,0.002119445,0.0005877995,0.000015020013,0.00014769153,0.0000059239087],"genre_scores_gemma":[0.53023595,0.0004237072,0.46814734,0.0008360084,0.0001859784,0.000013396093,0.000034089127,0.000048719605,0.00007483176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972655,0.00019291483,0.00089786644,0.0007900631,0.00033869492,0.000514918],"domain_scores_gemma":[0.99832636,0.0004465233,0.0005941045,0.0003152736,0.00017843833,0.00013927053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057085196,0.00046220585,0.00065473374,0.0005175879,0.000723194,0.0004384705,0.00033477004,0.0001901569,0.000002758827],"category_scores_gemma":[0.000080120604,0.00047397972,0.00015333631,0.0006601736,0.00021806956,0.00033151297,0.00021378527,0.0003764462,7.503375e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071122386,0.000062793326,0.00022440404,0.00040069493,0.00010652998,0.0000037070997,0.0004307171,0.8976154,0.0004827488,0.008871829,0.00009469593,0.09169939],"study_design_scores_gemma":[0.0010817844,0.00024967355,0.00074092177,0.0005340135,0.00014592944,0.000021884982,0.000035336307,0.99542314,0.00020093625,0.0010262382,0.00010344771,0.00043667454],"about_ca_topic_score_codex":0.00005916217,"about_ca_topic_score_gemma":0.0000018426401,"teacher_disagreement_score":0.5155476,"about_ca_system_score_codex":0.000053358435,"about_ca_system_score_gemma":0.00008540885,"threshold_uncertainty_score":0.9997712},"labels":[],"label_agreement":null},{"id":"W4416027239","doi":"10.4018/979-8-3373-2893-5.ch011","title":"Quantum-Driven Finance Transforming Banking Through Next-Generation Technologies","year":2025,"lang":"ng","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vanier College","funders":"","keywords":"Portfolio; Risk management; Multidisciplinary approach; Quantum computer; Quantum; Financial modeling; Financial risk; Set (abstract data type); Investment (military)","score_opus":0.04173938216640168,"score_gpt":0.25244274185270144,"score_spread":0.21070335968629975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416027239","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093680347,0.0035352444,0.897604,0.004846061,0.0026331912,0.0007947202,0.000026366835,0.001668961,0.08795463],"genre_scores_gemma":[0.4391615,0.009041945,0.49141812,0.0013924615,0.0014489517,0.00006491502,0.000095271986,0.00017902383,0.057197813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951172,0.00005967138,0.0011334699,0.0019594654,0.0007360232,0.0009942008],"domain_scores_gemma":[0.997413,0.00030334294,0.00049396185,0.001496213,0.0002423248,0.000051178515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034516313,0.0011262154,0.0010486302,0.00036846567,0.0012260813,0.0009118277,0.0024500121,0.0010084113,0.00008290523],"category_scores_gemma":[0.0000578787,0.0010307123,0.0005401573,0.00046069725,0.0003453495,0.0008801445,0.0009479615,0.0016774122,0.000090933354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003877649,0.000021779762,0.0000032088908,0.000101737496,0.00006670029,0.00005897301,0.0006255979,0.009015419,0.00054684567,0.6263239,0.0005061302,0.36272585],"study_design_scores_gemma":[0.00029847582,0.00020077628,0.000003870638,0.0015967276,0.00005961932,0.00006159979,0.000051351915,0.84327465,0.0029427828,0.059615053,0.090826795,0.0010682729],"about_ca_topic_score_codex":0.00010064149,"about_ca_topic_score_gemma":0.00005832403,"teacher_disagreement_score":0.8342593,"about_ca_system_score_codex":0.0001440444,"about_ca_system_score_gemma":0.00036446526,"threshold_uncertainty_score":0.9992143},"labels":[],"label_agreement":null},{"id":"W4416051513","doi":"10.48550/arxiv.2508.15759","title":"Belief Propagation TNS data sets","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Office of Science; Canada First Research Excellence Fund; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; U.S. Department of Energy","keywords":"Scaling; Quantum; Quantum annealing; Quantum algorithm; Quantum process; Quantum system; Measure (data warehouse)","score_opus":0.05558772314621373,"score_gpt":0.3014525651439273,"score_spread":0.24586484199771358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416051513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35889077,0.0006829135,0.6246625,0.007365784,0.0045792493,0.0006891771,0.00018253367,0.0010361766,0.0019108775],"genre_scores_gemma":[0.86717284,0.000101273574,0.12755047,0.0015752317,0.0010250375,0.000044102817,0.0007251712,0.000037740214,0.0017681696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972789,0.0001372484,0.00039015763,0.0014390997,0.00035926743,0.00039532073],"domain_scores_gemma":[0.9956106,0.000117157884,0.00024182316,0.0038122945,0.000116244555,0.00010189935],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00049615285,0.00034640575,0.00034086697,0.00017343654,0.00023065084,0.00025380237,0.0049516927,0.00024200333,0.0000075311145],"category_scores_gemma":[0.00013003768,0.0003141584,0.000095480704,0.00035809132,0.00005279296,0.00020199725,0.012152287,0.0010078667,0.000094831055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017181977,0.0006544398,0.060439754,0.0014070196,0.00047654455,0.00025199744,0.0037416373,0.04624321,0.00038883803,0.009191777,0.030262794,0.8469248],"study_design_scores_gemma":[0.00018951316,0.000039078983,0.038511172,0.00044765708,0.000027102662,0.000013010336,0.0000050602557,0.943303,0.00035435226,0.0040546204,0.012570602,0.00048484874],"about_ca_topic_score_codex":0.00010769103,"about_ca_topic_score_gemma":0.000016686517,"teacher_disagreement_score":0.8970598,"about_ca_system_score_codex":0.000047361733,"about_ca_system_score_gemma":0.00044106878,"threshold_uncertainty_score":0.99993104},"labels":[],"label_agreement":null},{"id":"W4416068496","doi":"10.48550/arxiv.2509.07876","title":"The Compressed Oracle is a Worthy (Multiplicative) Adversary","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Oracle; Adversary; Multiplicative function; Upper and lower bounds; Random oracle; Quantum; Context (archaeology); Time complexity","score_opus":0.023092903227245033,"score_gpt":0.2716553101922736,"score_spread":0.2485624069650286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416068496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4898739,0.0048781913,0.4612972,0.032123607,0.0043290085,0.0013619482,0.00009640886,0.0014751238,0.0045646196],"genre_scores_gemma":[0.9589984,0.00031546757,0.031494584,0.003438736,0.00053770276,0.00013941304,0.000022918204,0.000038580783,0.00501421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973368,0.00019619905,0.00043548804,0.0011320031,0.00036645908,0.0005330634],"domain_scores_gemma":[0.99637705,0.00052479946,0.00031940287,0.002473556,0.0001761646,0.00012899656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036209304,0.00042673334,0.0003991391,0.00010898875,0.0007025537,0.00030719087,0.003933906,0.00022493608,0.00000820938],"category_scores_gemma":[0.000076583565,0.00030978417,0.00029363285,0.00045372447,0.00016882623,0.0000882688,0.005625213,0.0013301276,0.00010291861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010474625,0.00080147147,0.12212404,0.0006850629,0.0013911406,0.00019660546,0.017262697,0.0458254,0.0004483991,0.009432457,0.06891203,0.7328159],"study_design_scores_gemma":[0.00043722926,0.000045993653,0.0959914,0.00038725339,0.000031198953,0.0000072684034,0.000038320497,0.7787975,0.0011132056,0.0054980284,0.1169872,0.0006654112],"about_ca_topic_score_codex":0.00013908732,"about_ca_topic_score_gemma":0.000012232705,"teacher_disagreement_score":0.7329721,"about_ca_system_score_codex":0.00005455301,"about_ca_system_score_gemma":0.00029042806,"threshold_uncertainty_score":0.99993545},"labels":[],"label_agreement":null},{"id":"W4416087063","doi":"10.21105/joss.09125","title":"mdopt: A code-agnostic tensor-network decoder for quantum error-correcting codes","year":2025,"lang":"","type":"article","venue":"The Journal of Open Source Software","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; Canada First Research Excellence Fund","keywords":"Quantum; Decoding methods; Encoding (memory); Code (set theory); Block code","score_opus":0.026339769556132337,"score_gpt":0.3099952204474936,"score_spread":0.2836554508913613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416087063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074686535,0.007006673,0.90563524,0.005987537,0.0052406774,0.0012454388,0.00003822714,0.00009641879,0.000063240215],"genre_scores_gemma":[0.70818704,0.00036325218,0.28022677,0.0046263156,0.0028627785,0.000027076172,0.0000047716935,0.0001672178,0.0035347713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99375165,0.0012178158,0.0020598073,0.0007118541,0.0008288103,0.0014300465],"domain_scores_gemma":[0.9835405,0.011062399,0.0023645072,0.001321024,0.0013715368,0.00034002992],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00769446,0.0007558849,0.001488225,0.00031684383,0.0029780727,0.0021021818,0.008850374,0.00027123766,0.000046829882],"category_scores_gemma":[0.004151586,0.0005259174,0.0007037266,0.001681397,0.00039159317,0.0006467514,0.0034195941,0.0019217132,0.000016738848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005942469,0.00021739106,0.0020589177,0.00022212633,0.0005957954,0.00004439337,0.0065944316,0.66611147,0.00001603145,0.0005453309,0.03589371,0.28710616],"study_design_scores_gemma":[0.0024676968,0.00113871,0.0013966715,0.0047852993,0.0007080072,0.0013862292,0.0015411784,0.92085457,0.00014205698,0.020121174,0.044678602,0.0007798172],"about_ca_topic_score_codex":0.00012103603,"about_ca_topic_score_gemma":0.00011105838,"teacher_disagreement_score":0.6335005,"about_ca_system_score_codex":0.00017942576,"about_ca_system_score_gemma":0.001334979,"threshold_uncertainty_score":0.99971926},"labels":[],"label_agreement":null},{"id":"W4416213003","doi":"10.1016/j.cosrev.2025.100846","title":"Navigating the quantum computing threat landscape for blockchains: A comprehensive survey","year":2025,"lang":"en","type":"article","venue":"Computer Science Review","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Public Safety Canada","keywords":"Quantum; Quantum computer; Field (mathematics); Key (lock)","score_opus":0.028111056893404453,"score_gpt":0.3333329501902971,"score_spread":0.30522189329689264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416213003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014557545,0.03808458,0.93653876,0.0075502195,0.0017845038,0.0011451914,0.000005935205,0.0002870293,0.000046230714],"genre_scores_gemma":[0.5383181,0.0060460996,0.41900903,0.035455182,0.0009105794,0.0001336091,0.000026085023,0.00005552343,0.000045806562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639237,0.00034720212,0.0006799679,0.0011438581,0.00056799443,0.00086859637],"domain_scores_gemma":[0.9956233,0.0017436842,0.0003072838,0.0014530323,0.0007242225,0.00014846222],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0038587449,0.0003717997,0.0006448446,0.000100995094,0.0016714981,0.0006943861,0.0044669737,0.000053052077,0.0000014705371],"category_scores_gemma":[0.00027742254,0.00024183962,0.00024747459,0.0035656416,0.00044294115,0.0002629561,0.0019210904,0.00056274387,0.0000118900325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025725135,0.000056838784,0.0007269901,0.0009524522,0.00003508371,0.000005919214,0.00043441087,0.0051725544,0.00003055939,0.015780417,0.003644517,0.9731577],"study_design_scores_gemma":[0.00026223646,0.00008796477,0.0067467387,0.0051618894,0.000016693071,0.00004877222,0.0000074033446,0.9801907,0.00004642032,0.0019720944,0.0051560043,0.0003030899],"about_ca_topic_score_codex":0.00004444232,"about_ca_topic_score_gemma":0.000005624493,"teacher_disagreement_score":0.97501814,"about_ca_system_score_codex":0.00005451846,"about_ca_system_score_gemma":0.00046553148,"threshold_uncertainty_score":0.9996282},"labels":[],"label_agreement":null},{"id":"W4416240385","doi":"10.48550/arxiv.2511.10633","title":"Impacts of Decoder Latency on Utility-Scale Quantum Computer Architectures","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut Périmètre de physique théorique; Defense Advanced Research Projects Agency; Mitacs; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Quantum computer; Qubit; Decoding methods; Quantum error correction; Quantum; Latency (audio); Quantum circuit","score_opus":0.02479845266398734,"score_gpt":0.27508367664525785,"score_spread":0.2502852239812705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416240385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8272492,0.0007237431,0.16104844,0.0027147962,0.005989906,0.0009984004,0.0001608241,0.0003664663,0.0007481784],"genre_scores_gemma":[0.97048086,0.00018109436,0.02630101,0.0014489611,0.0010963592,0.00002784439,0.00003407306,0.00007620816,0.00035361972],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98997784,0.0010292665,0.0021296882,0.003556243,0.0013517967,0.0019551783],"domain_scores_gemma":[0.9913616,0.0014023099,0.001415376,0.0045283623,0.00059613836,0.0006961686],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0014248207,0.0018354151,0.0023212775,0.0010647886,0.00069699046,0.00034370628,0.0052180905,0.0010280713,0.00012429296],"category_scores_gemma":[0.0002073297,0.0016296108,0.0014273945,0.0014287526,0.00071674754,0.00013316987,0.0064113154,0.0039986786,0.00016226369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046561306,0.002786954,0.41965228,0.0032396393,0.0011797854,0.00022813886,0.01230138,0.22577094,0.00060449075,0.002427091,0.0026797936,0.3286639],"study_design_scores_gemma":[0.0007901303,0.00076431694,0.37688747,0.0025316484,0.000095844225,0.00003877891,0.000017135524,0.6091307,0.002678165,0.0044646068,0.0015063379,0.0010948563],"about_ca_topic_score_codex":0.00066307926,"about_ca_topic_score_gemma":0.00008638569,"teacher_disagreement_score":0.38335976,"about_ca_system_score_codex":0.00013821974,"about_ca_system_score_gemma":0.0011565787,"threshold_uncertainty_score":0.99943906},"labels":[],"label_agreement":null},{"id":"W4416243618","doi":"10.2139/ssrn.5726263","title":"Quantum Sonar Denoising with Real-Time VQE Ground-State Preparation on Real IBM Quantum Hardware for Naval Defense","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Quantum Research Center","funders":"","keywords":"Quantum computer; Quantum; Sonar; Quantum algorithm; Noise reduction; Quantum state; Deconvolution; Energy (signal processing); Noise (video)","score_opus":0.009750101328335275,"score_gpt":0.25980792475444486,"score_spread":0.2500578234261096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416243618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34810224,0.000666333,0.6474114,0.0011817918,0.00096113834,0.00089428603,0.000052344338,0.000433909,0.00029651148],"genre_scores_gemma":[0.912162,0.0072815926,0.07091803,0.00037657484,0.0028796503,0.0001830969,0.00024226405,0.00028987465,0.005666922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926478,0.00046481963,0.00094166404,0.0014939975,0.000945667,0.0035060241],"domain_scores_gemma":[0.9967478,0.00041576926,0.0010352086,0.0010912543,0.00047040838,0.00023959091],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0029102003,0.00086453423,0.00088667386,0.00052908226,0.0010935783,0.0009910144,0.0020311372,0.00036718076,0.000002413564],"category_scores_gemma":[0.0000628227,0.00073035905,0.00050578633,0.0004298802,0.000101786514,0.00032199698,0.00068919774,0.00477741,0.000018459243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027860976,0.0008436904,0.00010284626,0.0004851998,0.0018109828,0.0001992671,0.0051494692,0.23775607,0.00083736016,0.60514563,0.0014214618,0.14346193],"study_design_scores_gemma":[0.0013773018,0.0033574502,0.00014522903,0.0009451915,0.00011659267,0.0008445074,0.00010204723,0.60467255,0.00016856757,0.3867106,0.00064652954,0.00091341784],"about_ca_topic_score_codex":0.0004569262,"about_ca_topic_score_gemma":0.00048998307,"teacher_disagreement_score":0.5764934,"about_ca_system_score_codex":0.0017286326,"about_ca_system_score_gemma":0.008247565,"threshold_uncertainty_score":0.99951476},"labels":[],"label_agreement":null},{"id":"W4416244017","doi":"10.1109/chilecon66915.2025.11476221","title":"Bridging Theory and Practice in Quantum Game Theory: Optimized Implementation of the Battle of the Sexes with Error Mitigation on NISQ Hardware","year":2025,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Qubit; IBM; Quantum computer; Stochastic game; Game theory; Bridging (networking); Quantum","score_opus":0.006640231801465477,"score_gpt":0.27670619235249194,"score_spread":0.27006596055102644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416244017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66386294,0.00007147956,0.32943195,0.0054827137,0.00022830702,0.00033173614,0.00000510665,0.00002609677,0.00055966235],"genre_scores_gemma":[0.98975635,0.0000035494093,0.009743066,0.00040902337,0.000009225812,0.0000061176047,6.5911644e-7,0.000004486568,0.00006754435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854356,0.00071452145,0.00020867078,0.00020886812,0.00020206867,0.00012233334],"domain_scores_gemma":[0.9972422,0.0021158054,0.00020418601,0.00036716284,0.0000572684,0.000013342223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011643221,0.00009737513,0.00013300085,0.000071649505,0.00009478833,0.000043108925,0.0003911489,0.000024091865,0.00000397935],"category_scores_gemma":[0.00035682207,0.000048985796,0.000038825518,0.00042886558,0.000111612775,0.00013399933,0.00021383227,0.0001356013,1.4921342e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027590187,0.000120186036,0.0024536743,0.000088377,0.00008628041,0.0000016986054,0.010382449,0.051805582,0.0018571428,0.80748737,0.00013421614,0.12530714],"study_design_scores_gemma":[0.002761688,0.00027969448,0.0971153,0.000784204,0.000068189824,0.000028912791,0.0061469064,0.7810213,0.057328455,0.05403653,0.00015697881,0.0002718464],"about_ca_topic_score_codex":0.000085518346,"about_ca_topic_score_gemma":0.000029109277,"teacher_disagreement_score":0.7534508,"about_ca_system_score_codex":0.000014612066,"about_ca_system_score_gemma":0.00009846671,"threshold_uncertainty_score":0.19975828},"labels":[],"label_agreement":null},{"id":"W4416254315","doi":"10.48550/arxiv.2509.19005","title":"Quantum Annealing for Minimum Bisection Problem: A Machine Learning-based Approach for Penalty Parameter Tuning","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quadratic unconstrained binary optimization; Quantum annealing; Simulated annealing; Bisection method; Quadratic equation; Solver; Penalty method; Graph","score_opus":0.044338150205864645,"score_gpt":0.2805361195340266,"score_spread":0.23619796932816192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416254315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09562096,0.0003629841,0.8993675,0.0010341009,0.0010646454,0.0018183854,0.00006673175,0.0006102146,0.000054465705],"genre_scores_gemma":[0.5193493,0.0000071340423,0.47804368,0.00047453068,0.00047627933,0.00079478754,0.00038043823,0.000057814555,0.00041605977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996361,0.00021738447,0.0006826385,0.0016537408,0.0003021506,0.00078309124],"domain_scores_gemma":[0.99716413,0.0008958373,0.0005685113,0.00091782433,0.00030422813,0.00014945139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011675627,0.00060586684,0.00070776633,0.0004326917,0.00068976014,0.0003515231,0.0014156686,0.0004032152,0.0000017136392],"category_scores_gemma":[0.00036936867,0.0005601023,0.0005827651,0.00042599638,0.00006347797,0.000110386136,0.0009477166,0.0012675961,0.0000021162693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010004015,0.00020328729,0.007370195,0.0019631067,0.00016240746,0.000003950699,0.00090261333,0.97199076,0.00020694023,0.00048552634,0.0003762861,0.016234906],"study_design_scores_gemma":[0.0009073771,0.00040541103,0.0005128779,0.00040787898,0.00006847679,0.000006038063,0.00001437434,0.99094236,0.00043181417,0.002662299,0.003026186,0.0006149342],"about_ca_topic_score_codex":0.00016287481,"about_ca_topic_score_gemma":0.000009282081,"teacher_disagreement_score":0.42372832,"about_ca_system_score_codex":0.000098151584,"about_ca_system_score_gemma":0.00040008023,"threshold_uncertainty_score":0.99968505},"labels":[],"label_agreement":null},{"id":"W4416375382","doi":"10.1088/1402-4896/ae216a","title":"Prospects of quantum error mitigation for quantum signal processing","year":2025,"lang":"","type":"article","venue":"Physica Scripta","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"USable; Quantum; Ising model; Hamiltonian (control theory); Noise (video); Exponential function; SIGNAL (programming language); Quantum computer","score_opus":0.016755387766240117,"score_gpt":0.2739878566713489,"score_spread":0.25723246890510876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416375382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07227236,0.0021613787,0.91600674,0.004718377,0.002843052,0.0014241397,0.00005384611,0.00021010157,0.00030997436],"genre_scores_gemma":[0.97903967,0.000010349824,0.01922056,0.00035761084,0.00058896083,0.00007777067,0.000013515266,0.000040899653,0.0006506698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960473,0.00015675675,0.0009624536,0.0012892409,0.000623641,0.0009205889],"domain_scores_gemma":[0.9974108,0.00014758059,0.00072655187,0.0008360923,0.0007168983,0.00016211008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000529344,0.00056892104,0.00084601145,0.0003293968,0.0007284323,0.000440577,0.0015366192,0.00016214636,0.0000062535096],"category_scores_gemma":[0.00009286823,0.00055695535,0.00045715473,0.0017453219,0.00038625213,0.0005523575,0.0005024551,0.0004713915,0.0000088710985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018600779,0.0015557943,0.00017766767,0.0042251977,0.0002383011,0.000007952105,0.0053977626,0.0052100522,0.039185144,0.39438227,0.012325532,0.5371083],"study_design_scores_gemma":[0.00092265854,0.00054068497,0.001200067,0.0015119556,0.000102851955,0.0000033079873,0.00012386033,0.8828719,0.016560776,0.09234572,0.0033448515,0.00047134297],"about_ca_topic_score_codex":0.000048329588,"about_ca_topic_score_gemma":0.0000032962057,"teacher_disagreement_score":0.9067673,"about_ca_system_score_codex":0.00008532476,"about_ca_system_score_gemma":0.000922607,"threshold_uncertainty_score":0.9996882},"labels":[],"label_agreement":null},{"id":"W4416375798","doi":"10.48550/arxiv.2504.17923","title":"EAQGA: A Quantum-Enhanced Genetic Algorithm with Novel Entanglement-Aware Crossovers","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum computer; Crossover; Qubit; Genetic algorithm; Meta-optimization; Genetic representation; Quantum entanglement; Quantum algorithm; Quantum","score_opus":0.01823071151946075,"score_gpt":0.25526093033037806,"score_spread":0.2370302188109173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416375798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28757536,0.00028418918,0.70858824,0.0005790779,0.001611562,0.00051778025,0.00018810286,0.0005046183,0.00015104376],"genre_scores_gemma":[0.7594519,0.000096622134,0.23697563,0.0013850393,0.00069261447,0.00016295662,0.00009140083,0.00007971609,0.0010640965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954652,0.00010318856,0.00072787126,0.0019834696,0.0007363483,0.0009838969],"domain_scores_gemma":[0.99670315,0.00015894006,0.0005232641,0.0020901184,0.00027308456,0.00025144225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027677958,0.0008389265,0.0007559137,0.00031239714,0.00043946347,0.00045478987,0.002864063,0.00035084967,0.000019997065],"category_scores_gemma":[0.000033221448,0.0007303706,0.00030632177,0.00071260246,0.00019233672,0.00015252524,0.003589073,0.0013744856,0.000039080263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020262646,0.0027338988,0.04863716,0.0022530511,0.0031664995,0.0013987826,0.013314123,0.42819047,0.0035886273,0.0044528996,0.003592284,0.48846957],"study_design_scores_gemma":[0.0018290215,0.00034810472,0.036820557,0.0010156248,0.00010159513,0.000059238115,0.00008186953,0.9506701,0.0038513255,0.001025248,0.0027113995,0.0014859011],"about_ca_topic_score_codex":0.00025517336,"about_ca_topic_score_gemma":0.000024194707,"teacher_disagreement_score":0.52247965,"about_ca_system_score_codex":0.00018951998,"about_ca_system_score_gemma":0.0007112473,"threshold_uncertainty_score":0.99951476},"labels":[],"label_agreement":null},{"id":"W4416381161","doi":"10.48550/arxiv.2504.18429","title":"CHSH Violations using Dynamic Circuits","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Controlled NOT gate; Electronic circuit; Unitary state; Quantum entanglement; Quantum computer; Quantum circuit; Qubit; Scalability; Feed forward","score_opus":0.03511334220386615,"score_gpt":0.29135115699863273,"score_spread":0.2562378147947666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416381161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52711225,0.00031632374,0.46899682,0.00055098796,0.002093374,0.00017681214,0.000016423737,0.00034231172,0.00039468257],"genre_scores_gemma":[0.966098,0.000024526002,0.032837167,0.00035002647,0.0002344334,0.000011454681,0.000020973966,0.000018474624,0.0004049571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978433,0.00010942058,0.00038978586,0.00095730193,0.00026181687,0.00043836827],"domain_scores_gemma":[0.9980359,0.00012796604,0.00022688977,0.0013764306,0.0001253463,0.00010747214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023131765,0.0003550558,0.0003688196,0.00028937482,0.00034946896,0.00021641942,0.0017429295,0.00026377878,0.000008156745],"category_scores_gemma":[0.00006090101,0.00035924133,0.0002202222,0.0005079168,0.000051707313,0.00010906148,0.002713988,0.0010014945,0.000042089752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005031423,0.00050671824,0.15706299,0.00097304006,0.00063797506,0.00029990278,0.004660494,0.57354164,0.0033689453,0.010990156,0.00072363776,0.24722947],"study_design_scores_gemma":[0.00011443175,0.000013219558,0.047454968,0.00038764314,0.000024126251,0.000019225698,0.000004542514,0.94738567,0.00009856574,0.0034042534,0.0007164718,0.00037691093],"about_ca_topic_score_codex":0.00007495957,"about_ca_topic_score_gemma":0.000013897239,"teacher_disagreement_score":0.4389857,"about_ca_system_score_codex":0.00012515274,"about_ca_system_score_gemma":0.0004367519,"threshold_uncertainty_score":0.999886},"labels":[],"label_agreement":null},{"id":"W4416385146","doi":"10.48550/arxiv.2510.08403","title":"A Quantum Time-Space Tradeoff for Directed $st$-Connectivity","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Quantum; Quantum algorithm; Space (punctuation); Path (computing); Quantum complexity theory; Quantum computer; Computational complexity theory; Directed graph; Rest (music); Time complexity","score_opus":0.024113912485339232,"score_gpt":0.2621677354666748,"score_spread":0.2380538229813356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416385146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.531026,0.00051758834,0.4553384,0.006400475,0.002914876,0.0010579921,0.00016895073,0.0019532589,0.0006224309],"genre_scores_gemma":[0.89640105,0.00004218607,0.09675773,0.00093956647,0.0012362074,0.00032735278,0.000115971605,0.00008730712,0.004092602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964651,0.00024649937,0.00047855303,0.0017010594,0.0003327307,0.000776082],"domain_scores_gemma":[0.9965865,0.0009349788,0.0003419673,0.0017463126,0.0002016699,0.00018858307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062172563,0.0006330184,0.00082218944,0.00029070125,0.00037668078,0.0002614377,0.0022884929,0.0004556819,0.000012648739],"category_scores_gemma":[0.0003791759,0.00059954694,0.00051594974,0.00057250157,0.00008495984,0.00013066379,0.0022140597,0.0011514917,0.000049132155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064521853,0.0052400255,0.062748805,0.007918084,0.004534827,0.00056807045,0.020434145,0.12993449,0.011754001,0.109221146,0.17135368,0.4756475],"study_design_scores_gemma":[0.00052756036,0.0001300751,0.01632916,0.00040611677,0.000051854855,0.000011773425,0.0000059685485,0.9553178,0.0014279734,0.0122954,0.012714159,0.0007821333],"about_ca_topic_score_codex":0.00012534614,"about_ca_topic_score_gemma":0.00001609477,"teacher_disagreement_score":0.8253833,"about_ca_system_score_codex":0.000107842956,"about_ca_system_score_gemma":0.0004874966,"threshold_uncertainty_score":0.9996456},"labels":[],"label_agreement":null},{"id":"W4416407805","doi":"10.48550/arxiv.2507.19093","title":"Graph Neural Network-Based Predictor for Optimal Quantum Hardware Selection","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum circuit; Electronic circuit; Quantum gate; Metric (unit); Quantum computer; Process (computing); Artificial neural network; Quantum; Graph","score_opus":0.023712864411058278,"score_gpt":0.2595096422033224,"score_spread":0.23579677779226413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416407805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34594235,0.00029483731,0.64693624,0.0012292664,0.004061048,0.00066026155,0.00006134952,0.0007855659,0.000029053806],"genre_scores_gemma":[0.86315054,0.000014781151,0.13237679,0.0011620825,0.0023879064,0.00029216512,0.00016396072,0.000055012708,0.00039675744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967565,0.00016792816,0.0005310148,0.0013740779,0.0003457485,0.0008247398],"domain_scores_gemma":[0.99790823,0.00032146592,0.00033419018,0.0009836992,0.00028014925,0.00017225857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042900827,0.00055708626,0.0005601625,0.00026098476,0.0004920789,0.0002870254,0.0017837174,0.0004000636,0.000006383031],"category_scores_gemma":[0.0000894807,0.00053298887,0.0005238547,0.0006211817,0.00007078616,0.00011860978,0.0011781587,0.0011287471,0.000007063096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038170267,0.00007711484,0.029310763,0.00025618868,0.000095000425,0.000008969752,0.00013627547,0.9579911,0.000023656297,0.0009712828,0.0050877407,0.0060037333],"study_design_scores_gemma":[0.0004990045,0.00022418695,0.022487156,0.00031039127,0.000049279966,0.0000063219563,0.000002525623,0.97035784,0.00017172874,0.002197408,0.0031941242,0.0005000154],"about_ca_topic_score_codex":0.00005346498,"about_ca_topic_score_gemma":0.000011559797,"teacher_disagreement_score":0.51720816,"about_ca_system_score_codex":0.00007765161,"about_ca_system_score_gemma":0.0004782487,"threshold_uncertainty_score":0.99971217},"labels":[],"label_agreement":null},{"id":"W4416411406","doi":"10.1038/s41467-025-64996-6","title":"Simulating the quantum switch with quantum circuits is computationally hard","year":2025,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Perimeter Institute; University of Waterloo","funders":"Ministry of Colleges and Universities; National Science Foundation; Government of Canada; Institut Périmètre de physique théorique; National Centres of Competence in Research SwissMAP; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Quantum; Quantum circuit; Quantum network; Quantum error correction; Quantum algorithm; Robustness (evolution); Quantum gate; Quantum channel; Quantum capacity","score_opus":0.01793844757206645,"score_gpt":0.2914693854686198,"score_spread":0.2735309378965533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416411406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032294635,0.0061711236,0.80630535,0.14770637,0.00074712385,0.00068195007,0.000018282853,0.0007111737,0.0053639947],"genre_scores_gemma":[0.9419169,0.000036014728,0.051718388,0.0060592783,0.000050794206,0.000023641702,0.000017459031,0.000013773639,0.00016379626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829334,0.00023759526,0.00033438776,0.00042368603,0.00039403478,0.00031696638],"domain_scores_gemma":[0.9947393,0.0016081274,0.00018101126,0.0030029223,0.00040638554,0.00006225136],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00046995303,0.00022544755,0.00021201752,0.00016659992,0.0014642633,0.00036991033,0.004647998,0.00017074407,0.0000038546386],"category_scores_gemma":[0.00014368477,0.00015180261,0.00010048617,0.0015028486,0.00018947014,0.00018541282,0.0011197464,0.0015765978,0.00001992081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003963783,0.0001450296,0.0018258778,0.000019710991,0.00012597351,0.000003039638,0.0019888969,0.01871677,0.00012078016,0.93401355,0.00695154,0.036084842],"study_design_scores_gemma":[0.0002718046,0.000034416007,0.017083934,0.00010871761,0.000018357758,0.000014571258,0.00006604777,0.931371,0.00004124446,0.019260181,0.031535942,0.00019380814],"about_ca_topic_score_codex":0.000028265866,"about_ca_topic_score_gemma":0.000044767057,"teacher_disagreement_score":0.9147534,"about_ca_system_score_codex":0.000047084,"about_ca_system_score_gemma":0.00029346894,"threshold_uncertainty_score":0.99983567},"labels":[],"label_agreement":null},{"id":"W4416424346","doi":"10.1103/p28m-hb6x","title":"Measurement-Free Code-Switching Protocol for Low-Overhead Quantum Computation Using Permutation-Invariant Codes","year":2025,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"AXYS Technologies (Canada)","funders":"Centre of Excellence in Engineered Quantum Systems, Australian Research Council; Engineering and Physical Sciences Research Council","keywords":"Quantum computer; Quantum gate; Universal set; Transversal (combinatorics); Quantum error correction; Quantum convolutional code; Code (set theory); Error detection and correction; Logic gate","score_opus":0.04470553899667954,"score_gpt":0.32679632701301514,"score_spread":0.2820907880163356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416424346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008223323,0.000046725374,0.95414734,0.0016167943,0.0007543721,0.034617536,0.000017917671,0.0004733194,0.00010268935],"genre_scores_gemma":[0.69678813,0.0000014198673,0.26801494,0.0010649259,0.00041706365,0.033576913,0.000015419018,0.000082778366,0.000038391652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965632,0.00023680752,0.00079079805,0.0009198867,0.000791495,0.0006978311],"domain_scores_gemma":[0.9976857,0.00035197285,0.00038580294,0.0008402709,0.0006010288,0.00013525753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015320143,0.00041966338,0.00047067463,0.0003638466,0.00088905124,0.000609061,0.0013915336,0.00013936953,0.000002854875],"category_scores_gemma":[0.0005638998,0.00038810264,0.00021087726,0.00076399685,0.00006267522,0.00045919232,0.0004957296,0.0003392012,0.000007291196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037808358,0.0011026777,0.0007302536,0.0028479637,0.00040771297,0.0000479653,0.0036399711,0.2763846,0.027012007,0.6085156,0.0064719906,0.07246113],"study_design_scores_gemma":[0.0021149486,0.00015193036,0.00064985035,0.00079291436,0.000024984993,0.000016908692,0.000049236394,0.89283115,0.0012940727,0.10066525,0.0010098538,0.00039893037],"about_ca_topic_score_codex":0.00012329733,"about_ca_topic_score_gemma":0.000038518803,"teacher_disagreement_score":0.68856484,"about_ca_system_score_codex":0.00022766832,"about_ca_system_score_gemma":0.0006523119,"threshold_uncertainty_score":0.99985707},"labels":[],"label_agreement":null},{"id":"W4416440263","doi":"10.48550/arxiv.2511.01845","title":"The Born Ultimatum: Conditions for Classical Surrogation of Quantum Generative Models with Correlators","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Genetics; Engineering and Physical Sciences Research Council","keywords":"Quantum; Quantum Fourier transform; Truncation (statistics); Pauli exclusion principle; Fourier transform; Quantum operation; Algebra over a field; Quantum process; Quantum algorithm; Quantum machine learning","score_opus":0.03401370208240373,"score_gpt":0.28094569303381817,"score_spread":0.24693199095141444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416440263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31855875,0.00031229085,0.6742232,0.0029273198,0.0021530385,0.0012745745,0.0002790405,0.0001058614,0.0001659367],"genre_scores_gemma":[0.96973616,0.00012755556,0.028311683,0.00020617343,0.00036554693,0.0002842221,0.00013204002,0.00004147537,0.0007951618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953152,0.0004437212,0.0012087331,0.0015287322,0.0006632117,0.0008404266],"domain_scores_gemma":[0.99349356,0.0023286594,0.0011509267,0.0016408181,0.00116919,0.0002168347],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008840709,0.0007728577,0.0009206876,0.00022393955,0.0018050919,0.00031991096,0.0019554563,0.00046247314,0.000004450056],"category_scores_gemma":[0.00019498564,0.0005386412,0.0005197805,0.00078656006,0.0009231801,0.00028492662,0.00114036,0.0014406601,0.000009424159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015753099,0.0003377038,0.0032660768,0.0002460504,0.0005392161,0.000007724546,0.0037378592,0.7356784,0.00014884307,0.2478473,0.0011532753,0.0068800403],"study_design_scores_gemma":[0.00089408096,0.00049030985,0.006075077,0.00078839733,0.00017263838,0.000013961693,0.00017173465,0.9547855,0.0009981839,0.03438482,0.0006630047,0.0005622769],"about_ca_topic_score_codex":0.00007990817,"about_ca_topic_score_gemma":0.000050683924,"teacher_disagreement_score":0.6511774,"about_ca_system_score_codex":0.00013972598,"about_ca_system_score_gemma":0.0014777321,"threshold_uncertainty_score":0.9997065},"labels":[],"label_agreement":null},{"id":"W4416469310","doi":"10.1038/s41467-025-65198-w","title":"The phase diagram of quantum chromodynamics in one dimension on a quantum computer","year":2025,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; York University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; U.S. Department of Energy; Office of Science; Canada First Research Excellence Fund; National Science Foundation","keywords":"Quantum chromodynamics; Quantum simulator; Quantum computer; Open quantum system; Quantum; Gauge theory; Qubit; Quantum algorithm; Quantum process; QCD matter","score_opus":0.014597144850808366,"score_gpt":0.30489845405209864,"score_spread":0.29030130920129027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416469310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2660781,0.009650219,0.6414648,0.07751943,0.0021594814,0.0011596791,0.000029396635,0.00043023296,0.0015085961],"genre_scores_gemma":[0.9728332,0.00034832288,0.026156263,0.00057578296,0.000025215062,0.000018313103,0.000014842448,0.00000794915,0.000020092219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985138,0.00030879167,0.00039476162,0.00029032,0.00023749833,0.0002548063],"domain_scores_gemma":[0.995281,0.0014253061,0.00015700987,0.0029550602,0.00013971629,0.000041954478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005440478,0.0001598212,0.00023021662,0.00023408113,0.0004714399,0.00009311916,0.0032476124,0.0001785534,3.768545e-7],"category_scores_gemma":[0.00012617593,0.00011931568,0.00009639289,0.0011467255,0.00019234559,0.00007542235,0.0011999385,0.0013149742,0.0000037202972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013508546,0.0007602568,0.00009133375,0.000010534104,0.000026540609,0.0000014941347,0.00031191084,0.0021712182,0.0002743069,0.8881178,0.00074225507,0.10747888],"study_design_scores_gemma":[0.0005831145,0.00014581053,0.003916546,0.0001813808,0.000006222981,0.0000021788705,0.000011418834,0.97439796,0.00013279713,0.014024108,0.0064843125,0.00011416691],"about_ca_topic_score_codex":0.000032638483,"about_ca_topic_score_gemma":0.00014357606,"teacher_disagreement_score":0.97222674,"about_ca_system_score_codex":0.00005838482,"about_ca_system_score_gemma":0.00011235449,"threshold_uncertainty_score":0.60349256},"labels":[],"label_agreement":null},{"id":"W4416513980","doi":"10.1109/vcris68011.2025.11250564","title":"Implementation of the BHT quantum algorithm for finding collisions of a lightweight hash function on IBM “Sherbrooke” via Qiskit","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hash function; Collision resistance; Double hashing; Cryptographic hash function; Secure Hash Algorithm; Realization (probability); Quantum computer; Quantum algorithm; Quantum","score_opus":0.012857220599155426,"score_gpt":0.28193470058781706,"score_spread":0.2690774799886616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416513980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053337958,0.00024749918,0.937884,0.0021897727,0.00424979,0.0015187826,0.00007933347,0.000060582854,0.0004323302],"genre_scores_gemma":[0.93082744,0.000034611,0.06715356,0.00051568233,0.00022667366,0.00006287586,0.000010706494,0.000029550527,0.0011389127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631643,0.00024197406,0.0012955785,0.0008578989,0.0006791851,0.0006089353],"domain_scores_gemma":[0.9968119,0.000809199,0.00077140995,0.0010663854,0.00044378886,0.00009729637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086181104,0.00043864074,0.0006121436,0.00046926618,0.0008708003,0.00015598928,0.0012712219,0.00020118474,0.00007966201],"category_scores_gemma":[0.00005883367,0.00031304,0.00057569024,0.0019594617,0.00017577285,0.00019613568,0.00064409926,0.0003637048,0.0000049993655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056864585,0.00041567607,0.0005755058,0.00028703272,0.00028881984,9.0669204e-7,0.0013429028,0.0058433786,0.0026045924,0.09559723,0.0026039195,0.8903832],"study_design_scores_gemma":[0.001540815,0.0011962529,0.007067279,0.0007289918,0.00016026084,0.0000028830534,0.00025545148,0.9144803,0.057758417,0.013460779,0.003056771,0.00029175536],"about_ca_topic_score_codex":0.00031098945,"about_ca_topic_score_gemma":0.0000963645,"teacher_disagreement_score":0.908637,"about_ca_system_score_codex":0.0001287944,"about_ca_system_score_gemma":0.00050351827,"threshold_uncertainty_score":0.99993217},"labels":[],"label_agreement":null},{"id":"W4416543572","doi":"10.48550/arxiv.2504.12096","title":"Max-Cut graph-driven quantum circuit design for planar spin glasses","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; New Brunswick Innovation Foundation","keywords":"Quantum annealing; Initialization; Qubit; Quantum; Planar; Ground state; Quantum computer; Spin glass; Ising model","score_opus":0.05894555360591409,"score_gpt":0.2841177378363049,"score_spread":0.22517218423039081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416543572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11744916,0.00051828014,0.87551516,0.0012816269,0.0031653263,0.0009977667,0.000082850565,0.0007692657,0.00022056914],"genre_scores_gemma":[0.7590312,0.00020922048,0.23586935,0.001740247,0.0013350092,0.00041644534,0.00012019686,0.00010301011,0.0011753625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619925,0.00022498929,0.00064561557,0.0016700382,0.00040687624,0.0008532259],"domain_scores_gemma":[0.99673706,0.0006597662,0.00039809672,0.0017957038,0.00020520065,0.00020417516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005689834,0.0006708211,0.00077087805,0.00045652897,0.00041453322,0.0003432109,0.0034039896,0.00045187873,0.0000063809457],"category_scores_gemma":[0.0001596424,0.0006369822,0.00050328596,0.0005199874,0.00010812891,0.00013194937,0.0014695134,0.0010227183,0.000044500215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021645211,0.0012170972,0.0583164,0.0049199928,0.0026172253,0.00079983124,0.0075975126,0.5159844,0.0028721238,0.20137788,0.06737672,0.13670437],"study_design_scores_gemma":[0.0007452435,0.00035267093,0.014601238,0.0009799574,0.00009942099,0.000034616383,0.000023949133,0.87059885,0.0017216644,0.10111479,0.008400942,0.0013266737],"about_ca_topic_score_codex":0.00012360654,"about_ca_topic_score_gemma":0.000015349508,"teacher_disagreement_score":0.641582,"about_ca_system_score_codex":0.00011186392,"about_ca_system_score_gemma":0.00072321267,"threshold_uncertainty_score":0.99960816},"labels":[],"label_agreement":null},{"id":"W4416553074","doi":"10.1609/aaaiss.v7i1.36913","title":"LLM-QUBO: An End-to-End Framework for Automated QUBOTransformation from Natural Language Problem Descriptions","year":2025,"lang":"","type":"article","venue":"Proceedings of the AAAI Symposium Series","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Memorial University of Newfoundland; Lakehead University","funders":"","keywords":"Quantum annealing; Workflow; Scalability; Correctness; Quadratic unconstrained binary optimization; Quantum computer; Transformation (genetics); Optimization problem; Decomposition","score_opus":0.0066484821827630216,"score_gpt":0.24999212599082804,"score_spread":0.24334364380806503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416553074","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84789145,0.001223056,0.0960228,0.043181866,0.005170912,0.0034836675,0.00039427567,0.0015772996,0.0010546796],"genre_scores_gemma":[0.75980186,0.000023802902,0.23875207,0.00057186827,0.00027569637,0.00010464837,0.000017150096,0.00003435663,0.00041853773],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968017,0.000046119218,0.00093051634,0.00089481764,0.0005707195,0.0007561512],"domain_scores_gemma":[0.9978418,0.00020112601,0.00051464746,0.0005373531,0.00072614825,0.00017896076],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00056250085,0.0005684871,0.00060760387,0.00033630614,0.0011556254,0.0011867569,0.0026593017,0.0003012864,0.000010817418],"category_scores_gemma":[0.00018806537,0.00045252917,0.00034262938,0.0017225696,0.00030676532,0.0018506689,0.000756128,0.0006812577,0.0000058946116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064014527,0.0008291834,0.0006156936,0.0023147713,0.00061218615,0.0000015895741,0.14542514,0.0063560246,0.4423218,0.34505352,0.0027963289,0.05303362],"study_design_scores_gemma":[0.00069599436,0.00077209424,0.0021920272,0.002642656,0.00024693907,0.000022614498,0.002170718,0.81664234,0.12293839,0.04923398,0.0016833434,0.00075889897],"about_ca_topic_score_codex":0.00025107927,"about_ca_topic_score_gemma":0.00003200028,"teacher_disagreement_score":0.81028634,"about_ca_system_score_codex":0.000120561344,"about_ca_system_score_gemma":0.00024326963,"threshold_uncertainty_score":0.9998501},"labels":[],"label_agreement":null},{"id":"W4416583080","doi":"10.1109/dsaa65442.2025.11247977","title":"Multi-Objective Quantum Power System Redispatch","year":2025,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Quadratic equation; Quantum; Task (project management); Power (physics); Adiabatic process; State (computer science); Binary number; Heuristics; Renewable energy","score_opus":0.006839449372441565,"score_gpt":0.23953518570758572,"score_spread":0.23269573633514415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416583080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02016512,0.00012331526,0.96459895,0.001125107,0.0015784845,0.00015553295,0.0000014238418,0.000843461,0.011408602],"genre_scores_gemma":[0.8772277,9.804429e-7,0.12100863,0.00038014588,0.000035404453,0.0000078692665,4.9375274e-7,0.00000623332,0.0013325411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987198,0.00007606416,0.00021519425,0.0004921768,0.00017772242,0.0003190275],"domain_scores_gemma":[0.9990648,0.0001088997,0.00005086958,0.0006121404,0.000093803894,0.00006950226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024483894,0.00016201055,0.00019095051,0.00015887732,0.00020456979,0.00015611103,0.0008391165,0.00006806561,0.0000050525355],"category_scores_gemma":[0.000031927477,0.00012510204,0.00009102405,0.00063455495,0.00003257332,0.00011385953,0.00043691194,0.00019826757,0.000060902563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010972642,0.0002168919,0.00092762394,0.00010858331,0.00011026446,0.00009559907,0.0019971956,0.0024953021,0.0011692492,0.9508239,0.007520079,0.034524366],"study_design_scores_gemma":[0.00032531627,0.00004560981,0.00538754,0.00009842851,0.0000035261578,0.000018210507,0.00017848842,0.99029803,0.00067740754,0.00097648066,0.0018245985,0.00016638587],"about_ca_topic_score_codex":0.00009752063,"about_ca_topic_score_gemma":0.0000070787755,"teacher_disagreement_score":0.9878027,"about_ca_system_score_codex":0.0000598023,"about_ca_system_score_gemma":0.000092670176,"threshold_uncertainty_score":0.5101513},"labels":[],"label_agreement":null},{"id":"W4416748690","doi":"10.1039/d5dd00377f","title":"Chemically motivated simulation problems are efficiently solvable on a quantum computer","year":2025,"lang":"en","type":"article","venue":"Digital Discovery","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; U.S. Navy; Defense Advanced Research Projects Agency; Canadian Institute for Advanced Research; Novo Nordisk Fonden; King Abdullah University of Science and Technology; U.S. Department of Defense; Carlsbergfondet; National Institute of Advanced Industrial Science and Technology; Advanced Research Projects Agency; Government of Canada; Novo Nordisk","keywords":"Quantum computer; Quantum; Quantum chemical; Scattering; Quantum system; Quantum algorithm; Scheme (mathematics)","score_opus":0.007682632915374906,"score_gpt":0.2239327579977075,"score_spread":0.2162501250823326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416748690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35879016,0.000026406435,0.63805443,0.00046770182,0.00042006673,0.00018680407,0.000016060048,0.0002829907,0.0017554],"genre_scores_gemma":[0.99729705,7.577903e-7,0.0012558309,0.0006444767,0.000081547965,0.0000062424006,0.00002530656,0.00001267536,0.0006761112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838,0.000023961253,0.0002946814,0.0006072893,0.0003080407,0.00038601065],"domain_scores_gemma":[0.9989755,0.00025123687,0.00011708544,0.00051333505,0.00007510421,0.00006771742],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000088341825,0.00024057883,0.00023841059,0.00016729113,0.00015085554,0.0013704319,0.0006640276,0.00007608211,0.0000011299734],"category_scores_gemma":[0.00006298779,0.00019892679,0.00013385668,0.000661068,0.00005271346,0.0007705983,0.00042233514,0.00021693089,0.000040954725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018489729,0.00035653514,0.0005284102,0.000053915766,0.00003402274,0.000014368627,0.00013879013,0.9568819,0.0003317913,0.015804335,0.0009872579,0.024850175],"study_design_scores_gemma":[0.00036608908,0.000115184324,0.0036287776,0.0003140262,0.0000029978148,0.0000021473782,0.0000056450067,0.9873917,0.00059218874,0.005594957,0.0017553669,0.00023093859],"about_ca_topic_score_codex":0.0000038896687,"about_ca_topic_score_gemma":3.3546323e-7,"teacher_disagreement_score":0.6385069,"about_ca_system_score_codex":0.00005212261,"about_ca_system_score_gemma":0.00006402863,"threshold_uncertainty_score":0.9996662},"labels":[],"label_agreement":null},{"id":"W4416749922","doi":"10.1109/access.2025.3638137","title":"Learning Phase-Flip Noise Using Balanced Datasets and Hybrid Models for Noise Classification in Quantum Circuits","year":2025,"lang":"","type":"article","venue":"IEEE Access","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Noise (video); Quantum decoherence; Quantum computer; Reliability (semiconductor); Quantum noise; Quantum; Quantum error correction","score_opus":0.060727120825601485,"score_gpt":0.3510513932258419,"score_spread":0.2903242724002404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416749922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47452417,0.00067353173,0.5224748,0.00032465937,0.0011588634,0.00060210674,0.00014456538,0.000070461974,0.000026805585],"genre_scores_gemma":[0.99543774,0.00020063801,0.0035769888,0.00033133928,0.00024079438,0.000048025213,0.000099289224,0.000036091587,0.000029079096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594605,0.00028610072,0.00090655993,0.001583825,0.00037227923,0.00090520416],"domain_scores_gemma":[0.99771595,0.000523579,0.0004744212,0.00090505515,0.00018709793,0.00019390075],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00096096145,0.00051224296,0.0006573097,0.00065633823,0.00075296464,0.0014854466,0.0018323777,0.00016868462,0.00000267333],"category_scores_gemma":[0.00015940086,0.0005557858,0.000119761215,0.0012763484,0.00016483974,0.0016968297,0.00063395547,0.0007245066,0.0000019973463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071592316,0.00034075166,0.00043038154,0.00034990648,0.000045525972,0.00002737396,0.00071184046,0.49868503,0.009133072,0.0010615598,0.00030162296,0.48884135],"study_design_scores_gemma":[0.0025883454,0.0001542653,0.0011474671,0.0008259459,0.000051912022,0.00002848264,0.000035038844,0.9849861,0.0028573428,0.0061941547,0.0005665657,0.0005643524],"about_ca_topic_score_codex":0.00020640771,"about_ca_topic_score_gemma":0.000015024703,"teacher_disagreement_score":0.5209136,"about_ca_system_score_codex":0.00014312887,"about_ca_system_score_gemma":0.00042654248,"threshold_uncertainty_score":0.99968934},"labels":[],"label_agreement":null},{"id":"W4416756291","doi":"10.1109/access.2025.3632196","title":"Simulation of Quantum Discrete Cosine Transform for Grayscale Image Compression Using Qiskit","year":2025,"lang":"en","type":"article","venue":"IEEE Access","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Algoma University","funders":"Algoma University","keywords":"Discrete cosine transform; Quantum Fourier transform; Transform coding; Quantization (signal processing); Image compression; Data compression; Trigonometric functions; Quantum phase estimation algorithm; Grayscale","score_opus":0.026111845406518706,"score_gpt":0.3508321942757549,"score_spread":0.3247203488692362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416756291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14602017,0.000056360648,0.8525484,0.00037066243,0.00051938824,0.00030267556,0.000014716212,0.000078903875,0.00008869829],"genre_scores_gemma":[0.96325564,0.0000025282172,0.03654605,0.000084716754,0.00006796645,0.000006489636,0.0000047063795,0.000008702174,0.000023187302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989469,0.00003591641,0.0003097299,0.00030770406,0.00017120542,0.00022853739],"domain_scores_gemma":[0.99895424,0.00040315572,0.00012627714,0.00034166116,0.00013309154,0.00004158348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015439138,0.00013959926,0.00022929689,0.00015137551,0.00019536832,0.0001629425,0.0008640053,0.00005704655,0.0000017506484],"category_scores_gemma":[0.00003204359,0.00011594044,0.00011081549,0.0004424018,0.000053387655,0.00047722633,0.00012411103,0.00009867305,4.1230643e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037754402,0.000067373294,0.00012433645,0.0002305739,0.000021030555,0.000001556816,0.00026701097,0.94775784,0.010081362,0.0020893367,0.00015744305,0.03916441],"study_design_scores_gemma":[0.0005006434,0.000043026863,0.00048176167,0.00026336065,0.0000126971045,8.737908e-7,0.0000042191873,0.9445097,0.039575532,0.014170659,0.000314025,0.00012351217],"about_ca_topic_score_codex":0.000056660585,"about_ca_topic_score_gemma":0.000004158845,"teacher_disagreement_score":0.81723547,"about_ca_system_score_codex":0.00002337626,"about_ca_system_score_gemma":0.00006724576,"threshold_uncertainty_score":0.4727914},"labels":[],"label_agreement":null},{"id":"W4416767288","doi":"10.1145/3778031","title":"Understanding and Estimating the Execution Time of Quantum Circuits","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Quantum computer; Quantum circuit; Quantum; Quantum algorithm; Qubit; Quantum information; Provisioning; Benchmark (surveying); Quantum network","score_opus":0.08260533931163938,"score_gpt":0.2945200368030502,"score_spread":0.21191469749141084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416767288","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020542618,0.00019670023,0.9781075,0.0005032309,0.00041908823,0.00006675733,0.0000017620325,0.00015775865,0.000004571682],"genre_scores_gemma":[0.34832773,0.000013903221,0.65155476,0.00006140706,0.000013179733,0.0000045277184,2.860904e-7,0.000005028523,0.000019190898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929786,0.0001247247,0.00015086637,0.00021381161,0.00006348124,0.00014928605],"domain_scores_gemma":[0.99700403,0.0026263506,0.000037455786,0.00028318944,0.000018976347,0.000029973653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061805104,0.00010372145,0.00017042691,0.00016011781,0.00018915022,0.00002768699,0.00022650592,0.00006421675,0.0000010114849],"category_scores_gemma":[0.00044032646,0.00008172932,0.000034336765,0.00027240627,0.000056660858,0.00005057524,0.000025705338,0.0002182064,3.2555337e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007681291,0.000030248722,0.00005816505,0.00017191691,0.00011733169,0.0000037118054,0.002380411,0.6005945,0.0024438605,0.035763174,0.000023873195,0.3584051],"study_design_scores_gemma":[0.0001584486,0.00006602894,0.0006273415,0.00010177332,0.00002050364,0.000044966666,0.00003810888,0.9859431,0.0008863896,0.011963837,0.0000615834,0.000087961955],"about_ca_topic_score_codex":0.000009581755,"about_ca_topic_score_gemma":3.2893612e-7,"teacher_disagreement_score":0.38534853,"about_ca_system_score_codex":0.000017360997,"about_ca_system_score_gemma":0.000020908954,"threshold_uncertainty_score":0.33328247},"labels":[],"label_agreement":null},{"id":"W4416800174","doi":"10.1109/snpd65828.2025.11253302","title":"Quantum-Enhanced Data Analytics For Crime Prediction","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University","funders":"","keywords":"Data analysis; Analytics; Big data; Crime analysis; Data collection","score_opus":0.04032084472561838,"score_gpt":0.3039430422227111,"score_spread":0.26362219749709276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416800174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021416673,0.00076102617,0.98257285,0.0037899213,0.005636965,0.0007627456,0.0002914584,0.0003814105,0.0036619462],"genre_scores_gemma":[0.77444005,0.00016740515,0.21400063,0.001586281,0.0010525644,0.000021771491,0.0001839089,0.000036244783,0.008511127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960445,0.000114180155,0.00085566385,0.0017786715,0.00040099744,0.0008059997],"domain_scores_gemma":[0.9952509,0.0005667884,0.00021977919,0.0034308028,0.00035409458,0.00017765208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010502518,0.00043129647,0.0005086688,0.00035980888,0.0007150049,0.0007486821,0.003975658,0.00022311519,0.000032539872],"category_scores_gemma":[0.00039009412,0.00039684266,0.00019044198,0.0014115055,0.0001444838,0.00053314364,0.0025487477,0.00041604158,0.000026492842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008359131,0.0005033466,0.00006839783,0.00048186423,0.00045649332,0.0000060357893,0.0005347447,0.024449624,0.0010269714,0.19526315,0.07406092,0.70306486],"study_design_scores_gemma":[0.0008758823,0.0002952147,0.0008432046,0.00026464777,0.00013859502,0.0000048383995,0.00004176223,0.95592767,0.0015344818,0.015714027,0.024016019,0.00034365547],"about_ca_topic_score_codex":0.00004638117,"about_ca_topic_score_gemma":0.000009227416,"teacher_disagreement_score":0.931478,"about_ca_system_score_codex":0.00006752617,"about_ca_system_score_gemma":0.0006520116,"threshold_uncertainty_score":0.99984837},"labels":[],"label_agreement":null},{"id":"W4416833769","doi":"10.1093/scipol/scaf065","title":"Public policy considerations of quantum computing","year":2025,"lang":"en","type":"article","venue":"Science and Public Policy","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Government of Canada; Australian Government; National Science Foundation","keywords":"Operationalization; Public policy; Quantum computer; Identification (biology); Quantum; Quantum information science; Focus (optics)","score_opus":0.02764734768259585,"score_gpt":0.2980936164366661,"score_spread":0.27044626875407024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416833769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28094184,0.0005590548,0.397726,0.28588602,0.0008875097,0.00038949557,0.000015402224,0.00050998223,0.033084683],"genre_scores_gemma":[0.9859588,0.000016939897,0.010153133,0.0036057208,0.00018817569,0.000002522047,6.669928e-7,0.000004260894,0.00006978137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977061,0.00008553064,0.000362806,0.0005516627,0.0005237469,0.0007701539],"domain_scores_gemma":[0.9980354,0.00029216177,0.00014804349,0.00064598006,0.0005936073,0.00028482848],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014265438,0.0001668831,0.00023541965,0.0020874564,0.001130596,0.0010451609,0.0012001127,0.000056427663,0.0000030506992],"category_scores_gemma":[0.0030435084,0.00014444029,0.000053791442,0.006363413,0.001230441,0.00085078576,0.0010661877,0.00019947177,0.000004100562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3642912e-7,0.000034878645,0.0005669457,0.000012716469,0.0000061225746,0.0000010918407,0.00038685717,0.000057796762,0.0004704324,0.91071767,0.00046430412,0.08728093],"study_design_scores_gemma":[0.00033592724,0.0000729835,0.013111155,0.000047580033,0.000002763898,0.00006615625,0.0000786941,0.7038132,0.00064430817,0.27487418,0.006707321,0.00024572873],"about_ca_topic_score_codex":0.0010566353,"about_ca_topic_score_gemma":0.000017313376,"teacher_disagreement_score":0.705017,"about_ca_system_score_codex":0.00009120184,"about_ca_system_score_gemma":0.0075109666,"threshold_uncertainty_score":0.99999183},"labels":[{"model":"gemma","categories":["sts"],"domain":null,"study_design":"theoretical_or_conceptual","genre":"review","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"commentary","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"}],"label_agreement":"split"},{"id":"W4416865707","doi":"10.1007/978-3-031-90727-2_18","title":"Global Quantum Strategies","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum; Order (exchange); Aggregate (composite); Generative grammar; Quantum state","score_opus":0.009816747537308292,"score_gpt":0.2384452253457335,"score_spread":0.2286284778084252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416865707","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017782744,0.0003412361,0.4120176,0.0005216323,0.00068454875,0.00007100292,0.000010143261,0.00041152167,0.58594054],"genre_scores_gemma":[0.0018825117,0.00006113442,0.060488205,0.00094656216,0.0003811157,0.000002871137,0.000012905404,0.000020354413,0.9362043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998423,0.000012651717,0.00028068566,0.0006621473,0.00031968235,0.0003018584],"domain_scores_gemma":[0.99881095,0.000066003886,0.000110972025,0.0008430219,0.00008078356,0.000088283516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000097839154,0.00038007984,0.00034822777,0.00010722728,0.00012702848,0.0004513341,0.0014626205,0.0002539076,0.00007666343],"category_scores_gemma":[0.000006064046,0.00031531428,0.00020396581,0.00008687948,0.00006223924,0.00012420077,0.0007406803,0.00030356453,0.00011672838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.6896043e-7,0.000004832856,6.005805e-7,0.000022116432,0.000031081607,0.00003853831,0.000015324975,0.000480944,1.7591152e-7,0.92081225,0.015496353,0.06309699],"study_design_scores_gemma":[0.00007391724,0.000048315633,0.000014558163,0.00012541197,0.000008813113,0.000025330835,0.000002780517,0.15234034,9.556435e-7,0.6105086,0.23652981,0.00032114776],"about_ca_topic_score_codex":0.00003455122,"about_ca_topic_score_gemma":0.000022764367,"teacher_disagreement_score":0.35152942,"about_ca_system_score_codex":0.00005388208,"about_ca_system_score_gemma":0.00045802564,"threshold_uncertainty_score":0.9999299},"labels":[],"label_agreement":null},{"id":"W4416873680","doi":"10.1109/qce65121.2025.00049","title":"Is Circuit Depth Accurate for Comparing Quantum Circuit Runtimes?","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Software portability; Task (project management); Quantum circuit; Electronic circuit; Logic gate; IBM; Circuit design; Integrated circuit","score_opus":0.04826562692861944,"score_gpt":0.2956839179681668,"score_spread":0.24741829103954735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416873680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017799206,0.0015576195,0.9479026,0.0039325287,0.0052870815,0.0012903603,0.00002502092,0.0005619893,0.021643544],"genre_scores_gemma":[0.9763501,0.000057572513,0.011054543,0.0046112477,0.0005023946,0.000056212077,0.0000094640955,0.000056935365,0.007301483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99359334,0.00019063911,0.001432735,0.0022738753,0.0006050077,0.0019043875],"domain_scores_gemma":[0.99579674,0.0008477517,0.0004891087,0.0020046511,0.00047761376,0.0003841198],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011337304,0.00094306,0.0012482292,0.00066200976,0.0015337644,0.0019924478,0.0035832159,0.00036351653,0.00013109902],"category_scores_gemma":[0.00017171892,0.0009198346,0.0007847108,0.002119347,0.00024954698,0.0005236174,0.0015590857,0.00086212123,0.00018468303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041282387,0.0004909084,0.0025843366,0.0007987024,0.00063150574,0.00002992251,0.0035614586,0.009289069,0.00041114658,0.54491735,0.022827355,0.41441694],"study_design_scores_gemma":[0.0016344418,0.00022843867,0.0042110756,0.00058879604,0.000113619324,0.000027325059,0.00009088897,0.9056997,0.0013988297,0.06640644,0.018645162,0.0009553033],"about_ca_topic_score_codex":0.00018178088,"about_ca_topic_score_gemma":0.000034031953,"teacher_disagreement_score":0.95855093,"about_ca_system_score_codex":0.00016287538,"about_ca_system_score_gemma":0.0008431498,"threshold_uncertainty_score":0.9997661},"labels":[],"label_agreement":null},{"id":"W4416874118","doi":"10.1109/qce65121.2025.00018","title":"SCOOP: A Quantum-Computing Framework for Constrained Combinatorial Optimization","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"SCOOP; Quadratic unconstrained binary optimization; Optimization problem; Set (abstract data type); Set cover problem; Constrained optimization; Combinatorial optimization; Cover (algebra); Quadratic programming","score_opus":0.010892226274906523,"score_gpt":0.27604979432844196,"score_spread":0.2651575680535354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416874118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014093776,0.00052367005,0.9687246,0.0062990403,0.019221477,0.0014172234,0.000017758639,0.0005886542,0.001798169],"genre_scores_gemma":[0.35005167,0.000017485901,0.6475914,0.0011549847,0.0009178463,0.000014913477,0.000010001174,0.00003069445,0.00021099996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525356,0.00026757974,0.0012018504,0.0015644574,0.00047944774,0.0012331258],"domain_scores_gemma":[0.9951896,0.0024037063,0.0004576063,0.0010815578,0.0006133376,0.00025417062],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012318295,0.00068595307,0.0008419369,0.0004889335,0.0014154534,0.0013351693,0.0017784266,0.0005700697,0.00005783677],"category_scores_gemma":[0.001138366,0.00068582245,0.00045912046,0.0021552632,0.0003311403,0.00026303576,0.0009045343,0.0008335996,0.000012625501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044683053,0.00018267591,0.000018899418,0.00014713051,0.00009958725,0.00000484775,0.0005124048,0.30171096,0.000010457786,0.6190477,0.000507571,0.0777131],"study_design_scores_gemma":[0.0018756127,0.00036881893,0.000026598625,0.0009699079,0.00005964708,0.0000110303345,0.00007438497,0.7919627,0.00020313481,0.20287926,0.0010121263,0.0005567663],"about_ca_topic_score_codex":0.00003376651,"about_ca_topic_score_gemma":8.367981e-7,"teacher_disagreement_score":0.49025175,"about_ca_system_score_codex":0.00010979752,"about_ca_system_score_gemma":0.0009904954,"threshold_uncertainty_score":0.99988455},"labels":[],"label_agreement":null},{"id":"W4416874368","doi":"10.1109/qce65121.2025.10351","title":"Analyzing Common Electronic Structure Theory Algorithms for Distributed Quantum Computing","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unitary state; Quantum computer; Electronic structure; Quantum; Key (lock); Quantum algorithm; Separable space; Quantum phase estimation algorithm","score_opus":0.008626008114694992,"score_gpt":0.27084640332589754,"score_spread":0.26222039521120255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416874368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039761133,0.004118802,0.94722706,0.0034005027,0.0031974225,0.0012209943,0.0002478505,0.00062938,0.00019685355],"genre_scores_gemma":[0.95814294,0.000054260232,0.039200768,0.0012158669,0.00064007094,0.00001146323,0.00016087001,0.00006220192,0.00051159196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923641,0.00072922837,0.0015209455,0.0021395537,0.0005088594,0.0027373335],"domain_scores_gemma":[0.99466556,0.0022249988,0.0006081153,0.0017174274,0.00047250293,0.0003113807],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020971568,0.001107597,0.0013582791,0.0006472821,0.0021764147,0.0013492134,0.0031849472,0.0005158563,0.000051540046],"category_scores_gemma":[0.00027118338,0.0010091248,0.0007488132,0.0030288289,0.00033329334,0.0004258487,0.001613323,0.0017072422,0.000007966989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064896274,0.00015451587,0.0003045329,0.0002373461,0.00048955024,0.000010942291,0.0005281321,0.03793382,0.00021480976,0.5173019,0.001147902,0.44161162],"study_design_scores_gemma":[0.001312199,0.00035402912,0.000814963,0.0003775091,0.00016771423,0.000031859,0.00010331725,0.7608551,0.0010505898,0.22892489,0.005192314,0.0008155254],"about_ca_topic_score_codex":0.00008805042,"about_ca_topic_score_gemma":0.000046495545,"teacher_disagreement_score":0.91838175,"about_ca_system_score_codex":0.00040060087,"about_ca_system_score_gemma":0.0010017017,"threshold_uncertainty_score":0.9996875},"labels":[],"label_agreement":null},{"id":"W4416874429","doi":"10.1109/qce65121.2025.20538","title":"Entanglement Swapping with Misty States","year":2025,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Health Care Foundation","funders":"","keywords":"Superdense coding; Quantum entanglement; Teleportation; Formalism (music); Quantum teleportation; Quantum; Quantum computer","score_opus":0.0037347802699142525,"score_gpt":0.21550067497039382,"score_spread":0.21176589470047957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416874429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026193978,0.00006643979,0.95722896,0.0036410724,0.00013485538,0.000072851646,4.0353532e-7,0.00023304635,0.012428399],"genre_scores_gemma":[0.5768012,0.0000070781493,0.4150387,0.0030524365,0.00004219348,0.000008970374,0.0000024795768,0.0000058441938,0.0050410945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935085,0.000017236185,0.000095664866,0.00023463127,0.000118310716,0.00018328731],"domain_scores_gemma":[0.99959534,0.000044583325,0.000021895014,0.00027469223,0.000029482582,0.00003403224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009485675,0.000082294784,0.00007714723,0.00006262869,0.00011200764,0.00011846299,0.00038428872,0.0000125257675,0.000016665079],"category_scores_gemma":[0.0000030334654,0.000054057535,0.000021706664,0.0003021499,0.00001839836,0.00005579753,0.00017834184,0.00007009591,0.000010561753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014699976,0.00022384114,0.0032270807,0.00009228846,0.00016843142,0.00008483543,0.0021500133,0.01935852,0.0005714228,0.31531814,0.0188519,0.63993883],"study_design_scores_gemma":[0.00045180664,0.000110813846,0.0021227787,0.00009465796,0.0000047937,0.000011070709,0.00008403737,0.9252605,0.0034993028,0.009620378,0.058532845,0.00020705195],"about_ca_topic_score_codex":0.000032486954,"about_ca_topic_score_gemma":0.000010232321,"teacher_disagreement_score":0.90590197,"about_ca_system_score_codex":0.000017173377,"about_ca_system_score_gemma":0.000042492808,"threshold_uncertainty_score":0.22044022},"labels":[],"label_agreement":null},{"id":"W4416874692","doi":"10.1109/qce65121.2025.20537","title":"Hadamard Eigenvectors with Misty States","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Health Care Foundation","funders":"","keywords":"Formalism (music); Hadamard transform; Rewriting; Quantum; Algebra over a field; Quantum gate","score_opus":0.004575206224380347,"score_gpt":0.21744629478397098,"score_spread":0.21287108855959064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416874692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09675051,0.001459839,0.8763008,0.010267323,0.0015840286,0.00032917704,0.0000072252587,0.00038828197,0.012912784],"genre_scores_gemma":[0.85391253,0.00015693135,0.11732503,0.0045880736,0.00022849985,0.000010029379,0.0000058856544,0.00003180389,0.023741229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969316,0.00015640366,0.000463412,0.0011220172,0.0004697499,0.0008568293],"domain_scores_gemma":[0.9980573,0.0002571399,0.00013383054,0.0011185537,0.00020628977,0.00022685902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036517272,0.00049904146,0.00045361638,0.00027511487,0.0005915153,0.00077181385,0.0014155931,0.00012320602,0.00013869691],"category_scores_gemma":[0.000026616515,0.0003541464,0.00015356437,0.0016770338,0.0002718064,0.00023658972,0.00068948895,0.0005126993,0.00006224187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086079155,0.00041384707,0.005049564,0.00026728676,0.0004939602,0.00018771704,0.0021848192,0.05989393,0.000099451594,0.066924974,0.015166505,0.84923184],"study_design_scores_gemma":[0.000642687,0.00038721805,0.006794429,0.00039417628,0.000039045895,0.000025514202,0.000080481805,0.9469013,0.001726059,0.0041219112,0.038352247,0.00053491234],"about_ca_topic_score_codex":0.00036993928,"about_ca_topic_score_gemma":0.00005872541,"teacher_disagreement_score":0.8870074,"about_ca_system_score_codex":0.00006783456,"about_ca_system_score_gemma":0.0005763867,"threshold_uncertainty_score":0.99989104},"labels":[],"label_agreement":null},{"id":"W4416874702","doi":"10.1109/qce65121.2025.00094","title":"Productive Quantum Programming Needs Better Abstract Machines","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Triad National Security; Los Alamos National Laboratory; Natural Sciences and Engineering Research Council of Canada; University of British Columbia; National Centre for Supercomputing Applications; Business Finland; U.S. Department of Energy","keywords":"Hierarchy; Abstraction; Set (abstract data type); Variety (cybernetics); Parallels; Field (mathematics); Representation (politics)","score_opus":0.009736423662542116,"score_gpt":0.2548345314409566,"score_spread":0.24509810777841445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416874702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3101693,0.002295659,0.6272376,0.037794236,0.00885225,0.001497813,0.000008444692,0.0010192894,0.011125343],"genre_scores_gemma":[0.90421903,0.00002123261,0.08588057,0.0021978922,0.0011126613,0.000034657085,0.0000049614164,0.0000395341,0.0064894827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564016,0.00015371539,0.00089944404,0.0014499892,0.0005843866,0.0012723064],"domain_scores_gemma":[0.9974818,0.00025340432,0.00028125048,0.0014533428,0.0003111155,0.00021908797],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008291337,0.0007432525,0.0006445695,0.00085446413,0.0008444266,0.0013809215,0.0019661412,0.00023886349,0.00010393045],"category_scores_gemma":[0.0001361377,0.00061444734,0.00036230992,0.0030910894,0.0003164994,0.0005090764,0.0012933938,0.0011363736,0.00012087326],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019103214,0.00036908034,0.0011686505,0.00021775553,0.00018180096,0.000041087234,0.0023573264,0.0013719313,0.00023614439,0.030214263,0.0018958366,0.961927],"study_design_scores_gemma":[0.00058393204,0.00025923658,0.014717884,0.00051944284,0.000063681815,0.000048270245,0.00016694532,0.92550313,0.0011297617,0.014207287,0.04192541,0.0008750396],"about_ca_topic_score_codex":0.0002091824,"about_ca_topic_score_gemma":0.000009331694,"teacher_disagreement_score":0.961052,"about_ca_system_score_codex":0.00007994831,"about_ca_system_score_gemma":0.00041243486,"threshold_uncertainty_score":0.9996557},"labels":[],"label_agreement":null},{"id":"W4416874784","doi":"10.1109/qce65121.2025.10377","title":"Detailed Implementation of Quantum Toom-Cook Multiplication Circuits and Resource Estimation","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Overhead (engineering); Recursion (computer science); Multiplication (music); Electronic circuit; Modular design; Qubit; Adder; Quantum; Limiting","score_opus":0.010366260807810775,"score_gpt":0.28144626855718813,"score_spread":0.27108000774937735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416874784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29767948,0.0004145928,0.6989581,0.0017211298,0.0001993646,0.0004903605,0.000005715531,0.000081763406,0.0004494743],"genre_scores_gemma":[0.9736818,0.000036732534,0.025697991,0.00027771978,0.00003974506,0.00001592459,0.0000134375105,0.000010556166,0.00022609765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975321,0.00019586473,0.00083967444,0.00073963864,0.0003329675,0.00035972372],"domain_scores_gemma":[0.99833584,0.00030897756,0.00041076983,0.0006479287,0.00020224057,0.00009422905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006440521,0.00027814042,0.0003471862,0.0003606146,0.00033920203,0.00023035325,0.00050109666,0.00012607592,0.000026718575],"category_scores_gemma":[0.00007571277,0.0002740307,0.00008867236,0.00090487406,0.00013022125,0.00030358246,0.00039897868,0.00020295392,0.000006329408],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006959995,0.000073018404,0.0024574006,0.00018962183,0.000048065962,9.4067923e-7,0.001976863,0.007896695,0.0017251883,0.047868572,0.0002542252,0.93750244],"study_design_scores_gemma":[0.0009210374,0.00015109857,0.07574062,0.0001822616,0.00004334579,0.0000072905,0.00026483097,0.90948075,0.007992493,0.0045863106,0.00041003758,0.00021995012],"about_ca_topic_score_codex":0.00016336818,"about_ca_topic_score_gemma":0.000048790404,"teacher_disagreement_score":0.9372825,"about_ca_system_score_codex":0.000056622994,"about_ca_system_score_gemma":0.00021188562,"threshold_uncertainty_score":0.9999712},"labels":[],"label_agreement":null},{"id":"W4416874790","doi":"10.1109/qce65121.2025.00089","title":"Self-Adaptive Quantum and Classical Software Systems","year":2025,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"European Commission","keywords":"Software; Quantum computer; Realization (probability); Software system; Adaptation (eye); Autonomic computing; Complement (music); Quantum","score_opus":0.007384694114157119,"score_gpt":0.22219864305570694,"score_spread":0.21481394894154981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416874790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071366397,0.0005279848,0.9875104,0.0013825926,0.00065130956,0.00012438242,8.7343614e-7,0.0007130562,0.0019527702],"genre_scores_gemma":[0.65182114,0.000014487917,0.3461755,0.00055641826,0.00010439108,0.000010594331,5.2851414e-7,0.000007857131,0.001309129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990433,0.00006229749,0.00015087682,0.00037543577,0.00013935819,0.00022876283],"domain_scores_gemma":[0.99932915,0.00020816721,0.000032092437,0.0003079869,0.00004819437,0.000074402604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014867284,0.00012536507,0.00016271813,0.00009506396,0.00016587506,0.00022446587,0.0004054416,0.000060434784,8.99713e-7],"category_scores_gemma":[0.000023162549,0.00009455542,0.000035832196,0.00030309768,0.00003555661,0.00009783221,0.0003912732,0.000166565,0.000010633524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030284646,0.00005462127,0.0002459821,0.000052943516,0.000040439252,0.000020157944,0.0003045565,0.00061788573,0.000011315449,0.9476998,0.003159953,0.047789343],"study_design_scores_gemma":[0.00016482479,0.0000645412,0.0009606864,0.00004215543,0.0000044499825,0.000021959977,0.000027271948,0.9801426,0.000027330896,0.0073571806,0.011066408,0.00012059259],"about_ca_topic_score_codex":0.000023545805,"about_ca_topic_score_gemma":0.0000017698843,"teacher_disagreement_score":0.97952473,"about_ca_system_score_codex":0.000020028514,"about_ca_system_score_gemma":0.00007201228,"threshold_uncertainty_score":0.3855858},"labels":[],"label_agreement":null},{"id":"W4416874888","doi":"10.1109/qce65121.2025.20552","title":"Building a Professional Master's Program in Quantum Computing: Bridging Academic, Training and Industry Needs","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary","funders":"","keywords":"General partnership; Presentation (obstetrics); Bridging (networking); Government (linguistics); Quantum; Professional development; Engineering education","score_opus":0.03210721520788983,"score_gpt":0.3206546434926344,"score_spread":0.28854742828474456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416874888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74052554,0.0012407716,0.24589062,0.008016663,0.00247538,0.0008726743,0.0000022929564,0.0004194843,0.00055658416],"genre_scores_gemma":[0.91845256,0.00001953309,0.07895144,0.0014086032,0.00045957637,0.000021250346,0.0000016093055,0.00003400762,0.0006513884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942662,0.00047140595,0.0014126523,0.0014678201,0.00062915083,0.0017527499],"domain_scores_gemma":[0.99794424,0.0006018216,0.0003821371,0.0005763884,0.00010880705,0.00038663213],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020282282,0.0007574246,0.00091582973,0.0016024173,0.0007773842,0.00078933255,0.0015237739,0.001131401,0.000014399153],"category_scores_gemma":[0.00018185767,0.00072381867,0.00015403688,0.0037640552,0.00036917964,0.0004708812,0.003016593,0.0063026394,0.00000322714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018538358,0.00021413913,0.0109418,0.00023430005,0.000053166208,0.000065833105,0.009422369,0.008001854,0.00023198899,0.058276728,0.00019820551,0.91234106],"study_design_scores_gemma":[0.0012973932,0.00020028616,0.018199002,0.0048987796,0.000021902086,0.00010780668,0.001502211,0.9652427,0.00014648621,0.005835178,0.0018334201,0.00071483845],"about_ca_topic_score_codex":0.00008360922,"about_ca_topic_score_gemma":0.0000053979816,"teacher_disagreement_score":0.9572408,"about_ca_system_score_codex":0.000123547,"about_ca_system_score_gemma":0.0008884714,"threshold_uncertainty_score":0.9995213},"labels":[],"label_agreement":null},{"id":"W4416874907","doi":"10.1109/qce65121.2025.10343","title":"Direct Entanglement Ansatz Learning (DEAL) with ZNE on Error-Prone Superconducting Qubits","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Ansatz; Quantum entanglement; Quantum computer; Qubit; Quantum; Quantum algorithm; Optimization problem; Randomness; Scaling","score_opus":0.01615975613472841,"score_gpt":0.2558839880557322,"score_spread":0.23972423192100378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416874907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72138,0.0009966448,0.22576068,0.008720555,0.0016865309,0.000928397,0.000004140952,0.0008444067,0.039678663],"genre_scores_gemma":[0.939829,0.000038089885,0.047101576,0.0013048849,0.00032547026,0.000016260787,0.0000058264463,0.00004750924,0.011331384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449587,0.0005345695,0.00078845484,0.001908865,0.0009039417,0.0013683072],"domain_scores_gemma":[0.99774283,0.00049564824,0.00024083152,0.0010105844,0.00022603017,0.00028407242],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011638468,0.0008005398,0.00076483603,0.0005212592,0.0014660509,0.0007557063,0.0013016028,0.00018107619,0.00019117915],"category_scores_gemma":[0.00007188023,0.0006295005,0.00020840956,0.0019586205,0.00020354784,0.00035245466,0.0009083216,0.001427592,0.00008257076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012103438,0.00064913434,0.0042568576,0.00027861516,0.00046288088,0.00023918583,0.007420035,0.18465811,0.0018876392,0.017469924,0.00070272794,0.78185385],"study_design_scores_gemma":[0.0020754077,0.002797479,0.0024204017,0.0021962489,0.00010274101,0.00007094046,0.0016620104,0.9517534,0.018042844,0.0002877565,0.017295677,0.0012950926],"about_ca_topic_score_codex":0.00059743505,"about_ca_topic_score_gemma":0.00019514821,"teacher_disagreement_score":0.78055876,"about_ca_system_score_codex":0.00022152545,"about_ca_system_score_gemma":0.0005625429,"threshold_uncertainty_score":0.9998339},"labels":[],"label_agreement":null},{"id":"W4416874978","doi":"10.1109/qce65121.2025.20539","title":"Entanglement Swapping with ZX Calculus","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Health Care Foundation","funders":"","keywords":"Quantum entanglement; Teleportation; Calculus (dental); Quantum teleportation; Algebra over a field; Patient privacy","score_opus":0.0062202218373044816,"score_gpt":0.23397778730408333,"score_spread":0.22775756546677886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416874978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012811896,0.0008307527,0.935645,0.009113113,0.0014572918,0.0003782548,0.000002329744,0.0002539978,0.039507374],"genre_scores_gemma":[0.86967176,0.00003712587,0.10795687,0.0042110523,0.00024226561,0.000015971165,0.0000020804239,0.00002016491,0.017842712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970795,0.00011706755,0.0004770113,0.0010067695,0.00049291085,0.000826766],"domain_scores_gemma":[0.9984642,0.00011998749,0.0001255872,0.00096678245,0.00014158948,0.00018182333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003866375,0.00041347806,0.00037451135,0.00027659768,0.00058304024,0.0006275578,0.0012275807,0.000093935705,0.00020505705],"category_scores_gemma":[0.00001637986,0.0003090157,0.000134376,0.0015034712,0.00013971914,0.00016073346,0.0010504419,0.00042959393,0.000088642024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029763503,0.0003367029,0.00054437364,0.00016640803,0.0003110128,0.0001767295,0.0019948857,0.013339781,0.00016248104,0.13464412,0.005649536,0.8426442],"study_design_scores_gemma":[0.00090946123,0.00033228248,0.00093015033,0.000597088,0.00004053008,0.00003595127,0.00013483402,0.9564828,0.0015057366,0.0010579163,0.037526947,0.00044627304],"about_ca_topic_score_codex":0.00016853963,"about_ca_topic_score_gemma":0.000045812725,"teacher_disagreement_score":0.94314307,"about_ca_system_score_codex":0.0001139487,"about_ca_system_score_gemma":0.00043995786,"threshold_uncertainty_score":0.9999362},"labels":[],"label_agreement":null},{"id":"W4416874995","doi":"10.1109/qce65121.2025.00263","title":"CHSH Violations Using Dynamic Circuits","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval; Concordia University","funders":"","keywords":"Controlled NOT gate; Electronic circuit; Unitary state; Quantum entanglement; Quantum computer; Quantum circuit; Qubit; Scalability; Feed forward","score_opus":0.013195632196708744,"score_gpt":0.27848233258548666,"score_spread":0.26528670038877794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416874995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0762111,0.0009255827,0.9087991,0.002040086,0.0030889912,0.00025618248,0.00000524349,0.000256707,0.00841696],"genre_scores_gemma":[0.9404826,0.000023466015,0.055208106,0.00089046644,0.00010867013,0.000002196545,0.0000018516002,0.000014263301,0.0032683702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974171,0.00014402157,0.0005550326,0.0008967186,0.00030219517,0.0006849313],"domain_scores_gemma":[0.9983798,0.0001884419,0.00013973554,0.00097606855,0.00017131078,0.00014459272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033943995,0.0003496142,0.00034306172,0.0004640642,0.00095185085,0.0006560628,0.0012114311,0.00016722849,0.00008439625],"category_scores_gemma":[0.00005929296,0.00034351033,0.00020917322,0.0021687308,0.00012263516,0.00026000084,0.000845229,0.00048608062,0.00005643888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017060771,0.00019607048,0.00062535115,0.00009202888,0.00012414988,0.00002492141,0.0008872878,0.14598292,0.00140511,0.058335442,0.00028499556,0.79204005],"study_design_scores_gemma":[0.00029388693,0.00003884619,0.0040308926,0.00031890193,0.000036292175,0.000029392088,0.000023661263,0.9857292,0.0001557257,0.007595508,0.0013973186,0.0003503765],"about_ca_topic_score_codex":0.000102808044,"about_ca_topic_score_gemma":0.000022014165,"teacher_disagreement_score":0.8642715,"about_ca_system_score_codex":0.000139505,"about_ca_system_score_gemma":0.0006245473,"threshold_uncertainty_score":0.9999017},"labels":[],"label_agreement":null},{"id":"W4416875275","doi":"10.1109/qce65121.2025.20548","title":"No Physics Required ! a Visual-Based Introduction to GKP Qubits for Computer Scientists","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum computer; Qubit; Focus (optics); Quantum; Session (web analytics); Error detection and correction; Quantum error correction","score_opus":0.010346598221045604,"score_gpt":0.280892524647,"score_spread":0.2705459264259544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416875275","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006145864,0.00006619171,0.9550158,0.018367492,0.018071761,0.0015210895,0.000017461733,0.0004065731,0.0003877966],"genre_scores_gemma":[0.0937232,0.0000025236463,0.876053,0.008893303,0.011214137,0.00009015486,0.000031633037,0.000053519987,0.00993858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948309,0.0001935853,0.0008300913,0.0023014452,0.0006450294,0.001198916],"domain_scores_gemma":[0.996644,0.0003508387,0.00023591853,0.0013106121,0.0011107393,0.00034787747],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010251332,0.00062343356,0.0006655575,0.0005339505,0.0010785152,0.0014243283,0.0015334019,0.00018441284,0.000030638013],"category_scores_gemma":[0.00017900774,0.00060442626,0.0004057498,0.0032346107,0.00020513912,0.00035201135,0.0010165012,0.00034383225,0.00024531235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013383848,0.00071259914,0.00002827126,0.00037548784,0.00009447526,0.000006244101,0.0003814178,0.17954467,0.0023133946,0.025813194,0.09896002,0.6916364],"study_design_scores_gemma":[0.0012399404,0.0010391738,0.00020955417,0.0003147685,0.00003703935,0.0000046859027,0.000003616191,0.90364164,0.0057460046,0.0017192861,0.08544171,0.00060257874],"about_ca_topic_score_codex":0.00004244949,"about_ca_topic_score_gemma":0.000009682186,"teacher_disagreement_score":0.72409695,"about_ca_system_score_codex":0.00018964172,"about_ca_system_score_gemma":0.00073437643,"threshold_uncertainty_score":0.9996407},"labels":[],"label_agreement":null},{"id":"W4416875285","doi":"10.1109/qce65121.2025.10339","title":"Graph Neural Network-Based Predictor for Optimal Quantum Hardware Selection","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum circuit; Electronic circuit; Quantum gate; Metric (unit); Quantum computer; Process (computing); Artificial neural network; Quantum; Graph","score_opus":0.01060536272449634,"score_gpt":0.24569377488318425,"score_spread":0.23508841215868792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416875285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03376082,0.0007992325,0.95077956,0.0051690536,0.0072753574,0.001216802,0.000033191896,0.0007429886,0.00022301891],"genre_scores_gemma":[0.7636001,0.000012942579,0.22973622,0.002840926,0.0017039949,0.00011565751,0.000028452057,0.000050648217,0.0019110574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954267,0.00025204718,0.0008433151,0.0015181907,0.000465476,0.001494284],"domain_scores_gemma":[0.9976197,0.00060806057,0.00026671938,0.00076454895,0.00046730312,0.0002736605],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00073709956,0.0006605323,0.0006276555,0.0004207332,0.0013895514,0.0008796837,0.0014386612,0.00032049694,0.000053052936],"category_scores_gemma":[0.00010653548,0.00061229843,0.0006408195,0.0024035973,0.0001762403,0.00028733854,0.00042089267,0.00067935954,0.000008740205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014541022,0.00017980652,0.00089496654,0.00019107417,0.00011789875,0.000005380588,0.00011772748,0.8814849,0.0000524765,0.02210776,0.023897193,0.070805356],"study_design_scores_gemma":[0.0016429399,0.0010424089,0.0020866522,0.00029487826,0.00009247496,0.000011808581,0.000011156946,0.9790874,0.0003779615,0.004851194,0.009916315,0.00058478076],"about_ca_topic_score_codex":0.000056147273,"about_ca_topic_score_gemma":0.000022690203,"teacher_disagreement_score":0.72983927,"about_ca_system_score_codex":0.000089775676,"about_ca_system_score_gemma":0.0007205346,"threshold_uncertainty_score":0.99991053},"labels":[],"label_agreement":null},{"id":"W4416888690","doi":"10.1103/d3x5-cgky","title":"Reducing depth and measurement weights in Pauli-based computation","year":2025,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Controlled NOT gate; Pauli exclusion principle; Computation; Quantum computer; Heuristic; Quantum circuit; Quantum gate; Pauli matrices; Quantum algorithm","score_opus":0.018851439484156296,"score_gpt":0.33907680711262256,"score_spread":0.32022536762846626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416888690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22443762,0.2531012,0.4960967,0.020451346,0.00044540322,0.003055791,0.000005006483,0.00042253936,0.001984387],"genre_scores_gemma":[0.9721747,0.013954787,0.008326131,0.0051989,0.00018676366,0.00012463302,0.000006925619,0.000020330712,0.000006820627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967204,0.00049451494,0.00060947257,0.000926153,0.00077225856,0.0004772235],"domain_scores_gemma":[0.998314,0.00043228385,0.00022822752,0.00064963783,0.00019144798,0.0001843633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008835008,0.00040804784,0.0011311346,0.00011109608,0.00014345963,0.00009285234,0.0006606705,0.000029962495,0.0000011535469],"category_scores_gemma":[0.00047379563,0.0003111004,0.0003338892,0.0014545411,0.00008544945,0.00018359971,0.00030100942,0.00049946987,0.00003331153],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006996808,0.0009193171,0.00016706993,0.0112867905,0.000050558894,0.000022787262,0.0001591187,0.000845466,0.0023740684,0.021025727,0.0013006944,0.9618414],"study_design_scores_gemma":[0.0005566029,0.00017740137,0.004505188,0.04855202,0.00014191993,0.000004912117,0.0000012441164,0.8810472,0.0022178225,0.053400066,0.008833502,0.0005621307],"about_ca_topic_score_codex":0.000031825504,"about_ca_topic_score_gemma":0.0000071095196,"teacher_disagreement_score":0.9612793,"about_ca_system_score_codex":0.000120064615,"about_ca_system_score_gemma":0.00019400191,"threshold_uncertainty_score":0.99993414},"labels":[],"label_agreement":null},{"id":"W4416893825","doi":"10.48550/arxiv.2504.19185","title":"Quantum computation with the eigenstate thermalization hypothesis instead of wavefunction preparation","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Eigenvalues and eigenvectors; Operator (biology); Quantum; Superposition principle; Wave function; Boundary value problem; Quantum algorithm; Quantum system; Quantum entanglement","score_opus":0.027844902990255424,"score_gpt":0.25431126324618575,"score_spread":0.2264663602559303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416893825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5185802,0.00008837947,0.4794395,0.0007078072,0.00042309114,0.0003394022,0.000006686893,0.00013527267,0.00027965405],"genre_scores_gemma":[0.99076116,0.000032352356,0.008637356,0.00020315475,0.00011503748,0.000033556535,0.000038794147,0.00001626726,0.00016232299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801195,0.00029935315,0.0004335918,0.0006343643,0.0003879455,0.00023281983],"domain_scores_gemma":[0.9979783,0.0002753912,0.0006131254,0.0007836694,0.00031039113,0.000039093036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041399006,0.00030775467,0.00032365177,0.00018659492,0.0002547424,0.0001267277,0.0007564029,0.00016225758,0.0000026308744],"category_scores_gemma":[0.000043748503,0.00020574848,0.000120191005,0.0005222107,0.00009305515,0.00016149979,0.0005455609,0.0004071876,0.000008805734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076816825,0.00013197835,0.0077055427,0.00029801723,0.00023118718,0.000004899518,0.0049763303,0.91751385,0.0005591431,0.0031634488,0.00038895762,0.06494985],"study_design_scores_gemma":[0.00023972677,0.00016287249,0.052991863,0.00028009646,0.00006679593,0.0000059498434,0.000049323215,0.9408015,0.0021231857,0.0027249502,0.00028984802,0.0002638747],"about_ca_topic_score_codex":0.00011183376,"about_ca_topic_score_gemma":0.000026782225,"teacher_disagreement_score":0.47218096,"about_ca_system_score_codex":0.000056660432,"about_ca_system_score_gemma":0.00025529647,"threshold_uncertainty_score":0.839018},"labels":[],"label_agreement":null},{"id":"W4416906933","doi":"10.1038/s41467-025-65836-3","title":"Artificial intelligence for quantum computing","year":2025,"lang":"en","type":"article","venue":"Nature Communications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Perimeter Institute; University of Waterloo; University of Toronto","funders":"Research Executive Agency; Engineering and Physical Sciences Research Council; Office of Science; European Commission; Government of Canada; Natural Resources Canada; UK Research and Innovation; Institut Périmètre de physique théorique; Innovation, Science and Economic Development Canada; Ministero dello Sviluppo Economico; U.S. Department of Energy","keywords":"Counterintuitive; Quantum computer; Field (mathematics); Applications of artificial intelligence; Software; Stack (abstract data type); Prime (order theory); Scaling","score_opus":0.030671503903102134,"score_gpt":0.33980457694142113,"score_spread":0.309133073038319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416906933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010638704,0.002206625,0.97019,0.023945697,0.00078008766,0.0002723816,0.0000055216915,0.000312757,0.0012230434],"genre_scores_gemma":[0.67092305,0.000021585964,0.3280287,0.00091558933,0.000051982213,0.00001305265,0.000009571248,0.00000500711,0.00003145428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892205,0.00009334565,0.00031552036,0.0003051585,0.00011422961,0.0002496722],"domain_scores_gemma":[0.9964602,0.0011644054,0.00009025051,0.0020418093,0.00019936966,0.000043975942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045310112,0.00012948072,0.00015244921,0.0001799738,0.0007613406,0.00018945347,0.003688618,0.00016644166,8.1255337e-7],"category_scores_gemma":[0.00030232218,0.00012310145,0.0001069725,0.0008466082,0.000097387674,0.00009259856,0.0011282208,0.00076803804,0.000007804003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014972434,0.000053539407,0.000025453013,0.0000071910085,0.000012356451,1.8838648e-7,0.00016800626,0.0007382288,0.000082286846,0.7979814,0.0010595901,0.19987026],"study_design_scores_gemma":[0.00002632779,0.000019430929,0.00026438033,0.000040399966,0.0000059319464,0.0000025974875,0.000026491538,0.8275518,0.00054491597,0.13981386,0.031592704,0.00011117359],"about_ca_topic_score_codex":0.0000066939106,"about_ca_topic_score_gemma":0.000029182409,"teacher_disagreement_score":0.8268136,"about_ca_system_score_codex":0.000031886353,"about_ca_system_score_gemma":0.0001127694,"threshold_uncertainty_score":0.68544316},"labels":[],"label_agreement":null},{"id":"W4416913168","doi":"10.22331/q-2025-12-02-1921","title":"Solving one-body ensemble N-representability problems with spin","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"International Max Planck Research School for Quantum Science and Technology; International Max Planck Research School for Advanced Methods in Process and Systems Engineering; Deutsche Forschungsgemeinschaft; International Max Planck Research School for Environmental, Cellular and Molecular Microbiology","keywords":"Pauli exclusion principle; Spin (aerodynamics); Density matrix; Quantum; Representation (politics); Polytope; Atomic orbital; Homogeneous space; Convex polytope","score_opus":0.012584366730829707,"score_gpt":0.25459570760768446,"score_spread":0.24201134087685475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416913168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2729779,0.00019681643,0.71944636,0.0024333545,0.0003961906,0.00027821813,0.000001053145,0.0004072571,0.0038628343],"genre_scores_gemma":[0.96515304,0.0000050459616,0.034060583,0.0002936017,0.0000707121,0.000014755625,0.0000017192358,0.0000111718855,0.00038939348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811023,0.00010216031,0.0002847898,0.0007032445,0.00031329747,0.00048628295],"domain_scores_gemma":[0.9985427,0.00016052826,0.00009035761,0.0010166456,0.000095262054,0.0000944654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004114592,0.00020951364,0.00026381764,0.00014084419,0.00026252022,0.000250072,0.0009533136,0.000065953354,0.000008651452],"category_scores_gemma":[0.000052850384,0.00016740624,0.000078131125,0.0007441488,0.00008908938,0.00020626427,0.00047125635,0.00029965863,0.000034058983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000677403,0.0012052428,0.01547059,0.00060303585,0.00026976786,0.00010310178,0.002931443,0.021737149,0.024196927,0.7846861,0.0036646065,0.1450643],"study_design_scores_gemma":[0.0005252595,0.00023296535,0.011716167,0.00027828425,0.000013036602,0.000020388163,0.000029761497,0.93672216,0.007026295,0.0394684,0.0036264847,0.00034081636],"about_ca_topic_score_codex":0.00018524916,"about_ca_topic_score_gemma":0.000027956256,"teacher_disagreement_score":0.914985,"about_ca_system_score_codex":0.000042026764,"about_ca_system_score_gemma":0.00016265704,"threshold_uncertainty_score":0.68266284},"labels":[],"label_agreement":null},{"id":"W4416914133","doi":"10.22331/q-2025-12-02-1922","title":"QRAM: A Survey and Critique","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Clarendon Fund; Engineering and Physical Sciences Research Council; University of Oxford","keywords":"Scalability; Qubit; Control (management); Quantum computer; Quantum; Computation; Key (lock); Intervention (counseling)","score_opus":0.010590790165579107,"score_gpt":0.27259555003043867,"score_spread":0.26200475986485955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416914133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3042986,0.00061794475,0.68894565,0.003992137,0.0006131859,0.00009105544,0.0000036594456,0.0002475426,0.0011902169],"genre_scores_gemma":[0.9886716,0.000019587846,0.009599861,0.0013613789,0.000024951072,0.0000036446543,0.0000015964421,0.000004618992,0.0003127789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911463,0.00012443868,0.0001331348,0.00031755966,0.00009352567,0.00021669985],"domain_scores_gemma":[0.9991557,0.00037275965,0.0000249223,0.00034059878,0.000050240764,0.000055752167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041928948,0.00010390599,0.00013274423,0.00009931828,0.00013852245,0.00016265552,0.0004230617,0.000047048143,0.0000022392655],"category_scores_gemma":[0.00015078776,0.000090663925,0.0000279131,0.00037170653,0.000045741683,0.000084067404,0.0002782873,0.00015558902,0.000009037609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010157713,0.000094859824,0.018981824,0.00007132333,0.00003614429,0.000046671244,0.00057629164,0.00016864267,0.00019601449,0.82766813,0.015127446,0.13702248],"study_design_scores_gemma":[0.00022619226,0.00006228874,0.15287846,0.00005112158,0.000002061501,0.000014177613,0.000008324264,0.7785607,0.00017884432,0.05901706,0.008820858,0.00017992756],"about_ca_topic_score_codex":0.00015958028,"about_ca_topic_score_gemma":0.000026735352,"teacher_disagreement_score":0.778392,"about_ca_system_score_codex":0.000007844756,"about_ca_system_score_gemma":0.00006053702,"threshold_uncertainty_score":0.36971676},"labels":[],"label_agreement":null},{"id":"W4416916293","doi":"10.22331/q-2025-12-02-1926","title":"Polynomial-Time Classical Simulation of Hidden Shift Circuits via Confluent Rewriting of Symbolic Sums","year":2025,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rewriting; Class (philosophy); Benchmark (surveying); Polynomial; Path (computing); Electronic circuit; Conjecture","score_opus":0.009425946399312145,"score_gpt":0.25623664369092,"score_spread":0.24681069729160782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416916293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7164494,0.00018119178,0.28107607,0.00082417496,0.00037613433,0.0001791384,0.0000060219895,0.00012931196,0.00077855965],"genre_scores_gemma":[0.99759877,0.0000016857264,0.0021076263,0.000115889416,0.00008433778,0.0000024266205,0.0000030194285,0.000009767119,0.00007647054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831665,0.0001251253,0.0005728021,0.00038340967,0.00030092875,0.00030108742],"domain_scores_gemma":[0.99854356,0.00049531925,0.00025426745,0.0005271981,0.00011095589,0.0000686703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035811178,0.00016882415,0.0003980468,0.00023109898,0.0000971514,0.00004515622,0.00067871244,0.00010360266,0.000008091373],"category_scores_gemma":[0.0001093577,0.00016000071,0.00013957934,0.00054540357,0.000104620354,0.000108758206,0.00027321346,0.00019751642,0.000012478194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064399785,0.00080520497,0.004082932,0.000710493,0.0002950854,0.00004074412,0.0053932047,0.13673863,0.08486481,0.118859604,0.0018807495,0.64626414],"study_design_scores_gemma":[0.00036668277,0.00010515405,0.009784218,0.00020334887,0.000013213897,0.0000028633015,0.0000096713175,0.98013026,0.0050439388,0.0036477712,0.00054463407,0.0001482694],"about_ca_topic_score_codex":0.000058234247,"about_ca_topic_score_gemma":0.0000014631107,"teacher_disagreement_score":0.8433916,"about_ca_system_score_codex":0.000027154512,"about_ca_system_score_gemma":0.00012595607,"threshold_uncertainty_score":0.652464},"labels":[],"label_agreement":null},{"id":"W4416924643","doi":"10.1109/dasc66011.2025.11257365","title":"Quantum Enhanced Anomaly Detection for ADS-B Data Using Hybrid Deep Learning","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Deep learning; Quantum; Artificial neural network; Superposition principle; Anomaly detection; Quantum machine learning; Field (mathematics); Curse of dimensionality; Quantum superposition","score_opus":0.02586552864060818,"score_gpt":0.2913438741395615,"score_spread":0.26547834549895327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416924643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11310101,0.0010667259,0.87998074,0.00037749074,0.0039371825,0.00066076696,0.000017920944,0.00036723807,0.00049090735],"genre_scores_gemma":[0.8744041,0.00004206355,0.123847164,0.00029182716,0.00049524475,0.000010703475,0.000025324278,0.000035873156,0.0008477277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99520355,0.0002969047,0.00087924226,0.0021174403,0.0003892857,0.0011135854],"domain_scores_gemma":[0.99640787,0.00063517515,0.00039308253,0.0020691091,0.00031354712,0.0001812436],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001281129,0.00056431396,0.0006090816,0.00046976472,0.0017325836,0.0010065698,0.0029071167,0.00017338102,0.000033099415],"category_scores_gemma":[0.0005037749,0.00056762213,0.00023534642,0.0012620623,0.00013803116,0.00076087425,0.0027430942,0.00078018475,0.000017089122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006492204,0.00011294765,0.00003305418,0.00020202066,0.00013478583,0.000009103926,0.00030225544,0.07674994,0.01697922,0.0019581993,0.0000982386,0.9033553],"study_design_scores_gemma":[0.00087332696,0.00036155296,0.00015433563,0.00028439754,0.000099340534,0.000040841813,0.00006929775,0.95758003,0.031366937,0.003209039,0.005358599,0.00060233107],"about_ca_topic_score_codex":0.00022956148,"about_ca_topic_score_gemma":0.000075611504,"teacher_disagreement_score":0.902753,"about_ca_system_score_codex":0.00012791154,"about_ca_system_score_gemma":0.00038646968,"threshold_uncertainty_score":0.99967754},"labels":[],"label_agreement":null},{"id":"W4416941104","doi":"10.65521/ijacte.v13i1.92","title":"Exploring Quantum Computing Algorithms for Optimization Problems","year":2025,"lang":"","type":"article","venue":"International Journal on Advanced Computer Theory and Engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Northern College","funders":"","keywords":"Quantum computer; Quantum algorithm; Quantum; Complement (music); Optimization problem; Optimization algorithm; Implementation; Quantum phase estimation algorithm","score_opus":0.022813728531191076,"score_gpt":0.2605637604424632,"score_spread":0.23775003191127214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416941104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013171765,0.00091064913,0.9641043,0.0015867662,0.019590355,0.00036711068,0.000010962132,0.00020942082,0.00004865329],"genre_scores_gemma":[0.3722855,0.0010445848,0.62182724,0.0012524247,0.003354791,0.000034568537,0.000011904513,0.00007776035,0.000111215864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969374,0.00016773964,0.000920794,0.00079914427,0.0004955112,0.0006794065],"domain_scores_gemma":[0.99728674,0.0012983949,0.00036600465,0.00029898668,0.000517887,0.00023198935],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015541189,0.00056761183,0.0004982403,0.000890661,0.00059158617,0.0013411838,0.0013374179,0.00011700019,0.000004328911],"category_scores_gemma":[0.00018394645,0.00056633126,0.00027270606,0.00043097252,0.00006206926,0.0009880683,0.00059051457,0.00091371883,0.0000023800985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008928869,0.000059467686,0.0000020039984,0.000057299298,0.00021098064,0.000026542511,0.00043004056,0.54656124,0.00007125027,0.09901037,0.00001390958,0.3534676],"study_design_scores_gemma":[0.0019057629,0.00041702468,0.000094328716,0.0027279442,0.000030318397,0.00027214838,0.000034029064,0.9782264,0.00022965526,0.00953783,0.0059978687,0.0005266766],"about_ca_topic_score_codex":9.278455e-7,"about_ca_topic_score_gemma":7.4228325e-8,"teacher_disagreement_score":0.43166515,"about_ca_system_score_codex":0.00020305748,"about_ca_system_score_gemma":0.00009659825,"threshold_uncertainty_score":0.99969554},"labels":[],"label_agreement":null},{"id":"W4416987111","doi":"10.1038/s41525-025-00537-w","title":"Quantum computing and the implementation of precision medicine","year":2025,"lang":"en","type":"article","venue":"npj Genomic Medicine","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Genome Canada; SickKids Foundation; University of Toronto; Hospital for Sick Children","funders":"","keywords":"Biomedicine; Precision medicine; Quantum computer; Quantum; Quantum algorithm; Workflow; Quantum technology; Qubit; Personalized medicine","score_opus":0.010292835131345528,"score_gpt":0.30111581565762535,"score_spread":0.2908229805262798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416987111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44829354,0.0028456692,0.52145255,0.025275925,0.00089379965,0.0003483138,7.6588054e-7,0.000057934507,0.00083152595],"genre_scores_gemma":[0.9938987,0.0001046512,0.0046524163,0.0010427613,0.00022416122,0.0000022862116,0.000002366313,0.00000474465,0.0000679126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986577,0.00015079469,0.0004889779,0.00028843296,0.00023502209,0.00017908645],"domain_scores_gemma":[0.99852186,0.00075698085,0.00020339846,0.0004011644,0.000071552895,0.000045037817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001343936,0.00012957709,0.00034577286,0.00016629235,0.00016669769,0.000013432916,0.00054159295,0.000031910284,0.000017697923],"category_scores_gemma":[0.00011271432,0.00006943238,0.000029271983,0.0003753197,0.0003878834,0.000035938585,0.0003330198,0.0001506221,0.0000011630651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040435145,0.000013266788,0.0011448236,0.00009173908,0.00006425026,0.0000033446413,0.011703811,0.0003825375,0.0067002303,0.18537167,0.0046379906,0.7898459],"study_design_scores_gemma":[0.008885126,0.00043786192,0.052654438,0.00067180494,0.000073189185,0.000042572286,0.0018488357,0.8729728,0.0006151524,0.055930234,0.0056874435,0.00018053163],"about_ca_topic_score_codex":0.00038155352,"about_ca_topic_score_gemma":0.000009866402,"teacher_disagreement_score":0.8725903,"about_ca_system_score_codex":0.000018494808,"about_ca_system_score_gemma":0.00005184233,"threshold_uncertainty_score":0.28313702},"labels":[],"label_agreement":null},{"id":"W4416998358","doi":"10.1038/s41534-025-01139-1","title":"Efficient Lindblad synthesis for noise model construction","year":2025,"lang":"en","type":"article","venue":"npj Quantum Information","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Noise (video); Quantum noise; Quantum error correction; Channel (broadcasting); Noise measurement; Gaussian noise","score_opus":0.006960488432367141,"score_gpt":0.2279046766062879,"score_spread":0.22094418817392078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416998358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079032525,0.00002053843,0.9173356,0.0012289757,0.000681483,0.00030065427,0.0000136145845,0.00026309481,0.0011234782],"genre_scores_gemma":[0.8254174,0.0000054164693,0.17385413,0.00055771205,0.000045234974,0.00007495781,0.000011729317,0.0000046740197,0.000028754626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989738,0.000021759182,0.0003835481,0.00017398628,0.00019716848,0.00024977713],"domain_scores_gemma":[0.99908954,0.0001799791,0.00015586455,0.0003477973,0.00017905474,0.000047754045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033441215,0.00014040958,0.00015077651,0.00029994443,0.00030252582,0.00021893962,0.00041622343,0.000089059526,0.0000014923495],"category_scores_gemma":[0.00016884363,0.00012698656,0.000096660406,0.00038577683,0.00003711472,0.000369735,0.000113348295,0.00011627927,0.000023219622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016206233,0.00001904336,0.000011134329,0.000054780212,0.000010034896,1.3370185e-7,0.0004730291,0.5404569,0.000063091546,0.23504019,0.0004207271,0.22343473],"study_design_scores_gemma":[0.00026654362,0.000026009615,0.00012869838,0.00006276402,0.000009181993,0.0000071586596,0.000040423885,0.98447484,0.00085629796,0.011503351,0.0024864157,0.00013832837],"about_ca_topic_score_codex":0.0000064854125,"about_ca_topic_score_gemma":5.0981123e-7,"teacher_disagreement_score":0.74638486,"about_ca_system_score_codex":0.000054633627,"about_ca_system_score_gemma":0.00014306199,"threshold_uncertainty_score":0.5178362},"labels":[],"label_agreement":null},{"id":"W4417041477","doi":"10.48550/arxiv.2504.19992","title":"Towards Non-Abelian Quantum Signal Processing: Efficient Control of Hybrid Continuous- and Discrete-Variable Architectures","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund","keywords":"Quantum error correction; Robustness (evolution); Quantum; Quantum computer; Boolean function; Quantum Fourier transform; Quantum algorithm; Qubit; Quantum gate; Topology (electrical circuits)","score_opus":0.009461281382103242,"score_gpt":0.24084115216519003,"score_spread":0.23137987078308678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417041477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46722743,0.0010699537,0.5295335,0.0007265143,0.00045616867,0.0004484079,0.000083549035,0.00017067914,0.0002837914],"genre_scores_gemma":[0.97788775,0.000014059202,0.021301981,0.00035979462,0.00023714142,0.00004419361,0.000015376369,0.000030229705,0.00010945477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962653,0.00019890831,0.00081059,0.0014169345,0.0005690327,0.00073921843],"domain_scores_gemma":[0.9975679,0.00024668832,0.0006050347,0.0010648244,0.00028393394,0.00023163464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069949107,0.0006721887,0.0011188032,0.00037670543,0.00029400183,0.00028148247,0.0018687082,0.0002121559,0.0000075407584],"category_scores_gemma":[0.000099413344,0.00055596686,0.00025262614,0.0004247921,0.00030306814,0.000046759385,0.0023166144,0.0012408238,0.0000032917096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000215184,0.0008213837,0.04679729,0.004138881,0.00069651974,0.00022406639,0.0043747188,0.74352604,0.0036094384,0.004348716,0.00051912514,0.19072865],"study_design_scores_gemma":[0.0009172431,0.00021651713,0.014654024,0.0012786306,0.00008126118,0.0000374758,0.000020088277,0.97455007,0.0031878417,0.003951772,0.0004897383,0.0006153369],"about_ca_topic_score_codex":0.0002478444,"about_ca_topic_score_gemma":0.0000025131992,"teacher_disagreement_score":0.51066035,"about_ca_system_score_codex":0.00004379983,"about_ca_system_score_gemma":0.00081503013,"threshold_uncertainty_score":0.99968916},"labels":[],"label_agreement":null},{"id":"W4417076509","doi":"10.1126/science.ado6686","title":"Cracking chemistry with quantum simulations","year":2025,"lang":"en","type":"article","venue":"Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Structural Genomics Consortium; Canadian Institute for Advanced Research; Vector Institute; University of Toronto","funders":"","keywords":"Quantum chemical; Quantum; Quantum chemistry; Cracking; Chemical reaction; Quantum dynamics","score_opus":0.006006692499531877,"score_gpt":0.2507281137176353,"score_spread":0.24472142121810345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417076509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29344204,0.00005555558,0.70048094,0.0013728057,0.00022462849,0.000056515906,6.147993e-7,0.00019448619,0.004172399],"genre_scores_gemma":[0.9656954,4.9686184e-7,0.033698123,0.00022981895,0.000024384977,0.0000012993623,2.0759968e-7,0.00000204181,0.0003482407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989059,0.000009113329,0.00009844174,0.0004095458,0.00029349595,0.00028348787],"domain_scores_gemma":[0.99923044,0.000074791875,0.000038641047,0.0004883715,0.000106136846,0.00006163272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024000577,0.000083544925,0.00007334528,0.00009628323,0.0005397077,0.00030414306,0.0011985389,0.000018152377,0.00000768655],"category_scores_gemma":[0.00007092804,0.00006330079,0.000018070696,0.0019579732,0.00027765104,0.00028505738,0.0003166742,0.00012490319,0.000006232559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000863702,0.00018191538,0.0063781315,0.000085033345,0.00002250333,0.00004856087,0.0019314265,0.40894052,0.11544387,0.18327035,0.00027237067,0.2834167],"study_design_scores_gemma":[0.00009149984,0.000013403365,0.00419844,0.00005023756,0.0000014184906,0.000007576463,0.000011182482,0.9770081,0.009408147,0.0072999466,0.0018113375,0.00009872241],"about_ca_topic_score_codex":0.0000053739655,"about_ca_topic_score_gemma":0.0000011775793,"teacher_disagreement_score":0.6722533,"about_ca_system_score_codex":0.000029773491,"about_ca_system_score_gemma":0.00036417905,"threshold_uncertainty_score":0.41510502},"labels":[],"label_agreement":null},{"id":"W4417088239","doi":"10.48550/arxiv.2505.06165","title":"Optimization of Quantum Error Correcting Code under Temporal Variation of Qubit Quality","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Qubit; Overhead (engineering); Error detection and correction; Quantum error correction; Word error rate; Quantum computer; Code (set theory); USable","score_opus":0.05710793136913971,"score_gpt":0.31793133572325993,"score_spread":0.2608234043541202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417088239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3939298,0.000067076755,0.60389346,0.0003505199,0.0013543965,0.00018592138,0.000025115662,0.000113643226,0.000080022386],"genre_scores_gemma":[0.90855294,0.0000091958855,0.09107922,0.00008902458,0.00010782237,0.000008369965,0.000041623374,0.000013322776,0.00009850215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725765,0.00038476026,0.0009729762,0.00072196533,0.00040055875,0.00026208351],"domain_scores_gemma":[0.9969123,0.0003782554,0.0012543641,0.0010141857,0.0003813101,0.000059578302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010379212,0.0002941009,0.0006124952,0.00024047233,0.00011867114,0.000050053288,0.0010839042,0.0002853636,0.000008532015],"category_scores_gemma":[0.00026802882,0.00029104995,0.00021425358,0.0005089711,0.00007105923,0.000115396484,0.0013550367,0.0005970213,0.000002043578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000125861425,0.00011617527,0.034240868,0.00038803136,0.000069014466,0.000001158957,0.0013823055,0.9579125,0.00015081494,0.003448474,0.000028068667,0.00224997],"study_design_scores_gemma":[0.0002390366,0.0000513944,0.0923667,0.00039445228,0.000025284247,0.000002227021,0.00006233913,0.9029536,0.0008541963,0.002789842,0.000012855033,0.0002480701],"about_ca_topic_score_codex":0.0011520105,"about_ca_topic_score_gemma":0.00003874618,"teacher_disagreement_score":0.5146231,"about_ca_system_score_codex":0.00006757171,"about_ca_system_score_gemma":0.00044126206,"threshold_uncertainty_score":0.99995416},"labels":[],"label_agreement":null},{"id":"W4417114353","doi":"10.1007/s00220-025-05483-3","title":"Monogamy of Highly Symmetric States","year":2025,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Novo Nordisk Fonden; Novo Nordisk; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Agence Nationale de la Recherche; Villum Fonden","keywords":"Antisymmetric relation; Unitary state; Representation (politics); State (computer science); Quantum entanglement; Quantum; Field (mathematics); Projection (relational algebra)","score_opus":0.022291703270545898,"score_gpt":0.3023171099550868,"score_spread":0.2800254066845409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417114353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01140298,0.00037295776,0.97475445,0.002019382,0.00003996504,0.00013283033,0.000001942708,0.000080466736,0.0111950515],"genre_scores_gemma":[0.6627728,0.000049905964,0.33702222,0.00008163873,0.000005584116,0.0000119239,0.0000021990504,0.0000037213804,0.00005003961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991897,0.00009411998,0.00032039417,0.0001414796,0.00011686174,0.00013745789],"domain_scores_gemma":[0.99687177,0.0010334675,0.00007942797,0.0019235247,0.00006829915,0.00002353146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002567931,0.00008743225,0.0002028969,0.00015456972,0.00007580897,0.00003742089,0.0021698277,0.00003184501,0.0000010437575],"category_scores_gemma":[0.00011442686,0.0000774419,0.000055272805,0.0015880917,0.00013196832,0.000085557214,0.0010477289,0.00021065398,0.000012764672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.936079e-7,0.00026345122,0.00005779149,0.000047956222,0.000008751909,2.1640751e-7,0.00037512055,0.0014012905,0.000041680607,0.9410036,0.00008484885,0.05671489],"study_design_scores_gemma":[0.00007127096,0.0000074234254,0.00019453568,0.000074158146,0.000002401661,2.9271757e-7,0.000013835723,0.49990952,0.00028436142,0.49919584,0.00020670361,0.000039644972],"about_ca_topic_score_codex":0.0000068749077,"about_ca_topic_score_gemma":7.649896e-7,"teacher_disagreement_score":0.6513698,"about_ca_system_score_codex":0.00002352405,"about_ca_system_score_gemma":0.000045698987,"threshold_uncertainty_score":0.4032116},"labels":[],"label_agreement":null},{"id":"W4417117904","doi":"10.1103/dg5d-m728","title":"Scalable simulation of fermionic encoding performance on noisy quantum computers","year":2025,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Qubit; Quantum computer; Scalability; Encoding (memory); Quantum; Quantum error correction; Hamiltonian (control theory); Quantum algorithm","score_opus":0.015277960954684451,"score_gpt":0.341708813811081,"score_spread":0.3264308528563965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417117904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71532947,0.04807079,0.22547142,0.005124015,0.0008600936,0.0021853345,0.000008182344,0.00044864847,0.0025020395],"genre_scores_gemma":[0.9746035,0.020773321,0.001097054,0.00319151,0.00022826229,0.000046240708,0.0000073212263,0.000020680525,0.000032117267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676156,0.00032549424,0.00076360436,0.0008623954,0.0007320919,0.0005548796],"domain_scores_gemma":[0.9968554,0.0011408832,0.00041802868,0.0011939354,0.00022007762,0.00017168722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005764473,0.00046590192,0.0014245808,0.000115092975,0.00021469315,0.000062809726,0.001354371,0.000038624617,0.000004123475],"category_scores_gemma":[0.00040925262,0.0003565421,0.00065204466,0.0017964863,0.00011914241,0.00030146952,0.0004992468,0.0005678571,0.00013444955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023455894,0.0016774097,0.00017065374,0.024321634,0.00013219561,0.00001012953,0.00018149348,0.065517284,0.003989918,0.17508872,0.0019877385,0.7268994],"study_design_scores_gemma":[0.00021995908,0.0002932631,0.0006161234,0.030638447,0.00009019662,0.0000019872853,5.954004e-7,0.9466444,0.0025147952,0.0125048235,0.0061300616,0.00034533162],"about_ca_topic_score_codex":0.0000065568383,"about_ca_topic_score_gemma":1.7189166e-7,"teacher_disagreement_score":0.8811271,"about_ca_system_score_codex":0.00008454913,"about_ca_system_score_gemma":0.00013267699,"threshold_uncertainty_score":0.99988866},"labels":[],"label_agreement":null},{"id":"W4417118409","doi":"10.1063/5.0280551","title":"Magic state distillation without measurements and post-selection","year":2025,"lang":"en","type":"article","venue":"APL Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"","keywords":"Noise (video); Subroutine; Distillation; State (computer science); Quantum computer; Set (abstract data type); Protocol (science); Quantum; Qubit","score_opus":0.011721909086949518,"score_gpt":0.2499538905490656,"score_spread":0.2382319814621161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417118409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6248943,0.00016006443,0.3728992,0.0010397545,0.0003654632,0.00011122083,0.0000012204382,0.0001617131,0.00036702707],"genre_scores_gemma":[0.9903966,0.000008181792,0.008855753,0.00036782798,0.00003285677,0.0000028931088,0.0000022292961,0.000006237015,0.0003273824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897933,0.00007109723,0.00017339062,0.00035266732,0.0002007989,0.00022270627],"domain_scores_gemma":[0.99951583,0.000045042336,0.00006517273,0.00021341514,0.00010747783,0.00005303978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025635702,0.00012958526,0.0001274222,0.00013725221,0.00018867395,0.00017027675,0.00022749916,0.0000341675,0.000002116313],"category_scores_gemma":[0.000046368303,0.00011320358,0.00003069009,0.00036562546,0.000033369608,0.00015999968,0.00013697558,0.00012914548,0.000012888221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008020656,0.00021689912,0.09059647,0.0001965133,0.00018047659,0.000013321967,0.002239325,0.0021564777,0.012757322,0.17042752,0.0016602434,0.7194752],"study_design_scores_gemma":[0.00030317967,0.00009042548,0.10033833,0.000051056,0.000007778792,0.000012734681,0.0000063494576,0.8337659,0.0006700624,0.063395776,0.0012054739,0.00015290978],"about_ca_topic_score_codex":0.00009000844,"about_ca_topic_score_gemma":0.000019398178,"teacher_disagreement_score":0.8316094,"about_ca_system_score_codex":0.000028221373,"about_ca_system_score_gemma":0.000055799454,"threshold_uncertainty_score":0.46163082},"labels":[],"label_agreement":null},{"id":"W4417128656","doi":"10.4230/lipics.tqc.2025.6","title":"Quantum SAT Problems with Finite Sets of Projectors Are Complete for a Plethora of Classes","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Innovation, Science and Economic Development Canada; Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja; Government of Canada","keywords":"Constraint satisfaction problem; Hamiltonian (control theory); Quantum entanglement; Mathematical proof; Satisfiability; Qubit; Quantum; Boolean satisfiability problem; Set (abstract data type)","score_opus":0.040099801707541155,"score_gpt":0.2752251301860881,"score_spread":0.23512532847854692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417128656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75019205,0.00012345784,0.2480896,0.00078107545,0.00017459392,0.00045882136,0.000029791758,0.00008835812,0.00006228632],"genre_scores_gemma":[0.9651395,0.000004976753,0.03456419,0.00015030119,0.000027455648,0.00003255263,0.000007342211,0.000013571302,0.0000600765],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985464,0.00007541308,0.00039531462,0.0004456466,0.00021449862,0.00032268217],"domain_scores_gemma":[0.998276,0.00051777455,0.0003460535,0.00057012396,0.00024027324,0.000049790477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027098574,0.00020636895,0.0004218942,0.00020298632,0.00011833997,0.000032633816,0.0007233285,0.000066659115,0.0000014349591],"category_scores_gemma":[0.00010683952,0.0001542061,0.00011373478,0.0007617626,0.00013387165,0.00010384812,0.00023672094,0.0001686949,0.0000019276613],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021525007,0.0007504766,0.899648,0.0034909334,0.00048424638,0.000024376459,0.004866484,0.030460835,0.013815463,0.022896647,0.0015202061,0.021827051],"study_design_scores_gemma":[0.0015296597,0.0011313545,0.28035164,0.0015339869,0.000052126645,0.000011043636,0.00017336593,0.6974269,0.0075728353,0.0048180157,0.0049259746,0.00047307697],"about_ca_topic_score_codex":0.00006103969,"about_ca_topic_score_gemma":0.000035623274,"teacher_disagreement_score":0.6669661,"about_ca_system_score_codex":0.000016225582,"about_ca_system_score_gemma":0.00017424871,"threshold_uncertainty_score":0.6288343},"labels":[],"label_agreement":null},{"id":"W4417180551","doi":"10.56975/jaafr.v3i12.501605","title":"Hybrid Quantum Classical Intelligence for Business: A Reference Architecture for Predictive Analytics and Decision Optimization","year":2025,"lang":"en","type":"article","venue":"JOURNAL OF ADVANCE AND FUTURE RESEARCH","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wycliffe College","funders":"","keywords":"Quantum computer; Interpretability; Predictive analytics; Workflow; Probabilistic logic; Big data","score_opus":0.026177305500674285,"score_gpt":0.34814687364276387,"score_spread":0.3219695681420896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417180551","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004731419,0.0033606717,0.9846862,0.006493379,0.00035889453,0.00032023693,0.000012172591,0.000013277978,0.000023727118],"genre_scores_gemma":[0.056576148,0.00463775,0.93769026,0.00014975961,0.00087939884,0.00001567842,0.0000032025162,0.0000128101865,0.0000349772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998506,0.00006911937,0.00038114315,0.00033780234,0.00038271243,0.0003231919],"domain_scores_gemma":[0.9965275,0.0015341104,0.00015731617,0.00021791836,0.0014402015,0.00012293215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011535332,0.00013996197,0.00029373655,0.0004621261,0.0003457779,0.00021445288,0.00050033437,0.00008148539,5.4717793e-7],"category_scores_gemma":[0.0006032132,0.000099532284,0.00006159603,0.0006577712,0.00014286365,0.00026914495,0.00021419347,0.000548347,7.982316e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005179493,0.00006615243,0.00003170905,0.00014698417,0.0000366056,0.000010181616,0.00021477719,0.12580416,0.00007842438,0.022185901,0.00066216284,0.850245],"study_design_scores_gemma":[0.00044205468,0.0006999469,0.00033533908,0.00029373006,0.0000120468185,0.00008497037,0.000097903445,0.8243798,0.00012302458,0.14691459,0.026523957,0.00009266046],"about_ca_topic_score_codex":0.0000010169261,"about_ca_topic_score_gemma":0.0000020112966,"teacher_disagreement_score":0.8501523,"about_ca_system_score_codex":0.00003740466,"about_ca_system_score_gemma":0.0002431844,"threshold_uncertainty_score":0.4058809},"labels":[],"label_agreement":null},{"id":"W4417210013","doi":"10.1103/1g44-jp62","title":"Universal Adapters between Quantum Low-Density Parity Check Codes","year":2025,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Government of Canada; Innovation, Science and Economic Development Canada; U.S. Department of Energy","keywords":"Adapter (computing); Low-density parity-check code; Pauli exclusion principle; Qubit; Parity (physics); Quantum computer; Computation; Quantum","score_opus":0.01196549218533884,"score_gpt":0.2417715480286776,"score_spread":0.22980605584333874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417210013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5269811,0.00015660886,0.4672323,0.003175649,0.0009933296,0.00019483978,0.000011940081,0.0005831333,0.0006710921],"genre_scores_gemma":[0.9905187,0.000016199634,0.008581839,0.00045503883,0.0001757479,0.000004052876,0.000010270669,0.000016031956,0.00022211006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742305,0.00021072302,0.00041193058,0.0008460078,0.00041252936,0.0006957322],"domain_scores_gemma":[0.99817234,0.00036238207,0.00015909402,0.00097023556,0.00013261364,0.00020332569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058890384,0.0003559433,0.0004966333,0.000260539,0.0004796943,0.00026169914,0.0016025325,0.00016928343,0.0000083108125],"category_scores_gemma":[0.000102388076,0.00033557127,0.00020274828,0.0008459044,0.00017949208,0.00029353963,0.00090798334,0.00059293356,0.000069065005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006578738,0.00039184056,0.02704821,0.0002856154,0.00036426476,0.00021890212,0.0020753941,0.0019764157,0.0011121421,0.8797974,0.011305886,0.07535816],"study_design_scores_gemma":[0.00076844165,0.00015599073,0.06334902,0.00022487988,0.000045302495,0.0000134545335,0.00009452896,0.8661205,0.00194257,0.059163824,0.007482067,0.000639403],"about_ca_topic_score_codex":0.00035189904,"about_ca_topic_score_gemma":0.00002441917,"teacher_disagreement_score":0.8641441,"about_ca_system_score_codex":0.00009424453,"about_ca_system_score_gemma":0.00024681233,"threshold_uncertainty_score":0.99990964},"labels":[],"label_agreement":null},{"id":"W4417248781","doi":"10.48550/arxiv.2504.07068","title":"Quantum Reverse Shannon Theorem Revisited","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Colleges and Universities; H2020 Marie Skłodowska-Curie Actions; Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Quantum channel; Channel (broadcasting); Information theory; Quantum; Quantum information; No-go theorem; Shannon's source coding theorem; Noise (video); Fundamental theorem","score_opus":0.02380106601682119,"score_gpt":0.26606997792540016,"score_spread":0.24226891190857897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417248781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58330876,0.0025143682,0.391396,0.0074458634,0.0060396516,0.0009357856,0.00008507292,0.0019313795,0.0063431254],"genre_scores_gemma":[0.9399934,0.0003910797,0.04898592,0.0044083283,0.0014966878,0.000057741734,0.00010861232,0.000068448135,0.0044898065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966051,0.0002966319,0.0005806922,0.0014804624,0.00041694663,0.0006201741],"domain_scores_gemma":[0.99655825,0.00023563649,0.00035292353,0.0024865528,0.00019705087,0.00016958565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000719898,0.0005659603,0.0006564051,0.00032797272,0.00027308273,0.00026682054,0.003154177,0.00040653697,0.000030094803],"category_scores_gemma":[0.00017892652,0.0005028142,0.00037756842,0.00069062103,0.00009484678,0.00012474378,0.004910689,0.0015857632,0.00019327113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014597179,0.0012482512,0.08744617,0.0047265245,0.0015076709,0.00172747,0.011943404,0.0431282,0.001683977,0.40514693,0.0992008,0.34209466],"study_design_scores_gemma":[0.0006088017,0.00014096645,0.026363134,0.0027860848,0.00008669208,0.00004284417,0.00003171435,0.86224043,0.0007936161,0.05104295,0.054268308,0.0015944478],"about_ca_topic_score_codex":0.00009184383,"about_ca_topic_score_gemma":0.0000026942512,"teacher_disagreement_score":0.81911224,"about_ca_system_score_codex":0.0000816924,"about_ca_system_score_gemma":0.00030280356,"threshold_uncertainty_score":0.9997423},"labels":[],"label_agreement":null},{"id":"W4417250609","doi":"10.48550/arxiv.2504.07048","title":"Context Switching for Secure Multi-programming of Near-Term Quantum Computers","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Texas at Austin","keywords":"Exploit; Quantum computer; Fidelity; Resilience (materials science); Set (abstract data type); Controlled NOT gate; Crosstalk; Context (archaeology); Error detection and correction","score_opus":0.03788079751307697,"score_gpt":0.29288896333720366,"score_spread":0.25500816582412666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417250609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39783627,0.00045704652,0.59783554,0.00048711585,0.0024483951,0.0006139858,0.000027868731,0.00028225387,0.000011524589],"genre_scores_gemma":[0.7340155,0.000013105419,0.26521918,0.00036078077,0.00022971534,0.000050569462,0.000027486598,0.00002924033,0.000054425418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967515,0.00013389952,0.0008189215,0.0012800695,0.00032336687,0.0006922659],"domain_scores_gemma":[0.9969996,0.00051878026,0.0006532717,0.0013920035,0.00027533417,0.00016096578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005534554,0.00058581994,0.00089690083,0.00022464148,0.00038003305,0.00033375528,0.0026174786,0.00037578106,0.0000016528303],"category_scores_gemma":[0.00011564529,0.0005582597,0.0005833887,0.00033856044,0.00011179889,0.00012670888,0.0030866861,0.001103982,0.000005574551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005771053,0.0006224224,0.047472205,0.003469894,0.00072684983,0.00007225013,0.01633248,0.041426077,0.00071193214,0.010128678,0.00060276804,0.8783767],"study_design_scores_gemma":[0.0009039415,0.00013916584,0.009872768,0.001440558,0.000048579735,0.000010318855,0.00007078623,0.98324376,0.0005209526,0.0011087625,0.0020387683,0.0006016516],"about_ca_topic_score_codex":0.00024459165,"about_ca_topic_score_gemma":0.000033732922,"teacher_disagreement_score":0.94181764,"about_ca_system_score_codex":0.00006522081,"about_ca_system_score_gemma":0.0003817383,"threshold_uncertainty_score":0.9996869},"labels":[],"label_agreement":null},{"id":"W4417258170","doi":"10.1103/4rf7-9tfx","title":"Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications","year":2025,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Canadian Institute for Advanced Research","funders":"NTT Research; Army Research Office; Office of Science; North Carolina State University; Wisconsin Alumni Research Foundation; U.S. Department of Energy","keywords":"Quantum computer; Qubit; Computation; Quantum; Set (abstract data type); Key (lock); Quantum algorithm; Universal set; Hybrid system","score_opus":0.012054136204531904,"score_gpt":0.24908570247777992,"score_spread":0.237031566273248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417258170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.263539,0.002219885,0.7292636,0.0021043334,0.00048695717,0.0006957952,0.00005745487,0.00072832586,0.0009046435],"genre_scores_gemma":[0.9891511,0.00007959691,0.009984305,0.0003760063,0.00017319559,0.00009430757,0.000022031134,0.00002410291,0.000095348005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766505,0.00006553039,0.0004707922,0.00092181173,0.0003605951,0.00051625],"domain_scores_gemma":[0.99858063,0.00015342658,0.0001923912,0.0007886829,0.00011273034,0.00017211413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036069658,0.00036512717,0.00034721926,0.000377249,0.00054639106,0.00032999992,0.0009184857,0.000100831945,0.000004238201],"category_scores_gemma":[0.000040004583,0.0003229338,0.00009752,0.0006105902,0.00013791873,0.0002456101,0.0004740914,0.00056260725,0.000012289849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049993945,0.00022276654,0.0004977342,0.0005492432,0.00012434926,0.000025502406,0.00090071064,0.048998266,0.0005647968,0.5450984,0.0011204813,0.40184775],"study_design_scores_gemma":[0.00038730793,0.00004753616,0.0011591108,0.0000709286,0.000012581365,0.00010150334,0.000013307804,0.7251991,0.0003387179,0.26264638,0.009744983,0.0002785158],"about_ca_topic_score_codex":0.0001472369,"about_ca_topic_score_gemma":0.000013858813,"teacher_disagreement_score":0.7256121,"about_ca_system_score_codex":0.00004676907,"about_ca_system_score_gemma":0.00017285581,"threshold_uncertainty_score":0.9999223},"labels":[],"label_agreement":null},{"id":"W4417267525","doi":"10.1103/z1ng-wg3k","title":"Experimentally informed decoding of stabilizer codes based on syndrome correlations","year":2025,"lang":"en","type":"article","venue":"Physical Review Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Sherbrooke","funders":"Army Research Office; Canada First Research Excellence Fund; Natural Sciences and Engineering Research Council of Canada; nccr – on the move; RWTH Aachen University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Deutsche Forschungsgemeinschaft; Intelligence Advanced Research Projects Activity; Eidgenössische Technische Hochschule Zürich; European Research Council; Office of the Director of National Intelligence","keywords":"Error detection and correction; Decoding methods; Pauli exclusion principle; Quantum error correction; Matching (statistics); Propagation of uncertainty; Round-off error; Qubit","score_opus":0.050951197742756846,"score_gpt":0.4288981300070915,"score_spread":0.3779469322643346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417267525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56136495,0.02145558,0.34564516,0.016278546,0.00069229817,0.004116488,0.000028021923,0.0004869502,0.049931977],"genre_scores_gemma":[0.9923048,0.000256434,0.0069045266,0.0003784368,0.000017116885,0.0000507205,0.0000030434333,0.0000054879047,0.00007945891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821043,0.0002651876,0.00025949985,0.00029381755,0.00065799884,0.0003130491],"domain_scores_gemma":[0.9971447,0.001945724,0.00005213912,0.000601395,0.00017584692,0.000080208985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075664924,0.000109852255,0.0003069439,0.0001885077,0.00017885918,0.0000544913,0.0007872726,0.00002002666,0.000016077212],"category_scores_gemma":[0.00063842366,0.00008372214,0.00012967398,0.0013462803,0.00012664439,0.000094164825,0.00033591568,0.00036752113,0.000034412245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044304343,0.0023317158,0.0008312576,0.0066235694,0.00010506585,0.0000437876,0.0011241549,0.011790437,0.005035951,0.5667328,0.007945604,0.3973913],"study_design_scores_gemma":[0.00023869044,0.00028632313,0.0013904356,0.0044339257,0.000005709729,0.0000020342436,0.000010276866,0.981667,0.0021334933,0.0067396243,0.0029729994,0.000119531534],"about_ca_topic_score_codex":0.000011697844,"about_ca_topic_score_gemma":0.0000010291573,"teacher_disagreement_score":0.9698765,"about_ca_system_score_codex":0.00006688431,"about_ca_system_score_gemma":0.00031398208,"threshold_uncertainty_score":0.34140897},"labels":[],"label_agreement":null},{"id":"W4417268018","doi":"10.1103/cn64-gs6b","title":"Double Descent in Quantum Kernel Methods","year":2025,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Waterloo","funders":"European Commission; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Counterintuitive; Stochastic gradient descent; Quantum; Context (archaeology); Feature (linguistics); Kernel (algebra); Artificial neural network; Kernel method; Gradient descent","score_opus":0.020459858563880703,"score_gpt":0.32889021255952056,"score_spread":0.30843035399563984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417268018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11000796,0.001175051,0.88046914,0.0037773717,0.0019359677,0.0003056784,0.0000011805492,0.0004053449,0.001922301],"genre_scores_gemma":[0.7852464,0.00004888824,0.21306175,0.0009743196,0.000102513644,0.000039436283,0.0000026293449,0.000021914264,0.0005021624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976051,0.00026957944,0.00048261683,0.000734341,0.00025439053,0.0006539836],"domain_scores_gemma":[0.9985576,0.00029112506,0.000105275554,0.0008652187,0.00006814019,0.00011262619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012093013,0.00027374583,0.0003721161,0.00041935281,0.00017484695,0.00022466105,0.001407444,0.0001171369,0.000009700174],"category_scores_gemma":[0.000083683466,0.00024341382,0.00013168159,0.0013638008,0.000065155094,0.00020094254,0.0006956895,0.0004863754,0.000043875993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000468036,0.00034083967,0.002145667,0.000108662716,0.00004103421,0.000072795316,0.0012928081,0.0067758425,0.0014698184,0.7968542,0.0018972459,0.18895426],"study_design_scores_gemma":[0.0008794844,0.000057292953,0.0066573867,0.00013768386,0.000005720991,0.000013198819,0.000026821092,0.90467453,0.0022155482,0.071525164,0.013528337,0.00027885512],"about_ca_topic_score_codex":0.00024882983,"about_ca_topic_score_gemma":0.000022304399,"teacher_disagreement_score":0.8978987,"about_ca_system_score_codex":0.000088349545,"about_ca_system_score_gemma":0.00019129785,"threshold_uncertainty_score":0.9926127},"labels":[],"label_agreement":null},{"id":"W4417268208","doi":"10.1103/b5d4-m3qc","title":"Generalized Deutsch-Jozsa algorithm for applications in data classification, logistic regression, and quantum key distribution","year":2025,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Dresden; Kommission für Technologie und Innovation; Fundação de Amparo à Pesquisa do Estado de São Paulo; Deutsche Forschungsgemeinschaft","keywords":"Key (lock); Distribution (mathematics); Quantum key distribution; Quantum; Quantum algorithm; Quantum phase estimation algorithm","score_opus":0.04389741115143193,"score_gpt":0.3991204117620704,"score_spread":0.3552230006106385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417268208","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023048136,0.07126909,0.9153708,0.008208238,0.000111957466,0.002323038,0.00021883669,0.00014533433,0.00004785201],"genre_scores_gemma":[0.31828395,0.43712762,0.21137027,0.014351213,0.0024392186,0.007495582,0.008489765,0.0001822803,0.000260128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658716,0.0003598114,0.00076936587,0.0013668764,0.0004000148,0.00051675306],"domain_scores_gemma":[0.99613714,0.0009813042,0.0003585514,0.0020683454,0.00024739973,0.00020723505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007814253,0.00044421924,0.0011920024,0.000065769695,0.0002827695,0.00011680948,0.001860445,0.000052979725,0.0000012650946],"category_scores_gemma":[0.00094031345,0.0003227934,0.00026157722,0.0015623684,0.0001910196,0.00029462244,0.00088783004,0.00042676055,0.000020333215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004242322,0.0006874827,0.00006323606,0.0041360194,0.000039989176,0.000002222201,0.000033216176,0.00001584003,0.00058830896,0.3836296,0.0113782035,0.5994217],"study_design_scores_gemma":[0.00031681973,0.00004813839,0.00085151487,0.0056887195,0.0001479357,0.0000031403815,0.0000019853833,0.7681026,0.00012541567,0.1069149,0.11746397,0.0003348901],"about_ca_topic_score_codex":0.000017569428,"about_ca_topic_score_gemma":0.0000028566728,"teacher_disagreement_score":0.76808673,"about_ca_system_score_codex":0.00007347874,"about_ca_system_score_gemma":0.00017514518,"threshold_uncertainty_score":0.9999224},"labels":[],"label_agreement":null},{"id":"W4417299962","doi":"10.48550/arxiv.2505.11706","title":"Forensics of Error Rates of Quantum Hardware","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Qubit; Exploit; Quantum computer; Word error rate; Router; IBM; Cloud computing; Error detection and correction","score_opus":0.052026754089506855,"score_gpt":0.305080178514499,"score_spread":0.2530534244249921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417299962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73378795,0.00063244405,0.26216626,0.00079264847,0.0018407529,0.00024172907,0.0000684014,0.00013964741,0.00033015836],"genre_scores_gemma":[0.9586764,0.000038627095,0.040697057,0.00013226108,0.00013580173,0.000009338722,0.000019593459,0.000015710433,0.00027521758],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997915,0.00010590578,0.0006375418,0.0006869355,0.00032886348,0.00032573205],"domain_scores_gemma":[0.99739504,0.0002311809,0.000548455,0.0014262374,0.00032481967,0.00007429277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031235424,0.00033530963,0.0006934065,0.00021948115,0.000074296026,0.00003580611,0.0019158939,0.00024447628,0.000006282239],"category_scores_gemma":[0.00013428122,0.0002978357,0.00032430553,0.00039948875,0.0001448007,0.00006128238,0.00286735,0.0006557847,0.0000066764164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111672205,0.0010007356,0.45043427,0.009556386,0.001554613,0.00017557401,0.013968031,0.21473724,0.0033422625,0.11688572,0.010475414,0.17775807],"study_design_scores_gemma":[0.00042310907,0.00018554063,0.083688945,0.0017241797,0.000060610313,0.000008047185,0.00005362077,0.8620268,0.0234181,0.026395565,0.0014029498,0.0006125142],"about_ca_topic_score_codex":0.00015860649,"about_ca_topic_score_gemma":0.0000079689235,"teacher_disagreement_score":0.6472896,"about_ca_system_score_codex":0.000022907021,"about_ca_system_score_gemma":0.00036809745,"threshold_uncertainty_score":0.99994737},"labels":[],"label_agreement":null},{"id":"W4417314798","doi":"10.48550/arxiv.2502.08103","title":"Perfect state transfer between real pure states","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Bipartite graph; Adjacency matrix; State (computer science); Graph; Transfer (computing); Adjacency list; Perfect graph; Laplacian matrix; Perfect power","score_opus":0.023029627363250295,"score_gpt":0.26356265197144085,"score_spread":0.24053302460819057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417314798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8105944,0.00025250393,0.18463525,0.0017373151,0.0010716649,0.00033743557,0.00014695611,0.0006392745,0.00058524736],"genre_scores_gemma":[0.9913558,0.00032763006,0.0061642015,0.0003450173,0.00054537033,0.000032393917,0.00010911612,0.00003708165,0.001083408],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9967013,0.00025630914,0.0005458194,0.0013510669,0.00042762488,0.0007179019],"domain_scores_gemma":[0.99778134,0.00031222936,0.0001086384,0.0014589095,0.00013478905,0.00020410515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004850509,0.00058446324,0.0006921489,0.0002558833,0.00026674144,0.00029280456,0.0023798076,0.00030184837,0.000011346835],"category_scores_gemma":[0.000024987952,0.00051764527,0.0003459659,0.00041363738,0.00009336013,0.00012073623,0.0018868473,0.0016534185,0.00005679942],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038044906,0.00027288482,0.5808353,0.001383912,0.0010086481,0.00034262173,0.015576912,0.07947866,0.0003743541,0.0017552339,0.00287573,0.31605774],"study_design_scores_gemma":[0.0012639947,0.00046716884,0.6614064,0.0014345362,0.00019864754,0.000018903285,0.000045522123,0.2897373,0.00577377,0.02437813,0.01257011,0.002705534],"about_ca_topic_score_codex":0.00040058256,"about_ca_topic_score_gemma":0.000032554446,"teacher_disagreement_score":0.3133522,"about_ca_system_score_codex":0.00007491882,"about_ca_system_score_gemma":0.00038559895,"threshold_uncertainty_score":0.9997275},"labels":[],"label_agreement":null},{"id":"W4417338483","doi":"10.1109/piers-spring66516.2025.11276512","title":"Quantum Algorithm for Handling Large-Scale Image Data in Quantum Random Access Memory","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Pixel; Quantum computer; Robustness (evolution); Quantum; Random access; Quantum algorithm; Image (mathematics); Quantum phase estimation algorithm","score_opus":0.023611918180531342,"score_gpt":0.31572388021902503,"score_spread":0.2921119620384937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417338483","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010012894,0.0032204548,0.97121936,0.004876881,0.0068284385,0.002263259,0.0004808161,0.0003775878,0.0007202837],"genre_scores_gemma":[0.13794488,0.00079144666,0.85061705,0.004472478,0.002130541,0.00025617887,0.0004629606,0.00020606152,0.0031183814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9908273,0.0005585558,0.0019707729,0.003487399,0.000808252,0.0023476796],"domain_scores_gemma":[0.9921981,0.0020439376,0.00047737782,0.004516026,0.00040766684,0.0003568578],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.005367607,0.0010248364,0.0016403521,0.0010907605,0.0011704587,0.0028621326,0.010529461,0.00044080595,0.0000706963],"category_scores_gemma":[0.00053872354,0.0009493095,0.00044270454,0.0028233323,0.00030152386,0.0022217687,0.009661301,0.001248849,0.000034516703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028060944,0.0014602873,0.00026072175,0.00076927943,0.00025766157,0.00014160173,0.002054475,0.0068113054,0.00022582115,0.004958502,0.0112192435,0.9715605],"study_design_scores_gemma":[0.011223128,0.00016823839,0.00048057252,0.0009867456,0.000097227974,0.000023035635,0.0004568722,0.967298,0.00083628536,0.010461131,0.0069132065,0.0010556116],"about_ca_topic_score_codex":0.0008553962,"about_ca_topic_score_gemma":0.0007764383,"teacher_disagreement_score":0.9705049,"about_ca_system_score_codex":0.00014628969,"about_ca_system_score_gemma":0.0011514383,"threshold_uncertainty_score":0.9992958},"labels":[],"label_agreement":null},{"id":"W4417413515","doi":"10.48550/arxiv.2509.03288","title":"A Symmetry-Enabled Direct Quantum Protocol for Many-Body Green's Functions","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; Université de Sherbrooke","keywords":"Quantum; Quantum computer; Protocol (science); Quantum algorithm; Quantum system; Class (philosophy); Scheme (mathematics); Quantum operation; Topology (electrical circuits)","score_opus":0.032083625720950214,"score_gpt":0.29952767732929236,"score_spread":0.26744405160834217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417413515","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009826925,0.000043698852,0.8683235,0.0031164314,0.0028822096,0.11123403,0.000118267766,0.0015398057,0.0029151523],"genre_scores_gemma":[0.098026425,0.0000066954162,0.08205581,0.0017654722,0.0035309645,0.7831505,0.00013840929,0.0001874794,0.031138267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608654,0.00021118464,0.00069762225,0.0017496889,0.00040993223,0.0008450405],"domain_scores_gemma":[0.99647355,0.0004621226,0.00042849866,0.0021061976,0.00032312374,0.00020650266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065440097,0.000684617,0.0007690181,0.00048112337,0.0006253491,0.0003538043,0.0024526133,0.0004297191,0.000018957951],"category_scores_gemma":[0.0001907515,0.00060596335,0.0005816563,0.00077705353,0.0000809378,0.00014873027,0.0030817112,0.0012255941,0.00007298221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001110276,0.006640405,0.11838381,0.027031971,0.0051892092,0.0006490875,0.0059366548,0.06621209,0.0017330791,0.2924756,0.173216,0.3014218],"study_design_scores_gemma":[0.0013154597,0.00030105698,0.0112005,0.0009375486,0.00006785084,0.000013733373,0.000014444935,0.8771849,0.00044366973,0.010739897,0.09682446,0.0009564342],"about_ca_topic_score_codex":0.00031050073,"about_ca_topic_score_gemma":0.000011261418,"teacher_disagreement_score":0.81097287,"about_ca_system_score_codex":0.00011881769,"about_ca_system_score_gemma":0.00059158995,"threshold_uncertainty_score":0.99963915},"labels":[],"label_agreement":null},{"id":"W4417416030","doi":"10.1117/12.3089641","title":"Differentiable quantum circuit design for adaptive reinforcement learning in communication systems","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Reinforcement learning; Differentiable function; Communications system; Control theory (sociology); Quantum; Adaptive control; Control system","score_opus":0.035689139081863025,"score_gpt":0.25906311403413157,"score_spread":0.22337397495226854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417416030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003305682,0.0026175827,0.9882014,0.00059000304,0.0009271675,0.002019533,0.0000013203361,0.00022705477,0.0021102969],"genre_scores_gemma":[0.96719617,0.00015330917,0.023380935,0.00013939597,0.00005321027,0.00019769084,0.000009287429,0.000021293648,0.008848719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961374,0.00079619075,0.0010292383,0.0008349663,0.00035271762,0.00084949494],"domain_scores_gemma":[0.99678713,0.0013877824,0.0003669353,0.0010844372,0.00026498866,0.00010874776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018607281,0.00042956427,0.0006189068,0.000550995,0.0008233545,0.0007612507,0.0016606326,0.0002085053,0.000013857226],"category_scores_gemma":[0.00014831875,0.00041402772,0.0001695101,0.0011558997,0.00010190889,0.00028023208,0.00081215875,0.0007358918,0.000013288193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003569353,0.00006771488,0.000053803247,0.000112985595,0.000059842874,0.0000013524746,0.001120454,0.68256503,0.000036996258,0.29949972,0.00054428575,0.01590213],"study_design_scores_gemma":[0.0012684719,0.0005411717,0.00028838465,0.0014563445,0.000031964584,0.000003411275,0.0004879211,0.9829793,0.00017699362,0.01087439,0.0014757093,0.0004159101],"about_ca_topic_score_codex":0.000721894,"about_ca_topic_score_gemma":0.000016242555,"teacher_disagreement_score":0.96482044,"about_ca_system_score_codex":0.00036849178,"about_ca_system_score_gemma":0.0005479484,"threshold_uncertainty_score":0.99983114},"labels":[],"label_agreement":null},{"id":"W4417436019","doi":"10.1038/s41586-025-09838-7","title":"Programmable 200 GOPS Hopfield-inspired photonic Ising machine","year":2025,"lang":"en","type":"article","venue":"Nature","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kingston Health Sciences Centre; McGill University; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Ising model; Quantum computer; Photonics; Scalability; Spins; Qubit; Topology (electrical circuits); Scaling","score_opus":0.004091953742145329,"score_gpt":0.24471655124367395,"score_spread":0.24062459750152862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417436019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21423517,0.032320946,0.644498,0.048723847,0.009432742,0.0015248711,0.000019348665,0.0039275214,0.045317557],"genre_scores_gemma":[0.88286114,0.000024912324,0.10940035,0.0052976497,0.0001585052,0.000010919448,0.000006544423,0.0000139108715,0.0022260563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861836,0.000049210594,0.00017982235,0.0004906486,0.00024449246,0.0004174416],"domain_scores_gemma":[0.9990877,0.000078708166,0.000060717317,0.0006280069,0.000073855816,0.00007103162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022924565,0.00019174044,0.00019617753,0.0001557715,0.00026459267,0.00026652528,0.0010099108,0.0006045411,0.000011105773],"category_scores_gemma":[0.00005718957,0.00015829981,0.00010793001,0.00094750704,0.000027760707,0.0001334177,0.0003552235,0.0022205391,0.000015537149],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021508666,0.00018922005,0.00096886355,0.00011461999,0.000093606934,0.00010220032,0.0004933013,0.0022964587,0.0018992447,0.041959506,0.019821482,0.93204],"study_design_scores_gemma":[0.00054377684,0.00007192187,0.0011345422,0.00014998048,0.000011221755,0.00003367698,0.000007633774,0.81226623,0.0036183952,0.008998877,0.17287084,0.00029291885],"about_ca_topic_score_codex":0.000038688206,"about_ca_topic_score_gemma":0.000015780362,"teacher_disagreement_score":0.9317471,"about_ca_system_score_codex":0.000035831188,"about_ca_system_score_gemma":0.00012345251,"threshold_uncertainty_score":0.9647261},"labels":[],"label_agreement":null},{"id":"W4417450054","doi":"10.48550/arxiv.2512.12648","title":"Mid-circuit logic executed in the qubit layer of a quantum processor","year":2025,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Qubit; Quantum computer; Quantum technology; Quantum information; Quantum gate; Feed forward; Quantum circuit; Quantum teleportation; Quantum network","score_opus":0.07812081430336106,"score_gpt":0.21205427968115056,"score_spread":0.1339334653777895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417450054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54696083,0.00039513514,0.44606718,0.0009381566,0.0011505131,0.001242549,0.00006462937,0.00015111809,0.0030299095],"genre_scores_gemma":[0.9975104,0.00028188573,0.00063032756,0.000436335,0.00008831639,0.0000035127075,0.00001082994,0.000019327208,0.0010191008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944842,0.0009648665,0.0008516519,0.0023498677,0.0003563914,0.0009930598],"domain_scores_gemma":[0.9951959,0.0008361942,0.00090190134,0.0024506187,0.00044212805,0.00017321088],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013502672,0.0008328416,0.0010691709,0.0008998563,0.00038859254,0.00022171922,0.0070203114,0.0005999761,0.000036130412],"category_scores_gemma":[0.00016237624,0.00073029,0.0005999992,0.004465364,0.00048830867,0.00026546288,0.0030004792,0.002069859,0.000033091572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103497885,0.00078743533,0.0018224492,0.0008207811,0.0001681742,0.00076237175,0.005807973,0.7029872,0.000080794,0.28333664,0.00015122764,0.0031714786],"study_design_scores_gemma":[0.000986556,0.00021072668,0.002743663,0.000961624,0.00012288612,0.000023259698,0.0004752171,0.87710667,0.00018309483,0.11603327,0.0004777392,0.00067530794],"about_ca_topic_score_codex":0.0007195027,"about_ca_topic_score_gemma":0.00010714369,"teacher_disagreement_score":0.45054957,"about_ca_system_score_codex":0.0001848287,"about_ca_system_score_gemma":0.0010311406,"threshold_uncertainty_score":0.9995148},"labels":[],"label_agreement":null},{"id":"W4417474343","doi":"10.1103/qfwc-584t","title":"Characterizing Physical and Logical Errors in a Transversal CNOT Gate via Cycle Error Reconstruction","year":2025,"lang":"en","type":"article","venue":"Physical Review X","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"HORIZON EUROPE Research Infrastructures; Army Research Office; Intelligence Advanced Research Projects Activity; RWTH Aachen University; Austrian Science Fund; Deutsche Forschungsgemeinschaft; Office of the Director of National Intelligence","keywords":"Scalability; Overhead (engineering); Component (thermodynamics); Quantum; Qubit; Quantum computer; Error detection and correction; Controlled NOT gate; Quantum error correction","score_opus":0.013201433642543949,"score_gpt":0.2854573995477211,"score_spread":0.27225596590517714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417474343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96434504,0.0013942106,0.028052319,0.0052687447,0.0002020002,0.00027091647,0.0000016843818,0.000117372,0.00034768882],"genre_scores_gemma":[0.9954988,0.0003730235,0.0029571452,0.0010216419,0.00011629123,0.000018341727,0.0000012309466,0.0000061337887,0.0000074167765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987033,0.00013889091,0.00022870932,0.00048788954,0.00015515032,0.00028607313],"domain_scores_gemma":[0.9994336,0.00013091232,0.00006647022,0.0002651291,0.000021298212,0.000082594954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017687572,0.00018694664,0.00045552014,0.00006410964,0.00008391507,0.00005038048,0.00032271122,0.000028589404,0.0000021256697],"category_scores_gemma":[0.000041005824,0.00014747084,0.00013729662,0.00054503273,0.000086286025,0.00018820494,0.00015275338,0.00034837384,0.000013160629],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010633523,0.00029536066,0.0001262589,0.0007063838,0.000021661503,0.00002182578,0.00076987804,0.00018538785,0.0058014276,0.022200719,0.0000141611,0.9698463],"study_design_scores_gemma":[0.00033728254,0.00009304768,0.006896937,0.0019330623,0.000024873858,0.000033021206,0.0000053099125,0.93683594,0.0005797538,0.052191123,0.00080803613,0.00026163217],"about_ca_topic_score_codex":0.000014331776,"about_ca_topic_score_gemma":0.0000023289574,"teacher_disagreement_score":0.96958464,"about_ca_system_score_codex":0.000024906883,"about_ca_system_score_gemma":0.000029212215,"threshold_uncertainty_score":0.6013686},"labels":[],"label_agreement":null},{"id":"W4417513673","doi":"10.1063/5.0280149","title":"Structure theorem for quantum replacer codes","year":2025,"lang":"en","type":"preprint","venue":"Journal of Mathematical Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Qubit; Quantum convolutional code; Quantum; Quantum error correction; Class (philosophy); Set (abstract data type); Variety (cybernetics); Quantum information","score_opus":0.01766479639960532,"score_gpt":0.28529218274637874,"score_spread":0.2676273863467734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417513673","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010887742,0.00019048077,0.98566264,0.0013489604,0.0012147564,0.00026699,0.00005721349,0.000053907108,0.00031729898],"genre_scores_gemma":[0.16799521,0.000019283716,0.82950157,0.00033065391,0.0018959081,0.000006776859,0.0000052886717,0.000032383923,0.00021294212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979369,0.00010638075,0.000805343,0.00034049674,0.0005149777,0.00029590417],"domain_scores_gemma":[0.99664915,0.0010576545,0.0009444961,0.0007717496,0.0004575645,0.00011939411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006872667,0.00033295064,0.00086584536,0.00010015662,0.0001067608,0.00026945697,0.0017906422,0.00022523223,0.000006491271],"category_scores_gemma":[0.00033460007,0.00023084226,0.0005936089,0.00016473288,0.00007603311,0.00010467319,0.0009457346,0.0011589705,0.0000019357385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003206243,0.00020841036,0.0000028353995,0.0013635114,0.00026978948,0.000015529013,0.0012321152,0.030485323,0.00013474365,0.93309355,0.004552294,0.028609823],"study_design_scores_gemma":[0.00017874411,0.00007411393,0.000004420202,0.0006048626,0.00004647349,0.000033575692,0.0000084922995,0.41757908,0.0006777829,0.58037376,0.0002797883,0.00013890785],"about_ca_topic_score_codex":4.651747e-7,"about_ca_topic_score_gemma":9.793459e-8,"teacher_disagreement_score":0.38709375,"about_ca_system_score_codex":0.000052875588,"about_ca_system_score_gemma":0.0003656434,"threshold_uncertainty_score":0.9413474},"labels":[],"label_agreement":null},{"id":"W6891729076","doi":"10.48550/arxiv.0905.3413","title":"Interacting boson problems are QMA-hard","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Boson; Quantum; Class (philosophy); Quantum Monte Carlo; Sign (mathematics); Quantum computer; Energy (signal processing)","score_opus":0.054469425356443245,"score_gpt":0.1888901532643566,"score_spread":0.13442072790791335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891729076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44514662,0.00011463753,0.5506537,0.00052580505,0.0011855996,0.00027734172,0.0000070850783,0.0006663184,0.0014229042],"genre_scores_gemma":[0.9875769,0.000057316956,0.011216685,0.00019032569,0.00025982453,5.3272873e-7,0.000008369711,0.000023017454,0.0006670472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735636,0.00018214673,0.00027004324,0.0015056444,0.00013641152,0.0005494263],"domain_scores_gemma":[0.997611,0.00013928377,0.00053114747,0.0013614966,0.00014958967,0.00020749582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003058047,0.00045303584,0.00045120175,0.00031074244,0.00026933293,0.00034808126,0.002532192,0.00027919724,0.0000116107485],"category_scores_gemma":[0.000052262058,0.0004893885,0.0003087125,0.00057790417,0.000056883164,0.00029543263,0.0025328235,0.0014134352,0.000078521145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009034233,0.00010922733,0.0012164767,0.00011502889,0.0000636449,0.00054752175,0.0005325097,0.97540456,0.00004153455,0.010762027,0.0005504245,0.010648001],"study_design_scores_gemma":[0.0002577675,0.00006925682,0.00165714,0.0006150624,0.000027293512,0.00002450884,0.00003961487,0.96506923,0.00009843493,0.030145431,0.0014229561,0.00057328586],"about_ca_topic_score_codex":0.000087214496,"about_ca_topic_score_gemma":0.000015470516,"teacher_disagreement_score":0.5424303,"about_ca_system_score_codex":0.00016610103,"about_ca_system_score_gemma":0.00012993315,"threshold_uncertainty_score":0.9997558},"labels":[],"label_agreement":null},{"id":"W6891834664","doi":"10.48550/arxiv.1805.06908","title":"Towards Large-scale Functional Verification of Universal Quantum Circuits","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Formal equivalence checking; Boolean function; Quantum computer; Boolean circuit; Formal verification; Quantum algorithm; Qubit; Polynomial","score_opus":0.043761530720376154,"score_gpt":0.18852187986449026,"score_spread":0.14476034914411412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891834664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3398663,0.000023119424,0.65726376,0.000095018615,0.0012163807,0.00011974252,0.000035792455,0.00017812932,0.0012017571],"genre_scores_gemma":[0.9963764,0.00003210366,0.002837474,0.000054173666,0.00022784545,3.4494246e-7,0.00003993162,0.000017409886,0.00041429885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979568,0.00014932879,0.00024564596,0.0010905421,0.00018542421,0.00037221875],"domain_scores_gemma":[0.99783564,0.00007081322,0.00037738343,0.0012101764,0.00035573886,0.00015028051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033346273,0.00030083832,0.00034587912,0.0003132753,0.00020315258,0.000064230866,0.0016381769,0.00029698462,0.0000469377],"category_scores_gemma":[0.000026981286,0.0003426622,0.00025658673,0.00066965376,0.00017682591,0.00020840018,0.0016040845,0.00053874566,0.000053001175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061762745,0.00056020863,0.0017832129,0.0002639026,0.0002800129,0.00014960227,0.0020584352,0.626578,0.0003947522,0.35701635,0.0038146458,0.007039129],"study_design_scores_gemma":[0.00041343117,0.000094280374,0.008938443,0.000096850155,0.000039427654,0.0000055249775,0.00006748643,0.9625316,0.00029211925,0.026124114,0.0010467315,0.00034996914],"about_ca_topic_score_codex":0.00008541238,"about_ca_topic_score_gemma":0.000013610505,"teacher_disagreement_score":0.6565101,"about_ca_system_score_codex":0.00014251457,"about_ca_system_score_gemma":0.0004374803,"threshold_uncertainty_score":0.99990255},"labels":[],"label_agreement":null},{"id":"W6891967037","doi":"10.48550/arxiv.quant-ph/0107015","title":"Quantum Search by Local Adiabatic Evolution","year":2001,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Optech (Canada)","funders":"","keywords":"Adiabatic quantum computation; Adiabatic process; Hamiltonian (control theory); Infinitesimal; Quantum; Scaling; Time evolution; Quantum computer; Quantum algorithm","score_opus":0.03359966213409251,"score_gpt":0.18335015244203456,"score_spread":0.14975049030794205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891967037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2742527,0.00019672966,0.72380686,0.00017941634,0.0005492716,0.00017615088,0.000013347525,0.00033507083,0.00049043493],"genre_scores_gemma":[0.9971429,0.000083548686,0.0015419826,0.00008139567,0.00013152807,5.93246e-7,0.000023678065,0.00002412948,0.0009702245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997274,0.00026367433,0.00022940959,0.0013861395,0.00019352447,0.0006532469],"domain_scores_gemma":[0.9979902,0.00012977539,0.00015656323,0.0012960691,0.00013942558,0.00028800083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003388527,0.00039451534,0.00037077404,0.0003103969,0.00028268486,0.00017194846,0.0023210382,0.00034285715,0.000023046448],"category_scores_gemma":[0.000018799214,0.00043905573,0.00023893436,0.0008849822,0.00019990455,0.00020512773,0.0023368534,0.0011591421,0.00013198036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010278736,0.000112477384,0.00051404216,0.00006898231,0.00005744601,0.00030235364,0.00019052709,0.9263398,0.000020694475,0.06529194,0.0015704707,0.0055209957],"study_design_scores_gemma":[0.0002948453,0.00008413241,0.00043615504,0.00011349539,0.00002446319,0.00001896168,0.00004296051,0.95820165,0.000037643225,0.03957071,0.0007001045,0.00047488548],"about_ca_topic_score_codex":0.00063279533,"about_ca_topic_score_gemma":0.000019959583,"teacher_disagreement_score":0.7228902,"about_ca_system_score_codex":0.0004027392,"about_ca_system_score_gemma":0.0003085376,"threshold_uncertainty_score":0.9998061},"labels":[],"label_agreement":null},{"id":"W6891985751","doi":"10.48550/arxiv.2109.05655","title":"Generators and Relations for Real Stabilizer Operators","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Stabilizer (aeronautics); Set (abstract data type); Operator (biology); Hadamard transform; Pauli exclusion principle; Electronic circuit; Real number; Tensor (intrinsic definition)","score_opus":0.039457997576630995,"score_gpt":0.1875172178869881,"score_spread":0.14805922031035712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891985751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5838867,0.00008042776,0.4150461,0.000120997276,0.00039843464,0.00017709594,0.000013298702,0.00012192581,0.00015504987],"genre_scores_gemma":[0.9635013,0.000109464774,0.035802096,0.000069580055,0.000112888636,0.0000015680505,0.000021464082,0.000017642358,0.00036403077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983371,0.000106581734,0.00016388235,0.0010545732,0.000060639322,0.00027721346],"domain_scores_gemma":[0.9986493,0.00014727678,0.00011302191,0.00075978343,0.00017017128,0.00016043354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019096587,0.00024812837,0.000270334,0.00014605696,0.00031397754,0.00026357258,0.00068340404,0.00021809488,0.000008359726],"category_scores_gemma":[0.00003441025,0.00026950196,0.0001532626,0.00036521823,0.000077694385,0.00017728852,0.0014631092,0.0003946188,0.0000029675136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008605003,0.00007448628,0.0035205102,0.00008376126,0.00011497022,0.00012853353,0.0011559962,0.8632013,0.00010476603,0.12815353,0.00035831827,0.0030952217],"study_design_scores_gemma":[0.00030495017,0.00004147809,0.0013283544,0.00004841429,0.000035087265,0.0000054498005,0.0000773086,0.98856705,0.00010124221,0.008670547,0.0004775699,0.00034253325],"about_ca_topic_score_codex":0.00008557421,"about_ca_topic_score_gemma":0.000045881254,"teacher_disagreement_score":0.3796146,"about_ca_system_score_codex":0.0000779083,"about_ca_system_score_gemma":0.00028680585,"threshold_uncertainty_score":0.99997574},"labels":[],"label_agreement":null},{"id":"W6891997182","doi":"10.48550/arxiv.quant-ph/0109021","title":"Reducing Constraints on Quantum Computer Design by Encoded Selective Recoupling","year":2001,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum computer; Quantum logic; Quantum; Encoding (memory); Quantum error correction; Quantum information; Quantum gate; Isotropy","score_opus":0.05299926054841884,"score_gpt":0.19474015313076323,"score_spread":0.1417408925823444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891997182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11149864,0.000034685447,0.88536763,0.00019342061,0.0012320797,0.0004116705,0.000015693995,0.000562198,0.00068396574],"genre_scores_gemma":[0.9624761,0.000076830765,0.036635917,0.00021680407,0.00027060742,0.0000012231396,0.000017022641,0.000039701048,0.000265812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620634,0.00039906797,0.00034583634,0.0021154294,0.00018571445,0.000747634],"domain_scores_gemma":[0.9973857,0.0005169292,0.00042264472,0.0011995168,0.00019793864,0.0002772786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062513,0.0006180668,0.0005802026,0.00036659176,0.0004270193,0.00028095182,0.0021315652,0.00042082273,0.000022695112],"category_scores_gemma":[0.000039129376,0.00068464916,0.0002698407,0.00082406035,0.00021294334,0.00018761471,0.0013763851,0.0015905093,0.00006772518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031110514,0.00013403394,0.000031111325,0.000026349486,0.00011201072,0.00038008628,0.0004554145,0.972465,0.00009667974,0.009248247,0.0023882065,0.014631749],"study_design_scores_gemma":[0.00047217988,0.00026095228,0.000063191546,0.00035143454,0.00003246601,0.0000379258,0.000020806414,0.9807024,0.0006456438,0.016543679,0.000128212,0.0007411266],"about_ca_topic_score_codex":0.00009343641,"about_ca_topic_score_gemma":0.0000017787014,"teacher_disagreement_score":0.8509774,"about_ca_system_score_codex":0.0003265824,"about_ca_system_score_gemma":0.00033250704,"threshold_uncertainty_score":0.9995605},"labels":[],"label_agreement":null},{"id":"W6892056611","doi":"10.48550/arxiv.quant-ph/0111032","title":"Adiabatic Quantum Computation and Deutsch's Algorithm","year":2001,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Adiabatic quantum computation; Adiabatic process; Quantum algorithm; Quantum computer; Computation; Quantum phase estimation algorithm; Quantum","score_opus":0.0364661839679679,"score_gpt":0.18726049393817848,"score_spread":0.1507943099702106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6892056611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22660835,0.00017317198,0.7715693,0.00016837221,0.0006015241,0.00020092262,0.00000972956,0.0003423036,0.0003262892],"genre_scores_gemma":[0.951391,0.00019782092,0.047812,0.00013648877,0.00015985685,6.7713273e-7,0.00002141971,0.000024935813,0.00025579578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977473,0.00017985867,0.00023606156,0.0012697252,0.00012379716,0.00044323865],"domain_scores_gemma":[0.9984742,0.0001800475,0.00025840593,0.0007145096,0.00012547149,0.0002473568],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025116862,0.00040163883,0.00040272658,0.00033104423,0.00027130122,0.0002686112,0.0010980426,0.00026714092,0.0000063892485],"category_scores_gemma":[0.000020345262,0.00044503383,0.00015327557,0.00059180165,0.00013121561,0.00022489218,0.0019400961,0.00074998196,0.00003497941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062051486,0.00009324864,0.0005163888,0.00009201575,0.00009986409,0.00069228996,0.00045388562,0.8509104,0.0000059540694,0.033691205,0.00024794153,0.11319059],"study_design_scores_gemma":[0.00035354725,0.00007084157,0.001379823,0.00011142476,0.000038366856,0.00004849897,0.00002555601,0.9131645,0.0000074581726,0.084034435,0.000305987,0.00045958423],"about_ca_topic_score_codex":0.00015923232,"about_ca_topic_score_gemma":0.000009546477,"teacher_disagreement_score":0.72478265,"about_ca_system_score_codex":0.000088064255,"about_ca_system_score_gemma":0.00014651543,"threshold_uncertainty_score":0.99980015},"labels":[],"label_agreement":null},{"id":"W6892661893","doi":"10.5281/zenodo.10792030","title":"FIGURE 3 in Parachaetocladius lenferringtoni (Diptera: Chironomidae), a new orthoclad from North America, with keys to adult males and pupae of the Nearctic Parachaetocladius (Wülker, 1959)","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Nearctic ecozone; Pupa; Blunt; Scale (ratio)","score_opus":0.011910310205604928,"score_gpt":0.2083244113629861,"score_spread":0.19641410115738117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6892661893","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2757468,0.0111041805,0.113147065,0.028415903,0.002980763,0.013282778,0.004357128,0.0090337545,0.5419316],"genre_scores_gemma":[0.6236497,0.0010003904,0.05619228,0.0029640903,0.0029679905,0.000003290735,0.0021603603,0.021900848,0.28916106],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99741507,0.00028336098,0.00035853504,0.0009905845,0.0004612732,0.0004912051],"domain_scores_gemma":[0.99829096,0.000038122726,0.00023935016,0.0010429729,0.000114710805,0.00027389525],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015808489,0.00038367105,0.0004232029,0.0004449897,0.00039070545,0.0007298165,0.0021306516,0.00012564012,0.0010607713],"category_scores_gemma":[0.00012462621,0.0002961816,0.000084721076,0.0011290656,0.00022348718,0.00011067591,0.0024978179,0.00073034223,0.0014306263],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011840651,0.00020667838,0.0003931882,0.0004790624,0.00032996718,0.0001757677,0.008637659,0.0031814054,0.000093404495,0.002288387,0.51342976,0.47066632],"study_design_scores_gemma":[0.0005020888,0.00033938384,0.004891835,0.0007894663,0.000029925644,0.00006904605,0.000052962143,0.0086058825,0.000023136956,0.00026369336,0.9839951,0.00043746998],"about_ca_topic_score_codex":0.0011366804,"about_ca_topic_score_gemma":0.000080629914,"teacher_disagreement_score":0.47056535,"about_ca_system_score_codex":0.00009450452,"about_ca_system_score_gemma":0.000034292843,"threshold_uncertainty_score":0.99994904},"labels":[],"label_agreement":null},{"id":"W6892868376","doi":"10.5281/zenodo.12385932","title":"Iso 44001 pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Audit; Standardization; Quality management system; Business process; Business process management; Quality of analytical results; Product (mathematics); Acknowledgement; Business risks; Quality management","score_opus":0.016700188006542133,"score_gpt":0.23042438722987496,"score_spread":0.21372419922333283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6892868376","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006131166,0.00064044335,0.071490474,0.00096633035,0.000602992,0.0002583508,0.00008826928,0.0038165543,0.92213047],"genre_scores_gemma":[0.0006286959,0.00013551814,0.008073455,0.00031097003,0.0011497948,3.2101088e-8,0.0004999466,0.0102935145,0.97890806],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979237,0.00020358147,0.0002059707,0.0007910036,0.00043646342,0.00043932628],"domain_scores_gemma":[0.9986584,0.0000128505,0.000114258015,0.00091921666,0.000114343784,0.00018093629],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003824546,0.00025671793,0.0002153909,0.000520037,0.0006749224,0.0018518245,0.0027779418,0.00014939514,0.02911973],"category_scores_gemma":[0.00009957559,0.00024710025,0.00009799155,0.0006696463,0.00010547482,0.00008406785,0.0031331237,0.00057192816,0.17992836],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013557807,0.000030908563,1.6861224e-8,0.00009585841,0.000039747967,0.000047265214,0.00025658385,0.000019714598,0.000034752018,0.006847502,0.86449045,0.12813582],"study_design_scores_gemma":[0.00013214648,0.00010375389,0.0000028630534,0.00018490676,0.000009701963,0.00017680423,0.000012496878,0.009615959,0.000014593723,0.0010715484,0.98839796,0.00027728072],"about_ca_topic_score_codex":0.000020572614,"about_ca_topic_score_gemma":2.6291784e-7,"teacher_disagreement_score":0.15080863,"about_ca_system_score_codex":0.000064279506,"about_ca_system_score_gemma":0.000005257278,"threshold_uncertainty_score":0.99999815},"labels":[],"label_agreement":null},{"id":"W6893255033","doi":"10.5281/zenodo.14758712","title":"Conscience January 2025 Policy Brief - Quantum Computing as a Pathway to Develop Drugs for Undruggable Proteins","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Quantum computer; Drug discovery; Quantum; Drug development","score_opus":0.016663816352133418,"score_gpt":0.2622488710507373,"score_spread":0.24558505469860387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893255033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017812302,0.00006234471,0.93190783,0.009929225,0.0002941976,0.0014525562,0.00006884108,0.0013799316,0.037092794],"genre_scores_gemma":[0.8499514,0.000020353626,0.13316528,0.0070014657,0.0005910715,0.0000010980809,0.0003161786,0.0010270245,0.007926138],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99734825,0.0002702005,0.00037201145,0.00085257,0.00042071415,0.0007362665],"domain_scores_gemma":[0.9978027,0.00012582437,0.00010541102,0.00071182725,0.0009937303,0.00026053112],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013134404,0.00021956651,0.00022959492,0.0006025512,0.0036020742,0.0016778241,0.002837503,0.00006596443,0.000089485526],"category_scores_gemma":[0.002011659,0.00022519201,0.00006443578,0.0035777618,0.00015121409,0.0002612749,0.0035802873,0.00028773423,0.0009418833],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038779057,0.00015872746,0.0000018191043,0.00013481981,0.000037977552,0.000013334954,0.0046465574,0.0033222672,0.003460407,0.43002877,0.061511133,0.49664542],"study_design_scores_gemma":[0.0005119041,0.00029306475,0.0001435819,0.00015359651,0.000003794872,0.00005216257,0.00016791058,0.16361354,0.0018860265,0.0051040407,0.82778305,0.00028730195],"about_ca_topic_score_codex":0.000116150186,"about_ca_topic_score_gemma":6.0175785e-7,"teacher_disagreement_score":0.8321391,"about_ca_system_score_codex":0.00019418399,"about_ca_system_score_gemma":0.00014158973,"threshold_uncertainty_score":0.999836},"labels":[],"label_agreement":null},{"id":"W6893256259","doi":"10.5281/zenodo.15867661","title":"QIRT Meta-Floor Protocol","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"IBM; Quantum; Error detection and correction; Protocol (science); Benchmark (surveying); Quantum computer; Transparency (behavior); IBM PC compatible","score_opus":0.03212781097444296,"score_gpt":0.27098636408262106,"score_spread":0.2388585531081781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893256259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073084934,0.000057349676,0.79539376,0.006146331,0.00025880523,0.017502667,0.000036976937,0.0035364185,0.17633685],"genre_scores_gemma":[0.59263605,0.0000536911,0.32684442,0.015484036,0.0024645352,0.00022604046,0.0012844082,0.009894329,0.05111246],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983097,0.0003001197,0.00023324981,0.0005057425,0.0003013256,0.00034988995],"domain_scores_gemma":[0.9987366,0.000025053776,0.00007558744,0.00072143186,0.00033061317,0.000110702975],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00067198015,0.00015133564,0.00018349089,0.00026350928,0.0018947171,0.0012368888,0.0023045654,0.000047813573,0.0016765345],"category_scores_gemma":[0.00025248612,0.00013092,0.00010494871,0.00099528,0.00008461972,0.00021680526,0.0023884908,0.00028011852,0.0021976],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026118194,0.00021780276,7.8669405e-7,0.00012227084,0.0003082289,0.000025452971,0.00068648346,0.00097299245,0.001145259,0.08311177,0.1792553,0.7341275],"study_design_scores_gemma":[0.00036885837,0.00011287109,0.0001287143,0.00001881936,0.000022457198,0.000042643565,0.000013143745,0.035800997,0.00060990144,0.002254801,0.96048945,0.00013733467],"about_ca_topic_score_codex":0.000008064513,"about_ca_topic_score_gemma":6.932367e-8,"teacher_disagreement_score":0.78123415,"about_ca_system_score_codex":0.000052994794,"about_ca_system_score_gemma":0.000007689719,"threshold_uncertainty_score":0.9997999},"labels":[],"label_agreement":null},{"id":"W6893764616","doi":"10.5281/zenodo.4540530","title":"Supplementary material for \"Experimental accreditation of outputs of noisy quantum computers\"","year":2021,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Accreditation; Preprint; Quantum; Noise (video); Noisy data","score_opus":0.021859652334392184,"score_gpt":0.25025589212201327,"score_spread":0.22839623978762108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893764616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34270686,0.00008556921,0.6506435,0.0013153356,0.0010933874,0.0005944076,0.0022804847,0.00034765762,0.0009327869],"genre_scores_gemma":[0.9578109,0.0000061728865,0.038705282,0.00007533836,0.00018304634,5.5983104e-8,0.0029389316,0.0002532627,0.000027020986],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986233,0.0001800225,0.0003229937,0.0003426008,0.000297958,0.00023310972],"domain_scores_gemma":[0.9988418,0.000048562608,0.00016422731,0.00037624824,0.0004940621,0.00007507318],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034910563,0.000109559056,0.00017710341,0.00013120224,0.0005067124,0.00024526753,0.00092977803,0.000035753797,0.0009141671],"category_scores_gemma":[0.00009610948,0.00011642101,0.00007535213,0.00033516524,0.00007948891,0.00014972876,0.0012248432,0.00008240844,0.000025534418],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002497845,0.0012718791,0.000009283169,0.0005555179,0.00022317836,0.00003961053,0.011141733,0.00237229,0.5214713,0.13092685,0.14213762,0.18960094],"study_design_scores_gemma":[0.0020405345,0.001475296,0.0004704552,0.00011394289,0.000019902545,0.00016429467,0.0005950092,0.17036724,0.37479675,0.0016085114,0.44798142,0.0003666432],"about_ca_topic_score_codex":0.000013874378,"about_ca_topic_score_gemma":1.2110303e-7,"teacher_disagreement_score":0.615104,"about_ca_system_score_codex":0.000039096216,"about_ca_system_score_gemma":0.000009716736,"threshold_uncertainty_score":0.9999991},"labels":[],"label_agreement":null},{"id":"W6894089791","doi":"10.5281/zenodo.8110954","title":"Criorhina pachymera","year":2020,"lang":"fr","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cégep de Rivière-du-Loup","funders":"","keywords":"Confusion; Identification (biology); Context (archaeology); Period (music)","score_opus":0.04694914012990106,"score_gpt":0.24072657077066176,"score_spread":0.1937774306407607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6894089791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010555264,0.0047497596,0.63909966,0.2050519,0.001990841,0.00090384175,0.0004390838,0.004160841,0.13304883],"genre_scores_gemma":[0.931528,0.00077021285,0.031980954,0.012863265,0.005833916,5.0460958e-8,0.0011314616,0.0064065857,0.009485588],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968518,0.0006744201,0.00035247457,0.0008530856,0.0005415131,0.00072670815],"domain_scores_gemma":[0.9980616,0.000044415483,0.00014442872,0.0006263082,0.0005183237,0.0006049532],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005950891,0.00026828877,0.0002478882,0.00012556463,0.0030268985,0.0028082056,0.0026525406,0.00011268911,0.007678677],"category_scores_gemma":[0.0006777108,0.00029805745,0.00012529005,0.0012100026,0.0002848048,0.00047717697,0.0035856948,0.0007186917,0.01909721],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019250047,0.00011404529,7.23155e-7,0.00013156288,0.00004174721,0.00011198547,0.0074786833,0.0013318103,0.0008389682,0.03153361,0.27854633,0.6798513],"study_design_scores_gemma":[0.00034827692,0.00048313304,0.00012123686,0.00006325814,0.000012872647,0.00028003857,0.00009412196,0.1867665,0.00018273278,0.0005457514,0.8108286,0.00027343893],"about_ca_topic_score_codex":0.000030184194,"about_ca_topic_score_gemma":7.541714e-8,"teacher_disagreement_score":0.9209727,"about_ca_system_score_codex":0.0000864182,"about_ca_system_score_gemma":0.000011169279,"threshold_uncertainty_score":0.99994713},"labels":[],"label_agreement":null},{"id":"W6901719961","doi":"10.60692/a9xsp-rzd45","title":"A Brief Review on Mathematical Tools Applicable to Quantum Computing for Modelling and Optimization Problems in Engineering","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Quantum computer; Variety (cybernetics); Mathematical problem; Quantum; Perspective (graphical); Quantum information science; Quantum technology; Laplace transform","score_opus":0.031821970963328644,"score_gpt":0.21279163228955117,"score_spread":0.18096966132622253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901719961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014523159,0.000025511414,0.9838335,0.00013153376,0.000094000716,0.0011513795,0.000013714551,0.00018531816,0.00004187551],"genre_scores_gemma":[0.8079353,6.0048404e-7,0.1912759,0.00046307204,0.000027375881,0.00027476525,0.00000795743,0.000010681755,0.0000043777827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987407,0.000037113386,0.0005218259,0.00021377418,0.0002445375,0.000242102],"domain_scores_gemma":[0.9994485,0.000039420313,0.00014589347,0.00025132034,0.0000477442,0.00006715581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008090068,0.000140343,0.00024703774,0.00021853889,0.00018792742,0.0002270285,0.000275658,0.00002553523,0.0000011326682],"category_scores_gemma":[0.000013698722,0.00012858582,0.000038596212,0.0004123239,0.0000035473822,0.00027024237,0.00023050208,0.00012528371,0.0000070371693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000273283,0.0000021178514,0.000034149998,0.0015716412,0.0000033518252,4.3359287e-7,0.008598107,0.9854362,1.5496444e-7,0.0030468337,0.00000769075,0.0012965603],"study_design_scores_gemma":[0.00028752172,0.00007572428,0.000023722483,0.0011919776,0.0000030516119,0.000036953286,0.00017946478,0.9978315,0.000003503444,0.000017006405,0.00019885304,0.0001506946],"about_ca_topic_score_codex":0.0000015684157,"about_ca_topic_score_gemma":5.8412892e-9,"teacher_disagreement_score":0.7934121,"about_ca_system_score_codex":0.00007721684,"about_ca_system_score_gemma":0.000017094315,"threshold_uncertainty_score":0.52435774},"labels":[],"label_agreement":null},{"id":"W6910464542","doi":"10.48550/arxiv.1206.1035","title":"Gaussian quantum computation with oracle-decision problems","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Gaussian; Quantum computer; Modulation (music); Computation; Quantum; Encoding (memory); Gaussian random field; Quantum information; Gaussian process","score_opus":0.042785580899186465,"score_gpt":0.19259490681265684,"score_spread":0.14980932591347038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910464542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25870702,0.0000949338,0.7392729,0.0001424199,0.0006340006,0.0002928946,0.0000059545305,0.00042181215,0.00042809217],"genre_scores_gemma":[0.96907926,0.000031390944,0.03045149,0.000068196925,0.00016460546,9.557062e-7,0.000020392508,0.000034915418,0.00014882136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975077,0.00016517534,0.0002624841,0.0012685604,0.00021661563,0.00057944603],"domain_scores_gemma":[0.99787074,0.00016910468,0.0003983536,0.0010950562,0.00017709576,0.00028967322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035625737,0.0004624252,0.00041754436,0.00033204144,0.00030394812,0.00026676225,0.001645119,0.0003939106,0.000010226905],"category_scores_gemma":[0.000013500892,0.00041412108,0.00016692613,0.000804072,0.00011688889,0.00039096602,0.001806317,0.0012339628,0.00008355365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002548996,0.00013130611,0.00087924453,0.000081648854,0.000057701025,0.00014976796,0.00049204833,0.948962,0.00000587681,0.032826416,0.00012373898,0.016264772],"study_design_scores_gemma":[0.0004808898,0.00011759073,0.0025990475,0.00033866617,0.00004172837,0.000032727152,0.000022663862,0.9513406,0.000015169887,0.043951284,0.0004935869,0.0005660336],"about_ca_topic_score_codex":0.00012070109,"about_ca_topic_score_gemma":0.000019770105,"teacher_disagreement_score":0.7103722,"about_ca_system_score_codex":0.00013456479,"about_ca_system_score_gemma":0.00019374384,"threshold_uncertainty_score":0.9998311},"labels":[],"label_agreement":null},{"id":"W6910682980","doi":"10.48550/arxiv.quant-ph/0611054","title":"Negative weights make adversaries stronger","year":2006,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Upper and lower bounds; Function (biology); Monotone polygon; Adversary; Property (philosophy); Square (algebra); Quantum; Property testing","score_opus":0.027429360682914558,"score_gpt":0.1729595446119303,"score_spread":0.14553018392901573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910682980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34830534,0.00010922793,0.64533967,0.00020280534,0.0010027786,0.00022420209,0.000030240035,0.0004894201,0.004296319],"genre_scores_gemma":[0.9766622,0.00001852744,0.019927181,0.00008851255,0.00026133662,6.3921243e-7,0.000020034751,0.000023319524,0.0029982436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757326,0.00016223623,0.000220147,0.0013711161,0.0001474743,0.00052574027],"domain_scores_gemma":[0.997958,0.00017276198,0.00028406695,0.0012722448,0.0001499753,0.00016293074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014585762,0.0004603526,0.00041073273,0.00028794957,0.00036703044,0.00023551416,0.0021421907,0.00030315798,0.000016063866],"category_scores_gemma":[0.000017843719,0.00047603177,0.00030279654,0.000530513,0.00019855096,0.00019239282,0.0027869616,0.00093405036,0.00006788735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028075601,0.00014482619,0.0014709218,0.0000766719,0.0001754951,0.000823878,0.00079922343,0.7948753,0.0000042738493,0.19104691,0.0012443431,0.009310041],"study_design_scores_gemma":[0.00035807624,0.00005684586,0.003064733,0.00008882236,0.0000392387,0.0000066905664,0.000024119221,0.8865024,0.000096215845,0.107595585,0.001617414,0.0005498542],"about_ca_topic_score_codex":0.0004898792,"about_ca_topic_score_gemma":0.00009508396,"teacher_disagreement_score":0.6283569,"about_ca_system_score_codex":0.00015118341,"about_ca_system_score_gemma":0.00023476037,"threshold_uncertainty_score":0.99976915},"labels":[],"label_agreement":null},{"id":"W6910734651","doi":"10.48550/arxiv.quant-ph/0302198","title":"Quantum Computers and Decoherence: Exorcising the Demon from the Machine","year":2003,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Realization (probability); Quantum computer; Qubit; Quantum decoherence; Quantum error correction; Quantum; Decoherence-free subspaces; Encoding (memory); Overhead (engineering)","score_opus":0.039216861041658294,"score_gpt":0.1811204420356634,"score_spread":0.14190358099400513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910734651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4497192,0.0006416459,0.54729515,0.0009109204,0.0009213178,0.00021702511,0.000011975872,0.00012909518,0.00015366769],"genre_scores_gemma":[0.99347657,0.00019959158,0.0053052623,0.00074109196,0.00013973552,5.394526e-7,0.000008274209,0.000018195822,0.000110717265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767786,0.00044742567,0.00021539241,0.0011221172,0.00013895005,0.00039824404],"domain_scores_gemma":[0.9971757,0.0008553033,0.00026544958,0.0015055428,0.00006753612,0.00013048942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045760797,0.00039212866,0.0003219085,0.00007326887,0.00071246683,0.00046945873,0.0027692069,0.00019083534,0.00000805739],"category_scores_gemma":[0.00003732478,0.00025905523,0.0001728883,0.0004370571,0.0002630646,0.0001276615,0.002815876,0.0011371396,0.000014101152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003115232,0.00011232329,0.009155983,0.000050247676,0.00035605583,0.0004582917,0.0031853986,0.82228255,0.0000322435,0.12749937,0.0028349792,0.0340014],"study_design_scores_gemma":[0.00024353947,0.000027464206,0.0051192404,0.000110318375,0.0000449148,0.000016795659,0.00005423074,0.91767675,0.000012896617,0.075460404,0.0009140673,0.00031938098],"about_ca_topic_score_codex":0.0007398529,"about_ca_topic_score_gemma":0.00007295895,"teacher_disagreement_score":0.5437574,"about_ca_system_score_codex":0.000057890487,"about_ca_system_score_gemma":0.00011956646,"threshold_uncertainty_score":0.9999862},"labels":[],"label_agreement":null},{"id":"W6910805893","doi":"10.48550/arxiv.quant-ph/0210161","title":"Quantum Walks driven by many coins","year":2002,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Random walk; Limit (mathematics); Quantum; Class (philosophy); Heterogeneous random walk in one dimension; Quantum system; Discrete time and continuous time","score_opus":0.03578525129603972,"score_gpt":0.17449843203790558,"score_spread":0.13871318074186587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910805893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25668174,0.00018312187,0.73852813,0.0004917198,0.0011305965,0.00026561832,0.000051306848,0.0006688043,0.0019989342],"genre_scores_gemma":[0.9933503,0.00018745045,0.0028118696,0.00020804552,0.00015327736,7.181413e-7,0.000021147072,0.000033410477,0.003233757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971342,0.00017507152,0.00026354054,0.0016201101,0.00016878312,0.00063826534],"domain_scores_gemma":[0.9974883,0.0001162418,0.00029858205,0.0016942647,0.0001094076,0.0002931893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016583427,0.00050416484,0.0004780038,0.00026364852,0.0003033,0.0002387826,0.0032217833,0.00038963096,0.000061045415],"category_scores_gemma":[0.000018826264,0.0005560515,0.00033697512,0.0005819151,0.00014388599,0.00019607574,0.003237836,0.0012090614,0.00024015056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012510199,0.00032742592,0.0007816694,0.0001346142,0.00020337326,0.0012145551,0.00073487085,0.83812314,0.0001042715,0.13535894,0.01782471,0.0051799],"study_design_scores_gemma":[0.00037223383,0.00007335783,0.00028933698,0.00009656482,0.00003036293,0.00001722247,0.000015010192,0.9743993,0.0000434379,0.017818732,0.0062037483,0.0006406656],"about_ca_topic_score_codex":0.00013996224,"about_ca_topic_score_gemma":0.000008636173,"teacher_disagreement_score":0.7366686,"about_ca_system_score_codex":0.00015492036,"about_ca_system_score_gemma":0.0001030435,"threshold_uncertainty_score":0.9996891},"labels":[],"label_agreement":null},{"id":"W6912006429","doi":"10.5281/zenodo.15263815","title":"Christ-Centered Quantum Contro :Ultra-High-Fidelity State Preparation with Resonance Optimization","year":2025,"lang":"en","type":"preprint","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum; Quantum computer; Coherence (philosophical gambling strategy); Quantum decoherence; Decoherence-free subspaces; State (computer science); Intersection (aeronautics); Path (computing); Quantum system; Quantum state","score_opus":0.01835015450084519,"score_gpt":0.24363319447690815,"score_spread":0.22528303997606297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6912006429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067548584,0.00028255387,0.98175424,0.0012225354,0.00042679766,0.0010922246,0.0005240011,0.0018715644,0.0060711936],"genre_scores_gemma":[0.8984572,0.0005602676,0.09130313,0.0006268656,0.00045418733,0.0000010350924,0.00577754,0.0014814544,0.001338266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961845,0.0007423745,0.0005721401,0.0012918141,0.0006600813,0.0005490467],"domain_scores_gemma":[0.9966824,0.000060072914,0.00044575287,0.0014346135,0.0011888575,0.00018830254],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009292226,0.00038618388,0.00039612176,0.0003374486,0.0018721056,0.0022894654,0.0027768593,0.00015508845,0.00022781346],"category_scores_gemma":[0.00033758383,0.0003724137,0.000093097464,0.0007284699,0.00015784363,0.00032504273,0.003038609,0.00085259916,0.0001940932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034307668,0.0003376392,0.0000030120468,0.00038599793,0.00014743344,0.000040853167,0.002810369,0.8121073,0.00026650383,0.012699153,0.02727432,0.14358433],"study_design_scores_gemma":[0.000903974,0.0003826411,0.00023331775,0.00038565462,0.000020701804,0.00004957296,0.000024101768,0.83755475,0.00030023052,0.0015115187,0.15817657,0.00045693698],"about_ca_topic_score_codex":0.0000951234,"about_ca_topic_score_gemma":0.000001522126,"teacher_disagreement_score":0.8917024,"about_ca_system_score_codex":0.00023277878,"about_ca_system_score_gemma":0.00004663074,"threshold_uncertainty_score":0.9998728},"labels":[],"label_agreement":null},{"id":"W6912988615","doi":"10.5281/zenodo.7087715","title":"Data for \"Single-shot quantum error correction with the three-dimensional subsystem toric code\".","year":2022,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Error detection and correction; Quantum; Quantum error correction; Quantum computer; Quantum algorithm","score_opus":0.06852157068804586,"score_gpt":0.25238313957543496,"score_spread":0.18386156888738908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6912988615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042552345,0.00028501762,0.93499494,0.009331726,0.0024709813,0.0019002177,0.0013181187,0.0024888492,0.004657789],"genre_scores_gemma":[0.99330026,0.0000018006416,0.0030965463,0.00035998927,0.00036811695,4.6739783e-7,0.0016778812,0.0007267638,0.00046815907],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977695,0.0003886725,0.00020285613,0.0006631491,0.0006044258,0.00037143304],"domain_scores_gemma":[0.9981143,0.00011210417,0.00015902943,0.0012034513,0.0003136106,0.000097512224],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012683328,0.0001507869,0.00013939376,0.00013317606,0.0059442143,0.00074951415,0.0034526077,0.000025600855,0.00030811192],"category_scores_gemma":[0.00014792358,0.00011549745,0.00004041977,0.000837253,0.00008841963,0.0002520699,0.0040402585,0.00035728625,0.00014528856],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026830717,0.00046641435,0.0000058265778,0.000086030836,0.00012247122,0.000044388747,0.0018659503,0.04916336,0.0026129622,0.011853418,0.7457625,0.18774834],"study_design_scores_gemma":[0.0002634673,0.0004853219,0.00006214277,0.000010384839,0.000007082505,0.0004139523,0.00011886352,0.48254436,0.000036889054,0.00008860213,0.5158521,0.00011681921],"about_ca_topic_score_codex":0.000020143683,"about_ca_topic_score_gemma":0.0000040254286,"teacher_disagreement_score":0.9507479,"about_ca_system_score_codex":0.00013196153,"about_ca_system_score_gemma":0.000013981677,"threshold_uncertainty_score":0.9953499},"labels":[],"label_agreement":null},{"id":"W69190861","doi":"10.1007/978-3-642-36315-3_9","title":"Reversible and Quantum Circuit Optimization: A Functional Approach","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Quantum; Electronic circuit; Quantum circuit; Influence diagram; Function (biology); Quantum computer; Algorithm; Theoretical computer science; Quantum network; Quantum mechanics; Physics; Artificial intelligence","score_opus":0.01949762001306499,"score_gpt":0.2073915555210317,"score_spread":0.1878939355079667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69190861","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000459938,0.00066023617,0.9920796,0.0006255054,0.0013052305,0.00036740108,0.0000032389078,0.00021663774,0.004696138],"genre_scores_gemma":[0.020635474,0.00006046835,0.97630286,0.0012922442,0.00079622987,0.0000124855505,0.000012883315,0.0000461148,0.000841263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617565,0.000038342212,0.00044491855,0.0017896332,0.0009111117,0.0006403485],"domain_scores_gemma":[0.9979224,0.00027535434,0.0002527623,0.0010681499,0.0002416929,0.00023959098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060490274,0.0005534802,0.00050637126,0.0007614618,0.00045553697,0.0008554851,0.0018545832,0.0003198689,0.000054475782],"category_scores_gemma":[0.000049675225,0.0004939333,0.00011088022,0.00064508565,0.00065289834,0.0005571434,0.0014422315,0.00091696926,0.000034010616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017944251,0.000024102455,0.000013119739,0.000044825945,0.0000122250885,0.000016879812,0.00034826994,0.7244582,0.000010766095,0.043983508,0.00009609291,0.23099022],"study_design_scores_gemma":[0.00021490722,0.00009658334,0.000065688815,0.00015413477,0.0000060503276,0.00024290722,1.6020195e-7,0.904982,0.000018844588,0.09301639,0.0006704691,0.0005319071],"about_ca_topic_score_codex":0.000018322444,"about_ca_topic_score_gemma":0.0000019071214,"teacher_disagreement_score":0.2304583,"about_ca_system_score_codex":0.00013913629,"about_ca_system_score_gemma":0.0004173313,"threshold_uncertainty_score":0.9997512},"labels":[],"label_agreement":null},{"id":"W6920384794","doi":"10.60692/jtfba-egz85","title":"A New Perspective on the Average Mixing Matrix","year":2018,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mixing (physics); Centralizer and normalizer; Adjacency matrix; Quantum walk; Matrix (chemical analysis); Rank (graph theory); Diagonal; Projection (relational algebra); Diagonal matrix; Automorphism","score_opus":0.017409491061748075,"score_gpt":0.22358226864619388,"score_spread":0.2061727775844458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920384794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08668465,0.0000020128432,0.9015144,0.0011885369,0.000738885,0.00022148043,0.0000050258936,0.00039646096,0.009248511],"genre_scores_gemma":[0.9904298,1.2506742e-8,0.008410237,0.0005252881,0.00038742332,0.000003599584,3.9800815e-7,0.0000049169184,0.00023829349],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989353,0.00008957495,0.00026128005,0.00017067984,0.00030859807,0.00023456126],"domain_scores_gemma":[0.99902725,0.000028202754,0.00016729716,0.00054539245,0.0001545216,0.000077361496],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042133455,0.0001451782,0.00011802002,0.00014884333,0.00037086607,0.00052664935,0.0006353249,0.000047017325,0.00001304478],"category_scores_gemma":[0.000027797041,0.000086603824,0.00006776778,0.00034375212,0.000024882316,0.0003880237,0.00016086645,0.00013412043,0.0015544996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047245718,0.000002693533,0.0009519645,0.000059178088,0.0000714658,0.000009254771,0.743097,0.0032553962,0.0000036040944,0.24381629,0.0024766647,0.006209213],"study_design_scores_gemma":[0.00073613017,0.00025686919,0.005448093,0.00026762966,0.0000075434286,0.00015448817,0.00955983,0.97925436,0.001208576,0.00022401656,0.0024923075,0.00039015227],"about_ca_topic_score_codex":0.000020443875,"about_ca_topic_score_gemma":9.015021e-8,"teacher_disagreement_score":0.975999,"about_ca_system_score_codex":0.00010033793,"about_ca_system_score_gemma":0.000054186643,"threshold_uncertainty_score":0.99922293},"labels":[],"label_agreement":null},{"id":"W6923969687","doi":"10.14288/1.0214850","title":"[Bookplate by University of British Columbia]","year":2006,"lang":"en","type":"other","venue":"Open Collections","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Base (topology); Shield","score_opus":0.0044079287475522295,"score_gpt":0.1821355391476097,"score_spread":0.17772761040005747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6923969687","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000033195204,0.00019293955,0.055177063,0.000028913995,0.000303528,0.0002958815,0.0007711486,0.00016807279,0.94305915],"genre_scores_gemma":[0.000009924563,0.00003486219,0.020736557,0.000016372604,0.00004434456,0.0000013454546,0.000017839122,0.000055364326,0.9790834],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921393,0.0000536036,0.00010139719,0.00036296542,0.00010691094,0.00016118799],"domain_scores_gemma":[0.99938047,0.00002842463,0.00014841098,0.00035925565,0.000032349682,0.0000510604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000066170905,0.0000868905,0.00023759494,0.00004239248,0.000674785,0.0009176293,0.0012891915,0.0001277925,0.00047652083],"category_scores_gemma":[0.000002544613,0.00016128317,0.00006903859,0.00074840954,0.000060638606,0.000053018317,0.0005719601,0.00015977082,0.000007936406],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.049866e-7,0.000064852655,0.0000018931919,0.000007774038,0.00002665878,0.000011390358,0.00001035091,0.00004517371,0.0000011410065,0.0000062711447,0.9941425,0.005681734],"study_design_scores_gemma":[0.0002682248,0.000039118513,0.000017252427,0.00012388578,0.0000100092875,0.00003005248,0.0000054392835,0.0072756843,7.9315413e-7,0.0003238331,0.99172753,0.00017818395],"about_ca_topic_score_codex":0.7405207,"about_ca_topic_score_gemma":0.51535463,"teacher_disagreement_score":0.22516608,"about_ca_system_score_codex":0.000028715727,"about_ca_system_score_gemma":0.00016079644,"threshold_uncertainty_score":0.884872},"labels":[],"label_agreement":null},{"id":"W6924863299","doi":"10.15468/dl.z4e4r9","title":"Occurrence Download","year":2022,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Matching (statistics); Range (aeronautics); Set (abstract data type); Data set","score_opus":0.010377432967200338,"score_gpt":0.20821663337724752,"score_spread":0.19783920041004718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924863299","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001030883,0.000025021864,0.0005658811,0.00035360566,0.0013028325,0.00020652538,0.9971663,0.00023811788,0.000038651982],"genre_scores_gemma":[0.0000031018312,0.000019943005,0.000036248384,0.000809919,0.000001685543,0.000003421827,0.9991256,9.4926325e-9,6.51343e-8],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99806947,0.00011760968,0.000356354,0.00036316487,0.00073086366,0.0003625185],"domain_scores_gemma":[0.9984226,0.000032517266,0.00032009906,0.0009363919,0.00012755244,0.00016080817],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00034995057,0.00029568485,0.0002643521,0.00012471342,0.00066927954,0.00035682044,0.0022428348,0.00017282549,0.0053690635],"category_scores_gemma":[0.000071426155,0.00030169665,0.00017855104,0.00062726106,0.000088485715,0.00088441366,0.0022176078,0.000552296,0.027874282],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062099843,0.000030083795,0.000042542444,0.00005640468,0.000016780807,0.000006493919,0.00007172777,0.00041958925,7.559231e-9,7.3068526e-7,0.98978615,0.009563266],"study_design_scores_gemma":[0.0001993014,0.00005861704,0.000022595674,0.000001185763,0.000011606817,0.000020788837,0.000024094852,0.000051390336,5.4457e-7,0.0000047946073,0.9992817,0.00032336812],"about_ca_topic_score_codex":0.00027881793,"about_ca_topic_score_gemma":0.0000026377054,"teacher_disagreement_score":0.02250522,"about_ca_system_score_codex":0.00026082018,"about_ca_system_score_gemma":0.00021333584,"threshold_uncertainty_score":0.9999435},"labels":[],"label_agreement":null},{"id":"W6925560426","doi":"10.17895/ices.pub.25244098.v1","title":"Atlantic Cod Stock: A review of its current status and possible solutions for strategic fisheries management","year":2008,"lang":"en","type":"other","venue":"Open MIND","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Stock (firearms); Stock assessment; Endangered species; Fisheries management; Marine fisheries; Wildlife","score_opus":0.06590011343357152,"score_gpt":0.3120458868769111,"score_spread":0.24614577344333957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925560426","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088501483,0.56452084,0.07004394,0.0014748998,0.0020398167,0.011439996,0.0007796367,0.00007165272,0.34874424],"genre_scores_gemma":[0.0005422791,0.31230888,0.4539633,0.00016424045,0.0003840053,0.00029865614,0.00034260956,0.00030641755,0.2316896],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870384,0.000045293713,0.00025832147,0.00046155514,0.0001790917,0.00035190835],"domain_scores_gemma":[0.9991631,0.000033152424,0.00025902808,0.00041997922,0.000042326643,0.00008242631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018400197,0.00021427732,0.00040631945,0.000108887536,0.00012446017,0.0001449183,0.00079956825,0.00005446785,0.00018428525],"category_scores_gemma":[0.0000069539524,0.00018013135,0.00006935856,0.00019920433,0.000056067773,0.000064599255,0.00077090296,0.00011699796,0.000019006073],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069347143,0.00020076896,0.000018522283,0.010597544,0.00018479931,0.000022540007,0.00033494638,0.000037206704,0.0000022239374,0.0029357455,0.21036628,0.7752925],"study_design_scores_gemma":[0.00038728732,0.00013319185,0.000038120907,0.012943474,0.000055432687,0.000019504385,0.00001041241,0.012021269,0.0000033117883,0.00021885971,0.97387433,0.00029478804],"about_ca_topic_score_codex":0.00003568697,"about_ca_topic_score_gemma":0.000034630357,"teacher_disagreement_score":0.7749977,"about_ca_system_score_codex":0.000013855214,"about_ca_system_score_gemma":0.00014242329,"threshold_uncertainty_score":0.7345543},"labels":[],"label_agreement":null},{"id":"W6926127816","doi":"10.25316/ir-11530","title":"Nanaimo Free Press [Saturday, November 9, 1895]","year":2019,"lang":"en","type":"other","venue":"VIUSpace (Vancouver Island University Library)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.005533544625731077,"score_gpt":0.17555491369433715,"score_spread":0.17002136906860607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926127816","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010752973,0.0005130387,0.029332433,0.00094349677,0.0029842411,0.0003933419,0.0002051269,0.001318256,0.9642993],"genre_scores_gemma":[0.00011105466,0.00019946929,0.021729676,0.0003087241,0.00049755763,5.231368e-7,0.000006650779,0.00026415286,0.9768822],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975062,0.00013332449,0.00016650971,0.0010749048,0.0004890142,0.0006300708],"domain_scores_gemma":[0.99728876,0.00010346755,0.0003197193,0.0020350455,0.000025003248,0.00022801536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000045333814,0.00059421395,0.0005833036,0.00047379755,0.00016298659,0.00024125229,0.003515992,0.0005136696,0.00030438483],"category_scores_gemma":[0.000009840695,0.0005578945,0.0002803995,0.00058473414,0.00009898704,0.00068106834,0.002485807,0.000696254,0.0001850622],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014085944,0.000055373417,0.0000069836788,0.00008630066,0.00011143472,0.00019734417,0.00023206927,0.0002599404,0.0000017171875,0.0038256585,0.99366397,0.0015451137],"study_design_scores_gemma":[0.001143964,0.00008262461,0.000015430813,0.00024757208,0.00003311908,0.0000061002365,0.000028982944,0.010030962,0.000035648955,0.00027617902,0.98734015,0.00075926393],"about_ca_topic_score_codex":0.0007156663,"about_ca_topic_score_gemma":0.034343436,"teacher_disagreement_score":0.03362777,"about_ca_system_score_codex":0.00004231201,"about_ca_system_score_gemma":0.0002264027,"threshold_uncertainty_score":0.99968725},"labels":[],"label_agreement":null},{"id":"W6929364021","doi":"10.48550/arxiv.0810.3647","title":"Exact quantum lower bound for Grover's problem","year":2008,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Upper and lower bounds; Quantum; Quantum algorithm; Oracle; Quantum information; Information theory","score_opus":0.04038816377084876,"score_gpt":0.18996618917923577,"score_spread":0.14957802540838702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929364021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23632793,0.000089837136,0.7597959,0.00024881412,0.0014766762,0.00058291556,0.000031665048,0.0004667327,0.0009795127],"genre_scores_gemma":[0.98123455,0.00016974576,0.016748825,0.00018680074,0.0003310711,0.000003104431,0.000021909733,0.0000430514,0.0012609694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971714,0.00010306012,0.0002780445,0.0016367711,0.0001428238,0.00066787016],"domain_scores_gemma":[0.99755555,0.00022276473,0.00033432705,0.001454826,0.00019812769,0.00023442357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002510876,0.0004996407,0.00048904767,0.00027040966,0.00044127702,0.00023453229,0.002464133,0.00035615143,0.0000077979485],"category_scores_gemma":[0.000030025749,0.0005331177,0.00048686686,0.0004736346,0.00015299255,0.00026023225,0.0021224828,0.0007675934,0.000041997646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006642219,0.0002951713,0.00020171316,0.00023888846,0.00019600567,0.00068482355,0.0005285871,0.8332655,0.00003073607,0.15502164,0.0051603084,0.0043102046],"study_design_scores_gemma":[0.0005291395,0.0001769902,0.00020532584,0.00011884225,0.00003220784,0.000027570313,0.0000085077245,0.8895159,0.000037151756,0.1003889,0.008340909,0.0006185942],"about_ca_topic_score_codex":0.00012304481,"about_ca_topic_score_gemma":0.000011870613,"teacher_disagreement_score":0.7449066,"about_ca_system_score_codex":0.00016504647,"about_ca_system_score_gemma":0.00037292825,"threshold_uncertainty_score":0.99971205},"labels":[],"label_agreement":null},{"id":"W6929373028","doi":"10.48550/arxiv.1706.02630","title":"A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Morphism; Categorical variable; Categorical quantum mechanics; Programming language specification; Object language; State (computer science); Quantum circuit; Type (biology); Quantum","score_opus":0.09746062245781455,"score_gpt":0.22100638926255636,"score_spread":0.12354576680474182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929373028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18688089,0.000076040196,0.8111557,0.00012469346,0.0006620115,0.00037076656,0.000032582513,0.0003359,0.0003614444],"genre_scores_gemma":[0.9919907,0.000028371556,0.0065458375,0.00006840852,0.00020125318,0.0000036220235,0.000032023305,0.000030088428,0.001099691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976673,0.000050284903,0.00023830705,0.0013647293,0.00012957877,0.0005497777],"domain_scores_gemma":[0.9973329,0.00009929763,0.00041460668,0.0017664961,0.00016629463,0.0002204455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034207263,0.00040351512,0.000433258,0.00023869064,0.0004779294,0.00043383575,0.0027296762,0.0003770223,0.000003886731],"category_scores_gemma":[0.00007136107,0.00043467636,0.0003949839,0.00015127129,0.00010175226,0.00032151028,0.0014284969,0.0007773656,0.000024642148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029555657,0.00014811411,0.000029812702,0.00014637916,0.00007808461,0.00032988028,0.0014991509,0.78555375,0.00020197338,0.20490497,0.00038041986,0.006697878],"study_design_scores_gemma":[0.00039678538,0.0000393526,0.00034127894,0.000053733704,0.000038388134,0.000011364907,0.000024670468,0.76941484,0.000029562974,0.22919406,0.00006053522,0.00039544734],"about_ca_topic_score_codex":0.00021653359,"about_ca_topic_score_gemma":0.0000381388,"teacher_disagreement_score":0.8051098,"about_ca_system_score_codex":0.0001840409,"about_ca_system_score_gemma":0.0003510956,"threshold_uncertainty_score":0.9998105},"labels":[],"label_agreement":null},{"id":"W6929379503","doi":"10.48550/arxiv.quant-ph/0602032","title":"Hamiltonian Oracles","year":2006,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Unitary state; Oracle; Geodesic; Hamiltonian (control theory); Upper and lower bounds; Hamiltonian path","score_opus":0.03491793232156112,"score_gpt":0.17353612310141248,"score_spread":0.13861819077985135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929379503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38300937,0.00008734561,0.61227405,0.0002086291,0.0007418311,0.00013866968,0.00001220402,0.0005711937,0.0029566938],"genre_scores_gemma":[0.9824374,0.00002162012,0.015541173,0.00012547926,0.00020722543,3.2801634e-7,0.000014110612,0.000021555816,0.0016311253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979272,0.00011925468,0.00018823663,0.0012176209,0.000105395455,0.00044232086],"domain_scores_gemma":[0.9980695,0.00008029916,0.00021115803,0.0013934947,0.00009646922,0.00014903926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017715822,0.0003574454,0.0003246566,0.00025574176,0.00022987294,0.00023129449,0.002415065,0.00027129732,0.00000892551],"category_scores_gemma":[0.000012181581,0.00038823602,0.00025005397,0.0005245067,0.00010432961,0.00015290284,0.0028381175,0.0007692089,0.000092654416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042882566,0.00007922904,0.0010245214,0.000047237925,0.000042846867,0.0006096196,0.00012435013,0.92726046,0.000012213785,0.060523584,0.0013304101,0.008941226],"study_design_scores_gemma":[0.00020115447,0.000029375722,0.00408821,0.00007684868,0.000019988722,0.000010349527,0.0000049411233,0.937864,0.00003924112,0.0545347,0.0026745196,0.00045666232],"about_ca_topic_score_codex":0.0003940276,"about_ca_topic_score_gemma":0.00005861682,"teacher_disagreement_score":0.599428,"about_ca_system_score_codex":0.00010323892,"about_ca_system_score_gemma":0.00017756798,"threshold_uncertainty_score":0.99985695},"labels":[],"label_agreement":null},{"id":"W6929498542","doi":"10.48550/arxiv.2507.08570","title":"Photonic processor benchmarking for variational quantum process tomography","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Photonics; Quantum computer; Dephasing; Quantum; Quantum algorithm; Noise (video); Quantum circuit; Quantum sensor; Quantum tomography","score_opus":0.031355708034188995,"score_gpt":0.2043407020705,"score_spread":0.172984994036311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929498542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07548507,0.00010386637,0.9212428,0.0002166943,0.0011801159,0.00070963724,0.0000779874,0.0003965934,0.0005872613],"genre_scores_gemma":[0.9762687,0.000024301266,0.022857456,0.00017516881,0.00023366653,0.000012611166,0.00005255873,0.000016321419,0.0003592041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744594,0.00007688237,0.0002768665,0.0015412358,0.00015011597,0.0005089311],"domain_scores_gemma":[0.99799913,0.00028198515,0.0003554786,0.0008242647,0.00040731285,0.00013184968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003564837,0.00041077568,0.00040319655,0.00053208735,0.00040758942,0.00022341506,0.0023724516,0.0003009983,0.00000828846],"category_scores_gemma":[0.000047838254,0.0004531126,0.00037192914,0.0011978658,0.00007352469,0.00021748597,0.0012235292,0.0006250149,0.0000033997785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003256931,0.00013528862,0.00050054985,0.0006554732,0.0001571607,0.000029970008,0.00047418737,0.8053345,0.0000062773415,0.19013953,0.000182695,0.0023518004],"study_design_scores_gemma":[0.00038639884,0.00006478035,0.00032459863,0.00026248666,0.000052733238,0.0000030081335,0.000015400057,0.8230294,0.00006759551,0.1749303,0.00044975308,0.0004135392],"about_ca_topic_score_codex":0.000031277763,"about_ca_topic_score_gemma":0.000010439017,"teacher_disagreement_score":0.90078366,"about_ca_system_score_codex":0.00009636235,"about_ca_system_score_gemma":0.00079370436,"threshold_uncertainty_score":0.99979204},"labels":[],"label_agreement":null},{"id":"W6930047975","doi":"10.5281/zenodo.10697955","title":"Enhancing Combinatorial Optimization with Classical and Quantum Generative Models","year":2022,"lang":"en","type":"peer-review","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantum; Generative grammar; Optimization problem; Combinatorial optimization; Quantum computer; Feature (linguistics); Representation (politics)","score_opus":0.028047574017564917,"score_gpt":0.24607198972066782,"score_spread":0.2180244157031029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930047975","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048834914,0.002638441,0.96520764,0.017045235,0.0012543707,0.00090755353,0.00030103978,0.0011578714,0.01143902],"genre_scores_gemma":[0.029547675,0.03594268,0.6722217,0.024210624,0.0155791165,0.000008981302,0.0990429,0.034588873,0.08885746],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965724,0.00075055554,0.00036854547,0.00097090524,0.00089166715,0.00044596958],"domain_scores_gemma":[0.9980695,0.000064961,0.00027976398,0.0007113926,0.0006594785,0.0002149044],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009184683,0.00033181286,0.00042626125,0.00025872976,0.0029935306,0.0012607297,0.0018324868,0.00011221094,0.0014819668],"category_scores_gemma":[0.00022891836,0.00030455683,0.00006950948,0.0007830934,0.00014923478,0.00031823106,0.0035285403,0.00096901966,0.00009543092],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003190442,0.0001655993,2.434676e-8,0.0006958378,0.00010830011,0.00006348799,0.0012273425,0.06968059,0.000037392616,0.042331394,0.8257886,0.059869517],"study_design_scores_gemma":[0.0002897791,0.0003604331,4.2947738e-7,0.0002700006,0.000020641497,0.00016420157,0.000015557605,0.38979807,0.00000985151,0.0007034979,0.60811317,0.00025436454],"about_ca_topic_score_codex":0.000014558286,"about_ca_topic_score_gemma":2.7747603e-7,"teacher_disagreement_score":0.3201175,"about_ca_system_score_codex":0.00017301698,"about_ca_system_score_gemma":0.00002981118,"threshold_uncertainty_score":0.99994063},"labels":[],"label_agreement":null},{"id":"W6930122282","doi":"10.5281/zenodo.10944266","title":"Nasarawa State University 2024/2025 (Post Utme) Admission Form,Direct Entry Screening Form Is Out Call_091–6299–3014 Or +23491–6299–3014 For More Details–Apply For Admission If You Wish To Study At The University,It's Time To Apply For The Screening Exercise 2024/2025 Session Which Now On Sale Call 091–6299–30–14.See More Details Below Or Call Office Of The Admin On How To Apply And Register Online Call 091–6299–3014 Dr.Mrs. Judith .A. A.The University Invites Applications From Suitably Qualified Applicants For Admission Into The Full-Time Undergraduate Programme Such As Ijmb,Jupeb,Pre-Degree,Sandwich,Transfer Form,Change Of Institution Form,Diploma And Part Time Programme In The 2024/2025 Academic Session.In This Post, We Break Down The Process To Successfully Register Or Apply For University Screening.This Includes, How To Apply For The University Post Utme, Admission Portal, Registration Fees, Cut Off Mark, Requirements And Deadline,For More Details Call 091–6299–30–14 Office Of The Admin.University Admission General Entry Requirement.1.Minimum Qualification For The First Degree Programs: 5 Credits At The Gce/Ssce/Neco Examinations Or Their Equivalent (At Not More Than 2 Sittings);2. Candidates Below 15 Years Of Age Are Advised Not To Apply.3. Candidates Awaiting 2024 Waec/Neco Ssce Results Will Be Required To Present Acceptable Qualifications Before Matriculation.4. All Candidates Who Apply Directly To The University Are Required To Sit For The Current Jamb Examination (For 100 Level) Or Apply For Jamb Direct Entry Admissions (For Direct Entry).5. Candidates Who Apply For Transfer Admissions Need To Present A Jamb Admission Letter Or Transcript From Previous University And Attestation Letters,For More Information And Admission Assistance Contact Us Through 091–6299–30–14 Or Whatsapp (+234)91–6299–30–14 For More Details.","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Wish; State (computer science); Register (sociolinguistics); Institution; Entrance exam","score_opus":0.05194266857744532,"score_gpt":0.28512586231293635,"score_spread":0.23318319373549104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930122282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14788984,0.00034973986,0.42958987,0.19642274,0.00033131606,0.15140338,0.073652856,0.00032175865,0.00003851023],"genre_scores_gemma":[0.6590424,0.002434464,0.055397745,0.010871864,0.0019283345,0.006842103,0.035456218,0.0025756245,0.22545125],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9931421,0.00062485633,0.0013216352,0.002263677,0.0012700018,0.0013777213],"domain_scores_gemma":[0.9876326,0.005943431,0.0014723612,0.001605227,0.002366154,0.0009802791],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0032184685,0.0012240624,0.0012801244,0.00069146394,0.0066947485,0.0006238918,0.0032673855,0.00048373739,0.000049170703],"category_scores_gemma":[0.0031217027,0.0006660023,0.0004911384,0.002222954,0.0004067257,0.00095270533,0.0015351018,0.0005372597,0.0000022428117],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.16931732,0.0012162409,0.0004009199,0.004857789,0.001377404,0.000009301521,0.0726141,0.0038818712,0.0045271683,0.00009734505,0.5570047,0.18469587],"study_design_scores_gemma":[0.009275176,0.0045555183,0.003104512,0.004294327,0.0018972202,0.000009361349,0.022977887,0.07064297,0.0019282899,0.000016739259,0.88013524,0.0011627371],"about_ca_topic_score_codex":0.0013495949,"about_ca_topic_score_gemma":0.012433308,"teacher_disagreement_score":0.51115257,"about_ca_system_score_codex":0.0011071719,"about_ca_system_score_gemma":0.00080936914,"threshold_uncertainty_score":0.99957913},"labels":[],"label_agreement":null},{"id":"W6930640651","doi":"10.5281/zenodo.11886285","title":"Physiologie pdf","year":2024,"lang":"fr","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Human anatomy; Human physiology; Human body","score_opus":0.033160608004212756,"score_gpt":0.24571798007229775,"score_spread":0.212557372068085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930640651","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022989443,0.0017149503,0.053139538,0.0036645439,0.0017572823,0.0004974099,0.00017210758,0.0022589914,0.9365653],"genre_scores_gemma":[0.008245915,0.0003527019,0.0071682115,0.0006191899,0.002766613,5.334673e-8,0.0008008088,0.009325959,0.9707205],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99647415,0.00058521185,0.00037115277,0.0012625736,0.00051095494,0.00079595845],"domain_scores_gemma":[0.9980064,0.000045350847,0.00018214113,0.0010953272,0.0003775626,0.0002932125],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00064448523,0.00043459615,0.0003650448,0.00042361376,0.0016859118,0.0032192874,0.0034531318,0.00025468844,0.12999956],"category_scores_gemma":[0.0004232757,0.00042281067,0.00019378371,0.0010539481,0.00038371907,0.00016565117,0.0054864087,0.0010663922,0.44895688],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006079771,0.00008994438,4.4001588e-8,0.00025373002,0.00008530914,0.000096933094,0.0009909379,0.00038823622,0.0004846998,0.02680685,0.5705061,0.40029114],"study_design_scores_gemma":[0.0001977257,0.0003346739,0.000043472104,0.00041379395,0.000027199618,0.0002922018,0.000040877763,0.05106521,0.00005636453,0.0036436422,0.9434426,0.00044227083],"about_ca_topic_score_codex":0.000024647641,"about_ca_topic_score_gemma":2.620203e-7,"teacher_disagreement_score":0.39984885,"about_ca_system_score_codex":0.00018011169,"about_ca_system_score_gemma":0.000012513803,"threshold_uncertainty_score":0.9998224},"labels":[],"label_agreement":null},{"id":"W6930667762","doi":"10.5281/zenodo.14963482","title":"Quasinary Computing: WHIRL ASI Technical Report Vol. 3 - QWHIRL Q-QPU","year":2025,"lang":"en","type":"book","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Quantum network; Quantum computer; Quantum; Quantum technology; Quantum information science; Quantum algorithm; Topology (electrical circuits); Quantum cellular automaton; Quantum error correction","score_opus":0.018569887820205973,"score_gpt":0.2444379388537251,"score_spread":0.22586805103351915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930667762","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003464312,0.0003168656,0.2754245,0.0019812065,0.0009953082,0.000676459,0.00009786871,0.004012737,0.7164604],"genre_scores_gemma":[0.004680344,0.00020100409,0.05045034,0.0017060796,0.0037367214,1.8411748e-7,0.008192712,0.0055533797,0.92547923],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953594,0.0004503229,0.0008127154,0.0016043317,0.0009882583,0.00078496576],"domain_scores_gemma":[0.99547386,0.00016938872,0.00049143715,0.0021428007,0.0013952504,0.0003272512],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001509989,0.00052561925,0.0005791721,0.0007055459,0.0030862135,0.001971924,0.0053158025,0.000402334,0.00096478546],"category_scores_gemma":[0.0014111195,0.00055158697,0.0002586137,0.0009363555,0.0003147307,0.00023317186,0.008837424,0.001664591,0.0026574058],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012397815,0.000116576346,2.5129532e-7,0.00014728353,0.000060014485,0.0005155476,0.0002539021,0.0002575584,0.000037541,0.022819776,0.7978118,0.17796734],"study_design_scores_gemma":[0.00029928252,0.00029952708,0.00005720534,0.00038357478,0.000025467585,0.0020278643,0.0000102052,0.018739508,0.000019139603,0.0037051865,0.97389144,0.0005415838],"about_ca_topic_score_codex":0.0000069700245,"about_ca_topic_score_gemma":2.0346272e-7,"teacher_disagreement_score":0.22497416,"about_ca_system_score_codex":0.00046700516,"about_ca_system_score_gemma":0.000096388474,"threshold_uncertainty_score":0.99994844},"labels":[],"label_agreement":null},{"id":"W6931008169","doi":"10.5281/zenodo.16756405","title":"The phase diagram of quantum chromodynamics in one dimension on a quantum computer","year":2025,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; York University; University of Waterloo","funders":"","keywords":"Dimension (graph theory); Quantum; Quantum chromodynamics; Phase diagram; Quantum operation; Quantum field theory; Quantum algorithm; Diagram","score_opus":0.019747754106192974,"score_gpt":0.2566237488892776,"score_spread":0.2368759947830846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931008169","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032167525,0.00040064802,0.21035111,0.003896025,0.0020107909,0.002094701,0.77593285,0.001146754,0.0009503815],"genre_scores_gemma":[0.010132855,0.00073838054,0.0015669971,0.0004000726,0.00038759498,2.28108e-7,0.9860556,0.00061958673,0.00009865255],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967588,0.00071177765,0.0005673016,0.0007628554,0.00066909654,0.0005301666],"domain_scores_gemma":[0.99738276,0.00023509868,0.00032890987,0.0015683849,0.00035832069,0.00012651585],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010980576,0.00031154952,0.00039495318,0.00053667347,0.0015719418,0.0008534195,0.003870508,0.0001656565,0.000091547576],"category_scores_gemma":[0.00037890763,0.00025963708,0.000115563635,0.0011590191,0.00021458413,0.000108729335,0.0037278964,0.0009616243,0.0002097237],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049544535,0.0005907814,3.331151e-8,0.00012461658,0.000041178093,0.00003107023,0.00015911323,0.0014526258,0.000041578554,0.008336119,0.84291065,0.1462627],"study_design_scores_gemma":[0.00055329327,0.00066045346,0.000014494156,0.00026137204,0.00000827934,0.000019225605,0.0000065874806,0.36105496,0.000016126587,0.00039790157,0.6368305,0.00017676935],"about_ca_topic_score_codex":0.00005949607,"about_ca_topic_score_gemma":0.0000017264186,"teacher_disagreement_score":0.35960233,"about_ca_system_score_codex":0.00014849094,"about_ca_system_score_gemma":0.000021735998,"threshold_uncertainty_score":0.9999856},"labels":[],"label_agreement":null},{"id":"W6931055374","doi":"10.5281/zenodo.16875190","title":"The Omnis as a Coherence Framework: A ROTE-Based Approach to Quantum Computing","year":2025,"lang":"en","type":"preprint","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Quantum computer; Coherence (philosophical gambling strategy); Quantum network; Quantum error correction; Qubit; Quantum; Quantum decoherence; Quantum algorithm; Quantum technology","score_opus":0.028743339093515063,"score_gpt":0.26535690522931826,"score_spread":0.2366135661358032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931055374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018578283,0.00015327803,0.96380657,0.003984996,0.00055293547,0.0010433639,0.00008562429,0.0018259824,0.026689427],"genre_scores_gemma":[0.74261814,0.000054560183,0.24924129,0.0032643762,0.0009150678,9.909484e-7,0.0007695785,0.0019274673,0.0012085437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957567,0.000877852,0.00048225818,0.0013007626,0.0007943526,0.0007880989],"domain_scores_gemma":[0.996392,0.00029309557,0.00026858848,0.0020021643,0.00073794246,0.00030621162],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016942536,0.00039154792,0.00034385303,0.00034950805,0.00528847,0.004958335,0.007731865,0.0002268713,0.00010386856],"category_scores_gemma":[0.0014255762,0.00033587994,0.00016626323,0.0012921183,0.0001906963,0.000083555475,0.014412025,0.0017625282,0.0011298946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005693911,0.00031793892,0.0000010581364,0.0003401181,0.00012040334,0.000024060859,0.005535908,0.18129355,0.00008070384,0.157815,0.05109256,0.6033218],"study_design_scores_gemma":[0.00016536651,0.00014079738,0.00004235166,0.00033616627,0.000009182726,0.000033273875,0.00007520922,0.65248346,0.00006662186,0.00740722,0.33890885,0.00033148323],"about_ca_topic_score_codex":0.00006110509,"about_ca_topic_score_gemma":1.6996624e-7,"teacher_disagreement_score":0.7407603,"about_ca_system_score_codex":0.00018403631,"about_ca_system_score_gemma":0.00006101444,"threshold_uncertainty_score":0.99990934},"labels":[],"label_agreement":null},{"id":"W6931547082","doi":"10.5281/zenodo.8119485","title":"CTD2022: Track reconstruction in the LUXE experiment using quantum algorithms","year":2022,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum algorithm; Ansatz; Quantum computer; Quantum; Tracking (education); Quadratic equation; Binary number; Track (disk drive); Detector","score_opus":0.03801931302137579,"score_gpt":0.25424879057035227,"score_spread":0.21622947754897648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931547082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6730139,0.00045343014,0.30264306,0.0056684646,0.0015039518,0.0013140215,0.000099886856,0.0017329602,0.013570276],"genre_scores_gemma":[0.98921895,0.000010836876,0.009660653,0.00033395563,0.00018970136,1.8524929e-7,0.00011632808,0.000398704,0.00007070102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760365,0.0008307092,0.00024678512,0.00045106764,0.0005136079,0.00035419554],"domain_scores_gemma":[0.99916273,0.000031048537,0.0001029745,0.00054056547,0.00009613955,0.00006652401],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012662491,0.0001240051,0.00011399574,0.00024381981,0.0033204965,0.000736872,0.0020554597,0.000024769284,0.0011950968],"category_scores_gemma":[0.00006256965,0.00011218245,0.00005387723,0.0010526006,0.00007820435,0.00021720857,0.0017487821,0.00048027988,0.00015616654],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003256061,0.00044620817,0.0000058527835,0.000022788443,0.00003246068,0.00011820305,0.021346413,0.03701296,0.0055284617,0.023005886,0.020887243,0.891561],"study_design_scores_gemma":[0.00037267338,0.00025256284,0.00015815062,0.000011029742,0.000003167323,0.0013494318,0.0016300019,0.6119837,0.00024602909,0.0011063917,0.3826994,0.00018747881],"about_ca_topic_score_codex":0.000034401175,"about_ca_topic_score_gemma":1.10236876e-7,"teacher_disagreement_score":0.89137346,"about_ca_system_score_codex":0.00018159991,"about_ca_system_score_gemma":0.0000074863256,"threshold_uncertainty_score":0.99971795},"labels":[],"label_agreement":null},{"id":"W6942396900","doi":"10.1371/journal.pone.0268957.g003","title":"Phylogenetic tree of HA subtype H13 of an isolate detected in a kelp gull in Peru, and others detected in America.","year":2022,"lang":"en","type":"other","venue":"Figshare","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Phylogenetic tree; Tree (set theory); Phylogenetics; Kelp; Maximum likelihood; Strain (injury)","score_opus":0.011028655380769784,"score_gpt":0.22320643911083654,"score_spread":0.21217778373006677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6942396900","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82537913,0.018838918,0.00041569353,0.0002776331,0.00061459537,0.0058046514,0.12622218,0.0012279658,0.021219203],"genre_scores_gemma":[0.95540184,0.00008993812,0.029940262,0.00026700282,0.00021091891,0.00040381818,0.0080949105,0.00090241514,0.0046888995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982657,0.00022774586,0.00037471735,0.0005835072,0.00022403392,0.0003243226],"domain_scores_gemma":[0.9989067,0.00010972845,0.0003380438,0.0005580493,0.000026835143,0.000060673865],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007324291,0.00027492177,0.0004955041,0.00086619426,0.000017420989,0.00002310077,0.0008631021,0.0001509029,0.0070904046],"category_scores_gemma":[0.00015995718,0.00027743756,0.000047266,0.0014592938,0.000025148955,0.000033992284,0.00041168914,0.00043305353,0.000007700356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017751714,0.0009870558,0.0050152824,0.002693959,0.00014126592,0.0009145406,0.011403435,0.014148144,0.0054898085,0.000010055722,0.022784809,0.9362341],"study_design_scores_gemma":[0.0027779443,0.0013864135,0.14229038,0.005693939,0.000011277706,0.000047699137,0.00017914415,0.8213579,0.0007157834,0.00015101706,0.02405034,0.0013381502],"about_ca_topic_score_codex":0.0007242384,"about_ca_topic_score_gemma":0.0028968782,"teacher_disagreement_score":0.934896,"about_ca_system_score_codex":0.00003917329,"about_ca_system_score_gemma":0.00013233579,"threshold_uncertainty_score":0.99996775},"labels":[],"label_agreement":null},{"id":"W6949521348","doi":"10.5281/zenodo.15867660","title":"QIRT Meta-Floor Protocol","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"IBM; Quantum; Error detection and correction; Protocol (science); Benchmark (surveying); Quantum computer; Transparency (behavior); IBM PC compatible","score_opus":0.03212781097444296,"score_gpt":0.27098636408262106,"score_spread":0.2388585531081781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949521348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073084934,0.000057349676,0.79539376,0.006146331,0.00025880523,0.017502667,0.000036976937,0.0035364185,0.17633685],"genre_scores_gemma":[0.59263605,0.0000536911,0.32684442,0.015484036,0.0024645352,0.00022604046,0.0012844082,0.009894329,0.05111246],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983097,0.0003001197,0.00023324981,0.0005057425,0.0003013256,0.00034988995],"domain_scores_gemma":[0.9987366,0.000025053776,0.00007558744,0.00072143186,0.00033061317,0.000110702975],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00067198015,0.00015133564,0.00018349089,0.00026350928,0.0018947171,0.0012368888,0.0023045654,0.000047813573,0.0016765345],"category_scores_gemma":[0.00025248612,0.00013092,0.00010494871,0.00099528,0.00008461972,0.00021680526,0.0023884908,0.00028011852,0.0021976],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026118194,0.00021780276,7.8669405e-7,0.00012227084,0.0003082289,0.000025452971,0.00068648346,0.00097299245,0.001145259,0.08311177,0.1792553,0.7341275],"study_design_scores_gemma":[0.00036885837,0.00011287109,0.0001287143,0.00001881936,0.000022457198,0.000042643565,0.000013143745,0.035800997,0.00060990144,0.002254801,0.96048945,0.00013733467],"about_ca_topic_score_codex":0.000008064513,"about_ca_topic_score_gemma":6.932367e-8,"teacher_disagreement_score":0.78123415,"about_ca_system_score_codex":0.000052994794,"about_ca_system_score_gemma":0.000007689719,"threshold_uncertainty_score":0.9997999},"labels":[],"label_agreement":null},{"id":"W6950816383","doi":"10.5281/zenodo.8119756","title":"CTD2022: Track reconstruction in the LUXE experiment using quantum algorithms","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Quantum algorithm; Ansatz; Quantum computer; Quantum; Tracking (education); Quadratic equation; Binary number; Track (disk drive); Detector","score_opus":0.04877311487560518,"score_gpt":0.2707598319798313,"score_spread":0.2219867171042261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6950816383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7604522,0.00017973881,0.21766835,0.005438639,0.001161266,0.0010100137,0.000048917515,0.0033700205,0.010670867],"genre_scores_gemma":[0.9879162,0.00004609879,0.010476968,0.00025660422,0.00037016894,1.2413307e-7,0.0001867151,0.0006117252,0.0001354278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980348,0.00046195003,0.00024521525,0.0004453746,0.00040356108,0.0004091261],"domain_scores_gemma":[0.9991382,0.000041111038,0.000081518665,0.00053602824,0.00012699973,0.00007615957],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001184278,0.00012991745,0.000117287214,0.00032257685,0.0016167718,0.0009412302,0.0016524782,0.00004581073,0.0003065573],"category_scores_gemma":[0.000115327595,0.00010941375,0.00005221201,0.0016573898,0.00009208613,0.00026197988,0.0009393849,0.00031437931,0.001038387],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001494026,0.00016044332,0.000005769989,0.000031195937,0.000026467713,0.00011048577,0.014448744,0.01145095,0.0061146687,0.014560393,0.027748452,0.9253275],"study_design_scores_gemma":[0.00033421512,0.00013831934,0.0005325964,0.000034788445,0.000002958542,0.0005287505,0.0009462746,0.79332435,0.0004894972,0.0014672774,0.20201004,0.0001909136],"about_ca_topic_score_codex":0.0000248306,"about_ca_topic_score_gemma":1.5943586e-7,"teacher_disagreement_score":0.92513657,"about_ca_system_score_codex":0.00008675763,"about_ca_system_score_gemma":0.000005595323,"threshold_uncertainty_score":0.9997394},"labels":[],"label_agreement":null},{"id":"W6957721703","doi":"10.60692/p9bvx-w2h83","title":"A New Perspective on the Average Mixing Matrix","year":2018,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mixing (physics); Centralizer and normalizer; Adjacency matrix; Quantum walk; Matrix (chemical analysis); Rank (graph theory); Diagonal; Projection (relational algebra); Diagonal matrix; Automorphism","score_opus":0.017409491061748075,"score_gpt":0.22358226864619388,"score_spread":0.2061727775844458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957721703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08668465,0.0000020128432,0.9015144,0.0011885369,0.000738885,0.00022148043,0.0000050258936,0.00039646096,0.009248511],"genre_scores_gemma":[0.9904298,1.2506742e-8,0.008410237,0.0005252881,0.00038742332,0.000003599584,3.9800815e-7,0.0000049169184,0.00023829349],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989353,0.00008957495,0.00026128005,0.00017067984,0.00030859807,0.00023456126],"domain_scores_gemma":[0.99902725,0.000028202754,0.00016729716,0.00054539245,0.0001545216,0.000077361496],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042133455,0.0001451782,0.00011802002,0.00014884333,0.00037086607,0.00052664935,0.0006353249,0.000047017325,0.00001304478],"category_scores_gemma":[0.000027797041,0.000086603824,0.00006776778,0.00034375212,0.000024882316,0.0003880237,0.00016086645,0.00013412043,0.0015544996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047245718,0.000002693533,0.0009519645,0.000059178088,0.0000714658,0.000009254771,0.743097,0.0032553962,0.0000036040944,0.24381629,0.0024766647,0.006209213],"study_design_scores_gemma":[0.00073613017,0.00025686919,0.005448093,0.00026762966,0.0000075434286,0.00015448817,0.00955983,0.97925436,0.001208576,0.00022401656,0.0024923075,0.00039015227],"about_ca_topic_score_codex":0.000020443875,"about_ca_topic_score_gemma":9.015021e-8,"teacher_disagreement_score":0.975999,"about_ca_system_score_codex":0.00010033793,"about_ca_system_score_gemma":0.000054186643,"threshold_uncertainty_score":0.99922293},"labels":[],"label_agreement":null},{"id":"W6958594172","doi":"10.6084/m9.figshare.26564553.v1","title":"Additional file 1 of Depletion of polyfunctional CD26highCD8+ T cells repertoire in chronic lymphocytic leukemia","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chronic lymphocytic leukemia; Flow cytometry; Cumulative dose; Cumulative incidence; T lymphocyte; T cell; Leukemia","score_opus":0.00987811492802453,"score_gpt":0.20660246169014762,"score_spread":0.19672434676212308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958594172","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017548967,0.0003166689,0.00018934821,0.000022582786,0.00011072686,0.00007230116,0.9985634,0.00010808639,0.00044136815],"genre_scores_gemma":[0.0606675,0.0000028137435,0.011458139,0.00010716808,0.0005756611,0.00029036647,0.9257289,0.00003295801,0.0011364752],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989765,0.000029453427,0.00024704853,0.00030505992,0.00026976442,0.0001721532],"domain_scores_gemma":[0.9986142,0.00096688635,0.000083048726,0.00023502418,0.000061869454,0.00003895322],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00002975664,0.00011073021,0.00014027454,0.00017790371,0.00003577303,0.000035971596,0.00034248555,0.00007005851,0.8165072],"category_scores_gemma":[0.00022893117,0.000101914375,0.00010162526,0.00051627227,0.000012747508,0.0001295702,0.00016448495,0.00014341308,0.00047992298],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014799467,0.000005177213,9.196694e-8,0.00018405118,0.0000073338697,0.000020013516,0.000041448726,0.014768722,0.00018300978,0.00007063257,0.9726748,0.012043278],"study_design_scores_gemma":[0.00007864291,0.000056808203,0.00032434813,0.0037748679,8.3054573e-7,0.000026541544,0.0000015640766,0.6863114,0.0009564219,0.0001728353,0.30820483,0.00009087182],"about_ca_topic_score_codex":0.000020819289,"about_ca_topic_score_gemma":0.000006594036,"teacher_disagreement_score":0.8160273,"about_ca_system_score_codex":0.0007439881,"about_ca_system_score_gemma":0.0021722603,"threshold_uncertainty_score":0.6168599},"labels":[],"label_agreement":null},{"id":"W6958908507","doi":"10.6084/m9.figshare.17870137","title":"Additional file 2 of Health risks and mitigation strategies from occupational exposure to wildland fire: a scoping review","year":2022,"lang":"en","type":"article","venue":"Figshare","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"MEDLINE; Risk assessment; Occupational safety and health; Occupational exposure; Risk management","score_opus":0.0514512640237101,"score_gpt":0.30734413422874324,"score_spread":0.25589287020503315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958908507","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002066877,0.0033102008,0.00016800291,0.00041640672,0.00002486199,0.0002471503,0.9955636,0.000042624346,0.000020438789],"genre_scores_gemma":[0.0041511133,0.000010119967,0.015494369,0.001569754,0.00008272102,0.00057223527,0.9781038,0.0000062191666,0.000009664694],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905145,0.0001043422,0.00021093267,0.00024466956,0.0002714818,0.00011710758],"domain_scores_gemma":[0.99895793,0.00059474155,0.00017878422,0.00016261596,0.00004921977,0.000056688437],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000542581,0.000080367536,0.00015255406,0.000033118005,0.00024570644,0.00005433654,0.00024499238,0.000013753609,0.69888437],"category_scores_gemma":[0.00031459733,0.000080865575,0.000033241962,0.00022914418,0.000004121808,0.00011315611,0.00030016343,0.000111545785,0.000032283704],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.021845e-7,0.000009386544,0.000002026083,0.0003303579,0.0000030038657,0.0000014250469,0.000107236425,0.0020671452,3.8032474e-7,0.000006444606,0.973454,0.02401782],"study_design_scores_gemma":[0.00047981643,0.00095664215,0.044388507,0.36154786,0.000005932362,0.00007000009,0.00010800267,0.18536906,0.0000081789685,0.001502464,0.4048089,0.00075463497],"about_ca_topic_score_codex":0.000026972153,"about_ca_topic_score_gemma":0.0000053513904,"teacher_disagreement_score":0.6988521,"about_ca_system_score_codex":0.00001792704,"about_ca_system_score_gemma":0.00041649005,"threshold_uncertainty_score":0.32976025},"labels":[],"label_agreement":null},{"id":"W6966466212","doi":"10.48550/arxiv.0812.3694","title":"On continuous variable quantum algorithms for oracle identification problems","year":2008,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Continuous variable; Oracle; Formalism (music); Probabilistic logic; Variable (mathematics); Representation (politics); Exponential function; Hilbert space","score_opus":0.023777768185814098,"score_gpt":0.26188468434803536,"score_spread":0.23810691616222127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966466212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034255828,0.00018001981,0.9888762,0.00097382895,0.0031339256,0.0013752705,0.000049855684,0.000907793,0.0010774861],"genre_scores_gemma":[0.08435271,0.00012797925,0.9083291,0.00080632797,0.00092950277,0.00060204224,0.00021082842,0.00011517518,0.0045263204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966498,0.00009965786,0.0006885276,0.0014624161,0.0005005272,0.0005990688],"domain_scores_gemma":[0.9970361,0.00037355704,0.0004807686,0.0016172596,0.00034258552,0.00014970521],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069614034,0.0004739966,0.00055192225,0.0002497318,0.00039234856,0.00061548577,0.0020491215,0.00035438171,0.000008823579],"category_scores_gemma":[0.00013181106,0.00041484347,0.0002500387,0.00032695802,0.00006158887,0.0001372209,0.001072493,0.00070491905,0.00006475789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029192084,0.00078320364,0.000010234501,0.00054418034,0.00019204675,0.000026433789,0.0013849592,0.4031315,0.00049914856,0.3688304,0.027905429,0.19666326],"study_design_scores_gemma":[0.00031840918,0.00021293716,0.000049990274,0.00015136335,0.000010773084,0.000027840184,0.0000046683067,0.8358708,0.00042982472,0.15474352,0.0077144667,0.00046538538],"about_ca_topic_score_codex":0.00014041744,"about_ca_topic_score_gemma":0.0000020237535,"teacher_disagreement_score":0.43273932,"about_ca_system_score_codex":0.00007925081,"about_ca_system_score_gemma":0.00028034113,"threshold_uncertainty_score":0.99983037},"labels":[],"label_agreement":null},{"id":"W6966659524","doi":"10.48550/arxiv.2210.12558","title":"Transit facility allocation: Hybrid quantum-classical optimization","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum annealing; Transit (satellite); Public transport; Redundancy (engineering); Facility location problem; Metropolitan area; Quantum","score_opus":0.04099239113727994,"score_gpt":0.18431605731433748,"score_spread":0.14332366617705755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966659524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08942552,0.000052934065,0.9076721,0.00070551253,0.0008907565,0.00027185658,0.0000653168,0.000515633,0.00040036574],"genre_scores_gemma":[0.9897109,0.000054747987,0.009390862,0.00013847566,0.00009329807,0.0000020206785,0.00013025274,0.000015358768,0.00046408508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727464,0.0003361957,0.00027451967,0.0015114681,0.0002064876,0.0003966868],"domain_scores_gemma":[0.99794066,0.0001212735,0.00022062767,0.0013944677,0.00012645067,0.0001965468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003487366,0.00037121613,0.00037020457,0.00022606122,0.0004487137,0.00017883167,0.0022141493,0.00015562915,0.0001646444],"category_scores_gemma":[0.000027554515,0.00043698252,0.00029537312,0.00062527345,0.00011499322,0.000224439,0.0020111254,0.0010967093,0.000032005704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000144918695,0.00010727635,0.000070411326,0.000041829524,0.00004477732,0.0002022765,0.0002045842,0.9775127,0.0000047396993,0.019642154,0.00024700444,0.0019077446],"study_design_scores_gemma":[0.00030551146,0.0000701615,0.000169933,0.000023190758,0.000033581473,0.00001571321,0.00002640824,0.9902075,0.000029244064,0.006946681,0.0017059932,0.00046608876],"about_ca_topic_score_codex":0.00006656171,"about_ca_topic_score_gemma":0.000004402119,"teacher_disagreement_score":0.90028536,"about_ca_system_score_codex":0.00023583893,"about_ca_system_score_gemma":0.0003149981,"threshold_uncertainty_score":0.9998082},"labels":[],"label_agreement":null},{"id":"W6966707145","doi":"10.48550/arxiv.2101.08946","title":"Generation and verification of 27-qubit Greenberger-Horne-Zeilinger states in a superconducting quantum computer","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Qubit; Multipartite; Quantum; Measure (data warehouse); Quantum error correction; Quantum entanglement; Fidelity; Quantum computer; Quantum state","score_opus":0.07071989829479042,"score_gpt":0.19916584040316496,"score_spread":0.12844594210837454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966707145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67943126,0.00015908544,0.319588,0.0001065134,0.000515574,0.00012868446,0.000004263768,0.000056336215,0.000010312385],"genre_scores_gemma":[0.98463863,0.00021015131,0.014873146,0.000042123003,0.00013501219,5.587138e-7,0.000048336948,0.000014999485,0.000037022168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979688,0.00022904458,0.00033982183,0.0010839987,0.000102907536,0.00027544273],"domain_scores_gemma":[0.99865234,0.00011469434,0.00023962281,0.0007212856,0.0001849013,0.00008713177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038209872,0.00027066507,0.00039422218,0.00031532484,0.00009696854,0.00015041624,0.00061641255,0.00020837662,0.000005250315],"category_scores_gemma":[0.000022642998,0.00030805467,0.00011091192,0.0005404491,0.00008960271,0.00031015306,0.0011267264,0.00052707107,0.000002119581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008664513,0.00011633803,0.0046562837,0.00016881789,0.000055100903,0.00014410107,0.0028566415,0.9748874,0.0020775707,0.009090696,0.000046309724,0.005892091],"study_design_scores_gemma":[0.00028240168,0.00004803862,0.0028529519,0.00016487855,0.00001689647,0.000009419006,0.00013519595,0.99304634,0.0008163015,0.002289893,0.000032822314,0.00030484996],"about_ca_topic_score_codex":0.00043082674,"about_ca_topic_score_gemma":0.00010548643,"teacher_disagreement_score":0.30520743,"about_ca_system_score_codex":0.00006965806,"about_ca_system_score_gemma":0.00014624852,"threshold_uncertainty_score":0.9999372},"labels":[],"label_agreement":null},{"id":"W6968251587","doi":"10.5281/zenodo.15458509","title":"QSF1: The Curvature Detection: A 3-Qubit Quantum Spacetime Foam Simulation Reveals 92.7% Localized Deformation in Patch-1 (IBM Sherbrooke)","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Spacetime; Quantum entanglement; Quantum; Quantum spacetime; Open quantum system; Quantum field theory in curved spacetime; Quantum operation; Quantum gravity; Problem of time; Quantum metrology","score_opus":0.014407320347603765,"score_gpt":0.24063517494665032,"score_spread":0.22622785459904657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968251587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042414624,0.00025942273,0.9408264,0.0043853,0.0003868791,0.0009014767,0.000016380922,0.0011846868,0.009624829],"genre_scores_gemma":[0.9974465,0.00002348771,0.0013473567,0.0004370345,0.00010935037,1.9631833e-7,0.000082155995,0.00022397866,0.00032995973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764645,0.0006303986,0.00039907065,0.00049105193,0.0004149414,0.00041805682],"domain_scores_gemma":[0.9985696,0.00011300577,0.00014853443,0.000727588,0.00035132348,0.00008991492],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012275842,0.00019618848,0.00019285707,0.0003638954,0.0018770375,0.001138306,0.001537525,0.000111663656,0.00021742452],"category_scores_gemma":[0.00047210627,0.00016155012,0.0000786633,0.0018499608,0.00009473063,0.0004346222,0.0011875044,0.0005520594,0.000609177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015383385,0.00024446682,0.000036367474,0.00023738068,0.00007956002,0.000023921239,0.0056983456,0.1827209,0.0032321864,0.031861845,0.02052244,0.75518876],"study_design_scores_gemma":[0.00049895456,0.000097071264,0.0012296536,0.00009907394,0.0000065522418,0.000026298585,0.00006264337,0.70626897,0.0002418924,0.003569227,0.28774747,0.00015222772],"about_ca_topic_score_codex":0.000046909252,"about_ca_topic_score_gemma":0.0000036282272,"teacher_disagreement_score":0.9550319,"about_ca_system_score_codex":0.00020091189,"about_ca_system_score_gemma":0.000009928605,"threshold_uncertainty_score":0.9998986},"labels":[],"label_agreement":null},{"id":"W6968599618","doi":"10.5281/zenodo.4298373","title":"Fig. 109 in The 'red-tailed' Lasioglossum (Dialictus) (Hymenoptera: Halictidae) of the western Nearctic","year":2020,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Nearctic ecozone; Ridge; Scale (ratio); Ecological succession","score_opus":0.018846509974026388,"score_gpt":0.22496550331060036,"score_spread":0.20611899333657396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968599618","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00104063,0.00058145385,0.019783197,0.020336783,0.0009884019,0.0021811307,0.00032374554,0.0019627952,0.9528019],"genre_scores_gemma":[0.7742361,0.0006897901,0.008711261,0.01055823,0.0047271852,0.0000012371041,0.0012217319,0.02220547,0.17764904],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972045,0.0008334422,0.000325503,0.0005757911,0.0006673221,0.0003934475],"domain_scores_gemma":[0.9982894,0.00004694836,0.00027772586,0.0011958303,0.0000931836,0.00009689822],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00054847356,0.0002577965,0.00027879325,0.00023207201,0.00072479295,0.0007954095,0.005139954,0.00012268148,0.0013520935],"category_scores_gemma":[0.00021895806,0.00017435278,0.00011713914,0.0010810597,0.00018592068,0.000087493085,0.0027948767,0.0006902073,0.0010252608],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014949408,0.00018053263,0.00003988085,0.00022372813,0.00008541861,0.000046573772,0.006757403,0.0003143582,0.00013994605,0.004594143,0.9052381,0.08236499],"study_design_scores_gemma":[0.0002934003,0.0001298761,0.00073148595,0.00017589775,0.000010743303,0.00006827014,0.000037614835,0.0044073956,0.000023937895,0.0001497972,0.99378294,0.00018862334],"about_ca_topic_score_codex":0.00011013825,"about_ca_topic_score_gemma":0.000003885744,"teacher_disagreement_score":0.7751528,"about_ca_system_score_codex":0.000049991777,"about_ca_system_score_gemma":0.000011258152,"threshold_uncertainty_score":0.9997526},"labels":[],"label_agreement":null},{"id":"W6968609355","doi":"10.5281/zenodo.16739864","title":"Adaptive Quantum Circuit Architecture for Combinatorial Optimization: Structured Amplitude Shaping and Real-Time Feedback on NISQ Hardware","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum circuit; Quantum computer; Quantum; Quantum algorithm; IBM; Quantum phase estimation algorithm; Optimization problem; Graph","score_opus":0.024038624650438947,"score_gpt":0.236608529759295,"score_spread":0.21256990510885604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968609355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041143754,0.00008369184,0.9806161,0.001955917,0.00053757726,0.0009869321,0.00017229526,0.0013260423,0.010207074],"genre_scores_gemma":[0.856351,0.00014404705,0.13539098,0.0014940551,0.0013042986,0.0000013876613,0.001795682,0.0022897397,0.0012288026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978337,0.00028007574,0.00029194704,0.0007933969,0.0003431456,0.00045772566],"domain_scores_gemma":[0.99849325,0.00015380039,0.00013402685,0.0005917672,0.0004636454,0.00016350731],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046550247,0.0002524563,0.00026479003,0.00027672775,0.0024627938,0.0013217735,0.00141262,0.00010798893,0.00021462479],"category_scores_gemma":[0.00039054547,0.00025027903,0.00007883644,0.00070039066,0.00014268579,0.00017335766,0.0012284605,0.0003382748,0.00009628522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034090076,0.00023339217,0.000002292468,0.00023542525,0.00022157797,0.000022060627,0.0033039423,0.09622271,0.0026429626,0.5331255,0.043561656,0.32008755],"study_design_scores_gemma":[0.002426614,0.001033337,0.00042007267,0.00025961327,0.000029619112,0.00008808748,0.00011394978,0.7537094,0.0003471329,0.036646716,0.20433839,0.0005871062],"about_ca_topic_score_codex":0.000009776321,"about_ca_topic_score_gemma":1.1789031e-7,"teacher_disagreement_score":0.8522366,"about_ca_system_score_codex":0.000106786894,"about_ca_system_score_gemma":0.000015872147,"threshold_uncertainty_score":0.99999493},"labels":[],"label_agreement":null},{"id":"W6977257769","doi":"10.6084/m9.figshare.21382487.v1","title":"Additional file 2 of The NORMAN Suspect List Exchange (NORMAN-SLE): facilitating European and worldwide collaboration on suspect screening in high resolution mass spectrometry","year":2022,"lang":"en","type":"article","venue":"Figshare","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Agriculture and Agri-Food Canada","funders":"","keywords":"Suspect; High resolution; File format","score_opus":0.012716125995127074,"score_gpt":0.21086722905329291,"score_spread":0.19815110305816583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977257769","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020795283,0.00006343014,0.0001853192,0.0002593271,0.00009133897,0.00023092008,0.9938583,0.00009164804,0.0031401992],"genre_scores_gemma":[0.40123695,0.0000010919581,0.057423078,0.0010523142,0.0006761048,0.00050443626,0.5376428,0.00006916299,0.0013940813],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983597,0.00038603292,0.00023532625,0.00035029527,0.0004235766,0.00024507646],"domain_scores_gemma":[0.998331,0.0010453649,0.00021160443,0.0003080695,0.00006114097,0.000042805175],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019449549,0.0001400641,0.00013215879,0.00022434781,0.0004629661,0.00010418277,0.0005351246,0.000020739819,0.3317635],"category_scores_gemma":[0.0007888143,0.00012605214,0.00004931457,0.0012369988,0.000014759849,0.00015136847,0.0006430437,0.00039410774,0.000037864636],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008766091,0.000026541315,0.000019373038,0.00003635152,0.000006255017,0.00002584847,0.0005914207,0.007866201,0.000031170603,0.00014920179,0.9864198,0.004819088],"study_design_scores_gemma":[0.00059761776,0.00043643714,0.06277098,0.0017304672,0.00000329796,0.000045441582,0.0003973357,0.48506618,0.00015344228,0.00043123547,0.44789255,0.00047502955],"about_ca_topic_score_codex":0.000020434614,"about_ca_topic_score_gemma":0.00006211566,"teacher_disagreement_score":0.53852725,"about_ca_system_score_codex":0.00008541497,"about_ca_system_score_gemma":0.000059818816,"threshold_uncertainty_score":0.6688473},"labels":[],"label_agreement":null},{"id":"W6979278939","doi":"","title":"Bounding Eigenstate Overlap from Hamiltonian Moments: Success Probability Guarantees for Quantum Phase Estimation","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Defense Advanced Research Projects Agency; Alliance de recherche numérique du Canada; University of Toronto","keywords":"Hamiltonian (control theory); Wave function; Quantum; Eigenvalues and eigenvectors; Quantum phase estimation algorithm; Adiabatic quantum computation; Quantum algorithm; Quantum system","score_opus":0.025128378038805195,"score_gpt":0.306982998410147,"score_spread":0.2818546203713418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979278939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54883015,0.0000916683,0.4488582,0.0009264532,0.00071795593,0.00032436664,0.00002272944,0.00019181134,0.000036651127],"genre_scores_gemma":[0.9516757,0.000006177172,0.047670837,0.0003690047,0.00009316213,0.000054050244,0.000032273278,0.000013571487,0.00008521081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980007,0.00008953329,0.00044708664,0.0007576988,0.0002301817,0.0004748009],"domain_scores_gemma":[0.99857366,0.00032523167,0.00017005813,0.0007251572,0.00012170527,0.0000841572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004392855,0.00025702175,0.00030451475,0.00014636411,0.0005163588,0.00029929794,0.00086713204,0.00007929995,0.0000052445157],"category_scores_gemma":[0.00016764876,0.00023374427,0.00013643112,0.00049846404,0.000086421656,0.00044443447,0.00027040736,0.00019721732,0.000015701731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041593765,0.0027630557,0.34919012,0.0008800706,0.0006940352,0.00007899714,0.0092342915,0.04685563,0.032380644,0.092582144,0.0019811166,0.46294397],"study_design_scores_gemma":[0.0013659004,0.00013701065,0.036944207,0.00016603079,0.000020908165,0.000001769429,0.000024008063,0.91093975,0.0048577976,0.043869354,0.0014076564,0.00026560127],"about_ca_topic_score_codex":0.00021062615,"about_ca_topic_score_gemma":0.000021082093,"teacher_disagreement_score":0.8640841,"about_ca_system_score_codex":0.00010553289,"about_ca_system_score_gemma":0.00013892452,"threshold_uncertainty_score":0.9531815},"labels":[],"label_agreement":null},{"id":"W6979279875","doi":"","title":"Public-Key Quantum Money and Fast Real Transforms","year":2025,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quantum Fourier transform; Quantum phase estimation algorithm; Quantum algorithm; Quantum; Quantum error correction; Quantum circuit; Quantum computer; Quantum state; State (computer science); Quantum sort","score_opus":0.03324213153897787,"score_gpt":0.1741354072391563,"score_spread":0.14089327570017843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979279875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43967578,0.000045996316,0.5532078,0.0008322907,0.00018108485,0.00007618933,0.0000023354116,0.0002113811,0.005767091],"genre_scores_gemma":[0.9974112,0.00018801173,0.0011645759,0.0001682922,0.000025109945,2.0891565e-7,0.000001502034,0.0000057967327,0.0010353262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988598,0.000054297558,0.00011928347,0.00057075854,0.000058527712,0.00033730853],"domain_scores_gemma":[0.9992386,0.00007607393,0.000044015258,0.0004379055,0.00006084757,0.0001425362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001608295,0.00016247774,0.00016844658,0.00031134527,0.00028016762,0.00014835196,0.00073685654,0.00007922588,0.0000042108904],"category_scores_gemma":[0.0000127612,0.0001552269,0.00007473056,0.0011905748,0.000105768595,0.0003784011,0.0002832222,0.00020542846,0.000011432158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000907813,0.000048506798,0.0017846846,0.000018388097,0.000032017742,0.00008161393,0.0003376445,0.0060917134,0.000087687506,0.97757506,0.00022563816,0.0137079405],"study_design_scores_gemma":[0.00047770343,0.000059417187,0.0034463126,0.000024386181,0.000010513182,0.000007824989,0.0000634423,0.9472232,0.00008118078,0.045766056,0.002648776,0.00019121714],"about_ca_topic_score_codex":0.00010003749,"about_ca_topic_score_gemma":0.000028514387,"teacher_disagreement_score":0.9411315,"about_ca_system_score_codex":0.00003594203,"about_ca_system_score_gemma":0.0000865038,"threshold_uncertainty_score":0.6329969},"labels":[],"label_agreement":null},{"id":"W6979367655","doi":"","title":"Adversarial Robustness of Partitioned Quantum Classifiers","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Quantum circuit; Quantum; Adversarial system; Qubit; Quantum gate; Quantum computer; Quantum algorithm","score_opus":0.019267857663237686,"score_gpt":0.25103344046513365,"score_spread":0.23176558280189596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979367655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5894647,0.000052520238,0.40710068,0.0013241181,0.0013816751,0.000071634335,0.0000015248781,0.00011654438,0.000486577],"genre_scores_gemma":[0.99324965,0.0000057197462,0.00613234,0.00021174033,0.00016478628,0.000005744198,0.0000025040786,0.000006018019,0.00022146414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988338,0.00007690834,0.00028315702,0.0003547367,0.0001776622,0.0002737809],"domain_scores_gemma":[0.9990974,0.00012255229,0.000107988446,0.0005240795,0.000086615786,0.000061364095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021244,0.00013623187,0.00021076477,0.0001354238,0.00015750044,0.000036144193,0.00069410674,0.00007762333,0.00001059911],"category_scores_gemma":[0.00007053241,0.00012262297,0.00010584061,0.000617939,0.0000962334,0.00014434698,0.00026421077,0.00018583637,0.000015208383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000201817,0.0011233706,0.18705893,0.00039668608,0.00064307405,0.00010689823,0.002877535,0.3530654,0.015986755,0.33678147,0.022003343,0.07975473],"study_design_scores_gemma":[0.0008393758,0.00009692188,0.064494275,0.00010569919,0.000020444437,0.000004329739,0.000054644555,0.9231034,0.004929963,0.0028006295,0.0033088461,0.00024147947],"about_ca_topic_score_codex":0.00002583443,"about_ca_topic_score_gemma":0.0000042280567,"teacher_disagreement_score":0.570038,"about_ca_system_score_codex":0.000022513701,"about_ca_system_score_gemma":0.00012867847,"threshold_uncertainty_score":0.50004196},"labels":[],"label_agreement":null},{"id":"W6981853237","doi":"","title":"Field performance of fully grouted piezometers installed in the Ste-Marthe clay deposit, Québec","year":2017,"lang":"en","type":"other","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Piezometer; Field (mathematics); Sinkhole; Archaeomagnetic dating","score_opus":0.006843866889082289,"score_gpt":0.21168522035656134,"score_spread":0.20484135346747906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6981853237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07390829,0.00561557,0.8507621,0.0084127,0.0008267015,0.0024855102,0.000058205398,0.0014976932,0.056433175],"genre_scores_gemma":[0.8008368,0.00069927756,0.14677292,0.0042202333,0.000515531,0.00042971267,0.000029811346,0.0004479011,0.046047814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972969,0.00025078535,0.0005098517,0.0006561181,0.0005786193,0.0007076775],"domain_scores_gemma":[0.9962279,0.00026799148,0.0007266199,0.0025966724,0.000049953054,0.00013081645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007701244,0.0005351219,0.0006663979,0.00080182904,0.00024629224,0.0002881779,0.0041477536,0.00049682707,0.000017457029],"category_scores_gemma":[0.00012822667,0.0003967271,0.00025651223,0.00051101646,0.00013530212,0.00018275582,0.000662792,0.0009848096,0.0000076935985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002077333,0.0009197496,0.034615528,0.00082657137,0.00041594746,0.0004969401,0.0042201234,0.004964974,0.0012800429,0.005510016,0.18108276,0.7654596],"study_design_scores_gemma":[0.0012732021,0.0012493257,0.01589419,0.0016340652,0.000055705656,0.00030361197,0.000036642054,0.86511374,0.0013387919,0.0002836581,0.11146799,0.0013491015],"about_ca_topic_score_codex":0.095611714,"about_ca_topic_score_gemma":0.08037255,"teacher_disagreement_score":0.8601487,"about_ca_system_score_codex":0.00013879288,"about_ca_system_score_gemma":0.0004249089,"threshold_uncertainty_score":0.9998485},"labels":[],"label_agreement":null},{"id":"W6983427258","doi":"","title":"Modeling and managing noise in quantum error correction","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Noise (video); Probabilistic logic; Quantum error correction; Pauli exclusion principle; Error detection and correction; Context (archaeology); Quantum; Quantum noise","score_opus":0.011063311539271358,"score_gpt":0.21062258021923969,"score_spread":0.19955926867996832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6983427258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927242,0.000089078814,0.0051084,0.0005095389,0.0012304668,0.00012335651,0.0000019494103,0.00017284446,0.000040177467],"genre_scores_gemma":[0.85674876,0.00035706037,0.013073368,0.000023845187,0.000090803536,6.9851774e-7,0.00012289091,0.000059408583,0.12952314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988996,0.000051274037,0.00011870544,0.00047307267,0.00020498906,0.00025238853],"domain_scores_gemma":[0.99947155,0.00003594257,0.00010976036,0.00026199626,0.00005908364,0.0000616625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001823357,0.00018479944,0.00028638745,0.0005615628,0.00017527166,0.00004744815,0.00046784492,0.00015375651,0.0000024570732],"category_scores_gemma":[0.000009213304,0.00022023843,0.00007506239,0.0004210102,0.000024215806,0.0001969502,0.00017699029,0.00033642768,0.000012268127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011228771,0.0000885806,0.0004853455,0.000782168,0.00008263122,0.0003285624,0.4113163,0.43982178,0.0009635622,0.00083347416,0.0004964832,0.1446888],"study_design_scores_gemma":[0.00023967678,0.000046213747,0.0020154614,0.0003742266,0.000014031108,0.000004408563,0.035786044,0.9604048,0.000035842622,0.0008516482,0.000010564338,0.00021708518],"about_ca_topic_score_codex":0.03746782,"about_ca_topic_score_gemma":0.036748514,"teacher_disagreement_score":0.520583,"about_ca_system_score_codex":0.00003923352,"about_ca_system_score_gemma":0.00004586498,"threshold_uncertainty_score":0.9808283},"labels":[],"label_agreement":null},{"id":"W6986665580","doi":"","title":"Quantum Algorithms for Combinatorial Optimization","year":2022,"lang":"en","type":"dissertation","venue":"mediaTUM  (Technical University of Munich)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Institute for Quantum Information and Matter, California Institute of Technology; Deutsche Forschungsgemeinschaft; U.S. Department of Energy; National Science Foundation","keywords":"Combinatorial optimization; Optimization problem; Extremal optimization; Quantum computer; Optimization algorithm; Quantum; Combinatorial algorithms; Quadratic assignment problem; L-reduction","score_opus":0.009468603385014979,"score_gpt":0.23212445274790686,"score_spread":0.22265584936289187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986665580","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006949902,0.0011228842,0.97207075,0.0009963412,0.012475616,0.0016648029,0.00022708534,0.000971631,0.0035209814],"genre_scores_gemma":[0.05858285,0.0011391598,0.9253615,0.00015866206,0.00092185364,0.000019047462,0.006016558,0.00019339121,0.007606939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784374,0.00014873782,0.00033606193,0.00066880893,0.000630019,0.00037261078],"domain_scores_gemma":[0.9978892,0.0004038446,0.0005064654,0.00082565,0.00023047828,0.00014432437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005029009,0.0003032823,0.0005702812,0.00025460895,0.00049589475,0.00004022193,0.0027711445,0.00042239422,0.00011542745],"category_scores_gemma":[0.0001556985,0.00036472757,0.00037695654,0.0005692627,0.00008738469,0.00015249485,0.0005964053,0.00080884824,0.000004281164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018018795,0.0036522106,0.000033225446,0.0020718223,0.0008300207,0.00037840594,0.012647746,0.27163115,0.001366284,0.4382977,0.07641279,0.19087678],"study_design_scores_gemma":[0.001769197,0.0007130345,0.00011718016,0.000106004096,0.00011136426,0.000008942261,0.0004970124,0.943238,0.00010924934,0.0070733647,0.04561929,0.0006373568],"about_ca_topic_score_codex":0.00010200196,"about_ca_topic_score_gemma":0.000027557764,"teacher_disagreement_score":0.67160684,"about_ca_system_score_codex":0.00013252533,"about_ca_system_score_gemma":0.00027939354,"threshold_uncertainty_score":0.9998805},"labels":[],"label_agreement":null},{"id":"W6990497966","doi":"","title":"Dissipative non-equilibrium and topologically-protected dynamics of central-spin systems","year":2020,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; European Commission; Villum Fonden","keywords":"Dissipative system; Dissipation; Quantum; Quantum dissipation; Quantum system; Qubit; Open quantum system; Quantum dynamics; Quantum operation","score_opus":0.009924832773218878,"score_gpt":0.2292381720466676,"score_spread":0.21931333927344873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990497966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98598814,0.00041580285,0.00048584992,0.00014206764,0.002272422,0.0012811627,0.00078838936,0.0005267709,0.00809942],"genre_scores_gemma":[0.9884189,0.000060231334,0.010178488,0.00007494905,0.000068208465,0.000056669538,0.00041570104,0.00008976525,0.0006370884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544936,0.00041736494,0.0010376046,0.0015082232,0.0007744396,0.00081301195],"domain_scores_gemma":[0.99703944,0.00026612513,0.0009779359,0.0008674341,0.00036328394,0.00048580495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004009378,0.0008040999,0.0011356404,0.0002733734,0.00047788065,0.00022461379,0.0017007365,0.00068991625,0.000011839007],"category_scores_gemma":[0.00048686916,0.00073821825,0.00028751534,0.0008986711,0.00012252573,0.00040439307,0.0006255172,0.0016661084,0.000015266207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033054885,0.0004897508,0.00008679505,0.0034489066,0.0006689581,0.00048677338,0.00031139769,0.0025540835,0.049421903,0.5543589,0.000009629047,0.38783237],"study_design_scores_gemma":[0.0020645955,0.0019489967,0.0102589745,0.0026956785,0.0002445344,0.0001541271,0.0006180671,0.90584636,0.027118638,0.04150522,0.004073624,0.003471204],"about_ca_topic_score_codex":0.00029685438,"about_ca_topic_score_gemma":0.000112214366,"teacher_disagreement_score":0.90329224,"about_ca_system_score_codex":0.00026748626,"about_ca_system_score_gemma":0.000090857684,"threshold_uncertainty_score":0.9995069},"labels":[],"label_agreement":null},{"id":"W6991554287","doi":"","title":"How to Reconcile COTS Components and Tailored Future-Proof Data Acquisition System in Flight Test Instrumentation","year":2023,"lang":"en","type":"article","venue":"UA Campus Repository (The University of Arizona)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Instrumentation (computer programming); Interoperability; Standardization; Automatic test equipment; Data acquisition; Integration testing; Software; Test (biology); System integration; System testing","score_opus":0.011001164635206923,"score_gpt":0.19190334560539768,"score_spread":0.18090218097019076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991554287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9802904,0.000044040986,0.01563023,0.002522417,0.0007542032,0.00032369368,0.000019930583,0.00015860019,0.0002564996],"genre_scores_gemma":[0.99425435,0.0000046543187,0.0051564365,0.00003231676,0.0001080101,4.5366411e-7,0.000041589872,0.000006255949,0.00039596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988313,0.00011688775,0.00013349055,0.00045021193,0.00027631377,0.00019185283],"domain_scores_gemma":[0.9989103,0.00012727523,0.00014727429,0.0006685617,0.000063385094,0.00008321645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026854128,0.000120672805,0.00017399469,0.00019155758,0.00039210962,0.00010551077,0.0009950158,0.00006179835,5.391841e-7],"category_scores_gemma":[0.0000137845045,0.00011292003,0.000030764568,0.0005328708,0.00008008727,0.00035342012,0.000823822,0.00013421189,0.000007205723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005365106,0.00082202716,0.08479821,0.0015026032,0.0005207965,0.0028190895,0.059699744,0.02610796,0.30434242,0.012955527,0.024860363,0.48103476],"study_design_scores_gemma":[0.0010302786,0.00027893038,0.10787417,0.00026441884,0.00002520626,0.0001492759,0.0030782563,0.8755305,0.0030559814,0.00010222074,0.00829088,0.00031989947],"about_ca_topic_score_codex":0.00012643516,"about_ca_topic_score_gemma":0.000030835465,"teacher_disagreement_score":0.8494225,"about_ca_system_score_codex":0.00008627317,"about_ca_system_score_gemma":0.00004687242,"threshold_uncertainty_score":0.46047452},"labels":[],"label_agreement":null},{"id":"W6993003267","doi":"","title":"Near-Term Quantum Algorithms for Classical Sampling","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum algorithm; Markov chain Monte Carlo; Sampling (signal processing); Markov chain; Quantum phase estimation algorithm; Quantum; Quantum computer; Scaling; Quantum state","score_opus":0.024167908489620988,"score_gpt":0.24947823451063944,"score_spread":0.22531032602101844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6993003267","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94463414,0.00008541245,0.05024481,0.0016780589,0.0022243431,0.00047884457,0.00006150457,0.00055298896,0.000039888284],"genre_scores_gemma":[0.02193725,0.00013055619,0.50340396,0.00007655058,0.00069911144,0.0000052202354,0.0014121305,0.00020413884,0.47213104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980648,0.000051109477,0.00019645285,0.0007713797,0.00039283384,0.0005234084],"domain_scores_gemma":[0.99853677,0.00020989424,0.00030662504,0.000584533,0.00020703109,0.00015515198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024177771,0.0003354231,0.00054282387,0.00027705394,0.00056348916,0.00014720907,0.0014731556,0.00035193015,0.000009855335],"category_scores_gemma":[0.00002715559,0.00037209006,0.00038366017,0.0004171862,0.00009199772,0.00018473568,0.00026168715,0.00041233213,0.000056899305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003734543,0.00044349476,0.00018572384,0.0025148375,0.0007798859,0.00033378584,0.43473166,0.0076445863,0.0040905457,0.014638142,0.012812999,0.5214509],"study_design_scores_gemma":[0.001100547,0.0004504654,0.0049562305,0.0005800633,0.00011333726,0.000010107413,0.014915588,0.9692941,0.0003552257,0.004237311,0.0030900699,0.000897003],"about_ca_topic_score_codex":0.0025836297,"about_ca_topic_score_gemma":0.002535885,"teacher_disagreement_score":0.9616495,"about_ca_system_score_codex":0.00005442137,"about_ca_system_score_gemma":0.00019413033,"threshold_uncertainty_score":0.9998731},"labels":[],"label_agreement":null},{"id":"W6996099143","doi":"","title":"Quantum Fan-out is Powerful","year":2005,"lang":"en","type":"article","venue":"UvA-DARE (University of Amsterdam)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Logarithm; Quantum Fourier transform; Quantum; Constant (computer programming); Fourier transform; Quantum algorithm; Quantum gate; Basis (linear algebra)","score_opus":0.00939404170574944,"score_gpt":0.20403929185912043,"score_spread":0.19464525015337097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996099143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39146468,0.00019874774,0.5866689,0.012836826,0.00054279645,0.00016631691,0.000028745775,0.00034160033,0.0077513806],"genre_scores_gemma":[0.93628985,0.000016991065,0.0597962,0.0007083721,0.00013332935,5.4697328e-8,0.0000042381375,0.000012747749,0.0030382476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985502,0.000060917184,0.00015366303,0.00049463025,0.00036389934,0.0003767425],"domain_scores_gemma":[0.99879307,0.00006513741,0.00016102257,0.00070522033,0.00011738583,0.00015818808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016692762,0.00019469087,0.00027699067,0.00019936408,0.000253427,0.00006153572,0.001486748,0.00009822478,0.00019122474],"category_scores_gemma":[0.000009140368,0.00021969521,0.00019290614,0.0003333082,0.00012768201,0.0004476218,0.0006847933,0.00023469234,0.00035862467],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083543804,0.0005617072,0.0014642475,0.00014994247,0.0002378165,0.0003103167,0.0741763,0.0014894082,0.0041415473,0.024895376,0.07049607,0.8219937],"study_design_scores_gemma":[0.0021356111,0.0005927913,0.012294078,0.00023016035,0.00004640455,0.000096572476,0.001639916,0.62993777,0.0029015003,0.0033615062,0.3456424,0.0011212993],"about_ca_topic_score_codex":0.000105537176,"about_ca_topic_score_gemma":0.00005495502,"teacher_disagreement_score":0.8208724,"about_ca_system_score_codex":0.000047807695,"about_ca_system_score_gemma":0.000078058154,"threshold_uncertainty_score":0.8958911},"labels":[],"label_agreement":null},{"id":"W6996104572","doi":"","title":"Quantum Technologies Reports 2013 Third Quarter Financial Results - KCTV5","year":2013,"lang":"en","type":"other","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Key (lock); Quantum; Quantum computer","score_opus":0.0072157591645541875,"score_gpt":0.21356502985970138,"score_spread":0.2063492706951472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996104572","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007601632,0.00186816,0.24234512,0.010424428,0.005353714,0.00086773105,0.000025264173,0.012084469,0.7269551],"genre_scores_gemma":[0.0009846955,0.0001865928,0.13981166,0.00045991104,0.00088409137,0.00006158549,0.000026738697,0.00025405787,0.8573307],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967981,0.000058563513,0.00064010016,0.0013269773,0.00048840087,0.0006878471],"domain_scores_gemma":[0.99681413,0.0000780961,0.0006169753,0.0023351882,0.00006267315,0.0000929396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002931607,0.0005741206,0.0005903629,0.0005353594,0.00013254285,0.00032437727,0.0016365746,0.0007785365,0.000081215716],"category_scores_gemma":[0.00014382273,0.00042104232,0.00019781942,0.00046673208,0.00014347235,0.00012822439,0.0008511994,0.0007297312,0.000757137],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013867888,0.000034599467,0.0000030688982,0.000023053426,0.000017841216,0.00018777071,0.00007538379,0.00002376037,0.0000052541254,0.009852297,0.96938723,0.02038837],"study_design_scores_gemma":[0.00019444154,0.0001425406,0.000043154643,0.00022729726,0.000006887921,0.00019326997,0.000015531687,0.055770546,0.000044978617,0.0100293355,0.9326416,0.0006903847],"about_ca_topic_score_codex":0.00089147675,"about_ca_topic_score_gemma":0.00008796859,"teacher_disagreement_score":0.13037558,"about_ca_system_score_codex":0.000024678047,"about_ca_system_score_gemma":0.00014456623,"threshold_uncertainty_score":0.99982417},"labels":[],"label_agreement":null},{"id":"W6996117459","doi":"","title":"Quantum Technologies Reports 2013 Fourth Quarter Financial Results - FOX 25/48","year":2014,"lang":"en","type":"other","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Payment; Financial services; Government (linguistics)","score_opus":0.0070194802168083775,"score_gpt":0.2149436938355187,"score_spread":0.20792421361871033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996117459","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003727529,0.0009948484,0.6804871,0.0070616514,0.005115891,0.00050105754,0.000021154998,0.0076128813,0.29816812],"genre_scores_gemma":[0.008789088,0.00015987386,0.281987,0.0009059231,0.001890287,0.000065289176,0.000057231387,0.000560082,0.70558524],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965967,0.00008211089,0.00066792505,0.0014048305,0.0005276169,0.0007208051],"domain_scores_gemma":[0.9966319,0.000095293195,0.00071187865,0.0024206736,0.000060648446,0.000079587386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004808182,0.0005991263,0.00066546595,0.00055568037,0.00015157225,0.00025556592,0.0016478366,0.00073175103,0.00006195741],"category_scores_gemma":[0.00021689122,0.0004546974,0.00023044791,0.00043881653,0.00014393464,0.000080031336,0.0007842356,0.0006983544,0.0004757676],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002495706,0.000032928758,0.0000031009904,0.000029923203,0.00001896936,0.0002661539,0.00006152174,0.000051336192,0.0000025565591,0.008480914,0.94750965,0.04354047],"study_design_scores_gemma":[0.00026005215,0.00014306315,0.000038127197,0.0002333321,0.000008710406,0.0002688793,0.000007222549,0.07940729,0.000025253858,0.01051122,0.9084335,0.0006633643],"about_ca_topic_score_codex":0.00035257905,"about_ca_topic_score_gemma":0.00015384067,"teacher_disagreement_score":0.4074171,"about_ca_system_score_codex":0.000024330553,"about_ca_system_score_gemma":0.00014350146,"threshold_uncertainty_score":0.9997905},"labels":[],"label_agreement":null},{"id":"W6996229852","doi":"","title":"Quantum Technologies Posts 2012 Fourth Quarter and Annual Financial Results [Travel &amp;amp; Leisure Close","year":2013,"lang":"en","type":"other","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Work (physics); Government (linguistics); Financial services; Key (lock)","score_opus":0.009873712551363172,"score_gpt":0.2309546236248451,"score_spread":0.2210809110734819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996229852","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004751074,0.0073919534,0.79332364,0.015817469,0.0049796286,0.0021081795,0.00093280815,0.0089335255,0.16176172],"genre_scores_gemma":[0.0029617155,0.00034919978,0.2881026,0.0003551025,0.0011482681,0.000040280258,0.000082994186,0.00033939496,0.70662045],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99695396,0.00009201148,0.00046249927,0.0012578672,0.00044482586,0.00078884745],"domain_scores_gemma":[0.9977852,0.00012834049,0.00035330042,0.0014959029,0.00009272258,0.00014450903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028127636,0.0006828815,0.0006811297,0.0005334981,0.00017438312,0.0003072013,0.0015118496,0.00086167245,0.00009078808],"category_scores_gemma":[0.00011740234,0.0005173947,0.00014156355,0.000379934,0.00024437104,0.00022805596,0.0008767388,0.0008469132,0.0006697294],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008302086,0.00005619895,0.000016455344,0.000046547284,0.000029908184,0.000017003602,0.0004568611,0.0000073043416,0.000016051732,0.013830856,0.93479365,0.050720863],"study_design_scores_gemma":[0.000735455,0.00017786461,0.0007573132,0.0002744293,0.000015195216,0.00013311549,0.000048902737,0.0103658615,0.00001524684,0.0054161595,0.98102295,0.0010374801],"about_ca_topic_score_codex":0.00047074596,"about_ca_topic_score_gemma":0.00053364947,"teacher_disagreement_score":0.54485875,"about_ca_system_score_codex":0.000018992705,"about_ca_system_score_gemma":0.00012507208,"threshold_uncertainty_score":0.9997278},"labels":[],"label_agreement":null},{"id":"W7001547648","doi":"","title":"La Confédération, le genre biographique et l’histoire du Canada","year":2017,"lang":"fr","type":"article","venue":"Project Muse (Johns Hopkins University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Biography; Subject (documents); Work (physics); Theme (computing)","score_opus":0.014589319006905634,"score_gpt":0.21168592207541145,"score_spread":0.19709660306850582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7001547648","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043100018,0.000111553534,0.06509471,0.037003394,0.0051171687,0.0008162334,0.00021916337,0.00039434992,0.8481434],"genre_scores_gemma":[0.91933846,0.06552097,0.0114885,0.0011673222,0.000668166,0.0000027238784,0.00003640686,0.000075671145,0.0017017507],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974007,0.0005767394,0.00023422738,0.00080984243,0.0003670825,0.00061140093],"domain_scores_gemma":[0.99754995,0.00020819117,0.00040654087,0.0012954769,0.00031609318,0.0002237374],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004185174,0.0004085505,0.00035524607,0.00240159,0.0026441112,0.0007301927,0.0022148178,0.000252819,0.000009315422],"category_scores_gemma":[0.00013208977,0.00047376103,0.00020866517,0.0029004838,0.0006008578,0.000968269,0.0010339143,0.0006665971,0.000007350852],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057693942,0.00048640685,0.0013085249,0.00023180331,0.00032539802,0.0068609845,0.009956854,0.0023303782,0.0000114367085,0.47862166,0.0069304635,0.4928784],"study_design_scores_gemma":[0.0008441159,0.00009355956,0.0010372816,0.00015292589,0.000041857835,0.00020167655,0.00018974941,0.06478483,0.00007762842,0.00000978428,0.9320404,0.0005261964],"about_ca_topic_score_codex":0.9830167,"about_ca_topic_score_gemma":0.9480997,"teacher_disagreement_score":0.9251099,"about_ca_system_score_codex":0.00027240155,"about_ca_system_score_gemma":0.0053205467,"threshold_uncertainty_score":0.9997714},"labels":[],"label_agreement":null},{"id":"W7006073326","doi":"","title":"Synthesis, design and test of reversible circuits employing classical techniques","year":2014,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Reversible computing; Toffoli gate; Electronic circuit; Logic gate; Computation; Debugging; Quantum computer; Sequential logic; Truth table","score_opus":0.016539802401522436,"score_gpt":0.23509542720184323,"score_spread":0.21855562480032079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7006073326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9589376,0.0012009019,0.0050914716,0.00020254977,0.0024664765,0.0027097913,0.0004005212,0.0030100616,0.02598065],"genre_scores_gemma":[0.90455776,0.00013982673,0.094106436,0.00013069536,0.0000750158,0.000075819444,0.00003250532,0.00012920838,0.0007527059],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99588776,0.0005241968,0.00083317,0.0013275654,0.00075929885,0.0006680204],"domain_scores_gemma":[0.9950442,0.0025727567,0.00072006055,0.0010393397,0.00032403157,0.00029962827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015454876,0.0006985808,0.0009496693,0.00054557185,0.0008350176,0.00017553478,0.0016187921,0.0006970841,0.000010262],"category_scores_gemma":[0.0019839131,0.00069066836,0.0002592733,0.0006744934,0.000096272284,0.00046183207,0.00037164704,0.0013288317,0.000022013195],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017374656,0.0001612593,0.000026666024,0.0005207342,0.000083992025,0.00004333537,0.000017586115,0.00006679896,0.049712338,0.03667156,0.000019042871,0.9126593],"study_design_scores_gemma":[0.0005372618,0.0008371386,0.0013850975,0.0037848782,0.00023301097,0.00016901616,0.000041938976,0.013789135,0.9107185,0.045787252,0.02045835,0.0022583995],"about_ca_topic_score_codex":0.000054545526,"about_ca_topic_score_gemma":0.000025631187,"teacher_disagreement_score":0.9104009,"about_ca_system_score_codex":0.00014821305,"about_ca_system_score_gemma":0.00008659174,"threshold_uncertainty_score":0.99955446},"labels":[],"label_agreement":null},{"id":"W7015809503","doi":"","title":"Türkiye, Finlandiya ve Kanada’da Matematik Ders Kitaplarındaki Bazı Ortak Konuların Göstergebilimsel Analiz","year":2020,"lang":"en","type":"dissertation","venue":"Hacettepe University Institutional Repository (hacettepe.edu.tr)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Decimal; Semiotics; Function (biology); Natural (archaeology); Root (linguistics); Power (physics); Mathematical problem; Feature (linguistics); Expression (computer science); Conceptual model","score_opus":0.008654747763008879,"score_gpt":0.2026811832444938,"score_spread":0.19402643548148493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015809503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6162155,0.0037362885,0.19485478,0.011965578,0.02709256,0.0046597803,0.0007164095,0.004170041,0.13658902],"genre_scores_gemma":[0.83805686,0.000324065,0.08083712,0.005885296,0.00406672,0.000056762256,0.0060323854,0.00044745908,0.064293355],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9919932,0.0005784202,0.001174424,0.0025950663,0.002318477,0.0013404273],"domain_scores_gemma":[0.9951234,0.00032896508,0.0012022232,0.0017195828,0.0007223256,0.0009035431],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0004705809,0.001446601,0.0014185633,0.0010291479,0.0031797756,0.00086933386,0.0035917754,0.0010929335,0.0000973102],"category_scores_gemma":[0.00017530171,0.0016053938,0.00093824643,0.0016700337,0.00046869888,0.0011339611,0.0007289442,0.0022734848,0.00027803268],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029434967,0.0034944126,0.0052688313,0.00898579,0.009191762,0.06634341,0.034333557,0.113846295,0.022407806,0.21572076,0.4902174,0.027246494],"study_design_scores_gemma":[0.006339628,0.0010424356,0.012297734,0.0037940103,0.0015464476,0.002555218,0.0041562193,0.22473128,0.0087824175,0.0015827238,0.7249895,0.008182395],"about_ca_topic_score_codex":0.00074668584,"about_ca_topic_score_gemma":0.0003169486,"teacher_disagreement_score":0.2347721,"about_ca_system_score_codex":0.0011511095,"about_ca_system_score_gemma":0.0031591004,"threshold_uncertainty_score":0.9998284},"labels":[],"label_agreement":null},{"id":"W7018845097","doi":"","title":"Efficient Characterization of a Unitary Quantum Gate via a Projective Rabi Experiment","year":2022,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Robustness (evolution); Scaling; Quantum; Unitary state; Projective test; Construct (python library); Topology (electrical circuits); Quantum system; Quantum gate","score_opus":0.00652359292566192,"score_gpt":0.20041176876054564,"score_spread":0.1938881758348837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018845097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99254215,0.00006629932,0.0058733937,0.00025018366,0.0006212635,0.00044999155,0.000039289003,0.00009741833,0.00005998948],"genre_scores_gemma":[0.9524214,0.000042617754,0.010461541,0.000026724683,0.00006499958,0.0000047855924,0.0010215216,0.000055620625,0.035900775],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982879,0.00017512993,0.0002041432,0.00054946,0.0005077479,0.00027561237],"domain_scores_gemma":[0.9986445,0.000034498888,0.00055440277,0.000495007,0.00019730549,0.00007431662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019819094,0.00026886686,0.00045194483,0.00048125142,0.00029347,0.000020228117,0.00094678235,0.00012974723,0.000068867426],"category_scores_gemma":[0.0000056498175,0.0003019086,0.00019890578,0.0005797147,0.000064073654,0.00009292363,0.00034524963,0.00031646097,0.000005323616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035101525,0.0007415133,0.000037614052,0.00063811446,0.00028270786,0.000120242614,0.7866474,0.014179568,0.1748477,0.002095475,0.0000679666,0.0199907],"study_design_scores_gemma":[0.0009379793,0.00085709005,0.004862665,0.00033934042,0.0000882829,0.000013176765,0.053319298,0.9220896,0.016300755,0.00023415452,0.00027872386,0.0006789572],"about_ca_topic_score_codex":0.007323489,"about_ca_topic_score_gemma":0.00037207245,"teacher_disagreement_score":0.90791,"about_ca_system_score_codex":0.000102051454,"about_ca_system_score_gemma":0.00017741404,"threshold_uncertainty_score":0.9999433},"labels":[],"label_agreement":null},{"id":"W7022302646","doi":"","title":"Dayton, Ohio","year":2009,"lang":"en","type":"other","venue":"OhioLink ETD Center (Ohio Library and Information Network)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"National park; George (robot); Government (linguistics)","score_opus":0.005554429836226424,"score_gpt":0.19095861012731,"score_spread":0.18540418029108358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022302646","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000029893085,0.0011045216,0.048081946,0.0013151332,0.0012788756,0.00031367742,0.0000453492,0.0012528643,0.94660467],"genre_scores_gemma":[0.0056546046,0.017783828,0.30108237,0.08891971,0.019891666,0.00008845269,0.004975462,0.0010573006,0.5605466],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99798334,0.00010357402,0.0005745873,0.00041298836,0.00029291725,0.00063257926],"domain_scores_gemma":[0.99849296,0.000049471233,0.00046903305,0.00072144443,0.000014154667,0.00025292614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012940538,0.00050193677,0.0004463313,0.0003566153,0.00019950929,0.0007674716,0.0010511333,0.00039944547,0.00037538522],"category_scores_gemma":[0.0000045230186,0.0004359059,0.00014094141,0.0005083546,0.00005978145,0.0044411193,0.00058467535,0.00059245573,0.00015295034],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054428615,0.000018897617,0.00000776434,0.000056338286,0.000027546872,0.000005263703,0.00010456058,0.00047289018,8.0952844e-8,0.3842981,0.50293946,0.11206363],"study_design_scores_gemma":[0.00043543527,0.00007950177,0.00021673774,0.00047056307,0.000007296997,0.00004665133,5.561673e-7,0.069291756,0.0000031159773,0.001632977,0.92734563,0.00046978611],"about_ca_topic_score_codex":9.598063e-8,"about_ca_topic_score_gemma":3.6948305e-7,"teacher_disagreement_score":0.42440614,"about_ca_system_score_codex":0.0000070231968,"about_ca_system_score_gemma":0.00007040137,"threshold_uncertainty_score":0.99980927},"labels":[],"label_agreement":null},{"id":"W7022427539","doi":"","title":"","year":2021,"lang":"fr","type":"other","venue":"Directory of Open access Books (OAPEN Foundation)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Position (finance); Work (physics); Research methodology; Government (linguistics)","score_opus":0.08835521553004438,"score_gpt":0.3856430487722897,"score_spread":0.29728783324224534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022427539","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032082357,0.0037854475,0.16624323,0.0072758836,0.014228976,0.006106824,0.000014870708,0.000504352,0.76975805],"genre_scores_gemma":[0.04785278,0.0007058663,0.117076196,0.0033664186,0.0024717671,0.00051171007,0.0008222362,0.0010100736,0.82618296],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9865671,0.0022451065,0.0030166476,0.004309479,0.0020544252,0.0018072763],"domain_scores_gemma":[0.98701054,0.0016470099,0.004301526,0.004521883,0.0016631641,0.0008559023],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.002367997,0.0020957047,0.0035491902,0.0012316427,0.0015339743,0.02652795,0.032370448,0.00050969096,0.050324664],"category_scores_gemma":[0.0008207236,0.0022464704,0.00095746364,0.0025573457,0.0013304319,0.00771633,0.030383637,0.001679698,0.0005004451],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007322448,0.00083031115,0.004655617,0.0009620301,0.00093701534,0.0002885676,0.0014759629,0.0045468383,0.0009956481,0.22173136,0.00068135234,0.7628221],"study_design_scores_gemma":[0.002259445,0.0002351184,0.08046373,0.0054811467,0.00018982151,0.00016300056,0.000060702434,0.08903889,0.0028995734,0.007745371,0.8087526,0.002710626],"about_ca_topic_score_codex":0.011825376,"about_ca_topic_score_gemma":0.0040541315,"teacher_disagreement_score":0.8080712,"about_ca_system_score_codex":0.00048013875,"about_ca_system_score_gemma":0.004295492,"threshold_uncertainty_score":0.9997659},"labels":[],"label_agreement":null},{"id":"W7022561907","doi":"","title":"Northern Canada","year":2005,"lang":"en","type":"article","venue":"Digital Commons - University of South Florida (University of South Florida)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Liquation; Diafiltration; Emperipolesis; Triacetin; Durvalumab","score_opus":0.007738406545095336,"score_gpt":0.15570299212505073,"score_spread":0.1479645855799554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022561907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9206958,0.000059087317,0.072096616,0.0010206096,0.00036175377,0.0001713417,0.0004353901,0.00019599614,0.004963403],"genre_scores_gemma":[0.99237216,0.0000032165647,0.006750095,0.000035606798,0.0001048284,2.0726649e-8,0.000027311104,0.000016670861,0.00069008203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978061,0.000053200813,0.0002302035,0.000620217,0.000741821,0.00054849824],"domain_scores_gemma":[0.99786943,0.00011916962,0.0003899069,0.00091751694,0.00034788437,0.00035606945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014468294,0.0003368234,0.0005507865,0.00029986582,0.00062607514,0.00006809859,0.0024890269,0.00013951746,0.00004069133],"category_scores_gemma":[0.00002693159,0.00044387244,0.00031575537,0.0008088835,0.00039923607,0.0008818266,0.001164738,0.00041248256,0.000052209343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013863537,0.0011600115,0.26320967,0.0007305429,0.0023907921,0.0023017654,0.2686559,0.13261712,0.00037098472,0.025985686,0.010012234,0.29117894],"study_design_scores_gemma":[0.013147656,0.0014561333,0.16354388,0.0008162123,0.00051501725,0.00013828171,0.1078106,0.49766767,0.00074689946,0.0015017797,0.20679294,0.0058629406],"about_ca_topic_score_codex":0.028577479,"about_ca_topic_score_gemma":0.09180962,"teacher_disagreement_score":0.36505055,"about_ca_system_score_codex":0.00022282958,"about_ca_system_score_gemma":0.00071043277,"threshold_uncertainty_score":0.9998013},"labels":[],"label_agreement":null},{"id":"W7023242630","doi":"","title":"Obligations Concerning Digital Rights Management (DRM) in International Law - What are the Strategies for Developing Countries to Deal with DRM from Legal Perspective?","year":2025,"lang":"en","type":"other","venue":"Lund University Publications Student Papers (Lund University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Safeguarding; Treaty; Developing country; Intellectual property; General partnership; Flexibility (engineering); Digital rights management; International law; Free trade; Digital rights","score_opus":0.007545979419360478,"score_gpt":0.22216372522080785,"score_spread":0.21461774580144738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023242630","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014940558,0.00005033215,0.13513671,0.008320509,0.00021696636,0.0007048729,0.00019028725,0.00024964317,0.8549813],"genre_scores_gemma":[0.0008330629,0.00012655402,0.022131842,0.00041746921,0.000102597405,0.000004257635,0.00013683511,0.000036757443,0.9762106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982629,0.00006311536,0.00014563529,0.0008004459,0.00039876447,0.00032917951],"domain_scores_gemma":[0.9987133,0.00020275715,0.0002196477,0.0004827609,0.0002876126,0.00009393029],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00007555343,0.0003097836,0.00026640572,0.0010579224,0.00090125157,0.0020286653,0.0023815853,0.00011981476,0.000024315837],"category_scores_gemma":[0.000003579028,0.0002907022,0.000102998354,0.00122133,0.00021031314,0.0014264635,0.0009002489,0.0002540604,0.000007166703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018209483,0.000058870675,0.00015222473,0.000012315059,0.00046742987,0.00003763227,0.0018090038,0.0012464012,2.1791661e-7,0.9938343,0.001968575,0.00039480408],"study_design_scores_gemma":[0.00073634036,0.000029166955,0.000658402,0.00036201772,0.00007805672,0.0000017122998,0.033864044,0.00058171304,4.1104482e-7,0.0011876986,0.9621483,0.0003521577],"about_ca_topic_score_codex":0.0014875589,"about_ca_topic_score_gemma":0.010993519,"teacher_disagreement_score":0.99264663,"about_ca_system_score_codex":0.00082811003,"about_ca_system_score_gemma":0.0004304801,"threshold_uncertainty_score":0.9999545},"labels":[],"label_agreement":null},{"id":"W7023473155","doi":"","title":"The Hitchhiker","year":2012,"lang":"en","type":"article","venue":"Sound Ideas (University of Puget Sound)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Ridiculous; Perspective (graphical); Term (time)","score_opus":0.009705828871979126,"score_gpt":0.20403532515846365,"score_spread":0.19432949628648452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023473155","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66224855,0.0006386238,0.33344847,0.000967998,0.00061343977,0.00007399844,0.0000022820227,0.00012548684,0.0018811561],"genre_scores_gemma":[0.9839397,0.000017163358,0.014411548,0.000084584855,0.00014644707,1.0935513e-7,0.00000129467,0.0000069045527,0.0013922324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988436,0.00009178877,0.000102514074,0.00021238942,0.00029858566,0.00045110795],"domain_scores_gemma":[0.998873,0.00020622378,0.00012447429,0.00057128473,0.00007528524,0.00014971165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004624405,0.00012590263,0.00014653185,0.00006963708,0.00087154756,0.00008929686,0.0012028969,0.000061862775,0.000020400314],"category_scores_gemma":[0.000031111806,0.00010834568,0.00014191608,0.0003398695,0.00021681398,0.00043229296,0.0005091475,0.00019667496,0.00011127753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058640912,0.00004639825,0.0027307046,0.000008157831,0.00003957513,0.0000044971407,0.0033535347,0.00019568152,0.000007634556,0.98902917,0.0022321688,0.002346604],"study_design_scores_gemma":[0.00021470513,0.000035462213,0.0075985948,0.000007489994,0.000010899833,0.000021725296,0.00059618236,0.0168836,0.0000015485492,0.9595438,0.0149293,0.00015668798],"about_ca_topic_score_codex":0.00010094357,"about_ca_topic_score_gemma":0.000043576765,"teacher_disagreement_score":0.32169116,"about_ca_system_score_codex":0.000037117326,"about_ca_system_score_gemma":0.000049075465,"threshold_uncertainty_score":0.67033273},"labels":[],"label_agreement":null},{"id":"W7023635858","doi":"","title":"Open for Business Radio Show June 24","year":2017,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Subpoena; Pro forma; Web site; Demon; The Internet","score_opus":0.009926497060192153,"score_gpt":0.21020540389170114,"score_spread":0.20027890683150898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023635858","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014267679,0.00030152962,0.00066464796,0.000955196,0.002221597,0.00085774664,0.00010812212,0.00023998074,0.99464977],"genre_scores_gemma":[0.000022101658,0.00008245104,0.054974053,0.00023682042,0.0003599732,0.000028426259,0.00007788371,0.00009195716,0.9441263],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984184,0.000046278456,0.0004380227,0.00037485332,0.00034325008,0.00037922055],"domain_scores_gemma":[0.99754137,0.00012216832,0.0008806256,0.001104848,0.00022903072,0.00012193126],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003514867,0.0003784924,0.00055969245,0.0000919633,0.00022547161,0.0005943376,0.003519844,0.000318725,0.015354416],"category_scores_gemma":[0.00016431125,0.0003448801,0.0001605118,0.0000108733,0.000110941706,6.912012e-7,0.00090819434,0.00023432885,0.0013332808],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019210589,0.000028692812,2.0089364e-7,0.0003542587,0.000048193917,0.000011122343,0.00007792362,0.00069034315,9.668113e-8,0.00019053654,0.9760794,0.022500023],"study_design_scores_gemma":[0.00069431687,0.000084442254,0.00000357162,0.00049673975,0.000022220704,0.000087216205,0.000004336167,0.0040775235,0.000004260566,0.00007943304,0.9940253,0.00042063123],"about_ca_topic_score_codex":0.0022910011,"about_ca_topic_score_gemma":0.0006309391,"teacher_disagreement_score":0.054309405,"about_ca_system_score_codex":0.00002699137,"about_ca_system_score_gemma":0.00009304806,"threshold_uncertainty_score":0.99990034},"labels":[],"label_agreement":null},{"id":"W7023822939","doi":"","title":"Palaeoecological implications from an 11,500 year old thermokarst lake in Northwest Canada (Herschel Island, Yukon)&#13;\\n&#13;\\n","year":2014,"lang":"en","type":"other","venue":"Helmholtz-Zentrum für Polar-und Meeresforschung (Alfred-Wegener-Institut)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Thermokarst; Holocene; Ostracod; Paleoecology; Brackish water; Radiocarbon dating; Glacial period; Paleoclimatology; Cladophora","score_opus":0.008488982159575283,"score_gpt":0.23975508196546352,"score_spread":0.23126609980588825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023822939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5153429,0.0138805155,0.106886074,0.019308511,0.028722543,0.010967423,0.08155838,0.006976482,0.21635716],"genre_scores_gemma":[0.8147248,0.0016112573,0.03910989,0.012161831,0.014138926,0.0008439703,0.027228758,0.0030464684,0.08713408],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9906098,0.0006444901,0.0016071186,0.0031323098,0.0014865162,0.0025197293],"domain_scores_gemma":[0.9933334,0.00032652667,0.0010007148,0.003843006,0.00018480101,0.0013115744],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0007190975,0.0019033429,0.0019059925,0.00085031166,0.0008005382,0.0007932981,0.0049763285,0.0014517853,0.0010316481],"category_scores_gemma":[0.00017721877,0.0017310131,0.00052166235,0.0013226765,0.00044676804,0.0004655098,0.0012093536,0.0019697393,0.00032038917],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013861473,0.0019549476,0.21990113,0.00047642112,0.0013987842,0.0012491044,0.0013152775,0.012274965,0.00060652825,0.038097356,0.68637264,0.036214225],"study_design_scores_gemma":[0.0026982047,0.00028655273,0.061408427,0.0005363323,0.00018320676,0.00009242593,0.000058153248,0.023988806,0.00011543507,0.0012230892,0.9065975,0.0028118643],"about_ca_topic_score_codex":0.67135715,"about_ca_topic_score_gemma":0.99513245,"teacher_disagreement_score":0.3237753,"about_ca_system_score_codex":0.00056042377,"about_ca_system_score_gemma":0.0022388177,"threshold_uncertainty_score":0.99988157},"labels":[],"label_agreement":null},{"id":"W7023903503","doi":"","title":"Polymérisation du lactide par des catalyseurs β-diketiminate de zinc et de magnésium","year":2011,"lang":"fr","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Zinc; Pharmaceutical technology; Grignard reagent; Chemical reduction","score_opus":0.00506067770696904,"score_gpt":0.15546840939417106,"score_spread":0.150407731687202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023903503","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07721859,0.0023309074,0.036700457,0.015064019,0.0012863051,0.00046557898,0.00045293383,0.000093750146,0.8663875],"genre_scores_gemma":[0.77384317,0.0008554274,0.06054149,0.0044580535,0.0005388765,0.0000166389,0.00002626724,0.00020328337,0.15951683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.996444,0.00038990664,0.00043575247,0.0006309693,0.0012537692,0.0008456162],"domain_scores_gemma":[0.997998,0.0004471327,0.0004480754,0.0004876377,0.0000018685198,0.0006173042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000065167704,0.0005323229,0.00048462572,0.000074041774,0.00037252725,0.00013155403,0.00091880775,0.00011319193,0.00023586964],"category_scores_gemma":[0.000015005525,0.00053405383,0.00008816564,0.00016495654,0.00033661295,0.0004092407,0.0005469533,0.00046584744,4.6045447e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068711484,0.00043760947,0.08567202,0.0029282882,0.0008929429,0.003625354,0.009392516,0.004985748,0.01853259,0.47188848,0.02068863,0.3802687],"study_design_scores_gemma":[0.0012282364,0.00053677044,0.40347186,0.002165127,0.00020589535,0.0006805931,0.0011834292,0.23725723,0.07145943,0.018216955,0.26129138,0.002303097],"about_ca_topic_score_codex":0.050065156,"about_ca_topic_score_gemma":0.07862518,"teacher_disagreement_score":0.7068706,"about_ca_system_score_codex":0.000043762695,"about_ca_system_score_gemma":0.0055660154,"threshold_uncertainty_score":0.9997111},"labels":[],"label_agreement":null},{"id":"W7023912515","doi":"","title":"Prophecy of women in the holy Qur'Än with a special focus on Ibn Ḥazm's theory","year":2002,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Focus (optics); Islam; Argument (complex analysis); Feminism","score_opus":0.002277973420888974,"score_gpt":0.13094212171213024,"score_spread":0.12866414829124126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023912515","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051396973,0.0003012847,0.000704932,0.0028622923,0.00024091527,0.0003692639,0.000102026526,0.00002184061,0.99025774],"genre_scores_gemma":[0.6597601,0.0002076651,0.009620994,0.0029018074,0.0013711073,0.000050189446,0.0000052571345,0.00027012106,0.32581276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99696594,0.00019313526,0.00024901304,0.0003851016,0.0017315974,0.00047523406],"domain_scores_gemma":[0.99874765,0.00031196972,0.00028247034,0.00049829914,4.4246335e-7,0.00015917163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004371147,0.00029486924,0.00040764044,0.00007496657,0.00007544901,0.000037780188,0.0009847108,0.000044509,0.00006463583],"category_scores_gemma":[0.0000034696961,0.0001896781,0.000032667598,0.00019356325,0.00012549318,0.00008462958,0.00019174733,0.0003085873,6.4295738e-9],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006249281,0.00027427348,0.0008653736,0.00051434455,0.00024124053,0.0009952674,0.0036722952,0.0008010274,0.00017480098,0.77024305,0.033888336,0.18770507],"study_design_scores_gemma":[0.005146903,0.00426493,0.033117346,0.005070088,0.00008288584,0.00018821335,0.0061729467,0.03654969,0.005949546,0.09055599,0.8093423,0.0035591603],"about_ca_topic_score_codex":0.0018247844,"about_ca_topic_score_gemma":0.0061341296,"teacher_disagreement_score":0.775454,"about_ca_system_score_codex":0.000013261577,"about_ca_system_score_gemma":0.0010361524,"threshold_uncertainty_score":0.7734849},"labels":[],"label_agreement":null},{"id":"W7023994991","doi":"","title":"Re-Invigorating Mid-Career Faculty at a Canadian Mid-Sized College: Strategies for Professional Development and Mentorship","year":2022,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scholarship; Mentorship; Professional development; Faculty development; Professional learning community; Higher education; Professional studies; Scholarship of Teaching and Learning","score_opus":0.08768286843911519,"score_gpt":0.3031493974393006,"score_spread":0.2154665290001854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023994991","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942004,0.00007268792,0.0026013874,0.0013664573,0.0007603542,0.0005937691,0.00015953163,0.0001696025,0.00007578515],"genre_scores_gemma":[0.9896862,0.0000010475239,0.0040102373,0.0005729466,0.000061653474,0.000017609938,0.00008682592,0.000030591313,0.005532924],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99719286,0.00033857313,0.0002941566,0.0008445963,0.0005640402,0.00076577225],"domain_scores_gemma":[0.9985573,0.00017010496,0.0002104104,0.00041732375,0.00013661657,0.0005082072],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00072243507,0.00034976384,0.00032624073,0.0005028824,0.0025412876,0.0004486995,0.0013632628,0.00011662515,0.000015994487],"category_scores_gemma":[0.000026438347,0.0003756898,0.0000982763,0.0006245181,0.00007109672,0.0008831336,0.0015540123,0.0005544489,0.000008435996],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053789344,0.00043045683,0.92166847,0.00047964312,0.0005229093,0.0023631055,0.048964955,0.006615525,0.001981565,0.004770476,0.00015278945,0.011512207],"study_design_scores_gemma":[0.011670307,0.0011840131,0.71375746,0.00063670095,0.00015929864,0.0004905993,0.020393979,0.002466076,0.007140362,0.002918686,0.23495382,0.004228702],"about_ca_topic_score_codex":0.00015252693,"about_ca_topic_score_gemma":0.058267705,"teacher_disagreement_score":0.23480104,"about_ca_system_score_codex":0.0008079933,"about_ca_system_score_gemma":0.0013411739,"threshold_uncertainty_score":0.9998695},"labels":[],"label_agreement":null},{"id":"W7024140951","doi":"","title":"Quantum Technologies Reports Second Quarter 2015 Financial Results","year":2015,"lang":"de","type":"other","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Quantum computer; Key (lock); Quantum","score_opus":0.010931796317943138,"score_gpt":0.23666603961760563,"score_spread":0.2257342432996625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024140951","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016711862,0.025852565,0.103885405,0.029378848,0.048671786,0.0031220203,0.00067951623,0.012717178,0.7740215],"genre_scores_gemma":[0.016024029,0.0001893008,0.08053982,0.0010681447,0.0056764022,0.000058377227,0.00033290492,0.00056521146,0.8955458],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99320865,0.00020159165,0.0015431623,0.002569496,0.0011116575,0.0013654579],"domain_scores_gemma":[0.9943851,0.00016640114,0.0013065938,0.0034423496,0.00038919476,0.0003103559],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001547918,0.0011578831,0.0012510291,0.0007765763,0.0002940757,0.00060859625,0.0021822946,0.0014673447,0.0006391765],"category_scores_gemma":[0.00072720076,0.0009323223,0.000327676,0.0011044454,0.0004272652,0.0001922231,0.0015565066,0.0016450048,0.0025633017],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025536525,0.00012587212,0.000006892822,0.0000693511,0.00006876481,0.0014729927,0.00066806574,0.00012153218,0.000012628725,0.0015404966,0.97812164,0.017766254],"study_design_scores_gemma":[0.00063532183,0.0005867846,0.00004762902,0.0004124944,0.00003281113,0.0005625355,0.000088605244,0.06560351,0.00008789493,0.013509197,0.9171754,0.001257784],"about_ca_topic_score_codex":0.00010820541,"about_ca_topic_score_gemma":0.00023249029,"teacher_disagreement_score":0.12152431,"about_ca_system_score_codex":0.000116816576,"about_ca_system_score_gemma":0.00125981,"threshold_uncertainty_score":0.99982893},"labels":[],"label_agreement":null},{"id":"W7024150969","doi":"","title":"@PumpUpThaVolume: Episode044 - Never Enough","year":2013,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Studio; Politics; Echo (communications protocol); Cave; George (robot)","score_opus":0.0044329812442330105,"score_gpt":0.17353189312576575,"score_spread":0.16909891188153275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024150969","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012664703,0.00043147156,0.0001857183,0.0006656447,0.0007361095,0.00040000107,0.00003623279,0.00057957304,0.9969526],"genre_scores_gemma":[0.0001030831,0.000091498354,0.03183091,0.0007891888,0.00029603427,0.000013107814,0.000040181632,0.000113452705,0.96672255],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978657,0.000090265305,0.0006315116,0.00037837413,0.00055418786,0.0004799923],"domain_scores_gemma":[0.998082,0.000107790824,0.0006366827,0.00086882577,0.00013109956,0.00017363053],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019343726,0.00045480576,0.0005063671,0.00012466582,0.000099407385,0.00019270519,0.0013362732,0.00041855781,0.14522207],"category_scores_gemma":[0.00005739453,0.00041997654,0.00021592967,0.000018361363,0.00011827226,6.263905e-7,0.0004331899,0.00044161043,0.023312248],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035293926,0.00003344283,5.147979e-7,0.00018361602,0.000042915886,0.00001719548,0.00012432346,0.00089584774,1.0797859e-7,0.0004766278,0.97949976,0.018722134],"study_design_scores_gemma":[0.00030399478,0.00011095145,0.0000066016987,0.00021290046,0.000015824171,0.00008325235,0.000009591158,0.008283662,0.0000045049806,0.00007994313,0.9904271,0.00046171763],"about_ca_topic_score_codex":0.0049939496,"about_ca_topic_score_gemma":0.00010655906,"teacher_disagreement_score":0.12190982,"about_ca_system_score_codex":0.00003413329,"about_ca_system_score_gemma":0.000045713747,"threshold_uncertainty_score":0.9998252},"labels":[],"label_agreement":null},{"id":"W7024359263","doi":"","title":"Rotating Skyrmion stars: General features","year":2000,"lang":"en","type":"other","venue":"CERN Document Server (European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Skyrmion; Dilaton; Equation of state; Stars; General relativity; Baryon number; Baryon; Hydrostatic equilibrium","score_opus":0.014040572658542765,"score_gpt":0.25373219261782676,"score_spread":0.23969161995928398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024359263","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13424836,0.0043707653,0.0061760102,0.012544954,0.006041822,0.010117346,0.00011549785,0.02479031,0.8015949],"genre_scores_gemma":[0.077551946,0.00055667857,0.009749955,0.0012438443,0.0034571902,0.0000033419208,0.0011623986,0.006835047,0.8994396],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967603,0.00055275613,0.00032110774,0.0009342741,0.000776339,0.0006552028],"domain_scores_gemma":[0.99839884,0.00003920943,0.00021390522,0.0009934732,0.00013434594,0.00022023548],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00056273915,0.00037027776,0.00029056787,0.00049191155,0.0008686481,0.0015514198,0.0025401176,0.00016052138,0.0033606174],"category_scores_gemma":[0.00007470936,0.00035416224,0.000114513365,0.00079484645,0.00009888991,0.00023881416,0.0014449748,0.00058172335,0.0015741751],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020825613,0.00017610141,0.000012698755,0.00031776784,0.00019254895,0.00010320779,0.001735814,0.0016782092,0.000039830524,0.095029935,0.8401111,0.060581982],"study_design_scores_gemma":[0.00085940864,0.00032525073,0.00038935817,0.00043409865,0.000019730334,0.000072564624,0.000028389235,0.0013295547,0.00010692558,0.005872785,0.9897495,0.00081244094],"about_ca_topic_score_codex":0.00008368793,"about_ca_topic_score_gemma":0.0000045794345,"teacher_disagreement_score":0.14963841,"about_ca_system_score_codex":0.00008760046,"about_ca_system_score_gemma":0.0000326815,"threshold_uncertainty_score":0.99989104},"labels":[],"label_agreement":null},{"id":"W7024585440","doi":"","title":"The role of seperation of powers in a legal state","year":2025,"lang":"lv","type":"dissertation","venue":"E-resource repository of the University of Latvia (University of Latvia)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Hyporeflexia; Diafiltration; Fusible alloy; Dysgeusia; Liquation","score_opus":0.003124174100313902,"score_gpt":0.1694172086596049,"score_spread":0.166293034559291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024585440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925201,0.0006431535,0.0012373658,0.00033077932,0.00041037414,0.000447965,0.00006766606,0.000022613236,0.004319983],"genre_scores_gemma":[0.9869953,0.00006840397,0.0019154394,0.0000042758898,0.000017109187,3.185578e-8,0.000015511387,0.00001347514,0.010970486],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969209,0.00059695146,0.00062180846,0.0005742541,0.00092483347,0.00036128928],"domain_scores_gemma":[0.99544287,0.0003995572,0.002335426,0.0011373285,0.00059149426,0.000093351904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062550756,0.00036144102,0.0009460474,0.0005335755,0.00083680794,0.000021875334,0.003059893,0.00034336443,0.000009913547],"category_scores_gemma":[0.000046730962,0.0003723892,0.0007827605,0.0010380872,0.0009529169,0.0002092582,0.0008979885,0.00066330394,8.8007823e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0064426702,0.0020804077,0.02569609,0.0050687627,0.0034651556,0.0002851918,0.43714365,0.27122015,0.15735902,0.0114431195,0.0016391975,0.07815658],"study_design_scores_gemma":[0.0062285652,0.0018017087,0.20967937,0.009970355,0.0014500971,0.000043492495,0.13498013,0.5425131,0.065786995,0.0015724498,0.024241526,0.0017322808],"about_ca_topic_score_codex":0.009600321,"about_ca_topic_score_gemma":0.0020706705,"teacher_disagreement_score":0.3021635,"about_ca_system_score_codex":0.00014161259,"about_ca_system_score_gemma":0.0007045493,"threshold_uncertainty_score":0.9998728},"labels":[],"label_agreement":null},{"id":"W7024719276","doi":"","title":"Skateboarding and the changing city: lessons from the public spaces of Reykjavik","year":2015,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Diafiltration; Liquation; Dysgeusia; Hemopericardium; Proteogenomics","score_opus":0.02058437039391042,"score_gpt":0.22409878179441114,"score_spread":0.20351441140050072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024719276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96323895,0.001301433,0.012825741,0.02049614,0.0008534003,0.00025672218,0.000025761517,0.00007477714,0.00092706823],"genre_scores_gemma":[0.9931009,0.00017077458,0.006019139,0.000046043195,0.00013166982,3.500524e-7,0.00003665181,0.000014419598,0.00048008747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986973,0.00019560859,0.00010229603,0.0003427256,0.00042150717,0.00024058686],"domain_scores_gemma":[0.9984007,0.0003726292,0.00043159787,0.00054645335,0.0001884931,0.000060121787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007242134,0.0001851058,0.00037347572,0.00017575595,0.00051235274,0.00013306647,0.0014111544,0.0001257047,0.0000011948251],"category_scores_gemma":[0.000063879685,0.00013732733,0.00013627003,0.00044925173,0.0002231447,0.00018030549,0.0005466949,0.00035470142,0.00000250457],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070269464,0.00031861977,0.016891409,0.0008295415,0.0024863926,0.0002155514,0.287922,0.0014903777,0.0008122648,0.20546812,0.03118507,0.45167795],"study_design_scores_gemma":[0.005152379,0.00025415482,0.10276804,0.0017979202,0.00063468574,0.000037283568,0.3896218,0.42953095,0.00038402952,0.037492324,0.03085313,0.001473315],"about_ca_topic_score_codex":0.002583633,"about_ca_topic_score_gemma":0.0607578,"teacher_disagreement_score":0.45020464,"about_ca_system_score_codex":0.000028385397,"about_ca_system_score_gemma":0.00012548125,"threshold_uncertainty_score":0.9563809},"labels":[],"label_agreement":null},{"id":"W7024719565","doi":"","title":"Straw-Wolf Podcast Show #2","year":2006,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Paraphernalia; Fence (mathematics); Key (lock); Clothing","score_opus":0.0044788187263437714,"score_gpt":0.17628089042827677,"score_spread":0.171802071701933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024719565","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016548356,0.00029781426,0.00016768268,0.00028477897,0.0005585583,0.00026225677,0.00007800589,0.0005342022,0.9978002],"genre_scores_gemma":[0.00030802784,0.000030888266,0.022968354,0.00025177252,0.000354978,0.0000049857704,0.00007425211,0.000094882445,0.97591186],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980596,0.00006796158,0.00057781814,0.00033551783,0.00054028054,0.00041887033],"domain_scores_gemma":[0.99843425,0.00008475924,0.00056392775,0.00069387176,0.00010033468,0.0001228436],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018889389,0.00041248542,0.00043972227,0.00012949547,0.000088424466,0.00017327206,0.0010987544,0.0003558838,0.03361105],"category_scores_gemma":[0.00003136309,0.00038715499,0.00020169881,0.000017015958,0.00010225854,2.3577724e-7,0.00027581886,0.00038387874,0.00413396],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004650048,0.00003653643,6.939839e-7,0.00017749288,0.000028996747,0.000032096432,0.00006251229,0.0017616613,1.632108e-7,0.00019481007,0.98397195,0.013728427],"study_design_scores_gemma":[0.0002975075,0.00010767774,0.000008267931,0.00021408571,0.000014369411,0.00012684225,0.000007798,0.0032035515,0.0000060085717,0.000047971134,0.9955533,0.00041261452],"about_ca_topic_score_codex":0.0036024333,"about_ca_topic_score_gemma":0.00067425286,"teacher_disagreement_score":0.02947709,"about_ca_system_score_codex":0.000029653285,"about_ca_system_score_gemma":0.00004566843,"threshold_uncertainty_score":0.999858},"labels":[],"label_agreement":null},{"id":"W7024830414","doi":"","title":"Tanna.whatswrongwithmusic.mp3","year":2006,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Summit; Subject (documents); Period (music); Work (physics); Government (linguistics)","score_opus":0.004057628377237779,"score_gpt":0.17217689940829056,"score_spread":0.16811927103105279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024830414","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008776205,0.0008649621,0.00015427913,0.0003668172,0.00094582146,0.0002945192,0.000032879005,0.0005689109,0.99676305],"genre_scores_gemma":[0.00008125976,0.00011089441,0.021777665,0.0004373338,0.00036973614,0.000007516124,0.00006248851,0.000106417116,0.97704667],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979859,0.00007443007,0.0006013884,0.00035750057,0.0005566999,0.0004241041],"domain_scores_gemma":[0.9982711,0.00008808684,0.0006389296,0.00076458167,0.00011501212,0.00012225423],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020368434,0.00042913182,0.00045916485,0.0001341761,0.0000902278,0.00032001757,0.0011150232,0.00036464396,0.031941295],"category_scores_gemma":[0.000031669064,0.00039845714,0.00020594122,0.000019071933,0.00011465838,5.165452e-7,0.00030774577,0.00036508127,0.005224503],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004892452,0.00003472511,2.843164e-7,0.00017138176,0.00003080829,0.000030054336,0.00008250993,0.0017976788,8.174607e-8,0.00015883787,0.97007436,0.027614404],"study_design_scores_gemma":[0.00030790045,0.00010367127,0.000005207245,0.00039997665,0.000015787877,0.00010049317,0.000014268465,0.0033835513,0.000004981815,0.000065547945,0.9951585,0.00044009747],"about_ca_topic_score_codex":0.0030600664,"about_ca_topic_score_gemma":0.00050026,"teacher_disagreement_score":0.027174307,"about_ca_system_score_codex":0.000031273223,"about_ca_system_score_gemma":0.000046473047,"threshold_uncertainty_score":0.99984676},"labels":[],"label_agreement":null},{"id":"W7025001823","doi":"","title":"Suzo Hickey : Rain in the Forecast // Tara Nicholson : Somewhere Beyond Nowhere","year":2015,"lang":"en","type":"book","venue":"E-Artexte (Artexte)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hickey; Painting; Cruise; Feature (linguistics)","score_opus":0.01456524396891012,"score_gpt":0.23598842551297858,"score_spread":0.22142318154406845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025001823","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052345376,0.021027533,0.06464554,0.021302858,0.00889522,0.004864604,0.00034442233,0.0017534767,0.8719318],"genre_scores_gemma":[0.015445641,0.0003068654,0.028880589,0.008352335,0.0052556805,0.00024917838,0.00044603285,0.0005394945,0.94052416],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99252576,0.0006760563,0.0011988673,0.0020687685,0.0018716264,0.0016589343],"domain_scores_gemma":[0.99465436,0.00068840064,0.0006953625,0.0031896543,0.00030808945,0.00046412466],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0028229924,0.0013513812,0.0013152327,0.00056110596,0.0005552578,0.00097234605,0.0056470665,0.0009406266,0.00024501883],"category_scores_gemma":[0.00012964071,0.0010385831,0.00059201114,0.00094109745,0.00034546075,0.00057807117,0.0011545978,0.0032974083,0.0017351542],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028143386,0.00024614518,0.000016252548,0.00016913803,0.000103246355,0.0006818244,0.010464056,0.0010603768,0.00001605732,0.030467886,0.70173067,0.2550162],"study_design_scores_gemma":[0.0013589414,0.0004735305,0.00035073407,0.00069143204,0.00004944438,0.0003795149,0.00014298719,0.058628663,0.0000057278826,0.18407618,0.7523676,0.0014752216],"about_ca_topic_score_codex":0.000100710975,"about_ca_topic_score_gemma":0.00060018833,"teacher_disagreement_score":0.25354096,"about_ca_system_score_codex":0.00041292206,"about_ca_system_score_gemma":0.0014772926,"threshold_uncertainty_score":0.9999237},"labels":[],"label_agreement":null},{"id":"W7025160352","doi":"","title":"Un millénaire d'histoire canadienne pour une poignée de 30 sous, commémoration de la nation par le biais du concours Faites centsation!","year":2000,"lang":"fr","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Field (mathematics); Subject (documents); Identity (music); Narrative","score_opus":0.002373353303003585,"score_gpt":0.1350018625131667,"score_spread":0.13262850921016311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025160352","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10852768,0.0030804798,0.02858231,0.12850283,0.0017961148,0.0008416392,0.0011716813,0.00014019154,0.7273571],"genre_scores_gemma":[0.94373137,0.00043935148,0.011477861,0.003261778,0.00043724888,0.000011205548,0.00006580515,0.0001249756,0.04045041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656236,0.0004974819,0.00048968237,0.0005862097,0.0011095218,0.0007547499],"domain_scores_gemma":[0.9979806,0.00058432313,0.00046245565,0.00038285475,0.0000031584161,0.0005866235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00005980605,0.0004974642,0.00047574064,0.00009092335,0.0008214184,0.00016423003,0.00071334996,0.0001900983,0.00019006603],"category_scores_gemma":[0.000014756234,0.0005383415,0.00007801158,0.00025501504,0.0003558073,0.0003141298,0.00018695595,0.0005259426,3.780682e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018644014,0.00028884658,0.02275284,0.00063192495,0.0004719277,0.0009671275,0.0038708206,0.02855318,0.004127741,0.40109837,0.038178276,0.4988725],"study_design_scores_gemma":[0.0012863887,0.00016481699,0.0743642,0.00089909584,0.00008338049,0.00022246606,0.0013415804,0.48693097,0.0042248988,0.013004489,0.41634497,0.0011327515],"about_ca_topic_score_codex":0.14942478,"about_ca_topic_score_gemma":0.28755316,"teacher_disagreement_score":0.8352037,"about_ca_system_score_codex":0.000086303764,"about_ca_system_score_gemma":0.006968126,"threshold_uncertainty_score":0.9997068},"labels":[],"label_agreement":null},{"id":"W7025186383","doi":"","title":"Two-qubit quantum computing in a projected subspace","year":2002,"lang":"en","type":"article","venue":"TSpace","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Subspace topology; Quantum computer; Quantum; Dimension (graph theory); Set (abstract data type); Quantum system; Quantum entanglement; Scheme (mathematics); Hilbert space","score_opus":0.023250441036937845,"score_gpt":0.2893766226668678,"score_spread":0.26612618162992996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025186383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81804013,0.0005339256,0.16896631,0.005357936,0.0004959172,0.00033470572,5.175942e-7,0.0007946347,0.005475916],"genre_scores_gemma":[0.9433021,0.000007936525,0.055659458,0.0002962223,0.00014413736,0.0000043736222,7.351711e-7,0.000019261422,0.00056580635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980647,0.00014997444,0.0002544569,0.00058544124,0.0003155331,0.0006298854],"domain_scores_gemma":[0.998939,0.00016999517,0.00011271629,0.0006096029,0.000051101833,0.00011759109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032981316,0.00023437309,0.00026685194,0.00024601072,0.00015582678,0.00016822614,0.0008608812,0.00006521166,0.000029416282],"category_scores_gemma":[0.000069263515,0.0002168545,0.00007309522,0.001276215,0.00004785481,0.000140129,0.00037809217,0.00043239715,0.00012640927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047894402,0.0019524898,0.018495996,0.00028365903,0.00013369416,0.0020251828,0.23079443,0.1226964,0.010562186,0.18440545,0.017174348,0.41142827],"study_design_scores_gemma":[0.00066040683,0.000077927565,0.002998384,0.00007400764,0.0000019370173,0.00007724629,0.00015349775,0.9932966,0.0002889272,0.0005120228,0.0015661755,0.00029286748],"about_ca_topic_score_codex":0.00033818043,"about_ca_topic_score_gemma":0.00005270351,"teacher_disagreement_score":0.8706002,"about_ca_system_score_codex":0.000052649255,"about_ca_system_score_gemma":0.000030554707,"threshold_uncertainty_score":0.884307},"labels":[],"label_agreement":null},{"id":"W7025250640","doi":"","title":"Third quarter results 2020: Strong results, increased order backlog","year":2020,"lang":"en","type":"other","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Order (exchange); Quarter (Canadian coin); Work (physics); Term (time)","score_opus":0.008674671422470739,"score_gpt":0.22619851309996533,"score_spread":0.21752384167749458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025250640","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004481225,0.0002422362,0.17259383,0.008232511,0.0010300692,0.00035360604,0.00023573675,0.0018697988,0.81543773],"genre_scores_gemma":[0.0006990032,0.000069599715,0.42835155,0.0030553497,0.0034235746,0.000015257319,0.00032913356,0.00044023883,0.5636163],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963554,0.00021532625,0.00065027195,0.0015411142,0.0005999699,0.0006379268],"domain_scores_gemma":[0.9973989,0.00020758863,0.00041863017,0.0015810112,0.00006249589,0.0003313354],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036248742,0.00060957565,0.0006168804,0.00021079772,0.000117498166,0.00033696374,0.0020804487,0.00040430715,0.00022069026],"category_scores_gemma":[0.00017477106,0.00047851738,0.000184442,0.00079751713,0.0000772206,0.0000791489,0.00071988,0.0008070705,0.0009493679],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033572338,0.000038838378,0.0000016297594,0.000028514532,0.00006563261,0.00010999782,0.00022533532,0.00011465021,0.000006186866,0.002021291,0.98967326,0.007681108],"study_design_scores_gemma":[0.0014718315,0.00020149542,0.000051051276,0.00018992851,0.000014576951,0.000024004234,0.000016513883,0.16938484,0.000016107831,0.00021992547,0.8277533,0.00065644976],"about_ca_topic_score_codex":0.0009443296,"about_ca_topic_score_gemma":0.00018700077,"teacher_disagreement_score":0.25575772,"about_ca_system_score_codex":0.000027963304,"about_ca_system_score_gemma":0.0002245699,"threshold_uncertainty_score":0.9998285},"labels":[],"label_agreement":null},{"id":"W7026549256","doi":"","title":"Accordion Noir 2015-03-04: Guy Klucevsek, Daniel Kahn, etc","year":2015,"lang":"en","type":"other","venue":"Internet Archive (Internet Archive)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Theme (computing); Power (physics); Gray (unit); Accordion","score_opus":0.01249665119547652,"score_gpt":0.2454252645330862,"score_spread":0.23292861333760967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7026549256","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015892064,0.0008360728,0.30199182,0.0007528953,0.0037362957,0.00084237126,0.0005298614,0.0015910417,0.6895607],"genre_scores_gemma":[0.0015699993,0.00012318057,0.079428926,0.000839062,0.00276675,0.00007687514,0.0007056635,0.0008525386,0.913637],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9920683,0.00077461504,0.0012359889,0.002810962,0.0013753659,0.00173476],"domain_scores_gemma":[0.9946012,0.00051301846,0.0009985898,0.0027786081,0.00014699249,0.00096162263],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0006673873,0.0017483503,0.0016113619,0.0015247924,0.00009362487,0.00084336655,0.0072290995,0.00047832888,0.0015172282],"category_scores_gemma":[0.00018249641,0.001554332,0.0007937466,0.00049495796,0.00062103546,0.0003145075,0.0055442546,0.0023601716,0.0064013936],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008016062,0.0002166313,0.000037503167,0.00014636836,0.0004306079,0.0004504372,0.003341759,0.00008569343,0.00019942192,0.0051425295,0.98520166,0.0046672206],"study_design_scores_gemma":[0.0010150545,0.00062789826,0.00005992573,0.0014430773,0.0000629096,0.00044259036,0.00003037913,0.11739859,0.0001696531,0.008235123,0.8689707,0.0015441307],"about_ca_topic_score_codex":0.0076255226,"about_ca_topic_score_gemma":0.0056791576,"teacher_disagreement_score":0.22407629,"about_ca_system_score_codex":0.00012753047,"about_ca_system_score_gemma":0.0004239379,"threshold_uncertainty_score":0.9999414},"labels":[],"label_agreement":null},{"id":"W7028574851","doi":"","title":"An FPGA-based emulation process for dynamic quantum circuit","year":2024,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Process (computing); Emulation; Quantum; Control theory (sociology); Scheme (mathematics); Hardware emulation","score_opus":0.016401756963066352,"score_gpt":0.27897973696808165,"score_spread":0.2625779800050153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028574851","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9846843,0.00039518165,0.0027874245,0.00007428982,0.005230393,0.0017690501,0.0008691588,0.0021361888,0.0020540075],"genre_scores_gemma":[0.99107385,0.000008993879,0.0054049836,0.0002530132,0.00012553913,0.00028048182,0.0018025336,0.00027277938,0.0007778458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943226,0.00025441457,0.0010051322,0.0023321428,0.0010587767,0.0010269574],"domain_scores_gemma":[0.99654996,0.00033109894,0.0006067982,0.0014673062,0.0006334155,0.0004114108],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0010110008,0.0010205489,0.0008110321,0.0008384018,0.0014170007,0.00063871726,0.0024062016,0.00082208286,0.00001746888],"category_scores_gemma":[0.0002632918,0.0010373867,0.0005439541,0.0012246337,0.00004345277,0.0009632206,0.00010799745,0.001629902,0.00011520643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013386193,0.000503581,0.000004152677,0.0029840611,0.00021925608,0.000111234374,0.00012892908,0.03706852,0.015610114,0.20093185,0.000005099673,0.7422993],"study_design_scores_gemma":[0.00062614,0.00046601667,0.00021812155,0.0008129446,0.00012700523,0.000022013044,0.00006271707,0.7696239,0.010130017,0.21333958,0.0032576865,0.0013139118],"about_ca_topic_score_codex":0.00005427474,"about_ca_topic_score_gemma":0.0002705686,"teacher_disagreement_score":0.74098545,"about_ca_system_score_codex":0.00044121442,"about_ca_system_score_gemma":0.0002615686,"threshold_uncertainty_score":0.999883},"labels":[],"label_agreement":null},{"id":"W7031220836","doi":"","title":"Remerciements","year":2020,"lang":"fr","type":"book-chapter","venue":"Industrias Culturais (Universidade de Coimbra)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Independence (probability theory); Power (physics); Work (physics)","score_opus":0.049195485683641675,"score_gpt":0.2449402056393584,"score_spread":0.1957447199557167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7031220836","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026556388,0.0011444611,0.045017302,0.17599243,0.005118996,0.001561282,0.00055219594,0.0012961187,0.7666616],"genre_scores_gemma":[0.11818145,0.0004182274,0.052553747,0.008772196,0.006489265,0.000014240098,0.00051393145,0.00043918335,0.8126178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99477893,0.00025415956,0.0007161936,0.001876313,0.0011239403,0.0012504596],"domain_scores_gemma":[0.99629354,0.00027935125,0.0007847377,0.0011367865,0.00039482207,0.0011107383],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity","insufficient_payload"],"category_scores_codex":[0.00040268525,0.0012183669,0.0010718612,0.00037871057,0.00097031146,0.0007491483,0.0031594238,0.0016411204,0.0011475508],"category_scores_gemma":[0.00019838448,0.0013082774,0.000735522,0.00072615076,0.0005956402,0.00072118576,0.0017441536,0.0034802712,0.0014703419],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005265951,0.000093994444,0.000047874222,0.000109891866,0.00065756286,0.0029349104,0.0020337754,0.0026498982,0.00084305456,0.7899473,0.04738001,0.1532491],"study_design_scores_gemma":[0.0019960403,0.000622533,0.0038675116,0.001188312,0.00033172502,0.0005979249,0.00023796607,0.1050206,0.00031687788,0.005156751,0.87854576,0.002118],"about_ca_topic_score_codex":0.00046238882,"about_ca_topic_score_gemma":0.000034868455,"teacher_disagreement_score":0.83116573,"about_ca_system_score_codex":0.00058402366,"about_ca_system_score_gemma":0.00074651453,"threshold_uncertainty_score":0.9997655},"labels":[],"label_agreement":null},{"id":"W7033532356","doi":"","title":"Renewable Energy Group to Report Third Quarter 2020 Financial Results on Thursday, November 5, 2020 - Earnings News (EARNINGS) News","year":2020,"lang":"en","type":"other","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Earnings; Quarter (Canadian coin); Renewable energy; Group (periodic table); Energy (signal processing)","score_opus":0.007173565884718746,"score_gpt":0.21791959488950347,"score_spread":0.21074602900478473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033532356","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000066690016,0.00011068024,0.2843486,0.016064085,0.003158272,0.00047056653,0.000038363632,0.0018914017,0.69385135],"genre_scores_gemma":[0.00036105356,0.00006580006,0.1071726,0.0155062135,0.0066563655,0.00005197158,0.00018170722,0.00048999063,0.8695143],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932693,0.00025919598,0.001125151,0.0030280408,0.0011909043,0.0011273677],"domain_scores_gemma":[0.9958498,0.00020188128,0.0010396026,0.002088542,0.0000816461,0.00073854707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044858956,0.0010947025,0.0011752507,0.00037168717,0.00027970312,0.00055123173,0.0023559781,0.0007112711,0.0003544507],"category_scores_gemma":[0.0005112617,0.0009305084,0.00045066088,0.0014863291,0.00007158675,0.0001430715,0.0012346822,0.0012151423,0.00075394596],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070001,0.0000829317,0.00003605546,0.000026171532,0.00005235042,0.001323755,0.000553308,0.002808044,0.000054346194,0.0006194854,0.9843489,0.01002465],"study_design_scores_gemma":[0.0007401734,0.0009198524,0.00023919361,0.0003630311,0.0000203384,0.00020729074,0.000017682722,0.016174858,0.000058360547,0.00028164475,0.9797978,0.001179798],"about_ca_topic_score_codex":0.01970798,"about_ca_topic_score_gemma":0.0071910117,"teacher_disagreement_score":0.17717601,"about_ca_system_score_codex":0.00007726594,"about_ca_system_score_gemma":0.00035258176,"threshold_uncertainty_score":0.99931455},"labels":[],"label_agreement":null},{"id":"W7033556290","doi":"","title":"Release: Canada Research Chairs Place University of Regina at Forefront of Innovative Research and Development","year":2010,"lang":"en","type":"other","venue":"oURspace (University of Regina)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Research development; Government (linguistics); NASA Chief Scientist; Agency (philosophy); Work (physics)","score_opus":0.022316868173357495,"score_gpt":0.23785310747381863,"score_spread":0.21553623930046115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033556290","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16003016,0.0025057362,0.0386693,0.75107723,0.000698459,0.0018223663,0.00022132971,0.00023615116,0.044739272],"genre_scores_gemma":[0.0037087416,0.00029538522,0.06882907,0.0000049920527,0.000039487095,1.2554528e-7,0.000014091508,0.00006445473,0.9270437],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973016,0.00027183897,0.00002887905,0.00066043035,0.001199811,0.0005374551],"domain_scores_gemma":[0.99733365,0.00026951762,0.0004244592,0.00085079734,0.00093061075,0.0001909942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010589367,0.00022180697,0.000515098,0.0009144471,0.00044450472,0.000011376289,0.0016509239,0.00030738954,0.000014178302],"category_scores_gemma":[0.000056098295,0.00026710285,0.000043427142,0.0013651277,0.001211536,0.000079978,0.0019924983,0.0009997864,0.0000036554313],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054065466,0.000028820892,0.00021040638,0.00024120502,0.00008479386,0.00013703956,0.001766607,0.000038011327,0.00010070497,0.0027228545,0.986506,0.008109513],"study_design_scores_gemma":[0.0005301972,0.00019871737,0.00043888993,0.00046260445,0.000004208778,0.000011391473,0.003274091,0.0015418928,0.0001818396,0.000014584548,0.99311155,0.00023000997],"about_ca_topic_score_codex":0.048291903,"about_ca_topic_score_gemma":0.49218264,"teacher_disagreement_score":0.8823044,"about_ca_system_score_codex":0.00037461834,"about_ca_system_score_gemma":0.0025547645,"threshold_uncertainty_score":0.9999781},"labels":[],"label_agreement":null},{"id":"W7033736747","doi":"","title":"Report of fourth quarter 2018 invoices paid in excess of ?20k","year":2019,"lang":"en","type":"report","venue":"Trinity's Access to Research Output (TARA) (Trinity College Dublin)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Period (music); Government (linguistics); Work (physics)","score_opus":0.14834301645011563,"score_gpt":0.40947545445196515,"score_spread":0.2611324380018495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033736747","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8623499,0.0023529145,0.030941486,0.011050333,0.010854227,0.01424548,0.0026889325,0.00077565847,0.064741045],"genre_scores_gemma":[0.98095435,0.0007574527,0.008623814,0.0001494299,0.0013503433,0.00029339842,0.00023301429,0.00018235555,0.0074558584],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9787999,0.002400584,0.0043183756,0.0031231812,0.0088142855,0.0025437013],"domain_scores_gemma":[0.98032767,0.004463504,0.0025394345,0.0055267233,0.006201697,0.0009409567],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.021775791,0.0012597879,0.0036168757,0.0074408753,0.00043335732,0.0010047142,0.011918122,0.001211396,0.00012346126],"category_scores_gemma":[0.0058490266,0.0011600571,0.00087116926,0.009777977,0.0006452795,0.0016749405,0.008158613,0.0048028375,0.00011346824],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036550935,0.01495169,0.07646437,0.029357878,0.00307725,0.02167724,0.008409054,0.022386042,0.00039559323,0.01417799,0.6379711,0.1674767],"study_design_scores_gemma":[0.012194697,0.008519951,0.15352285,0.010433596,0.00023449065,0.0018947934,0.0009132754,0.12150801,0.005370625,0.007829963,0.6703314,0.0072463234],"about_ca_topic_score_codex":0.012219818,"about_ca_topic_score_gemma":0.0029346007,"teacher_disagreement_score":0.16023037,"about_ca_system_score_codex":0.00082487386,"about_ca_system_score_gemma":0.010598637,"threshold_uncertainty_score":0.9998632},"labels":[],"label_agreement":null},{"id":"W7034822083","doi":"","title":"Women Serving in the Canadian Forces","year":2014,"lang":"en","type":"article","venue":"eYLS (Yale Law School)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Work (physics)","score_opus":0.009293711454018676,"score_gpt":0.21625134388971828,"score_spread":0.20695763243569962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034822083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9526648,0.0001218131,0.013321269,0.008765179,0.0005884453,0.00021567548,0.0000022803083,0.00017234661,0.024148198],"genre_scores_gemma":[0.9862648,0.000001057985,0.0068524675,0.0064968686,0.00022917404,0.000015605088,9.732744e-7,0.000008135099,0.00013086473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854654,0.00017174557,0.00016174265,0.0003055111,0.00024406411,0.0005703904],"domain_scores_gemma":[0.9989358,0.00013742043,0.000042412266,0.00062711077,0.000025784613,0.00023145427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009941461,0.00012929339,0.00013142216,0.000088268345,0.00042574096,0.0004887646,0.001580463,0.000056941633,0.000020316193],"category_scores_gemma":[0.00006115505,0.000092068,0.000038629914,0.00038990338,0.000040255465,0.00019290826,0.00015274224,0.00034747712,0.00009709455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003516231,0.00005131088,0.0056638573,0.000043171327,0.0000194478,0.00008257234,0.013115752,0.011104314,0.00007479444,0.8714642,0.0021805163,0.09619654],"study_design_scores_gemma":[0.00053474907,0.00015857336,0.02832593,0.00008694037,0.000002539428,0.00006075173,0.00020337552,0.59357333,0.00010021975,0.080057226,0.29637808,0.00051828154],"about_ca_topic_score_codex":0.085351,"about_ca_topic_score_gemma":0.36897504,"teacher_disagreement_score":0.791407,"about_ca_system_score_codex":0.00009503822,"about_ca_system_score_gemma":0.00011267612,"threshold_uncertainty_score":0.9207397},"labels":[],"label_agreement":null},{"id":"W7034902022","doi":"","title":"W89-1009. Vis, Jean A. (1883-1960). Papers, 1912-1944. 1.00 linear ft.","year":2013,"lang":"en","type":"article","venue":"Hope College Digital Commons (Hope College)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Class (philosophy); Pulpit; Quarter (Canadian coin)","score_opus":0.009104600634497952,"score_gpt":0.21506963246983876,"score_spread":0.20596503183534082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034902022","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36164734,0.0047865123,0.045236435,0.050566945,0.008194606,0.010028594,0.0047458485,0.007432686,0.50736105],"genre_scores_gemma":[0.96526206,0.00006623014,0.011512181,0.0018698338,0.00067433465,0.00017571267,0.000105937164,0.00017392973,0.020159775],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99374807,0.0002699807,0.0012219192,0.0017475821,0.001223389,0.001789072],"domain_scores_gemma":[0.9945346,0.0009575028,0.00040229308,0.002627907,0.0004871811,0.0009905236],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045818114,0.0011134637,0.0011348694,0.000610696,0.0012958712,0.0016324397,0.004000678,0.00037150044,0.00035954884],"category_scores_gemma":[0.0003004369,0.0010074822,0.0005854455,0.0029707372,0.0003871614,0.001901145,0.0026691135,0.0011051878,0.0021379548],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021457081,0.002941153,0.002718437,0.00030638708,0.0007680247,0.0020762754,0.0018853542,0.008271867,0.000911778,0.1392559,0.6778192,0.16283108],"study_design_scores_gemma":[0.0022869068,0.0008344825,0.0016768402,0.00025331817,0.000033342338,0.00034485495,0.000282529,0.28741932,0.00040852663,0.002968384,0.701452,0.0020394875],"about_ca_topic_score_codex":0.00022149828,"about_ca_topic_score_gemma":0.00014256302,"teacher_disagreement_score":0.60361475,"about_ca_system_score_codex":0.00021949653,"about_ca_system_score_gemma":0.0005383561,"threshold_uncertainty_score":0.99940395},"labels":[],"label_agreement":null},{"id":"W7035797942","doi":"","title":"Alfa Laval wins renewable energy order – Energy Northern Perspective","year":2021,"lang":"en","type":"other","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Perspective (graphical); Renewable energy; Order (exchange); Energy (signal processing); Energy policy","score_opus":0.006069849579694653,"score_gpt":0.21245298734769766,"score_spread":0.20638313776800302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7035797942","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015764592,0.002681885,0.44869167,0.000756494,0.00075639255,0.00003259194,0.0000062049958,0.00049922505,0.54657394],"genre_scores_gemma":[0.00017944977,0.00023890128,0.055615045,0.0012114635,0.0012807553,0.000011500043,0.000033001197,0.0003054356,0.94112444],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974427,0.00013086562,0.00022827779,0.0011787092,0.00046048893,0.00055892306],"domain_scores_gemma":[0.9982012,0.000058844926,0.00017931522,0.001180517,0.00020395775,0.00017616752],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007917096,0.00050172163,0.00050675793,0.0002946584,0.0001323312,0.00024126665,0.0013453955,0.00046073602,0.0012376461],"category_scores_gemma":[0.000023234208,0.0004228417,0.00020389871,0.0007920385,0.00006818056,0.000044874454,0.00078545976,0.00032602873,0.000020782694],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030177102,0.00020751922,0.000020604484,0.000026679845,0.0003663831,0.00033436908,0.00052468275,0.007862753,0.000063260704,0.10457323,0.8434456,0.042571906],"study_design_scores_gemma":[0.00021711469,0.00006229648,0.0000051117413,0.00012258749,0.000011042908,0.000061896215,0.000054947373,0.08577275,0.00018335767,0.0040754615,0.9088265,0.0006069886],"about_ca_topic_score_codex":0.10547368,"about_ca_topic_score_gemma":0.08140615,"teacher_disagreement_score":0.3945505,"about_ca_system_score_codex":0.00008556046,"about_ca_system_score_gemma":0.000490421,"threshold_uncertainty_score":0.9998223},"labels":[],"label_agreement":null},{"id":"W7036125490","doi":"","title":"\"Äläkä luota vieraaseen apuun\" : Suomen sotilaallinen liittoutumattomuus Euroopan turvallisuus- ja puolustuspolitiikan puitteissa","year":2006,"lang":"fi","type":"other","venue":"Työväentutkimus Vuosikirja","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Value (mathematics); Public health","score_opus":0.010506763070049267,"score_gpt":0.2292630734585004,"score_spread":0.21875631038845111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036125490","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029092867,0.018547598,0.042724065,0.010070882,0.017644562,0.0068838974,0.0018067618,0.0062045637,0.8670248],"genre_scores_gemma":[0.06653525,0.00093997346,0.020450788,0.004043395,0.0157441,0.00021581302,0.0013141786,0.0026804074,0.8880761],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.982022,0.0011260195,0.003116868,0.0052847546,0.003191267,0.00525909],"domain_scores_gemma":[0.9892784,0.00062299526,0.0022848225,0.005409577,0.0005769906,0.0018272426],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0016947353,0.0039120624,0.0035453544,0.0018963475,0.0014982421,0.0024738384,0.008573885,0.001957157,0.002174758],"category_scores_gemma":[0.00016532921,0.003884801,0.0017013061,0.0027343982,0.0009871922,0.00061963307,0.0037595925,0.0039604837,0.0052403687],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001843948,0.003557379,0.003178076,0.0025029765,0.001969498,0.0035574876,0.0047084945,0.016696341,0.00038182424,0.01964045,0.5402582,0.40336487],"study_design_scores_gemma":[0.0024014334,0.00067141734,0.0037002524,0.0012317658,0.00038243653,0.00039520318,0.00005617929,0.12897335,0.00012341021,0.0015737193,0.85656816,0.003922662],"about_ca_topic_score_codex":0.004756306,"about_ca_topic_score_gemma":0.0008276914,"teacher_disagreement_score":0.3994422,"about_ca_system_score_codex":0.0007720233,"about_ca_system_score_gemma":0.0012087305,"threshold_uncertainty_score":0.9998017},"labels":[],"label_agreement":null},{"id":"W7037624321","doi":"","title":"Engaging Communities in Setting Priorities for Home and Community Care in Northeastern Ontario","year":2015,"lang":"en","type":"other","venue":"MacSphere (McMaster University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Community participation; Community-based care; Data collection; Community practice; Health care; Community engagement; Community-based participatory research; Government (linguistics); Qualitative research","score_opus":0.015547170366998892,"score_gpt":0.20326124551303146,"score_spread":0.18771407514603256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037624321","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037026137,0.0017146094,0.0063754353,0.000117880714,0.00055469206,0.001007484,0.00013094471,0.0004432653,0.95262957],"genre_scores_gemma":[0.04492333,0.000034232806,0.028735789,0.00013143067,0.00012904985,0.000004194159,0.00008227474,0.00022411709,0.9257356],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829483,0.00062503415,0.00019113882,0.00030176563,0.00016443401,0.00042280182],"domain_scores_gemma":[0.9989285,0.00025525576,0.00014160716,0.00052951725,0.0000508358,0.000094293595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037270546,0.00034068944,0.00044616094,0.00055819144,0.00025454827,0.00014981172,0.0011364912,0.00020068299,0.0004152165],"category_scores_gemma":[0.000008134581,0.0003853305,0.000056621404,0.00033931294,0.000115423914,0.0001688596,0.0011501936,0.0013428815,0.0000022074319],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056787318,0.000093325776,0.041486755,0.0009530061,0.00006597162,0.00015381869,0.24056853,0.0013950255,8.7071083e-7,0.0005124951,0.0016451367,0.71306825],"study_design_scores_gemma":[0.0021931105,0.00021498425,0.0016560528,0.0016277087,0.000017212054,0.000016086027,0.04599906,0.016710373,9.509573e-7,0.00028824218,0.93054134,0.00073487544],"about_ca_topic_score_codex":0.081449576,"about_ca_topic_score_gemma":0.7246274,"teacher_disagreement_score":0.9288962,"about_ca_system_score_codex":0.0003225987,"about_ca_system_score_gemma":0.00026509838,"threshold_uncertainty_score":0.99985987},"labels":[],"label_agreement":null},{"id":"W7038305031","doi":"","title":"Influence of inherited structures as fluid-thermal conduits applied to the formation of uranium mineralisation in the Athabasca Basin, Canada","year":2019,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Uranium; Uranium ore; Uranium mine; Pyrite","score_opus":0.005907800814910423,"score_gpt":0.19300978014905462,"score_spread":0.1871019793341442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038305031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9703674,0.00005353752,0.019416288,0.008408007,0.000048686852,0.0003716041,0.00000924512,0.000021362583,0.0013039112],"genre_scores_gemma":[0.99300104,0.0000038079315,0.0062420913,0.0006472722,0.0000064944334,0.000010598423,0.0000174118,0.0000061100236,0.000065148444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975462,0.0012740281,0.0003528059,0.0002250588,0.000426307,0.00017557527],"domain_scores_gemma":[0.99741113,0.0007765919,0.00025084917,0.0009890596,0.0005323189,0.000040046587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019507421,0.000118491414,0.0001584351,0.000085228596,0.00011366877,0.00008180384,0.001426831,0.00004180785,0.000007010823],"category_scores_gemma":[0.00024629093,0.00008110049,0.000040291954,0.0007201395,0.00005448144,0.0001463196,0.00024170156,0.00015645288,0.0000030974986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004791455,0.0002863539,0.0073014707,0.00023700303,0.000045856304,0.0000038023625,0.14503473,0.18140635,0.19820257,0.39516205,0.0016006682,0.07067122],"study_design_scores_gemma":[0.0008575737,0.0000040153395,0.3439128,0.0004336518,0.000010886348,0.00002355534,0.00059703714,0.4042164,0.24208212,0.0017946841,0.005718275,0.0003489729],"about_ca_topic_score_codex":0.10301215,"about_ca_topic_score_gemma":0.06776145,"teacher_disagreement_score":0.39336738,"about_ca_system_score_codex":0.000034385295,"about_ca_system_score_gemma":0.00019497931,"threshold_uncertainty_score":0.94924945},"labels":[],"label_agreement":null},{"id":"W7038768380","doi":"","title":"I nuovi trend internazionali: dal Beps al Consiglio Ue","year":2015,"lang":"it","type":"book-chapter","venue":"Institutional Research Information System University of Ferrara (University of Ferrara)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Process (computing); Production (economics); Investment (military); Savings account; Fiscal policy; Power (physics); Work (physics); Quarter (Canadian coin)","score_opus":0.10686046685854016,"score_gpt":0.2825699410092423,"score_spread":0.17570947415070215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038768380","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024838302,0.00041466733,0.32789078,0.0053711627,0.0025307897,0.0022223066,0.0036663655,0.00044663675,0.63261896],"genre_scores_gemma":[0.9637415,0.00019328031,0.009761386,0.000090261245,0.00020524698,2.8368794e-7,0.0007107141,0.000030278336,0.025267053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9924003,0.0004960792,0.00089429115,0.000856737,0.0044714836,0.00088110764],"domain_scores_gemma":[0.9922852,0.00040225685,0.0014430537,0.0011651277,0.0038811197,0.00082327443],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.002806271,0.0006659413,0.0012344084,0.0029812935,0.0020199406,0.00018867268,0.0039276546,0.0007902465,0.00048659585],"category_scores_gemma":[0.00013926152,0.0008630439,0.00068985217,0.0009305393,0.0035121245,0.0037047425,0.0026113617,0.0018280408,0.0008192524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013025841,0.00018043489,0.00007444644,0.0012601112,0.00085927383,0.000827593,0.0132052675,0.021558618,0.000042107265,0.9154536,0.028839907,0.016396036],"study_design_scores_gemma":[0.004144129,0.0008373852,0.0010364248,0.0034295297,0.000114875635,0.0006185143,0.0114495205,0.22861548,0.000016184611,0.0011780254,0.7475257,0.0010342228],"about_ca_topic_score_codex":0.0019652336,"about_ca_topic_score_gemma":0.00013291524,"teacher_disagreement_score":0.9389032,"about_ca_system_score_codex":0.0015286378,"about_ca_system_score_gemma":0.0038580652,"threshold_uncertainty_score":0.99995875},"labels":[],"label_agreement":null},{"id":"W7042417706","doi":"","title":"An Optimizing Pulse Sequence Compiler for NMR QIP","year":2006,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Quantum computer; Compiler; Quantum; Pulse sequence; Quantum algorithm; Set (abstract data type); Sequence (biology); Quantum information; Quantum phase estimation algorithm","score_opus":0.013128422295536851,"score_gpt":0.22536843283511063,"score_spread":0.21224001053957378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042417706","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9470644,0.000080582686,0.050574474,0.00058407127,0.0006212568,0.0004425651,0.00007365544,0.0002828356,0.00027617445],"genre_scores_gemma":[0.12367472,0.000028678474,0.75437534,0.00007469588,0.00026995028,0.0000017933661,0.0015657296,0.000072510586,0.11993661],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838537,0.00006532347,0.00015772408,0.0006814171,0.00029771726,0.00041247116],"domain_scores_gemma":[0.99866104,0.0000617041,0.0003056457,0.0006418209,0.00020532226,0.00012448557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018607112,0.00030234587,0.00042910088,0.00028099422,0.000413419,0.00010611831,0.0015765838,0.00025432906,0.0000136787085],"category_scores_gemma":[0.000005312466,0.00034394534,0.00022374935,0.00025842982,0.000068596135,0.00039028077,0.00010886713,0.00028876492,0.000008813524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005413945,0.001110115,0.00037908676,0.0025437556,0.00050352485,0.00055081263,0.34361163,0.23524454,0.048294827,0.014704319,0.01211578,0.34040022],"study_design_scores_gemma":[0.0009941086,0.00051685097,0.001766679,0.00037877087,0.00008802379,0.00001555746,0.01039847,0.9796344,0.0025186779,0.0016132677,0.0011543997,0.0009207871],"about_ca_topic_score_codex":0.0111302715,"about_ca_topic_score_gemma":0.0058539244,"teacher_disagreement_score":0.82338965,"about_ca_system_score_codex":0.000055169097,"about_ca_system_score_gemma":0.000120122124,"threshold_uncertainty_score":0.99990124},"labels":[],"label_agreement":null},{"id":"W7042733502","doi":"","title":"Quantum Technologies Posts 2012 Second Quarter Financial Results","year":2012,"lang":"en","type":"other","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Key (lock); Quantum computer; Work (physics); Quantum","score_opus":0.007893437058360138,"score_gpt":0.21803651404689364,"score_spread":0.21014307698853352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042733502","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000067663575,0.004874975,0.14426154,0.0038266338,0.004861645,0.00047974754,0.00013383855,0.007563658,0.8339303],"genre_scores_gemma":[0.0034669524,0.0000540937,0.09550222,0.00048012656,0.0014569759,0.000020016254,0.000031910575,0.0002812714,0.89870644],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774045,0.000056384953,0.00035339632,0.0007768239,0.00031433397,0.0007586114],"domain_scores_gemma":[0.99810576,0.00008068296,0.00028768572,0.0013936918,0.000032601958,0.000099572935],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002450655,0.00048134054,0.00044882798,0.00047441697,0.000102108505,0.00015103884,0.0018060419,0.00066629803,0.00040565472],"category_scores_gemma":[0.000051370946,0.0003678272,0.000152607,0.00036868735,0.0001049896,0.00016426749,0.0006900862,0.00062687823,0.0008864581],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031940156,0.000043138964,0.0000029132239,0.00002838038,0.000016928807,0.000016948577,0.00011974578,0.0000017194395,0.000009393092,0.018236768,0.9233111,0.058209766],"study_design_scores_gemma":[0.00031637805,0.00010599021,0.00011120662,0.00012275773,0.000006374499,0.000047779602,0.000010319703,0.006105168,0.00007986178,0.0025977527,0.9899109,0.00058549654],"about_ca_topic_score_codex":0.00005059581,"about_ca_topic_score_gemma":0.000104521685,"teacher_disagreement_score":0.06659981,"about_ca_system_score_codex":0.000021273598,"about_ca_system_score_gemma":0.000093691284,"threshold_uncertainty_score":0.99989146},"labels":[],"label_agreement":null},{"id":"W7042818860","doi":"","title":"Quantum Technologies Reports 2013 Fourth Quarter Financial Results | Cincinnati Enquirer | Cincinnati News","year":2014,"lang":"en","type":"other","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin)","score_opus":0.008475824480168459,"score_gpt":0.22285957281847094,"score_spread":0.21438374833830248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042818860","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010329628,0.0010484343,0.6957943,0.012188918,0.005733171,0.0011185588,0.00003946412,0.009106696,0.2748672],"genre_scores_gemma":[0.013948976,0.00044569533,0.33975166,0.0030225583,0.0043151747,0.00016043746,0.00013933003,0.0011478357,0.63706833],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946434,0.00016354055,0.0011628692,0.0020797534,0.00090806803,0.0010423724],"domain_scores_gemma":[0.9949146,0.00018084151,0.0012341379,0.0033564903,0.00014432485,0.0001696029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007018035,0.0009637631,0.0010613105,0.0010054858,0.00022455752,0.00035831743,0.0022659856,0.0010583879,0.00011414126],"category_scores_gemma":[0.00047669694,0.0007440716,0.00031092126,0.0008710942,0.00021839522,0.00015316154,0.0011374302,0.0009854443,0.000348675],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005417638,0.00005678999,0.000014550784,0.00005176979,0.000035303725,0.00026687075,0.00014544571,0.00014348917,0.000008352091,0.0075341444,0.9453452,0.046392623],"study_design_scores_gemma":[0.0004897686,0.0002777877,0.00006171385,0.00034076392,0.000016524205,0.00024324305,0.00002220321,0.10065275,0.00005952902,0.0064214556,0.89036846,0.0010457776],"about_ca_topic_score_codex":0.0009976831,"about_ca_topic_score_gemma":0.0008744397,"teacher_disagreement_score":0.36220112,"about_ca_system_score_codex":0.00006114507,"about_ca_system_score_gemma":0.0003117358,"threshold_uncertainty_score":0.99950105},"labels":[],"label_agreement":null},{"id":"W7042865814","doi":"","title":"Quantum Query Complexity of Hypergraph Search Problems","year":2024,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Hypergraph; Upper and lower bounds; Quantum algorithm; Query optimization; Simplex; Quantum; Graph; Simple (philosophy)","score_opus":0.018247136876575944,"score_gpt":0.21753273385512423,"score_spread":0.19928559697854828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042865814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995199,0.0005064608,0.0015684242,0.001098797,0.0007851971,0.000259757,0.00003910132,0.00019248703,0.00035074184],"genre_scores_gemma":[0.78944975,0.00029182914,0.05041253,0.000026019721,0.000142358,8.262941e-7,0.0003985904,0.00008513456,0.15919298],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981052,0.000109403874,0.00021626141,0.00063873996,0.00055955624,0.0003708138],"domain_scores_gemma":[0.99869984,0.00005512174,0.00023014206,0.0006474652,0.0002520183,0.00011539771],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002894054,0.00029540135,0.00056814007,0.00060103525,0.00018426304,0.000054859436,0.0014985525,0.0002496046,0.000025844902],"category_scores_gemma":[0.000006074442,0.00030712542,0.0003443248,0.00071377086,0.00024893065,0.00017228127,0.0003659869,0.00056990987,0.00004336038],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018011352,0.0006409687,0.0003325216,0.009802044,0.00094112556,0.0003660464,0.8005991,0.006935486,0.020825606,0.109112106,0.004693508,0.045571405],"study_design_scores_gemma":[0.0012823989,0.0011611904,0.008963854,0.004005527,0.00029667764,0.0000469517,0.07777703,0.8522624,0.0078343,0.042953342,0.001602378,0.0018139849],"about_ca_topic_score_codex":0.027727997,"about_ca_topic_score_gemma":0.008949351,"teacher_disagreement_score":0.8453269,"about_ca_system_score_codex":0.00003588162,"about_ca_system_score_gemma":0.0001939647,"threshold_uncertainty_score":0.9999381},"labels":[],"label_agreement":null},{"id":"W7043854774","doi":"","title":"Toronto 1923 Souvenir Grand Lodge Communication, A.F. &amp; A.M., 1923","year":2019,"lang":"en","type":"book","venue":"Brock University Digital Repository (Brock University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Hyporeflexia; Pretext; Subpoena; Diafiltration; Demotion","score_opus":0.008092302567444845,"score_gpt":0.18137380454045168,"score_spread":0.17328150197300685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043854774","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000897193,0.00073858426,0.030561393,0.000031010535,0.0012934936,0.00073024473,0.00019126607,0.001246701,0.9643101],"genre_scores_gemma":[0.00053066167,0.00014542243,0.002466725,0.00005690005,0.00020606213,1.5438691e-7,0.00019773084,0.00006679142,0.99632955],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963285,0.00020519295,0.00041954534,0.0014647369,0.00078887737,0.00079319335],"domain_scores_gemma":[0.99546295,0.00029395954,0.00067994546,0.002570473,0.00048198042,0.0005106898],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000009070786,0.0008583456,0.00083421456,0.00056040956,0.001360223,0.0006666672,0.0052240007,0.0007208173,0.000011883517],"category_scores_gemma":[0.000025083109,0.0010665964,0.0007231151,0.00049700966,0.00026982254,0.002587844,0.0036921715,0.00097035075,0.0002537297],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016980362,0.00030859793,0.00040603723,0.00024268561,0.000550976,0.00034834276,0.00025730944,0.0018543354,0.00018613742,0.006054773,0.98460835,0.0050126566],"study_design_scores_gemma":[0.0010008438,0.0001655186,0.00013962989,0.00030210093,0.00011973727,0.00016741132,0.00036003155,0.00015703333,0.00001278346,0.00040664637,0.995987,0.0011812461],"about_ca_topic_score_codex":0.00015301727,"about_ca_topic_score_gemma":0.0017477382,"teacher_disagreement_score":0.032019436,"about_ca_system_score_codex":0.0017784578,"about_ca_system_score_gemma":0.00087866664,"threshold_uncertainty_score":0.99993986},"labels":[],"label_agreement":null},{"id":"W7071458364","doi":"","title":"Simulation and optimization of superconducting qubit control and readout","year":2023,"lang":"en","type":"dissertation","venue":"Knowledge UdeS (Institutional Deposit of the University of Sherbrooke)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; ETH Zürich Foundation; Office of Science; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Canada First Research Excellence Fund; Intelligence Advanced Research Projects Activity; National Center of Competence in Research Quantum Science and Technology; Eidgenössische Technische Hochschule Zürich; National Science Foundation; Government of Canada; Office of the Director of National Intelligence; U.S. Department of Energy","keywords":"Transmon; Qubit; Population; Process (computing); Control (management); Field (mathematics); Electronic circuit; Fidelity; High fidelity","score_opus":0.011814074177996677,"score_gpt":0.22001903503252856,"score_spread":0.20820496085453188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7071458364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64895797,0.0022679183,0.34732258,0.00004890822,0.0005027858,0.0002777429,0.000007932668,0.000048880513,0.00056527584],"genre_scores_gemma":[0.9776303,0.00011921754,0.021808818,0.0000028604115,0.000030016956,1.656603e-7,0.000017836948,0.000008163644,0.00038257556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908465,0.00007121007,0.00023806085,0.00027484063,0.00022310854,0.000108119915],"domain_scores_gemma":[0.9991534,0.0001827281,0.00019024768,0.0002143068,0.0002178069,0.000041528638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016318256,0.00015406989,0.0002992734,0.00017566756,0.00029368603,0.00001806593,0.00042874535,0.00014865365,0.0000014774564],"category_scores_gemma":[0.00008321752,0.00014355495,0.00010427084,0.00026277348,0.00020819182,0.00017987833,0.00016545977,0.00016187754,7.792779e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003783508,0.00004130978,0.00040204244,0.0014752285,0.000078118814,0.0000018619419,0.007034353,0.97857404,0.0035831905,0.0017586511,0.0000114072645,0.007001973],"study_design_scores_gemma":[0.00048298607,0.000051594772,0.011100897,0.002113068,0.0000832744,0.0000047756453,0.00020596493,0.98365223,0.0019094655,0.00020441158,0.000060839004,0.0001304959],"about_ca_topic_score_codex":0.00040773422,"about_ca_topic_score_gemma":0.00087801565,"teacher_disagreement_score":0.32867238,"about_ca_system_score_codex":0.00007851475,"about_ca_system_score_gemma":0.00010387634,"threshold_uncertainty_score":0.5854001},"labels":[],"label_agreement":null},{"id":"W7091692333","doi":"10.5281/zenodo.17360132","title":"Hybrid Neural Quantum Architecture (HNQA): Toward Probabilistic Cognition in Deterministic Systems","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cybernet Systems Corporation (Canada)","funders":"","keywords":"Probabilistic logic; Ambiguity; Cognitive architecture; Hybrid system; Artificial neural network; Cognition; Architecture; Perception","score_opus":0.020178085573273986,"score_gpt":0.23666052627982853,"score_spread":0.21648244070655454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7091692333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14976424,0.00037302266,0.81914234,0.0033522898,0.0012159359,0.0016877473,0.00014323347,0.0026833455,0.021637827],"genre_scores_gemma":[0.99837756,0.000008278414,0.00082941784,0.00016367678,0.00009207342,1.8970498e-7,0.00015246846,0.00025773892,0.00011859995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976738,0.0005105716,0.000369597,0.00063534133,0.0003326753,0.00047798478],"domain_scores_gemma":[0.9988884,0.000095042575,0.00010480367,0.0005548956,0.00023357973,0.00012330816],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006076305,0.00020009384,0.00022356863,0.00047122277,0.0010168736,0.0012936449,0.0016583364,0.000054500066,0.000091605434],"category_scores_gemma":[0.00058009976,0.00019606654,0.00006036679,0.00077359227,0.00013261467,0.00016760857,0.0013443842,0.0004629059,0.0003595769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013411925,0.00061832723,0.000011295522,0.0010464768,0.000087657114,0.00041532543,0.003029024,0.07178057,0.00213091,0.093015775,0.020755526,0.806975],"study_design_scores_gemma":[0.00071219844,0.00027416786,0.00072414463,0.0002259785,0.00001249901,0.00040607213,0.00007102135,0.8744184,0.00008807884,0.008053874,0.11472274,0.0002908753],"about_ca_topic_score_codex":0.000016831942,"about_ca_topic_score_gemma":2.9845572e-7,"teacher_disagreement_score":0.8486133,"about_ca_system_score_codex":0.0001110972,"about_ca_system_score_gemma":0.000011058791,"threshold_uncertainty_score":0.9997431},"labels":[],"label_agreement":null},{"id":"W7092282292","doi":"10.48660/25100189","title":"Computational Limits of Neural Quantum State Learning from Local Indistinguishability","year":2025,"lang":"en","type":"other","venue":"PIRSA","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"State (computer science); Quantum; Artificial neural network; Limit (mathematics); Quantum state; Quantum system; Feature (linguistics)","score_opus":0.012768250355420762,"score_gpt":0.2472133409449902,"score_spread":0.23444509058956944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092282292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036952032,0.00063960784,0.9662309,0.0002371146,0.0010678644,0.00019424506,0.00010454726,0.00057843333,0.027252026],"genre_scores_gemma":[0.8373302,0.000018471354,0.11869916,0.0003540244,0.0007254357,0.000011274874,0.00023793154,0.00026013187,0.042363342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980886,0.0001964787,0.00037462512,0.0006479194,0.00040056926,0.00029181753],"domain_scores_gemma":[0.99852806,0.0004832574,0.00038239584,0.00044078688,0.0000842542,0.00008125824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019056447,0.00029024988,0.00046403115,0.00022410748,0.00008446252,0.00007477995,0.00091344095,0.00014830825,0.000086622196],"category_scores_gemma":[0.00016451208,0.00027462232,0.00013789233,0.00032903661,0.00014152823,0.000031891806,0.0004208406,0.000575271,0.000024995898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017069335,0.00023537621,0.0040075663,0.00035097683,0.00023335319,0.00006702281,0.0015268682,0.43230867,0.000009113876,0.006225506,0.031844363,0.5231741],"study_design_scores_gemma":[0.00023636108,0.000071442075,0.0038509453,0.0002859645,0.000011317987,0.000002139241,0.0000081529915,0.9648492,0.000013223698,0.010182737,0.020221777,0.00026674883],"about_ca_topic_score_codex":0.0013398171,"about_ca_topic_score_gemma":0.00004849827,"teacher_disagreement_score":0.8475318,"about_ca_system_score_codex":0.000031077332,"about_ca_system_score_gemma":0.00018808058,"threshold_uncertainty_score":0.9999706},"labels":[],"label_agreement":null},{"id":"W7092483661","doi":"10.17181/n8xbe-ngt80","title":"White Paper 2025","year":2025,"lang":"","type":"report","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Natural Resources Canada","funders":"","keywords":"White (mutation); White paper; Folio; Portfolio; Point (geometry)","score_opus":0.016561663375492496,"score_gpt":0.2691596379667269,"score_spread":0.2525979745912344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092483661","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009912197,0.0041286354,0.37025774,0.005254854,0.015628738,0.0006034153,0.000026987776,0.00059833756,0.6034022],"genre_scores_gemma":[0.0032500355,0.0025241957,0.093728974,0.004090095,0.0029346321,0.000034274915,0.000056805024,0.00007090559,0.89331007],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99168116,0.00029305194,0.0016932304,0.0028747527,0.0019332424,0.0015245486],"domain_scores_gemma":[0.9941859,0.00043081137,0.0006576756,0.003322796,0.00095601054,0.00044677962],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0014763813,0.0013419425,0.0015758236,0.00077544927,0.00080522697,0.0013459667,0.00413259,0.0009898003,0.0022588097],"category_scores_gemma":[0.00018882439,0.0011352701,0.0010342343,0.0021530325,0.00020828887,0.00034417713,0.0040893964,0.0023371002,0.0004896426],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005942332,0.00018763769,0.00027619576,0.00060877524,0.00031977796,0.00026855659,0.00050388114,0.0044975933,0.000007647508,0.004715328,0.18482617,0.8037825],"study_design_scores_gemma":[0.00026638727,0.00013015173,0.0011594751,0.001182841,0.00008733813,0.00018721032,0.000016063792,0.31493154,0.00001437831,0.0017298597,0.67924887,0.0010458726],"about_ca_topic_score_codex":0.0003746119,"about_ca_topic_score_gemma":0.00005196844,"teacher_disagreement_score":0.80273664,"about_ca_system_score_codex":0.00023053026,"about_ca_system_score_gemma":0.0047419746,"threshold_uncertainty_score":0.99996454},"labels":[],"label_agreement":null},{"id":"W7092561178","doi":"10.17181/pdhh9-xq285","title":"White Paper 2025","year":2025,"lang":"","type":"report","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Natural Resources Canada","funders":"","keywords":"White (mutation); White paper; Folio; Portfolio; Work (physics)","score_opus":0.016561663375492496,"score_gpt":0.2691596379667269,"score_spread":0.2525979745912344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092561178","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009912197,0.0041286354,0.37025774,0.005254854,0.015628738,0.0006034153,0.000026987776,0.00059833756,0.6034022],"genre_scores_gemma":[0.0032500355,0.0025241957,0.093728974,0.004090095,0.0029346321,0.000034274915,0.000056805024,0.00007090559,0.89331007],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99168116,0.00029305194,0.0016932304,0.0028747527,0.0019332424,0.0015245486],"domain_scores_gemma":[0.9941859,0.00043081137,0.0006576756,0.003322796,0.00095601054,0.00044677962],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0014763813,0.0013419425,0.0015758236,0.00077544927,0.00080522697,0.0013459667,0.00413259,0.0009898003,0.0022588097],"category_scores_gemma":[0.00018882439,0.0011352701,0.0010342343,0.0021530325,0.00020828887,0.00034417713,0.0040893964,0.0023371002,0.0004896426],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005942332,0.00018763769,0.00027619576,0.00060877524,0.00031977796,0.00026855659,0.00050388114,0.0044975933,0.000007647508,0.004715328,0.18482617,0.8037825],"study_design_scores_gemma":[0.00026638727,0.00013015173,0.0011594751,0.001182841,0.00008733813,0.00018721032,0.000016063792,0.31493154,0.00001437831,0.0017298597,0.67924887,0.0010458726],"about_ca_topic_score_codex":0.0003746119,"about_ca_topic_score_gemma":0.00005196844,"teacher_disagreement_score":0.80273664,"about_ca_system_score_codex":0.00023053026,"about_ca_system_score_gemma":0.0047419746,"threshold_uncertainty_score":0.99996454},"labels":[],"label_agreement":null},{"id":"W7093746648","doi":"","title":"[Two dancers perform scene in \"The Magic Flute\"]","year":2006,"lang":"en","type":"other","venue":"The Portal to Texas History (University of North Texas)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"MAGIC (telescope); Ballet dancer; Ballet; Dance; Face (sociological concept)","score_opus":0.010719924804382597,"score_gpt":0.19208978623932133,"score_spread":0.18136986143493872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7093746648","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04671384,0.002831308,0.016410671,0.002621592,0.0021132892,0.0013937867,0.00010109438,0.00057963136,0.92723477],"genre_scores_gemma":[0.0898396,0.00009947441,0.028296392,0.00196868,0.000848627,0.0000011277731,0.00008315195,0.0002876055,0.8785753],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980871,0.00013466638,0.00020528307,0.0005870699,0.00055342924,0.00043245158],"domain_scores_gemma":[0.9982262,0.00006060474,0.0003558888,0.0012210216,0.00003729805,0.00009894463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035458262,0.0003463629,0.000419807,0.00047790428,0.00015549878,0.000020980237,0.0035337291,0.000109162545,0.00033522237],"category_scores_gemma":[0.000006447917,0.000283434,0.00020714842,0.00059250806,0.00032203193,0.00009255528,0.0004635601,0.00056581077,0.00019807664],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146879,0.00013002908,0.0057174945,0.00006778464,0.000052396368,0.00036969752,0.0012925154,0.0020328416,6.673414e-7,0.0013723491,0.958148,0.030801507],"study_design_scores_gemma":[0.00042019604,0.00010044499,0.08277586,0.00011638446,0.000038644364,0.000037581707,0.000029642028,0.010802452,3.7365734e-7,0.00007251033,0.90516347,0.0004424205],"about_ca_topic_score_codex":0.006836071,"about_ca_topic_score_gemma":0.015487182,"teacher_disagreement_score":0.07705837,"about_ca_system_score_codex":0.0002523231,"about_ca_system_score_gemma":0.00024600685,"threshold_uncertainty_score":0.9999618},"labels":[],"label_agreement":null},{"id":"W7096524626","doi":"","title":"Published by Canadian Center of Science and Education 125 Grover Algorithm Applied to Four Qubits System","year":2015,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Qubit; Quantum computer; Context (archaeology); Focus (optics); Quantum gate; Hadamard transform; Quantum","score_opus":0.007772709993425266,"score_gpt":0.20839155491371628,"score_spread":0.200618844920291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096524626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20864709,0.00014986735,0.6973942,0.008695561,0.0040281937,0.0011215302,0.000040382234,0.00038577587,0.07953742],"genre_scores_gemma":[0.851573,2.5878063e-7,0.14705597,0.0009949774,0.00007978066,0.000009136484,0.0000023521584,0.000006938625,0.00027758154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847615,0.000021138008,0.0001872612,0.00046006546,0.0004926319,0.00036275527],"domain_scores_gemma":[0.998313,0.00001967929,0.000060021335,0.0004138253,0.0004138753,0.00077960896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007180409,0.0001197627,0.00014730355,0.00035001407,0.00014665363,0.00035571159,0.00083781726,0.000037403457,0.000002220893],"category_scores_gemma":[0.000060752613,0.00009910332,0.000014974934,0.00094982766,0.00010137656,0.0003355012,0.00027137384,0.00008276593,0.000010988807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030583049,0.00008478146,0.00033806084,0.00004198965,0.000010643429,0.0000032109901,0.002203774,0.0001923166,0.0008032547,0.04011295,0.11125807,0.8449479],"study_design_scores_gemma":[0.0009967716,0.00023279763,0.0035346344,0.00012675906,0.0000073981532,0.00016888346,0.0009347911,0.9394314,0.0032018444,0.0024466224,0.048188902,0.00072915544],"about_ca_topic_score_codex":0.017829996,"about_ca_topic_score_gemma":0.0010009215,"teacher_disagreement_score":0.93923914,"about_ca_system_score_codex":0.00019411606,"about_ca_system_score_gemma":0.0015344762,"threshold_uncertainty_score":0.98871034},"labels":[],"label_agreement":null},{"id":"W7096715863","doi":"","title":"UNIVERSITY OF CALGARY Continuous-Variable Quantum Computation of Oracle Decision Problems","year":2012,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum computer; Quantum algorithm; Hadamard transform; Quantum Fourier transform; Oracle; Exploit; Quantum information; Quantum; Parameterized complexity","score_opus":0.009259081269745128,"score_gpt":0.21199589786623868,"score_spread":0.20273681659649356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096715863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1817503,0.00014702564,0.8167466,0.00003499639,0.00019128919,0.0000898342,9.124973e-7,0.000063567255,0.00097545603],"genre_scores_gemma":[0.65471256,0.000003585195,0.34520692,0.000012994963,0.000013372469,8.0906204e-8,0.0000011229286,0.0000032498438,0.000046109184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915874,0.000058376525,0.00019681931,0.00016494081,0.00021320482,0.00020789845],"domain_scores_gemma":[0.9992525,0.00014824216,0.00016029883,0.00023489479,0.00012712658,0.00007695088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039463228,0.0000842641,0.0001946782,0.00008134298,0.000072200535,0.00001256169,0.0003846332,0.000049782666,0.000015360705],"category_scores_gemma":[0.000021470698,0.00007521926,0.00004358211,0.00037720287,0.000049136277,0.0002420372,0.000247999,0.00008310564,0.000008359747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006171461,0.0010133727,0.011505808,0.00023293048,0.000079826095,0.0000063128864,0.0053064167,0.053780947,0.011249091,0.32538593,0.0016979938,0.58967966],"study_design_scores_gemma":[0.0004057489,0.00013399158,0.006893799,0.00008466469,0.000006329538,0.000009592208,0.000047976617,0.98463356,0.00088982045,0.005514704,0.0012675584,0.00011226786],"about_ca_topic_score_codex":0.0003226913,"about_ca_topic_score_gemma":0.0000039203323,"teacher_disagreement_score":0.9308526,"about_ca_system_score_codex":0.000011720524,"about_ca_system_score_gemma":0.00004463225,"threshold_uncertainty_score":0.30673522},"labels":[],"label_agreement":null},{"id":"W7097538125","doi":"","title":"Quantum Programming","year":2004,"lang":"en","type":"article","venue":"TSpace","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Toronto","keywords":"Predicative expression; Quantum algorithm; Probabilistic logic; Quantum; Inductive programming; Quantum computer; Simple (philosophy)","score_opus":0.014196902056732538,"score_gpt":0.2833667951975547,"score_spread":0.2691698931408222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097538125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17058936,0.0001365203,0.8224757,0.0050167814,0.00031705428,0.000083455576,8.4187384e-8,0.0005318856,0.00084919966],"genre_scores_gemma":[0.7227859,0.0000021822232,0.2766815,0.00023669307,0.000111655354,0.0000038897015,3.8468767e-7,0.0000080132195,0.00016978914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991716,0.0000164865,0.00008792347,0.00026149323,0.00017119503,0.00029127716],"domain_scores_gemma":[0.999463,0.0000223007,0.000038329195,0.0003672871,0.000024892308,0.00008417891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012627497,0.00010020578,0.00009115065,0.000051650863,0.00012998669,0.0001317419,0.00052257424,0.000031541527,0.00000328004],"category_scores_gemma":[0.000018649102,0.00008468032,0.000048611255,0.00030936123,0.000027269596,0.000085631356,0.00017514934,0.0001416124,0.00008357052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034015507,0.00016099699,0.000107243664,0.00002543067,0.00002067193,0.00014988975,0.014178277,0.019093791,0.0013727908,0.49346933,0.00033941833,0.47107875],"study_design_scores_gemma":[0.0022805303,0.00079966703,0.0031420991,0.00023476801,0.000013056493,0.00052383426,0.0005927813,0.71217936,0.010759935,0.11968086,0.14839026,0.0014028556],"about_ca_topic_score_codex":0.00008205014,"about_ca_topic_score_gemma":0.0000028977522,"teacher_disagreement_score":0.69308555,"about_ca_system_score_codex":0.000022966662,"about_ca_system_score_gemma":0.000054529202,"threshold_uncertainty_score":0.34531632},"labels":[],"label_agreement":null},{"id":"W7097815037","doi":"","title":"THE UNIVERSITY OF CALGARY Programming with a Quantum Stack","year":2007,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Recursion (computer science); Semantics (computer science); Stack (abstract data type); Quantum computer; Operational semantics; Quantum; Quantum Turing machine","score_opus":0.006194682329555503,"score_gpt":0.19841515640711524,"score_spread":0.19222047407755974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097815037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09051531,0.00005518839,0.90724987,0.00025911233,0.00004125392,0.00007399069,5.1373544e-8,0.00009513504,0.001710078],"genre_scores_gemma":[0.7186928,0.000004285463,0.28080547,0.000036592755,0.000018872566,7.81192e-8,2.0526232e-7,0.0000040282553,0.00043771975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936706,0.000020383137,0.00007558678,0.00014875631,0.00016824785,0.00021996503],"domain_scores_gemma":[0.9994248,0.00013915783,0.00005117778,0.0002803443,0.00005209858,0.00005240317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038491734,0.00006083477,0.00006576999,0.000026723439,0.00025107583,0.00003329039,0.00053276255,0.00001878675,0.0000018545109],"category_scores_gemma":[0.0000056448303,0.000034841036,0.000029001654,0.00028162778,0.00009910826,0.000055052245,0.00014902694,0.00009251247,0.0000036769059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025521509,0.00004083181,0.00061508414,0.000008323326,0.00001914977,0.000058969596,0.0010944353,0.00023778928,0.000075166936,0.14459677,0.00017428078,0.8530537],"study_design_scores_gemma":[0.0004548269,0.00045177035,0.01243888,0.000038596132,0.0000059968165,0.000048987484,0.00041714747,0.89846134,0.00062500074,0.0014125983,0.08543349,0.00021137919],"about_ca_topic_score_codex":0.00010314744,"about_ca_topic_score_gemma":0.00012496952,"teacher_disagreement_score":0.8982235,"about_ca_system_score_codex":0.000009158587,"about_ca_system_score_gemma":0.000043483218,"threshold_uncertainty_score":0.19310977},"labels":[],"label_agreement":null},{"id":"W7097986872","doi":"","title":"UNIVERSITY OF CALGARY Algorithmic Quantum Channel Simulation","year":2015,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum computer; Quantum algorithm; Quantum network; Quantum channel; Quantum simulator; Quantum operation; Quantum; Open quantum system; Quantum process","score_opus":0.02195206934572867,"score_gpt":0.22928495014610056,"score_spread":0.2073328808003719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097986872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021346256,0.00003436679,0.97679245,0.00024583473,0.00018847673,0.00009262199,6.1639895e-7,0.00015239841,0.0011469607],"genre_scores_gemma":[0.91029936,0.0000013371869,0.0893391,0.000055857206,0.000044444347,1.3955292e-7,0.0000015333632,0.0000042614756,0.0002539664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932647,0.00004554274,0.000094028306,0.0002002537,0.00018823528,0.00014544286],"domain_scores_gemma":[0.9994044,0.000054866592,0.000058957838,0.00027036673,0.00010618394,0.000105227686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018463131,0.00007559518,0.00010947063,0.000071898874,0.000055531505,0.00001664512,0.00044593602,0.000040140036,0.00000441423],"category_scores_gemma":[0.000016240996,0.00007045391,0.00004342653,0.00025348604,0.00003301522,0.00014146912,0.00021429543,0.00007795735,0.000022363774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001986012,0.00015432065,0.00014594883,0.000020257574,0.00002711654,0.000053177235,0.004169345,0.76218915,0.00011808566,0.046169724,0.0011169886,0.18581599],"study_design_scores_gemma":[0.00029390573,0.000085899446,0.000446312,0.0000097186,0.0000017903492,0.0000054082,0.00004689903,0.99196833,0.00008177373,0.005331337,0.0016368206,0.000091814036],"about_ca_topic_score_codex":0.00018963093,"about_ca_topic_score_gemma":0.0000046979108,"teacher_disagreement_score":0.8889531,"about_ca_system_score_codex":0.000017906605,"about_ca_system_score_gemma":0.000069924754,"threshold_uncertainty_score":0.2873027},"labels":[],"label_agreement":null},{"id":"W7098200733","doi":"","title":"EFFECTIVENESS OF THE ENFORCEMENT OF INDUSTRIAL EMISSION STANDARDS IN","year":2014,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Enforcement; Latin Americans; Empirical research; Work (physics); Control (management); Empirical evidence; Developing country","score_opus":0.009059379277032552,"score_gpt":0.24427170419326613,"score_spread":0.2352123249162336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098200733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7570963,0.000006985984,0.24048577,0.00006750756,0.00026023458,0.00012285159,0.0000014002727,0.00001305346,0.001945904],"genre_scores_gemma":[0.99846345,2.9847016e-7,0.0014973131,0.000008910552,0.000016682845,0.0000010057487,1.3337792e-7,0.0000016609645,0.000010555236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914646,0.00021195738,0.00015647079,0.00011336995,0.00028310507,0.00008862226],"domain_scores_gemma":[0.9994087,0.00019414334,0.00006887095,0.00026539565,0.000044662385,0.000018211724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012523202,0.00005207638,0.000120859775,0.000040979692,0.000022893168,0.00000775667,0.00042509258,0.00003361969,0.0000055831442],"category_scores_gemma":[0.00010858935,0.0000287569,0.000040345727,0.000250558,0.000028005177,0.00002709148,0.00023959784,0.00009127739,9.80972e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109483175,0.0002246579,0.025545562,0.00024248712,0.000024905989,0.0000010225866,0.0013998282,0.06938708,0.0212187,0.26015133,0.0002642796,0.6214307],"study_design_scores_gemma":[0.0014824515,0.00031252584,0.012353185,0.000612569,0.000002428315,0.0000018400783,0.00001017376,0.6627297,0.31148928,0.0097520035,0.0011434118,0.00011044067],"about_ca_topic_score_codex":0.00010410079,"about_ca_topic_score_gemma":0.0000018999725,"teacher_disagreement_score":0.62132025,"about_ca_system_score_codex":0.000018907283,"about_ca_system_score_gemma":0.00007478443,"threshold_uncertainty_score":0.117267236},"labels":[],"label_agreement":null},{"id":"W7099562164","doi":"","title":"i How Do Public Pensions Affect Retirement Incomes and Expenditures? Evidence over Five Decades from Canada","year":2014,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Microdata (statistics); Counterfactual thinking; Pension; Affect (linguistics); Public use; Agency (philosophy); Pension system; Work (physics)","score_opus":0.01834444234050768,"score_gpt":0.24093365641812825,"score_spread":0.22258921407762056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099562164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7956683,0.00091933564,0.18369403,0.018623315,0.00060888653,0.00016916197,0.000004783848,0.00014675414,0.00016539772],"genre_scores_gemma":[0.9740811,0.000019397356,0.024497788,0.0010912188,0.00016126239,0.0000058205733,0.0000019877282,0.000008115577,0.0001332947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982978,0.00017041851,0.00013821227,0.0005801339,0.00046526545,0.00034813883],"domain_scores_gemma":[0.99811745,0.0009205556,0.00008532028,0.0006020118,0.000042058637,0.00023260516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024298542,0.00020073475,0.00022135084,0.00007172067,0.0002856707,0.0006913611,0.0007317349,0.000052198306,0.000016405622],"category_scores_gemma":[0.00018104598,0.00014558426,0.000042306845,0.00013945183,0.000050433133,0.00035642995,0.0006800255,0.00019895668,0.0000018698274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023297707,0.00016285143,0.08132039,0.00011744575,0.00024615068,0.00021713137,0.003608122,0.0014945304,0.0044450676,0.17003568,0.104550265,0.63377905],"study_design_scores_gemma":[0.00056244276,0.00022252301,0.21348213,0.00028797623,0.000015607411,0.00002861029,0.00014697737,0.7354468,0.0018667266,0.0074832994,0.03966492,0.00079196744],"about_ca_topic_score_codex":0.14784858,"about_ca_topic_score_gemma":0.18429925,"teacher_disagreement_score":0.7339523,"about_ca_system_score_codex":0.000053616524,"about_ca_system_score_gemma":0.00016538943,"threshold_uncertainty_score":0.857826},"labels":[],"label_agreement":null},{"id":"W7099776308","doi":"","title":"Eliminating Alberta&amp;apos;s Personal Income Tax:","year":2007,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Payment; Order (exchange); Public policy","score_opus":0.03059316429845996,"score_gpt":0.2970665422745895,"score_spread":0.2664733779761295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099776308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34234062,0.00003561367,0.64437824,0.001072658,0.00035745924,0.000059326463,4.4597556e-7,0.00019014232,0.011565487],"genre_scores_gemma":[0.7335691,7.093028e-7,0.26177368,0.000641426,0.0002335424,0.0000011032134,0.0000012341021,0.000010039858,0.003769178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846923,0.000031284817,0.00024741865,0.00040677263,0.000336613,0.0005087004],"domain_scores_gemma":[0.9989367,0.0004221436,0.00007646414,0.00034391508,0.000060963746,0.0001598032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062905764,0.00016855141,0.00014702043,0.00013890876,0.000247816,0.00014898469,0.000717935,0.000061063445,0.0000573462],"category_scores_gemma":[0.000085146734,0.00013723577,0.00008990405,0.00044093895,0.000041100535,0.0001637056,0.00037773757,0.00025103558,0.00015523119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000799845,0.00012057713,0.0034173261,0.00003234021,0.00003335211,0.000067822286,0.008930039,0.0005625242,0.0014417663,0.05939501,0.0013011006,0.9246901],"study_design_scores_gemma":[0.00051839434,0.00013940145,0.023307137,0.000069530215,0.000005803548,0.0003197655,0.00011950895,0.93367434,0.0016070554,0.0034835474,0.03606475,0.00069076644],"about_ca_topic_score_codex":0.00037783213,"about_ca_topic_score_gemma":0.00035673144,"teacher_disagreement_score":0.9331118,"about_ca_system_score_codex":0.000030032259,"about_ca_system_score_gemma":0.000035982084,"threshold_uncertainty_score":0.5596312},"labels":[],"label_agreement":null},{"id":"W7101467934","doi":"10.1039/d5dd00185d","title":"Estimating Trotter approximation errors to optimize Hamiltonian partitioning for lower eigenvalue errors","year":2025,"lang":"en","type":"article","venue":"Digital Discovery","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Hamiltonian (control theory); Eigenvalues and eigenvectors; Adiabatic quantum computation; Error analysis; Quantum; Approximation theory; Hamiltonian system; Ground state","score_opus":0.010027365045974528,"score_gpt":0.2525531712420841,"score_spread":0.24252580619610956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101467934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16710678,0.000019108338,0.8288638,0.0012483824,0.0008790143,0.00039184946,0.000029387886,0.000183503,0.0012781704],"genre_scores_gemma":[0.70140195,1.5787292e-7,0.29669097,0.0009378258,0.00011285187,0.000084498904,0.000029341234,0.00001551212,0.00072692387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984925,0.000020555713,0.0003264071,0.0005392126,0.00020738263,0.00041396724],"domain_scores_gemma":[0.99918944,0.00014742262,0.000088350054,0.00042794383,0.00006046205,0.00008638529],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00016686603,0.00021375794,0.0002159076,0.00017512773,0.00028252677,0.0014205979,0.0005349321,0.000055103625,0.0000015158977],"category_scores_gemma":[0.00019124764,0.00019559795,0.00016541782,0.00045018594,0.00003778778,0.0014064753,0.00030515078,0.00011910323,0.000019095865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040068597,0.00017135464,0.0003834881,0.00011391278,0.000061196624,0.00001003648,0.001274099,0.8623932,0.000247773,0.023863258,0.0019303372,0.10951125],"study_design_scores_gemma":[0.0003163309,0.00009719643,0.0011231971,0.00021016825,0.000007320641,0.0000043018226,0.0000422629,0.983726,0.000428568,0.012655676,0.0011191953,0.00026974812],"about_ca_topic_score_codex":0.0000050612935,"about_ca_topic_score_gemma":0.0000017830683,"teacher_disagreement_score":0.53429514,"about_ca_system_score_codex":0.000056817444,"about_ca_system_score_gemma":0.0000856199,"threshold_uncertainty_score":0.999616},"labels":[],"label_agreement":null},{"id":"W7104032756","doi":"10.1109/tmtt.2025.3619571","title":"Quantum Method of Calculating Multiport S-Parameter Magnitudes Based on FEM for Microwave Components: An HHL Framework","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Microwave Theory and Techniques","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Quantum computer; Finite element method; Quantum; Quantum algorithm; Quantum phase estimation algorithm; Microwave; Quantum circuit; Field (mathematics); Quantum information; Electromagnetic field","score_opus":0.019803217581428313,"score_gpt":0.31192991494896194,"score_spread":0.2921266973675336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104032756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060268592,0.0001637164,0.9362797,0.00032953618,0.0007100653,0.0015791806,0.00015613358,0.00039333568,0.000119749246],"genre_scores_gemma":[0.5474221,0.000025748393,0.45156354,0.0007638759,0.000043115495,0.00008048944,0.0000054591947,0.000040104194,0.00005557047],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99492437,0.0014631168,0.0011119741,0.0014400327,0.00032733398,0.0007331629],"domain_scores_gemma":[0.99235624,0.005394597,0.00045530038,0.0012714638,0.000318756,0.00020361607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030499592,0.0008167524,0.0009966046,0.00091738533,0.0009185503,0.000279151,0.000904541,0.0006099558,0.000018030272],"category_scores_gemma":[0.000097698976,0.00077824056,0.0005799161,0.0007550064,0.0005339904,0.0002339391,0.000023714845,0.00126869,0.0000015867064],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012593917,0.001462951,0.000007100683,0.00053830614,0.00023110356,0.000011019854,0.0011101888,0.006720705,0.30784085,0.03489543,0.000015804142,0.64590716],"study_design_scores_gemma":[0.0005257912,0.0013089476,0.000016314008,0.0017658802,0.0001621936,0.000018824165,0.00006938448,0.3409319,0.57140625,0.08320747,0.00010842711,0.0004786367],"about_ca_topic_score_codex":0.000037843693,"about_ca_topic_score_gemma":0.00000820099,"teacher_disagreement_score":0.6454285,"about_ca_system_score_codex":0.00008849077,"about_ca_system_score_gemma":0.00017317958,"threshold_uncertainty_score":0.99946684},"labels":[],"label_agreement":null},{"id":"W7105855885","doi":"10.2139/ssrn.5759456","title":"An Investigation of functional size measurement of error correction overhead in quantum software","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec","funders":"","keywords":"Quantum error correction; Quantum computer; Error detection and correction; Overhead (engineering); Software; Qubit; Quantum; Sizing","score_opus":0.023085261989510622,"score_gpt":0.25871420658905264,"score_spread":0.23562894459954203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105855885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45178297,0.0021652642,0.54033786,0.0004149328,0.004849638,0.00037858493,0.0000114797895,0.000043177362,0.000016077958],"genre_scores_gemma":[0.99367946,0.0008814576,0.0047592353,0.000054791668,0.00044300983,0.000012445788,0.000011225252,0.000028134627,0.00013026358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9912292,0.0011529546,0.0021487747,0.0010810922,0.0020428994,0.0023451145],"domain_scores_gemma":[0.9947395,0.00041066977,0.002257784,0.00088765426,0.0014940478,0.00021035144],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.009130352,0.0006626056,0.0010573395,0.00090851635,0.0003322416,0.00013175205,0.001570132,0.0004945107,0.000019293931],"category_scores_gemma":[0.00064940215,0.0006739661,0.00051104376,0.001283153,0.00023216761,0.00040762246,0.0004902879,0.007160885,0.0000018654725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005057726,0.000764495,0.013655659,0.00044692372,0.0005830451,0.00000545859,0.0033182292,0.79598886,0.003447752,0.015156205,0.00007253483,0.16605505],"study_design_scores_gemma":[0.0012687143,0.0016225552,0.055263437,0.0022801321,0.000102748694,0.00024305051,0.0005847766,0.7324688,0.001172832,0.20444334,0.00001649005,0.0005331704],"about_ca_topic_score_codex":0.0008782404,"about_ca_topic_score_gemma":0.0017120127,"teacher_disagreement_score":0.54189646,"about_ca_system_score_codex":0.0028458866,"about_ca_system_score_gemma":0.024022248,"threshold_uncertainty_score":0.99957114},"labels":[],"label_agreement":null},{"id":"W7105990874","doi":"10.48550/arxiv.2511.13687","title":"Network Operations Scheduling for Distributed Quantum Computing","year":2025,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Quantum computer; Qubit; Quantum algorithm; Quantum entanglement; Greedy algorithm; Quantum gate; Quantum Fourier transform; Quantum network","score_opus":0.052704850261612285,"score_gpt":0.2127875146212013,"score_spread":0.160082664359589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105990874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10346195,0.00028016025,0.88897973,0.00069457124,0.0043021194,0.0012906181,0.00033059303,0.0005035439,0.0001567107],"genre_scores_gemma":[0.9169903,0.00008760694,0.08044871,0.00036515814,0.0011287334,0.0000027763579,0.00024875865,0.000038603535,0.00068936514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936079,0.00049039564,0.0009180658,0.003168806,0.00018896698,0.0016258989],"domain_scores_gemma":[0.9949639,0.0011520812,0.0005311935,0.0020532503,0.00085722643,0.0004423677],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001155946,0.0010310468,0.0011374343,0.0003853963,0.0029677732,0.00087792793,0.003867861,0.0006971219,0.000015710126],"category_scores_gemma":[0.00023623799,0.0012564837,0.0008443204,0.002577791,0.00030008686,0.00034636565,0.005110616,0.0017611174,0.000030635052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044411867,0.00013537807,0.00024152157,0.0002113851,0.00021273355,0.000059608305,0.00031373237,0.7605355,0.0000054527245,0.23534504,0.00026870047,0.0026265758],"study_design_scores_gemma":[0.0012272045,0.00016854018,0.0002899931,0.0012166365,0.00025683077,0.000010902484,0.00011107655,0.95516145,0.000017693184,0.038894657,0.0014643321,0.0011806807],"about_ca_topic_score_codex":0.00021067516,"about_ca_topic_score_gemma":0.000053908472,"teacher_disagreement_score":0.81352836,"about_ca_system_score_codex":0.00037665095,"about_ca_system_score_gemma":0.0012138161,"threshold_uncertainty_score":0.9989885},"labels":[],"label_agreement":null},{"id":"W7106040815","doi":"10.5281/zenodo.17643655","title":"Real limitations and new alternatives for quantum computing and technologies - Alejandro Mata Ali","year":2025,"lang":"","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wildlife Habitat Canada (Canada)","funders":"","keywords":"Quantum computer; Quantum; Key (lock); Scheme (mathematics); Natural computing","score_opus":0.05033621780485161,"score_gpt":0.2794157327096268,"score_spread":0.22907951490477516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106040815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05150892,0.0022803028,0.9147798,0.018158427,0.0005892537,0.0013789247,0.0002281028,0.002331656,0.008744612],"genre_scores_gemma":[0.94697475,0.00313476,0.046880234,0.0002600239,0.0002826772,1.2673294e-7,0.0002822884,0.00086490286,0.001320234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729407,0.0002846497,0.00047044203,0.0010369099,0.00029180397,0.0006221475],"domain_scores_gemma":[0.9981478,0.00033663146,0.00022530064,0.0006340079,0.00046857807,0.0001877249],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008195544,0.00031618527,0.00033459842,0.00056199834,0.0046338807,0.0030108935,0.0016855695,0.00013622124,0.000050213355],"category_scores_gemma":[0.0011958046,0.00033176225,0.00006840495,0.0009617414,0.00055734714,0.0003658793,0.0048867315,0.00044953555,0.00006938154],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036434223,0.00007945264,0.0000073009583,0.00019927812,0.00010308971,0.0000079953115,0.003743368,0.00036755376,0.00062324555,0.10576743,0.023712693,0.86535215],"study_design_scores_gemma":[0.0011271443,0.00055658474,0.001094772,0.00035431012,0.000042030002,0.00012581164,0.0010632237,0.61338425,0.00030553638,0.0140204625,0.36754897,0.00037687173],"about_ca_topic_score_codex":0.000054243792,"about_ca_topic_score_gemma":8.8433285e-7,"teacher_disagreement_score":0.89546585,"about_ca_system_score_codex":0.00007280173,"about_ca_system_score_gemma":0.000024635146,"threshold_uncertainty_score":0.99991345},"labels":[],"label_agreement":null},{"id":"W7106041520","doi":"10.5281/zenodo.17643654","title":"Real limitations and new alternatives for quantum computing and technologies - Alejandro Mata Ali","year":2025,"lang":"","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wildlife Habitat Canada (Canada)","funders":"","keywords":"Quantum computer; Quantum; Key (lock); Scheme (mathematics); Natural computing","score_opus":0.05033621780485161,"score_gpt":0.2794157327096268,"score_spread":0.22907951490477516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106041520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05150892,0.0022803028,0.9147798,0.018158427,0.0005892537,0.0013789247,0.0002281028,0.002331656,0.008744612],"genre_scores_gemma":[0.94697475,0.00313476,0.046880234,0.0002600239,0.0002826772,1.2673294e-7,0.0002822884,0.00086490286,0.001320234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729407,0.0002846497,0.00047044203,0.0010369099,0.00029180397,0.0006221475],"domain_scores_gemma":[0.9981478,0.00033663146,0.00022530064,0.0006340079,0.00046857807,0.0001877249],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008195544,0.00031618527,0.00033459842,0.00056199834,0.0046338807,0.0030108935,0.0016855695,0.00013622124,0.000050213355],"category_scores_gemma":[0.0011958046,0.00033176225,0.00006840495,0.0009617414,0.00055734714,0.0003658793,0.0048867315,0.00044953555,0.00006938154],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036434223,0.00007945264,0.0000073009583,0.00019927812,0.00010308971,0.0000079953115,0.003743368,0.00036755376,0.00062324555,0.10576743,0.023712693,0.86535215],"study_design_scores_gemma":[0.0011271443,0.00055658474,0.001094772,0.00035431012,0.000042030002,0.00012581164,0.0010632237,0.61338425,0.00030553638,0.0140204625,0.36754897,0.00037687173],"about_ca_topic_score_codex":0.000054243792,"about_ca_topic_score_gemma":8.8433285e-7,"teacher_disagreement_score":0.89546585,"about_ca_system_score_codex":0.00007280173,"about_ca_system_score_gemma":0.000024635146,"threshold_uncertainty_score":0.99991345},"labels":[],"label_agreement":null},{"id":"W7106476627","doi":"","title":"Exact Factorization of Unitary Transformations with Spin-Adapted Generators","year":2025,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Novo Nordisk Fonden; Danmarks Tekniske Universitet; Novo Nordisk","keywords":"Factorization; Pauli exclusion principle; Quantum computer; Unitary state; Pauli matrices; Quantum; Symmetry (geometry); Algebra over a field; Representation (politics); Quantum algorithm","score_opus":0.022727248583413334,"score_gpt":0.17496383911497118,"score_spread":0.15223659053155786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106476627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38040262,0.00008755546,0.6176743,0.00013727097,0.0003064897,0.0001918146,0.00001753296,0.000075535376,0.0011068927],"genre_scores_gemma":[0.99673927,0.00012686952,0.0025605508,0.000080957805,0.000040136878,1.7982943e-7,0.000014055191,0.000012732064,0.00042522987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982481,0.00019010378,0.00035702053,0.000667434,0.00013557816,0.00040177134],"domain_scores_gemma":[0.99845225,0.000112275564,0.0002360382,0.000711966,0.0003360703,0.00015141023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017512172,0.000336478,0.00036266315,0.0006024444,0.00041380827,0.00008119414,0.000914819,0.00015604304,0.00002994798],"category_scores_gemma":[0.000016156002,0.00033684893,0.00015105559,0.0038841728,0.00021535794,0.0005985878,0.00017323424,0.00034796557,0.000009286342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063811654,0.00019526543,0.0020195185,0.00013622807,0.00019504297,0.000056129364,0.0010528013,0.8284194,0.00026603157,0.15795311,0.0000611609,0.009581511],"study_design_scores_gemma":[0.0010048845,0.0003138713,0.0033351397,0.000303624,0.00013306832,0.0000049588093,0.00018411195,0.9880243,0.0025155563,0.003359354,0.0004698912,0.0003512159],"about_ca_topic_score_codex":0.00013798285,"about_ca_topic_score_gemma":0.00005425733,"teacher_disagreement_score":0.61633664,"about_ca_system_score_codex":0.00010237916,"about_ca_system_score_gemma":0.0005249917,"threshold_uncertainty_score":0.9999083},"labels":[],"label_agreement":null},{"id":"W7108247562","doi":"","title":"Accuracy and resource advantages of quantum eigenvalue estimation with non-Hermitian transcorrelated electronic Hamiltonians","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alliance de recherche numérique du Canada; Mitacs; University of Toronto","keywords":"Hamiltonian (control theory); Eigenvalues and eigenvectors; Qubit; Quantum; Ground state; Quantum algorithm; Adiabatic quantum computation; Basis (linear algebra)","score_opus":0.0066242152180428235,"score_gpt":0.24341969640276434,"score_spread":0.23679548118472152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108247562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65251684,0.002695789,0.3423129,0.0014617802,0.00022394607,0.00044913133,0.000008272152,0.00011115486,0.00022017321],"genre_scores_gemma":[0.99363655,0.00044994493,0.0051245033,0.00032407563,0.00006057055,0.000013623442,0.0000110109795,0.000045399156,0.00033435156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960676,0.00027924337,0.0008588935,0.0012119923,0.0004314826,0.0011507976],"domain_scores_gemma":[0.9975086,0.0005425564,0.0004839053,0.0010868639,0.00017240699,0.00020568511],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006304347,0.0006218918,0.00072778005,0.00041299543,0.0006029905,0.00017828977,0.0010161166,0.00026486834,0.00001300087],"category_scores_gemma":[0.0001106143,0.000553971,0.00016780978,0.0016567364,0.0004637774,0.0004374112,0.0002711378,0.001054636,0.000012826841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004963133,0.0008280566,0.11009576,0.0012551544,0.00086740224,0.00015186654,0.014669635,0.21527094,0.009614369,0.008018593,0.00017314924,0.63855875],"study_design_scores_gemma":[0.0014404234,0.0009685198,0.13124914,0.0012889418,0.00016819047,0.00007980056,0.00015874086,0.85890204,0.0037586298,0.00069125724,0.000786387,0.0005079516],"about_ca_topic_score_codex":0.00016821601,"about_ca_topic_score_gemma":0.00003488916,"teacher_disagreement_score":0.6436311,"about_ca_system_score_codex":0.00009479077,"about_ca_system_score_gemma":0.0008161169,"threshold_uncertainty_score":0.9996912},"labels":[],"label_agreement":null},{"id":"W7108481410","doi":"10.5281/zenodo.17808581","title":"The RHEA-Λ Family: 2 A Binary–Ternary–Pentary Reversible Gate for 3 Hamiltonian Symbolic Computation in the 4 RHEA-UCM Framework","year":2025,"lang":"","type":"preprint","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Teck (Canada)","funders":"","keywords":"Computation; Topology (electrical circuits); Hamiltonian (control theory); Bijection; Symbolic computation; Reversible computing; Logic gate","score_opus":0.030998406947867492,"score_gpt":0.27382415632319024,"score_spread":0.24282574937532275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108481410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052365854,0.0025370128,0.87994576,0.036498155,0.004285823,0.007780467,0.0010693732,0.001521023,0.0139965555],"genre_scores_gemma":[0.89475644,0.00635293,0.07309264,0.008029743,0.0033218784,0.0000087175,0.0052600354,0.004651726,0.0045258747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913328,0.0027775818,0.0012144108,0.0019603465,0.0012449833,0.0014698685],"domain_scores_gemma":[0.9945682,0.001108974,0.0006572639,0.0023456921,0.0010345036,0.0002853491],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.004714351,0.0007617796,0.00066207326,0.0007242102,0.010592026,0.005895012,0.009794859,0.00039378717,0.00024390026],"category_scores_gemma":[0.001027342,0.00061246136,0.00040899086,0.002601972,0.000612192,0.00034666774,0.010022739,0.002839904,0.0008671091],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004354801,0.00077773473,0.000009992737,0.000965172,0.00035624282,0.000115127004,0.027683847,0.13233992,0.00022276936,0.025609704,0.13198948,0.6794945],"study_design_scores_gemma":[0.0007955175,0.00049384375,0.0013625114,0.001079698,0.00004863557,0.00011167378,0.0008090056,0.49682945,0.000019900204,0.012289877,0.4856049,0.000554948],"about_ca_topic_score_codex":0.00021874765,"about_ca_topic_score_gemma":0.0000036978247,"teacher_disagreement_score":0.8423906,"about_ca_system_score_codex":0.000465836,"about_ca_system_score_gemma":0.000092030794,"threshold_uncertainty_score":0.99991083},"labels":[],"label_agreement":null},{"id":"W7109970811","doi":"10.4230/lipics.itcs.2025.32","title":"Succinct Fermion Data Structures","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"U.S. Department of Energy","keywords":"Quantum computer; Qubit; Fermion; Overhead (engineering); Space (punctuation); Homogeneous space; Quantum; Time complexity","score_opus":0.018284661414837894,"score_gpt":0.2880888042983047,"score_spread":0.26980414288346677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109970811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08716107,0.00016536689,0.9012843,0.0018794617,0.003000749,0.00094095536,0.0004545657,0.00062568445,0.004487844],"genre_scores_gemma":[0.8202977,0.000030642022,0.17415151,0.0035468538,0.00033969842,0.000034586352,0.00088648783,0.000039439117,0.0006730771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972927,0.000050566778,0.00091922976,0.00052389386,0.00044142499,0.00077219686],"domain_scores_gemma":[0.99665976,0.0002158949,0.00030017976,0.0024810398,0.00018404528,0.00015908518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063352654,0.00041812917,0.0004465661,0.00037273858,0.0005659949,0.00077114755,0.0042652613,0.00020194078,0.000011137382],"category_scores_gemma":[0.00014143657,0.00034530956,0.00016749754,0.00061519496,0.00009350315,0.0013296716,0.0025956016,0.00053220155,0.000040870855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014858323,0.0005238885,0.006845568,0.0017126505,0.00065966294,0.00003135244,0.007932285,0.005546732,0.00012459642,0.31218725,0.091699235,0.5725882],"study_design_scores_gemma":[0.001686408,0.000115898416,0.0031892108,0.00016548738,0.000029460802,0.000057247627,0.00013813375,0.8506229,0.00042389904,0.013855143,0.1292202,0.00049602333],"about_ca_topic_score_codex":0.00003109155,"about_ca_topic_score_gemma":0.000018111157,"teacher_disagreement_score":0.84507614,"about_ca_system_score_codex":0.00006954706,"about_ca_system_score_gemma":0.00017034858,"threshold_uncertainty_score":0.99989986},"labels":[],"label_agreement":null},{"id":"W7110046292","doi":"10.4230/lipics.itcs.2025.11","title":"Rank Lower Bounds on Non-Local Quantum Computation","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Government of Canada; Ministry of Colleges and Universities; Agence Nationale de la Recherche; Innovation, Science and Economic Development Canada","keywords":"Upper and lower bounds; Quantum entanglement; Rank (graph theory); Communication complexity; Quantum information science; Bounding overwatch; Randomness; Quantum; Function (biology); Quantum information","score_opus":0.006805257372883821,"score_gpt":0.2554954907077905,"score_spread":0.24869023333490667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110046292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10327878,0.000025571544,0.8875325,0.0012436236,0.0031206969,0.0007156905,0.000062755695,0.00036778444,0.0036526166],"genre_scores_gemma":[0.9639529,0.000007894769,0.031722438,0.0035886369,0.0001699839,0.000054332777,0.0001297742,0.000031670286,0.0003423418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970407,0.000040229363,0.0010421501,0.0004591515,0.0005683307,0.00084942847],"domain_scores_gemma":[0.99805456,0.00031326496,0.00033079763,0.00084560993,0.0002696621,0.0001860789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006057653,0.00048693834,0.00051437964,0.00050635706,0.00065872795,0.0007436445,0.0014168671,0.00024066518,0.000006212364],"category_scores_gemma":[0.00006166146,0.00042476444,0.00033182776,0.0007385897,0.0001652934,0.0007219182,0.00053816114,0.00063401496,0.0001413452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006190275,0.0021140943,0.0011365798,0.0016679094,0.00070900086,0.000059566813,0.015091834,0.1209261,0.00013213769,0.23475952,0.07253243,0.5502518],"study_design_scores_gemma":[0.0024397168,0.00047527655,0.0007929862,0.00031140854,0.000018733084,0.000024321795,0.00015744304,0.9606367,0.00034643957,0.0065522008,0.027786884,0.00045789487],"about_ca_topic_score_codex":0.000017284,"about_ca_topic_score_gemma":0.0000049801315,"teacher_disagreement_score":0.86067414,"about_ca_system_score_codex":0.00014774175,"about_ca_system_score_gemma":0.00017275133,"threshold_uncertainty_score":0.9998204},"labels":[],"label_agreement":null},{"id":"W7110192836","doi":"10.4230/lipics.mfcs.2025.85","title":"Cutoff Theorems for the Equivalence of Parameterized Quantum Circuits","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Parameterized complexity; Equivalence (formal languages); Modulo; Electronic circuit; Quantum gate; Quantum circuit; Quantum algorithm; Probabilistic logic; Quantum; Formal equivalence checking","score_opus":0.014438882305444956,"score_gpt":0.2711900122484945,"score_spread":0.25675112994304955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110192836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06523588,0.0001603822,0.9289674,0.0010782566,0.0018494657,0.0015653208,0.00022797137,0.0001901917,0.0007251169],"genre_scores_gemma":[0.95004946,0.000046304933,0.047772273,0.0014325994,0.00012554701,0.00022332458,0.000050259914,0.00003009396,0.0002701641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726343,0.00005679444,0.0011493765,0.00034629463,0.00041612706,0.000767999],"domain_scores_gemma":[0.99627674,0.0014473948,0.0005405351,0.0012789858,0.0003549423,0.00010138139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011380016,0.0003810281,0.0005431592,0.00024718323,0.0005410388,0.00037222638,0.002713909,0.00016341447,0.0000045681686],"category_scores_gemma":[0.0002942489,0.0002599319,0.00044846075,0.00060574757,0.0002636018,0.000523601,0.0006792591,0.00035794228,0.00000926702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021946557,0.00048471225,0.00069907843,0.002128369,0.00066567794,0.0000029092575,0.012357366,0.0051989094,0.00093073107,0.651708,0.005939529,0.31966525],"study_design_scores_gemma":[0.0020519772,0.00033548698,0.000372793,0.00030294262,0.000049505656,0.00001638118,0.0003155764,0.9469924,0.0019648024,0.024432156,0.022825133,0.00034086016],"about_ca_topic_score_codex":0.000012584024,"about_ca_topic_score_gemma":0.0000018510827,"teacher_disagreement_score":0.9417935,"about_ca_system_score_codex":0.000046645036,"about_ca_system_score_gemma":0.00016261509,"threshold_uncertainty_score":0.9999853},"labels":[],"label_agreement":null},{"id":"W7110328578","doi":"10.4230/lipics.stacs.2025.54","title":"Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer","year":2024,"lang":"en","type":"article","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; European Commission; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Divide and conquer algorithms; Quantum; Subspace topology; Simple (philosophy); Quadratic growth; Quantum algorithm; Quantum network; Quantum logic; Quantum computer; Topology (electrical circuits)","score_opus":0.04866742079682993,"score_gpt":0.341117747008339,"score_spread":0.29245032621150907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110328578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19839059,0.0007269351,0.7749428,0.022147864,0.0015131797,0.0014818596,0.000045839482,0.0001492668,0.000601663],"genre_scores_gemma":[0.93649346,0.00018690711,0.06175121,0.0009965835,0.00040441818,0.00009780161,0.000011444596,0.000017855995,0.000040351453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530023,0.0001351552,0.0006260845,0.0005191141,0.002565772,0.00085362344],"domain_scores_gemma":[0.9955953,0.0030153987,0.0000910307,0.0004784699,0.00062717707,0.00019265129],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012806077,0.00027328075,0.00026383533,0.00054189836,0.0015796146,0.0019853539,0.002072429,0.00009003512,0.000003630624],"category_scores_gemma":[0.0007536938,0.0001485423,0.00008473681,0.0014712677,0.0015563366,0.0012141456,0.0010896318,0.0007423492,0.000015692513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010934189,0.000093680406,0.000015461497,0.00022244127,0.000022779212,0.000007711724,0.011582267,0.0025635639,0.00004603771,0.9376485,0.0033866724,0.044399995],"study_design_scores_gemma":[0.00027382816,0.00014564133,0.00024823495,0.0002733095,0.0000041602607,0.00020663269,0.0001562763,0.7574332,0.00002522702,0.22001699,0.021054855,0.0001616649],"about_ca_topic_score_codex":0.000025490574,"about_ca_topic_score_gemma":0.000010941765,"teacher_disagreement_score":0.75486964,"about_ca_system_score_codex":0.00013795398,"about_ca_system_score_gemma":0.00070454954,"threshold_uncertainty_score":0.9997202},"labels":[],"label_agreement":null},{"id":"W7110396286","doi":"10.4230/lipics.itcs.2025.33","title":"Bosonic Quantum Computational Complexity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institute for Quantum Information and Matter, California Institute of Technology; Agence Nationale de la Recherche; National Science Foundation","keywords":"Quantum computer; Quantum complexity theory; Quantum algorithm; Quantum; Upper and lower bounds; Adiabatic quantum computation; Complexity class; Quantum information; Observable; Hilbert space","score_opus":0.015383896801927179,"score_gpt":0.2703875122554101,"score_spread":0.2550036154534829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110396286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07996093,0.00007154073,0.9119952,0.0019978308,0.0013548511,0.00074749463,0.00018194222,0.0005188062,0.003171411],"genre_scores_gemma":[0.74797416,0.000009393904,0.24711765,0.003962612,0.00017072764,0.00006738211,0.00029059194,0.000031346335,0.00037610918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970733,0.0000611047,0.0011027606,0.0004127503,0.0005213998,0.0008286994],"domain_scores_gemma":[0.99797094,0.00031770943,0.00035548845,0.0008441602,0.0003267831,0.00018491292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059807155,0.0004249639,0.0005056656,0.00040551208,0.00073056464,0.00065284,0.0018602441,0.00018106478,0.0000143688285],"category_scores_gemma":[0.000084187566,0.00038577136,0.00031543756,0.0007204865,0.00020975315,0.00077385944,0.0008706813,0.0005578779,0.00010121186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008066682,0.0005083526,0.0014795237,0.0008578337,0.00033521643,0.000009334255,0.004494763,0.025359193,0.000016111822,0.92406017,0.015144947,0.027653903],"study_design_scores_gemma":[0.0015909093,0.00012253496,0.0021965906,0.00017636725,0.000015577012,0.000039304512,0.000113431954,0.8891976,0.000073555435,0.07644893,0.029638346,0.0003868519],"about_ca_topic_score_codex":0.00001960451,"about_ca_topic_score_gemma":0.000007877978,"teacher_disagreement_score":0.86383843,"about_ca_system_score_codex":0.00012243868,"about_ca_system_score_gemma":0.00024375849,"threshold_uncertainty_score":0.9998594},"labels":[],"label_agreement":null},{"id":"W7110869373","doi":"10.1021/acs.jctc.5c00504.s001","title":"Mixed Quantum/ClassicalTheory Approach to RotationallyInelastic Molecular Collisions Implemented on a Quantum Computer","year":2025,"lang":"","type":"article","venue":"Figshare","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum; Quantum computer; Quantum algorithm; Inelastic scattering; Collision; Scattering theory; Quantum phase estimation algorithm; Inelastic collision; Quantum error correction; Scattering","score_opus":0.03142912072587714,"score_gpt":0.27863648957873105,"score_spread":0.2472073688528539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110869373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065658214,0.00044124827,0.8842848,0.0072527467,0.002562417,0.00352303,0.09203303,0.0007126626,0.0026242656],"genre_scores_gemma":[0.8648743,0.000004973502,0.078974575,0.015695976,0.0010533113,0.0014572131,0.037047166,0.0001919088,0.0007005981],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933269,0.00070674176,0.0011737058,0.0022150124,0.0011604661,0.0014171969],"domain_scores_gemma":[0.9949226,0.0016716047,0.0003659018,0.0016878066,0.0006565475,0.0006955526],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00038693546,0.0009434069,0.00086972193,0.00093138043,0.0009942933,0.0009559325,0.002767876,0.00031590712,0.0033316095],"category_scores_gemma":[0.0013746747,0.0009077625,0.00050867506,0.0032285426,0.00004767744,0.0001741083,0.0022732895,0.0010843482,0.0020097203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009853608,0.0013637431,0.0000045165975,0.00061330624,0.00028433104,0.00012028441,0.0007741687,0.28944388,0.00017230805,0.22737044,0.42666638,0.0530881],"study_design_scores_gemma":[0.0010492803,0.0006965892,0.0017319442,0.005173417,0.000037159607,0.000021053702,0.000037256978,0.9334241,0.00028231033,0.003476102,0.053236492,0.00083427853],"about_ca_topic_score_codex":0.000008756685,"about_ca_topic_score_gemma":0.0000015771953,"teacher_disagreement_score":0.85830843,"about_ca_system_score_codex":0.00023321384,"about_ca_system_score_gemma":0.0010509946,"threshold_uncertainty_score":0.9993373},"labels":[],"label_agreement":null},{"id":"W7114820610","doi":"","title":"Migrating QAOA from Qiskit 1.x to 2.x: An experience report","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mitacs","keywords":"Software; State (computer science); Quantum; Sampling (signal processing); Affect (linguistics); Optimization algorithm; Root (linguistics)","score_opus":0.025567134891350776,"score_gpt":0.29856130408605774,"score_spread":0.272994169194707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114820610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7740094,0.00049440924,0.2173169,0.0031832661,0.0036996903,0.00034856368,0.000010064999,0.00032945038,0.0006082259],"genre_scores_gemma":[0.9452746,0.000012614823,0.04889417,0.0033794194,0.000885985,0.000036276935,0.000011696354,0.000035906618,0.0014693445],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9941356,0.00028980506,0.0012467039,0.0025144124,0.00065713463,0.0011563032],"domain_scores_gemma":[0.9954515,0.00032263246,0.00040144275,0.0029470215,0.00027990955,0.0005974662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068301643,0.00066853856,0.00068166316,0.00031454363,0.0010900359,0.00075501093,0.0027974437,0.00024659824,0.000087216555],"category_scores_gemma":[0.00059116224,0.0006669739,0.0002525748,0.002049224,0.00019552668,0.00062323746,0.0018737679,0.0007990725,0.00025131583],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004659122,0.00059466704,0.642525,0.000055717956,0.0001614713,0.0022665628,0.042044077,0.008191693,0.014122533,0.0011100583,0.0016756909,0.28720593],"study_design_scores_gemma":[0.00047227417,0.00036431366,0.5020579,0.00076004537,0.000042571737,0.00011017497,0.00072445744,0.4637389,0.014061056,0.0009874577,0.015586218,0.0010946388],"about_ca_topic_score_codex":0.0025632083,"about_ca_topic_score_gemma":0.00020825614,"teacher_disagreement_score":0.45554718,"about_ca_system_score_codex":0.00010865929,"about_ca_system_score_gemma":0.00045460128,"threshold_uncertainty_score":0.9995781},"labels":[],"label_agreement":null},{"id":"W7115177649","doi":"10.1109/comst.2025.3644750","title":"Quantum Federated Learning: A Comprehensive Survey","year":2025,"lang":"","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Key (lock); Quantum; Quantum computer; Societal impact of nanotechnology; Quantum information science","score_opus":0.060371112829359454,"score_gpt":0.32799675385741867,"score_spread":0.2676256410280592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115177649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13922594,0.016684696,0.78550595,0.007554994,0.042518903,0.0025155009,0.0003741321,0.0015999392,0.0040199696],"genre_scores_gemma":[0.98720944,0.002223784,0.005897561,0.0004555248,0.00065449567,0.00008554545,0.00031036907,0.000085160216,0.0030781445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9498389,0.043738943,0.002416833,0.0017059727,0.0008754412,0.0014239042],"domain_scores_gemma":[0.97301424,0.015007573,0.0011625726,0.0072075683,0.0032162105,0.00039184323],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.015421187,0.0011028913,0.001796003,0.0008385662,0.004719624,0.002512823,0.008935773,0.0006751688,0.000044107794],"category_scores_gemma":[0.003316081,0.0011895944,0.00049520575,0.005487671,0.0013530848,0.00051189156,0.0040167486,0.0027498438,0.00035989762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000398002,0.007471935,0.03608932,0.000837504,0.0051218444,0.00010051823,0.0127938,0.12108097,0.0144217955,0.0734932,0.07853185,0.6496593],"study_design_scores_gemma":[0.0017467657,0.0003240933,0.09497868,0.00064927037,0.000114188115,0.0000189714,0.00013530337,0.7899908,0.00062498695,0.002467492,0.10755392,0.0013955585],"about_ca_topic_score_codex":0.006718859,"about_ca_topic_score_gemma":0.0013302953,"teacher_disagreement_score":0.8479835,"about_ca_system_score_codex":0.0003396863,"about_ca_system_score_gemma":0.0022996617,"threshold_uncertainty_score":0.9998955},"labels":[],"label_agreement":null},{"id":"W7116654097","doi":"10.1016/j.disc.2025.114959","title":"New results in vertex sedentariness","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Vertex (graph theory); Bipartite graph; Graph; Neighbourhood (mathematics); Laplace operator","score_opus":0.008692868903677434,"score_gpt":0.2550048605322539,"score_spread":0.24631199162857648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116654097","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026667744,0.000060598017,0.9519942,0.003095783,0.0004811951,0.0001501837,0.000002492012,0.00016635477,0.017381461],"genre_scores_gemma":[0.36407927,0.0000073955202,0.62953067,0.0004945484,0.00006617759,0.0000065720947,0.000006486135,0.000014999238,0.0057938863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900204,0.00002256307,0.00031052832,0.00027000156,0.00016676492,0.0002280913],"domain_scores_gemma":[0.99915415,0.000156431,0.00006166117,0.00055521785,0.00001927193,0.00005329721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021636105,0.00012804399,0.00018251169,0.00014525141,0.000055855115,0.0001386766,0.0007876323,0.000043415363,0.000004214356],"category_scores_gemma":[0.000089331246,0.00010556526,0.000051520437,0.00059179094,0.000014906346,0.00008860178,0.00037948982,0.00015350098,0.00002136402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001875064,0.0001899793,0.00041332454,0.0002686848,0.000050436625,0.00009131635,0.010420878,0.006956001,0.00021589357,0.7627804,0.016558582,0.20203573],"study_design_scores_gemma":[0.0007301514,0.00002286239,0.0014864001,0.0002824333,0.000004562378,0.000008242699,0.00006981803,0.8376032,0.0004477722,0.15648559,0.0026813105,0.00017763831],"about_ca_topic_score_codex":0.00008837949,"about_ca_topic_score_gemma":0.000038565446,"teacher_disagreement_score":0.83064723,"about_ca_system_score_codex":0.000026855976,"about_ca_system_score_gemma":0.00008892934,"threshold_uncertainty_score":0.43048263},"labels":[],"label_agreement":null},{"id":"W7117150085","doi":"10.1103/zq4l-vwbz","title":"Sub-Riemannian geometry of measurement-based quantum computation","year":2025,"lang":"en","type":"article","venue":"Physical review. A/Physical review, A","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Alexander von Humboldt-Stiftung","keywords":"Quantum computer; Computation; Quantum; Quantum algorithm; Quantum operation; Geodesic; Work (physics); Computational resource; Quantum network","score_opus":0.017752703740225927,"score_gpt":0.3381648120658774,"score_spread":0.3204121083256515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117150085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11363461,0.113271095,0.76123047,0.008454799,0.000448737,0.0018092011,0.000015267402,0.00035790313,0.0007778946],"genre_scores_gemma":[0.9822278,0.008694092,0.0035877717,0.005127987,0.00021347885,0.00009545011,0.00001595857,0.00003009615,0.0000073361684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566793,0.00054440676,0.0009108032,0.00093537976,0.0013595894,0.0005818764],"domain_scores_gemma":[0.99688315,0.0005923402,0.0005368877,0.0011514301,0.0006054095,0.00023076136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011097932,0.0005184766,0.0016943378,0.00016184051,0.00016543188,0.00006755623,0.0013904882,0.000042250056,0.0000032813025],"category_scores_gemma":[0.0009688706,0.00040832354,0.00093637867,0.0028064223,0.00016571183,0.00020778071,0.00038770566,0.00054238504,0.00009477483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023193199,0.003440764,0.00019521275,0.050404813,0.00029049398,0.000024671428,0.00012479731,0.0016712954,0.033087928,0.14585334,0.012841784,0.7520417],"study_design_scores_gemma":[0.0006621443,0.0004252322,0.0017558656,0.04827344,0.0004071634,0.0000039936563,0.0000020130433,0.8484669,0.021074202,0.065724365,0.01238584,0.000818864],"about_ca_topic_score_codex":0.000015903837,"about_ca_topic_score_gemma":0.0000011831353,"teacher_disagreement_score":0.8685932,"about_ca_system_score_codex":0.000097600285,"about_ca_system_score_gemma":0.00031333143,"threshold_uncertainty_score":0.99983686},"labels":[],"label_agreement":null},{"id":"W7117174147","doi":"","title":"El Agente Cuantico: Automating quantum simulations","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Resources Canada; Natural Sciences and Engineering Research Council of Canada; Advanced Research Projects Agency; Defense Advanced Research Projects Agency; Alliance de recherche numérique du Canada; Novo Nordisk; Novo Nordisk Fonden; University of Toronto; Moderna; Canada First Research Excellence Fund; Government of Ontario","keywords":"Quantum computer; Quantum; Workflow; Software; Quantum system; Quantum algorithm; State space; Quantum state; Computational complexity theory","score_opus":0.02622323602528992,"score_gpt":0.2960281092797933,"score_spread":0.26980487325450336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117174147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70390105,0.00091473886,0.28573182,0.0039185295,0.0038407694,0.00034981623,0.000014263278,0.00052966917,0.00079934753],"genre_scores_gemma":[0.9877185,0.00003569358,0.008809163,0.0015413788,0.00048264657,0.0000077372515,0.000009253214,0.00004124537,0.0013543622],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529284,0.00035003017,0.0011526478,0.0014186578,0.0005494355,0.0012363659],"domain_scores_gemma":[0.99657315,0.0007675476,0.00043101932,0.0016710149,0.00028743348,0.00026984818],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00060754054,0.00065268157,0.0006593305,0.00050733425,0.0016522089,0.0006320205,0.0019098031,0.00026992214,0.00008437315],"category_scores_gemma":[0.000492908,0.0006553383,0.00039475283,0.0024578974,0.00024185517,0.00046386456,0.0015604063,0.0010230703,0.0003804795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003204219,0.0011494295,0.39753392,0.00065771816,0.00068840344,0.00026348562,0.00680722,0.3026685,0.00676965,0.07129268,0.0028199416,0.20931698],"study_design_scores_gemma":[0.0005705381,0.000102818114,0.16286421,0.0006615492,0.00007064119,0.0000141029295,0.00004825882,0.8280421,0.00065520074,0.0030680476,0.003381156,0.0005214082],"about_ca_topic_score_codex":0.00013205495,"about_ca_topic_score_gemma":0.000014363796,"teacher_disagreement_score":0.5253736,"about_ca_system_score_codex":0.00010757315,"about_ca_system_score_gemma":0.00051029224,"threshold_uncertainty_score":0.9996475},"labels":[],"label_agreement":null},{"id":"W7117174362","doi":"","title":"Detecting Flakiness in Quantum Software: A Dynamic Testing Approach","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; University of Maryland, Baltimore County","keywords":"Test suite; Software; Code (set theory); Suite; Quantum; Set (abstract data type); Work (physics); Characterization (materials science)","score_opus":0.025762020434306594,"score_gpt":0.2606151958650514,"score_spread":0.2348531754307448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117174362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.592671,0.00097197015,0.40324578,0.0004374285,0.0016227899,0.00036282642,0.0000024312615,0.00037186177,0.00031392951],"genre_scores_gemma":[0.923964,0.000014459256,0.07503665,0.00044215037,0.00021164503,0.000039480856,0.0000033355948,0.0000553107,0.00023291823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99392384,0.00046162982,0.001308972,0.0021149388,0.0005172623,0.0016733583],"domain_scores_gemma":[0.9962251,0.0013055927,0.00047152655,0.0015203869,0.0002670645,0.00021029012],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015815694,0.0008131801,0.0008935351,0.00089745864,0.00094501453,0.00050698564,0.0024289642,0.0003689469,0.000005479379],"category_scores_gemma":[0.0021737148,0.0008330154,0.00025173926,0.0063379384,0.00025191333,0.00043011436,0.0020409937,0.001920982,0.00005422833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026780424,0.00048292303,0.4219428,0.0006485045,0.00008161396,0.00020667157,0.00217142,0.08888699,0.0012924373,0.0005399048,0.000021099384,0.48369884],"study_design_scores_gemma":[0.00075188646,0.00010993828,0.23588835,0.0010097311,0.000026483915,0.00006986584,0.00010712194,0.759991,0.00016235825,0.0011568913,0.00010052457,0.00062588474],"about_ca_topic_score_codex":0.00043436512,"about_ca_topic_score_gemma":0.000063361775,"teacher_disagreement_score":0.67110395,"about_ca_system_score_codex":0.0002780797,"about_ca_system_score_gemma":0.0006741661,"threshold_uncertainty_score":0.99941206},"labels":[],"label_agreement":null},{"id":"W7117248682","doi":"10.62051/9qtkpq54","title":"Preface: 4th International Conference on Theoretical Physics, Computers and Electronic Engineering (TPCEE 2025)","year":2025,"lang":"","type":"article","venue":"Transactions on Computer Science and Intelligent Systems Research","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Information exchange; Information technology; Editorial board; Information system","score_opus":0.03629390391789203,"score_gpt":0.32839025709054054,"score_spread":0.2920963531726485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117248682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009815411,0.0005379659,0.97876513,0.0040716133,0.0048074196,0.00094357325,0.0000128619085,0.00013796677,0.0009080609],"genre_scores_gemma":[0.99346924,0.0014445059,0.0039571812,0.00025476885,0.0003606121,0.000045013676,0.000001474234,0.000022377268,0.00044480432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99281013,0.00043477028,0.00071602844,0.0020470633,0.0023572794,0.0016347327],"domain_scores_gemma":[0.9963278,0.0008418694,0.000104818806,0.0009939993,0.001241499,0.0004900161],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0041611744,0.0005594658,0.00055051903,0.0015951997,0.0016804751,0.0034678632,0.0025421071,0.00019380703,0.00002930736],"category_scores_gemma":[0.00005487015,0.0005043048,0.00012198868,0.0027656697,0.0024096037,0.0005599465,0.0004068768,0.0022053588,0.000053449654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004922774,0.00030069126,0.0000074233367,0.00014552737,0.000109027846,0.000011193838,0.0011787508,0.10624284,0.00024113737,0.4976521,0.0002147174,0.39384735],"study_design_scores_gemma":[0.00039971835,0.0012129552,0.00007986552,0.0014937208,0.000012948061,0.00004398474,0.00012243642,0.98911756,0.0018985822,0.0028614756,0.0023356348,0.00042112326],"about_ca_topic_score_codex":0.0000926678,"about_ca_topic_score_gemma":0.0000024143085,"teacher_disagreement_score":0.98365384,"about_ca_system_score_codex":0.00055063,"about_ca_system_score_gemma":0.00115734,"threshold_uncertainty_score":0.99974084},"labels":[],"label_agreement":null},{"id":"W7117339809","doi":"","title":"Quantum Homotopy Algorithm for Solving Nonlinear PDEs and Flow Problems","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Nonlinear system; Quantum algorithm; Flow (mathematics); Measure (data warehouse); Quantum; Discretization; Quantum phase estimation algorithm; Homotopy; Embedding","score_opus":0.018825745956192536,"score_gpt":0.2562562490038516,"score_spread":0.23743050304765903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117339809","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27236292,0.0042198435,0.71602184,0.0032010335,0.0027798552,0.0010239339,0.000052566487,0.00025644162,0.00008156587],"genre_scores_gemma":[0.3523762,0.0006793505,0.64127463,0.0016658668,0.0017072251,0.00014022508,0.000026794032,0.00010650495,0.0020232054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548936,0.00012613286,0.0009253664,0.0017447775,0.00037602786,0.0013383108],"domain_scores_gemma":[0.9972863,0.0006474554,0.00030513457,0.0011025763,0.00035131123,0.0003072046],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009765857,0.00073334697,0.00081209635,0.00038456992,0.0013951769,0.00073971297,0.0013682768,0.00032623787,0.000012752186],"category_scores_gemma":[0.00020463558,0.000698031,0.00033589892,0.0010859438,0.00036629266,0.0004241306,0.0012820865,0.00076827366,0.00003097496],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016307486,0.00033850156,0.009263308,0.00057378516,0.00022207557,0.000033094428,0.0022204937,0.0030290445,0.00081418105,0.0013027521,0.0006899039,0.9814966],"study_design_scores_gemma":[0.001356057,0.00050637434,0.008016599,0.00091765187,0.00008412769,0.000038073656,0.00007259879,0.97003967,0.0012498049,0.0036690868,0.013324554,0.00072540675],"about_ca_topic_score_codex":0.00008467515,"about_ca_topic_score_gemma":0.0000152228995,"teacher_disagreement_score":0.9807711,"about_ca_system_score_codex":0.00006893902,"about_ca_system_score_gemma":0.0004172228,"threshold_uncertainty_score":0.9999049},"labels":[],"label_agreement":null},{"id":"W7117584588","doi":"10.1109/iccd65941.2025.00054","title":"Forensics of Error Rates of Quantum Hardware","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Science Foundation","keywords":"Exploit; Qubit; Leverage (statistics); Cloud computing; Hash function; Word error rate; Error detection and correction; Quantum computer","score_opus":0.024259186557233588,"score_gpt":0.29477004107692545,"score_spread":0.27051085451969187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117584588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10283853,0.0014927909,0.88765687,0.0022961316,0.002177308,0.00027555902,0.000024392557,0.0000681177,0.0031702977],"genre_scores_gemma":[0.93150055,0.000042926724,0.066671506,0.00024051551,0.00006173242,0.0000019713664,0.0000021372307,0.0000121013545,0.0014665731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972969,0.00014207565,0.0010257168,0.00062864105,0.00042095128,0.0004857034],"domain_scores_gemma":[0.99743664,0.00039995654,0.0004451305,0.0010798511,0.0005414782,0.00009694394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004860754,0.0003404643,0.0007602855,0.00034088947,0.00014890452,0.000073744995,0.0014354147,0.0001638688,0.0000542107],"category_scores_gemma":[0.00015568775,0.00028818642,0.00034802355,0.0015434392,0.00040589945,0.00013287166,0.0010223022,0.00032259457,0.0000067569918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051464336,0.00034674702,0.0020320562,0.0011711343,0.00028130985,0.00001412884,0.0023363053,0.020366421,0.0013877526,0.5770514,0.0050175344,0.38994378],"study_design_scores_gemma":[0.0004862816,0.00032522835,0.0033138255,0.00072508305,0.000040033956,0.0000052706155,0.00013821266,0.928739,0.0359843,0.028791232,0.0012104728,0.00024107203],"about_ca_topic_score_codex":0.00018732743,"about_ca_topic_score_gemma":0.000012487821,"teacher_disagreement_score":0.9083726,"about_ca_system_score_codex":0.00001928877,"about_ca_system_score_gemma":0.00050918764,"threshold_uncertainty_score":0.999957},"labels":[],"label_agreement":null},{"id":"W7117658420","doi":"10.3390/bdcc10010012","title":"QU-Net: Quantum-Enhanced U-Net for Self Supervised Embedding and Classification of Skin Cancer Images","year":2025,"lang":"en","type":"article","venue":"Big Data and Cognitive Computing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encoding (memory); Quantum entanglement; Embedding; Skin cancer; Quantum computer; Binary number; Parameterized complexity; Quantum; Pattern recognition (psychology); Deep learning","score_opus":0.04254829330032315,"score_gpt":0.3225838087791972,"score_spread":0.280035515478874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117658420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29387614,0.00118818,0.7038856,0.00025109245,0.00026239234,0.00024906773,0.00014467942,0.00007540125,0.000067418616],"genre_scores_gemma":[0.96865195,0.00012660559,0.030771188,0.00018343792,0.00016029649,0.000009942373,0.000074977754,0.0000101121395,0.000011492313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839544,0.00009455812,0.0003303055,0.0007516511,0.00013759492,0.00029044904],"domain_scores_gemma":[0.99832195,0.0008267171,0.00017701145,0.00038143623,0.00023065109,0.00006222121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046248143,0.00019683139,0.0002934895,0.00015722949,0.0003215416,0.00018961783,0.0005797341,0.00006324368,5.8419846e-7],"category_scores_gemma":[0.00016589552,0.00018350541,0.00003464621,0.0003610249,0.00009756554,0.0001962674,0.00097401685,0.00013953881,3.6627594e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016773529,0.000045109235,0.00065251946,0.00019518628,0.00006851947,9.852188e-7,0.0010923778,0.00006425844,0.0032366945,0.0013157915,0.00020038495,0.9931114],"study_design_scores_gemma":[0.0008382672,0.00006953054,0.016959328,0.000585253,0.000052028376,0.0000040251402,0.0002559651,0.97651905,0.0033042189,0.0009129753,0.00029293267,0.00020643041],"about_ca_topic_score_codex":0.000044373246,"about_ca_topic_score_gemma":0.0000097608045,"teacher_disagreement_score":0.99290496,"about_ca_system_score_codex":0.000010665223,"about_ca_system_score_gemma":0.000107890286,"threshold_uncertainty_score":0.74831337},"labels":[],"label_agreement":null},{"id":"W7117962939","doi":"10.1145/3712285.3787188","title":"10.1145/3712285.3787188","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Quantum computer; Key (lock); Field (mathematics); Scheme (mathematics)","score_opus":0.0039641822586172284,"score_gpt":0.17221618473964148,"score_spread":0.16825200248102426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117962939","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025101742,0.000063469044,0.0018560534,0.0017098107,0.000014073238,0.000147006,0.000003425018,0.0006179037,0.9930781],"genre_scores_gemma":[0.0005441595,1.379187e-7,0.01460038,0.00025308496,0.00017363414,0.0000050672984,0.0000018032813,0.0000130642375,0.9844087],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884,0.00004387977,0.00015559002,0.00038001416,0.00022505948,0.00035549153],"domain_scores_gemma":[0.9991457,0.00005674447,0.000024508034,0.00056705176,0.000030769188,0.00017521466],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015481352,0.00015029311,0.00014893182,0.00008109011,0.00013822563,0.00014714002,0.0009130465,0.000043849337,0.8265728],"category_scores_gemma":[0.000014173553,0.00013447783,0.00006585659,0.0004102036,0.00002160166,0.00010704817,0.00017524681,0.00013122954,0.93398225],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000456652,0.00002730619,5.9748814e-8,0.0000019026461,0.0000056027898,0.000012541397,0.000045820994,0.0029315036,0.000022394752,0.00002357281,0.039692786,0.95723194],"study_design_scores_gemma":[0.00010715309,0.00011603164,0.00004064442,0.000012180542,0.0000019777801,0.000024374034,9.9905876e-8,0.16818543,0.00005289439,0.00008935306,0.8312043,0.00016553643],"about_ca_topic_score_codex":0.000012747673,"about_ca_topic_score_gemma":4.081602e-8,"teacher_disagreement_score":0.9570664,"about_ca_system_score_codex":0.000015679569,"about_ca_system_score_gemma":0.00003154751,"threshold_uncertainty_score":0.54838467},"labels":[],"label_agreement":null},{"id":"W7118015008","doi":"10.1109/isgtmiddleeast65737.2025.11314205","title":"Potential of Quantum Computing Applications for Smart Grid Digital Twins and Future Directions","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Essays on Canadian Writing; University of Toronto; Université du Québec à Trois-Rivières","funders":"","keywords":"Interoperability; Smart grid; Key (lock); Intersection (aeronautics); Quantum computer; Quantum; Focus (optics)","score_opus":0.00588569098667393,"score_gpt":0.2388847912581123,"score_spread":0.23299910027143836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118015008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011839524,0.0019179704,0.9752795,0.005164241,0.0031831774,0.0010544942,0.00015289903,0.00019867487,0.0012095232],"genre_scores_gemma":[0.92383695,0.00024495609,0.07219452,0.0003339984,0.0024852778,0.000048552887,0.000033845616,0.000030291747,0.0007916268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975023,0.00005256092,0.00074582396,0.0009166114,0.00024220877,0.00054048776],"domain_scores_gemma":[0.9982224,0.00036186518,0.00026682293,0.0006541486,0.00033468753,0.00016009354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028432117,0.0003663903,0.00049943244,0.00035278418,0.001016382,0.0006171817,0.00072140543,0.00017689569,0.000006535974],"category_scores_gemma":[0.00003058551,0.0003464072,0.000298857,0.0011766362,0.0002662059,0.0002587862,0.00075616635,0.00032975574,0.0000029672012],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017240334,0.00032532087,0.00029406315,0.0003033341,0.00015722762,0.000001351751,0.0005673329,0.0019910326,0.00011691957,0.1375255,0.0008962412,0.8578044],"study_design_scores_gemma":[0.00057382486,0.00016444866,0.0031513502,0.00009808043,0.00006605389,0.000030077428,0.00019331623,0.85261077,0.00012490421,0.0070171654,0.1356737,0.00029628686],"about_ca_topic_score_codex":0.000041059717,"about_ca_topic_score_gemma":0.0000051571,"teacher_disagreement_score":0.91199744,"about_ca_system_score_codex":0.000029461411,"about_ca_system_score_gemma":0.00024735508,"threshold_uncertainty_score":0.9998988},"labels":[],"label_agreement":null},{"id":"W7118171537","doi":"10.1109/aiccsa66935.2025.11315392","title":"Quantum Long Short-Term Memory for Sequence Prediction","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute; Université TÉLUQ","funders":"","keywords":"Sequence (biology); Quantum; Parameterized complexity; Exploit; Quantum entanglement; Quantum computer; Quantum algorithm; Reservoir computing; Sequence learning","score_opus":0.02386083213272478,"score_gpt":0.2849569260012422,"score_spread":0.2610960938685174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118171537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07522563,0.0008847608,0.9102123,0.002808851,0.0072193085,0.0010508883,0.00004749304,0.00050554017,0.0020452673],"genre_scores_gemma":[0.9586183,0.00008423041,0.034125317,0.00092301867,0.0007184445,0.00007123992,0.000018474928,0.000029653333,0.0054113385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960824,0.00014316734,0.00085672055,0.0014807279,0.00044842524,0.000988512],"domain_scores_gemma":[0.9976617,0.00042641402,0.00013706088,0.0012303588,0.00032159974,0.00022286548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008742236,0.0005218469,0.00050819706,0.0003817355,0.0009065638,0.0007067845,0.0016840025,0.00027875742,0.00003550487],"category_scores_gemma":[0.00010840692,0.00048518964,0.00037510102,0.0010515355,0.00023428413,0.0004443505,0.0007749132,0.0005222207,0.000020369904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049893053,0.00026337948,0.0017848775,0.00055039086,0.0001792956,0.000043664375,0.0009821119,0.014969386,0.0020339896,0.050439127,0.0042131823,0.9244907],"study_design_scores_gemma":[0.00053012796,0.0003707255,0.005943707,0.00053970225,0.000066301596,0.000046933932,0.000037921007,0.9806264,0.0031296636,0.007199494,0.0010718609,0.0004371765],"about_ca_topic_score_codex":0.00004224555,"about_ca_topic_score_gemma":0.00001832985,"teacher_disagreement_score":0.965657,"about_ca_system_score_codex":0.00014220066,"about_ca_system_score_gemma":0.0005869879,"threshold_uncertainty_score":0.99976},"labels":[],"label_agreement":null},{"id":"W7118257769","doi":"10.2478/qic-2025-0026","title":"New Approaches to Complexity via Quantum Graphs","year":2025,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum; Quantum algorithm; Generalization; Probabilistic logic; Quantum complexity theory; Operator (biology); Quantization (signal processing); Quantum computer; Quantum state","score_opus":0.04265908074349494,"score_gpt":0.25436117213635967,"score_spread":0.21170209139286472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118257769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03400207,0.00005843429,0.95721775,0.0064914636,0.0005355175,0.00029622845,0.0000023145858,0.0003462691,0.0010499469],"genre_scores_gemma":[0.86351347,0.0000046226205,0.13440149,0.0019674927,0.000032680535,0.000009830263,0.00003151013,0.0000046930595,0.00003422993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869835,0.00006350065,0.00045953962,0.0002585147,0.00025654212,0.00026355666],"domain_scores_gemma":[0.99928653,0.00008466135,0.00014101686,0.00025303746,0.00006548049,0.0001692997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002898096,0.00019644089,0.0002033721,0.0004954751,0.0003304843,0.0004843429,0.00039369948,0.00006995181,0.0000033122885],"category_scores_gemma":[0.000024604922,0.00018445776,0.000059947157,0.0009747206,0.000038072365,0.0009215163,0.00024966436,0.00016555528,0.0000585061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000806118,0.0000129319915,0.000050697487,0.000030200725,0.000010413323,3.272296e-7,0.0012139339,0.011462068,0.000005840485,0.61627924,0.0013883018,0.36953798],"study_design_scores_gemma":[0.00030987337,0.000074893986,0.005706057,0.000030566724,0.000004055909,0.000009979074,0.00005596619,0.75732183,0.000044709042,0.23268658,0.0035941273,0.00016138486],"about_ca_topic_score_codex":0.00011498549,"about_ca_topic_score_gemma":0.000006049219,"teacher_disagreement_score":0.8295114,"about_ca_system_score_codex":0.000030029822,"about_ca_system_score_gemma":0.00010773108,"threshold_uncertainty_score":0.75219697},"labels":[],"label_agreement":null},{"id":"W7124136062","doi":"10.1109/icacrs67045.2025.11324438","title":"Quantum Teleportation-based Control for Mobile Robots","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Robustness (evolution); Quantum computer; Control theory (sociology); Mobile robot; Robotics; Particle swarm optimization; Robot; Position (finance); Teleportation","score_opus":0.007842421954559661,"score_gpt":0.26227730116097947,"score_spread":0.25443487920641983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124136062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081798965,0.0008760409,0.9797799,0.0045008585,0.0035003521,0.0018992213,0.000032601434,0.00032872465,0.00090238306],"genre_scores_gemma":[0.91970485,0.0000053793306,0.073819056,0.0038887137,0.0002392363,0.00027621505,0.000010872277,0.000023710592,0.0020319421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965724,0.0001387474,0.00091496174,0.0011417168,0.00037273765,0.00085948035],"domain_scores_gemma":[0.9964969,0.0015191335,0.00031061762,0.0009852325,0.0004975201,0.00019057097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075030996,0.00047106715,0.00060664274,0.00036857935,0.000717115,0.00058914954,0.0011880985,0.00020956752,0.00006051985],"category_scores_gemma":[0.00019294934,0.00042492224,0.00045070614,0.0010247498,0.0001385794,0.00015627344,0.00008634988,0.0003207941,0.000028179176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005317942,0.00030606656,0.0002622767,0.00019264674,0.000110937595,0.000011411876,0.00018171048,0.6951221,0.00021828213,0.0656722,0.0038636057,0.23400556],"study_design_scores_gemma":[0.0027639996,0.00056136725,0.00075401046,0.00019206734,0.00006862826,0.0000031341335,0.00003118435,0.97467047,0.0011757312,0.009801384,0.009522925,0.000455093],"about_ca_topic_score_codex":0.000087291366,"about_ca_topic_score_gemma":0.00001849913,"teacher_disagreement_score":0.91152495,"about_ca_system_score_codex":0.00006528348,"about_ca_system_score_gemma":0.0011445754,"threshold_uncertainty_score":0.99982023},"labels":[],"label_agreement":null},{"id":"W7125580689","doi":"10.1109/qai63978.2025.00062","title":"Optimization of Approximate Quantum Random Access Memory for NISQ Devices","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Quantum computer; Quantum gate; Quantum circuit; Robustness (evolution); Quantum; Leverage (statistics); Quantum algorithm; Quantum phase estimation algorithm; Quantum error correction","score_opus":0.01648116979005485,"score_gpt":0.28699070412187966,"score_spread":0.2705095343318248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125580689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045258673,0.001283921,0.9855711,0.0024691275,0.0023041572,0.0013072136,0.00001860041,0.00017149535,0.0023485029],"genre_scores_gemma":[0.5625817,0.00012755593,0.434582,0.0009953465,0.000226417,0.00007190907,0.000016913526,0.0000336475,0.0013645227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688977,0.00018766728,0.0010247348,0.0009325852,0.00035934948,0.0006058763],"domain_scores_gemma":[0.9970683,0.0009451635,0.00052097125,0.00085678074,0.0004974801,0.000111290225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010344476,0.00041524152,0.0007666706,0.0004457801,0.00046407798,0.00068467786,0.0023339824,0.00018866398,0.000049808925],"category_scores_gemma":[0.00019509846,0.0003547351,0.00034485612,0.0013598945,0.00017849397,0.0005701322,0.0010716628,0.00021907514,0.0000018167606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016652525,0.00020436166,0.000061054234,0.0009947409,0.0001367665,0.0000015636207,0.0004510396,0.8554246,0.000053261767,0.026988225,0.0007173928,0.114800476],"study_design_scores_gemma":[0.003289019,0.00016445847,0.00010229541,0.00046175165,0.000086178305,0.0000038601406,0.000059848968,0.9847061,0.0037225033,0.0066388324,0.00041028886,0.00035488556],"about_ca_topic_score_codex":0.00008804183,"about_ca_topic_score_gemma":0.000010016299,"teacher_disagreement_score":0.5580558,"about_ca_system_score_codex":0.000030881958,"about_ca_system_score_gemma":0.0004156457,"threshold_uncertainty_score":0.99989045},"labels":[],"label_agreement":null},{"id":"W7125654408","doi":"10.1109/qai63978.2025.00069","title":"Quantum-Efficient Reinforcement Learning Solutions for Last-Mile On-Demand Delivery","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Reinforcement learning; Quantum; Encoding (memory); Computation; Quantum computer; Scale (ratio); Transformation (genetics); Q-learning","score_opus":0.016725490880962302,"score_gpt":0.2525882687449607,"score_spread":0.2358627778639984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125654408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022145662,0.00085735245,0.96354187,0.0033316049,0.0030928538,0.0010462234,0.0000069298408,0.00033602287,0.0056414586],"genre_scores_gemma":[0.9771175,0.00008962988,0.012103627,0.0015413443,0.00030247474,0.000076557844,0.000011251872,0.000027001632,0.008730617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553746,0.00020065934,0.00087386934,0.0012586219,0.00055946276,0.001569949],"domain_scores_gemma":[0.9972567,0.0010108128,0.00025641941,0.00088554266,0.00034946814,0.0002410451],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013389572,0.00055404875,0.0005260185,0.00054264005,0.0028877743,0.000594527,0.0011738822,0.00019938353,0.00007167957],"category_scores_gemma":[0.00023398711,0.0005043716,0.0004662916,0.0010879346,0.00017897652,0.00011121052,0.0013454224,0.00072823756,0.00011484055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003819993,0.00020464614,0.000010775154,0.000088515364,0.00008865092,0.000004524555,0.00063425157,0.7578623,0.00009173738,0.18041615,0.0045293756,0.056030817],"study_design_scores_gemma":[0.001234886,0.0010750563,0.00015393738,0.00053709815,0.00005495723,0.0000062618506,0.00016023114,0.96326554,0.00042052096,0.0018115724,0.0307587,0.0005212416],"about_ca_topic_score_codex":0.000055953784,"about_ca_topic_score_gemma":0.000009256713,"teacher_disagreement_score":0.95497185,"about_ca_system_score_codex":0.00018800152,"about_ca_system_score_gemma":0.00056237594,"threshold_uncertainty_score":0.9997408},"labels":[],"label_agreement":null},{"id":"W7125929953","doi":"10.1109/smc58881.2025.11342766","title":"SQFE: A Scalable Quantum Feature Extraction Model for Deep Neural Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convolutional neural network; Feature extraction; Scalability; Quantum; Deep learning; Backpropagation; Artificial neural network; Feature (linguistics)","score_opus":0.012357458584832006,"score_gpt":0.2674404063700953,"score_spread":0.2550829477852633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125929953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028517302,0.0029448716,0.9748852,0.011592661,0.005475613,0.00099795,0.0000085928,0.00043075767,0.0008125969],"genre_scores_gemma":[0.80128604,0.00007088653,0.1805661,0.0029417719,0.0007606827,0.00006748897,0.000013916227,0.000046240493,0.014246855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584144,0.00014382586,0.00066078635,0.0015512902,0.00039853435,0.0014041313],"domain_scores_gemma":[0.99744296,0.0004946448,0.00026900676,0.0011532058,0.0003660577,0.00027409574],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006784156,0.00067282375,0.00063418085,0.00033460744,0.0012717869,0.0011681548,0.0015024088,0.00055526407,0.000019145169],"category_scores_gemma":[0.00009415056,0.0006068027,0.00051758223,0.00145729,0.00013398362,0.00057541503,0.0006837625,0.0011899183,0.000007654978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006211635,0.00013533466,0.000019982246,0.00008314852,0.000052169824,0.00000573545,0.00022326793,0.6920942,0.000043475928,0.026183933,0.007919933,0.27317667],"study_design_scores_gemma":[0.0010243739,0.00020810246,0.00014405017,0.00014487746,0.00008022653,0.000040223953,0.000030941046,0.9816517,0.00006334728,0.01402321,0.0019689847,0.00061993144],"about_ca_topic_score_codex":0.000046309055,"about_ca_topic_score_gemma":0.000051344177,"teacher_disagreement_score":0.7984343,"about_ca_system_score_codex":0.00011565885,"about_ca_system_score_gemma":0.0002514411,"threshold_uncertainty_score":0.99986875},"labels":[],"label_agreement":null},{"id":"W7125953463","doi":"10.1109/acp66871.2025.11350411","title":"General-Purpose Programmable Photonic Circuit as an Ising Hamiltonian Computing Engine","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"European Research Council","keywords":"Photonics; Scalability; Solver; Ising model; Signal processing; Embedding; Scheduling (production processes); Chip; Matrix multiplication","score_opus":0.012048464694659936,"score_gpt":0.2639453887467762,"score_spread":0.2518969240521163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125953463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3841899,0.0016758295,0.59740746,0.0013773601,0.0032211193,0.0010145954,0.0000042861784,0.0011095081,0.009999947],"genre_scores_gemma":[0.8092958,0.000058435035,0.1796536,0.0027544242,0.0007102507,0.000012961479,0.000014332218,0.00007413558,0.0074261036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99233097,0.0004900089,0.0013460652,0.0026004934,0.00084994413,0.002382527],"domain_scores_gemma":[0.99589276,0.00024584023,0.00038017242,0.0024014886,0.00039790187,0.0006818096],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015944954,0.0010702808,0.001035681,0.00079275604,0.001902944,0.0031813902,0.003149957,0.00041214493,0.00014421594],"category_scores_gemma":[0.00009969455,0.0010635196,0.00044919294,0.0033383248,0.00030287865,0.00071216485,0.0018612447,0.0014054523,0.00015383739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014746307,0.00056385645,0.00023226225,0.00018632879,0.00015816235,0.00017209574,0.0023228433,0.04449613,0.0015581019,0.04415008,0.00023597847,0.9059094],"study_design_scores_gemma":[0.0011830402,0.00073038414,0.0007442393,0.0006757924,0.000071003466,0.00020100469,0.0000840751,0.958996,0.005504366,0.010346083,0.020341393,0.001122638],"about_ca_topic_score_codex":0.00089810026,"about_ca_topic_score_gemma":0.000058593527,"teacher_disagreement_score":0.9144999,"about_ca_system_score_codex":0.0002657101,"about_ca_system_score_gemma":0.0012804151,"threshold_uncertainty_score":0.99939644},"labels":[],"label_agreement":null},{"id":"W7127144617","doi":"10.1109/icaaid68975.2025.11358227","title":"A Brief Review on Quantum-Based Control Strategies for Robotic Systems","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Quantum; Robot; Automation; Realization (probability); Convergence (economics); Implementation; Robotics; Principal (computer security); Quantum computer","score_opus":0.016543240664589228,"score_gpt":0.2752413972364849,"score_spread":0.25869815657189565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127144617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009218362,0.05276358,0.9211782,0.016309643,0.003967163,0.003094699,0.000017320333,0.0003261684,0.0022510076],"genre_scores_gemma":[0.9643454,0.0007699857,0.0075073205,0.025052994,0.00038973254,0.00027976418,0.000008275092,0.000042870946,0.0016036743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954323,0.0004887893,0.0011710203,0.0013628856,0.00053532864,0.0010096806],"domain_scores_gemma":[0.99574786,0.0017250669,0.00038957517,0.0014867189,0.000438683,0.00021209834],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013737433,0.00069020106,0.0013337771,0.0003041945,0.0006064705,0.0014066865,0.0016656977,0.00019339513,0.000019883948],"category_scores_gemma":[0.00022645589,0.00055137987,0.0005742981,0.0011274433,0.00015338039,0.00019869751,0.00010843683,0.00048675243,0.000036693084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004348092,0.00021174022,0.000003596127,0.00779618,0.00011733247,0.000013719401,0.00003880802,0.4831624,0.000016755517,0.46680465,0.010803912,0.030987414],"study_design_scores_gemma":[0.002167635,0.0010371213,0.000040804895,0.021775292,0.00017911215,0.0000097970915,0.000032584376,0.95596474,0.000020825564,0.0043547284,0.013867217,0.00055015116],"about_ca_topic_score_codex":0.00015050698,"about_ca_topic_score_gemma":0.000007587847,"teacher_disagreement_score":0.9642532,"about_ca_system_score_codex":0.00009798025,"about_ca_system_score_gemma":0.0017012203,"threshold_uncertainty_score":0.99969375},"labels":[],"label_agreement":null},{"id":"W7127287360","doi":"10.1109/ccece64018.2025.11364503","title":"Quantum K-means for Optimal Allocation of Network Infrastructure Based on Unsatisfied User Locations","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cluster analysis; Computational complexity theory; Quantum; Optimal allocation; Resource allocation; Quantum network","score_opus":0.007924398297871968,"score_gpt":0.2481196060184718,"score_spread":0.24019520772059982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127287360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063941684,0.00014292967,0.9820806,0.0068965424,0.0022841967,0.0011076608,0.00003447766,0.00014689172,0.00091254164],"genre_scores_gemma":[0.6655401,0.000007692825,0.33183545,0.0016694535,0.00027822048,0.000040741248,0.000030638046,0.000022793107,0.0005749365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966871,0.00020252523,0.0009525899,0.000976406,0.00044999758,0.00073136424],"domain_scores_gemma":[0.996513,0.0010796002,0.00040407712,0.0013111541,0.00054732314,0.00014486435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067010225,0.0004893958,0.00056452974,0.00039100906,0.0006095154,0.00024103792,0.0013022011,0.00029835282,0.00005972576],"category_scores_gemma":[0.00017839686,0.00044939952,0.00031396,0.0017720325,0.00020385423,0.000159031,0.0002482437,0.00044255424,0.00000603724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006264411,0.00012590931,0.00020989928,0.0001372348,0.000060715072,5.3917955e-7,0.00020418993,0.7197842,0.00004845532,0.21667448,0.007970672,0.05472106],"study_design_scores_gemma":[0.0011809103,0.0006139006,0.005784248,0.00056451384,0.00007320953,0.0000014357561,0.000040149655,0.9754643,0.00072316424,0.009429174,0.005735305,0.0003897297],"about_ca_topic_score_codex":0.000058932885,"about_ca_topic_score_gemma":0.00002440782,"teacher_disagreement_score":0.6591459,"about_ca_system_score_codex":0.00008513683,"about_ca_system_score_gemma":0.0010464779,"threshold_uncertainty_score":0.9997958},"labels":[],"label_agreement":null},{"id":"W7127290857","doi":"10.1109/icfpt67023.2025.00031","title":"Conflict-Free Block Pipelining for FPGA-Accelerated Stochastic Simulated Bifurcation on Dense Ising Models","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Field-programmable gate array; Block (permutation group theory); Bifurcation; Ising model; Matrix (chemical analysis); Block size","score_opus":0.04445742011708895,"score_gpt":0.2978210893526515,"score_spread":0.2533636692355625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127290857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09150838,0.0004435439,0.8995474,0.0033769447,0.00216197,0.0013745517,0.00002586968,0.0005759019,0.0009854373],"genre_scores_gemma":[0.9621175,0.000011235927,0.032792863,0.0025092517,0.00030154802,0.000019570802,0.000017982937,0.0000564067,0.0021736322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99507165,0.00021787015,0.0012528369,0.0017231443,0.00057036657,0.0011641084],"domain_scores_gemma":[0.99483305,0.0016585153,0.00042085157,0.0018928172,0.00093016477,0.00026461558],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008769338,0.0007717971,0.0007700622,0.00078197586,0.001259614,0.0011037335,0.0020326693,0.0003897035,0.000019354013],"category_scores_gemma":[0.00061349914,0.0007446643,0.00031921946,0.0019734185,0.00013846644,0.00037031504,0.0008800145,0.00071830524,0.000025528047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015684891,0.00020291479,0.0000012495635,0.000079414356,0.0001261156,0.0000065618333,0.0016013159,0.9021267,0.00055140036,0.012827561,0.0008390126,0.08148089],"study_design_scores_gemma":[0.0030901274,0.00057379476,0.000028053582,0.0009356575,0.00010289133,0.0000128433485,0.00006749211,0.97316474,0.0022901027,0.018597566,0.0003950804,0.00074163836],"about_ca_topic_score_codex":0.00010646847,"about_ca_topic_score_gemma":0.000009377861,"teacher_disagreement_score":0.8706091,"about_ca_system_score_codex":0.00015964513,"about_ca_system_score_gemma":0.00061439385,"threshold_uncertainty_score":0.99993324},"labels":[],"label_agreement":null},{"id":"W7127359208","doi":"10.1109/sta66620.2025.11364711","title":"Hybrid Quantum–Classical Models for Forecasting and Anomaly Detection on Edge IoT Devices","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Anomaly detection; Autoencoder; Enhanced Data Rates for GSM Evolution; Normalization (sociology); SPARK (programming language); Artificial neural network; Intrusion detection system; Preprocessor; Deep learning","score_opus":0.028385973925868606,"score_gpt":0.2544720257252139,"score_spread":0.22608605179934527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127359208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27394268,0.0004338819,0.72039086,0.0019571488,0.0014543084,0.000549189,0.000010188178,0.00018057041,0.001081188],"genre_scores_gemma":[0.95883816,0.000013849162,0.03910354,0.00095955,0.00041724127,0.00003396324,0.0000016992029,0.000026816839,0.00060515717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652994,0.00014329409,0.00067596027,0.0014562692,0.00032500285,0.0008695482],"domain_scores_gemma":[0.99757916,0.001175251,0.00022802601,0.00058843533,0.00020626288,0.0002228838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070051634,0.00053644506,0.0005483638,0.00042849703,0.0011755559,0.0008508395,0.0007159423,0.00017155717,0.0000039258107],"category_scores_gemma":[0.00015091353,0.00047138953,0.00024144482,0.0005589402,0.00016730824,0.0002701193,0.000612423,0.0005107369,0.000004650126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009297707,0.00013798849,0.000031269577,0.00024209774,0.00006885409,0.000010987182,0.00025605134,0.045393568,0.00015285231,0.05245332,0.00021825345,0.9009418],"study_design_scores_gemma":[0.0008622709,0.0009972354,0.000285138,0.00046666016,0.000051011004,0.00006119197,0.000029244286,0.9439501,0.004095965,0.046944782,0.0017804529,0.00047595403],"about_ca_topic_score_codex":0.00006346094,"about_ca_topic_score_gemma":0.000056078083,"teacher_disagreement_score":0.90046585,"about_ca_system_score_codex":0.00007997963,"about_ca_system_score_gemma":0.00020337886,"threshold_uncertainty_score":0.9997738},"labels":[],"label_agreement":null},{"id":"W7127426134","doi":"10.1103/physics.18.200","title":"Plugging Leaks in Quantum Computing","year":2025,"lang":"en","type":"article","venue":"Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"","score_opus":0.009097539720417026,"score_gpt":0.25477971664908017,"score_spread":0.24568217692866315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127426134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1519338,0.00009847092,0.8441782,0.0009356582,0.00049439684,0.00006676718,3.529043e-7,0.00021617713,0.002076195],"genre_scores_gemma":[0.9786632,0.0000018915246,0.020674352,0.00049066346,0.00011735831,0.0000013295406,8.169213e-7,0.0000055908085,0.000044799508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990402,0.000045204586,0.00017568488,0.00031514763,0.0001261681,0.0002976068],"domain_scores_gemma":[0.99941033,0.00014335988,0.000047436686,0.0003436429,0.00002577093,0.000029430217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018199514,0.00011851731,0.00015977558,0.00008682859,0.000121988414,0.00011126876,0.0006059323,0.00002940532,5.095069e-7],"category_scores_gemma":[0.000018588846,0.0001155176,0.000053347667,0.0007773794,0.000025498373,0.000111449,0.00039111247,0.00025967817,0.000012604581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016475303,0.00008531853,0.0017853865,0.00003709247,0.000011240207,0.000017771157,0.0012953385,0.11149913,0.00033724558,0.39709875,0.00039124885,0.48743984],"study_design_scores_gemma":[0.00017935601,0.000010425829,0.002852511,0.0000963161,0.0000012250487,0.0000015211004,0.000012851122,0.93620265,0.000460665,0.059270058,0.00079778896,0.00011465621],"about_ca_topic_score_codex":0.000043225013,"about_ca_topic_score_gemma":0.0000030576093,"teacher_disagreement_score":0.8267294,"about_ca_system_score_codex":0.00003068119,"about_ca_system_score_gemma":0.000060727805,"threshold_uncertainty_score":0.4710671},"labels":[],"label_agreement":null},{"id":"W7128246238","doi":"10.23977/jnca.2025.100109","title":"Hybrid Quantum-Classical Computing for Physical Problems: Architectures, Algorithms, and Applications in the Networked Era","year":2025,"lang":"","type":"article","venue":"Journal of Network Computing and Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Key (lock); Field (mathematics); Focus (optics); Process (computing); The Internet","score_opus":0.011724470595136755,"score_gpt":0.2759839970495308,"score_spread":0.26425952645439404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128246238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073541,0.009098702,0.9095267,0.0052714264,0.0003725274,0.002035108,0.00001278523,0.00006152379,0.00008022606],"genre_scores_gemma":[0.9472704,0.00027021152,0.04534782,0.00078849954,0.006174071,0.00007812974,0.000010886538,0.000037388425,0.000022590311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529225,0.00055645686,0.0016443896,0.0009682879,0.000500683,0.001037928],"domain_scores_gemma":[0.99241555,0.0050106104,0.0012232742,0.0007172496,0.00037105838,0.000262279],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0027141506,0.0006195872,0.0010673057,0.00035575585,0.0020457536,0.00087299163,0.0016726909,0.00016419936,3.7766728e-7],"category_scores_gemma":[0.00006279178,0.00046873972,0.00035776367,0.0017132737,0.00051671645,0.00009906861,0.00071261596,0.002000897,6.662139e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027292604,0.00043477578,0.0004772213,0.00022246172,0.00012842128,0.0000052850937,0.0013917147,0.3758181,0.000007120256,0.04241363,0.0010901763,0.5779838],"study_design_scores_gemma":[0.0010747554,0.00035296945,0.0037233992,0.0008852476,0.0001592546,0.00031255986,0.00014340195,0.88465965,0.0000034695247,0.0791872,0.029109623,0.00038844335],"about_ca_topic_score_codex":0.000013710696,"about_ca_topic_score_gemma":0.0000064400524,"teacher_disagreement_score":0.8737294,"about_ca_system_score_codex":0.00006972331,"about_ca_system_score_gemma":0.00035577043,"threshold_uncertainty_score":0.9997764},"labels":[],"label_agreement":null},{"id":"W7128604950","doi":"10.1109/focs63196.2025.00118","title":"Robust Local Testability of Tensor Products of Constant-Rate Algebraic Geometry Codes","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Divisibility rule; Algebraic number; Tensor product; Testability; Constant (computer programming); Quantum; Tensor (intrinsic definition); Algebra over a field","score_opus":0.016008388393799564,"score_gpt":0.23288709721596002,"score_spread":0.21687870882216045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128604950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40323094,0.0012709122,0.5901107,0.002268228,0.00091769104,0.0005143647,0.000046879297,0.00009722881,0.0015430455],"genre_scores_gemma":[0.9368156,0.00004216219,0.06222172,0.00021186385,0.00006444317,0.0000037543844,0.0000026174164,0.00001498688,0.000622823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950696,0.0005179609,0.0016100027,0.001437027,0.00057382166,0.0007915869],"domain_scores_gemma":[0.9946414,0.0013164551,0.0006154088,0.0019155467,0.0013439159,0.00016723174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021224904,0.00052853615,0.0011935527,0.0005739528,0.00022725263,0.00011315682,0.0016846067,0.00022919674,0.000089035515],"category_scores_gemma":[0.0011671464,0.00044150572,0.00026562883,0.0043146648,0.0021439518,0.00020173856,0.0012840412,0.0005820421,0.000008081603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023431225,0.0030979682,0.018470738,0.005819081,0.00063491904,0.00004646083,0.0018288345,0.15723704,0.012748493,0.12762225,0.0018035547,0.67045635],"study_design_scores_gemma":[0.0008424511,0.0005414298,0.017288469,0.00076044624,0.00007796178,0.000020148305,0.00023212435,0.8734644,0.09883218,0.007245024,0.00021916642,0.00047622068],"about_ca_topic_score_codex":0.0002508624,"about_ca_topic_score_gemma":0.000021002219,"teacher_disagreement_score":0.71622735,"about_ca_system_score_codex":0.00006571024,"about_ca_system_score_gemma":0.0013997873,"threshold_uncertainty_score":0.99980366},"labels":[],"label_agreement":null},{"id":"W7130611687","doi":"10.1109/ictc66702.2025.11388700","title":"Tunneling Effect of quantization-based optimization","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Quantum tunnelling; Quantization (signal processing); Transverse plane; Travelling salesman problem; Exponential function; Function (biology); Quantum; Optimization problem; Longitudinal field","score_opus":0.004606001274532589,"score_gpt":0.24414010025071212,"score_spread":0.23953409897617953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7130611687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013558728,0.00050332095,0.9807947,0.0013095016,0.0015797256,0.00037561607,0.0000035764149,0.00015809758,0.0017166827],"genre_scores_gemma":[0.8366752,0.000015010016,0.16269098,0.00028506407,0.000059930495,0.000004272297,0.000006354262,0.000012071953,0.00025109763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976409,0.0003801656,0.00066839467,0.0006147379,0.00033726243,0.00035850998],"domain_scores_gemma":[0.99777335,0.0009498568,0.0002572149,0.00069011975,0.00025586077,0.000073577285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008595607,0.00031033554,0.0004732282,0.0004807188,0.00027593898,0.00019988579,0.00082480884,0.0001508125,0.000064746695],"category_scores_gemma":[0.00029057605,0.0002639553,0.00021073266,0.0020927407,0.00010747738,0.00012750759,0.00025288633,0.00022353328,0.0000052342716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025453763,0.000060994324,0.0008082863,0.00032248054,0.00003540802,0.0000019346921,0.00008105378,0.91218305,0.00012903503,0.0052712923,0.00008882892,0.08099219],"study_design_scores_gemma":[0.0009567656,0.00041664683,0.00017881216,0.00063772686,0.000048741767,9.812119e-7,0.0000040642853,0.98021054,0.017112145,0.00014506941,0.00007272198,0.00021576154],"about_ca_topic_score_codex":0.000054326625,"about_ca_topic_score_gemma":0.0000015775819,"teacher_disagreement_score":0.8231165,"about_ca_system_score_codex":0.00003058094,"about_ca_system_score_gemma":0.0003308231,"threshold_uncertainty_score":0.9999813},"labels":[],"label_agreement":null},{"id":"W7130691818","doi":"10.1109/computingcon64838.2025.11377460","title":"Enhanced Machine Learning Applications using Automated Quantum Architecture Search: Employing Meta-Learning and Evolutionary Algorithms","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Quantum machine learning; Evolutionary algorithm; Quantum computer; Quantum; Evolutionary computation; Fitness function; Quantum circuit; Field (mathematics)","score_opus":0.027319885096654884,"score_gpt":0.29805175570070974,"score_spread":0.27073187060405485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7130691818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017761322,0.015122143,0.96001124,0.0016980208,0.00050135556,0.0011653871,0.000020813477,0.00278707,0.0009326228],"genre_scores_gemma":[0.67278147,0.0005439636,0.32215455,0.00036044672,0.00032043745,0.000106307125,0.000042210057,0.00010765427,0.003582945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921052,0.0015099928,0.0013409557,0.0024291172,0.00095327356,0.0016614657],"domain_scores_gemma":[0.99648225,0.0011979928,0.00045933918,0.0009022787,0.00047392893,0.00048418978],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015784411,0.0011321597,0.00140202,0.0012840341,0.004134948,0.0010889415,0.0013540122,0.0004348514,0.0001169686],"category_scores_gemma":[0.00023161975,0.0010229595,0.00057644426,0.003673517,0.0005611967,0.00041734698,0.0026409065,0.003368917,0.000026746236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030017374,0.000227969,0.000383531,0.00041801794,0.0019907155,0.000033487282,0.002126039,0.71859,0.0055368035,0.006264849,0.00004831976,0.26435024],"study_design_scores_gemma":[0.0007589012,0.00024127762,0.00042656637,0.000296827,0.0007907474,0.0001781753,0.00022172429,0.9842636,0.00088144693,0.0020459122,0.008921508,0.000973331],"about_ca_topic_score_codex":0.0007218698,"about_ca_topic_score_gemma":0.000016939483,"teacher_disagreement_score":0.6550202,"about_ca_system_score_codex":0.00022495135,"about_ca_system_score_gemma":0.000737563,"threshold_uncertainty_score":0.999948},"labels":[],"label_agreement":null},{"id":"W7132160981","doi":"","title":"Quantum Logic Circuits","year":2022,"lang":"hr","type":"dissertation","venue":"PHYRI Repository","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quantum; Quantum logic; Electronic circuit; Quantum gate","score_opus":0.014650687261902237,"score_gpt":0.25827436043512053,"score_spread":0.24362367317321829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132160981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7356437,0.035328876,0.029244337,0.0013430123,0.10660409,0.00264956,0.00009137703,0.0028357839,0.08625926],"genre_scores_gemma":[0.9782693,0.000086008295,0.0015030564,0.0005312178,0.0023566457,0.00005764096,0.0002962599,0.00014731908,0.016752558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937834,0.0006731752,0.0010345288,0.0020059277,0.0014824448,0.0010205085],"domain_scores_gemma":[0.99628645,0.00035054315,0.0010090914,0.0017745753,0.00024122951,0.00033812187],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005451221,0.0008983681,0.000858465,0.00043692495,0.00211963,0.0007277474,0.0029534802,0.0003945499,0.0001896094],"category_scores_gemma":[0.00007137025,0.000934431,0.00065135834,0.0009859686,0.00011246685,0.00025502118,0.0007372497,0.0021083888,0.00015742649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002464723,0.004442912,0.0012442226,0.0043646665,0.0024674314,0.011574455,0.12458328,0.07202559,0.06672225,0.14677486,0.02787473,0.53767914],"study_design_scores_gemma":[0.0010171753,0.0014216471,0.014234174,0.00067953684,0.0003286955,0.0013061782,0.0015636488,0.9263723,0.0041754916,0.009759791,0.03579015,0.0033512418],"about_ca_topic_score_codex":0.0003400907,"about_ca_topic_score_gemma":0.0000071270806,"teacher_disagreement_score":0.8543467,"about_ca_system_score_codex":0.0002539664,"about_ca_system_score_gemma":0.0007706775,"threshold_uncertainty_score":0.9993106},"labels":[],"label_agreement":null},{"id":"W7133030517","doi":"","title":"Quantum and quantum-inspired algorithms for the electronic structure problem","year":2024,"lang":"","type":"dissertation","venue":"TSpace","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Electronic structure; Hamiltonian (control theory); Qubit; Quantum algorithm; Coupled cluster; Quantum; Curse of dimensionality; Quantum computer","score_opus":0.013833211991850395,"score_gpt":0.3001731687182299,"score_spread":0.2863399567263795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133030517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24460874,0.10549554,0.6011769,0.024563108,0.014085831,0.008262229,0.00022854772,0.0013400324,0.00023905454],"genre_scores_gemma":[0.9626893,0.0025276095,0.020362508,0.0007648425,0.0030558845,0.00040556354,0.00037352604,0.0004636467,0.0093571395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933438,0.00021805997,0.00094150123,0.0025122615,0.0009522335,0.0020321973],"domain_scores_gemma":[0.9960522,0.0011222506,0.00066649815,0.0014417651,0.00039793883,0.0003193486],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0009639822,0.0014380785,0.0010741949,0.0003824492,0.0017692151,0.0020316455,0.0022977518,0.00076495245,0.000036248934],"category_scores_gemma":[0.000113501235,0.0010111069,0.00055518077,0.0013048069,0.00027742228,0.00022297699,0.00053638156,0.0025796667,0.00003159362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003110494,0.00021232059,0.000013779213,0.00467559,0.0018272966,0.0000839717,0.13726798,0.018301595,0.0032668214,0.33336592,0.006859288,0.4938144],"study_design_scores_gemma":[0.0006740614,0.0009636624,0.00019148963,0.0007458416,0.0004247028,0.00016638446,0.002435504,0.8897323,0.00054054527,0.067014836,0.03594927,0.0011613909],"about_ca_topic_score_codex":0.00049196766,"about_ca_topic_score_gemma":0.00031785676,"teacher_disagreement_score":0.8714307,"about_ca_system_score_codex":0.00017253475,"about_ca_system_score_gemma":0.0012232716,"threshold_uncertainty_score":0.9998369},"labels":[],"label_agreement":null},{"id":"W7133059614","doi":"","title":"Quantum State and Unitary Complexity","year":2023,"lang":"","type":"dissertation","venue":"TSpace","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unitary state; Quantum complexity theory; Quantum computer; Mathematical proof; Quantum; State (computer science); Computational complexity theory; PSPACE; Quantum circuit; Quantum state","score_opus":0.03890517794890549,"score_gpt":0.3235163101716787,"score_spread":0.28461113222277323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133059614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9693446,0.0014622345,0.020490235,0.002340938,0.0044050617,0.0005473299,0.000032155018,0.00053999666,0.00083745975],"genre_scores_gemma":[0.8768515,0.0021554183,0.035618618,0.00082250667,0.001217362,0.000051870084,0.0007076946,0.00044367954,0.08213135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564964,0.00034365302,0.00064458617,0.0015523987,0.0007607394,0.0010489873],"domain_scores_gemma":[0.9972643,0.0004946389,0.00048856676,0.0010421571,0.00026179873,0.0004485127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006989385,0.00084371923,0.000838855,0.0004632379,0.0009637614,0.0006365188,0.0012790615,0.00029859523,0.00006432579],"category_scores_gemma":[0.00010876111,0.0008498041,0.00019841541,0.0013184082,0.00032950763,0.0001725208,0.00077100703,0.0013411964,0.0005035708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029992103,0.00049706874,0.0005560417,0.0031303468,0.0007543128,0.0013878905,0.39533877,0.015598997,0.001199842,0.03808487,0.009400237,0.53375167],"study_design_scores_gemma":[0.0004853248,0.0003675335,0.025328888,0.00064294366,0.00004859932,0.000058353842,0.0036475824,0.93928695,0.00016024051,0.026917344,0.0019835893,0.0010726459],"about_ca_topic_score_codex":0.0023463678,"about_ca_topic_score_gemma":0.0004523738,"teacher_disagreement_score":0.92368793,"about_ca_system_score_codex":0.00005274116,"about_ca_system_score_gemma":0.00036287395,"threshold_uncertainty_score":0.99939525},"labels":[],"label_agreement":null},{"id":"W7133511044","doi":"10.1109/aisummit66170.2025.11411648","title":"A Comprehensive Review of the Convergence of Quantum Computing and Finance","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage","funders":"","keywords":"Convergence (economics); Key (lock); Scheme (mathematics); Quantum computer","score_opus":0.01051135678244043,"score_gpt":0.2643558489166251,"score_spread":0.2538444921341847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133511044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21772926,0.3473139,0.4203181,0.009293942,0.0031878073,0.0011359284,0.000018232306,0.000048271024,0.0009545351],"genre_scores_gemma":[0.94474757,0.039855916,0.012377085,0.002781738,0.000029823928,0.0000015095007,3.25947e-7,0.00000780563,0.00019825064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717927,0.00034945153,0.001089574,0.0006232755,0.0003923118,0.00036610302],"domain_scores_gemma":[0.9969819,0.0006090861,0.0007436602,0.0010818145,0.00054524123,0.00003830661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005186368,0.00031092655,0.00084593584,0.00009497362,0.00026027876,0.00003423661,0.0015177805,0.00008438077,0.000011753514],"category_scores_gemma":[0.000155038,0.00021520579,0.00025460267,0.0017254975,0.00073240814,0.00007676211,0.002157906,0.00037793256,0.0000014501251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020358053,0.00029524398,0.0020613128,0.06272046,0.00022676075,0.000007970289,0.0019727023,0.0074765356,0.0008971323,0.39807925,0.0040307813,0.5222115],"study_design_scores_gemma":[0.00029152457,0.00010379259,0.010557716,0.039080348,0.00004661169,0.000019957208,0.000034587138,0.9396586,0.0020374348,0.0027908487,0.0051784185,0.00020020637],"about_ca_topic_score_codex":0.000108760345,"about_ca_topic_score_gemma":0.000001065426,"teacher_disagreement_score":0.932182,"about_ca_system_score_codex":0.000014211979,"about_ca_system_score_gemma":0.00036845045,"threshold_uncertainty_score":0.8775837},"labels":[],"label_agreement":null},{"id":"W7135380497","doi":"10.4230/lipics.esa.2023.10","title":"(No) Quantum Space-Time Tradeoff for USTCON","year":2023,"lang":"en","type":"article","venue":"UvA-DARE (University of Amsterdam)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Bundesministerium für Bildung und Forschung; QuantERA; Deutsche Forschungsgemeinschaft; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Complement (music); Space (punctuation); Quantum; Upper and lower bounds; Work (physics); Spectral gap; Hilbert space; Topology (electrical circuits)","score_opus":0.011486819705066783,"score_gpt":0.20228733929232767,"score_spread":0.19080051958726088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7135380497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56307846,0.00006171516,0.42075947,0.009182135,0.0012872418,0.000666847,0.00011854332,0.0013107796,0.0035348276],"genre_scores_gemma":[0.8294833,0.00003800718,0.14346637,0.00034884244,0.00044276574,0.0000016331767,0.00008895783,0.00006623498,0.026063923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861205,0.00005888189,0.0001346379,0.00048602434,0.0002707669,0.00043765228],"domain_scores_gemma":[0.998855,0.00020995708,0.00014092932,0.0005293146,0.00013219757,0.00013262687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027183173,0.0001813901,0.00030760412,0.0002742355,0.00034633855,0.000055244756,0.0011603447,0.00010101416,0.00004695019],"category_scores_gemma":[0.000030799543,0.00020672218,0.00023316075,0.0006655499,0.00010353106,0.00029220965,0.00047831962,0.00015191558,0.00036985555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000475139,0.00070329144,0.0008463418,0.0013420038,0.000716893,0.0008454554,0.03489049,0.016744519,0.029406436,0.09977068,0.33039755,0.48386118],"study_design_scores_gemma":[0.000959712,0.0003815685,0.003969623,0.00009128523,0.000019347952,0.0000134190395,0.0003043503,0.9249571,0.00016549026,0.0027482377,0.06605351,0.00033633263],"about_ca_topic_score_codex":0.00008177971,"about_ca_topic_score_gemma":0.0000085267775,"teacher_disagreement_score":0.9082126,"about_ca_system_score_codex":0.000032156848,"about_ca_system_score_gemma":0.00008317333,"threshold_uncertainty_score":0.84298855},"labels":[],"label_agreement":null},{"id":"W7135404211","doi":"10.48550/arxiv.2309.16387.v1","title":"Streaming quantum state purification","year":2023,"lang":"en","type":"preprint","venue":"UvA-DARE (University of Amsterdam)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Périmètre de physique théorique; Ministry of Colleges and Universities; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Government of Canada; National Science Foundation","keywords":"Quantum; Quantum error correction; Computation; Quantum algorithm; State (computer science); Dimension (graph theory); Quantum channel; Quantum operation; Quantum computer","score_opus":0.021360764737554983,"score_gpt":0.21970526476592375,"score_spread":0.19834450002836876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7135404211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3531958,0.00010672648,0.6412363,0.0025879082,0.0013307056,0.0003198941,0.00012597152,0.0007445138,0.00035219197],"genre_scores_gemma":[0.9079253,0.00014095759,0.08836681,0.000061913495,0.00015627769,8.9247646e-7,0.00013824807,0.000051570983,0.003158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977938,0.00014257296,0.00025475852,0.0009282093,0.00048217762,0.0003984746],"domain_scores_gemma":[0.99771506,0.00013229642,0.00050661346,0.0012948705,0.0002080554,0.00014309036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034399188,0.00031327285,0.0004558962,0.00044214216,0.00030262623,0.00014110605,0.002418174,0.00020958782,0.000014368266],"category_scores_gemma":[0.000024051216,0.00038572596,0.00026441063,0.0004573397,0.00012875636,0.00022461168,0.0033429333,0.00066017394,0.00012660517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079707075,0.00043762717,0.0014775574,0.0018950647,0.00065602054,0.0008931325,0.04630978,0.11922985,0.0011440633,0.013339931,0.008068106,0.80646914],"study_design_scores_gemma":[0.0004684952,0.0001332228,0.024979543,0.0006661829,0.000041977044,0.0000123442915,0.00076689525,0.9494871,0.00014185207,0.019168647,0.0034369251,0.000696845],"about_ca_topic_score_codex":0.0009149959,"about_ca_topic_score_gemma":0.00010463954,"teacher_disagreement_score":0.83025724,"about_ca_system_score_codex":0.00008967876,"about_ca_system_score_gemma":0.0002224534,"threshold_uncertainty_score":0.99985945},"labels":[],"label_agreement":null},{"id":"W7139975675","doi":"10.15446/recolma.v59n1.122856","title":"Approximate traces on groups and the quantum complexity class MIPco,s","year":2025,"lang":"","type":"article","venue":"Revista Colombiana de Matemáticas","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Class (philosophy); Complexity class; Recursively enumerable language; Quantum; Quantum algorithm; Core (optical fiber); Quantum complexity theory; Natural number","score_opus":0.01662843944524931,"score_gpt":0.2652705369400622,"score_spread":0.2486420974948129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139975675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63238484,0.018939862,0.24068029,0.09323739,0.0023444174,0.0036411274,0.00010332384,0.0007024873,0.007966257],"genre_scores_gemma":[0.9904266,0.0006343063,0.004498552,0.0031985282,0.00020319258,0.000056937697,0.000006848947,0.000043197437,0.0009318184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936272,0.0017294642,0.0011644871,0.0014967894,0.0006396483,0.001342433],"domain_scores_gemma":[0.9951832,0.001957929,0.00047997932,0.0018573282,0.0001788155,0.00034273908],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003496246,0.0007815321,0.0012914132,0.00027957783,0.0016024215,0.003212042,0.0021705485,0.00030186615,0.00003584001],"category_scores_gemma":[0.00053350563,0.00057328417,0.00037589725,0.0013789273,0.0022713935,0.00017519594,0.0012395459,0.0012466703,0.000053736534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028101032,0.00026565118,0.00012074407,0.0010059101,0.00019119332,0.00025966673,0.0012312166,0.00033256877,0.000035741727,0.9620575,0.0023967517,0.03182205],"study_design_scores_gemma":[0.002448429,0.00026888578,0.0032116196,0.0012312093,0.00017743743,0.0003279725,0.00016576587,0.9054184,0.000055189383,0.064374045,0.021745102,0.00057592767],"about_ca_topic_score_codex":0.00014326246,"about_ca_topic_score_gemma":0.000018597757,"teacher_disagreement_score":0.90508586,"about_ca_system_score_codex":0.0002064219,"about_ca_system_score_gemma":0.00037791423,"threshold_uncertainty_score":0.9996973},"labels":[],"label_agreement":null},{"id":"W7140347932","doi":"","title":"Trazas aproximadas sobre grupos y la comunidad cuántica de la clase MIPco,s","year":2025,"lang":"en","type":"article","venue":"Magazine Portal Bibliotech Digital (Universidad Nacional de Colombia)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Class (philosophy); Core (optical fiber); Recursively enumerable language; Quantum; Natural number; Natural (archaeology); Quantum algorithm; Algebra over a field","score_opus":0.004517391409025235,"score_gpt":0.23839120788996804,"score_spread":0.2338738164809428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7140347932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49737003,0.00024104748,0.37692374,0.011933415,0.00040517372,0.0004884814,0.00014497327,0.0011431731,0.11134995],"genre_scores_gemma":[0.9774729,0.000041768042,0.017912079,0.0006945056,0.00006837661,0.0000096294125,0.000060496885,0.000031910702,0.0037083183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971886,0.00020243623,0.0003640039,0.0008150354,0.00059247774,0.0008374452],"domain_scores_gemma":[0.99777025,0.00079303887,0.00016299801,0.0007158668,0.00018061895,0.0003772441],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00063539756,0.00041991024,0.0004189396,0.0029668587,0.00039753455,0.0014034384,0.0017931068,0.00041617884,0.00003238756],"category_scores_gemma":[0.00021557398,0.00047735462,0.00033168934,0.0069184536,0.0004264429,0.0011131058,0.0010420168,0.00095742696,0.000075158736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014964934,0.0015832271,0.0033530528,0.00020115903,0.00035623126,0.012929279,0.0004186124,0.0019971607,0.0071800416,0.69750404,0.07890749,0.19542003],"study_design_scores_gemma":[0.004332108,0.0007214262,0.09533988,0.00044105275,0.00012174349,0.0058893478,0.00022370997,0.40243825,0.0025942072,0.11453982,0.3714134,0.001945054],"about_ca_topic_score_codex":0.000019356492,"about_ca_topic_score_gemma":0.000008965466,"teacher_disagreement_score":0.58296424,"about_ca_system_score_codex":0.00014987541,"about_ca_system_score_gemma":0.00083501893,"threshold_uncertainty_score":0.99976784},"labels":[],"label_agreement":null},{"id":"W7143354995","doi":"10.1109/gcet68529.2025.11450862","title":"Functional Size Measurement of Hybrid Classical Quantum Software Systems","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Project Management; Mitacs","keywords":"Software; Quantum; Quantum system; Hybrid system; Feature (linguistics); Class (philosophy)","score_opus":0.02040364843406753,"score_gpt":0.22880949710006934,"score_spread":0.20840584866600181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7143354995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013836674,0.0031113527,0.9680126,0.003346474,0.009814502,0.00046054888,0.000018919256,0.00026476223,0.001134197],"genre_scores_gemma":[0.98244244,0.00002434131,0.0138412,0.0003436759,0.0003936551,0.000016604681,0.0000020022387,0.000019782568,0.0029162718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946079,0.00038243673,0.0012442288,0.0011460539,0.0018564907,0.0007628518],"domain_scores_gemma":[0.99637455,0.00080891047,0.00036817128,0.0011519878,0.0010601406,0.00023622769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015077653,0.0005169957,0.00080271164,0.00026805126,0.0004308626,0.00037103548,0.0012685929,0.00013228907,0.000100895886],"category_scores_gemma":[0.0007011383,0.00044300925,0.00042491758,0.0010108998,0.0002794148,0.00016876149,0.00093390455,0.00063082,0.000053853066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023897768,0.0024168128,0.0018296383,0.002521713,0.0014337129,0.00014490192,0.00037863242,0.22146931,0.002507904,0.36699733,0.1280159,0.27204514],"study_design_scores_gemma":[0.0009018016,0.00030976607,0.005504675,0.0010107957,0.000072316114,0.00006130041,0.000036727106,0.9779125,0.0016153825,0.003777523,0.008361307,0.00043592855],"about_ca_topic_score_codex":0.0001117857,"about_ca_topic_score_gemma":0.0000043449054,"teacher_disagreement_score":0.9686058,"about_ca_system_score_codex":0.00021596732,"about_ca_system_score_gemma":0.0013272053,"threshold_uncertainty_score":0.9998022},"labels":[],"label_agreement":null},{"id":"W7151868400","doi":"10.5281/zenodo.19464264","title":"Advanced Quantum Computing Paradigms","year":2021,"lang":"","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cybernet Systems Corporation (Canada)","funders":"","keywords":"Mobile computing; Mobile device; Key (lock); Mobile Web; Mobile technology; Mobile business development; Mobile service; Forgetting; Mobile telephony","score_opus":0.024019792680348963,"score_gpt":0.24554277657912915,"score_spread":0.2215229838987802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7151868400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08140411,0.003120167,0.8320963,0.0077416445,0.002389973,0.0009077634,0.00026416482,0.003567517,0.06850839],"genre_scores_gemma":[0.98115176,0.0003003559,0.013328699,0.00067921873,0.00079175155,1.5862742e-8,0.0007105867,0.0021752361,0.00086234824],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940928,0.0012840312,0.0007601522,0.0016472762,0.0009352493,0.0012804862],"domain_scores_gemma":[0.9959285,0.00012527617,0.00036265646,0.0016125357,0.0014065481,0.00056443753],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012935414,0.00047023632,0.00048815593,0.00031199647,0.0073633306,0.004600237,0.003416752,0.00016955203,0.0037525473],"category_scores_gemma":[0.0009899288,0.0005394986,0.0002330434,0.002286445,0.00034079686,0.0005085037,0.006910777,0.0010946926,0.00614342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030727086,0.0003751711,0.0000014614269,0.00015814742,0.000100042314,0.00034941494,0.0042335433,0.014066202,0.002501476,0.039523896,0.021744438,0.9169155],"study_design_scores_gemma":[0.0006584333,0.00028620425,0.00025400723,0.00018804209,0.00001594223,0.00093610864,0.00021743258,0.43384817,0.0005697911,0.000856726,0.561737,0.00043216933],"about_ca_topic_score_codex":0.000009547984,"about_ca_topic_score_gemma":1.6780457e-7,"teacher_disagreement_score":0.9164833,"about_ca_system_score_codex":0.00020769169,"about_ca_system_score_gemma":0.000036104608,"threshold_uncertainty_score":0.9997057},"labels":[],"label_agreement":null},{"id":"W7152065636","doi":"10.5281/zenodo.19464263","title":"Advanced Quantum Computing Paradigms","year":2021,"lang":"","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cybernet Systems Corporation (Canada)","funders":"","keywords":"Mobile computing; Mobile device; Key (lock); Mobile Web; Mobile technology; Mobile business development; Mobile service; Forgetting; Mobile telephony","score_opus":0.024019792680348963,"score_gpt":0.24554277657912915,"score_spread":0.2215229838987802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7152065636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08140411,0.003120167,0.8320963,0.0077416445,0.002389973,0.0009077634,0.00026416482,0.003567517,0.06850839],"genre_scores_gemma":[0.98115176,0.0003003559,0.013328699,0.00067921873,0.00079175155,1.5862742e-8,0.0007105867,0.0021752361,0.00086234824],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940928,0.0012840312,0.0007601522,0.0016472762,0.0009352493,0.0012804862],"domain_scores_gemma":[0.9959285,0.00012527617,0.00036265646,0.0016125357,0.0014065481,0.00056443753],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012935414,0.00047023632,0.00048815593,0.00031199647,0.0073633306,0.004600237,0.003416752,0.00016955203,0.0037525473],"category_scores_gemma":[0.0009899288,0.0005394986,0.0002330434,0.002286445,0.00034079686,0.0005085037,0.006910777,0.0010946926,0.00614342],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030727086,0.0003751711,0.0000014614269,0.00015814742,0.000100042314,0.00034941494,0.0042335433,0.014066202,0.002501476,0.039523896,0.021744438,0.9169155],"study_design_scores_gemma":[0.0006584333,0.00028620425,0.00025400723,0.00018804209,0.00001594223,0.00093610864,0.00021743258,0.43384817,0.0005697911,0.000856726,0.561737,0.00043216933],"about_ca_topic_score_codex":0.000009547984,"about_ca_topic_score_gemma":1.6780457e-7,"teacher_disagreement_score":0.9164833,"about_ca_system_score_codex":0.00020769169,"about_ca_system_score_gemma":0.000036104608,"threshold_uncertainty_score":0.9997057},"labels":[],"label_agreement":null},{"id":"W7160436363","doi":"10.1109/dasa68193.2025.11498904","title":"Experimental Assessment of Quantum PWM Performance in DC Motor Speed Control Applications","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"DC motor; Pulse-width modulation; Control theory (sociology); Electronic speed control; Control (management); Quantum; Control system","score_opus":0.008716214515224736,"score_gpt":0.28454832225233334,"score_spread":0.2758321077371086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7160436363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2939102,0.00050372543,0.6990889,0.0007220299,0.00056075386,0.0010181193,0.000010872978,0.000065783286,0.0041196262],"genre_scores_gemma":[0.97524303,0.000027249329,0.023736706,0.0003442264,0.00009012839,0.000071646944,0.0000021883131,0.000012161737,0.000472649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970121,0.00016022046,0.0009805794,0.00082087505,0.00044470665,0.0005815208],"domain_scores_gemma":[0.9983173,0.00022299182,0.00027095719,0.0009391617,0.00013066859,0.000118945325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005726585,0.0003642454,0.0005994143,0.00046631813,0.00023644917,0.00015014996,0.0013302227,0.0001320497,0.000064183536],"category_scores_gemma":[0.000008617208,0.00034221596,0.00018217362,0.0012522266,0.00020300961,0.00021175922,0.0005162461,0.0004592644,0.000012440467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013170522,0.0056598424,0.047994334,0.00076051516,0.0003079054,0.000019374338,0.0022214886,0.15005837,0.06852561,0.47501633,0.0002070553,0.24909747],"study_design_scores_gemma":[0.0017470029,0.00033295032,0.06066648,0.00021338432,0.000012101919,0.000004382473,0.00013802151,0.9296648,0.005922147,0.00036658245,0.00064719375,0.00028494166],"about_ca_topic_score_codex":0.000077405086,"about_ca_topic_score_gemma":0.0000026530688,"teacher_disagreement_score":0.77960646,"about_ca_system_score_codex":0.00015978153,"about_ca_system_score_gemma":0.0005470118,"threshold_uncertainty_score":0.99990296},"labels":[],"label_agreement":null},{"id":"W9166514","doi":"10.26421/qic14.15-16-1","title":"An algorithm for the T-countAn algorithm for the T-count","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Toffoli gate; Gate count; Algorithm; Quantum computer; Context (archaeology); Mathematics; Quantum circuit; Quantum gate; Computer science; Electronic circuit; Computation; Discrete mathematics; Topology (electrical circuits); Combinatorics; Quantum; Quantum error correction; Quantum mechanics; Physics","score_opus":0.009848571169841867,"score_gpt":0.25555385964539634,"score_spread":0.24570528847555448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9166514","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095718296,0.00010801016,0.99480027,0.0020950255,0.0009450986,0.00084806205,0.000026068274,0.00019006619,0.000030217367],"genre_scores_gemma":[0.2690272,0.00005721703,0.7246392,0.004821472,0.0008845154,0.00035105832,0.00017028692,0.00002667396,0.000022405522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987185,0.000058996808,0.00040898053,0.0002219047,0.00029947673,0.00029211713],"domain_scores_gemma":[0.997958,0.0010635073,0.00025476457,0.00035232035,0.00029622373,0.00007520512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011413783,0.0001927532,0.00015442543,0.00009519266,0.0011732365,0.00089898735,0.0006181324,0.00006800226,0.0000011062826],"category_scores_gemma":[0.0000420737,0.00011526243,0.00008763219,0.00023340166,0.000073186864,0.0010485308,0.000070916685,0.0001365402,0.000007670225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003496123,0.000015393483,0.0000014978515,0.000012408665,0.00001511668,3.6470702e-8,0.0012069057,0.018123504,0.0000024745036,0.028511293,0.0005451874,0.9515627],"study_design_scores_gemma":[0.0006563768,0.0003532078,0.00045834365,0.000010896943,0.000017658742,0.000019837202,0.000262645,0.9419078,0.000025674317,0.013654061,0.042453665,0.00017980505],"about_ca_topic_score_codex":0.000041863634,"about_ca_topic_score_gemma":0.0000035084877,"teacher_disagreement_score":0.9513829,"about_ca_system_score_codex":0.000024427476,"about_ca_system_score_gemma":0.00005390127,"threshold_uncertainty_score":0.9023705},"labels":[],"label_agreement":null},{"id":"W999198455","doi":"","title":"Toward the Implementation of a Quantum RBM","year":2011,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Boltzmann machine; Computer science; Quantum computer; Quantum; Ideal (ethics); Restricted Boltzmann machine; Quantum annealing; Theoretical computer science; Boltzmann constant; Ising model; Face (sociological concept); Statistical physics; Artificial intelligence; Physics; Quantum mechanics; Artificial neural network","score_opus":0.0335818298612497,"score_gpt":0.2689878225671791,"score_spread":0.23540599270592943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W999198455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15789899,0.000026790914,0.8389801,0.0010854698,0.00019513199,0.000082543986,6.735477e-7,0.00007772978,0.0016525999],"genre_scores_gemma":[0.9588752,0.0000018352922,0.0408942,0.0001844444,0.00002216478,0.0000023101811,2.222276e-7,0.0000023696446,0.000017270788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994691,0.000032570017,0.00013301725,0.00012354748,0.00012043077,0.00012135572],"domain_scores_gemma":[0.99958646,0.000031233907,0.000058436264,0.00026992234,0.00003144018,0.000022491158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017233894,0.000054118933,0.000061025483,0.000030316716,0.0000462901,0.000018936442,0.0005555373,0.000012326715,0.00005828923],"category_scores_gemma":[0.0000034215932,0.000030170197,0.0000409968,0.0001648903,0.0000266148,0.00006806284,0.00015861813,0.00005155195,0.00001021492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002467488,0.000044850567,0.0010567261,0.000011830353,0.000022814878,0.0000044493245,0.032020222,0.000046354242,0.00038246036,0.6948637,0.00081836805,0.27072582],"study_design_scores_gemma":[0.0005312894,0.0004639085,0.07571131,0.000016509406,0.000010850297,0.000053016676,0.002573084,0.7872026,0.03878277,0.09272337,0.0016449272,0.0002863648],"about_ca_topic_score_codex":0.00037190283,"about_ca_topic_score_gemma":0.000008579935,"teacher_disagreement_score":0.8009762,"about_ca_system_score_codex":0.0000032134246,"about_ca_system_score_gemma":0.000026434498,"threshold_uncertainty_score":0.12303049},"labels":[],"label_agreement":null}]}