{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.991931,0.00006529606,0.004574825,0.000121216974,0.000012958251,0.000013455957,0.000024639126,0.00009271789,0.003163793],"genre_scores_gemma":[0.996407,0.000034612192,0.0024985506,0.000014969788,0.0000044404655,0.0000053625463,0.000028435747,0.000014109456,0.0009926718],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998884,0.000020158413,0.0000034217164,0.000019364796,0.00004044381,0.000028169137],"domain_scores_gemma":[0.99948823,0.00029390736,0.00003099797,0.000056488792,0.00010223562,0.000028113833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003107361,0.00014543551,0.00025734873,0.00014087746,0.0003500603,0.00048736724,0.00060614763,0.00034996754,0.0037476649],"category_scores_gemma":[0.0016368732,0.00013709792,0.00009341741,0.00031619865,0.00030963452,0.00081214716,0.00022302858,0.00041397088,0.00029592944],"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.0051087486,0.0009892032,0.012547042,0.0003708826,0.0001520712,0.0007390181,0.00053051725,0.27386552,0.5881427,0.03932625,0.0022935027,0.07593456],"study_design_scores_gemma":[0.0000747833,0.0013473644,0.0028787267,0.0000064444885,0.000053871885,0.00009302476,0.0001430628,0.8263765,0.16532482,0.0025724072,0.0011131298,0.000015893971],"about_ca_topic_score_codex":0.0010293165,"about_ca_topic_score_gemma":0.00084518705,"teacher_disagreement_score":0.0037476649,"about_ca_system_score_codex":0.00034172254,"about_ca_system_score_gemma":0.00056801096,"threshold_uncertainty_score":0.012537241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33579797,0.0045311884,0.5446426,0.011907304,0.0011964956,0.0000888392,0.00013648506,0.0003217207,0.1013774],"genre_scores_gemma":[0.946824,0.0006566803,0.044988833,0.00061286497,0.0005692684,0.00006126811,0.0000664505,0.000051483858,0.006169008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981243,0.0008325514,0.00007463395,0.00023496588,0.000560278,0.00017327198],"domain_scores_gemma":[0.9969874,0.0019160821,0.00014028311,0.00048795855,0.00026028077,0.00020799239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023703182,0.00039442012,0.0014435236,0.00093635154,0.0021525116,0.0042262203,0.0014283995,0.0028822045,0.0037877169],"category_scores_gemma":[0.008908886,0.0005213853,0.00091054355,0.0012104373,0.0062220027,0.008221438,0.003262499,0.0038603551,0.00039165645],"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.000028448207,0.000019063884,0.000047274007,0.000015466772,0.000005878552,0.000019618941,0.000055153865,0.0040243594,0.000268915,0.9932073,0.00033021765,0.0019783538],"study_design_scores_gemma":[0.000008048676,0.000005282681,0.000015475423,0.0000026521348,0.0000014258362,0.000010193506,0.000008965,0.01788576,0.00012243279,0.981703,0.00023225084,0.0000045449224],"about_ca_topic_score_codex":0.00067432644,"about_ca_topic_score_gemma":0.0005324216,"teacher_disagreement_score":0.0042262203,"about_ca_system_score_codex":0.0011868728,"about_ca_system_score_gemma":0.00088738545,"threshold_uncertainty_score":0.012671232},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115324005,0.0045601935,0.34879637,0.009678509,0.0020728065,0.00016273856,0.00036185305,0.00038977977,0.5186538],"genre_scores_gemma":[0.8311913,0.004479747,0.07696182,0.002078064,0.0024917526,0.00024136146,0.00030894869,0.0004609239,0.081786044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999461,0.00013046445,0.000035120564,0.000078778,0.00020273516,0.0000918094],"domain_scores_gemma":[0.9996012,0.00013373051,0.0000476305,0.00009018042,0.000068040084,0.000059174825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006763805,0.0012547941,0.00086665497,0.0021874844,0.0017434368,0.003073775,0.0012415957,0.0019333344,0.009615285],"category_scores_gemma":[0.0011808027,0.00055755343,0.0010528939,0.0013080231,0.0063700285,0.00930555,0.0026824893,0.0036087963,0.0012861767],"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.0000046567707,0.000002536018,0.0000041378457,0.000008761273,0.0000014587034,0.0000093571425,0.000023026903,0.00016741305,0.00019974294,0.99841917,0.00021664961,0.0009431342],"study_design_scores_gemma":[0.000005500678,0.000011270245,0.000023699547,0.0000054387865,0.000002034341,0.000035275905,0.000022725564,0.0010325337,0.00023633182,0.99587005,0.0027471727,0.000007918377],"about_ca_topic_score_codex":0.00045627978,"about_ca_topic_score_gemma":0.00033034763,"teacher_disagreement_score":0.009615285,"about_ca_system_score_codex":0.0010922452,"about_ca_system_score_gemma":0.00057955564,"threshold_uncertainty_score":0.032166302},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48613158,0.0020090425,0.3707791,0.019531125,0.0003168585,0.00037680918,0.0012746645,0.0011207003,0.11846014],"genre_scores_gemma":[0.97983575,0.00042199815,0.012417199,0.00033767318,0.00016469798,0.00011423582,0.00005856442,0.00015175497,0.0064981133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940743,0.0026532924,0.00020760689,0.0005516417,0.0010833017,0.0014298506],"domain_scores_gemma":[0.90049607,0.08817231,0.0021465926,0.0046727336,0.002273161,0.0022391048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012049339,0.001524639,0.0026993372,0.0028253335,0.0037515818,0.009130153,0.0031832051,0.0065299226,0.021435801],"category_scores_gemma":[0.047762908,0.0017962594,0.0011296404,0.002421895,0.008431913,0.0139412815,0.0053351247,0.00409758,0.0014235433],"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.0014876437,0.00019305086,0.0004071109,0.00022834976,0.000059307848,0.00021950029,0.00028575835,0.106842905,0.0040600025,0.8726184,0.0034288499,0.010169104],"study_design_scores_gemma":[0.00015662388,0.00009902422,0.00020626812,0.00005261781,0.00004536094,0.00015831136,0.00014659401,0.29006803,0.0012072321,0.70709866,0.00069324713,0.000067943365],"about_ca_topic_score_codex":0.00127662,"about_ca_topic_score_gemma":0.0013869195,"teacher_disagreement_score":0.021435801,"about_ca_system_score_codex":0.005525886,"about_ca_system_score_gemma":0.0029898437,"threshold_uncertainty_score":0.07170987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2694433,0.0006221387,0.7149702,0.0013969555,0.00027865823,0.00012557213,0.00013710356,0.00076814165,0.012257969],"genre_scores_gemma":[0.86051583,0.00036249953,0.13473439,0.00019910227,0.0001317117,0.00016721015,0.00009705886,0.00016754473,0.0036245703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939716,0.00020762662,0.000038457096,0.00005342167,0.00023176477,0.000071616705],"domain_scores_gemma":[0.9967068,0.001653821,0.00023890464,0.00075888564,0.000526104,0.00011548047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096864335,0.00037148918,0.0005142071,0.000569349,0.0008266947,0.0010094753,0.00078125217,0.00077619427,0.0018291563],"category_scores_gemma":[0.0061520385,0.00026600802,0.00028140342,0.00059967133,0.0014423096,0.0011352845,0.00085486355,0.001132261,0.00032394505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025811192,0.00009184475,0.00060001435,0.0001569461,0.000023048173,0.0000683027,0.00026420038,0.098211676,0.025746817,0.81662565,0.0025601513,0.05539325],"study_design_scores_gemma":[0.00010475148,0.00014218267,0.00021899676,0.000050712988,0.000042108593,0.000071117676,0.000051636387,0.6328464,0.038692538,0.32076982,0.0069748093,0.00003494136],"about_ca_topic_score_codex":0.0011076835,"about_ca_topic_score_gemma":0.002681525,"teacher_disagreement_score":0.0018291563,"about_ca_system_score_codex":0.0006988028,"about_ca_system_score_gemma":0.0015213338,"threshold_uncertainty_score":0.006119132},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2440371,0.011485239,0.2606507,0.031388428,0.0050495155,0.00014898245,0.0007333918,0.0006320427,0.4458746],"genre_scores_gemma":[0.9137813,0.0025232928,0.025543127,0.0027524952,0.004254169,0.0001557216,0.00034009872,0.00021575582,0.050434034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859697,0.000429746,0.000072454684,0.00022031285,0.00043175474,0.00024869142],"domain_scores_gemma":[0.9974771,0.0011494294,0.00022577854,0.0003534016,0.0005142846,0.00027993132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027301086,0.00051373267,0.0011415102,0.0021494422,0.0027797613,0.0049240314,0.0013927885,0.0027711634,0.006220305],"category_scores_gemma":[0.0071179974,0.0004346206,0.0011737831,0.0017802132,0.0062682,0.0074733975,0.0016003174,0.0046027205,0.0009166831],"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.000009335093,0.000011685081,0.000031009557,0.0000062237036,0.0000014557824,0.000011932128,0.00006210331,0.00016542147,0.00010907165,0.99788046,0.00056123885,0.0011502577],"study_design_scores_gemma":[0.0000056966637,0.0000034328143,0.000055987126,0.0000023637733,0.0000010204286,0.0000102618105,0.000010648311,0.0018034979,0.000057487916,0.9969133,0.0011315423,0.000004852526],"about_ca_topic_score_codex":0.0035605324,"about_ca_topic_score_gemma":0.0018379417,"teacher_disagreement_score":0.006220305,"about_ca_system_score_codex":0.0028695113,"about_ca_system_score_gemma":0.0021124834,"threshold_uncertainty_score":0.020819902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08735607,0.00070094265,0.8669288,0.0032948768,0.0002673192,0.00013535882,0.00022698686,0.0002738496,0.04081581],"genre_scores_gemma":[0.90684223,0.0004789254,0.07939174,0.000476509,0.00017359662,0.00029641934,0.00010976055,0.00006599758,0.012164765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916935,0.00030017688,0.000030919568,0.00007765687,0.00027532197,0.00014658918],"domain_scores_gemma":[0.99739933,0.0015741435,0.00016452582,0.00043124415,0.00034514832,0.00008553545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013364002,0.0003896096,0.00062583113,0.00067504786,0.0009066919,0.0010168556,0.001185531,0.0011868881,0.0036120347],"category_scores_gemma":[0.0054822713,0.0002545063,0.00036417894,0.0009390273,0.0014802467,0.0020747979,0.002162643,0.0014620111,0.0004135593],"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.00014859744,0.000040229643,0.0001250154,0.000057589605,0.00001184762,0.000049432078,0.00015817389,0.062044296,0.0034335842,0.9104951,0.0026799769,0.02075617],"study_design_scores_gemma":[0.00003413712,0.0000200076,0.00007650061,0.000023153203,0.000009754887,0.0000329773,0.00002710624,0.5016239,0.0010201517,0.4949689,0.002147397,0.000016055199],"about_ca_topic_score_codex":0.0018611948,"about_ca_topic_score_gemma":0.0023540647,"teacher_disagreement_score":0.0036120347,"about_ca_system_score_codex":0.0017083822,"about_ca_system_score_gemma":0.0014202745,"threshold_uncertainty_score":0.012395263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3080419,0.00042656786,0.6141943,0.0012991156,0.0003132669,0.00019155267,0.00027131298,0.0005174234,0.0747445],"genre_scores_gemma":[0.9468646,0.00015370591,0.04574625,0.0002002586,0.00006269718,0.00011116017,0.00014000757,0.00013199187,0.006589343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905044,0.0003504995,0.000050238275,0.0001739527,0.00015384614,0.00022101069],"domain_scores_gemma":[0.9983677,0.00075464696,0.0001596507,0.00045314303,0.00010520574,0.00015968083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014820196,0.0006507408,0.001011644,0.0005042792,0.0010119766,0.0014642077,0.000991309,0.0010983434,0.00999594],"category_scores_gemma":[0.0028778117,0.0005247346,0.0006718743,0.00057481934,0.001974849,0.0030457636,0.003766194,0.0018372333,0.0011281557],"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.0009945864,0.00020565715,0.00069334434,0.00015203275,0.000048418933,0.00017328377,0.00033848395,0.03477373,0.02387127,0.91463184,0.0017514298,0.022366013],"study_design_scores_gemma":[0.00024387008,0.0004341964,0.000623387,0.00006197766,0.000052972984,0.0001433961,0.00023482702,0.52324796,0.034781013,0.4361978,0.0038382162,0.00014036825],"about_ca_topic_score_codex":0.00031305337,"about_ca_topic_score_gemma":0.0005279122,"teacher_disagreement_score":0.00999594,"about_ca_system_score_codex":0.0005629905,"about_ca_system_score_gemma":0.0008731127,"threshold_uncertainty_score":0.033439755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04963302,0.00022977714,0.9373131,0.0005489235,0.00014726074,0.00009493307,0.000048491183,0.00047968567,0.01150479],"genre_scores_gemma":[0.7406653,0.00024011332,0.25098848,0.0002150854,0.00011439396,0.00018897933,0.00007707621,0.00016116326,0.0073493537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828726,0.00067329203,0.00007837544,0.00018519547,0.0006467367,0.0001289745],"domain_scores_gemma":[0.9968104,0.0014491965,0.00020870627,0.001130016,0.00029190173,0.0001098461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018947951,0.00051113096,0.00094896444,0.00083192723,0.00077778945,0.0016436762,0.001567011,0.0014391526,0.0038376243],"category_scores_gemma":[0.0051763235,0.0004602289,0.00074300193,0.000842245,0.0024525893,0.004060122,0.0027345652,0.0021384065,0.0006344682],"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.00016646559,0.000076706056,0.00025547453,0.000055756325,0.00003530614,0.000043470638,0.00010476669,0.030810239,0.0053674085,0.94011736,0.0006839006,0.02228324],"study_design_scores_gemma":[0.00006239552,0.0000692143,0.00011109497,0.00001580431,0.00001701837,0.000085568485,0.000014461056,0.5057843,0.0073838797,0.4850884,0.0013409151,0.000026856922],"about_ca_topic_score_codex":0.00019241124,"about_ca_topic_score_gemma":0.00026504626,"teacher_disagreement_score":0.0038376243,"about_ca_system_score_codex":0.0008470817,"about_ca_system_score_gemma":0.0009883223,"threshold_uncertainty_score":0.012838125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42721158,0.00023413767,0.5421868,0.0030699426,0.00039335064,0.00013295065,0.0003782652,0.001147663,0.025245382],"genre_scores_gemma":[0.93245155,0.00011037919,0.05775884,0.00040187448,0.00012196278,0.00009598365,0.00012229508,0.00019952656,0.008737548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99778676,0.000596023,0.0001599536,0.00025000094,0.00090050825,0.00030662265],"domain_scores_gemma":[0.99255705,0.0031608662,0.0007500355,0.0018995997,0.0011134512,0.00051899266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021250308,0.0003924948,0.0010733989,0.0011303341,0.0018929825,0.003490919,0.0015679558,0.0026331125,0.004550961],"category_scores_gemma":[0.00942779,0.0006130648,0.00042507704,0.0014752594,0.0028789297,0.0057261568,0.0033855252,0.003105939,0.0009572675],"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.0007019599,0.00012146354,0.0007371758,0.000056562236,0.000020963565,0.0002739211,0.0004859121,0.007028572,0.016649127,0.9599795,0.0012407551,0.012704132],"study_design_scores_gemma":[0.000113014525,0.00024540923,0.00044230607,0.000034091114,0.000037213827,0.00032569966,0.00017840044,0.13365266,0.038035743,0.8215854,0.005270792,0.00007923595],"about_ca_topic_score_codex":0.00033642416,"about_ca_topic_score_gemma":0.00039268946,"teacher_disagreement_score":0.004550961,"about_ca_system_score_codex":0.0008814634,"about_ca_system_score_gemma":0.0017874286,"threshold_uncertainty_score":0.015224516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98709947,0.000097090924,0.0069940877,0.0003255948,0.000046214667,0.000021221344,0.000042706135,0.00006119962,0.005312354],"genre_scores_gemma":[0.9964206,0.00003247862,0.0013046039,0.000032345026,0.0000056250547,0.000009290898,0.000019253737,0.000015826188,0.002160044],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999064,0.000025767024,0.0000026679706,0.000018398974,0.000020834339,0.000025981675],"domain_scores_gemma":[0.99977964,0.00009507709,0.000024370009,0.000047602585,0.000021118865,0.000032321863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035554197,0.0001295084,0.0002763457,0.00013634503,0.00054361735,0.0006141464,0.0005987492,0.000445895,0.0074978527],"category_scores_gemma":[0.00084775273,0.00012039658,0.000117500196,0.00014839039,0.0008507501,0.0007782262,0.00064103876,0.0006433688,0.00025058305],"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.0031647822,0.00036564298,0.005355057,0.00036670928,0.00009735033,0.0012198681,0.0021017084,0.0720023,0.59454554,0.29194814,0.0027386555,0.026094241],"study_design_scores_gemma":[0.00040303764,0.0010118566,0.006744312,0.00005506027,0.00006480389,0.00022161841,0.0006890136,0.5161555,0.41530803,0.05275508,0.0064951116,0.00009666716],"about_ca_topic_score_codex":0.0008903235,"about_ca_topic_score_gemma":0.001054167,"teacher_disagreement_score":0.0074978527,"about_ca_system_score_codex":0.00042019328,"about_ca_system_score_gemma":0.00040532064,"threshold_uncertainty_score":0.025082827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06322641,0.0027879716,0.85761905,0.01454367,0.00094427104,0.00028488284,0.00076241256,0.00050984585,0.059321526],"genre_scores_gemma":[0.8465565,0.0016074985,0.12677981,0.0015543833,0.001458204,0.00025396072,0.0005184757,0.00022558865,0.021045644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930775,0.0033482194,0.0002746429,0.0008778578,0.0016665121,0.0007553036],"domain_scores_gemma":[0.98589724,0.010281291,0.0003948431,0.002107384,0.0007535925,0.0005655862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006712658,0.0011841767,0.0026940284,0.0011775789,0.0017845002,0.005817105,0.0036946656,0.004535447,0.0095856115],"category_scores_gemma":[0.027995767,0.0009503016,0.001343813,0.0022310428,0.0070226905,0.010807239,0.005519543,0.0061857924,0.0013115866],"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.000086898566,0.000031953045,0.00010646558,0.00004964925,0.000012417416,0.00002518793,0.00004493691,0.007552579,0.00011211137,0.98532593,0.0017413916,0.004910591],"study_design_scores_gemma":[0.000030756768,0.000009768308,0.00004444588,0.000012229636,0.000006062759,0.000018472012,0.000008689123,0.056696367,0.00024595083,0.9423132,0.0006036508,0.000010395761],"about_ca_topic_score_codex":0.0018046235,"about_ca_topic_score_gemma":0.0016280427,"teacher_disagreement_score":0.0095856115,"about_ca_system_score_codex":0.0028917803,"about_ca_system_score_gemma":0.0032952183,"threshold_uncertainty_score":0.035500348},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69722176,0.0019468219,0.2574065,0.0027569495,0.0014907817,0.000615195,0.001470425,0.007263329,0.029828249],"genre_scores_gemma":[0.8029225,0.0003163373,0.17987405,0.0008730405,0.00030389588,0.00023701214,0.00041447562,0.00012252938,0.014936249],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991171,0.00011729104,0.000038312464,0.00020206095,0.00041008857,0.000115116374],"domain_scores_gemma":[0.99929464,0.00018886031,0.00006880021,0.000113281334,0.00020983629,0.00012451754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004402364,0.00066435547,0.00081469805,0.0008440692,0.00064669986,0.00088788744,0.0018870006,0.0011203277,0.0049870964],"category_scores_gemma":[0.0006332349,0.00058886356,0.0002737637,0.00054999767,0.00040834784,0.0018179768,0.0009291499,0.0007039922,0.0017055975],"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.00078999746,0.0003149155,0.0020349273,0.0001568676,0.00008841028,0.00022070204,0.00010377049,0.0017347232,0.9372623,0.016022773,0.008060968,0.03320963],"study_design_scores_gemma":[0.00023761492,0.0012269309,0.003330983,0.00003940271,0.00013008185,0.0005022317,0.00008679312,0.087051086,0.8653157,0.0033609874,0.038545616,0.00017257633],"about_ca_topic_score_codex":0.0007151261,"about_ca_topic_score_gemma":0.0021663103,"teacher_disagreement_score":0.0049870964,"about_ca_system_score_codex":0.0007955904,"about_ca_system_score_gemma":0.0007750689,"threshold_uncertainty_score":0.01668346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0763663,0.0015871554,0.7657331,0.0030395917,0.0010478809,0.0002174491,0.00021885862,0.0007247084,0.15106495],"genre_scores_gemma":[0.8188631,0.00063356076,0.14943346,0.0007475675,0.00023946742,0.0003020136,0.000116407195,0.0003392442,0.029325185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940217,0.00023077342,0.000022739103,0.00006087296,0.00021183465,0.00007155172],"domain_scores_gemma":[0.9994031,0.0002540404,0.000028396622,0.00019272447,0.00007671374,0.00004504696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010845528,0.0004186987,0.0010997861,0.0006235597,0.0010501161,0.0013211854,0.0014202847,0.0009571566,0.012684027],"category_scores_gemma":[0.002802022,0.00044255605,0.0004837319,0.0010397716,0.0017695786,0.0019065584,0.0022326612,0.0018516293,0.0009806224],"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.00006911692,0.000031317006,0.00009917543,0.000055773467,0.000013006542,0.000021891565,0.000034401397,0.034257766,0.0012189541,0.9477125,0.0013088043,0.015177184],"study_design_scores_gemma":[0.00003715093,0.00004270239,0.00012109429,0.000020827765,0.000008406074,0.000029810903,0.000021494237,0.40100887,0.0021199482,0.5925645,0.0040028207,0.000022324142],"about_ca_topic_score_codex":0.00081870164,"about_ca_topic_score_gemma":0.0010950305,"teacher_disagreement_score":0.012684027,"about_ca_system_score_codex":0.001286472,"about_ca_system_score_gemma":0.0010133543,"threshold_uncertainty_score":0.04243225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70290166,0.0005980506,0.24536437,0.0012894359,0.0002275026,0.000057558602,0.000099034005,0.00053104234,0.048931293],"genre_scores_gemma":[0.9932492,0.00006908992,0.004883144,0.00006428266,0.000026184789,0.000021358097,0.000016148666,0.000024454132,0.0016461203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996953,0.00006171461,0.000015756,0.000050349005,0.000092198876,0.00008463202],"domain_scores_gemma":[0.99946433,0.0002593998,0.00005424015,0.000109069675,0.000043524702,0.00006947214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053938606,0.00030117691,0.00044052835,0.00045239733,0.0008243553,0.0012045238,0.0007615936,0.0007554492,0.002496755],"category_scores_gemma":[0.001698107,0.00019099501,0.00040375435,0.0003742827,0.003330823,0.0021549268,0.0013857464,0.0009814225,0.00014609378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008252568,0.00002675425,0.00015060099,0.00002066346,0.0000058271676,0.000067387366,0.00012347077,0.0053764717,0.005972397,0.98431903,0.00023857562,0.0036163754],"study_design_scores_gemma":[0.000029932635,0.000031188516,0.00016503005,0.0000066052444,0.0000068830423,0.000055236404,0.000037527185,0.08861864,0.006004244,0.9041195,0.00090460404,0.000020641575],"about_ca_topic_score_codex":0.0008584178,"about_ca_topic_score_gemma":0.0006614087,"teacher_disagreement_score":0.002496755,"about_ca_system_score_codex":0.00046530756,"about_ca_system_score_gemma":0.0003834228,"threshold_uncertainty_score":0.0083524585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46786112,0.0004622326,0.49088153,0.0010721157,0.00038777498,0.00023897918,0.00028133046,0.0011871688,0.03762774],"genre_scores_gemma":[0.96963286,0.00011044475,0.026011825,0.00008977314,0.00006635542,0.00009324617,0.000049691418,0.00006787343,0.0038778891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991117,0.00022385194,0.000036466306,0.00022003074,0.0002599719,0.0001479753],"domain_scores_gemma":[0.9987244,0.00061631826,0.00016911828,0.00033576845,0.000064711036,0.00008960603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007867965,0.0005556438,0.0009567823,0.0003952073,0.0010807455,0.0012957279,0.0011789382,0.00085081084,0.005925817],"category_scores_gemma":[0.0012165172,0.00039965042,0.0004999447,0.00054155226,0.002306221,0.0027020178,0.002874714,0.0014880494,0.00063512404],"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.0012299308,0.0003870979,0.00081308576,0.0003308079,0.00011127537,0.00046909685,0.00051239174,0.030310443,0.20987304,0.72440326,0.0023417126,0.029217888],"study_design_scores_gemma":[0.00037518327,0.000742954,0.0008080433,0.000061055245,0.00009512853,0.00037409074,0.00010131104,0.5308692,0.30362126,0.15472414,0.007941196,0.0002865344],"about_ca_topic_score_codex":0.00020799015,"about_ca_topic_score_gemma":0.00029271236,"teacher_disagreement_score":0.005925817,"about_ca_system_score_codex":0.00042581392,"about_ca_system_score_gemma":0.00069459766,"threshold_uncertainty_score":0.01982379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4227783,0.0007586587,0.47608298,0.0016683784,0.00018408141,0.000092807495,0.0005235871,0.0003983119,0.09751285],"genre_scores_gemma":[0.9821326,0.00022425197,0.011951667,0.00018191576,0.0001577778,0.00005437648,0.00016683643,0.00011343756,0.0050170003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991122,0.00019149619,0.00004312234,0.0002508028,0.00023015775,0.00017224856],"domain_scores_gemma":[0.9966084,0.0013439502,0.00039826613,0.00096905563,0.00034824925,0.00033215742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010474623,0.00050379155,0.0007110592,0.0022224784,0.0012018455,0.003491649,0.0008985945,0.0011113484,0.006113963],"category_scores_gemma":[0.003833323,0.00033220497,0.00044513948,0.0012626811,0.005605878,0.007240149,0.0028432368,0.002070998,0.00063048553],"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.000030265343,0.000016381266,0.00043660888,0.000021319545,0.0000069982307,0.00004872991,0.0001559418,0.0015381967,0.0034804265,0.9895124,0.00046394378,0.004288807],"study_design_scores_gemma":[0.0000071000777,0.000039155777,0.00082832767,0.000017551723,0.000009449645,0.00014562588,0.000120365024,0.02559323,0.002235394,0.96909195,0.0018939023,0.000017876066],"about_ca_topic_score_codex":0.00019069093,"about_ca_topic_score_gemma":0.00016404744,"teacher_disagreement_score":0.006113963,"about_ca_system_score_codex":0.0005156285,"about_ca_system_score_gemma":0.0003552472,"threshold_uncertainty_score":0.020453274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18879545,0.0012866438,0.7865168,0.008768146,0.00024570362,0.00017011554,0.00039086665,0.00093921594,0.012887098],"genre_scores_gemma":[0.7897284,0.0007185156,0.20476,0.00070013,0.00015499465,0.00012672272,0.00031370332,0.00035729556,0.0031403333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976769,0.0010234303,0.00014173058,0.00048182008,0.00045819048,0.00021780272],"domain_scores_gemma":[0.9821701,0.0117641585,0.0008137258,0.003737141,0.0011267395,0.00038818576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048287846,0.00077281176,0.0014518428,0.000876018,0.0008639856,0.0020442663,0.0021820932,0.0023994355,0.004555227],"category_scores_gemma":[0.04796237,0.0006504866,0.0006096183,0.0007328057,0.0026535504,0.0071763485,0.0016061319,0.0018801106,0.0010328405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009376732,0.00033138072,0.008041938,0.0007057307,0.0003721845,0.00018934376,0.0004953354,0.47068647,0.0151571585,0.24502052,0.011303686,0.24675855],"study_design_scores_gemma":[0.00006629308,0.00011021122,0.0009952436,0.00009288507,0.000044002056,0.000127721,0.00018230973,0.7265141,0.0068118456,0.26341996,0.0015877651,0.000047658446],"about_ca_topic_score_codex":0.001738544,"about_ca_topic_score_gemma":0.002283608,"teacher_disagreement_score":0.0048287846,"about_ca_system_score_codex":0.0010037486,"about_ca_system_score_gemma":0.0019961512,"threshold_uncertainty_score":0.025537312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50301546,0.00047166104,0.44227982,0.003260281,0.00012093023,0.0002447057,0.00048159712,0.0001658703,0.04995975],"genre_scores_gemma":[0.9617029,0.00033004524,0.025780287,0.00026109823,0.00007558244,0.00034864928,0.00024660028,0.00005298743,0.011201901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762565,0.001007712,0.00010086769,0.00028397705,0.0006219789,0.00035984817],"domain_scores_gemma":[0.9905628,0.006800202,0.0007663075,0.000490716,0.0006124423,0.0007676278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002691635,0.00063068,0.001867526,0.0016736647,0.0024660174,0.005540884,0.0023484477,0.0025471721,0.0057942113],"category_scores_gemma":[0.013062927,0.00095951324,0.0011532288,0.0014367548,0.004479268,0.0058690486,0.0033076277,0.003117752,0.00047187577],"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.000051189814,0.00004621643,0.00022253174,0.000025910334,0.000021015132,0.000055676035,0.00019606228,0.017139757,0.00047635025,0.97846174,0.00052803196,0.0027755138],"study_design_scores_gemma":[0.000027515418,0.000012433294,0.000121839366,0.000008760019,0.0000054305224,0.000015720812,0.00005160795,0.06437206,0.000181974,0.934872,0.00031810233,0.000012517168],"about_ca_topic_score_codex":0.0024518953,"about_ca_topic_score_gemma":0.0022304135,"teacher_disagreement_score":0.0057942113,"about_ca_system_score_codex":0.002442219,"about_ca_system_score_gemma":0.0020264788,"threshold_uncertainty_score":0.01938355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24145302,0.0018561032,0.67936194,0.0060364483,0.0011835056,0.00011788016,0.00016391547,0.0006010911,0.06922601],"genre_scores_gemma":[0.9289958,0.0006394649,0.046389233,0.0007692179,0.0004352498,0.00010724556,0.00008501334,0.00020506051,0.022373816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843067,0.0006827044,0.000052709314,0.00012696083,0.0005443995,0.00016246995],"domain_scores_gemma":[0.995514,0.002779358,0.0002470928,0.00075906026,0.00045315296,0.00024736108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025420163,0.00049621443,0.001216618,0.0013210614,0.0014613777,0.0018114288,0.0018473213,0.0021787777,0.0073449984],"category_scores_gemma":[0.009572939,0.00045553775,0.00046746767,0.0013970308,0.0038572485,0.004070416,0.0031025328,0.002145688,0.00070697773],"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.00006516004,0.000032120144,0.00012537537,0.000043665565,0.0000070430315,0.00004685033,0.00009026092,0.012809203,0.0011306878,0.9803013,0.0007146266,0.0046336893],"study_design_scores_gemma":[0.00002001,0.000023743278,0.00015312462,0.00001939506,0.000007838735,0.000054067517,0.00003438819,0.21235856,0.0010987249,0.7852987,0.0009014155,0.000029990826],"about_ca_topic_score_codex":0.001158681,"about_ca_topic_score_gemma":0.0016816821,"teacher_disagreement_score":0.0073449984,"about_ca_system_score_codex":0.0011299175,"about_ca_system_score_gemma":0.0010600045,"threshold_uncertainty_score":0.024571419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20714709,0.010584133,0.42855516,0.09522537,0.009222453,0.00017883338,0.0012193033,0.0010871253,0.24678056],"genre_scores_gemma":[0.9407753,0.0031964122,0.03167747,0.0042301305,0.0030164765,0.00015391888,0.00025136213,0.0003117058,0.01638726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825734,0.00059474393,0.00007647249,0.00027833408,0.0005888636,0.00020421662],"domain_scores_gemma":[0.9960549,0.0013176348,0.00027258668,0.0011329014,0.000781503,0.00044046136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368596,0.00028242852,0.0011582109,0.0013618292,0.0028580122,0.0039441083,0.001244746,0.002698896,0.008379372],"category_scores_gemma":[0.009609852,0.000483228,0.00052438263,0.0013626601,0.009699344,0.015325842,0.0029772243,0.0032790937,0.0011800083],"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.00001002259,0.000008185163,0.00009773584,0.000019883926,0.000008619487,0.000012550109,0.00010155469,0.00054172287,0.00026682508,0.99282455,0.0018910402,0.004217263],"study_design_scores_gemma":[0.0000029177545,0.000003836922,0.000084871026,0.000006964346,0.0000030911526,0.000021609369,0.0000569802,0.0015700826,0.00016138102,0.9941042,0.0039755683,0.000008579005],"about_ca_topic_score_codex":0.0010359056,"about_ca_topic_score_gemma":0.00062727113,"teacher_disagreement_score":0.008379372,"about_ca_system_score_codex":0.0008177158,"about_ca_system_score_gemma":0.0010270028,"threshold_uncertainty_score":0.028031766},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000684763,0.005772487,0.00039304432,0.96815044,0.016863566,0.00001112541,0.000030084366,0.000009898846,0.008084549],"genre_scores_gemma":[0.07893793,0.008798839,0.0006116682,0.8217004,0.06567677,0.00016484194,0.00009394892,0.00014352603,0.023872063],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9906403,0.004132504,0.00032453227,0.0010489665,0.0020468738,0.0018068671],"domain_scores_gemma":[0.97197545,0.020772083,0.00066127133,0.0009446082,0.0021996326,0.0034469161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023407541,0.0010267519,0.0024133688,0.0011723277,0.017366238,0.01759603,0.0040884423,0.052786022,0.01435728],"category_scores_gemma":[0.039391156,0.0007957614,0.0014707918,0.0015872302,0.018975649,0.0285217,0.010821027,0.06222715,0.0031110423],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014392394,0.00007601391,0.00011565859,0.00020001916,0.000032775402,0.00017424332,0.0037022734,0.00013806422,0.00017400802,0.39061725,0.59657526,0.008050517],"study_design_scores_gemma":[0.0001202377,0.000037320864,0.00037176075,0.00038110086,0.000025456055,0.000091090806,0.0060433457,0.00024069786,0.00018091711,0.19061789,0.80183786,0.000052291743],"about_ca_topic_score_codex":0.004423802,"about_ca_topic_score_gemma":0.004648025,"teacher_disagreement_score":0.052786022,"about_ca_system_score_codex":0.0076191723,"about_ca_system_score_gemma":0.007822966,"threshold_uncertainty_score":0.12379235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06661986,0.0053216014,0.48758754,0.025008049,0.006160242,0.0000632601,0.00064233784,0.00065746944,0.40793967],"genre_scores_gemma":[0.8453406,0.0025179207,0.061115142,0.0066414336,0.005871517,0.00018719726,0.0005205829,0.00038049155,0.07742512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989202,0.00026581247,0.00006607812,0.00023918347,0.0003701911,0.000138564],"domain_scores_gemma":[0.9975684,0.0012055184,0.00010147697,0.0004181363,0.00049960916,0.00020686521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002654338,0.0008123078,0.0011747752,0.0011539157,0.0026973882,0.0025119113,0.0017314127,0.0016184465,0.007966504],"category_scores_gemma":[0.005204228,0.00044592627,0.0012513429,0.00090957317,0.0062941955,0.007805103,0.0023862112,0.0054167253,0.001566894],"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.0000057098287,0.00000496229,0.000021363163,0.000012571888,0.0000021391365,0.00001108877,0.000029665525,0.00010885102,0.00008904671,0.9970393,0.0013569194,0.0013184232],"study_design_scores_gemma":[0.0000021693857,0.0000029047587,0.000022622642,0.0000033481433,0.0000016738345,0.000013521008,0.0000059120925,0.0006463176,0.000058359223,0.9981218,0.0011184826,0.0000028846066],"about_ca_topic_score_codex":0.0012094054,"about_ca_topic_score_gemma":0.00092523015,"teacher_disagreement_score":0.007966504,"about_ca_system_score_codex":0.0011526528,"about_ca_system_score_gemma":0.0011756058,"threshold_uncertainty_score":0.026650667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10291376,0.00052081083,0.8856812,0.0005968091,0.00018208454,0.00011971681,0.0001319442,0.0006006776,0.009252887],"genre_scores_gemma":[0.7938487,0.00031196597,0.19835728,0.00023673418,0.0001619003,0.00014414165,0.0001242887,0.00011437285,0.006700574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779665,0.00065965886,0.00015465188,0.00029746283,0.00081106625,0.00028047108],"domain_scores_gemma":[0.9959573,0.0025310863,0.00025117784,0.0006588235,0.00041666397,0.00018490056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022302829,0.0008363911,0.00089104526,0.0006510408,0.0007593594,0.0012040145,0.0014553221,0.0013363252,0.002658794],"category_scores_gemma":[0.005501207,0.00072709256,0.00067568314,0.0006339137,0.0021243698,0.0023147066,0.0026454483,0.0016623242,0.0006302777],"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.0021497165,0.0003284889,0.001188035,0.00034866447,0.00021845942,0.00046648452,0.00047235863,0.25688553,0.061697524,0.51191384,0.0033319856,0.16099893],"study_design_scores_gemma":[0.00010199539,0.00022016976,0.00023171234,0.000021932383,0.000055238106,0.00020834421,0.000030984975,0.83783287,0.016743656,0.14260074,0.0018973667,0.000054934044],"about_ca_topic_score_codex":0.00083158683,"about_ca_topic_score_gemma":0.002348756,"teacher_disagreement_score":0.002658794,"about_ca_system_score_codex":0.00067550316,"about_ca_system_score_gemma":0.001984093,"threshold_uncertainty_score":0.011795044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15340841,0.0075267395,0.6635348,0.035586216,0.00203021,0.0001357344,0.0007406752,0.00080816494,0.13622904],"genre_scores_gemma":[0.91975886,0.00262523,0.056370176,0.0026437943,0.0009807484,0.0002164004,0.00038551982,0.00032851307,0.016690709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884003,0.00043183123,0.00004981116,0.00016512512,0.00033358796,0.0001796191],"domain_scores_gemma":[0.99677,0.0014223008,0.00026960362,0.0008991086,0.0003288445,0.0003102299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024277547,0.0009583858,0.0017510393,0.00075116387,0.0018220345,0.004209785,0.0025991302,0.0033975004,0.008877408],"category_scores_gemma":[0.008313483,0.0007235763,0.0011961249,0.0010124149,0.0056680134,0.018760536,0.002183241,0.005028359,0.0011292734],"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.000024173003,0.000015631274,0.000027494349,0.000036480098,0.0000055211394,0.000017604876,0.00004413814,0.0011236919,0.0003359389,0.99533385,0.0011561724,0.0018793199],"study_design_scores_gemma":[0.000007119792,0.0000058155065,0.000019153755,0.000013146606,0.000003581429,0.00001506494,0.00002156217,0.0105311815,0.00014675285,0.9883851,0.0008425205,0.000009040278],"about_ca_topic_score_codex":0.0016577502,"about_ca_topic_score_gemma":0.0016946242,"teacher_disagreement_score":0.008877408,"about_ca_system_score_codex":0.001248635,"about_ca_system_score_gemma":0.0013696091,"threshold_uncertainty_score":0.029697835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7019917,0.0011884264,0.15263797,0.004870915,0.00044405877,0.00012845622,0.000839934,0.00063228124,0.13726634],"genre_scores_gemma":[0.9562301,0.0006618904,0.011693666,0.00056099513,0.0005207147,0.0000891226,0.00035049862,0.00025910902,0.029633861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931645,0.00016822222,0.00003291312,0.00009155229,0.00022089061,0.00017001957],"domain_scores_gemma":[0.9981974,0.000633034,0.00031621332,0.00029787194,0.00025946533,0.00029611785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010729475,0.0007087164,0.00093520177,0.0018625268,0.0022012156,0.0019769864,0.0014818967,0.001363069,0.010161741],"category_scores_gemma":[0.0036437532,0.00059080694,0.0007040117,0.0012353837,0.0036444766,0.006106967,0.001920556,0.002619422,0.0012066133],"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.000025376077,0.000010807648,0.00006553423,0.000015956728,0.0000039930374,0.000038793027,0.00008400201,0.00086130307,0.00032673843,0.9965475,0.00056527235,0.0014546763],"study_design_scores_gemma":[0.0000066044518,0.000008046425,0.00013294411,0.000005572554,0.000002578531,0.00002863745,0.000026610638,0.004301051,0.00023260413,0.9948001,0.0004463374,0.000009001863],"about_ca_topic_score_codex":0.00263,"about_ca_topic_score_gemma":0.0017928137,"teacher_disagreement_score":0.010161741,"about_ca_system_score_codex":0.0014535423,"about_ca_system_score_gemma":0.0013266363,"threshold_uncertainty_score":0.033994377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2715369,0.0018275824,0.4787141,0.005686166,0.0011919419,0.00022974973,0.00068024604,0.000195803,0.23993757],"genre_scores_gemma":[0.9028567,0.0009210515,0.05973485,0.0009903412,0.000839576,0.00023669476,0.00033901318,0.00013676127,0.033945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977932,0.0007054811,0.00013492648,0.00022600371,0.0008161348,0.00032429528],"domain_scores_gemma":[0.9966181,0.0013154886,0.0002846366,0.0005375171,0.0008289616,0.0004153062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025006689,0.0006106898,0.00082869997,0.0021107201,0.0028870527,0.0048119896,0.0014621184,0.00203914,0.005569323],"category_scores_gemma":[0.00617985,0.00059247273,0.0010758959,0.0012392375,0.0051865974,0.006517647,0.004333765,0.0043396903,0.0011033566],"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.000008820515,0.000009975698,0.00002622798,0.000006109787,0.0000010505258,0.000011817221,0.000059048143,0.00026811208,0.00015589966,0.99839383,0.00023849543,0.0008206737],"study_design_scores_gemma":[0.000004297879,0.000004010032,0.00001956283,0.0000057306565,0.000001283179,0.000022265838,0.000021685264,0.003916563,0.0001856815,0.9952684,0.0005443695,0.0000060169473],"about_ca_topic_score_codex":0.0008029852,"about_ca_topic_score_gemma":0.00076841115,"teacher_disagreement_score":0.005569323,"about_ca_system_score_codex":0.0015072167,"about_ca_system_score_gemma":0.0016188008,"threshold_uncertainty_score":0.01863122},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92693615,0.0005102073,0.050199132,0.0019516137,0.00020168787,0.00003369026,0.000116640076,0.00020396219,0.019846942],"genre_scores_gemma":[0.996157,0.00006891739,0.002035458,0.000039344526,0.000035509853,0.000006240651,0.000018271985,0.00001654672,0.001622756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975413,0.000051256662,0.000010755719,0.000047411584,0.000096280826,0.000040121507],"domain_scores_gemma":[0.99936444,0.0002689289,0.00008772667,0.00012177877,0.00009039755,0.0000667737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055492745,0.00013349396,0.00026379933,0.00031467908,0.0004930313,0.0010997568,0.0007801065,0.00052981975,0.0023825534],"category_scores_gemma":[0.0020693196,0.00016583863,0.00013112467,0.00032444388,0.0015024386,0.0014984302,0.00079517276,0.0006963452,0.00011611205],"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.0010595912,0.000320259,0.0023192042,0.00013008836,0.00005630578,0.0004589354,0.00058184355,0.03493449,0.21293193,0.70539016,0.0019866852,0.03983043],"study_design_scores_gemma":[0.000176967,0.00044645654,0.0047207973,0.000024780597,0.00004559989,0.0002606225,0.00017892843,0.5917893,0.14800076,0.24904014,0.005208554,0.00010713751],"about_ca_topic_score_codex":0.00062015065,"about_ca_topic_score_gemma":0.0006522282,"teacher_disagreement_score":0.0023825534,"about_ca_system_score_codex":0.00046106384,"about_ca_system_score_gemma":0.00044054916,"threshold_uncertainty_score":0.007970393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020204611,0.00020107989,0.97146916,0.00038717268,0.00019843478,0.000105047555,0.00004438535,0.00043145916,0.0069586616],"genre_scores_gemma":[0.21743955,0.00023659186,0.7747535,0.00023923123,0.0000582749,0.00020726873,0.00006110932,0.000090031404,0.0069144387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974364,0.000050451996,0.000011954657,0.000043850636,0.00013151685,0.000018557314],"domain_scores_gemma":[0.99976987,0.000077212746,0.000014325156,0.000043461845,0.00007197336,0.00002317242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004164421,0.0002645378,0.00059192866,0.0004630169,0.00064618635,0.0007140137,0.0009833355,0.0015097355,0.0032671231],"category_scores_gemma":[0.00095221266,0.00025774998,0.0004198878,0.0009141907,0.0007036663,0.0007661197,0.0007709258,0.0005734193,0.0006964138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019675847,0.00024715174,0.0009472861,0.00017058161,0.00013411007,0.00029077576,0.00020619521,0.3815111,0.047420163,0.2498465,0.0053938413,0.3136355],"study_design_scores_gemma":[0.0001311927,0.000088640336,0.00023669453,0.0000142191675,0.000051233714,0.00016501517,0.000015388228,0.9531785,0.005305872,0.03400262,0.00677575,0.000034818746],"about_ca_topic_score_codex":0.0017536718,"about_ca_topic_score_gemma":0.0021012172,"teacher_disagreement_score":0.0032671231,"about_ca_system_score_codex":0.00051544746,"about_ca_system_score_gemma":0.0011027666,"threshold_uncertainty_score":0.0109295845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13651271,0.0006118792,0.842977,0.00088108674,0.00017079506,0.0001072129,0.00021921108,0.0009901286,0.01753002],"genre_scores_gemma":[0.8935257,0.0002777007,0.10167998,0.00018322696,0.000091146685,0.00021915263,0.0002156871,0.00049420825,0.0033131908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938416,0.00018656105,0.00003547727,0.000070748625,0.00022482281,0.00009814618],"domain_scores_gemma":[0.9938021,0.0047515947,0.000271075,0.0005155493,0.00044912368,0.00021060828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001976042,0.0011138619,0.001424085,0.0014289266,0.00088442175,0.0012309203,0.0019365988,0.0016775484,0.0054591275],"category_scores_gemma":[0.01251393,0.0006054011,0.0007923851,0.0007353857,0.0016952527,0.003510916,0.0027344092,0.0024440656,0.00046449527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001914762,0.0000838859,0.00054839626,0.00014029046,0.00004363846,0.00006703241,0.00016691488,0.69223475,0.0038421645,0.28841034,0.0011845438,0.013086593],"study_design_scores_gemma":[0.000007776873,0.00001109377,0.00004355233,0.000007042731,0.000006001753,0.0000065641466,0.000008818599,0.9472935,0.0006265734,0.051807273,0.00017612438,0.0000057523707],"about_ca_topic_score_codex":0.0031307747,"about_ca_topic_score_gemma":0.003363037,"teacher_disagreement_score":0.0054591275,"about_ca_system_score_codex":0.0019114427,"about_ca_system_score_gemma":0.0011834145,"threshold_uncertainty_score":0.018262625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19669767,0.0018439336,0.74054116,0.0021608525,0.00029487396,0.00012995498,0.00055955857,0.0004635635,0.057308532],"genre_scores_gemma":[0.9418462,0.0008212824,0.043037888,0.0004013047,0.0002504533,0.00011441028,0.00027673153,0.00009633778,0.013155345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992988,0.0001650394,0.000028691775,0.0001429822,0.00020212335,0.00016234332],"domain_scores_gemma":[0.9985258,0.00047184218,0.00013532359,0.00053505384,0.00021134393,0.00012069169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091272197,0.0006300119,0.0009260821,0.00079448055,0.001020202,0.001885059,0.0015320107,0.0021967054,0.003643867],"category_scores_gemma":[0.002914278,0.00046448858,0.00066401844,0.0013449512,0.0031269807,0.00356025,0.002208619,0.0017685151,0.0005769314],"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.000037271577,0.000017632392,0.00011921263,0.000032169046,0.000010594051,0.000055737695,0.00004347626,0.014946919,0.001224003,0.978134,0.0006241626,0.0047548953],"study_design_scores_gemma":[0.000018260424,0.000019433339,0.00014149392,0.000016067104,0.000012710987,0.000071135604,0.0000133842605,0.14246577,0.0010872481,0.85463256,0.0014989356,0.000022976117],"about_ca_topic_score_codex":0.0020294625,"about_ca_topic_score_gemma":0.0025787754,"teacher_disagreement_score":0.003643867,"about_ca_system_score_codex":0.0015485982,"about_ca_system_score_gemma":0.0018721662,"threshold_uncertainty_score":0.012189984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13602082,0.0013429533,0.81802344,0.0014400588,0.0007902141,0.00027905262,0.00018712653,0.00059864216,0.0413176],"genre_scores_gemma":[0.8469838,0.00045014973,0.13373233,0.00038807868,0.00015689804,0.00036562208,0.000100741345,0.00024939878,0.017573034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996427,0.000120648,0.000015508738,0.000043360436,0.000104850194,0.00007285569],"domain_scores_gemma":[0.99952185,0.00020533336,0.000024302719,0.00010173126,0.00010382602,0.000042996187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008949234,0.00041641408,0.0011160452,0.0003982497,0.0009864349,0.0007741477,0.0013807853,0.0009832624,0.006681658],"category_scores_gemma":[0.0019848403,0.00024925914,0.000458708,0.00046679153,0.00092241087,0.0015595559,0.0015913084,0.0012082609,0.00079290656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006332836,0.00009620513,0.00037665508,0.00017048547,0.00006720942,0.00008068954,0.0002751597,0.18143444,0.022234809,0.7015533,0.006836153,0.08624168],"study_design_scores_gemma":[0.00009639807,0.00007176695,0.00020515654,0.000017240322,0.000016579648,0.000037707243,0.00001804781,0.8044022,0.0058701285,0.18566585,0.003560574,0.000038375012],"about_ca_topic_score_codex":0.00063037954,"about_ca_topic_score_gemma":0.001199036,"teacher_disagreement_score":0.006681658,"about_ca_system_score_codex":0.00067235314,"about_ca_system_score_gemma":0.0008846831,"threshold_uncertainty_score":0.022352338},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005629031,0.00022671498,0.9880484,0.00014142154,0.00017532332,0.00012247234,0.00043649957,0.0019027364,0.003317368],"genre_scores_gemma":[0.04173102,0.00048608758,0.94373184,0.00017266184,0.00013768888,0.00050841266,0.0013788133,0.0024362078,0.009417331],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99839455,0.00039809034,0.00013772021,0.00033570893,0.0006073494,0.00012655453],"domain_scores_gemma":[0.9958242,0.0011136421,0.00017631137,0.0010257073,0.0017519025,0.00010824432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003430093,0.0015544774,0.0010781547,0.0017291518,0.0022062063,0.0017581576,0.0018760829,0.00095070095,0.014324569],"category_scores_gemma":[0.010342403,0.0007025245,0.0011360862,0.0027216182,0.0012343158,0.002709991,0.0012829528,0.00280428,0.0055888677],"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.00068694336,0.0003416644,0.0011428117,0.00062709453,0.00015073975,0.00032836068,0.00051089644,0.010696468,0.26355013,0.18229148,0.01581468,0.5238587],"study_design_scores_gemma":[0.000074642034,0.00023444672,0.005136025,0.0001400545,0.00024346146,0.00085245306,0.0002234731,0.2464226,0.57053864,0.089273766,0.08661379,0.00024667615],"about_ca_topic_score_codex":0.0037031479,"about_ca_topic_score_gemma":0.005061648,"teacher_disagreement_score":0.014324569,"about_ca_system_score_codex":0.0011067521,"about_ca_system_score_gemma":0.0035372777,"threshold_uncertainty_score":0.047920465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7806615,0.0013810238,0.17739686,0.0027657442,0.0004086975,0.000102100385,0.00040155926,0.00072548585,0.036156967],"genre_scores_gemma":[0.9812246,0.00033865866,0.009148242,0.00022545755,0.00018383595,0.00008160744,0.00028261862,0.00020182593,0.008313015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868506,0.000500839,0.00005551827,0.0001607515,0.00030632294,0.00029159876],"domain_scores_gemma":[0.989986,0.0061128745,0.0007704001,0.0005723288,0.00077950885,0.0017788851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022930924,0.0009920166,0.0017206545,0.0025727346,0.0020709569,0.0028793048,0.0028986547,0.003080926,0.009107899],"category_scores_gemma":[0.015028075,0.000777373,0.0010528809,0.0017636654,0.0034279341,0.0051712375,0.0023360483,0.0026749237,0.00052534166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034651588,0.00008878656,0.0008911787,0.000117139716,0.000058003738,0.00022931125,0.0002732712,0.07839386,0.0028508133,0.91101235,0.00164946,0.004089309],"study_design_scores_gemma":[0.00004073054,0.000047700505,0.0004562577,0.000026170095,0.000021324608,0.00007592991,0.000068465255,0.5044217,0.0005973579,0.49387902,0.00032739367,0.00003795074],"about_ca_topic_score_codex":0.0024358393,"about_ca_topic_score_gemma":0.0017622691,"teacher_disagreement_score":0.009107899,"about_ca_system_score_codex":0.0021440284,"about_ca_system_score_gemma":0.0016712706,"threshold_uncertainty_score":0.03046894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15918148,0.004499114,0.5029223,0.014740828,0.0012420674,0.0001305474,0.0017484332,0.00042389674,0.31511134],"genre_scores_gemma":[0.9470068,0.0022262195,0.0250838,0.00120148,0.0010352876,0.0002071787,0.0004568252,0.00017027192,0.02261217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988102,0.00029610388,0.000050631515,0.0002037141,0.0004291138,0.00021029335],"domain_scores_gemma":[0.9971523,0.001723863,0.00017356577,0.0003710863,0.000435421,0.00014373951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018805158,0.0009089386,0.0010349315,0.0019501741,0.0011685938,0.0034524358,0.0019198093,0.0023175417,0.010435273],"category_scores_gemma":[0.007894594,0.00052711426,0.0006384024,0.0019538167,0.0045248778,0.008165844,0.0026809576,0.0033881953,0.0012950143],"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.00000668289,0.0000039932047,0.000024902776,0.00001609986,0.0000021687313,0.000015711497,0.000038396545,0.0020236338,0.0002345128,0.9955662,0.0008935497,0.0011741559],"study_design_scores_gemma":[0.0000050234385,0.000003808638,0.0000385819,0.000014947002,0.0000028926495,0.000033236596,0.000013439267,0.022791767,0.00018484413,0.97578967,0.001109509,0.0000122400925],"about_ca_topic_score_codex":0.0016570528,"about_ca_topic_score_gemma":0.0007250838,"teacher_disagreement_score":0.010435273,"about_ca_system_score_codex":0.0019033526,"about_ca_system_score_gemma":0.0014188422,"threshold_uncertainty_score":0.034909487},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10528451,0.004022632,0.29940954,0.015060003,0.0019871567,0.0001055471,0.0013198641,0.0005328646,0.57227796],"genre_scores_gemma":[0.9181249,0.001701351,0.033006757,0.0034634273,0.0024022637,0.00020868311,0.0008863545,0.0002958177,0.039910432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766785,0.0007005014,0.000110408466,0.000595529,0.0005987879,0.00032690648],"domain_scores_gemma":[0.9939314,0.0033351493,0.00025093887,0.0010697778,0.0011865508,0.00022622966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031201714,0.0004622906,0.0011722009,0.001178406,0.0026200823,0.0026809755,0.001939686,0.001830839,0.014745334],"category_scores_gemma":[0.009619827,0.00058418536,0.0011419703,0.0009621159,0.004535707,0.0066750743,0.0033848463,0.005332605,0.0019090935],"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.000020403513,0.000009469179,0.00010758609,0.000021312278,0.000008616007,0.000023113884,0.000044333796,0.00025718613,0.00019256087,0.99569905,0.0015495907,0.0020666835],"study_design_scores_gemma":[0.000012333882,0.000006619024,0.00018382487,0.0000064260576,0.0000046532955,0.00004344741,0.000015101661,0.0015577058,0.00018250292,0.99562967,0.0023522,0.0000055724536],"about_ca_topic_score_codex":0.0010846318,"about_ca_topic_score_gemma":0.00063489866,"teacher_disagreement_score":0.014745334,"about_ca_system_score_codex":0.0011438662,"about_ca_system_score_gemma":0.0012610536,"threshold_uncertainty_score":0.04932803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021613896,0.0004206848,0.946611,0.0027599647,0.0010318226,0.0005091112,0.0002963483,0.00083641865,0.025920743],"genre_scores_gemma":[0.4656516,0.00080229924,0.48259655,0.0016285954,0.0009144535,0.0014378041,0.00044463386,0.00033059402,0.046193298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800986,0.0003795874,0.00013238892,0.00034514017,0.00089796464,0.00023496806],"domain_scores_gemma":[0.99863464,0.00039274959,0.00011684498,0.00046895602,0.00020344455,0.00018325898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014454377,0.0006192302,0.001082591,0.0006366273,0.0019046691,0.0022977446,0.002513495,0.002742857,0.007824631],"category_scores_gemma":[0.002714428,0.00051852135,0.0007158308,0.00095618184,0.0017160249,0.0054403897,0.006087084,0.0032511016,0.0024285666],"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.00020824901,0.00015103508,0.00011996497,0.00018971073,0.000035330264,0.00031540394,0.00020741575,0.0035369461,0.03449054,0.9146828,0.00743037,0.038632233],"study_design_scores_gemma":[0.00028020944,0.00027531065,0.00024971113,0.000070166294,0.000095726486,0.0014258688,0.00008433939,0.19523157,0.034331635,0.70614326,0.061654046,0.00015806338],"about_ca_topic_score_codex":0.00016381017,"about_ca_topic_score_gemma":0.0003022386,"teacher_disagreement_score":0.007824631,"about_ca_system_score_codex":0.000835257,"about_ca_system_score_gemma":0.0016089964,"threshold_uncertainty_score":0.026175976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63958806,0.0025357748,0.30534372,0.003495212,0.00089944934,0.00010981571,0.0002222546,0.00042777165,0.047377914],"genre_scores_gemma":[0.97473055,0.00056664034,0.017079785,0.0002935548,0.0003586621,0.00007517277,0.00006535647,0.00009216942,0.006738155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988788,0.0005156953,0.000054990873,0.0001403316,0.00027830317,0.00013192177],"domain_scores_gemma":[0.9964025,0.0019421937,0.00033898104,0.0006276705,0.00042192117,0.0002667083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027804743,0.0005334205,0.0011172263,0.0012528433,0.0017697278,0.0021602786,0.0015900598,0.0019797045,0.0038191646],"category_scores_gemma":[0.006605817,0.0004919553,0.0005076061,0.0010149006,0.004862869,0.0041889576,0.0016394453,0.0017389528,0.000455844],"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.000048769296,0.00002333015,0.00015479853,0.000020106325,0.0000057464354,0.000059590748,0.0002213083,0.0029454795,0.0012766039,0.9931457,0.00033563923,0.0017630194],"study_design_scores_gemma":[0.000014514311,0.000026433649,0.00010877515,0.0000078393805,0.0000041528992,0.00003359685,0.000033935747,0.030035108,0.00044341487,0.968759,0.000514844,0.00001840801],"about_ca_topic_score_codex":0.0011348699,"about_ca_topic_score_gemma":0.0009117281,"teacher_disagreement_score":0.0038191646,"about_ca_system_score_codex":0.0007545847,"about_ca_system_score_gemma":0.0009564292,"threshold_uncertainty_score":0.014704704},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033709098,0.0004319953,0.94711715,0.001192295,0.00090692344,0.0006325872,0.0003690811,0.0010718581,0.014569],"genre_scores_gemma":[0.64233774,0.00047593226,0.3289403,0.0007563813,0.00050088414,0.00080136344,0.00043716794,0.0002509956,0.025499238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546033,0.0012848807,0.00040116813,0.0006449656,0.0017133818,0.000495229],"domain_scores_gemma":[0.9964127,0.00092162803,0.00026801982,0.0011160456,0.00088053476,0.00040110468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004323337,0.00072015176,0.0021384056,0.00086468697,0.0014732372,0.0043860143,0.004279021,0.0027089138,0.007491276],"category_scores_gemma":[0.00525302,0.0007590489,0.0011747462,0.0013025512,0.0018231624,0.0060554463,0.0037965055,0.0025971963,0.0021644805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027678343,0.0008538801,0.0007351341,0.00064102665,0.0002929367,0.001125649,0.0004159336,0.03797386,0.037106425,0.79478055,0.016479027,0.10682783],"study_design_scores_gemma":[0.0016663019,0.00062016316,0.00039283963,0.00006240661,0.00031858115,0.0014841243,0.000089438705,0.59980386,0.017526945,0.34934163,0.028373914,0.00031977316],"about_ca_topic_score_codex":0.0005983191,"about_ca_topic_score_gemma":0.00071148016,"teacher_disagreement_score":0.007491276,"about_ca_system_score_codex":0.00097401603,"about_ca_system_score_gemma":0.0038990278,"threshold_uncertainty_score":0.025060892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3005845,0.00036269528,0.6766997,0.0009503663,0.00015859466,0.00015010129,0.0005063808,0.00067519594,0.019912433],"genre_scores_gemma":[0.85781324,0.00031849212,0.123592384,0.00035069653,0.00016693174,0.00021806476,0.0008121429,0.00041503247,0.016313165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986755,0.00036936984,0.00006804531,0.00043844036,0.00026393167,0.00018465737],"domain_scores_gemma":[0.9956457,0.0017814751,0.0003778055,0.0012589637,0.0005462302,0.0003898017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010648302,0.00067796046,0.00073561317,0.0008141789,0.0011605136,0.0017994924,0.0012458354,0.0011183971,0.0041099275],"category_scores_gemma":[0.0046663163,0.00071924506,0.001028424,0.00064232846,0.0025678754,0.0036522925,0.002761936,0.0025468585,0.00078205584],"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.000095719515,0.000046609053,0.00039622682,0.00007403696,0.0000131611505,0.00006533433,0.00033596018,0.006377618,0.0024288634,0.97813,0.0017643863,0.01027214],"study_design_scores_gemma":[0.000016355134,0.00003224268,0.00019889358,0.0000122365045,0.000010666092,0.0000731261,0.000048450063,0.027833767,0.0012249582,0.96844125,0.002094175,0.00001390679],"about_ca_topic_score_codex":0.0009806392,"about_ca_topic_score_gemma":0.0015549407,"teacher_disagreement_score":0.0041099275,"about_ca_system_score_codex":0.0009962935,"about_ca_system_score_gemma":0.0011544214,"threshold_uncertainty_score":0.013749063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34816825,0.0014512648,0.411704,0.004007166,0.000957521,0.00027976674,0.00022413142,0.00096112565,0.23224688],"genre_scores_gemma":[0.9187497,0.00045725642,0.058811735,0.00046541914,0.00020564151,0.00017121356,0.00006829194,0.00024899148,0.020821752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959594,0.00015709059,0.000012857966,0.000048276754,0.00012881182,0.000057046844],"domain_scores_gemma":[0.9995678,0.00016842717,0.000039454702,0.0001209583,0.000047814003,0.000055565382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008623797,0.0006221466,0.001033656,0.00085900293,0.0010657806,0.0013601494,0.0012900003,0.0010780904,0.0116532575],"category_scores_gemma":[0.0022820584,0.0004141246,0.0006121875,0.0006988555,0.0028954053,0.0031036246,0.0021497684,0.0018432251,0.00078227575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022139362,0.000014491323,0.000032209235,0.000021282813,0.0000052371993,0.000014335639,0.000026695088,0.0073106047,0.00063329673,0.9882174,0.0005374017,0.0031649228],"study_design_scores_gemma":[0.000021962227,0.00002046691,0.00007263522,0.000013409719,0.000005483424,0.000029994424,0.000020170075,0.080981284,0.00069998496,0.9168445,0.001273404,0.000016783632],"about_ca_topic_score_codex":0.000622999,"about_ca_topic_score_gemma":0.0013562797,"teacher_disagreement_score":0.0116532575,"about_ca_system_score_codex":0.0009291609,"about_ca_system_score_gemma":0.0009879986,"threshold_uncertainty_score":0.038984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.776794,0.0006441466,0.20298192,0.0009445416,0.00022788344,0.0000432355,0.00007892892,0.0030399847,0.015245256],"genre_scores_gemma":[0.99072963,0.000059766837,0.006767812,0.00006435325,0.000039785056,0.0000087002245,0.000024411485,0.00009224632,0.0022132457],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997527,0.000046216428,0.000006375449,0.00005380632,0.00008742437,0.00005344909],"domain_scores_gemma":[0.9989176,0.000526338,0.00008430037,0.00025235556,0.000120226134,0.00009913271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060182903,0.0002742577,0.00056835834,0.00020013232,0.0003822861,0.00088383415,0.000705657,0.00063004706,0.0043297173],"category_scores_gemma":[0.0023218486,0.00018602434,0.00015000737,0.00020043807,0.0007046067,0.001255283,0.0010792845,0.00084369804,0.00091075955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031365596,0.00078664685,0.004228752,0.00025806454,0.00013939539,0.00018279336,0.0001531099,0.21729875,0.4818645,0.12522686,0.0048604477,0.16186412],"study_design_scores_gemma":[0.00006795301,0.00055044226,0.0008711558,0.000009406702,0.000025986188,0.000062298226,0.00002878569,0.85855794,0.11507957,0.022355638,0.0023574287,0.000033453496],"about_ca_topic_score_codex":0.00013871348,"about_ca_topic_score_gemma":0.00032411527,"teacher_disagreement_score":0.0043297173,"about_ca_system_score_codex":0.00023474383,"about_ca_system_score_gemma":0.00026630034,"threshold_uncertainty_score":0.014484346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11335357,0.0002967547,0.84745336,0.00085260614,0.00006755326,0.00016482748,0.00068962044,0.0018981781,0.03522356],"genre_scores_gemma":[0.6404615,0.00024080154,0.350765,0.00030072994,0.000057072783,0.00036295629,0.0006793684,0.00079796487,0.0063345637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998898,0.00020864196,0.00005705809,0.00013722788,0.000515088,0.00018393264],"domain_scores_gemma":[0.99708444,0.0019235236,0.00011796867,0.00043482706,0.00038456474,0.0000547515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012465738,0.0006488196,0.0005764021,0.0008666538,0.0007393147,0.0015683345,0.0014350052,0.0005977508,0.012419813],"category_scores_gemma":[0.006592157,0.00038326255,0.00086309656,0.00077787065,0.0010951932,0.0021886795,0.0012825473,0.0014524756,0.0013150639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033658024,0.00008778658,0.0018772713,0.00029586072,0.000050815986,0.00019961802,0.00013735949,0.73458916,0.016502436,0.20014672,0.004166923,0.041609462],"study_design_scores_gemma":[0.00001314141,0.000018174116,0.00021534633,0.000010692585,0.000008579624,0.00001901515,0.000020083313,0.96826607,0.0063750725,0.023954924,0.0010903655,0.000008515228],"about_ca_topic_score_codex":0.0038697694,"about_ca_topic_score_gemma":0.0052374974,"teacher_disagreement_score":0.012419813,"about_ca_system_score_codex":0.002295351,"about_ca_system_score_gemma":0.002334805,"threshold_uncertainty_score":0.04154843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005487448,0.00025428057,0.98709106,0.00039281778,0.000088997986,0.000044602126,0.00004501355,0.0000909355,0.006504796],"genre_scores_gemma":[0.29099125,0.000691736,0.6916101,0.0004696267,0.00020869978,0.00033850825,0.00016715562,0.00032799065,0.015195036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996201,0.00018639948,0.000013070297,0.000035747526,0.00011596358,0.000028692762],"domain_scores_gemma":[0.9994161,0.0003670744,0.000029266406,0.000056112323,0.00008883667,0.000042532614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071884,0.0008317176,0.0010059926,0.0005102139,0.0005105411,0.0009677579,0.0012956546,0.0011350169,0.004159389],"category_scores_gemma":[0.002893059,0.0005162162,0.0005548378,0.000791498,0.0013148141,0.001286692,0.0019058125,0.001825366,0.0006200375],"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.000104533385,0.000080225,0.00016737843,0.00014682404,0.000056529265,0.000054830656,0.00009965441,0.43027356,0.003108035,0.51802003,0.004268718,0.04361966],"study_design_scores_gemma":[0.0000098184955,0.0000118943235,0.000027248743,0.000005505823,0.0000034584693,0.000006285377,0.0000046659047,0.9515529,0.00024248609,0.047270477,0.0008604502,0.000004654074],"about_ca_topic_score_codex":0.0035043275,"about_ca_topic_score_gemma":0.004193633,"teacher_disagreement_score":0.004159389,"about_ca_system_score_codex":0.0010000303,"about_ca_system_score_gemma":0.001408547,"threshold_uncertainty_score":0.0139145255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95825946,0.00047969428,0.03604834,0.00010767116,0.0000320667,0.000025352048,0.00006438236,0.000074430216,0.004908588],"genre_scores_gemma":[0.9963781,0.00012026959,0.0029830625,0.000017618102,0.000007328017,0.000014261535,0.00003796401,0.00001018777,0.00043115215],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999449,0.000007239128,0.0000021254093,0.000013239985,0.000014595184,0.00001784842],"domain_scores_gemma":[0.99977654,0.000067879155,0.00007556913,0.000028692244,0.000027232712,0.000024183906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023552848,0.0002523101,0.00013507904,0.0003411989,0.00028387146,0.000220104,0.00038428145,0.00025395775,0.0023940508],"category_scores_gemma":[0.00037576334,0.00013817725,0.00023729542,0.00017787179,0.00043462907,0.0006058294,0.0002823919,0.0004202632,0.0001891544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021774322,0.00010753586,0.002175306,0.0002882792,0.00004111856,0.000549746,0.00052954204,0.009501848,0.92423314,0.04893637,0.00025551327,0.013163977],"study_design_scores_gemma":[0.00010671349,0.0008561584,0.017410869,0.000059483886,0.00008516188,0.0009476271,0.00047543625,0.3955388,0.5422577,0.03930079,0.0027981433,0.00016309337],"about_ca_topic_score_codex":0.00021142664,"about_ca_topic_score_gemma":0.00027506976,"teacher_disagreement_score":0.0023940508,"about_ca_system_score_codex":0.00019539522,"about_ca_system_score_gemma":0.00012346025,"threshold_uncertainty_score":0.008008897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955106,0.00017634043,0.0018387925,0.000112420756,0.000006720025,0.000006252908,0.000021968082,0.000037412225,0.002289414],"genre_scores_gemma":[0.99926525,0.00006565676,0.00021036269,0.000009045666,0.000004771461,0.0000041094686,0.000009656733,0.00001478621,0.00041636542],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998172,0.000055337598,0.0000072214207,0.000020865884,0.00005348558,0.000045861605],"domain_scores_gemma":[0.99807966,0.0014187553,0.00016875751,0.00010047857,0.000072604766,0.00015986848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077387295,0.00025276182,0.00030793383,0.0005625651,0.00059470575,0.00057351356,0.00035517424,0.00031205898,0.0028418975],"category_scores_gemma":[0.0023221823,0.00032587018,0.00017289669,0.00028085342,0.0013606773,0.00080051296,0.00083369133,0.0005172207,0.00019051846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001632599,0.00044422207,0.007287741,0.00014537615,0.0001137944,0.0006663557,0.00096987665,0.07386386,0.8645193,0.03789425,0.0005520652,0.011910657],"study_design_scores_gemma":[0.00014612744,0.0005307844,0.026173221,0.000032594864,0.00012690044,0.00039936864,0.0003221729,0.4877667,0.4679992,0.015037092,0.0012769277,0.00018882452],"about_ca_topic_score_codex":0.0005769306,"about_ca_topic_score_gemma":0.0010036688,"teacher_disagreement_score":0.0028418975,"about_ca_system_score_codex":0.00036727745,"about_ca_system_score_gemma":0.00032959168,"threshold_uncertainty_score":0.00950706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93854684,0.00011281146,0.05537381,0.00052535546,0.000099139455,0.000071976516,0.0000699872,0.00017847025,0.005021698],"genre_scores_gemma":[0.98290974,0.00006110467,0.015964407,0.00007589159,0.000014458261,0.000042148895,0.000023512699,0.00001749897,0.00089137314],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997392,0.000055758595,0.000010402817,0.00004728165,0.000099748,0.000047602884],"domain_scores_gemma":[0.99965334,0.00011791987,0.000090606685,0.000076930344,0.000027027816,0.000034235116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052247476,0.00025468157,0.00023658968,0.00010221571,0.00034211334,0.0004507852,0.00072189193,0.00053467555,0.0017008398],"category_scores_gemma":[0.0007131436,0.000140982,0.00019911343,0.00012326545,0.0009328453,0.0008681436,0.0009938243,0.00060180266,0.0002574145],"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.00056699617,0.00012834421,0.0009979138,0.00019251357,0.000025388841,0.0003967459,0.00025617355,0.0036000914,0.89864093,0.08809335,0.00026510938,0.0068364595],"study_design_scores_gemma":[0.00012291185,0.00093693996,0.0005275744,0.000020983147,0.0000259174,0.00015858808,0.00006128038,0.021645451,0.9635492,0.009371174,0.0035473467,0.000032626405],"about_ca_topic_score_codex":0.00013817988,"about_ca_topic_score_gemma":0.0001435302,"teacher_disagreement_score":0.0017008398,"about_ca_system_score_codex":0.00020770202,"about_ca_system_score_gemma":0.0002898321,"threshold_uncertainty_score":0.005689919},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6515128,0.0006149435,0.19493543,0.0034396183,0.0006719648,0.00010488196,0.00040278054,0.0005275751,0.14779003],"genre_scores_gemma":[0.9241076,0.00021452848,0.053197313,0.0005771173,0.0000936031,0.0002485564,0.0003156271,0.00018355125,0.021062044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998638,0.00035110003,0.00007265369,0.00025865072,0.00044919056,0.00023047012],"domain_scores_gemma":[0.99627113,0.002356349,0.00019031334,0.00051559944,0.0002707275,0.00039583424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020422158,0.0007233215,0.0009012359,0.0010151777,0.0020934518,0.0020509437,0.0018979044,0.0020639158,0.00964353],"category_scores_gemma":[0.0066201137,0.0011261823,0.0007570801,0.00046991036,0.0030539075,0.0042458973,0.004342475,0.0030407105,0.0009897533],"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.00013888687,0.000036432422,0.00024266694,0.00005658867,0.000015274123,0.0001268592,0.00013070116,0.0021476843,0.0056586484,0.9867142,0.0012927797,0.0034391915],"study_design_scores_gemma":[0.00007713198,0.00007510475,0.000497913,0.00004237789,0.000016368513,0.0003525624,0.00015273588,0.029840363,0.013988754,0.9510181,0.0038903423,0.000048344114],"about_ca_topic_score_codex":0.00035924482,"about_ca_topic_score_gemma":0.000516134,"teacher_disagreement_score":0.00964353,"about_ca_system_score_codex":0.0006564698,"about_ca_system_score_gemma":0.00077806634,"threshold_uncertainty_score":0.032260776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31111947,0.002947358,0.55382526,0.0034423748,0.0007405577,0.00034135493,0.00018067863,0.00028296292,0.12712006],"genre_scores_gemma":[0.90716547,0.0012915343,0.06744372,0.0005056935,0.00020922058,0.00017949424,0.0000869827,0.00012421352,0.022993665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996501,0.00012689242,0.000017029488,0.000034773002,0.00010540569,0.00006566407],"domain_scores_gemma":[0.9993741,0.00023026681,0.00007496037,0.00008546908,0.00014562813,0.000089675355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010569451,0.00082927744,0.0010771937,0.0010021725,0.0014737184,0.0014723121,0.0020402514,0.0021753956,0.0040435316],"category_scores_gemma":[0.0025861189,0.00062958786,0.0012121127,0.0011433184,0.0028863857,0.0017879163,0.0014783449,0.0014688385,0.0005211979],"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.00008937124,0.000100142606,0.0005695632,0.00017061397,0.000043632186,0.00057527935,0.00042412672,0.13287418,0.007082916,0.8515935,0.0016185921,0.004858039],"study_design_scores_gemma":[0.00002695374,0.000027034446,0.00027959232,0.000025910902,0.000017559132,0.00012404042,0.00016800716,0.8997856,0.0007254806,0.09744068,0.0013478741,0.000031265725],"about_ca_topic_score_codex":0.0035102624,"about_ca_topic_score_gemma":0.0028900113,"teacher_disagreement_score":0.0040435316,"about_ca_system_score_codex":0.0010642983,"about_ca_system_score_gemma":0.0015851726,"threshold_uncertainty_score":0.0135269165},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96905744,0.00023670137,0.0064647454,0.00091642985,0.0001644153,0.000044854645,0.00047431898,0.00065454765,0.021986617],"genre_scores_gemma":[0.996207,0.000028214203,0.0024005803,0.000079895384,0.00002309288,0.000022063998,0.00038113087,0.00007893687,0.0007790155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983039,0.00057351077,0.000046781966,0.00013550682,0.0005805867,0.0003596861],"domain_scores_gemma":[0.9962089,0.0015874259,0.00011544503,0.00079948705,0.000926683,0.00036212712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022996517,0.0003302585,0.0009275736,0.000632579,0.0013773843,0.0010096394,0.001685099,0.0009065843,0.0063900338],"category_scores_gemma":[0.0061504124,0.0002039671,0.00027963292,0.001309577,0.0016006671,0.001288026,0.001120444,0.0010648399,0.00046005214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005944813,0.0016584296,0.01668668,0.0005205726,0.0003498694,0.0006223235,0.00056781445,0.6261667,0.015813928,0.2577809,0.039515343,0.034372646],"study_design_scores_gemma":[0.00017036273,0.00035063855,0.0028026844,0.000016013295,0.000021050144,0.000041629668,0.00014670327,0.9700417,0.006753642,0.018070245,0.0015546996,0.000030678675],"about_ca_topic_score_codex":0.00561578,"about_ca_topic_score_gemma":0.006526815,"teacher_disagreement_score":0.0063900338,"about_ca_system_score_codex":0.0015523119,"about_ca_system_score_gemma":0.0018983027,"threshold_uncertainty_score":0.021376789},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46677792,0.00092364167,0.4589902,0.0016516146,0.00056286115,0.0001937729,0.0003037438,0.00037092055,0.07022542],"genre_scores_gemma":[0.965102,0.00024983444,0.022458991,0.00021459966,0.00006262346,0.000107897904,0.00006434411,0.000068360234,0.01167137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842274,0.00063120783,0.00007084239,0.00019793762,0.0004011367,0.0002762465],"domain_scores_gemma":[0.9962309,0.0018573563,0.00017533166,0.0012698974,0.00018425824,0.00028220977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023479236,0.00057984155,0.0013703626,0.0008417363,0.0012141191,0.0023598077,0.0020628397,0.0015707765,0.010171376],"category_scores_gemma":[0.0053277635,0.00062890386,0.0006913593,0.0015046477,0.0035995133,0.004621571,0.0039428947,0.0016243043,0.00094288273],"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.0005239765,0.000111457455,0.00026876686,0.00007633332,0.000049721235,0.00021771756,0.0001490655,0.020443382,0.008141554,0.9597301,0.00097071694,0.00931734],"study_design_scores_gemma":[0.000099156416,0.000111198715,0.00035807138,0.00003110478,0.000030393745,0.00018334705,0.000119793374,0.3190669,0.009109671,0.6685169,0.0023071053,0.00006631897],"about_ca_topic_score_codex":0.00028945462,"about_ca_topic_score_gemma":0.00045077986,"teacher_disagreement_score":0.010171376,"about_ca_system_score_codex":0.00079555553,"about_ca_system_score_gemma":0.0009341434,"threshold_uncertainty_score":0.034026682},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90030926,0.00080018543,0.055798084,0.0014052975,0.00090659317,0.00021851437,0.00093343866,0.002173599,0.03745511],"genre_scores_gemma":[0.9716404,0.000112629714,0.024929168,0.00012862225,0.00005429785,0.0000999179,0.00056611665,0.00022294538,0.002245966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960908,0.0015027939,0.00021221356,0.00055776676,0.0012189846,0.00041735338],"domain_scores_gemma":[0.9920648,0.0031303554,0.00016500456,0.0025687856,0.001738389,0.00033273143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027105077,0.0008223394,0.0011695386,0.0009255648,0.0010205032,0.0017654375,0.0023780104,0.0023920485,0.009020382],"category_scores_gemma":[0.014581757,0.0005526509,0.0004814645,0.0015226665,0.001529385,0.003658362,0.0013492376,0.0018754079,0.0009977296],"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.0034390697,0.0027832754,0.008040183,0.0011302136,0.0005334529,0.000416818,0.00035651345,0.6514233,0.037714653,0.15791903,0.025863275,0.1103803],"study_design_scores_gemma":[0.00023885057,0.0009100259,0.0016421383,0.00005050324,0.00008664779,0.00009178375,0.00016703582,0.9014037,0.05081755,0.03755564,0.006987733,0.000048374895],"about_ca_topic_score_codex":0.0019653796,"about_ca_topic_score_gemma":0.0019128533,"teacher_disagreement_score":0.009020382,"about_ca_system_score_codex":0.0013226407,"about_ca_system_score_gemma":0.0018913425,"threshold_uncertainty_score":0.030176222},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7834056,0.000732802,0.12098899,0.0018114103,0.000773715,0.00027875009,0.0036297732,0.0005978962,0.08778103],"genre_scores_gemma":[0.94710153,0.00034800568,0.027442379,0.00033116437,0.00022321471,0.0003198028,0.004016903,0.00022061208,0.01999643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991786,0.00015262423,0.000082514685,0.000108349166,0.00023707515,0.0002407897],"domain_scores_gemma":[0.9964359,0.0010094681,0.0006062128,0.0004996262,0.000904903,0.0005440056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064580276,0.00041193585,0.00045408795,0.0027119801,0.0022581415,0.003165687,0.0010734822,0.0011924868,0.01408439],"category_scores_gemma":[0.0036188613,0.000218519,0.00067901536,0.0013934505,0.0019475446,0.0026410385,0.001073469,0.0010431833,0.0016894523],"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.0005073837,0.00021328562,0.007265819,0.0001365421,0.000022055532,0.00023572885,0.0005326817,0.0021077995,0.011496699,0.91585207,0.011592655,0.05003725],"study_design_scores_gemma":[0.000098803735,0.00024969765,0.015563437,0.00020224933,0.000044430355,0.000552839,0.00078993704,0.088473484,0.01352134,0.84290624,0.03744291,0.00015456646],"about_ca_topic_score_codex":0.0016250082,"about_ca_topic_score_gemma":0.0013852135,"teacher_disagreement_score":0.01408439,"about_ca_system_score_codex":0.0011707196,"about_ca_system_score_gemma":0.0013762619,"threshold_uncertainty_score":0.047116995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17360224,0.00061318744,0.69252807,0.0016956663,0.0005870672,0.0002330091,0.00034950633,0.0019776744,0.12841356],"genre_scores_gemma":[0.8043491,0.00021324785,0.17067999,0.00034332013,0.00006769939,0.00014483377,0.000225822,0.0002861562,0.023689814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994392,0.00014748539,0.00003564031,0.000104656836,0.0001573328,0.000115603296],"domain_scores_gemma":[0.9994393,0.0001958543,0.000023059929,0.00020782142,0.000083178005,0.000050702172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006472946,0.0004201595,0.0005150671,0.0003993821,0.0012237326,0.0013065564,0.0009260155,0.0008064616,0.014328489],"category_scores_gemma":[0.0018143766,0.00021361324,0.00031999123,0.00041776252,0.00096810743,0.0020133858,0.0016982445,0.0010628281,0.002375679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045729397,0.00016858712,0.00026356213,0.00016386856,0.000016523123,0.00017216963,0.00016692729,0.017175052,0.02529076,0.86481744,0.007271749,0.08403614],"study_design_scores_gemma":[0.00007780565,0.00018165076,0.0001771672,0.000056063436,0.00001721025,0.00025364672,0.0001334304,0.22503914,0.04045417,0.70591986,0.027632453,0.00005742125],"about_ca_topic_score_codex":0.00027592183,"about_ca_topic_score_gemma":0.0006342808,"teacher_disagreement_score":0.014328489,"about_ca_system_score_codex":0.00051768165,"about_ca_system_score_gemma":0.0007106111,"threshold_uncertainty_score":0.04793352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4611834,0.0002879539,0.50843865,0.001606022,0.00019191766,0.00036345317,0.0005537931,0.0016845363,0.025690252],"genre_scores_gemma":[0.88856554,0.000089107205,0.10263927,0.0001962567,0.000045840603,0.00013138434,0.00047762293,0.00031669918,0.0075382767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994411,0.0001957777,0.000015230346,0.00011471417,0.00015267321,0.000080509846],"domain_scores_gemma":[0.9965419,0.0021834488,0.00018797562,0.0005623139,0.00025014763,0.00027422636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007684588,0.0005236429,0.00076162076,0.0008351169,0.0011132525,0.0011509516,0.0014725695,0.0011993371,0.007372474],"category_scores_gemma":[0.005129138,0.00045610112,0.00078586134,0.00062859524,0.0011066836,0.002033724,0.0020419804,0.0013036496,0.0006951983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007880087,0.00028835968,0.002189057,0.00040369362,0.0001082364,0.00070577953,0.0009844977,0.26316917,0.023889448,0.5920158,0.0212143,0.09424364],"study_design_scores_gemma":[0.000056896275,0.00003864151,0.00028570066,0.000009928968,0.0000125841,0.00009354328,0.00008914996,0.7680153,0.0027841877,0.22706535,0.0015344827,0.000014179686],"about_ca_topic_score_codex":0.0020467523,"about_ca_topic_score_gemma":0.0045221443,"teacher_disagreement_score":0.007372474,"about_ca_system_score_codex":0.001143363,"about_ca_system_score_gemma":0.00089886814,"threshold_uncertainty_score":0.024663389},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8335489,0.000928368,0.11191091,0.0015140206,0.00019415849,0.00008074572,0.00038545864,0.00055623014,0.050881185],"genre_scores_gemma":[0.97709423,0.00033032542,0.012714575,0.00024438175,0.000094680814,0.00008440607,0.0002920532,0.0001307429,0.0090146335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993364,0.00021784856,0.000023278235,0.00012763312,0.00015647364,0.00013839257],"domain_scores_gemma":[0.9957367,0.0023418139,0.0003699705,0.0003553875,0.00042791045,0.0007681614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077925465,0.0007094615,0.0009898876,0.0024320567,0.0031971403,0.0028803074,0.0017918787,0.0019179581,0.0037422082],"category_scores_gemma":[0.003883161,0.0007539155,0.0009269658,0.0013644978,0.0027059796,0.0021602816,0.0010839655,0.0017901319,0.0003455346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052834825,0.000040548864,0.0003481868,0.00003660662,0.000015802994,0.0002616408,0.00019879598,0.006412478,0.0016937832,0.9871666,0.0012564807,0.0025162278],"study_design_scores_gemma":[0.000045891506,0.000029675031,0.00048040596,0.000030928444,0.000015522164,0.00031813607,0.000098490826,0.09112597,0.0007502708,0.9053038,0.0017724936,0.000028464809],"about_ca_topic_score_codex":0.0023005437,"about_ca_topic_score_gemma":0.0025160536,"teacher_disagreement_score":0.0037422082,"about_ca_system_score_codex":0.0014565234,"about_ca_system_score_gemma":0.0011061254,"threshold_uncertainty_score":0.012518942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19443464,0.00042021598,0.78190374,0.0020253698,0.00034161282,0.00011312839,0.00006761226,0.0004076421,0.020286128],"genre_scores_gemma":[0.97125363,0.00008802613,0.025808007,0.0000957884,0.00003274161,0.000052829047,0.000017831293,0.000053099688,0.0025980603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961,0.00013161117,0.000010271382,0.00007364266,0.00008229007,0.00009214582],"domain_scores_gemma":[0.99855036,0.0010185114,0.00008432003,0.00009887801,0.0001587985,0.00008918481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009848905,0.00044769509,0.0010163351,0.00055154396,0.00076983304,0.0015734364,0.0011719492,0.0010957599,0.0032155686],"category_scores_gemma":[0.0037936284,0.0004703516,0.00048731355,0.0005600477,0.0021676363,0.0014530454,0.0010094831,0.0012476031,0.00021543403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019104782,0.000119029995,0.00026891133,0.000040828585,0.00002993671,0.000031553078,0.00007790307,0.8198433,0.006838643,0.1597498,0.0009780445,0.011830988],"study_design_scores_gemma":[0.000011550049,0.000010752316,0.00003792153,0.000001763938,0.0000021696144,0.0000014335777,0.000004448751,0.98548025,0.00028277928,0.014039642,0.00012279619,0.0000044547287],"about_ca_topic_score_codex":0.0039214916,"about_ca_topic_score_gemma":0.0039795665,"teacher_disagreement_score":0.0039214916,"about_ca_system_score_codex":0.0019058571,"about_ca_system_score_gemma":0.0015744639,"threshold_uncertainty_score":0.013828039},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059776045,0.00081239914,0.31735846,0.0026497636,0.0018503446,0.0004320077,0.00065515883,0.0013583177,0.61510754],"genre_scores_gemma":[0.7299643,0.00073025207,0.049144316,0.0013938255,0.0004907836,0.00065316824,0.0007446408,0.00074398774,0.21613479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993773,0.0001605766,0.00001722922,0.00014295962,0.0001825185,0.000119411685],"domain_scores_gemma":[0.9995658,0.00011929601,0.000021070255,0.00019301484,0.000052990723,0.000047736725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005844496,0.00078786147,0.0008728664,0.0011736494,0.0020608294,0.0023963056,0.0010129875,0.0021542953,0.061507475],"category_scores_gemma":[0.0017379466,0.00043627573,0.0006969652,0.00094577944,0.0016115392,0.0031236007,0.0031156363,0.002325531,0.011905746],"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.000034833058,0.000032392945,0.000060225335,0.000035474848,0.0000072692574,0.000048191298,0.000059468486,0.00083260785,0.0023342127,0.9818715,0.0050096023,0.009674272],"study_design_scores_gemma":[0.00002923544,0.00005102823,0.00021227705,0.000026463556,0.0000115545245,0.0002692616,0.00007626524,0.022384953,0.013227565,0.93856376,0.025118427,0.000029073733],"about_ca_topic_score_codex":0.00016748658,"about_ca_topic_score_gemma":0.0001352248,"teacher_disagreement_score":0.061507475,"about_ca_system_score_codex":0.00084617786,"about_ca_system_score_gemma":0.00065033074,"threshold_uncertainty_score":0.20576304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16054608,0.0029889515,0.5990625,0.008423207,0.0006371038,0.000089515604,0.00041819958,0.00022980644,0.22760464],"genre_scores_gemma":[0.937019,0.0011987408,0.041766144,0.0007716698,0.00059694774,0.00009933428,0.00016461824,0.00008462313,0.018298974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992471,0.00028225683,0.000026994889,0.0000913079,0.0002239647,0.00012841565],"domain_scores_gemma":[0.99785894,0.0011655798,0.00013672191,0.00043817275,0.00026498493,0.00013554451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010180121,0.0003635563,0.00055491104,0.0009354813,0.0010025224,0.0022660324,0.0007414638,0.001401569,0.0049823215],"category_scores_gemma":[0.0040178006,0.000294637,0.0005632688,0.00081298343,0.0040812767,0.0049730516,0.0021331334,0.0025745437,0.0006183938],"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.0000049769747,0.0000022619429,0.000014679401,0.000004923872,8.5911984e-7,0.0000072902785,0.000018583527,0.00076998747,0.0001608975,0.9979225,0.00016140868,0.0009317067],"study_design_scores_gemma":[0.0000035890284,0.000003329308,0.000029301194,0.0000063554567,9.568657e-7,0.000016577687,0.000010631334,0.010234996,0.00019076956,0.98881465,0.0006843047,0.0000044834715],"about_ca_topic_score_codex":0.0009730277,"about_ca_topic_score_gemma":0.0006796385,"teacher_disagreement_score":0.0049823215,"about_ca_system_score_codex":0.00080574304,"about_ca_system_score_gemma":0.00092541444,"threshold_uncertainty_score":0.016667545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2587305,0.00050693384,0.5467973,0.0041617854,0.0007966933,0.00026480007,0.0006490192,0.0013655962,0.18672736],"genre_scores_gemma":[0.92625815,0.0002095636,0.05395932,0.0005903883,0.00020005263,0.00022719166,0.00020004806,0.00019418135,0.018160952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975272,0.00061935827,0.00012695062,0.00022787848,0.001007628,0.0004908595],"domain_scores_gemma":[0.996777,0.0013108952,0.00022662779,0.0009694489,0.0003511024,0.000364882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020562029,0.0005424341,0.000937708,0.0012121744,0.001958586,0.0048820083,0.0016319574,0.002281432,0.011885878],"category_scores_gemma":[0.0053942986,0.000503019,0.00073917344,0.0010237971,0.005108247,0.007840666,0.0047232914,0.004004532,0.0019733657],"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.000052386105,0.000038083293,0.000045049397,0.0000116921865,0.000002932926,0.00003894579,0.00008745755,0.0010538022,0.0010114302,0.9946866,0.0004977019,0.0024740337],"study_design_scores_gemma":[0.0000419099,0.00003211064,0.000042662552,0.00001677174,0.000005186083,0.00006471675,0.0000579068,0.024549574,0.0020817295,0.9714432,0.0016332897,0.000030985055],"about_ca_topic_score_codex":0.00047238654,"about_ca_topic_score_gemma":0.0006279878,"teacher_disagreement_score":0.011885878,"about_ca_system_score_codex":0.0014653048,"about_ca_system_score_gemma":0.0014800294,"threshold_uncertainty_score":0.03976226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036977716,0.0003461416,0.9553282,0.000461809,0.00018745917,0.00012471952,0.00012932789,0.0006770308,0.0057674646],"genre_scores_gemma":[0.3915724,0.0002202072,0.5990174,0.00023457564,0.00007239557,0.00023890311,0.00037607556,0.00012851864,0.008139537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995347,0.00010282717,0.000022830129,0.00012095592,0.00016782564,0.00005080838],"domain_scores_gemma":[0.99950755,0.0001654832,0.000030308225,0.00011393546,0.000129736,0.00005297354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038757495,0.00029675954,0.0009568476,0.0012191521,0.00094077084,0.00087617664,0.0016213886,0.0013935621,0.0050033526],"category_scores_gemma":[0.0018864681,0.00020905385,0.00073487224,0.0015188254,0.0007665199,0.0019428856,0.0016858606,0.0011794537,0.0006621324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027756664,0.00031086645,0.0011661545,0.00024242763,0.00012758857,0.00015868619,0.0002871463,0.11276748,0.015556144,0.42397594,0.010580582,0.43454942],"study_design_scores_gemma":[0.00006551787,0.00008556485,0.00034833,0.000011638776,0.000026455209,0.00013860058,0.000058380265,0.8408797,0.0035425702,0.15097493,0.0038424798,0.000025830499],"about_ca_topic_score_codex":0.0025193803,"about_ca_topic_score_gemma":0.0031254427,"teacher_disagreement_score":0.0050033526,"about_ca_system_score_codex":0.0008734634,"about_ca_system_score_gemma":0.0015304266,"threshold_uncertainty_score":0.016737938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46321347,0.0011321078,0.5062586,0.004961644,0.00037329356,0.00022738494,0.000170042,0.0006360653,0.023027327],"genre_scores_gemma":[0.964635,0.00033271412,0.033105265,0.00016159107,0.00009258172,0.000059443202,0.000050071474,0.000043905344,0.00151938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954527,0.0014751024,0.00019286347,0.00053292187,0.0015374108,0.00080906454],"domain_scores_gemma":[0.9898774,0.0060284887,0.00070596515,0.0024178245,0.0006870821,0.0002831793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005548914,0.0010724615,0.0011767464,0.00089912553,0.0014419401,0.0027470016,0.0017940659,0.0021169833,0.002976313],"category_scores_gemma":[0.016080294,0.00062714977,0.0007129001,0.0007811047,0.0039481153,0.0074547697,0.0055655106,0.0038868336,0.0006286914],"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.0014506484,0.00032052837,0.0022866565,0.00028130016,0.00011944043,0.00021429271,0.000508892,0.19586895,0.055488937,0.68393517,0.002920631,0.056604635],"study_design_scores_gemma":[0.000106945714,0.00017516353,0.00026944623,0.00004348459,0.000051019604,0.0001028481,0.000088148096,0.63449055,0.023712896,0.33906618,0.001838632,0.00005466729],"about_ca_topic_score_codex":0.0005472709,"about_ca_topic_score_gemma":0.0005260106,"teacher_disagreement_score":0.005548914,"about_ca_system_score_codex":0.0014555259,"about_ca_system_score_gemma":0.0028611228,"threshold_uncertainty_score":0.02934581},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022095027,0.0007353699,0.9907426,0.0004628111,0.00010916641,0.000023869925,0.00007543973,0.00012372441,0.0055174],"genre_scores_gemma":[0.20869102,0.0054780934,0.7589908,0.00053273916,0.00087805523,0.00045420058,0.0004651555,0.00052760844,0.023982294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990069,0.0005126241,0.000031910327,0.00010327987,0.00029536654,0.000049907932],"domain_scores_gemma":[0.9982337,0.0010674013,0.000075505275,0.00031164038,0.00023008962,0.00008160081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016246042,0.001284885,0.0012090413,0.0011298197,0.0009084611,0.0015472147,0.0013378501,0.0015122744,0.00634488],"category_scores_gemma":[0.0057629347,0.0008554828,0.00092662626,0.0019175657,0.0029519603,0.0034607681,0.0029075507,0.004409416,0.0015149558],"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.00002830919,0.000028042956,0.0000486426,0.000085807755,0.000018967883,0.000022276365,0.000061083796,0.02395682,0.0010240166,0.9414026,0.0036162317,0.02970726],"study_design_scores_gemma":[0.000014166997,0.000013443446,0.00005004668,0.00001888251,0.000007856537,0.000028455703,0.0000142385,0.23971307,0.0006619857,0.7549053,0.0045526824,0.000019924288],"about_ca_topic_score_codex":0.0015386555,"about_ca_topic_score_gemma":0.0015379669,"teacher_disagreement_score":0.00634488,"about_ca_system_score_codex":0.00088923064,"about_ca_system_score_gemma":0.0012221093,"threshold_uncertainty_score":0.02122575},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7483206,0.0005027252,0.19723824,0.0015746921,0.00015707107,0.00011461893,0.00020227325,0.00020700644,0.051682748],"genre_scores_gemma":[0.98699284,0.000122046426,0.009701047,0.0001525419,0.00005094508,0.00007098033,0.00006527518,0.000032622953,0.002811687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811447,0.0007246891,0.00010510365,0.00020332228,0.0005303323,0.00032217955],"domain_scores_gemma":[0.99622583,0.0017995827,0.0003766704,0.0007765205,0.00032233473,0.0004990005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027180072,0.00037488836,0.0011839241,0.0012819788,0.0021225591,0.0047427253,0.001799704,0.002143034,0.004250375],"category_scores_gemma":[0.005886234,0.00074528466,0.00049284945,0.0011682916,0.0045935954,0.005605043,0.003508293,0.002450657,0.00046031643],"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.00006510808,0.000041155363,0.00020126607,0.00001771708,0.0000115100265,0.000097363234,0.0001568525,0.0068427594,0.0013693371,0.9895188,0.0002767802,0.0014013976],"study_design_scores_gemma":[0.000022298971,0.000031221483,0.0003491464,0.000010592561,0.000009387541,0.00007376954,0.00014072916,0.10322698,0.0007731343,0.8949455,0.0003894118,0.00002773887],"about_ca_topic_score_codex":0.00060885015,"about_ca_topic_score_gemma":0.0006765404,"teacher_disagreement_score":0.0047427253,"about_ca_system_score_codex":0.0011977017,"about_ca_system_score_gemma":0.0009243887,"threshold_uncertainty_score":0.014374316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6754209,0.0017369896,0.29444736,0.0028702875,0.0002517014,0.00009862089,0.00068608753,0.0005479997,0.023940083],"genre_scores_gemma":[0.98442036,0.0005327552,0.010308408,0.00016105328,0.00016664907,0.000077858596,0.00022194494,0.00015227642,0.0039587575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983802,0.0005871863,0.00007872817,0.00031490755,0.00036848756,0.00027061274],"domain_scores_gemma":[0.9714829,0.023580609,0.001042471,0.0015823714,0.0011336881,0.0011779232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003557619,0.0005528247,0.0018067876,0.0020456014,0.0012033823,0.003740998,0.00296776,0.0024946064,0.007030745],"category_scores_gemma":[0.028069716,0.0010718073,0.000828224,0.001953612,0.0034401861,0.008720885,0.00149069,0.0022655483,0.0005040603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002449465,0.00009296997,0.0013584236,0.00017546404,0.00007428977,0.00011423828,0.00019720748,0.13175124,0.0031747855,0.85275257,0.001929649,0.008134122],"study_design_scores_gemma":[0.000033894965,0.000027986624,0.0010158225,0.000026647933,0.000023221404,0.00008016287,0.000051705338,0.491537,0.0010169058,0.5057517,0.00039115068,0.000043756634],"about_ca_topic_score_codex":0.0013219557,"about_ca_topic_score_gemma":0.0014323007,"teacher_disagreement_score":0.007030745,"about_ca_system_score_codex":0.0016349395,"about_ca_system_score_gemma":0.0014333683,"threshold_uncertainty_score":0.023520231},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3916507,0.0014161763,0.28961274,0.01604937,0.0017963558,0.0002661561,0.0009050731,0.00038045866,0.29792297],"genre_scores_gemma":[0.918506,0.0006289692,0.030520935,0.001649051,0.00064682023,0.00017004744,0.0002399648,0.00016993316,0.04746822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794465,0.00063296186,0.000119732664,0.00021286719,0.00084636593,0.0002435431],"domain_scores_gemma":[0.9953506,0.0022947234,0.00033297215,0.00096276763,0.0006272082,0.00043170992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029228565,0.00038461864,0.00064261997,0.0012926266,0.0020932236,0.0034413924,0.0011897093,0.003236446,0.013383522],"category_scores_gemma":[0.010491031,0.0005645397,0.00067427114,0.0014853793,0.0043756943,0.01031523,0.002866465,0.003235754,0.00093272707],"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.0000054194306,0.0000039547135,0.000016040682,0.00000310624,0.0000012206685,0.000011464315,0.000045399538,0.00016188236,0.000101119425,0.99891055,0.00024070925,0.0004992214],"study_design_scores_gemma":[0.0000058143924,0.000006656248,0.000066777546,0.0000032940102,0.0000012741503,0.000032915377,0.000027150201,0.0031363398,0.00012057283,0.995613,0.0009785498,0.000007692474],"about_ca_topic_score_codex":0.0021300367,"about_ca_topic_score_gemma":0.0010505544,"teacher_disagreement_score":0.013383522,"about_ca_system_score_codex":0.0017007452,"about_ca_system_score_gemma":0.0020774573,"threshold_uncertainty_score":0.044772267},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14487897,0.0008766683,0.41386348,0.0060321903,0.005146033,0.00039990657,0.0009677282,0.0010951115,0.42674],"genre_scores_gemma":[0.6731073,0.00085176324,0.11938587,0.002980746,0.0024999701,0.0004497983,0.00090734125,0.0015333676,0.19828387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880016,0.00025838453,0.000088583765,0.0002334421,0.00036345705,0.00025593478],"domain_scores_gemma":[0.99915576,0.0001265758,0.00007618367,0.00015074458,0.00026870464,0.00022192617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017084415,0.0014351248,0.001000923,0.0025427844,0.0029084506,0.005048338,0.002083631,0.0036174462,0.022304669],"category_scores_gemma":[0.002134942,0.00057056145,0.0012222764,0.0016734217,0.0043602204,0.006471662,0.0024013652,0.0035977403,0.0059800325],"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.00001153606,0.000011261501,0.00001885182,0.000010289849,0.0000015323842,0.00006065598,0.00008120159,0.00009628151,0.00063547195,0.994826,0.0018576074,0.0023893497],"study_design_scores_gemma":[0.000011096932,0.000014078859,0.00003408493,0.000007727257,0.000001663168,0.00019393957,0.000055730194,0.0036945106,0.00045952492,0.99076676,0.0047426466,0.000018325662],"about_ca_topic_score_codex":0.0015135435,"about_ca_topic_score_gemma":0.0013460488,"teacher_disagreement_score":0.022304669,"about_ca_system_score_codex":0.0016319434,"about_ca_system_score_gemma":0.0018261021,"threshold_uncertainty_score":0.07461661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19988382,0.0019519887,0.6387575,0.008087162,0.0010847691,0.00019724561,0.0008974242,0.0013228036,0.14781725],"genre_scores_gemma":[0.901729,0.00067253533,0.07369602,0.0012149928,0.00045186692,0.00019015139,0.00037439907,0.00033890136,0.02133209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782854,0.00057944976,0.00011286547,0.0003922945,0.0007464731,0.0003403438],"domain_scores_gemma":[0.99600214,0.0017243319,0.0002953959,0.0010944738,0.0005305816,0.00035302967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019972648,0.0009766965,0.0014760141,0.0013137907,0.0021445989,0.0024558639,0.0021132745,0.0026387586,0.0062096054],"category_scores_gemma":[0.0073270435,0.0005865831,0.0009490747,0.0016011099,0.0054062465,0.0054798257,0.006105714,0.0056080474,0.0020477585],"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.00009189599,0.000021198452,0.000068842994,0.000033594653,0.000006671299,0.000039167917,0.00008130919,0.004647271,0.001423129,0.987176,0.001852772,0.00455808],"study_design_scores_gemma":[0.000044361328,0.000052822954,0.00006745716,0.000023190632,0.000011548112,0.00010149965,0.000033177796,0.04670956,0.0037211645,0.945878,0.0033078894,0.00004942157],"about_ca_topic_score_codex":0.00076764595,"about_ca_topic_score_gemma":0.00093969365,"teacher_disagreement_score":0.0062096054,"about_ca_system_score_codex":0.0018591806,"about_ca_system_score_gemma":0.002410254,"threshold_uncertainty_score":0.020773232},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8966082,0.0001032592,0.06329777,0.0012165676,0.0003969614,0.000098717595,0.00016338889,0.00032614204,0.037788957],"genre_scores_gemma":[0.98159856,0.000037071197,0.013422401,0.000051935884,0.000020713253,0.000046579986,0.00005556153,0.00003532915,0.004731715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969554,0.000059548518,0.000016600588,0.00006514131,0.00008754443,0.00007558585],"domain_scores_gemma":[0.99948823,0.00011726247,0.00003414808,0.0002035336,0.000061280305,0.0000954598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052735396,0.000289122,0.0006810682,0.00058074447,0.0024746375,0.0011743093,0.0011450197,0.0007682102,0.007049452],"category_scores_gemma":[0.00081731926,0.000257677,0.00041160476,0.0008059181,0.0011696228,0.0014805588,0.0019222789,0.0007008133,0.0004538032],"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.0012655687,0.00056220335,0.0027112004,0.0002464604,0.00010497217,0.00097281026,0.0009263448,0.077724144,0.15468787,0.72812176,0.005990077,0.026686529],"study_design_scores_gemma":[0.00026073016,0.00065454195,0.0021443672,0.00003924004,0.000069665664,0.00028952493,0.00035443186,0.74065995,0.13769731,0.10679081,0.010784958,0.00025445668],"about_ca_topic_score_codex":0.0018843954,"about_ca_topic_score_gemma":0.0034036315,"teacher_disagreement_score":0.007049452,"about_ca_system_score_codex":0.00097334484,"about_ca_system_score_gemma":0.0012458782,"threshold_uncertainty_score":0.023582757},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33145604,0.0012324658,0.46839067,0.009784017,0.0002973929,0.00016494308,0.00017700813,0.00017600313,0.18832141],"genre_scores_gemma":[0.97033036,0.00035590312,0.014489369,0.00040112733,0.00011277581,0.00013198641,0.000039954004,0.000040166877,0.0140982615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99468577,0.003084878,0.000242294,0.00044396805,0.0008844905,0.00065864855],"domain_scores_gemma":[0.9776228,0.017724536,0.0011631061,0.001679593,0.00092918397,0.0008807318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054248823,0.00070405466,0.0015681254,0.0009334187,0.0013453811,0.004493392,0.002505007,0.0030037074,0.008737926],"category_scores_gemma":[0.01941331,0.0006065857,0.0010925943,0.0011267643,0.0063847746,0.0084900465,0.0030389458,0.004125588,0.00060839305],"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.00001722126,0.000023275048,0.00006888202,0.000016733144,0.000010494879,0.000022491324,0.00006577308,0.0034052767,0.00016072161,0.9945649,0.00027389542,0.0013703536],"study_design_scores_gemma":[0.000013352261,0.0000080401,0.000044526085,0.0000044521053,0.0000033281888,0.0000143718735,0.000025767928,0.0111311665,0.000072676754,0.9884012,0.00027696922,0.0000041609305],"about_ca_topic_score_codex":0.0012079518,"about_ca_topic_score_gemma":0.001064024,"teacher_disagreement_score":0.008737926,"about_ca_system_score_codex":0.002048015,"about_ca_system_score_gemma":0.0018914309,"threshold_uncertainty_score":0.02923125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10314368,0.0009039562,0.8745772,0.0016243854,0.00037310927,0.00015515123,0.00015962,0.00093181425,0.01813102],"genre_scores_gemma":[0.90205276,0.0004157209,0.092877105,0.00033784175,0.00016193415,0.000092119946,0.00014878518,0.00010247343,0.0038112458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668187,0.0008838017,0.00012956801,0.00054003537,0.0012240603,0.00054058933],"domain_scores_gemma":[0.9949414,0.0015236879,0.0002342501,0.0024413718,0.00062501675,0.000234188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023817488,0.00059078133,0.0010478846,0.000692922,0.0018690687,0.00209222,0.0017278681,0.001447118,0.004097932],"category_scores_gemma":[0.006036002,0.00046007888,0.0010641062,0.0010082172,0.001965461,0.004545287,0.004234359,0.003278109,0.0011867615],"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.0009981161,0.00026423193,0.0006680371,0.00019829579,0.000073812225,0.0001859235,0.00027571162,0.054601498,0.038434103,0.83957654,0.0049480475,0.059775677],"study_design_scores_gemma":[0.00007640347,0.00020679916,0.00034003227,0.000023799452,0.000053358825,0.0002347672,0.00006289527,0.6713582,0.025648534,0.29677188,0.005172361,0.000050967963],"about_ca_topic_score_codex":0.00042268314,"about_ca_topic_score_gemma":0.00033610789,"teacher_disagreement_score":0.004097932,"about_ca_system_score_codex":0.0010202106,"about_ca_system_score_gemma":0.0018281762,"threshold_uncertainty_score":0.013708949},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062685974,0.009272813,0.7427206,0.02716431,0.0012083392,0.00011207644,0.0005947271,0.00024254662,0.1559986],"genre_scores_gemma":[0.9307766,0.00440652,0.04521815,0.0018168543,0.0014648505,0.0002346828,0.00020032674,0.00007689271,0.015805237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875057,0.0005998886,0.00004991407,0.00012841109,0.00031982755,0.00015142448],"domain_scores_gemma":[0.99627376,0.0024372917,0.0003135765,0.00030699093,0.00047641373,0.00019200891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018390565,0.0006139266,0.0015436661,0.0011087132,0.0014747657,0.0034571933,0.0019094542,0.0029866714,0.007338605],"category_scores_gemma":[0.0061618714,0.00047111438,0.00094550784,0.0011859162,0.005085947,0.0058115562,0.0014938192,0.0029200783,0.0005310539],"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.0000026039777,0.0000050538238,0.000025625692,0.000011534432,0.0000033238146,0.0000062347917,0.00001835386,0.0025468185,0.000032479908,0.9963167,0.0004918596,0.0005394071],"study_design_scores_gemma":[0.00000424279,0.0000021590383,0.000027978682,0.000004799107,0.0000013158474,0.0000071273444,0.000009119916,0.012624716,0.00001182793,0.98668206,0.00062077946,0.0000039076754],"about_ca_topic_score_codex":0.004843828,"about_ca_topic_score_gemma":0.0022180786,"teacher_disagreement_score":0.007338605,"about_ca_system_score_codex":0.0027747115,"about_ca_system_score_gemma":0.0022819736,"threshold_uncertainty_score":0.02455008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3463015,0.00047681277,0.6267715,0.0010031967,0.00017844263,0.000117415,0.0002044665,0.00042143598,0.024525242],"genre_scores_gemma":[0.93088377,0.00038681613,0.051004957,0.00020550507,0.00008662733,0.00015373119,0.00015013723,0.00017567743,0.016952755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995178,0.0001781554,0.000018013505,0.000089841575,0.00010252825,0.000093741284],"domain_scores_gemma":[0.99810433,0.0012379418,0.00015905274,0.00020285811,0.00013367833,0.00016198636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096751354,0.0006230209,0.0008537646,0.0010152395,0.0009271147,0.0017270846,0.0014476439,0.0020127275,0.0073757996],"category_scores_gemma":[0.0049481434,0.00050758914,0.0005992605,0.0010561363,0.0022221697,0.004801258,0.002341989,0.0016854594,0.00049812783],"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.00013749914,0.00009584242,0.0001916312,0.000060156748,0.000022242191,0.000103348284,0.00009090748,0.090531506,0.0027059042,0.89487267,0.000865337,0.010322966],"study_design_scores_gemma":[0.00001842462,0.000026602851,0.000063660154,0.000007727104,0.0000037204757,0.000022481358,0.00001261115,0.3737616,0.00077244185,0.6248969,0.0004019647,0.000011862014],"about_ca_topic_score_codex":0.0011410313,"about_ca_topic_score_gemma":0.0008515116,"teacher_disagreement_score":0.0073757996,"about_ca_system_score_codex":0.0012048451,"about_ca_system_score_gemma":0.0008291368,"threshold_uncertainty_score":0.024674535},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9096237,0.000284523,0.078310356,0.00052927405,0.00043952282,0.00014610417,0.000120035955,0.00042053804,0.010126032],"genre_scores_gemma":[0.9850279,0.0000612169,0.012575319,0.000051807117,0.000022076643,0.000034655306,0.000016150587,0.000021011067,0.0021899038],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974364,0.000020554242,0.0000102831555,0.00006599474,0.00009748054,0.000062117],"domain_scores_gemma":[0.99970764,0.000076094075,0.000053876345,0.000054507058,0.000038236747,0.000069645546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021944099,0.00030144144,0.0005992771,0.0002870899,0.00064848573,0.00087304774,0.0010482251,0.000591407,0.0023430565],"category_scores_gemma":[0.00032764894,0.00024551083,0.0002789289,0.00025603425,0.00078545255,0.00097004673,0.00092215824,0.00064325874,0.00025003223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007306479,0.00016457454,0.00044978314,0.000097187716,0.00003668909,0.0002691646,0.00013591773,0.0030227469,0.9228178,0.06240007,0.0004474888,0.009427792],"study_design_scores_gemma":[0.00040097686,0.00095577433,0.00092564843,0.00002528933,0.000075201846,0.00039447955,0.00007156019,0.13282064,0.8438071,0.012994675,0.0074235722,0.00010505693],"about_ca_topic_score_codex":0.0003700439,"about_ca_topic_score_gemma":0.0008015289,"teacher_disagreement_score":0.0023430565,"about_ca_system_score_codex":0.000474304,"about_ca_system_score_gemma":0.0005856982,"threshold_uncertainty_score":0.007838309},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022529136,0.00018754516,0.9620077,0.0006707935,0.00027346902,0.00018293636,0.00023499731,0.0020672893,0.011846246],"genre_scores_gemma":[0.34908423,0.00024259294,0.6271669,0.00065711,0.00027803102,0.00034064517,0.00092920905,0.0005730153,0.020728229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983498,0.00029873935,0.000113439295,0.00035688025,0.000608607,0.0002725324],"domain_scores_gemma":[0.99854916,0.00026240357,0.00010203452,0.0007362442,0.00024778067,0.000102330276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010615562,0.00063486263,0.00110706,0.0006920086,0.0010493885,0.002427258,0.0019289707,0.0014208611,0.009477178],"category_scores_gemma":[0.0027265146,0.00038829684,0.0009467053,0.0009984509,0.0009586297,0.0037783147,0.004049058,0.0021095534,0.0041676075],"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.0012437243,0.00048358005,0.0009194901,0.00026333006,0.00013175503,0.00019953471,0.00022512818,0.027829716,0.040322445,0.51643085,0.019746644,0.39220387],"study_design_scores_gemma":[0.00050049636,0.00032867002,0.00078049896,0.000068743444,0.00014783432,0.00056687824,0.00007868182,0.5391549,0.053482797,0.3597869,0.044962905,0.00014075918],"about_ca_topic_score_codex":0.0003684644,"about_ca_topic_score_gemma":0.00054463174,"teacher_disagreement_score":0.009477178,"about_ca_system_score_codex":0.0009981956,"about_ca_system_score_gemma":0.0023428684,"threshold_uncertainty_score":0.031704307},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113630064,0.0013226921,0.6910692,0.00894222,0.0002772442,0.00034523578,0.0007559493,0.00018645114,0.18347096],"genre_scores_gemma":[0.93564194,0.0009867321,0.028364351,0.00078269606,0.00021311735,0.00035106583,0.00024049683,0.00002910868,0.03339043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979907,0.0010079356,0.00007109458,0.00022718568,0.0004784095,0.00022468154],"domain_scores_gemma":[0.99545467,0.0033635912,0.00023097997,0.00030606645,0.00032774912,0.0003169509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019328153,0.00087451976,0.0014503124,0.0006736507,0.0009460885,0.004279899,0.0015259644,0.002340316,0.007936012],"category_scores_gemma":[0.009441876,0.00048544057,0.0005516186,0.0011357297,0.0027645773,0.0043148436,0.0020246904,0.0021550786,0.0006208896],"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.00002198053,0.00003187609,0.000065719876,0.000023290153,0.0000097565635,0.000027109656,0.00004767786,0.016279126,0.00014295864,0.97953355,0.0012466678,0.0025702363],"study_design_scores_gemma":[0.000025369209,0.000010179608,0.000058353937,0.000008596099,0.000005007489,0.000014437265,0.00002134304,0.067955405,0.00008561268,0.93053466,0.0012744792,0.0000066222783],"about_ca_topic_score_codex":0.0017360591,"about_ca_topic_score_gemma":0.0013867491,"teacher_disagreement_score":0.007936012,"about_ca_system_score_codex":0.0021275815,"about_ca_system_score_gemma":0.0018198374,"threshold_uncertainty_score":0.026548564},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.794137,0.00043360572,0.11857061,0.009517631,0.0004909963,0.0002651734,0.00033813622,0.0005315745,0.07571531],"genre_scores_gemma":[0.9849118,0.00006245011,0.009063953,0.00015451008,0.000033154607,0.000030193485,0.00004175034,0.000029120873,0.0056731883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979382,0.0005814543,0.00008173022,0.00014601507,0.000782163,0.00047035902],"domain_scores_gemma":[0.99740183,0.0012529752,0.00024914372,0.00065554236,0.00021060975,0.00023001038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022323562,0.00054972933,0.00071777386,0.0012065087,0.0020085282,0.002677603,0.0012768296,0.0028641652,0.008352926],"category_scores_gemma":[0.006702305,0.00029201192,0.0007783296,0.001249935,0.005152838,0.0028140657,0.002655593,0.002204322,0.0008441769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057263416,0.00008055433,0.0006682406,0.00004538079,0.000022527789,0.0002211351,0.0003640096,0.007860924,0.003839525,0.9746705,0.0013400818,0.010314555],"study_design_scores_gemma":[0.00029853368,0.00021746207,0.0010677947,0.000072672825,0.00005019231,0.00051058363,0.00028547758,0.11478287,0.025575375,0.8488444,0.008191428,0.000103205806],"about_ca_topic_score_codex":0.0006514995,"about_ca_topic_score_gemma":0.00034206102,"teacher_disagreement_score":0.008352926,"about_ca_system_score_codex":0.0021108526,"about_ca_system_score_gemma":0.0020594853,"threshold_uncertainty_score":0.027943373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72485834,0.0012305661,0.16921088,0.003258324,0.0005347446,0.000085712054,0.00015562156,0.0004914794,0.10017435],"genre_scores_gemma":[0.9759831,0.0002839583,0.009863326,0.00024206795,0.00012998834,0.000045351117,0.00004283439,0.00009764856,0.0133117465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994419,0.00019155482,0.000024676043,0.0000775935,0.0001490478,0.00011520521],"domain_scores_gemma":[0.9973846,0.0011947418,0.00022931956,0.0006155954,0.00023187956,0.00034389255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087133824,0.0004345822,0.001301778,0.0014616123,0.002610782,0.0023545476,0.0015388598,0.003245507,0.0058766743],"category_scores_gemma":[0.006228204,0.0004556287,0.00074710645,0.0009841777,0.0034615495,0.0034789282,0.0018924763,0.0021154599,0.00061312324],"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.00003859601,0.00001978569,0.000074108895,0.000018971612,0.000004385841,0.000051909225,0.00010793995,0.0032784357,0.00066098315,0.992953,0.00044826567,0.0023436134],"study_design_scores_gemma":[0.000012373151,0.000019181516,0.00008872066,0.000011306211,0.0000033127317,0.00005125355,0.000035356094,0.031343106,0.00027737307,0.967491,0.00065666414,0.000010580137],"about_ca_topic_score_codex":0.00094435085,"about_ca_topic_score_gemma":0.0011832939,"teacher_disagreement_score":0.0058766743,"about_ca_system_score_codex":0.00096287555,"about_ca_system_score_gemma":0.0005598686,"threshold_uncertainty_score":0.0196594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15313555,0.00037336716,0.81848615,0.0015377856,0.0002754564,0.00017838104,0.00027888926,0.0013555447,0.024378976],"genre_scores_gemma":[0.9503117,0.00020210785,0.042425696,0.00025043893,0.00011609176,0.0001165846,0.00013607042,0.00016280464,0.006278442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617153,0.0007130132,0.0002711968,0.00055114133,0.0012870366,0.0010060485],"domain_scores_gemma":[0.9950081,0.0014869553,0.00039230194,0.0024240834,0.0004549966,0.00023363395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002582982,0.0005333577,0.0010804335,0.00060177717,0.0014765391,0.0041437363,0.0013110002,0.0016276869,0.004160914],"category_scores_gemma":[0.005245172,0.00059967814,0.0012943144,0.00083151634,0.003244327,0.008546326,0.0062305178,0.0036364584,0.0011874965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000272748,0.00008146073,0.00017775172,0.00008281379,0.00002735857,0.0001715091,0.0003707926,0.0061978824,0.0062939986,0.97399646,0.0014132491,0.010914002],"study_design_scores_gemma":[0.000098863355,0.00008453046,0.00019274974,0.00005641564,0.0000781442,0.00019512803,0.00011871886,0.0760663,0.02182538,0.89561945,0.005580109,0.00008423897],"about_ca_topic_score_codex":0.0004527414,"about_ca_topic_score_gemma":0.00035198717,"teacher_disagreement_score":0.004160914,"about_ca_system_score_codex":0.0015970081,"about_ca_system_score_gemma":0.0018434331,"threshold_uncertainty_score":0.0139196515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45659676,0.0003951603,0.48480815,0.00095021934,0.00029960377,0.00015289601,0.00008518811,0.00049817096,0.056213964],"genre_scores_gemma":[0.9724141,0.00019636501,0.019590624,0.000132785,0.00006917459,0.00008382483,0.000032954977,0.000100918514,0.0073792776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933964,0.00021900037,0.000022108194,0.00007532267,0.00024692126,0.00009686383],"domain_scores_gemma":[0.9968225,0.0020299028,0.00017486085,0.0005978752,0.00020012996,0.00017466536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009327795,0.00051651767,0.00081452884,0.0008756913,0.0012226723,0.0015949005,0.00097204134,0.0013132228,0.0070559103],"category_scores_gemma":[0.004674083,0.0005619459,0.00048236278,0.00083366036,0.0020327594,0.0032001415,0.0028471628,0.0014483946,0.0007628916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024895792,0.00015750321,0.00041224383,0.00010637359,0.00005448795,0.0002930304,0.00046340426,0.04965763,0.027966611,0.9007842,0.0011467014,0.018708818],"study_design_scores_gemma":[0.000055096647,0.000116567324,0.00047652287,0.000023109305,0.00003658964,0.00018041511,0.00014215568,0.42556277,0.011794747,0.55981547,0.0017379798,0.000058553112],"about_ca_topic_score_codex":0.00027962838,"about_ca_topic_score_gemma":0.00031420033,"teacher_disagreement_score":0.0070559103,"about_ca_system_score_codex":0.00027998292,"about_ca_system_score_gemma":0.00037674615,"threshold_uncertainty_score":0.023604393},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12264338,0.0003816812,0.8672688,0.00031340358,0.00006468392,0.00005882751,0.000039765262,0.00010392405,0.009125532],"genre_scores_gemma":[0.89984703,0.00020200864,0.09677938,0.00005023355,0.000025897354,0.00011508425,0.000025008489,0.00003450691,0.0029208695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998449,0.0000382509,0.000005998124,0.000022461894,0.000069200774,0.000019169081],"domain_scores_gemma":[0.9997632,0.00013025125,0.000036377336,0.00001685971,0.000042680436,0.00001063925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052944693,0.0002264702,0.0003031456,0.0003830644,0.00022810722,0.00045299547,0.00045986468,0.00027027243,0.0013326843],"category_scores_gemma":[0.00076119084,0.00019069841,0.00016604195,0.00021171007,0.00065117853,0.00047709217,0.00040983048,0.000575946,0.000085319974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098887926,0.0001312761,0.0005785101,0.00011577609,0.000032985296,0.00010091421,0.00016164553,0.5679036,0.06740568,0.3070144,0.000926909,0.05552954],"study_design_scores_gemma":[0.0000058290407,0.000014219009,0.000059609672,0.0000017137494,8.831289e-7,0.0000033506833,0.0000051503393,0.98572713,0.002064201,0.011872472,0.00024137176,0.0000040537584],"about_ca_topic_score_codex":0.0019180505,"about_ca_topic_score_gemma":0.0017419228,"teacher_disagreement_score":0.0019180505,"about_ca_system_score_codex":0.000736405,"about_ca_system_score_gemma":0.00049041613,"threshold_uncertainty_score":0.0053429604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073500425,0.00037452657,0.88582766,0.0017401383,0.00018908126,0.00030202107,0.00077656837,0.00033699084,0.036952585],"genre_scores_gemma":[0.9302328,0.00047595915,0.04907911,0.00013628646,0.00009864102,0.00039988264,0.00032437206,0.000046264224,0.019206723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989957,0.00034822826,0.00005024808,0.00014991523,0.00031832294,0.00013756522],"domain_scores_gemma":[0.9989512,0.00041033517,0.00008997133,0.00019951002,0.00023114782,0.000117799966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011081478,0.00041421858,0.00089871825,0.00046522616,0.0011460127,0.0019701677,0.0017716173,0.001837772,0.0073216627],"category_scores_gemma":[0.0019466013,0.00026716653,0.00045020334,0.0009792355,0.0015102949,0.0035151176,0.0017645773,0.0015779269,0.0010099525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012490476,0.0000696088,0.00015270486,0.00006851929,0.000020571517,0.000255915,0.00012991163,0.12382961,0.0022952897,0.8659084,0.0015116585,0.005632888],"study_design_scores_gemma":[0.000063412306,0.000045778223,0.000069694026,0.0000116091705,0.000012768626,0.000045842484,0.000023700059,0.72443736,0.0006718748,0.27171257,0.0028883505,0.000017073866],"about_ca_topic_score_codex":0.0022518644,"about_ca_topic_score_gemma":0.0020212566,"teacher_disagreement_score":0.0073216627,"about_ca_system_score_codex":0.0012660796,"about_ca_system_score_gemma":0.0021374496,"threshold_uncertainty_score":0.024493396},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8992202,0.0002557307,0.06627721,0.00073347805,0.0004135489,0.00013009108,0.0002618973,0.0003071775,0.032400616],"genre_scores_gemma":[0.97848266,0.00006572786,0.016795183,0.000071667906,0.000016853497,0.000059836024,0.00006751674,0.000056864443,0.0043838285],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965835,0.00004574456,0.000018588938,0.00006487448,0.00011023013,0.00010226345],"domain_scores_gemma":[0.9995814,0.000092298505,0.000048220103,0.00014901943,0.000050611205,0.00007836276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004848673,0.00032956406,0.0005960197,0.00043277873,0.0009441102,0.0012356337,0.00079098705,0.00088117534,0.0057273377],"category_scores_gemma":[0.00058049714,0.0004338682,0.000565567,0.0007633559,0.00087222544,0.0012262488,0.0015759644,0.00091860397,0.0006863709],"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.0006589653,0.000358652,0.0025592244,0.00035844615,0.00015049659,0.0010481493,0.00071092416,0.010642868,0.55477303,0.40172085,0.0022780758,0.024740286],"study_design_scores_gemma":[0.00028166932,0.0007285139,0.0032246904,0.00007066341,0.00013731472,0.0006808858,0.00042733224,0.22903551,0.69528294,0.054165598,0.01564931,0.00031558616],"about_ca_topic_score_codex":0.00022929543,"about_ca_topic_score_gemma":0.0003869361,"teacher_disagreement_score":0.0057273377,"about_ca_system_score_codex":0.00050954585,"about_ca_system_score_gemma":0.0005593451,"threshold_uncertainty_score":0.019159913},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12755218,0.012314746,0.39781776,0.032275844,0.014874446,0.00010412559,0.00054550054,0.0008755561,0.4136399],"genre_scores_gemma":[0.84071517,0.009555771,0.06114084,0.005510708,0.011799088,0.00014781118,0.00024877585,0.0005494476,0.07033228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992893,0.00025266095,0.000032312513,0.00013383434,0.00022904776,0.00006289228],"domain_scores_gemma":[0.9989593,0.00052130094,0.00005745924,0.00025365604,0.0001049169,0.000103272185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015749106,0.00084820355,0.0011617529,0.0013872181,0.0019406592,0.0028004143,0.001671343,0.0017646132,0.006340465],"category_scores_gemma":[0.0017998976,0.00041835717,0.0011275944,0.0011438581,0.0046763285,0.0072416407,0.0024351242,0.003934357,0.0012322013],"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.0000050649455,0.000005877199,0.0000124226935,0.000017123559,0.0000023246846,0.000045505592,0.00006156448,0.00024537952,0.0004160724,0.99729675,0.0009468188,0.0009451093],"study_design_scores_gemma":[0.0000029741254,0.000006730491,0.0000200523,0.000004845276,0.0000016472194,0.000022514876,0.000011952737,0.0011035368,0.00010924296,0.9956291,0.0030811671,0.0000062165177],"about_ca_topic_score_codex":0.00087009463,"about_ca_topic_score_gemma":0.0012801528,"teacher_disagreement_score":0.006340465,"about_ca_system_score_codex":0.0009621255,"about_ca_system_score_gemma":0.00065785676,"threshold_uncertainty_score":0.021210968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15971221,0.00052776193,0.7979471,0.0012796272,0.0002583598,0.000333235,0.00014511537,0.0011686331,0.03862792],"genre_scores_gemma":[0.8437804,0.00009978275,0.148438,0.00013743465,0.000025705562,0.00012280677,0.000053141037,0.000033049713,0.0073096426],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998729,0.000020562115,0.000006070387,0.000022337894,0.00006217268,0.00001584571],"domain_scores_gemma":[0.9998902,0.000022266391,0.00001190346,0.000017491131,0.00004957969,0.000008510233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001821235,0.00018182576,0.00017915742,0.0001554013,0.00043064842,0.00049275055,0.00066921685,0.0004495273,0.005334639],"category_scores_gemma":[0.00028325344,0.00011613797,0.00011983695,0.00018136171,0.00017002506,0.0003178256,0.00016875956,0.00029679632,0.00052618055],"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.0007309167,0.000472702,0.0021817032,0.0005080273,0.00011839389,0.00024233911,0.00028485034,0.04976504,0.43702975,0.16986687,0.007196391,0.33160284],"study_design_scores_gemma":[0.00016638279,0.0010894364,0.0019019824,0.00004503456,0.00005963664,0.00035607658,0.0000610807,0.7334664,0.21447626,0.008612022,0.0397151,0.000050626186],"about_ca_topic_score_codex":0.00090275495,"about_ca_topic_score_gemma":0.0019745661,"teacher_disagreement_score":0.005334639,"about_ca_system_score_codex":0.00054105464,"about_ca_system_score_gemma":0.00058878463,"threshold_uncertainty_score":0.017846167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011386549,0.0006879268,0.97207123,0.0013058591,0.00025274852,0.00009315644,0.00054238125,0.0011638212,0.01249629],"genre_scores_gemma":[0.7736471,0.0015376031,0.19658053,0.0008449498,0.0010701854,0.0004201056,0.00092210225,0.0017483155,0.023229068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983203,0.000575816,0.000057550773,0.00026414392,0.00056582096,0.00021633541],"domain_scores_gemma":[0.9943321,0.0032017203,0.00032967073,0.0010533297,0.0007986386,0.00028450685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002590658,0.0011290476,0.0012830201,0.0017815382,0.0008392303,0.0019493586,0.0024888206,0.001539468,0.012381797],"category_scores_gemma":[0.016874814,0.0006524629,0.0013142232,0.0016456407,0.0026068387,0.0037614591,0.0028379248,0.0056188637,0.002896091],"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.00007685216,0.000042647665,0.00018505771,0.00020739519,0.000023739332,0.00007451012,0.00010760219,0.05679152,0.0017790889,0.89906555,0.010736683,0.030909354],"study_design_scores_gemma":[0.0000140721795,0.000020265215,0.00014013288,0.000023709386,0.000012089111,0.0000666742,0.000017067789,0.34130666,0.0010261158,0.65377134,0.003580026,0.000021821248],"about_ca_topic_score_codex":0.0022512001,"about_ca_topic_score_gemma":0.0017241143,"teacher_disagreement_score":0.012381797,"about_ca_system_score_codex":0.0018235841,"about_ca_system_score_gemma":0.0021837417,"threshold_uncertainty_score":0.041421235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014274344,0.00021656067,0.96447676,0.00069730193,0.00020195417,0.000150926,0.00022973226,0.0016414422,0.018110935],"genre_scores_gemma":[0.4526648,0.00026096133,0.5320302,0.00051754154,0.00012879078,0.00038983836,0.0005492616,0.000635952,0.01282267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794847,0.00062328955,0.000086073574,0.00027003666,0.0008748938,0.00019717586],"domain_scores_gemma":[0.9972851,0.00071446487,0.00012134334,0.0010289113,0.0006960063,0.00015419406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016137395,0.0007426533,0.0010891629,0.00086786767,0.0016562452,0.0019830302,0.0027924438,0.0014731257,0.011422119],"category_scores_gemma":[0.006338741,0.0004978283,0.00063697353,0.0015849817,0.0014551377,0.0027753422,0.0044620503,0.0022497312,0.0040413965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040159188,0.00015600592,0.0006907115,0.00017547814,0.00007487781,0.00007058486,0.00019251781,0.08781542,0.013400165,0.74154043,0.013243936,0.14223836],"study_design_scores_gemma":[0.000054294404,0.000047681293,0.00024038934,0.000018188792,0.000013223961,0.00007563342,0.00006307915,0.6731303,0.006775102,0.31357646,0.0059638023,0.000041810352],"about_ca_topic_score_codex":0.0019132985,"about_ca_topic_score_gemma":0.004102533,"teacher_disagreement_score":0.011422119,"about_ca_system_score_codex":0.001675298,"about_ca_system_score_gemma":0.0028347517,"threshold_uncertainty_score":0.03821081},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059601225,0.001567884,0.7003745,0.0049028816,0.0033562758,0.00036629403,0.0005325472,0.0007290204,0.22856945],"genre_scores_gemma":[0.7507291,0.0022659742,0.146509,0.0035421974,0.003245618,0.0004753113,0.000498169,0.00048207727,0.09225263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990816,0.00025302652,0.000046861827,0.0002511252,0.00023191753,0.00013551388],"domain_scores_gemma":[0.9990734,0.00026265826,0.00006654525,0.00034683855,0.0001457117,0.000104864455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012961179,0.0007311235,0.001338024,0.0014659069,0.0023261895,0.002134047,0.0019603167,0.0027121028,0.012207005],"category_scores_gemma":[0.0028562653,0.00038737897,0.0020041296,0.001316978,0.0037795692,0.0052317022,0.0027854962,0.0028953282,0.0022113863],"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.0000072714924,0.000010862209,0.00002269261,0.000016859374,0.0000032815437,0.000034711135,0.000049646256,0.00068708515,0.00038126178,0.9953216,0.0010586359,0.002406049],"study_design_scores_gemma":[0.000007995895,0.0000135515,0.00004730615,0.000008311341,0.000003346882,0.00009313237,0.000020914684,0.010895705,0.00020222133,0.9845882,0.004109054,0.000010320583],"about_ca_topic_score_codex":0.0013154937,"about_ca_topic_score_gemma":0.0007026005,"teacher_disagreement_score":0.012207005,"about_ca_system_score_codex":0.0013011439,"about_ca_system_score_gemma":0.0012938399,"threshold_uncertainty_score":0.040836513},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074191336,0.00044053642,0.98992,0.00029839698,0.0000818672,0.000039118033,0.00010988871,0.0010861328,0.0006049248],"genre_scores_gemma":[0.54848063,0.00063666614,0.4399396,0.00040014656,0.00022917161,0.00026681868,0.001208024,0.00027371352,0.008565209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984151,0.00074654515,0.00008854565,0.00028445205,0.00033395048,0.00013137743],"domain_scores_gemma":[0.9950761,0.0030292887,0.00019683216,0.000419162,0.0011757753,0.00010291372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024084398,0.0008876421,0.0018955383,0.0005595517,0.0005065063,0.001015241,0.0013578674,0.0015613685,0.0033722876],"category_scores_gemma":[0.008985343,0.0005276602,0.0007202746,0.0013090938,0.0006273058,0.0010682599,0.0011870486,0.0023231413,0.0016845922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032166787,0.00022141912,0.00058703526,0.00014947123,0.00013459193,0.00004941129,0.00003918044,0.51794106,0.0030283346,0.009257402,0.009470876,0.45879954],"study_design_scores_gemma":[0.0000050481995,0.000013075266,0.000041704527,0.000001924308,0.0000033634929,0.0000033002243,0.0000018236244,0.9981811,0.0002805912,0.001251809,0.0002136073,0.0000026558616],"about_ca_topic_score_codex":0.006269005,"about_ca_topic_score_gemma":0.004729235,"teacher_disagreement_score":0.006269005,"about_ca_system_score_codex":0.00054671563,"about_ca_system_score_gemma":0.0017399323,"threshold_uncertainty_score":0.012737215},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64832187,0.011634659,0.31589675,0.0015517629,0.00023171098,0.00006358039,0.00012414505,0.0007273972,0.021448098],"genre_scores_gemma":[0.9754152,0.0011890327,0.021943774,0.000048619568,0.00006690127,0.00001550524,0.000072620096,0.0000569037,0.0011913897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792945,0.0010073443,0.00011898605,0.00014137612,0.0006733983,0.00012940633],"domain_scores_gemma":[0.98499507,0.0104765855,0.0005521078,0.0009339918,0.0028080987,0.00023412654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048934584,0.00031155423,0.00062484684,0.0016346183,0.00050497864,0.0019878072,0.0009461044,0.000698422,0.0018993537],"category_scores_gemma":[0.023222994,0.00016426625,0.000309017,0.0019245086,0.0010316082,0.0034404981,0.0007328277,0.0005909261,0.00030372245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015041399,0.0005170905,0.01093138,0.0009899958,0.00031817704,0.00018969273,0.0005538173,0.2237044,0.012365387,0.35821885,0.0027221965,0.3879848],"study_design_scores_gemma":[0.000038375932,0.00030946563,0.007102088,0.000046532004,0.00006823741,0.00015029772,0.00027587044,0.9442313,0.006437344,0.038165525,0.0031450111,0.000030043839],"about_ca_topic_score_codex":0.0013162331,"about_ca_topic_score_gemma":0.00090087403,"teacher_disagreement_score":0.0048934584,"about_ca_system_score_codex":0.0010456622,"about_ca_system_score_gemma":0.0007943094,"threshold_uncertainty_score":0.025879383},"labels":[],"label_agreement":null}]}