{"meta":{"query_hash":"70c96f239146","filters":{"venue":"Quantum Information Processing"},"cohort_total":90,"direct_labels_cover":0,"predictions_cover":90,"exported":90,"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/70c96f239146","api":"https://metacan.xera.ac/api/v1/cohort?venue=Quantum+Information+Processing"},"results":[{"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":"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":"W1781836750","doi":"10.1023/a:1019697017584","title":"Bang–Bang Operations from a Geometric Perspective","year":2002,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":52,"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":"Computer science; Symmetrization; Quantum computer; Quantum; Imperfect; Bang–bang control; Algorithm; Theoretical computer science; Physics; Mathematics; Quantum mechanics; Mathematical optimization; Combinatorics","score_opus":0.017736225883225716,"score_gpt":0.2339487398937431,"score_spread":0.2162125140105174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1781836750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013888971,0.0006041623,0.95290095,0.001684683,0.00030937354,0.0002203314,0.000016216181,0.00061339285,0.029761953],"genre_scores_gemma":[0.97864723,0.000051231826,0.018892525,0.0022134318,0.00006086627,0.000041836945,0.000036369358,0.0000075078997,0.000048973918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982647,0.00003504606,0.00062884437,0.00019531065,0.0005435171,0.00033261502],"domain_scores_gemma":[0.99862736,0.00004969693,0.00022699371,0.00038713423,0.00056929525,0.00013951083],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00022302411,0.00020322578,0.00017785956,0.0010016897,0.00061478786,0.0014798514,0.00067680934,0.00009779805,0.00033523346],"category_scores_gemma":[0.0001588212,0.00019087798,0.00009856713,0.0026940445,0.00005591152,0.0149103915,0.00010829305,0.00022010013,0.0014159139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075375347,0.00013702721,0.00023757092,0.000070249574,0.00004328992,0.000002607804,0.052008893,0.0020154773,0.000070877235,0.6697952,0.007952681,0.2676586],"study_design_scores_gemma":[0.0004801271,0.000046797795,0.00093944377,0.00003815415,0.000008278788,0.000013285375,0.0031310853,0.9751256,0.00034069637,0.0048694033,0.014685905,0.00032122762],"about_ca_topic_score_codex":0.00009942669,"about_ca_topic_score_gemma":0.0000047203657,"teacher_disagreement_score":0.97311014,"about_ca_system_score_codex":0.00011174812,"about_ca_system_score_gemma":0.00006792887,"threshold_uncertainty_score":0.9995567},"labels":[],"label_agreement":null},{"id":"W1784075345","doi":"10.1007/s11128-011-0317-z","title":"Public and private resource trade-offs for a quantum channel","year":2011,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"McGill University","funders":"","keywords":"Quantum entanglement; Quantum capacity; Analogy; Computer science; Quantum channel; Quantum information science; Theoretical computer science; Amplitude damping channel; Quantum key distribution; Quantum; Classical capacity; Quantum teleportation; Quantum information; Quantum network; Quantum mechanics; Physics","score_opus":0.051268428415578875,"score_gpt":0.2389025551765682,"score_spread":0.1876341267609893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1784075345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01130737,0.00015694018,0.97916895,0.0014293218,0.00019147623,0.0004844665,0.00000879217,0.0005786463,0.006674044],"genre_scores_gemma":[0.9807455,0.000022158338,0.01668965,0.0023348962,0.000033888988,0.00011729071,0.000036203175,0.000012809018,0.0000076078836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998131,0.000032847118,0.00076620735,0.00021606269,0.000355049,0.0004988533],"domain_scores_gemma":[0.99870473,0.000045031127,0.00051604584,0.00034776665,0.0001741942,0.0002122553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007186949,0.00024349843,0.00022044418,0.00057934184,0.0005913762,0.0008455204,0.00066196907,0.00012791951,0.000009550707],"category_scores_gemma":[0.000107440996,0.00022202617,0.00009103323,0.00078896555,0.000106890366,0.011160096,0.00013453697,0.00016521622,0.000032381497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028812778,0.00003952339,0.00008373364,0.00032781626,0.0000132157975,3.924629e-7,0.018487839,0.0000046689943,0.000018033157,0.864384,0.0009976656,0.11561431],"study_design_scores_gemma":[0.0011183243,0.00023199867,0.0017924708,0.000092882125,0.000011652547,0.000057331763,0.0016129975,0.82261664,0.00071198645,0.0683479,0.102865994,0.0005398028],"about_ca_topic_score_codex":0.0000035741377,"about_ca_topic_score_gemma":5.8826595e-7,"teacher_disagreement_score":0.96943814,"about_ca_system_score_codex":0.000025760619,"about_ca_system_score_gemma":0.000107447064,"threshold_uncertainty_score":0.9053964},"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":"W1881757673","doi":"10.1023/a:1019657303471","title":"Liouville Invariance in Quantum and Classical Mechanics","year":2002,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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 British Columbia; D-Wave Systems (Canada)","funders":"","keywords":"Physics; Mesoscopic physics; Quantum mechanics; Degenerate energy levels; Hamiltonian (control theory); Dissipative system; Mathematical physics; Homogeneous space; Quantization (signal processing); Unitary state; Quantum; Heisenberg picture; Theoretical physics; Classical mechanics; Mathematics","score_opus":0.01607595069045208,"score_gpt":0.2154989584767033,"score_spread":0.19942300778625122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1881757673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020364929,0.0004484269,0.9658617,0.0026437268,0.00030230172,0.00026051636,0.000002802349,0.00040601194,0.0097096125],"genre_scores_gemma":[0.99259627,0.00013482997,0.00532816,0.0018685965,0.000019012941,0.000027053122,0.0000057672464,0.000006325917,0.000013975492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830216,0.000039885013,0.00071334466,0.00018307075,0.00039848645,0.00036305666],"domain_scores_gemma":[0.9991155,0.000044543714,0.00029736888,0.00027893163,0.00013237509,0.00013126296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042792835,0.0001900696,0.00019908353,0.0005525714,0.00024543886,0.00072449294,0.0004631892,0.00012513266,0.000041634812],"category_scores_gemma":[0.00009375176,0.00018060367,0.000043052198,0.0012255016,0.00004823655,0.009781781,0.00014012604,0.0002680376,0.00020424798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006190578,0.000044488683,0.00013836497,0.00013637076,0.0000034919647,0.0000022306847,0.006429843,0.00022380476,0.000024551735,0.8723174,0.0011489596,0.1195243],"study_design_scores_gemma":[0.0005397876,0.00005199184,0.0004547645,0.000075933094,0.0000019850659,0.000034493805,0.00046296613,0.96489316,0.000073326424,0.017266817,0.015898632,0.00024616678],"about_ca_topic_score_codex":0.0000068435065,"about_ca_topic_score_gemma":0.000003278898,"teacher_disagreement_score":0.9722313,"about_ca_system_score_codex":0.000041264913,"about_ca_system_score_gemma":0.000049513175,"threshold_uncertainty_score":0.7364804},"labels":[],"label_agreement":null},{"id":"W1892667191","doi":"10.1007/s11128-015-1098-6","title":"Network coding for quantum cooperative multicast","year":2015,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":44,"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":"Multicast; Computer science; Quantum computer; Linear network coding; Computer network; Coding (social sciences); Quantum network; Quantum; Physics; Quantum mechanics; Mathematics","score_opus":0.04259559751974907,"score_gpt":0.2812756328115614,"score_spread":0.23868003529181236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892667191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002326512,0.00010897114,0.990193,0.0009137224,0.00069820817,0.0004850621,0.000008193473,0.00051241426,0.0047538956],"genre_scores_gemma":[0.9466238,0.000006940568,0.04984724,0.003146618,0.00013727118,0.00013116346,0.00007377693,0.000012144324,0.000021050591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979487,0.00004445743,0.00081912277,0.00018667386,0.0004774966,0.0005235362],"domain_scores_gemma":[0.99776894,0.000095139614,0.00047164754,0.00031141072,0.0010981292,0.00025474228],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010234695,0.00023962955,0.00024732546,0.00027186182,0.0005696394,0.0011991464,0.0006374274,0.000109958484,0.000006947365],"category_scores_gemma":[0.0002849711,0.00021638462,0.00008639481,0.001013584,0.00007462187,0.010913664,0.00012228843,0.00016992747,0.00019312227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004828587,0.000028548573,0.00007505207,0.00013083684,0.000012366839,5.0179244e-7,0.009805988,0.005451633,0.000013538111,0.93355227,0.013523329,0.037357636],"study_design_scores_gemma":[0.0010729076,0.00014597984,0.00006851315,0.00007662275,0.0000070872015,0.000017644357,0.0017702286,0.92841476,0.00018040217,0.01789388,0.05003019,0.00032179928],"about_ca_topic_score_codex":0.0000049401388,"about_ca_topic_score_gemma":9.766895e-7,"teacher_disagreement_score":0.94429725,"about_ca_system_score_codex":0.000074609554,"about_ca_system_score_gemma":0.00034918202,"threshold_uncertainty_score":0.9998377},"labels":[],"label_agreement":null},{"id":"W1920756277","doi":"10.1007/s11128-015-1141-7","title":"Optimal joint remote state preparation of equatorial states","year":2015,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":44,"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; Wilfrid Laurier University","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science; National Natural Science Foundation of China","keywords":"Scheme (mathematics); Qubit; State (computer science); Computer science; Joint (building); Quantum computer; Protocol (science); Quantum channel; Topology (electrical circuits); Quantum; Quantum information; Algorithm; Quantum mechanics; Physics; Mathematics; Combinatorics; Engineering","score_opus":0.02692599703392994,"score_gpt":0.2781097078157165,"score_spread":0.25118371078178653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1920756277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08550883,0.000049382805,0.9107423,0.00017586259,0.00047178523,0.00018761729,0.000005498158,0.00024837648,0.0026103926],"genre_scores_gemma":[0.9424765,0.000013307687,0.057120472,0.00026829093,0.00004100895,0.0000070909914,0.00005574201,0.000005957931,0.000011618469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978501,0.000045447767,0.0010359533,0.00012219424,0.000689641,0.00025662372],"domain_scores_gemma":[0.9978509,0.00002099211,0.0008317148,0.0002987371,0.00084012875,0.0001575092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009277041,0.0001598481,0.00020036106,0.0003846747,0.0001296284,0.00046209714,0.0003952873,0.00006485674,0.000006137908],"category_scores_gemma":[0.00013127534,0.00014605987,0.000066198554,0.0007570356,0.000060436516,0.010565604,0.00010662357,0.000118430085,0.000102789505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045568615,0.00014408838,0.00012883931,0.00087108125,0.000060772447,0.0000023008765,0.15174238,0.14699392,0.000415728,0.22773132,0.008869195,0.46258467],"study_design_scores_gemma":[0.0007214932,0.00020506648,0.000056490302,0.000054152806,0.000004282419,0.00000973515,0.00094801653,0.9668812,0.004544601,0.019573724,0.0068000155,0.0002012243],"about_ca_topic_score_codex":0.000026992806,"about_ca_topic_score_gemma":8.114104e-7,"teacher_disagreement_score":0.8569677,"about_ca_system_score_codex":0.000054605553,"about_ca_system_score_gemma":0.00038742786,"threshold_uncertainty_score":0.7659808},"labels":[],"label_agreement":null},{"id":"W1967578724","doi":"10.1007/s11128-008-0090-9","title":"Self-protected quantum algorithms based on quantum state tomography","year":2008,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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 Toronto","funders":"National Science Foundation","keywords":"Quantum algorithm; Quantum computer; Algorithm; Quantum phase estimation algorithm; Quantum tomography; Computer science; Quantum state; Quantum sort; Quantum; Quantum error correction; Quantum information; Physics; Quantum mechanics","score_opus":0.013223399766352268,"score_gpt":0.2260338587316861,"score_spread":0.21281045896533385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967578724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031702247,0.00009925352,0.9588924,0.00076961686,0.0006586255,0.00074748584,0.000023967534,0.002769656,0.0043367706],"genre_scores_gemma":[0.948048,0.000059905597,0.047680233,0.0038489604,0.00005970944,0.0001577042,0.000099348006,0.00003321685,0.0000129223645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954711,0.00013725867,0.0014892833,0.00045339137,0.0015340571,0.00091489096],"domain_scores_gemma":[0.99680007,0.000112121066,0.0009867483,0.000927376,0.00080331654,0.00037037773],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007912764,0.00058468414,0.00045593648,0.0018961214,0.0013649077,0.000901664,0.0013405868,0.0002180155,0.000038989863],"category_scores_gemma":[0.00010623145,0.0005385402,0.000298541,0.003683273,0.00018084008,0.009963894,0.0001354284,0.0005979614,0.0005965608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063212175,0.001965373,0.0028001177,0.0032165672,0.00026257974,0.000121467616,0.055725086,0.017672526,0.00033048744,0.58412844,0.012980956,0.3201643],"study_design_scores_gemma":[0.0013360896,0.0003759747,0.001979588,0.0001326218,0.000009673665,0.00006689013,0.00025472758,0.96999305,0.0010178513,0.0052948664,0.018790256,0.00074840715],"about_ca_topic_score_codex":0.000022639812,"about_ca_topic_score_gemma":8.492351e-7,"teacher_disagreement_score":0.9523205,"about_ca_system_score_codex":0.00011036906,"about_ca_system_score_gemma":0.00056006387,"threshold_uncertainty_score":0.99993515},"labels":[],"label_agreement":null},{"id":"W1970596735","doi":"10.1007/s11128-007-0063-4","title":"Signatures of Incoherence in a Quantum Information Processor","year":2007,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"Air Force Office of Scientific Research; National Science Foundation","keywords":"Quantum decoherence; Statistical physics; Qubit; Unitary state; Physics; Fidelity; Quantum computer; Quantum; Computer science; Hilbert space; Quantum mechanics","score_opus":0.009212580259564326,"score_gpt":0.248677793805443,"score_spread":0.23946521354587869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970596735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12534952,0.00014352228,0.86317307,0.00025080526,0.00026577397,0.00045681003,0.0000064276396,0.00031439387,0.010039681],"genre_scores_gemma":[0.99079937,0.000017381239,0.008153763,0.00093591114,0.00001664677,0.000027822462,0.000040461196,0.0000056185736,0.0000030139936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966785,0.000033015574,0.0018007532,0.0001453045,0.0008359879,0.0005064722],"domain_scores_gemma":[0.99752444,0.0000899705,0.0011889304,0.00035637224,0.0007114951,0.00012880327],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016828146,0.0002573801,0.00029570793,0.0016191179,0.0001850159,0.00044233756,0.0009213863,0.00020159858,0.000016778],"category_scores_gemma":[0.0002542834,0.00023924703,0.00008582524,0.002771236,0.00010199959,0.025103873,0.0001372187,0.00034829514,0.00009195026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014593881,0.00013056195,0.0023496242,0.0015565283,0.00001431523,0.0000022604172,0.034786582,0.002066073,0.00035463818,0.5398005,0.0005058232,0.41828716],"study_design_scores_gemma":[0.0019198682,0.00025101818,0.02369282,0.0005587265,0.0000088315255,0.000030571016,0.0056199785,0.92368275,0.008340756,0.020286817,0.014806475,0.0008014157],"about_ca_topic_score_codex":0.000040559236,"about_ca_topic_score_gemma":0.000011549039,"teacher_disagreement_score":0.9216167,"about_ca_system_score_codex":0.00007600766,"about_ca_system_score_gemma":0.00032433774,"threshold_uncertainty_score":0.9885315},"labels":[],"label_agreement":null},{"id":"W1976758690","doi":"10.1007/s11128-015-0985-1","title":"Hyperfine spin qubits in irradiated malonic acid: heat-bath algorithmic cooling","year":2015,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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 Institute for Advanced Research; Perimeter Institute; University of Waterloo","funders":"","keywords":"Qubit; Hyperfine structure; Quantum computer; Physics; Quantum mechanics; Quantum information; Spin engineering; Quantum error correction; Electron; Atomic physics; Quantum; Spin polarization","score_opus":0.020455217504175192,"score_gpt":0.25390246598100114,"score_spread":0.23344724847682594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976758690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23516187,0.0008083711,0.75358117,0.0010464741,0.00074377964,0.00051085773,0.000007943306,0.0009021466,0.007237383],"genre_scores_gemma":[0.98584986,0.000022581698,0.012482037,0.0014804509,0.00004324104,0.00004005738,0.00006191137,0.000010857548,0.000008999465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975257,0.000059143196,0.0010442933,0.00020797647,0.00062890997,0.00053396594],"domain_scores_gemma":[0.9986413,0.000023175928,0.00031668146,0.00036936745,0.00039706012,0.00025242264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010282048,0.00026505857,0.00027966485,0.00096652796,0.00020576255,0.00077713287,0.00072816055,0.00014210948,0.00001253523],"category_scores_gemma":[0.00013612372,0.00025587922,0.00006627006,0.0021898332,0.000055839584,0.011371477,0.00012909363,0.0003281286,0.00043631805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002606838,0.00040306596,0.0039706035,0.0010126744,0.00005209097,0.000035524412,0.06521977,0.02250864,0.0007552707,0.26000822,0.0044979528,0.6412755],"study_design_scores_gemma":[0.001441599,0.00010684915,0.0024682984,0.00013530251,0.000004012364,0.00006907557,0.0010358323,0.9839751,0.0007242632,0.002516096,0.0071324427,0.00039113205],"about_ca_topic_score_codex":0.00006142153,"about_ca_topic_score_gemma":0.000008166533,"teacher_disagreement_score":0.96146643,"about_ca_system_score_codex":0.00015661759,"about_ca_system_score_gemma":0.0005189364,"threshold_uncertainty_score":0.99998933},"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":"W1990326856","doi":"10.1007/s11128-006-0033-2","title":"A Double Well Interferometer on an Atom Chip","year":2006,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Cold Atom Physics and Bose-Einstein Condensates","field":"Physics and Astronomy","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 Toronto","funders":"European Commission","keywords":"Physics; Atom interferometer; Interferometry; Atom (system on chip); Amplitude; Matter wave; Interference (communication); Adiabatic process; Quantum tunnelling; Phase (matter); Atom optics; Coupling (piping); Atomic physics; Astronomical interferometer; Optoelectronics; Optics; Quantum mechanics; Materials science; Electrical engineering; Quantum","score_opus":0.011546764049466902,"score_gpt":0.24470862603989296,"score_spread":0.23316186199042607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990326856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9234794,0.000009754263,0.0075584115,0.000082300765,0.00011313446,0.00014569247,0.000009949569,0.00008895932,0.06851239],"genre_scores_gemma":[0.99898356,1.5597188e-7,0.00018867888,0.00016452563,0.0002557658,0.000023772129,0.00017977222,0.000012326258,0.0001914533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907774,0.0000110178435,0.000353113,0.00013107953,0.00019542474,0.00023164746],"domain_scores_gemma":[0.99945533,0.000014766252,0.00020531536,0.00017431879,0.000096995995,0.000053299365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010408464,0.00016844303,0.00014055464,0.000116047,0.00022142338,0.00047143028,0.00014870673,0.000032823227,0.000249101],"category_scores_gemma":[5.320462e-7,0.00014750187,0.00006198778,0.00020187971,0.000027062062,0.002095752,0.00003122103,0.00013556547,0.00035759635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020388245,0.0004759192,0.013089145,0.00016530062,0.000039184823,9.313132e-7,0.0022143396,0.0009109718,0.002291766,0.7450411,0.0016129663,0.23395455],"study_design_scores_gemma":[0.009249738,0.0009604364,0.015434573,0.0007874373,0.00012330191,0.000007316147,0.0043886914,0.27540314,0.18557684,0.20040958,0.30471358,0.0029453693],"about_ca_topic_score_codex":0.00016287951,"about_ca_topic_score_gemma":0.000003010558,"teacher_disagreement_score":0.5446315,"about_ca_system_score_codex":0.00002361743,"about_ca_system_score_gemma":0.00005027741,"threshold_uncertainty_score":0.60149515},"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":"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":"W2010538918","doi":"10.1007/s11128-015-0917-0","title":"Controlled remote state preparation via partially entangled quantum channel","year":2015,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Qubit; Unitary state; State (computer science); Quantum channel; Quantum computer; Computer science; Topology (electrical circuits); One-way quantum computer; Channel (broadcasting); W state; Cluster state; Quantum mechanics; Quantum; Physics; Quantum information; Mathematics; Algorithm; Computer network; Quantum error correction; Combinatorics; Law","score_opus":0.020124175625938774,"score_gpt":0.2636456193594765,"score_spread":0.24352144373353773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010538918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015661823,0.00013629624,0.97557706,0.0008471204,0.00071450486,0.00070412434,0.0000042465804,0.0008094525,0.0055453978],"genre_scores_gemma":[0.9907015,0.000019361478,0.007259216,0.0017738428,0.000061837956,0.000056414276,0.00007308794,0.000013373055,0.0000413737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966479,0.00012149376,0.0014656624,0.00024850277,0.0009798581,0.0005365908],"domain_scores_gemma":[0.9970432,0.000049358514,0.001085339,0.00049625203,0.0009794121,0.00034643552],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0014893259,0.0003283397,0.00042148874,0.00057666056,0.0003829761,0.0013022614,0.0007263075,0.00012608415,0.000012721662],"category_scores_gemma":[0.00021562271,0.00029137058,0.00015160603,0.0010913371,0.00007090402,0.014500249,0.00013500624,0.00021836907,0.0005681501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034130195,0.0004254352,0.00014318254,0.0007908469,0.00023129156,0.000017989061,0.1371477,0.03987708,0.00057577575,0.26232335,0.016057558,0.53899676],"study_design_scores_gemma":[0.0040276344,0.00022433724,0.00006113976,0.000055098215,0.000012683911,0.000034986835,0.0005885336,0.9457242,0.00076527003,0.040542163,0.0075832563,0.00038069856],"about_ca_topic_score_codex":0.000031936645,"about_ca_topic_score_gemma":0.000008119171,"teacher_disagreement_score":0.97503966,"about_ca_system_score_codex":0.00011125288,"about_ca_system_score_gemma":0.00046155084,"threshold_uncertainty_score":0.99995387},"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":"W2017598107","doi":"10.1007/s11128-012-0407-6","title":"How to best sample a periodic probability distribution, or on the accuracy of Hamiltonian finding strategies","year":2012,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Qubit; Hamiltonian (control theory); Scaling; Quantum computer; Computer science; Probability distribution; Quantum; Statistical physics; Applied mathematics; Exponential function; Adiabatic quantum computation; Hamiltonian system; Heuristic; Sample complexity; Mathematical optimization; Mathematics; Algorithm; Physics; Quantum mechanics; Statistics; Mathematical analysis; Artificial intelligence","score_opus":0.04461364248157571,"score_gpt":0.2830906106478358,"score_spread":0.2384769681662601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017598107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19208297,0.000026153435,0.80330974,0.0029841906,0.00017315596,0.00044817576,0.00004137866,0.00014033391,0.000793923],"genre_scores_gemma":[0.99253005,0.00000461118,0.0066135176,0.0006964184,0.00003144107,0.00007274913,0.00004096794,0.0000041385592,0.000006088578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832755,0.000056173518,0.00057961186,0.0001147356,0.0005178867,0.0004040129],"domain_scores_gemma":[0.9982468,0.000288806,0.0005202223,0.000437223,0.00036805915,0.00013890456],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00084953627,0.00018701155,0.00017140732,0.00018714402,0.0006105185,0.0015454656,0.0006732467,0.00006694783,0.000024564191],"category_scores_gemma":[0.0009719298,0.00011755629,0.000073963485,0.001263469,0.000084941,0.012718742,0.0001170221,0.0001677378,0.00006108139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000444733,0.00009992771,0.0009911831,0.00035647265,0.000013086577,8.3695056e-8,0.02671022,0.00022872041,0.0000570039,0.90101504,0.00080679846,0.06967698],"study_design_scores_gemma":[0.002219043,0.0018221411,0.05038051,0.0016570977,0.00008255566,0.00009362108,0.102967896,0.39870578,0.015260621,0.06325736,0.36086366,0.0026897164],"about_ca_topic_score_codex":0.000018407398,"about_ca_topic_score_gemma":0.0000041415396,"teacher_disagreement_score":0.8377577,"about_ca_system_score_codex":0.0000680897,"about_ca_system_score_gemma":0.0003345445,"threshold_uncertainty_score":0.99949104},"labels":[],"label_agreement":null},{"id":"W2027008307","doi":"10.1007/s11128-012-0515-3","title":"Evolutionarily stable sets in quantum penny flip games","year":2012,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Quantum; Nash equilibrium; Set (abstract data type); Stochastic game; Evolutionarily stable strategy; Normal-form game; Quantum pseudo-telepathy; Game theory; Strategy","score_opus":0.07943651024095602,"score_gpt":0.3687942329603649,"score_spread":0.28935772271940885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027008307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93462497,0.0005090015,0.044048913,0.0008257714,0.0003570077,0.00034355075,0.000026693822,0.00015131863,0.019112784],"genre_scores_gemma":[0.9981873,0.000006045051,0.0009377725,0.00043096143,0.00006112642,0.00006384344,0.000028749873,0.000008193246,0.0002760127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971291,0.00012490385,0.0010903026,0.00018351767,0.00095340377,0.00051877263],"domain_scores_gemma":[0.99819934,0.00032244524,0.0005438374,0.0003988377,0.00037116744,0.000164343],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0039568134,0.00016920711,0.00023453817,0.0005330364,0.00039506823,0.0004662192,0.00052404334,0.000107612344,0.00045164351],"category_scores_gemma":[0.0013520281,0.00013913208,0.00006027426,0.0015156687,0.00011246102,0.009314483,0.000099365105,0.00022336686,0.0025927324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014410738,0.00033549,0.060559273,0.00011794545,0.000012167448,8.053911e-7,0.04804069,0.003732029,0.00056992867,0.5955696,0.011347782,0.27957013],"study_design_scores_gemma":[0.0009849253,0.00005381818,0.18574916,0.00014002253,0.000016833072,0.000042970096,0.027202092,0.3349256,0.0007556595,0.23317891,0.21620159,0.00074842945],"about_ca_topic_score_codex":0.000017254233,"about_ca_topic_score_gemma":0.000003564582,"teacher_disagreement_score":0.36239073,"about_ca_system_score_codex":0.000096090436,"about_ca_system_score_gemma":0.00018109365,"threshold_uncertainty_score":0.99818385},"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":"W2046152504","doi":"10.1007/s11128-010-0162-5","title":"How quantum is a quantum ensemble?","year":2010,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"Concordia University","funders":"","keywords":"Quantum operation; Quantum state; Quantum process; Quantum discord; Quantum information; Quantum channel; Open quantum system; Quantum algorithm; Quantum capacity; Quantum probability; Quantum network; Quantum mechanics; Classical capacity; Quantum error correction; Quantum; Physics; Quantum dynamics","score_opus":0.011365185738236923,"score_gpt":0.23314102662079114,"score_spread":0.22177584088255423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046152504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072876304,0.000093402734,0.9077684,0.007349525,0.0016428076,0.00039443822,0.000012966142,0.0012051885,0.008656936],"genre_scores_gemma":[0.9828951,0.00002547543,0.012130793,0.004634589,0.00011687614,0.000060525086,0.000040113202,0.000020574162,0.00007599168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967525,0.00004502075,0.0010014733,0.0003604401,0.0010512822,0.0007893109],"domain_scores_gemma":[0.99702394,0.000068589994,0.00086542434,0.0009524311,0.00074774015,0.00034185825],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00078839227,0.00045313474,0.0003654464,0.0008874563,0.00082744745,0.0039736195,0.001537271,0.00030076446,0.000071873365],"category_scores_gemma":[0.00019825951,0.00041278475,0.0002239589,0.001729725,0.00016692773,0.021836977,0.00023989845,0.0007815755,0.0006534054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015905516,0.000053740972,0.00017301083,0.00022356109,0.000016470143,0.00000226649,0.007763046,0.000010224514,0.0015980559,0.84893566,0.006372079,0.13483597],"study_design_scores_gemma":[0.00078084436,0.000105857886,0.0006733647,0.000069991154,0.00001272905,0.00012245691,0.0014265277,0.7551087,0.0051137623,0.043604545,0.19223222,0.00074896764],"about_ca_topic_score_codex":0.000015776948,"about_ca_topic_score_gemma":0.000004901168,"teacher_disagreement_score":0.91001874,"about_ca_system_score_codex":0.000037960366,"about_ca_system_score_gemma":0.00035292658,"threshold_uncertainty_score":0.9998324},"labels":[],"label_agreement":null},{"id":"W2046215549","doi":"10.1023/b:qinp.0000042203.24782.9a","title":"Dreams Versus Reality: Plenary Debate Session on Quantum Computing","year":2003,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","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 Toronto","funders":"","keywords":"Plenary session; Quantum computer; Quantum information processing; Session (web analytics); Computer science; Quantum information; Quantum; Physics; Quantum mechanics; Library science; World Wide Web","score_opus":0.027366896295872814,"score_gpt":0.2919817140169143,"score_spread":0.2646148177210415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046215549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3914168,0.000051034764,0.5537238,0.00051863224,0.0007951417,0.000544166,0.00005440429,0.00032364353,0.052572366],"genre_scores_gemma":[0.9989496,0.0000034585232,0.0004557996,0.00018958295,0.000106319916,0.000031020187,0.00022257905,0.000020395762,0.000021284568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998439,0.000055199587,0.0005895869,0.00021477569,0.00032193147,0.00037947184],"domain_scores_gemma":[0.9988952,0.00008815002,0.00043998333,0.00028691528,0.00016571673,0.00012399042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042933345,0.00023783324,0.00020898017,0.00013476405,0.00072320126,0.00026667092,0.0001803488,0.00006961562,0.0001313663],"category_scores_gemma":[0.00003263806,0.00021938901,0.000084438834,0.00039813295,0.000032432996,0.0010776708,0.00003913514,0.00026617132,0.00027993508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039549657,0.00008697704,0.00010212499,0.000050590676,0.00001557201,3.0503745e-7,0.00066801085,0.00038207552,0.00011804636,0.93526703,0.000718019,0.062551714],"study_design_scores_gemma":[0.0025465828,0.00023585196,0.00022646385,0.00038292,0.00005471019,0.0000058217993,0.006181591,0.7013784,0.004840019,0.21137756,0.07190407,0.0008660024],"about_ca_topic_score_codex":0.000039872244,"about_ca_topic_score_gemma":4.3829914e-7,"teacher_disagreement_score":0.72388947,"about_ca_system_score_codex":0.000052885698,"about_ca_system_score_gemma":0.00016262442,"threshold_uncertainty_score":0.8946424},"labels":[],"label_agreement":null},{"id":"W2048473012","doi":"10.1007/s11128-012-0431-6","title":"A no-summoning theorem in relativistic quantum theory","year":2012,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","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":"Perimeter Institute","funders":"","keywords":"Minkowski space; State (computer science); Quantum no-deleting theorem; Quantum computer; Alice and Bob; Open quantum system; Quantum operation; Quantum state","score_opus":0.01211252464267121,"score_gpt":0.25619198354957573,"score_spread":0.24407945890690452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048473012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17372225,0.00023710684,0.7383311,0.000092668706,0.00033668306,0.0004342155,0.00002488373,0.00014653362,0.08667458],"genre_scores_gemma":[0.99891055,0.0000027017518,0.00047865362,0.00010958899,0.0001615269,0.00010196864,0.00008507972,0.000017177934,0.00013272715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986699,0.000041215717,0.0005360174,0.00011415232,0.00019708496,0.00044161815],"domain_scores_gemma":[0.999175,0.00010092223,0.00031075778,0.0001963711,0.00011351401,0.000103403494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088410015,0.00018203032,0.00017870084,0.0001673811,0.00026508459,0.00009790162,0.00016767303,0.00005476721,0.00024246039],"category_scores_gemma":[0.000051475567,0.00016619574,0.000057182468,0.00039388068,0.000039636005,0.0023794298,0.000050615796,0.00026913258,0.0007046804],"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.000012803423,0.0000615925,0.002235554,0.00003639761,0.000006284074,5.6013086e-8,0.0017063841,0.000026201427,0.000037773214,0.9720533,0.00008434006,0.023739332],"study_design_scores_gemma":[0.00038127456,0.000018713929,0.0013494936,0.0001327572,0.000016661474,0.0000017052427,0.002159665,0.14783484,0.00020783521,0.840015,0.007579228,0.0003028264],"about_ca_topic_score_codex":0.000014477062,"about_ca_topic_score_gemma":1.8121378e-7,"teacher_disagreement_score":0.82518834,"about_ca_system_score_codex":0.000042749707,"about_ca_system_score_gemma":0.000080076956,"threshold_uncertainty_score":0.9057476},"labels":[],"label_agreement":null},{"id":"W2048794275","doi":"10.1007/s11128-012-0410-y","title":"Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication","year":2012,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"McGill University","funders":"","keywords":"Quantum entanglement; Communication source; Computer science; Quantum channel; Quantum capacity; Decoding methods; Amplitude damping channel; Quantum teleportation; Channel (broadcasting); Quantum information science; Topology (electrical circuits); Quantum; Theoretical computer science; Physics; Computer network; Quantum mechanics; Telecommunications; Mathematics; Quantum network","score_opus":0.021248507684592997,"score_gpt":0.28025636861520786,"score_spread":0.25900786093061484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048794275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012645196,0.0004015093,0.98266596,0.0010478079,0.00021548067,0.00041214336,0.000009943711,0.00030984695,0.0022921453],"genre_scores_gemma":[0.9669776,0.000039652925,0.03151062,0.0012319873,0.000028706541,0.000081173195,0.00010951564,0.0000074964405,0.000013261474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984963,0.000037062,0.00063404883,0.000114432696,0.0003146335,0.00040354487],"domain_scores_gemma":[0.9985231,0.0002139944,0.00047661416,0.00030633842,0.00029982367,0.00018013561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005323015,0.00017816502,0.00016273449,0.00027829863,0.0006355048,0.0007918373,0.00045595862,0.00009931503,0.000012963349],"category_scores_gemma":[0.00016486012,0.00016724938,0.00006530597,0.00043209663,0.000096608885,0.01136568,0.00013879684,0.00013008101,0.00003098558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003970006,0.00009676087,0.00049644883,0.0003470418,0.000027554748,2.0932792e-7,0.010088471,0.000118286574,0.00011475835,0.39733714,0.0016319935,0.58970165],"study_design_scores_gemma":[0.0010333587,0.00006897175,0.00054785586,0.00007425039,0.000021654709,0.000030741725,0.0017397233,0.925452,0.0007854689,0.0027170868,0.06716583,0.00036304657],"about_ca_topic_score_codex":0.0000049295463,"about_ca_topic_score_gemma":0.0000020487303,"teacher_disagreement_score":0.9543324,"about_ca_system_score_codex":0.000058177895,"about_ca_system_score_gemma":0.000077982244,"threshold_uncertainty_score":0.8239844},"labels":[],"label_agreement":null},{"id":"W2053220563","doi":"10.1007/s11128-012-0500-x","title":"Ancilla models for quantum operations: for what unitaries does the ancilla state have to be physical?","year":2012,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"","keywords":"Unitary state; Unitary operator; Uncorrelated; Physical system; Operator (biology); TRACE (psycholinguistics); State (computer science); Quantum computer; Quantum; Physics; Quantum decoherence; Computer science; Statistical physics; Quantum mechanics; Algorithm; Mathematics; Hilbert space","score_opus":0.03504721309458193,"score_gpt":0.2840239470712919,"score_spread":0.24897673397671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053220563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039266262,0.00025266266,0.95181787,0.005954861,0.0006699824,0.0014650354,0.00006395854,0.0002746069,0.00023476202],"genre_scores_gemma":[0.9657592,0.000062643456,0.023011062,0.009878554,0.00016608261,0.00095673825,0.00010803526,0.000019512754,0.000038162685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997719,0.0000423454,0.0007810256,0.00019420106,0.00054187945,0.0007215445],"domain_scores_gemma":[0.9976301,0.00023134102,0.00031056983,0.00049134315,0.0011125784,0.00022407106],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0010941171,0.0003043465,0.00027029545,0.0003194395,0.0013765852,0.0029915937,0.0007841076,0.0000757243,0.000003075846],"category_scores_gemma":[0.00021461112,0.00019415207,0.0001639299,0.00066360144,0.00009739786,0.034741595,0.00013602775,0.00013811504,0.000029392058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005427588,0.000064215594,0.000015106643,0.0003032495,0.000025068135,3.495185e-8,0.12287969,0.01879179,0.00006264029,0.7638496,0.0022505936,0.09170373],"study_design_scores_gemma":[0.0004448074,0.000106131774,0.00003351168,0.000068333116,0.000013543182,0.000004252155,0.015573289,0.8872852,0.0015155748,0.032184895,0.062423322,0.00034714618],"about_ca_topic_score_codex":0.000015195044,"about_ca_topic_score_gemma":0.000018292822,"teacher_disagreement_score":0.9288068,"about_ca_system_score_codex":0.00007504705,"about_ca_system_score_gemma":0.00023468494,"threshold_uncertainty_score":0.99992347},"labels":[],"label_agreement":null},{"id":"W2058189587","doi":"10.1007/s11128-013-0609-6","title":"Linear dependencies in Weyl–Heisenberg orbits","year":2013,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Advanced Algebra and Geometry","field":"Mathematics","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":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Algebraic number; Dimension (graph theory); Eigenvalues and eigenvectors; Unitary state; Linear map; Subspace topology; Vector space; Linear subspace; Connection (principal bundle)","score_opus":0.028321466956159766,"score_gpt":0.3000358818978707,"score_spread":0.27171441494171095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058189587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93861496,0.00011360073,0.052357208,0.00030285408,0.00012609028,0.00044390387,0.000002545305,0.00022136462,0.007817448],"genre_scores_gemma":[0.98968375,0.0000096782205,0.009691921,0.00029416304,0.000042907304,0.00007345893,0.0000127292715,0.0000128154625,0.00017855139],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987374,0.000016538519,0.00057616417,0.00009806164,0.00028082237,0.00029101927],"domain_scores_gemma":[0.999223,0.000100799785,0.00025518375,0.00015662379,0.000199921,0.000064475054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022147251,0.00014811454,0.000184273,0.00028483898,0.00012504046,0.00012817347,0.00015061413,0.00009570565,0.000187764],"category_scores_gemma":[0.0005183675,0.00012850019,0.000034216613,0.0005287544,0.000034027984,0.004608188,0.00004850967,0.0002004118,0.0006096436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060009887,0.000309467,0.009137776,0.0038626995,0.000035996756,0.000009720334,0.023545418,0.0012034867,0.0010646624,0.3687931,0.0047974056,0.58718026],"study_design_scores_gemma":[0.0011716045,0.00006574952,0.004272016,0.0004597079,0.000015200225,0.000042629366,0.0072713494,0.14717725,0.00425621,0.8293343,0.0052492362,0.00068475684],"about_ca_topic_score_codex":0.000009982492,"about_ca_topic_score_gemma":0.000007355511,"teacher_disagreement_score":0.5864955,"about_ca_system_score_codex":0.000051115738,"about_ca_system_score_gemma":0.00007091462,"threshold_uncertainty_score":0.78359383},"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":"W2066341663","doi":"10.1007/s11128-009-0098-9","title":"Quantum state control, entanglement, and readout of the Josephson persistent-current qubit","year":2009,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"D-Wave Systems (Canada)","funders":"","keywords":"Flux qubit; Physics; Charge qubit; Phase qubit; Qubit; Quantum mechanics; Josephson effect; Quantum entanglement; Quantum computer; Quantum; Superconductivity","score_opus":0.009914204523255313,"score_gpt":0.23367928028176113,"score_spread":0.22376507575850582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066341663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30980608,0.0015383175,0.6794505,0.0032835554,0.00080278335,0.0008982669,0.00002897079,0.00035881458,0.0038326941],"genre_scores_gemma":[0.9980217,0.00007530706,0.00059699046,0.0012656196,0.000013758909,0.000009135807,0.000008224193,0.0000035888431,0.0000056522344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811035,0.000054747623,0.0008198516,0.00014301448,0.00056728744,0.00030475567],"domain_scores_gemma":[0.9984347,0.000027992313,0.0007897366,0.00035214,0.0002956667,0.00009975879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048938015,0.00019420269,0.00021068552,0.0002598369,0.00035687836,0.0004548712,0.00058160466,0.00004824835,0.0000063986786],"category_scores_gemma":[0.000051689007,0.00014097396,0.00014169131,0.0006555508,0.00009619998,0.004873531,0.000078811914,0.00018620957,0.000016693353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000590948,0.000095434494,0.0018038494,0.00029804726,0.000026235184,2.7481974e-7,0.016363202,0.00027510666,0.00030963848,0.3192866,0.00086293375,0.66061956],"study_design_scores_gemma":[0.002632214,0.0004025778,0.01793973,0.0004168726,0.000043565473,0.000037095357,0.0017958364,0.9329126,0.0014591962,0.017601512,0.024213837,0.00054496987],"about_ca_topic_score_codex":0.0000072774224,"about_ca_topic_score_gemma":0.0000012808534,"teacher_disagreement_score":0.9326375,"about_ca_system_score_codex":0.00003827028,"about_ca_system_score_gemma":0.00012583821,"threshold_uncertainty_score":0.5748751},"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":"W2080804881","doi":"10.1007/s11128-006-0045-y","title":"Improved Gap Estimates for Simulating Quantum Circuits by Adiabatic Evolution","year":2006,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Mathematical Biology Tumor Growth","field":"Mathematics","cited_by":16,"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":"Institut Périmètre de physique théorique","keywords":"Adiabatic process; Quantum computer; Electronic circuit; Adiabatic quantum computation; Quantum; Physics; Statistical physics; Computer science; Quantum mechanics","score_opus":0.029287899625261935,"score_gpt":0.29712536080420093,"score_spread":0.267837461178939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080804881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15173537,0.00022571815,0.84354156,0.00017378817,0.00014583781,0.0010616265,0.00005750022,0.0005752424,0.002483371],"genre_scores_gemma":[0.98273826,6.6223936e-7,0.016530782,0.0001105576,0.00008604338,0.00019012346,0.00023291334,0.0000391301,0.00007151953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753034,0.00003980902,0.0012987497,0.00023707775,0.00029825547,0.0005957884],"domain_scores_gemma":[0.9974285,0.000966488,0.0008779074,0.00025521865,0.00037991843,0.0000919852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084462744,0.00033459504,0.00046119647,0.00019646592,0.0004790742,0.00024057209,0.00024339509,0.00020844901,0.00003460653],"category_scores_gemma":[0.002587978,0.00030086824,0.00011769081,0.00035820898,0.00010720212,0.0018512486,0.00004485386,0.00019090546,0.00003820753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006187597,0.00032980295,0.00084633596,0.008740564,0.000057056088,8.1733816e-7,0.0016911909,0.00029153834,0.014743381,0.95110446,0.0077701258,0.014362837],"study_design_scores_gemma":[0.000565642,0.00007117716,0.000057940077,0.00017355461,0.000049586182,0.00000943551,0.00023728746,0.58342284,0.002151761,0.41282055,0.00017152824,0.00026868365],"about_ca_topic_score_codex":0.000023011356,"about_ca_topic_score_gemma":0.0000027392891,"teacher_disagreement_score":0.8310029,"about_ca_system_score_codex":0.00018819768,"about_ca_system_score_gemma":0.000117363394,"threshold_uncertainty_score":0.9999443},"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":"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":"W2093698511","doi":"10.1007/s11128-009-0158-1","title":"Normalization procedure for relaxation studies in NMR quantum information processing","year":2009,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Molecular spectroscopy and chirality","field":"Chemistry","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 Waterloo","funders":"","keywords":"Normalization (sociology); Quantum computer; Quantum information processing; Computer science; Quantum; Statistical physics; Nuclear magnetic resonance; Quantum mechanics; Physics","score_opus":0.02383508158963604,"score_gpt":0.31615423217445704,"score_spread":0.292319150584821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093698511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6808934,0.002172182,0.29793635,0.0017945516,0.00031981745,0.0015261809,0.000055747558,0.0010572955,0.01424447],"genre_scores_gemma":[0.996414,0.00009028257,0.0016570726,0.0008564807,0.00009544096,0.0001433106,0.0006916991,0.000014820269,0.000036915702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975047,0.000020866826,0.0013091991,0.00020990758,0.0004907462,0.0004645805],"domain_scores_gemma":[0.9979179,0.000028257518,0.0010904248,0.00020977465,0.00067799597,0.00007562971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005542017,0.00032176694,0.00033053776,0.00033546772,0.00049524475,0.00042078196,0.00022063094,0.00025202535,0.000021549311],"category_scores_gemma":[0.00065100665,0.0003160424,0.00008236881,0.0006309989,0.00006339587,0.010282615,0.00002813871,0.00028101754,0.00002134928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020166216,0.00064688374,0.0049354075,0.036524344,0.00010710584,0.0000054338716,0.13188337,0.018195355,0.020191971,0.09029033,0.0027744363,0.69242877],"study_design_scores_gemma":[0.0036293252,0.00026308987,0.0027086805,0.0029000542,0.00009579971,0.000046319004,0.012949022,0.89480025,0.044387665,0.023723809,0.0132218,0.0012742174],"about_ca_topic_score_codex":0.000008004633,"about_ca_topic_score_gemma":0.0000062872346,"teacher_disagreement_score":0.87660486,"about_ca_system_score_codex":0.00031475595,"about_ca_system_score_gemma":0.00028746293,"threshold_uncertainty_score":0.9999292},"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":"W2105061359","doi":"10.1007/s11128-011-0310-6","title":"The quantum dynamic capacity formula of a quantum channel","year":2011,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"McGill University","funders":"","keywords":"Quantum capacity; Classical capacity; Quantum operation; Quantum channel; Amplitude damping channel; Quantum error correction; Quantum algorithm; Quantum process; Quantum information","score_opus":0.025014661349854608,"score_gpt":0.23069750478410112,"score_spread":0.2056828434342465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105061359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053834993,0.00019940492,0.9373188,0.00041908186,0.00063610286,0.00039157426,0.000010952056,0.00041569056,0.006773419],"genre_scores_gemma":[0.99574786,0.00008218251,0.003627889,0.00043497572,0.000014888299,0.000054563625,0.000014446314,0.000012281172,0.000010908116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697053,0.000071267365,0.001396825,0.00020442498,0.00074657117,0.0006103568],"domain_scores_gemma":[0.99712163,0.00008944001,0.0012150336,0.00073212455,0.00067997596,0.00016180055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011699569,0.00031479503,0.00030575908,0.00047822663,0.00091020315,0.00047224612,0.0015307206,0.00015130267,0.000015552554],"category_scores_gemma":[0.00014520266,0.0002303797,0.0001989762,0.0013161739,0.00027285155,0.009386042,0.00021271827,0.00031484643,0.00013679877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043221025,0.00006152754,0.00006386378,0.0002510817,0.000024602821,5.4849426e-7,0.021244934,0.00004996632,0.00006129148,0.9349956,0.0002526761,0.042950675],"study_design_scores_gemma":[0.0004603386,0.00014681555,0.0016922423,0.00009840542,0.0000109783705,0.000032434895,0.002262811,0.8885616,0.0012849492,0.101953305,0.0031627323,0.00033337556],"about_ca_topic_score_codex":0.000057878246,"about_ca_topic_score_gemma":0.000006972218,"teacher_disagreement_score":0.9419129,"about_ca_system_score_codex":0.000056943183,"about_ca_system_score_gemma":0.00021914714,"threshold_uncertainty_score":0.9394611},"labels":[],"label_agreement":null},{"id":"W2107808235","doi":"10.1007/s11128-004-7712-7","title":"Consistency of the Adiabatic Theorem","year":2004,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Spectroscopy and Quantum Chemical Studies","field":"Physics and Astronomy","cited_by":111,"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; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Adiabatic process; Generalization; Argument (complex analysis); Consistency (knowledge bases); Adiabatic theorem; Adiabatic quantum computation; Quantum computer; Quantum; Point (geometry); Quantum no-deleting theorem; Mathematics; Physics; Theoretical physics; Quantum mechanics; Pure mathematics; Mathematical physics; Quantum information; Discrete mathematics; Mathematical analysis; Quantum channel; Geometry; Chemistry","score_opus":0.007227057510948758,"score_gpt":0.232453829051382,"score_spread":0.22522677154043325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107808235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9306531,0.000119574,0.016505146,0.0005236481,0.00013595093,0.00016423367,0.000015301612,0.000035877154,0.051847145],"genre_scores_gemma":[0.99961007,9.792826e-7,0.00022328476,0.0001081751,0.000030427489,0.000009411685,0.000006098428,0.0000030239942,0.00000856227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994065,0.0000067503042,0.00028142284,0.000046383815,0.00013461229,0.00012428615],"domain_scores_gemma":[0.9995623,0.000018743523,0.00021827263,0.00009969994,0.00008018855,0.000020756404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000075013595,0.000077523626,0.0001054341,0.000021489253,0.00021003674,0.000032914093,0.00011821246,0.000017430531,0.00005969848],"category_scores_gemma":[0.000021015427,0.000049079797,0.000060634713,0.00018425846,0.000120676385,0.00048214596,0.000033943877,0.0000845039,0.000017037612],"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.000010664228,0.000049164417,0.0056897793,0.0001224281,0.000025693214,3.1439978e-8,0.0035000695,0.00021115175,0.0016136251,0.97492605,0.00007516729,0.013776153],"study_design_scores_gemma":[0.0015246501,0.00006574396,0.008921501,0.0005192185,0.00007588741,0.000002726174,0.008399433,0.003282455,0.27874464,0.6955065,0.002566158,0.00039111066],"about_ca_topic_score_codex":0.000039370458,"about_ca_topic_score_gemma":3.983296e-7,"teacher_disagreement_score":0.27941957,"about_ca_system_score_codex":0.000018373175,"about_ca_system_score_gemma":0.00008876085,"threshold_uncertainty_score":0.20014161},"labels":[],"label_agreement":null},{"id":"W2109887813","doi":"10.1007/s11128-015-1021-1","title":"A novel protocol for multiparty quantum key management","year":2015,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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 Calgary","funders":"","keywords":"Computer science; Key management; Key distribution; Quantum key distribution; Key (lock); Protocol (science); Quantum cryptography; Shared secret; Cryptography; Key generation; Group key; Pre-shared key; Cryptographic protocol; Computer security; Computer network; Public-key cryptography; Quantum; Encryption; Quantum information; Physics","score_opus":0.05616740532040958,"score_gpt":0.3156966776341375,"score_spread":0.2595292723137279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109887813","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.00014280494,0.0000043277696,0.9501571,0.0004811078,0.00022926935,0.038213365,0.000007400959,0.0005879493,0.010176677],"genre_scores_gemma":[0.12463557,0.0000016938199,0.49892944,0.0050793393,0.00014712177,0.37092662,0.00011141071,0.00004122975,0.00012759368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976713,0.000020829573,0.0009348767,0.00021860423,0.000675543,0.0004788362],"domain_scores_gemma":[0.9979957,0.000030260797,0.000590293,0.00044138092,0.00068818836,0.00025422662],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00091861567,0.0002644212,0.00021247893,0.0005048807,0.0003584616,0.0010603721,0.00084109366,0.00010079195,0.0000074757586],"category_scores_gemma":[0.000082174534,0.00023153992,0.00011400146,0.000891475,0.000055620952,0.01041958,0.00017879897,0.00013465856,0.0001913046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001239003,0.00015398585,0.000047079506,0.0010076307,0.000022671491,6.4534004e-7,0.008053626,0.0007632112,0.000027969734,0.8680106,0.01197587,0.10981285],"study_design_scores_gemma":[0.0030290573,0.0001194382,0.0001035164,0.00009456054,0.0000053131976,0.00001636439,0.0010126061,0.70241725,0.00026205945,0.010039518,0.28259516,0.00030517962],"about_ca_topic_score_codex":0.000006002772,"about_ca_topic_score_gemma":7.6123087e-7,"teacher_disagreement_score":0.8579711,"about_ca_system_score_codex":0.00008291328,"about_ca_system_score_gemma":0.00021381231,"threshold_uncertainty_score":0.99997663},"labels":[],"label_agreement":null},{"id":"W2116450533","doi":"10.1023/b:qinp.0000022737.53723.b4","title":"Noiseless Subsystems and the Structure of the Commutant in Quantum Error Correction","year":2003,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"Perimeter Institute; University of Waterloo; University of Guelph","funders":"","keywords":"Centralizer and normalizer; Quantum error correction; Quantum computer; Unital; Hamiltonian (control theory); Set (abstract data type); Quantum; Noise (video); Computer science; Error detection and correction; Algebra over a field; Mathematics; Discrete mathematics; Algorithm; Pure mathematics; Quantum mechanics; Physics; Mathematical optimization; Artificial intelligence","score_opus":0.007417183464120398,"score_gpt":0.2164543256536613,"score_spread":0.2090371421895409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116450533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7959632,0.00040534436,0.1972072,0.00083781115,0.0017419937,0.00079926796,0.000006743499,0.00012565695,0.0029127623],"genre_scores_gemma":[0.9992419,0.000016332591,0.0002691496,0.00044529344,0.0000072156763,0.000008999072,0.0000027827775,0.0000040136606,0.0000043161267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831843,0.0002043898,0.0007708243,0.00009832824,0.00040095512,0.00020704587],"domain_scores_gemma":[0.9986436,0.000096159434,0.0006565412,0.00036380463,0.00020178987,0.000038117894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077161373,0.00015078098,0.00021116935,0.00021961113,0.00036760393,0.00033178614,0.0005388888,0.00008258724,0.0000049810355],"category_scores_gemma":[0.0001537043,0.00008531747,0.00006242192,0.0012338982,0.00020482561,0.0030332804,0.000074312324,0.00026564623,0.0000036527747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043734053,0.000022504073,0.0035768177,0.00035705377,0.000009977438,1.5977042e-7,0.025043273,0.0016046687,0.00017438483,0.95299035,0.00020417482,0.0159729],"study_design_scores_gemma":[0.0014551703,0.000024399904,0.0052066,0.0001823176,0.000007414864,0.00007450738,0.0057863127,0.97016644,0.002563406,0.012032882,0.002317106,0.00018346043],"about_ca_topic_score_codex":0.00004851369,"about_ca_topic_score_gemma":0.00003745764,"teacher_disagreement_score":0.96856177,"about_ca_system_score_codex":0.000030721447,"about_ca_system_score_gemma":0.00013601634,"threshold_uncertainty_score":0.34791455},"labels":[],"label_agreement":null},{"id":"W2209813575","doi":"10.1007/s11128-015-1076-z","title":"A new quantum sealed-bid auction protocol with secret order in post-confirmation","year":2015,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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 Calgary","funders":"Program for New Century Excellent Talents in University; Fok Ying Tong Education Foundation; National Natural Science Foundation of China","keywords":"Collusion; Computer science; Protocol (science); Computer security; Quantum computer; Computer network; Theoretical computer science; Quantum; Business; Physics; Quantum mechanics","score_opus":0.015593518685410417,"score_gpt":0.26052655739449704,"score_spread":0.24493303870908661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209813575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007047576,0.000011197959,0.97323656,0.0016568931,0.00019486816,0.011059362,0.0000028741451,0.00059604127,0.0061946427],"genre_scores_gemma":[0.8974191,0.000003837364,0.08064654,0.0049997,0.00017766698,0.016365103,0.00024452238,0.00004746902,0.00009604016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731106,0.00007527525,0.0010126848,0.00023312026,0.00090706785,0.00046080945],"domain_scores_gemma":[0.99744606,0.000022638547,0.00071797834,0.0004042435,0.001103259,0.00030579756],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0008107784,0.00030457633,0.00025513538,0.00094505545,0.00021197494,0.0010911381,0.0005803786,0.0001528944,0.00003872291],"category_scores_gemma":[0.000114964154,0.00025670003,0.000049562997,0.0024891195,0.0000505437,0.01921463,0.000089061796,0.00031170508,0.00028427306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010108632,0.00025133605,0.0019265234,0.0012849108,0.000048311944,0.000011120853,0.08376183,0.0134700015,0.00010742936,0.41345218,0.009283342,0.47539213],"study_design_scores_gemma":[0.004086366,0.0004959827,0.0022651127,0.00023449193,0.000007627921,0.00012683723,0.0037424813,0.9389577,0.00046201798,0.008230295,0.040773075,0.00061801967],"about_ca_topic_score_codex":0.0001507791,"about_ca_topic_score_gemma":0.00003368006,"teacher_disagreement_score":0.9254877,"about_ca_system_score_codex":0.00015070425,"about_ca_system_score_gemma":0.0014377703,"threshold_uncertainty_score":0.9999885},"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":"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":"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":"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":"W2611358651","doi":"10.1007/s11128-017-1777-6","title":"Dipolar relaxation mechanism of long-lived states of methyl groups","year":2017,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Advanced NMR Techniques and Applications","field":"Chemistry","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":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Industry Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Canada Excellence Research Chairs, Government of Canada; Canadian Institute for Advanced Research","keywords":"Zeeman effect; Magnetic dipole–dipole interaction; Dipole; Hamiltonian (control theory); Relaxation (psychology); Physics; Condensed matter physics; Spectral line; Chemistry; Quantum mechanics; Magnetic field","score_opus":0.02073441352530412,"score_gpt":0.30241823800161854,"score_spread":0.2816838244763144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611358651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41360328,0.000098343444,0.581046,0.000094578216,0.000014745629,0.00011752204,0.000037390604,0.000118511845,0.0048696795],"genre_scores_gemma":[0.9920079,0.00009018456,0.0076847617,0.000016553771,0.0000143230545,0.00003065201,0.00010812321,0.000009019255,0.000038478276],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990771,0.0000043249333,0.0005233273,0.00008134133,0.00019809893,0.00011584617],"domain_scores_gemma":[0.99773747,0.000024531073,0.0015543893,0.00036200907,0.00029012412,0.00003147402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016977338,0.0000990163,0.00016060195,0.00006207695,0.00028905968,0.0000621749,0.0002690772,0.00008889671,0.000053546733],"category_scores_gemma":[0.00010965709,0.00009466363,0.000044706092,0.00006059647,0.00008398424,0.0018611072,0.0000599937,0.000104686565,0.000005267145],"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.00010553993,0.00017130136,0.0017015274,0.0043656803,0.000053056163,6.7645095e-7,0.007558688,0.0005777596,0.29807734,0.20601541,0.00008103529,0.48129198],"study_design_scores_gemma":[0.00032984198,0.000025836292,0.0005647725,0.00032999556,0.000028196877,0.0000029545838,0.0010415268,0.07497231,0.86240625,0.059392136,0.0007342686,0.00017188516],"about_ca_topic_score_codex":0.000033141438,"about_ca_topic_score_gemma":0.0000013851354,"teacher_disagreement_score":0.57840466,"about_ca_system_score_codex":0.000027949227,"about_ca_system_score_gemma":0.000039651848,"threshold_uncertainty_score":0.38602707},"labels":[],"label_agreement":null},{"id":"W2613778866","doi":"10.1007/s11128-017-1614-y","title":"Effects of cross-Kerr coupling and parametric nonlinearity on normal mode splitting, cooling, and entanglement in optomechanical systems","year":2017,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Mechanical and Optical Resonators","field":"Physics and Astronomy","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 Waterloo","funders":"National Natural Science Foundation of China","keywords":"Quantum entanglement; Physics; Coupling (piping); Normal mode; Parametric statistics; Ground state; Amplifier; Optomechanics; Optics; Quantum mechanics; Condensed matter physics; Quantum electrodynamics; Resonator; Optoelectronics; Vibration; Quantum; Materials science","score_opus":0.011647676637126701,"score_gpt":0.3143069060101776,"score_spread":0.3026592293730509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613778866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837778,0.00007084031,0.015429466,0.000015898191,0.00007901746,0.00023938858,0.000009868818,0.000012064608,0.00036561847],"genre_scores_gemma":[0.99957573,0.0000089216965,0.0003174898,0.000018360002,0.00004032067,0.00001858879,0.000009475686,0.0000054284787,0.000005676454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989436,0.000011022896,0.0004750099,0.00013054562,0.00023012975,0.00020966309],"domain_scores_gemma":[0.9991738,0.00013408902,0.00038077543,0.00012208658,0.00008727664,0.00010197752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003650492,0.00012445908,0.00022705694,0.00009737081,0.00025815994,0.00041148232,0.0001204863,0.00006260496,0.0000051350275],"category_scores_gemma":[0.00019961366,0.00010586654,0.00002653621,0.00007964434,0.000066612876,0.00085155177,0.00010643943,0.00019274016,0.0000032127587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062212953,0.0006890993,0.25862974,0.006099522,0.0000749923,0.0000053998097,0.0015549625,0.0062479856,0.00088619924,0.5427679,0.000008546505,0.18241352],"study_design_scores_gemma":[0.0010827482,0.000089379086,0.013149343,0.00041816029,0.0000128245865,6.5404066e-7,0.00015283082,0.9792818,0.004315782,0.0012593465,0.000089152,0.00014797277],"about_ca_topic_score_codex":0.00012873065,"about_ca_topic_score_gemma":5.915717e-7,"teacher_disagreement_score":0.97303385,"about_ca_system_score_codex":0.000018692597,"about_ca_system_score_gemma":0.000035012312,"threshold_uncertainty_score":0.4317112},"labels":[],"label_agreement":null},{"id":"W2743099088","doi":"10.1007/s11128-017-1792-7","title":"Implementing a noise protected logical qubit in methyl groups via microwave irradiation","year":2017,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum and electron transport phenomena","field":"Physics and Astronomy","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; Perimeter Institute; University of Waterloo","funders":"Canada First Research Excellence Fund; Industry Canada; Canada Excellence Research Chairs, Government of Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Physics; Qubit; Spins; Dipole; Quantum mechanics; Noise (video); Topology (electrical circuits); Computer science; Condensed matter physics; Mathematics; Quantum; Image (mathematics); Combinatorics","score_opus":0.013310937987629447,"score_gpt":0.2576365819848924,"score_spread":0.24432564399726298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743099088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80708396,0.000037924903,0.1834959,0.0002683784,0.00007722369,0.0005200624,0.000012497171,0.00007179845,0.008432275],"genre_scores_gemma":[0.99869484,0.0000015298202,0.00082250626,0.00006750732,0.00009543578,0.000102703656,0.00018688073,0.000012278332,0.000016307857],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99838734,0.000028716944,0.0006443459,0.00017242382,0.00021030207,0.00055688305],"domain_scores_gemma":[0.99890536,0.00001482973,0.0006571013,0.0002410731,0.00010839916,0.00007322358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005635681,0.00019528181,0.00022359112,0.00016205462,0.0008158019,0.0004914254,0.0002656208,0.000064925094,0.00014789926],"category_scores_gemma":[0.00001762553,0.00018505352,0.00006583536,0.00015463111,0.000049141632,0.0033102555,0.000045685472,0.00029307764,0.00006402572],"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.00019590903,0.0002570279,0.10610451,0.0004913318,0.00006419748,0.000002818549,0.011321526,0.0002434792,0.025126923,0.07442532,0.000076287055,0.78169066],"study_design_scores_gemma":[0.0075472146,0.00033791372,0.4495996,0.00048975763,0.00011468014,0.000009756645,0.0051944,0.32211378,0.023078425,0.17811437,0.011255092,0.0021450021],"about_ca_topic_score_codex":0.0002682498,"about_ca_topic_score_gemma":0.000025639327,"teacher_disagreement_score":0.77954566,"about_ca_system_score_codex":0.000057035857,"about_ca_system_score_gemma":0.00010001719,"threshold_uncertainty_score":0.7546264},"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":"W2800158380","doi":"10.1007/s11128-018-1891-0","title":"Analytical solution and applications of three qubits in three coupled modes without rotating wave approximation","year":2018,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"National Natural Science Foundation of China","keywords":"Qubit; Dephasing; Multipartite; Quantum entanglement; Physics; Quantum mechanics; Rotating wave approximation; Realization (probability); Coupling (piping); Quantum computer; Coupling strength; Multipartite entanglement; Bipartite graph; Quantum; Statistical physics; Squashed entanglement; Mathematics; Computer science; Condensed matter physics; Theoretical computer science","score_opus":0.02460686220349204,"score_gpt":0.26406320145297424,"score_spread":0.2394563392494822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800158380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13580807,0.00004108741,0.8613662,0.00014859594,0.000029942752,0.0003900174,0.0000020262858,0.00012209326,0.0020919573],"genre_scores_gemma":[0.95741826,0.000005387836,0.04231281,0.0001309216,0.000029916231,0.000077113174,0.00001919116,0.0000051848892,0.0000012363726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982697,0.000021747528,0.0008755447,0.00016790819,0.00041005702,0.00025507648],"domain_scores_gemma":[0.9985695,0.000042751235,0.0005640206,0.0002593743,0.0004898646,0.00007451219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068670214,0.00015779285,0.00021132671,0.0006002033,0.000278065,0.00029851426,0.00026680247,0.00009784731,0.0000063367647],"category_scores_gemma":[0.000073902156,0.00014962952,0.000038831677,0.0012221868,0.00018805849,0.006102826,0.00010217265,0.00014084714,0.000019256739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030339794,0.000053634136,0.008235913,0.00041147418,0.000011011832,1.1303887e-7,0.0051678205,0.00032751518,0.00016510807,0.59657145,0.000014036464,0.38901156],"study_design_scores_gemma":[0.00046168856,0.000064437474,0.008503845,0.000102377206,0.0000068510653,0.000008982052,0.00034979216,0.9588106,0.00032634303,0.031118354,0.00007988459,0.00016682618],"about_ca_topic_score_codex":0.000035391542,"about_ca_topic_score_gemma":0.000054337175,"teacher_disagreement_score":0.9584831,"about_ca_system_score_codex":0.00003397099,"about_ca_system_score_gemma":0.00011800794,"threshold_uncertainty_score":0.61017144},"labels":[],"label_agreement":null},{"id":"W2895734601","doi":"10.1007/s11128-020-02713-6","title":"Classical benchmarking of Gaussian Boson Sampling on the Titan supercomputer","year":2020,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"Xanadu Quantum Technologies (Canada)","funders":"","keywords":"Detector; Supercomputer; Computer science; Titan (rocket family); Photon; Gaussian; Photonics; Physics; Algorithm; Quantum computer; Sampling (signal processing); Parallel computing; Optics; Quantum; Quantum mechanics","score_opus":0.03748539786195969,"score_gpt":0.25134930326218136,"score_spread":0.21386390540022165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895734601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030015292,0.000023739109,0.9523709,0.0103918705,0.00017857082,0.00017582718,0.0000023985933,0.00021017551,0.0066312305],"genre_scores_gemma":[0.9817328,0.0000057135144,0.011597686,0.006554831,0.000080893464,0.000009583371,0.000011654033,0.000005595184,0.000001260356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983307,0.000034280572,0.0006841391,0.00014283022,0.00055286643,0.00025517584],"domain_scores_gemma":[0.9989833,0.00010300478,0.00035237166,0.00027561552,0.00016724874,0.00011846378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036186978,0.00016891275,0.00017715617,0.00017534485,0.00032385442,0.0005186365,0.00074595946,0.00007324944,0.00003231446],"category_scores_gemma":[0.00007167438,0.00011800719,0.000103468425,0.0008809549,0.00007186155,0.0038943526,0.00012654111,0.0002579513,0.00010928426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001761068,0.000022090313,0.00019087226,0.00017233774,0.000010776403,3.9782404e-7,0.011913736,0.000799254,0.00012606247,0.865283,0.0012953007,0.12016853],"study_design_scores_gemma":[0.00022794142,0.00014997259,0.00085557817,0.000118518234,0.000004324215,0.0000051181387,0.0007545419,0.9768072,0.0011047571,0.0034449722,0.016336402,0.00019072069],"about_ca_topic_score_codex":0.0000018552042,"about_ca_topic_score_gemma":1.306964e-7,"teacher_disagreement_score":0.9760079,"about_ca_system_score_codex":0.000022791162,"about_ca_system_score_gemma":0.00008430355,"threshold_uncertainty_score":0.50012237},"labels":[],"label_agreement":null},{"id":"W2902100733","doi":"10.1007/s11128-018-2133-1","title":"Non-Gaussian swapping of entangled resources","year":2018,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"Caprion (Canada)","funders":"","keywords":"Gaussian; Quantum entanglement; Teleportation; Computer science; Quantum teleportation; Quantum decoherence; Bell state; Protocol (science); Fidelity; Continuous variable; Topology (electrical circuits); Multipartite entanglement; Quantum computer; Statistical physics; Physics; Quantum mechanics; Quantum; Quantum channel; Squashed entanglement; Mathematics; Telecommunications; Mathematical optimization; Combinatorics","score_opus":0.008652111084899916,"score_gpt":0.23518692750439718,"score_spread":0.22653481641949727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902100733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12379063,0.000040945473,0.81550145,0.000344845,0.00029742537,0.00017142133,0.000002257919,0.00028406346,0.059566967],"genre_scores_gemma":[0.98772985,0.0000050202543,0.011390434,0.0007811511,0.00005405318,0.000010154628,0.000007833534,0.0000047434173,0.000016737096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837714,0.000017707443,0.0007619752,0.00011800293,0.00045200015,0.000273162],"domain_scores_gemma":[0.99851143,0.000018918206,0.0006192185,0.00033483177,0.00042461828,0.000090974514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004314719,0.00014867233,0.00017610546,0.0005387845,0.00033201955,0.00039682654,0.0006800844,0.000076227225,0.00005568286],"category_scores_gemma":[0.000040177005,0.00013273444,0.000074191805,0.0011778568,0.00014731128,0.0072338725,0.00012283493,0.000106934924,0.0002701366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082324426,0.000120225406,0.0020264229,0.0010745095,0.00005563469,0.0000014782325,0.14117786,0.00007096096,0.0023886291,0.34616363,0.0047912546,0.50204706],"study_design_scores_gemma":[0.0011086493,0.00032497113,0.0062298817,0.0003985236,0.000012481646,0.00003381845,0.004388319,0.8904868,0.02117531,0.008550132,0.066726,0.00056511903],"about_ca_topic_score_codex":0.000010217139,"about_ca_topic_score_gemma":0.0000010930171,"teacher_disagreement_score":0.89041585,"about_ca_system_score_codex":0.000022624463,"about_ca_system_score_gemma":0.000099020974,"threshold_uncertainty_score":0.5412753},"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":"W2962696906","doi":"10.1007/s11128-014-0828-5","title":"Classification of the entangled states of $$2 \\times L \\times M \\times N$$ 2 × L × M × N","year":2014,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"Institute of Particle Physics","funders":"","keywords":"LOCC; Quantum entanglement; State (computer science); Class (philosophy); Transformation (genetics); Physics; Quantum computer; W state; Cluster state; Matrix (chemical analysis); Quantum; Quantum state; Quantum mechanics; Scheme (mathematics); Combinatorics; Mathematics; Pure mathematics; Mathematical physics; Discrete mathematics; Computer science; Algorithm; Mathematical analysis; Materials science; Artificial intelligence","score_opus":0.008996717977539228,"score_gpt":0.2279527607175369,"score_spread":0.21895604273999766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962696906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09973677,0.00015435318,0.8635266,0.0018470361,0.00045602914,0.00047061205,0.000015119824,0.0003060321,0.033487465],"genre_scores_gemma":[0.99434036,0.000016657546,0.00514471,0.000400231,0.0000154848,0.000016332217,0.00002532709,0.0000060440675,0.00003485089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787116,0.000086780536,0.0010643259,0.000126351,0.00062154775,0.00022981573],"domain_scores_gemma":[0.9974232,0.0001009908,0.0013358,0.0005246497,0.00055549137,0.000059885053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067943824,0.0001766966,0.00024384151,0.00034049936,0.00024161662,0.0002372884,0.00093707314,0.000086527965,0.00005307921],"category_scores_gemma":[0.00014409205,0.00012691531,0.0001352867,0.001089094,0.00017652242,0.005195474,0.0001351507,0.0001298027,0.000040285668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020731006,0.000067701534,0.0019835057,0.0005477308,0.000023573006,2.9631252e-8,0.009834425,0.0007580726,0.00083396403,0.8775343,0.0021831247,0.10621289],"study_design_scores_gemma":[0.00053650513,0.00008773659,0.010847681,0.00018374107,0.000016420678,0.0000056049485,0.0015995018,0.92710984,0.01840958,0.030633695,0.010333788,0.00023590648],"about_ca_topic_score_codex":0.000012603428,"about_ca_topic_score_gemma":0.0000010058578,"teacher_disagreement_score":0.9263518,"about_ca_system_score_codex":0.000023502454,"about_ca_system_score_gemma":0.00014553085,"threshold_uncertainty_score":0.5175456},"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":"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":"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":"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":"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":"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":"W3031358418","doi":"10.1007/s11128-020-02686-6","title":"One-way LOCC indistinguishable lattice states via operator structures","year":2020,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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 Guelph; University of Waterloo","funders":"","keywords":"LOCC; Operator (biology); Lattice (music); Quantum computer; Quantum state; Computer science; Quantum; Algebra over a field; Mathematics; Theoretical physics; Discrete mathematics; Quantum mechanics; Pure mathematics; Physics","score_opus":0.01833254388855125,"score_gpt":0.2373475013799999,"score_spread":0.21901495749144867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031358418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024977418,0.000116878764,0.9653787,0.002004373,0.00021302023,0.00023833623,0.000011452666,0.00074566837,0.0063141775],"genre_scores_gemma":[0.9629136,0.000010970625,0.0260833,0.010810085,0.00007575008,0.000016971211,0.00007529584,0.000010002308,0.0000040384934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980081,0.000037436963,0.0007801111,0.00020104308,0.0005818792,0.00039146407],"domain_scores_gemma":[0.99853575,0.000037775677,0.00046311633,0.00026433927,0.00044139565,0.00025763264],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00027062194,0.00022425313,0.00022645961,0.0002260001,0.0004912522,0.0015672438,0.0008366215,0.00009660448,0.00007370322],"category_scores_gemma":[0.00015738381,0.0002178367,0.000068340094,0.001197049,0.00006340346,0.0098868925,0.00017909418,0.00026628058,0.000389358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057254285,0.00005843233,0.0006203002,0.0013404767,0.00005339055,0.0000033838767,0.060173128,0.004236831,0.0002571622,0.40570852,0.0041749817,0.52331614],"study_design_scores_gemma":[0.00049875135,0.00009656126,0.00090941833,0.000046910332,0.000008840633,0.0000093819735,0.0010637665,0.9585669,0.0020016553,0.011181561,0.025221186,0.00039505836],"about_ca_topic_score_codex":0.000013273086,"about_ca_topic_score_gemma":6.9036673e-7,"teacher_disagreement_score":0.9543301,"about_ca_system_score_codex":0.000032315224,"about_ca_system_score_gemma":0.00015647423,"threshold_uncertainty_score":0.9994692},"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":"W3104895302","doi":"10.1007/s11128-018-2091-7","title":"Improving the security of quantum key agreement protocols with single photon in both polarization and spatial-mode degrees of freedom","year":2018,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":33,"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; Wilfrid Laurier University","funders":"","keywords":"Computer science; Quantum key distribution; Photon; Quantum computer; Protocol (science); Polarization (electrochemistry); Quantum; Quantum cryptography; Physics; Key (lock); Quantum mechanics; Computer security; Quantum information; Chemistry","score_opus":0.012044073366041965,"score_gpt":0.24421269210286553,"score_spread":0.23216861873682357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104895302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24925981,0.000026894231,0.74743015,0.000093286995,0.000050154293,0.002346538,0.0000061136457,0.000055592787,0.0007314826],"genre_scores_gemma":[0.99188644,0.000002354233,0.0077442047,0.00009213452,0.000016770467,0.00024079514,0.000010480269,0.0000056858057,0.000001163891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981109,0.000058209065,0.00090271654,0.00014874717,0.00053723727,0.00024221223],"domain_scores_gemma":[0.9979655,0.00004072547,0.0011144839,0.0003372455,0.0004896891,0.00005236845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006794741,0.00017749409,0.00022809539,0.00038802408,0.0002102533,0.0002700931,0.0004477242,0.00007792774,0.0000075364787],"category_scores_gemma":[0.00007446077,0.00012489116,0.000035163168,0.0008947628,0.00027742708,0.0044118655,0.00012607197,0.0001399084,0.0000031354996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007597301,0.0007835083,0.04808452,0.0055687428,0.000077644785,0.0000014111004,0.20105238,0.003005127,0.01841794,0.45281157,0.00012861066,0.2693088],"study_design_scores_gemma":[0.00081450463,0.00054249633,0.009054207,0.0003789612,0.0000066800903,0.0000066063476,0.0013213764,0.9758292,0.010325651,0.0012951124,0.0002459699,0.00017924323],"about_ca_topic_score_codex":0.000795858,"about_ca_topic_score_gemma":0.00017852554,"teacher_disagreement_score":0.97282404,"about_ca_system_score_codex":0.000034461493,"about_ca_system_score_gemma":0.00018304533,"threshold_uncertainty_score":0.50929135},"labels":[],"label_agreement":null},{"id":"W312609692","doi":"10.1007/s11128-015-1024-y","title":"Projection methods for quantum channel construction","year":2015,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"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":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Projection (relational algebra); Semidefinite programming; Heuristics; Rank (graph theory); Quantum; Dimension (graph theory); Set (abstract data type); Linear programming; Mathematics; Computer science; Algorithm; Combinatorics; Discrete mathematics; Mathematical optimization; Quantum mechanics; Physics","score_opus":0.05114541861985054,"score_gpt":0.3287178893151219,"score_spread":0.27757247069527136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W312609692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008598377,0.00019667928,0.98613155,0.000051807765,0.0007885204,0.0003377929,0.000003305657,0.0014759343,0.0024160496],"genre_scores_gemma":[0.8085799,0.000020308351,0.19093534,0.00010245804,0.00014648167,0.00011987838,0.000059168506,0.000027522343,0.000008936981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922216,0.000022670376,0.00035071402,0.00008332875,0.000120301615,0.00020084428],"domain_scores_gemma":[0.9993145,0.000024871904,0.00012342364,0.000114104405,0.0003581211,0.00006497057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004008793,0.00014190606,0.00014792949,0.0002197455,0.00012412692,0.00016262743,0.00008094768,0.0001068666,0.0000016711253],"category_scores_gemma":[0.00011424904,0.00014099693,0.000041721658,0.0002432712,0.000033871092,0.0018854067,0.00001417796,0.00010867663,0.000012063535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088855566,0.000018912184,0.000029262508,0.0004401257,0.00003524802,3.0788073e-7,0.0048171463,0.020871826,0.0024771385,0.011886229,0.008122215,0.9512127],"study_design_scores_gemma":[0.00029084538,0.000054226595,0.000011230651,0.00007516784,0.000013693391,0.00003378493,0.001116641,0.9359068,0.021885574,0.017588891,0.02283476,0.0001883295],"about_ca_topic_score_codex":0.000007945134,"about_ca_topic_score_gemma":3.7381523e-7,"teacher_disagreement_score":0.9510244,"about_ca_system_score_codex":0.00008896926,"about_ca_system_score_gemma":0.000063871696,"threshold_uncertainty_score":0.5749688},"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":"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":"W3199972198","doi":"10.1007/s11128-021-03252-4","title":"Quantum contracts between Schrödinger and a cat","year":2021,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":24,"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":"Pacific Institute for the Mathematical Sciences","keywords":"Quantum computer; Quantum; Principal (computer security); Quantum information; Computer science; Information asymmetry; Commodity; Adverse selection; Quantum information science; Mathematical economics; Theoretical physics; Economics; Quantum mechanics; Physics; Computer security; Quantum entanglement; Microeconomics; Finance","score_opus":0.015596129227931138,"score_gpt":0.2624355094683716,"score_spread":0.24683938024044044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199972198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7462972,0.00016623612,0.24767454,0.0008909571,0.00010002789,0.00018973894,0.000062110295,0.00009497773,0.004524256],"genre_scores_gemma":[0.9986263,0.0000073635,0.0007411574,0.00019366138,0.00013706947,0.000034787616,0.00021688553,0.000011200436,0.000031556185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990147,0.000017356437,0.00039931096,0.00015040157,0.00017428983,0.00024395683],"domain_scores_gemma":[0.9992095,0.000045628192,0.00022813775,0.00016062355,0.00024187894,0.00011421314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018214542,0.00014421924,0.00018536758,0.000070305505,0.00036769078,0.00039171265,0.00008847101,0.000050110975,0.00010818559],"category_scores_gemma":[0.000020797323,0.00014246242,0.000043150427,0.0002602571,0.000031256503,0.0013763427,0.000056304772,0.000130869,0.00009526625],"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.0000037480584,0.000036099205,0.0029331846,0.00007537927,0.000026858688,5.551007e-7,0.0009883733,0.000006073817,0.0011640233,0.8887544,0.00033694628,0.105674334],"study_design_scores_gemma":[0.0019581344,0.00006532693,0.008486826,0.00035817575,0.0001617149,0.00002092033,0.0075748186,0.23715165,0.016560249,0.58150613,0.1450238,0.0011322744],"about_ca_topic_score_codex":0.000027094049,"about_ca_topic_score_gemma":5.7905874e-7,"teacher_disagreement_score":0.30724832,"about_ca_system_score_codex":0.000016560698,"about_ca_system_score_gemma":0.00019721349,"threshold_uncertainty_score":0.5809449},"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":"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":"W3211198860","doi":"10.1007/s11128-021-03308-5","title":"Quantum teleportation of a N-qubit entangled state by using a ($$N+1$$)-qubit cluster state","year":2021,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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 Calgary","funders":"","keywords":"Quantum teleportation; Cluster state; Qubit; Superdense coding; One-way quantum computer; Teleportation; Quantum channel; W state; Quantum mechanics; No-teleportation theorem; Physics; Topology (electrical circuits); Greenberger–Horne–Zeilinger state; Quantum computer; State (computer science); Quantum entanglement; Computer science; Quantum; Mathematics; Algorithm; Combinatorics","score_opus":0.01110675200425405,"score_gpt":0.245318950054387,"score_spread":0.23421219805013296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211198860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28442857,0.0002103485,0.71348715,0.00027179066,0.00026495653,0.00026118482,0.000034749457,0.00022103268,0.0008201956],"genre_scores_gemma":[0.9844891,0.0000564461,0.013562104,0.0015949742,0.000015853233,0.00002733359,0.00018609215,0.000018770874,0.000049344857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648815,0.00010080943,0.0017151816,0.00027368343,0.0009186904,0.00050349906],"domain_scores_gemma":[0.996679,0.00006331078,0.0014674715,0.00047900702,0.0011378166,0.00017336133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066103716,0.00031094786,0.00038586644,0.00051325845,0.0003330218,0.0008092972,0.0005017801,0.000103649756,0.000044034914],"category_scores_gemma":[0.00012287084,0.00031313018,0.000158922,0.00179707,0.00009289421,0.010922073,0.00016087008,0.00023861446,0.00006363498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004499675,0.0009433856,0.0038794198,0.0053244717,0.00038921167,0.000055138713,0.118415274,0.02228431,0.03752614,0.09622647,0.013421761,0.70108443],"study_design_scores_gemma":[0.0012561594,0.00008243501,0.0003459578,0.00019399179,0.000019786903,0.000096263684,0.0013970593,0.9502673,0.03173299,0.0069798483,0.007136594,0.00049162126],"about_ca_topic_score_codex":0.000041951247,"about_ca_topic_score_gemma":0.0000053400117,"teacher_disagreement_score":0.927983,"about_ca_system_score_codex":0.00009199651,"about_ca_system_score_gemma":0.0005858915,"threshold_uncertainty_score":0.99993205},"labels":[],"label_agreement":null},{"id":"W3212161141","doi":"10.1007/s11128-021-03295-7","title":"Infinitely repeated quantum games and strategic efficiency","year":2021,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":23,"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":"Pacific Institute for the Mathematical Sciences","keywords":"Repeated game; Nash equilibrium; Quantum entanglement; Quantum; Quantum pseudo-telepathy; Symmetric game; Game theory; Quantum discord; Dilemma","score_opus":0.01930692989201039,"score_gpt":0.2590026870449758,"score_spread":0.23969575715296543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212161141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.855077,0.00029934125,0.12271972,0.00044598783,0.00012445469,0.00020197974,0.0000443248,0.00015102315,0.020936137],"genre_scores_gemma":[0.99917984,0.000014338006,0.00032579404,0.00014916022,0.000053010655,0.000033118653,0.00019538353,0.000010401072,0.00003898236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989179,0.000021833806,0.00046511256,0.00017617327,0.0001750369,0.00024395433],"domain_scores_gemma":[0.9991451,0.000030952073,0.0002523547,0.00019412991,0.0002854173,0.00009203458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001802924,0.00015754839,0.00016215176,0.000089138375,0.00036155843,0.00043515814,0.00010042243,0.000047996047,0.00016919406],"category_scores_gemma":[0.000015153006,0.00015176166,0.000044430977,0.00045924532,0.000041077954,0.00091594754,0.000053054857,0.00016244332,0.00007929851],"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.000004331984,0.000051219817,0.0003026352,0.000072678486,0.000010146899,6.431868e-7,0.00073635735,0.000032234584,0.0007403692,0.97850925,0.00006480707,0.019475307],"study_design_scores_gemma":[0.0006610788,0.00005138216,0.00037917218,0.00013467194,0.0000357871,0.000017045899,0.008303136,0.45759296,0.004187441,0.52169156,0.0065004854,0.00044530595],"about_ca_topic_score_codex":0.000023386077,"about_ca_topic_score_gemma":5.539109e-7,"teacher_disagreement_score":0.45756072,"about_ca_system_score_codex":0.000012355082,"about_ca_system_score_gemma":0.0002311838,"threshold_uncertainty_score":0.6188661},"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":"W4205290842","doi":"10.1007/s11128-021-03378-5","title":"Theory of quantum games and quantum economic behavior","year":2021,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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 Saskatchewan","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Quantum; Quantum pseudo-telepathy; Quantum computer; Computer science; Quantum network; Physics; Quantum mechanics","score_opus":0.02639152010846511,"score_gpt":0.22985327314943857,"score_spread":0.20346175304097347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205290842","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9345845,0.0039207735,0.048194863,0.00026216928,0.0005931839,0.00019445075,0.0002534579,0.00006943981,0.011927173],"genre_scores_gemma":[0.9986382,0.00038984267,0.0004456886,0.00020445263,0.00004742178,0.000028752826,0.000059792605,0.000018984882,0.00016685792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982606,0.000017906908,0.001182306,0.00024235161,0.000029182216,0.00026761624],"domain_scores_gemma":[0.9986606,0.00006168059,0.0008441251,0.0002750104,0.00007494347,0.00008360606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007232654,0.00018007129,0.00045227376,0.00021200473,0.00015765602,0.00020537,0.00015581709,0.00012201124,0.00034701903],"category_scores_gemma":[0.00009675913,0.00021209016,0.00009307328,0.000104652434,0.00013374552,0.0022307322,0.00009153019,0.00013001559,0.00018350263],"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.000021936467,0.000027341044,0.0027231919,0.00018056216,0.000018567765,8.326382e-7,0.0019338633,0.00013176177,0.000023918576,0.9847622,0.00008850647,0.010087314],"study_design_scores_gemma":[0.0013282242,0.00010926516,0.008800021,0.00013406308,0.000038759925,0.00007057376,0.0063293646,0.17133452,0.0015789786,0.7852205,0.024310086,0.0007456576],"about_ca_topic_score_codex":0.000042045485,"about_ca_topic_score_gemma":0.000003125474,"teacher_disagreement_score":0.19954172,"about_ca_system_score_codex":0.000077196055,"about_ca_system_score_gemma":0.00011980901,"threshold_uncertainty_score":0.8648786},"labels":[],"label_agreement":null},{"id":"W4226490850","doi":"10.1007/s11128-022-03558-x","title":"State transfer on paths with weighted loops","year":2022,"lang":"en","type":"preprint","venue":"Quantum Information Processing","topic":"Neural Networks and Reservoir Computing","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Adjacency matrix; Vertex (graph theory); Combinatorics; Eigenvalues and eigenvectors; Transfer matrix; Path (computing); State (computer science); Transfer (computing); Mathematics; Sensitivity (control systems); Discrete mathematics; Algorithm; Physics; Computer science","score_opus":0.01440061401130692,"score_gpt":0.235037561835273,"score_spread":0.2206369478239661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226490850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092420034,0.00015934037,0.90164167,0.0008129915,0.0007387766,0.00046266668,0.000012892241,0.0005756785,0.0031759352],"genre_scores_gemma":[0.9910052,0.000044117798,0.007332584,0.0012366277,0.000087380526,0.00007546896,0.000107791406,0.000024171157,0.00008666934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757075,0.000086143555,0.0006542996,0.00039892996,0.0008480439,0.00044183093],"domain_scores_gemma":[0.9987077,0.00005482819,0.00034983523,0.0005654281,0.0002101253,0.000112083646],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040810966,0.00036053814,0.00031206923,0.00030718313,0.00060751196,0.0012744435,0.0012421495,0.00011223703,0.000026604801],"category_scores_gemma":[0.0000064524943,0.0002746395,0.00008928657,0.0005964838,0.000037993683,0.0019406935,0.00073550624,0.0011800894,0.000024995461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010045093,0.000086270324,0.000084286956,0.0011645551,0.000043584216,0.0000418498,0.00832848,0.35824323,0.000007325206,0.010452587,0.00048681718,0.62096053],"study_design_scores_gemma":[0.00034810067,0.00018397243,0.00011751045,0.00046692556,0.000007751282,0.00001859657,0.00009919417,0.9856318,0.0001371031,0.0039992747,0.008534511,0.00045522198],"about_ca_topic_score_codex":0.00001587203,"about_ca_topic_score_gemma":0.0000014602152,"teacher_disagreement_score":0.89858514,"about_ca_system_score_codex":0.00011013417,"about_ca_system_score_gemma":0.00039604114,"threshold_uncertainty_score":0.99997056},"labels":[],"label_agreement":null},{"id":"W4282935929","doi":"10.1007/s11128-022-03539-0","title":"Double controlled quantum phase gate based on three atoms trapped in separate optical cavities","year":2022,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"Physics; Hamiltonian (control theory); Excitation; Controlled NOT gate; Quantum gate; Optical fiber; Quantum computer; Atomic physics; Photon; Molecular physics; Quantum; Quantum mechanics; Optics","score_opus":0.019246192690814404,"score_gpt":0.27569133968446924,"score_spread":0.25644514699365484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282935929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37733215,0.00008854032,0.6028882,0.0017752161,0.00065771583,0.0012717646,0.000025265865,0.00071080495,0.015250276],"genre_scores_gemma":[0.9956474,0.0000034780685,0.0010928184,0.002658683,0.000019757032,0.0004626977,0.000088203065,0.000013001592,0.000014011039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966337,0.000101386875,0.0013081256,0.0002686101,0.0010873321,0.0006008219],"domain_scores_gemma":[0.9984597,0.00012014004,0.0006169735,0.0004589516,0.00018243484,0.00016177417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013982683,0.0003318892,0.00047399232,0.0012003959,0.00082816335,0.0008676214,0.00088118983,0.00008613029,0.00012093009],"category_scores_gemma":[0.00003668028,0.00031087396,0.0001873524,0.0017527211,0.000094283125,0.005332839,0.00014438202,0.00052974693,0.00011398976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039243572,0.0007469554,0.00018939501,0.0002861216,0.000030125602,0.000019814845,0.008838256,0.07990018,0.00007384574,0.8555505,0.00080017745,0.04964022],"study_design_scores_gemma":[0.018704807,0.0004686454,0.00016212468,0.000050220024,0.000008749692,0.00001556618,0.0010565143,0.9688219,0.00026599364,0.004756961,0.0052854978,0.00040304477],"about_ca_topic_score_codex":0.000021822249,"about_ca_topic_score_gemma":0.000005581467,"teacher_disagreement_score":0.8889217,"about_ca_system_score_codex":0.00015729017,"about_ca_system_score_gemma":0.0004488723,"threshold_uncertainty_score":0.9999343},"labels":[],"label_agreement":null},{"id":"W4307434441","doi":"10.1007/s11128-022-03712-5","title":"A new post-quantum multivariate polynomial public key encapsulation algorithm","year":2022,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"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; Quantropi (Canada)","funders":"","keywords":"Univariate; Mathematics; Irreducible polynomial; Polynomial; Finite field; Cryptosystem; Discrete mathematics; Public-key cryptography; Multivariate statistics; Matrix polynomial; Algorithm; Cryptography; Computer science; Encryption; Statistics; Mathematical analysis","score_opus":0.014076099941054276,"score_gpt":0.23242338599106852,"score_spread":0.21834728605001424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307434441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012654529,0.000085839645,0.9829177,0.0018504817,0.00075969106,0.00020380584,0.000013030447,0.00053749635,0.0009774019],"genre_scores_gemma":[0.9547913,0.0000018434274,0.043695696,0.0012443525,0.00009308106,0.00004105061,0.00008256231,0.000010241549,0.000039884882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812496,0.00012709803,0.0005433086,0.00023354833,0.0005837443,0.0003873599],"domain_scores_gemma":[0.9988187,0.000052183088,0.0004296533,0.000335946,0.00020988207,0.00015364237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082054513,0.00018675411,0.00015741723,0.0005881523,0.0012388236,0.001000501,0.00086472835,0.000054768687,0.00013931376],"category_scores_gemma":[0.00008594144,0.00019642602,0.00009798482,0.0013544864,0.000027819953,0.007944746,0.0004263127,0.0003006893,0.00006535891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023392637,0.000039143462,0.000043379365,0.000025704729,0.0000112937105,0.0000016906973,0.008878423,0.00038397542,0.0003225675,0.19464056,0.000860331,0.7947695],"study_design_scores_gemma":[0.0007786075,0.00018274046,0.0009412028,0.000015463856,0.000007816018,0.000056973364,0.00088240876,0.93005264,0.00017833701,0.019474875,0.047066174,0.00036276624],"about_ca_topic_score_codex":0.00006139033,"about_ca_topic_score_gemma":7.199317e-7,"teacher_disagreement_score":0.94213676,"about_ca_system_score_codex":0.00010366706,"about_ca_system_score_gemma":0.00049387873,"threshold_uncertainty_score":0.9647854},"labels":[],"label_agreement":null},{"id":"W4317215089","doi":"10.1007/s11128-022-03806-0","title":"Quantum extensive-form games","year":2023,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Game Theory and Applications","field":"Decision Sciences","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 Saskatchewan","funders":"Office of Science; Pacific Institute for the Mathematical Sciences","keywords":"Quantum pseudo-telepathy; Computer science; Quantum computer; Combinatorial game theory; Quantum; Quantum algorithm; Theoretical computer science; Mathematical economics; Sequential game; Quantum network; Mathematics; Game theory; Quantum mechanics; Physics","score_opus":0.09563826890643594,"score_gpt":0.3818490415214261,"score_spread":0.28621077261499017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317215089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8834989,0.000092722024,0.07771536,0.004887938,0.0005623207,0.0004597253,0.00004075854,0.0011792659,0.031563014],"genre_scores_gemma":[0.9976823,0.000014632767,0.00025729663,0.0008856895,0.00006430333,0.000055848366,0.00004970031,0.000009798572,0.0009804479],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727714,0.000058489233,0.0009913156,0.00022882422,0.0010753565,0.0003688901],"domain_scores_gemma":[0.9976562,0.00044970118,0.0005209053,0.0004846387,0.00076449756,0.00012402044],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026889814,0.00016113419,0.00022355076,0.00063630886,0.0006300734,0.00084510277,0.0006564517,0.00008773446,0.00027288366],"category_scores_gemma":[0.0020902043,0.00012329023,0.000090366535,0.0027131885,0.00013526731,0.004422239,0.00012871486,0.0001667306,0.014477059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038812024,0.00002757752,0.0004540874,0.000055546167,0.000007677064,0.0000021873134,0.010249175,0.0008518945,0.0005500037,0.3414816,0.03200827,0.6142732],"study_design_scores_gemma":[0.0002825807,0.000034025543,0.008291402,0.000045913417,0.000008295889,0.000020078147,0.013694129,0.25173503,0.00074059336,0.5289802,0.1958911,0.00027665767],"about_ca_topic_score_codex":0.000004581021,"about_ca_topic_score_gemma":0.0000010163474,"teacher_disagreement_score":0.6139965,"about_ca_system_score_codex":0.000028936092,"about_ca_system_score_gemma":0.00013577458,"threshold_uncertainty_score":0.9862903},"labels":[],"label_agreement":null},{"id":"W4366368346","doi":"10.1007/s11128-023-03919-0","title":"Cryptanalysis of three quantum money schemes","year":2023,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Coding theory and cryptography","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum computer; Quantum algorithm; Qubit; Cryptanalysis; Polynomial; Quantum state; Hash function; Discrete mathematics; Computer science; Time complexity; Mathematics; Quantum; Cryptography; Algorithm; Quantum mechanics; Physics","score_opus":0.022040859558914275,"score_gpt":0.2530147459980161,"score_spread":0.23097388643910183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366368346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18851145,0.00009789992,0.8088368,0.000380662,0.00013476975,0.00007542619,0.0000027074968,0.00054803916,0.0014122328],"genre_scores_gemma":[0.99517065,0.000015322097,0.0046187467,0.0001415642,0.000015745441,0.0000123067975,0.00001288344,0.0000048339384,0.000007947728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868214,0.000026048416,0.0005118741,0.00013779668,0.0003973368,0.0002448074],"domain_scores_gemma":[0.9989396,0.0000633157,0.00034669702,0.00036071916,0.00023045983,0.000059245645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006787305,0.00012470192,0.000184192,0.00067116495,0.00024514034,0.0002509329,0.0006365478,0.00005868477,0.000015788139],"category_scores_gemma":[0.00010843226,0.00011422697,0.00011425874,0.0029150953,0.00006288982,0.0037750108,0.00016008307,0.000103234095,0.00014199379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013726714,0.00002044087,0.0015331258,0.00022567192,0.000031626292,0.0000010872686,0.0027380644,0.0005122724,0.0004279029,0.8150922,0.00033847234,0.17906539],"study_design_scores_gemma":[0.00018526375,0.000042057796,0.0023824975,0.000070949834,0.0000149622,0.0000029789771,0.00038587966,0.85512805,0.0016162818,0.13690647,0.0030835064,0.00018111973],"about_ca_topic_score_codex":0.0000055462615,"about_ca_topic_score_gemma":0.000001369816,"teacher_disagreement_score":0.85461575,"about_ca_system_score_codex":0.000013122513,"about_ca_system_score_gemma":0.000081900675,"threshold_uncertainty_score":0.46580404},"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":"W4385986289","doi":"10.1007/s11128-023-04064-4","title":"Homomorphic polynomial public key encapsulation over two hidden rings for quantum-safe key encapsulation","year":2023,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Polynomial and algebraic computation","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":"Quantropi (Canada)","funders":"","keywords":"Homomorphic encryption; Key encapsulation; Public-key cryptography; Computer science; Polynomial; Mathematics; Discrete mathematics; Encryption; Theoretical computer science; Key distribution; Computer security","score_opus":0.02727344498869097,"score_gpt":0.278034634753339,"score_spread":0.250761189764648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385986289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3774514,0.000049324386,0.6167391,0.002333889,0.000999467,0.0005788624,0.0000152554485,0.001298907,0.0005338283],"genre_scores_gemma":[0.9925433,0.000008644395,0.0060953093,0.0005060801,0.00034687296,0.0001161785,0.00028572063,0.000027241987,0.0000706695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715334,0.00006530494,0.0010453854,0.00039934294,0.00068153354,0.0006550881],"domain_scores_gemma":[0.9980425,0.00017923089,0.0007714256,0.0003605538,0.0004672429,0.00017901088],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001029518,0.00031485697,0.00029099986,0.000869791,0.0008405709,0.0015447458,0.0006897084,0.00015275556,0.00002115558],"category_scores_gemma":[0.00033415898,0.0003209205,0.00013621249,0.0017331726,0.000064690525,0.0119730495,0.00021922209,0.00020402251,0.0004069631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008638325,0.000080286314,0.0007769753,0.00045811493,0.000040353505,0.0000028411312,0.013893451,0.005679794,0.0029448813,0.2962281,0.006599343,0.6732095],"study_design_scores_gemma":[0.0012878887,0.00008200099,0.008780633,0.00007884081,0.000011824881,0.0000134691,0.00015685316,0.952927,0.0006527174,0.02509281,0.010496897,0.00041908788],"about_ca_topic_score_codex":0.00006156291,"about_ca_topic_score_gemma":0.0000066800208,"teacher_disagreement_score":0.9472472,"about_ca_system_score_codex":0.00019090777,"about_ca_system_score_gemma":0.000432916,"threshold_uncertainty_score":0.9999243},"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":"W4387091563","doi":"10.1007/s11128-023-04106-x","title":"Optimal control theory techniques for nitrogen vacancy ensembles in single crystal diamond","year":2023,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Diamond and Carbon-based Materials Research","field":"Materials 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; Canada First Research Excellence Fund","keywords":"Diamond; Magnetometer; Quantum computer; Quantum sensor; Vacancy defect; Initialization; Microwave; Sensitivity (control systems); Magnetic field; Coherent control; Nitrogen-vacancy center; Physics; Quantum; Spin (aerodynamics); Materials science; Optoelectronics; Condensed matter physics; Computer science; Quantum network; Quantum mechanics; Electronic engineering; Engineering","score_opus":0.01700058051071849,"score_gpt":0.27727914643584933,"score_spread":0.2602785659251308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387091563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9674189,0.00009768697,0.029926326,0.00012791042,0.00015181211,0.00062162883,0.00012983108,0.00045626803,0.0010696078],"genre_scores_gemma":[0.9976588,0.000009643908,0.0015125951,0.00017147555,0.000081480925,0.00042132413,0.00009334378,0.00001992397,0.000031433974],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99834883,0.00008353704,0.0005436643,0.00017320552,0.00033097118,0.0005198134],"domain_scores_gemma":[0.99920124,0.00018942745,0.000193774,0.00014507516,0.00019557579,0.00007492689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017580739,0.00016136358,0.000232507,0.0003739327,0.00020482218,0.0005141166,0.00024298721,0.00010493767,0.0000778105],"category_scores_gemma":[0.00034141206,0.00014449771,0.00005258314,0.00038525063,0.000081713915,0.0018872275,0.0000541573,0.000078393496,0.00009616571],"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.0004938779,0.00006543483,0.00018226437,0.00081605586,0.0000052919295,0.000004253655,0.0018717926,0.0006189451,0.9529571,0.0037862933,0.0005513286,0.038647342],"study_design_scores_gemma":[0.0012586096,0.00023790522,0.00014134738,0.0002519449,0.000012999663,0.0000055368355,0.0019346575,0.026823621,0.94671345,0.019018758,0.0032246073,0.00037653974],"about_ca_topic_score_codex":0.000018390872,"about_ca_topic_score_gemma":0.0000030761144,"teacher_disagreement_score":0.0382708,"about_ca_system_score_codex":0.00007603351,"about_ca_system_score_gemma":0.00020219981,"threshold_uncertainty_score":0.58924454},"labels":[],"label_agreement":null},{"id":"W4388457356","doi":"10.1007/s11128-023-04156-1","title":"Quantum blockchain-enabled exchange protocol model for decentralized systems","year":2023,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Blockchain Technology Applications and Security","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 Waterloo","funders":"","keywords":"Computer science; Quantum computer; Computer security; Cryptography; Cryptocurrency; Protocol (science); Blockchain; Key exchange; Interoperability; Distributed computing; Computer network; Encryption; Public-key cryptography; Quantum","score_opus":0.03039739816706622,"score_gpt":0.293359885180464,"score_spread":0.2629624870133978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388457356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027039328,0.000034185152,0.96533126,0.0011543586,0.00012502493,0.028335184,0.000015921807,0.0020759187,0.000224227],"genre_scores_gemma":[0.7075511,0.000012487734,0.017931268,0.00043142997,0.000056868827,0.2737079,0.000072958006,0.00002995977,0.00020602836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807817,0.000028291624,0.0007050213,0.00028643114,0.00032879694,0.00057329],"domain_scores_gemma":[0.99843633,0.00006156895,0.00044019322,0.00053702045,0.00042515135,0.00009974609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092805346,0.00021601762,0.00025267425,0.00046267032,0.000673607,0.00048780098,0.0008859899,0.00022037605,0.000002853028],"category_scores_gemma":[0.00010000587,0.00020061983,0.00007217779,0.0013712964,0.000057610032,0.0012953073,0.00019108376,0.00017401666,0.00009331719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004298129,0.0000771086,0.000030321924,0.0019663344,0.000018395362,0.0000010513611,0.0056335693,0.022382924,0.00015223918,0.9078471,0.0069620656,0.054885905],"study_design_scores_gemma":[0.00091938203,0.000037291917,0.000013483657,0.0000672756,0.0000051956185,0.000008260232,0.00025135485,0.94030285,0.00024509875,0.03233626,0.02557146,0.00024211594],"about_ca_topic_score_codex":0.000010208545,"about_ca_topic_score_gemma":0.0000014903387,"teacher_disagreement_score":0.9474,"about_ca_system_score_codex":0.00007476578,"about_ca_system_score_gemma":0.00022307689,"threshold_uncertainty_score":0.8181039},"labels":[],"label_agreement":null},{"id":"W4390869466","doi":"10.1007/s11128-023-04227-3","title":"Generation of a hybrid W entangled state of three photonic qubits with different encodings","year":2024,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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 Calgary","funders":"National Natural Science Foundation of China","keywords":"Qubit; Quantum computer; W state; Physics; Quantum mechanics; Photonics; One-way quantum computer; Cluster state; State (computer science); Computer science; Quantum; Quantum error correction; Algorithm","score_opus":0.022411367739165876,"score_gpt":0.2376964098332848,"score_spread":0.21528504209411892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390869466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44275713,0.00015608156,0.55604404,0.000070557624,0.00011317207,0.00014432249,0.0000073359424,0.00012612976,0.00058123],"genre_scores_gemma":[0.9964536,0.00003165859,0.0033322787,0.00010369925,0.000011724341,0.000022904858,0.000032825777,0.0000063924226,0.000004918968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983615,0.000016913955,0.0007657578,0.00012945714,0.00053239067,0.0001939436],"domain_scores_gemma":[0.99893886,0.000028333801,0.00043863067,0.00022570077,0.0003102078,0.00005828048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002730936,0.00016532427,0.00020797207,0.0005227065,0.00009877209,0.00036788656,0.00033429955,0.0000250378,0.000015069745],"category_scores_gemma":[0.000014761506,0.00012294845,0.00007407319,0.0007752361,0.000067285524,0.005687957,0.00005728739,0.00011648627,0.00001379136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009940408,0.00014555444,0.0007537662,0.004314303,0.00013353562,0.0000057302486,0.027918316,0.0028293575,0.013562075,0.28497404,0.000572133,0.6646918],"study_design_scores_gemma":[0.00029027314,0.00015489405,0.000317922,0.0003122037,0.000011618566,0.000026554544,0.00011179776,0.8941343,0.10088467,0.00301958,0.0005764836,0.0001597407],"about_ca_topic_score_codex":0.00000894552,"about_ca_topic_score_gemma":0.000005531312,"teacher_disagreement_score":0.8913049,"about_ca_system_score_codex":0.000037213107,"about_ca_system_score_gemma":0.00019095802,"threshold_uncertainty_score":0.5013692},"labels":[],"label_agreement":null},{"id":"W4392293383","doi":"10.1007/s11128-024-04291-3","title":"A note on the stabilizer formalism via noncommutative graphs","year":2024,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Advanced Operator Algebra Research","field":"Mathematics","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":"Noncommutative geometry; Formalism (music); Quantum computer; Computer science; Physics; Mathematical physics; Mathematics; Algebra over a field; Quantum mechanics; Pure mathematics; Quantum","score_opus":0.04654257638935559,"score_gpt":0.37317975258160363,"score_spread":0.326637176192248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392293383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23450631,0.00039355177,0.72707057,0.0057518226,0.00051626377,0.0016955817,0.00005132072,0.001160121,0.028854482],"genre_scores_gemma":[0.99533796,0.000010563564,0.0037650105,0.00059866946,0.000036282945,0.00013365311,0.000015929683,0.000029478499,0.00007244682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827564,0.00007896406,0.00051636854,0.00013484046,0.0006432526,0.00035090846],"domain_scores_gemma":[0.9983957,0.0008463299,0.00012620316,0.00029272638,0.00027055482,0.000068486435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009600025,0.00019865524,0.0001641237,0.00025106574,0.00047083278,0.000572577,0.00029341248,0.00008089444,0.00014579752],"category_scores_gemma":[0.00060707587,0.00012240857,0.00007957373,0.0007526847,0.00012530749,0.0034788176,0.000082052844,0.0005511862,0.00040645775],"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.00005588711,0.00003561775,0.0000062137838,0.00091027026,0.000025319338,0.000004908553,0.032248218,0.000105253304,0.0002245386,0.8602098,0.0015799752,0.10459398],"study_design_scores_gemma":[0.00026057631,0.00012240042,0.00001632904,0.00044927915,0.000017636441,0.0000251654,0.0035315459,0.3086267,0.004323744,0.67166185,0.010691784,0.00027299448],"about_ca_topic_score_codex":0.0000038266794,"about_ca_topic_score_gemma":0.000002919856,"teacher_disagreement_score":0.76083165,"about_ca_system_score_codex":0.00014219411,"about_ca_system_score_gemma":0.00018806779,"threshold_uncertainty_score":0.5521373},"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":"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":"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":"W4404051127","doi":"10.1007/s11128-024-04574-9","title":"A generalization of quantum pair state transfer","year":2024,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Information and Cryptography","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":"Brandon University; University of Manitoba; York University","funders":"Canada Foundation for Innovation; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Fields Institute for Research in Mathematical Sciences","keywords":"Generalization; Quantum computer; Quantum; Transfer (computing); State (computer science); Computer science; Physics; Quantum mechanics; Mathematics; Algorithm; Parallel computing; Mathematical analysis","score_opus":0.010637859229585168,"score_gpt":0.23640139585146808,"score_spread":0.22576353662188292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404051127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029490486,0.00042291055,0.966753,0.0005049977,0.00042025268,0.00017729208,0.000011904556,0.0006791739,0.0015399654],"genre_scores_gemma":[0.9955393,0.000059877675,0.0037562835,0.00052087253,0.000022298684,0.000023579545,0.0000482264,0.000009752134,0.000019800718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981136,0.000038032456,0.0009040036,0.00015441343,0.0005193043,0.00027064624],"domain_scores_gemma":[0.9991805,0.000032579675,0.00013735512,0.00025892514,0.00030454894,0.00008611257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005077453,0.0001844898,0.0001816898,0.00071194815,0.00015994467,0.0007809361,0.0004403164,0.00007578312,0.000031870946],"category_scores_gemma":[0.000023597539,0.00016215837,0.00011820963,0.0016305886,0.000050403767,0.010888795,0.00004524004,0.0001461843,0.0001318405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009791132,0.000021701566,0.00006163835,0.0010032537,0.000018276613,0.0000012251571,0.013482016,0.0015959585,0.00033979255,0.7925957,0.0010711829,0.18979946],"study_design_scores_gemma":[0.00020443626,0.000061653234,0.00021147753,0.0001929439,0.000007425269,0.00001645571,0.00024909226,0.9526864,0.0042203935,0.015000706,0.026933895,0.00021511783],"about_ca_topic_score_codex":0.000010757161,"about_ca_topic_score_gemma":6.408658e-7,"teacher_disagreement_score":0.96604884,"about_ca_system_score_codex":0.00003278507,"about_ca_system_score_gemma":0.00023824413,"threshold_uncertainty_score":0.78941137},"labels":[],"label_agreement":null},{"id":"W4408274857","doi":"10.1007/s11128-025-04674-0","title":"Quantum-assisted support vector regression","year":2025,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Spectroscopy Techniques in Biomedical and Chemical Research","field":"Biochemistry, Genetics and Molecular Biology","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 Calgary","funders":"Government of Alberta","keywords":"Quantum computer; Support vector machine; Computer science; Quantum; Regression; Artificial intelligence; Physics; Mathematics; Quantum mechanics; Statistics","score_opus":0.011907288240583973,"score_gpt":0.3365616588744553,"score_spread":0.32465437063387137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408274857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5236348,0.0015284732,0.3164143,0.0054172934,0.00088000664,0.0009468834,0.000051538394,0.00062196434,0.15050474],"genre_scores_gemma":[0.99587494,0.00011287449,0.0013839137,0.0011313837,0.00006602623,0.000050692237,0.00035494776,0.000008124337,0.0010170684],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988567,0.000022102986,0.0003732074,0.00017457812,0.00028745862,0.00028594123],"domain_scores_gemma":[0.9993594,0.000012329821,0.000114839,0.00023193982,0.0001923854,0.00008908356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026159757,0.00013939182,0.00012790106,0.00012486534,0.00017347248,0.00009774282,0.0002746397,0.00022083527,0.00008528466],"category_scores_gemma":[0.00033498864,0.00011049739,0.00006132593,0.00034035262,0.0001347641,0.000039795636,0.00015215541,0.00017784454,0.000032021],"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.0003374717,0.00011942178,0.0005621079,0.0005587069,0.00003017541,0.000002156651,0.00010528428,0.0000010619917,0.74135625,0.0073651625,0.105009,0.14455321],"study_design_scores_gemma":[0.00042366478,0.00017316484,0.0006824554,0.00017812556,0.000009199703,0.000010066832,0.00011653569,0.0024150936,0.62880254,0.001827063,0.36516812,0.00019394359],"about_ca_topic_score_codex":0.0000046420287,"about_ca_topic_score_gemma":4.447465e-7,"teacher_disagreement_score":0.47224015,"about_ca_system_score_codex":0.000044002463,"about_ca_system_score_gemma":0.00026971783,"threshold_uncertainty_score":0.4505953},"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}]}