{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":90,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":90,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"70c96f239146","filters":{"venue":"Quantum Information Processing"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02286054463001615,"gpt":0.2533548314418175,"spread":0.2304942868118013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007657284,0.0001764316,0.0001824101,0.0003636173,0.0001927676,0.0005568607,0.0004020317,0.00008974836,0.000001881795],"category_scores_gemma":[0.0001236875,0.0001614692,0.0000421859,0.0007998539,0.00003540723,0.003598657,0.0001210773,0.0002577255,0.0000387084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007091551,"about_ca_system_score_gemma":0.000272225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007394469,"about_ca_topic_score_gemma":0.00002081149,"domain_scores_codex":[0.9985421,0.00008495419,0.0004874903,0.0002210258,0.0003562594,0.0003082297],"domain_scores_gemma":[0.9991086,0.00003073973,0.0002667062,0.0002517986,0.0002173567,0.0001248639],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000217431,0.0001128282,0.001417448,0.0001287729,0.000008796163,0.000007877175,0.02429041,0.08155772,0.0003738578,0.05794855,0.0008738865,0.8332581],"study_design_scores_gemma":[0.0004991639,0.00007092441,0.001575785,0.0000432226,0.000001673917,0.0000354423,0.0001707251,0.9894179,0.0006646058,0.006119726,0.001175734,0.0002250914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4586619,0.00009234763,0.5390829,0.0006690503,0.0003142647,0.0001611442,0.000001665861,0.0002023258,0.0008143226],"genre_scores_gemma":[0.9773855,0.00000270632,0.02186258,0.0006058683,0.00008585171,0.00001735801,0.00002414457,0.0000064682,0.00000956797],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9078602,"threshold_uncertainty_score":0.6584522,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007227057510948758,"gpt":0.232453829051382,"spread":0.2252267715404332,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000750136,0.00007752363,0.0001054341,0.00002148925,0.0002100367,0.00003291409,0.0001182125,0.00001743053,0.00005969848],"category_scores_gemma":[0.00002101543,0.0000490798,0.00006063471,0.0001842585,0.0001206764,0.000482146,0.00003394388,0.0000845039,0.00001703761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001837318,"about_ca_system_score_gemma":0.00008876085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003937046,"about_ca_topic_score_gemma":3.983296e-7,"domain_scores_codex":[0.9994065,0.000006750304,0.0002814228,0.00004638382,0.0001346123,0.0001242861],"domain_scores_gemma":[0.9995623,0.00001874352,0.0002182726,0.00009969994,0.00008018855,0.0000207564],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001066423,0.00004916442,0.005689779,0.0001224281,0.00002569321,3.143998e-8,0.003500069,0.0002111518,0.001613625,0.9749261,0.00007516729,0.01377615],"study_design_scores_gemma":[0.00152465,0.00006574396,0.008921501,0.0005192185,0.00007588741,0.000002726174,0.008399433,0.003282455,0.2787446,0.6955065,0.002566158,0.0003911107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9306531,0.000119574,0.01650515,0.0005236481,0.0001359509,0.0001642337,0.00001530161,0.00003587715,0.05184714],"genre_scores_gemma":[0.9996101,9.792826e-7,0.0002232848,0.0001081751,0.00003042749,0.000009411685,0.000006098428,0.000003023994,0.00000856227],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2794196,"threshold_uncertainty_score":0.2001416,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006902465213221911,"gpt":0.2413535242086588,"spread":0.2344510589954369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004566343,0.00009099496,0.00009978949,0.00008126581,0.0001166679,0.0001325602,0.000312749,0.00003785688,0.000003243827],"category_scores_gemma":[0.00002025233,0.00008172309,0.00003269593,0.000572376,0.00002211765,0.001566894,0.00009287105,0.0000612495,0.00001182398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004835445,"about_ca_system_score_gemma":0.0000763496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005337269,"about_ca_topic_score_gemma":7.806473e-7,"domain_scores_codex":[0.9989272,0.00001123592,0.0004639613,0.00009380127,0.0003008544,0.0002029887],"domain_scores_gemma":[0.999272,0.00001243238,0.000350559,0.000154812,0.0001580877,0.00005205688],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000968277,0.00003461645,0.0009193167,0.0001190772,0.000005287924,0.000001288165,0.002529289,0.0002367404,0.00376675,0.06141187,0.00001195836,0.9309541],"study_design_scores_gemma":[0.000360261,0.0000890793,0.02812792,0.0001124549,0.000003904738,0.00003449836,0.0001360015,0.9530048,0.01166551,0.002956874,0.003308438,0.0002002868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3495183,0.00001137687,0.6495219,0.0001376356,0.0001399595,0.00006190981,0.000002745816,0.00009430092,0.0005118442],"genre_scores_gemma":[0.9778844,0.000001249517,0.02178778,0.0002698839,0.00003447378,0.000001470507,0.00001636047,0.00000204274,0.000002303255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.952768,"threshold_uncertainty_score":0.3332571,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01166165178624907,"gpt":0.2581816389217678,"spread":0.2465199871355188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001145507,0.0002218141,0.0004241848,0.0003109112,0.001434961,0.0008054387,0.002059171,0.00008701275,0.00000165641],"category_scores_gemma":[0.0001047501,0.0001440162,0.0002639864,0.001294653,0.0001751329,0.00107527,0.0005742604,0.0002895005,0.000004288648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005411797,"about_ca_system_score_gemma":0.0001221548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001227927,"about_ca_topic_score_gemma":0.000004240086,"domain_scores_codex":[0.9976885,0.0001304704,0.0008802488,0.0002595679,0.0006783899,0.0003628479],"domain_scores_gemma":[0.9968293,0.0001116302,0.001502783,0.001145417,0.0003341191,0.0000767177],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001141888,0.0000695182,0.007749936,0.001797879,0.00120457,0.000007608322,0.07532907,0.5257715,0.01452581,0.01324021,0.0003320449,0.3598576],"study_design_scores_gemma":[0.0002587793,0.0001050178,0.01895689,0.0002066884,0.00007679469,0.00001579893,0.0001960739,0.9764674,0.002781879,0.00009847986,0.0006627072,0.0001734713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4964965,0.00003209829,0.502313,0.000445751,0.0003165667,0.0002065505,0.000009723024,0.00007713295,0.0001026753],"genre_scores_gemma":[0.9790868,5.367183e-7,0.02062392,0.0001573875,0.00008976652,0.00001140356,0.000007126677,0.000009471139,0.00001357871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4825903,"threshold_uncertainty_score":0.9998651,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02012417562593877,"gpt":0.2636456193594765,"spread":0.2435214437335377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.001489326,0.0003283397,0.0004214887,0.0005766606,0.0003829761,0.001302261,0.0007263075,0.0001260842,0.00001272166],"category_scores_gemma":[0.0002156227,0.0002913706,0.000151606,0.001091337,0.00007090402,0.01450025,0.0001350062,0.0002183691,0.0005681501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001112529,"about_ca_system_score_gemma":0.0004615508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003193664,"about_ca_topic_score_gemma":0.000008119171,"domain_scores_codex":[0.9966479,0.0001214938,0.001465662,0.0002485028,0.0009798581,0.0005365908],"domain_scores_gemma":[0.9970432,0.00004935851,0.001085339,0.000496252,0.0009794121,0.0003464355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003413019,0.0004254352,0.0001431825,0.0007908469,0.0002312916,0.00001798906,0.1371477,0.03987708,0.0005757757,0.2623233,0.01605756,0.5389968],"study_design_scores_gemma":[0.004027634,0.0002243372,0.00006113976,0.00005509821,0.00001268391,0.00003498684,0.0005885336,0.9457242,0.00076527,0.04054216,0.007583256,0.0003806986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01566182,0.0001362962,0.9755771,0.0008471204,0.0007145049,0.0007041243,0.00000424658,0.0008094525,0.005545398],"genre_scores_gemma":[0.9907015,0.00001936148,0.007259216,0.001773843,0.00006183796,0.00005641428,0.00007308794,0.00001337305,0.0000413737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9750397,"threshold_uncertainty_score":0.9999539,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04461364248157571,"gpt":0.2830906106478358,"spread":0.2384769681662601,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008495363,0.0001870116,0.0001714073,0.000187144,0.0006105185,0.001545466,0.0006732467,0.00006694783,0.00002456419],"category_scores_gemma":[0.0009719298,0.0001175563,0.00007396349,0.001263469,0.000084941,0.01271874,0.0001170221,0.0001677378,0.00006108139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000680897,"about_ca_system_score_gemma":0.0003345445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000184074,"about_ca_topic_score_gemma":0.00000414154,"domain_scores_codex":[0.9983276,0.00005617352,0.0005796119,0.0001147356,0.0005178867,0.0004040129],"domain_scores_gemma":[0.9982468,0.000288806,0.0005202223,0.000437223,0.0003680591,0.0001389046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000444733,0.00009992771,0.0009911831,0.0003564727,0.00001308658,8.369506e-8,0.02671022,0.0002287204,0.0000570039,0.901015,0.0008067985,0.06967698],"study_design_scores_gemma":[0.002219043,0.001822141,0.05038051,0.001657098,0.00008255566,0.00009362108,0.1029679,0.3987058,0.01526062,0.06325736,0.3608637,0.002689716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.192083,0.00002615344,0.8033097,0.002984191,0.000173156,0.0004481758,0.00004137866,0.0001403339,0.000793923],"genre_scores_gemma":[0.99253,0.00000461118,0.006613518,0.0006964184,0.00003144107,0.00007274913,0.00004096794,0.000004138559,0.000006088578],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8377577,"threshold_uncertainty_score":0.999491,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01893446232119752,"gpt":0.2475300440159857,"spread":0.2285955816947882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004304842,0.0002254993,0.0003519437,0.0001850643,0.0002993289,0.0003695166,0.0006890424,0.00008845378,0.000006490882],"category_scores_gemma":[0.0001280583,0.0002069595,0.000109918,0.0008045256,0.00005479568,0.002441579,0.0001188991,0.0002556013,0.00001508965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002381056,"about_ca_system_score_gemma":0.0002439347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005197875,"about_ca_topic_score_gemma":6.636252e-8,"domain_scores_codex":[0.9979877,0.00006619948,0.0008496594,0.0002382623,0.0004781155,0.0003800327],"domain_scores_gemma":[0.9985886,0.00008377975,0.0006604081,0.000209115,0.0002882128,0.0001699114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001996066,0.00001386816,0.00001176837,0.0002226554,0.00001165244,0.000002330244,0.006180528,0.9324114,0.0009507515,0.001487443,0.00002423326,0.05866345],"study_design_scores_gemma":[0.0006180322,0.0001410761,0.00002637708,0.000123886,0.00001200157,0.00002550651,0.0003040958,0.9965039,0.00142941,0.0001570351,0.0004099514,0.0002487338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3693823,0.0001764307,0.6292689,0.0007115613,0.00009898657,0.0001181554,0.00000568497,0.0002108111,0.00002713371],"genre_scores_gemma":[0.945819,0.000002630803,0.05300158,0.001061214,0.00009559333,0.000002857418,0.0000058895,0.00001088496,4.122738e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5764366,"threshold_uncertainty_score":0.8439563,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007417183464120398,"gpt":0.2164543256536613,"spread":0.2090371421895409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007716137,0.000150781,0.0002111693,0.0002196111,0.0003676039,0.0003317861,0.0005388888,0.00008258724,0.000004981036],"category_scores_gemma":[0.0001537043,0.00008531747,0.00006242192,0.001233898,0.0002048256,0.00303328,0.00007431232,0.0002656462,0.000003652775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003072145,"about_ca_system_score_gemma":0.0001360163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004851369,"about_ca_topic_score_gemma":0.00003745764,"domain_scores_codex":[0.9983184,0.0002043898,0.0007708243,0.00009832824,0.0004009551,0.0002070459],"domain_scores_gemma":[0.9986436,0.00009615943,0.0006565412,0.0003638046,0.0002017899,0.00003811789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004373405,0.00002250407,0.003576818,0.0003570538,0.000009977438,1.597704e-7,0.02504327,0.001604669,0.0001743848,0.9529904,0.0002041748,0.0159729],"study_design_scores_gemma":[0.00145517,0.0000243999,0.0052066,0.0001823176,0.000007414864,0.00007450738,0.005786313,0.9701664,0.002563406,0.01203288,0.002317106,0.0001834604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7959632,0.0004053444,0.1972072,0.0008378112,0.001741994,0.000799268,0.000006743499,0.000125657,0.002912762],"genre_scores_gemma":[0.9992419,0.00001633259,0.0002691496,0.0004452934,0.000007215676,0.000008999072,0.000002782778,0.000004013661,0.000004316127],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9685618,"threshold_uncertainty_score":0.3479145,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01773622588322572,"gpt":0.2339487398937431,"spread":0.2162125140105174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0002230241,0.0002032258,0.0001778596,0.00100169,0.0006147879,0.001479851,0.0006768093,0.00009779805,0.0003352335],"category_scores_gemma":[0.0001588212,0.000190878,0.00009856713,0.002694044,0.00005591152,0.01491039,0.000108293,0.0002201001,0.001415914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001117481,"about_ca_system_score_gemma":0.00006792887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009942669,"about_ca_topic_score_gemma":0.000004720366,"domain_scores_codex":[0.9982647,0.00003504606,0.0006288444,0.0001953107,0.0005435171,0.000332615],"domain_scores_gemma":[0.9986274,0.00004969693,0.0002269937,0.0003871342,0.0005692953,0.0001395108],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007537535,0.0001370272,0.0002375709,0.00007024957,0.00004328992,0.000002607804,0.05200889,0.002015477,0.00007087723,0.6697952,0.007952681,0.2676586],"study_design_scores_gemma":[0.0004801271,0.0000467978,0.0009394438,0.00003815415,0.000008278788,0.00001328537,0.003131085,0.9751256,0.0003406964,0.004869403,0.0146859,0.0003212276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01388897,0.0006041623,0.9529009,0.001684683,0.0003093735,0.0002203314,0.00001621618,0.0006133929,0.02976195],"genre_scores_gemma":[0.9786472,0.00005123183,0.01889252,0.002213432,0.00006086627,0.00004183695,0.00003636936,0.0000075079,0.00004897392],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9731101,"threshold_uncertainty_score":0.9995567,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02692599703392994,"gpt":0.2781097078157165,"spread":0.2511837107817865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009277041,0.0001598481,0.0002003611,0.0003846747,0.0001296284,0.0004620971,0.0003952873,0.00006485674,0.000006137908],"category_scores_gemma":[0.0001312753,0.0001460599,0.00006619855,0.0007570356,0.00006043652,0.0105656,0.0001066236,0.0001184301,0.0001027895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005460555,"about_ca_system_score_gemma":0.0003874279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002699281,"about_ca_topic_score_gemma":8.114104e-7,"domain_scores_codex":[0.9978501,0.00004544777,0.001035953,0.0001221942,0.000689641,0.0002566237],"domain_scores_gemma":[0.9978509,0.00002099211,0.0008317148,0.0002987371,0.0008401287,0.0001575092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004556862,0.0001440884,0.0001288393,0.0008710813,0.00006077245,0.000002300877,0.1517424,0.1469939,0.000415728,0.2277313,0.008869195,0.4625847],"study_design_scores_gemma":[0.0007214932,0.0002050665,0.0000564903,0.00005415281,0.000004282419,0.00000973515,0.0009480165,0.9668812,0.004544601,0.01957372,0.006800015,0.0002012243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08550883,0.0000493828,0.9107423,0.0001758626,0.0004717852,0.0001876173,0.000005498158,0.0002483765,0.002610393],"genre_scores_gemma":[0.9424765,0.00001330769,0.05712047,0.0002682909,0.00004100895,0.000007090991,0.00005574201,0.000005957931,0.00001161847],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8569677,"threshold_uncertainty_score":0.7659808,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04259559751974907,"gpt":0.2812756328115614,"spread":0.2386800352918124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001023469,0.0002396295,0.0002473255,0.0002718618,0.0005696394,0.001199146,0.0006374274,0.0001099585,0.000006947365],"category_scores_gemma":[0.0002849711,0.0002163846,0.00008639481,0.001013584,0.00007462187,0.01091366,0.0001222884,0.0001699275,0.0001931223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007460955,"about_ca_system_score_gemma":0.000349182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004940139,"about_ca_topic_score_gemma":9.766895e-7,"domain_scores_codex":[0.9979487,0.00004445743,0.0008191228,0.0001866739,0.0004774966,0.0005235362],"domain_scores_gemma":[0.9977689,0.00009513961,0.0004716475,0.0003114107,0.001098129,0.0002547423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004828587,0.00002854857,0.00007505207,0.0001308368,0.00001236684,5.017924e-7,0.009805988,0.005451633,0.00001353811,0.9335523,0.01352333,0.03735764],"study_design_scores_gemma":[0.001072908,0.0001459798,0.00006851315,0.00007662275,0.000007087202,0.00001764436,0.001770229,0.9284148,0.0001804022,0.01789388,0.05003019,0.0003217993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002326512,0.0001089711,0.990193,0.0009137224,0.0006982082,0.0004850621,0.000008193473,0.0005124143,0.004753896],"genre_scores_gemma":[0.9466238,0.000006940568,0.04984724,0.003146618,0.0001372712,0.0001311635,0.00007377693,0.00001214432,0.00002105059],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9442973,"threshold_uncertainty_score":0.9998377,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05616740532040958,"gpt":0.3156966776341375,"spread":0.2595292723137279,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009186157,0.0002644212,0.0002124789,0.0005048807,0.0003584616,0.001060372,0.0008410937,0.0001007919,0.000007475759],"category_scores_gemma":[0.00008217453,0.0002315399,0.0001140015,0.000891475,0.00005562095,0.01041958,0.000178799,0.0001346586,0.0001913046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008291328,"about_ca_system_score_gemma":0.0002138123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006002772,"about_ca_topic_score_gemma":7.612309e-7,"domain_scores_codex":[0.9976713,0.00002082957,0.0009348767,0.0002186042,0.000675543,0.0004788362],"domain_scores_gemma":[0.9979957,0.0000302608,0.000590293,0.0004413809,0.0006881884,0.0002542266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001239003,0.0001539858,0.00004707951,0.001007631,0.00002267149,6.4534e-7,0.008053626,0.0007632112,0.00002796973,0.8680106,0.01197587,0.1098128],"study_design_scores_gemma":[0.003029057,0.0001194382,0.0001035164,0.00009456054,0.000005313198,0.00001636439,0.001012606,0.7024173,0.0002620594,0.01003952,0.2825952,0.0003051796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001428049,0.00000432777,0.9501571,0.0004811078,0.0002292694,0.03821336,0.000007400959,0.0005879493,0.01017668],"genre_scores_gemma":[0.1246356,0.00000169382,0.4989294,0.005079339,0.0001471218,0.3709266,0.0001114107,0.00004122975,0.0001275937],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8579711,"threshold_uncertainty_score":0.9999766,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Crossover; Quantum computer; Quantum; Quantum algorithm; Quantum sort; Speedup; Qubit; Context (archaeology)","retraction":null,"screen_n_in":null,"score":{"opus":0.005698009672920753,"gpt":0.2164494338556923,"spread":0.2107514241827716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002252862,0.0003096561,0.0002429728,0.0002974581,0.0008625775,0.002548637,0.0004469,0.0001049772,0.00002024784],"category_scores_gemma":[0.00004919755,0.0002440224,0.00004162524,0.0006905226,0.0001345672,0.005929062,0.0001635489,0.0002847027,0.0001377353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004155825,"about_ca_system_score_gemma":0.0002253461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001982985,"about_ca_topic_score_gemma":0.00000404899,"domain_scores_codex":[0.9979914,0.0000554045,0.0006124623,0.0003572492,0.0005039778,0.0004795108],"domain_scores_gemma":[0.998657,0.00005933208,0.0002522258,0.0003630291,0.0004821373,0.0001862786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008424931,0.00005489163,0.0001020142,0.0001631918,0.00002260299,0.000009246984,0.008320626,0.0294622,0.0001041248,0.01963331,0.0002461238,0.9418733],"study_design_scores_gemma":[0.0006586844,0.0001952514,0.005014649,0.0001110495,0.00000960333,0.0002847491,0.0004650793,0.9860772,0.0001253973,0.00605191,0.0006164216,0.0003900121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2386331,0.0001798336,0.7594619,0.0007645014,0.0001473666,0.0003589313,0.000003965275,0.0003244638,0.0001259175],"genre_scores_gemma":[0.7903154,0.00001308879,0.2086936,0.0007614173,0.00007336948,0.00007616324,0.00002413129,0.0000176041,0.00002518417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.956615,"threshold_uncertainty_score":0.9984868,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02501466134985461,"gpt":0.2306975047841011,"spread":0.2056828434342465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169957,0.000314795,0.0003057591,0.0004782266,0.0009102031,0.0004722461,0.001530721,0.0001513027,0.00001555255],"category_scores_gemma":[0.0001452027,0.0002303797,0.0001989762,0.001316174,0.0002728516,0.009386042,0.0002127183,0.0003148464,0.0001367988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005694318,"about_ca_system_score_gemma":0.0002191471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005787825,"about_ca_topic_score_gemma":0.000006972218,"domain_scores_codex":[0.9969705,0.00007126736,0.001396825,0.000204425,0.0007465712,0.0006103568],"domain_scores_gemma":[0.9971216,0.00008944001,0.001215034,0.0007321246,0.000679976,0.0001618005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004322103,0.00006152754,0.00006386378,0.0002510817,0.00002460282,5.484943e-7,0.02124493,0.00004996632,0.00006129148,0.9349956,0.0002526761,0.04295067],"study_design_scores_gemma":[0.0004603386,0.0001468156,0.001692242,0.00009840542,0.00001097837,0.00003243489,0.002262811,0.8885616,0.001284949,0.1019533,0.003162732,0.0003333756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05383499,0.0001994049,0.9373188,0.0004190819,0.0006361029,0.0003915743,0.00001095206,0.0004156906,0.006773419],"genre_scores_gemma":[0.9957479,0.00008218251,0.003627889,0.0004349757,0.0000148883,0.00005456362,0.00001444631,0.00001228117,0.00001090812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9419129,"threshold_uncertainty_score":0.9394611,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02639152010846511,"gpt":0.2298532731494386,"spread":0.2034617530409735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007232654,0.0001800713,0.0004522738,0.0002120047,0.000157656,0.00020537,0.0001558171,0.0001220112,0.000347019],"category_scores_gemma":[0.00009675913,0.0002120902,0.00009307328,0.0001046524,0.0001337455,0.002230732,0.00009153019,0.0001300156,0.0001835026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007719605,"about_ca_system_score_gemma":0.000119809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004204549,"about_ca_topic_score_gemma":0.000003125474,"domain_scores_codex":[0.9982606,0.00001790691,0.001182306,0.0002423516,0.00002918222,0.0002676162],"domain_scores_gemma":[0.9986606,0.00006168059,0.0008441251,0.0002750104,0.00007494347,0.00008360606],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002193647,0.00002734104,0.002723192,0.0001805622,0.00001856777,8.326382e-7,0.001933863,0.0001317618,0.00002391858,0.9847622,0.00008850647,0.01008731],"study_design_scores_gemma":[0.001328224,0.0001092652,0.008800021,0.0001340631,0.00003875992,0.00007057376,0.006329365,0.1713345,0.001578979,0.7852205,0.02431009,0.0007456576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9345845,0.003920774,0.04819486,0.0002621693,0.0005931839,0.0001944508,0.0002534579,0.00006943981,0.01192717],"genre_scores_gemma":[0.9986382,0.0003898427,0.0004456886,0.0002044526,0.00004742178,0.00002875283,0.0000597926,0.00001898488,0.0001668579],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1995417,"threshold_uncertainty_score":0.8648786,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0131621623113627,"gpt":0.2447043921567723,"spread":0.2315422298454096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003302179,0.0001873316,0.0001941255,0.0002103257,0.0005729801,0.001810577,0.0003633909,0.00005930288,0.00001145459],"category_scores_gemma":[0.00007372548,0.0001619206,0.00005132396,0.0002282938,0.00008063594,0.004291631,0.0001661505,0.0001051723,0.0000264142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002813341,"about_ca_system_score_gemma":0.00006992968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000491261,"about_ca_topic_score_gemma":0.000001359702,"domain_scores_codex":[0.9986318,0.00003168624,0.0005078529,0.0001887002,0.0002867245,0.0003532089],"domain_scores_gemma":[0.9990273,0.0001146218,0.0002879845,0.0001963809,0.0002846242,0.00008913601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001124805,0.00005173431,0.000232624,0.001229496,0.00003920904,0.000001137991,0.02165012,0.000559283,0.0002998234,0.249192,0.005617569,0.7211157],"study_design_scores_gemma":[0.0004063384,0.00008746389,0.001251651,0.0001063327,0.000006515549,0.00004152216,0.001863396,0.9456117,0.0003318338,0.04519084,0.004850564,0.0002519084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1970018,0.0003127386,0.79963,0.001511178,0.000337924,0.0004222515,0.00001296089,0.0003920426,0.0003791104],"genre_scores_gemma":[0.9564715,0.00002093664,0.04214209,0.001018497,0.00007747327,0.0001152082,0.00004642824,0.00001057901,0.00009730642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9450523,"threshold_uncertainty_score":0.9992256,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1703581136","doi":"10.1007/s11128-011-0235-0","title":"Investigating the performance of an adiabatic quantum optimization processor","year":2011,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01792518894787453,"gpt":0.2261525513042978,"spread":0.2082273623564233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007292599,0.0001911645,0.0001823736,0.0001945976,0.0005368054,0.0002634424,0.001005714,0.00006982972,0.000007405432],"category_scores_gemma":[0.0001296516,0.0001346738,0.00004140359,0.0008841191,0.0001333016,0.005175395,0.000141643,0.0002342292,0.00001028859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001981382,"about_ca_system_score_gemma":0.0002357421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000213833,"about_ca_topic_score_gemma":5.916654e-7,"domain_scores_codex":[0.9983197,0.0000698821,0.0006881829,0.0001909091,0.0004221011,0.000309183],"domain_scores_gemma":[0.9983705,0.0000459914,0.000727214,0.0004101952,0.0003516561,0.00009438697],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001613268,0.0001222374,0.0008779205,0.001120611,0.00002035442,8.916148e-7,0.07837211,0.4746243,0.0001704243,0.0262908,0.00003091675,0.4183533],"study_design_scores_gemma":[0.0001840651,0.0001983341,0.00125318,0.0001853681,0.000007447033,0.00002828984,0.000411109,0.9935698,0.002272656,0.001650533,0.00004640542,0.00019281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5295935,0.00004843232,0.469277,0.0001123914,0.0001373415,0.0001784252,0.000001241644,0.0002056767,0.0004459885],"genre_scores_gemma":[0.8765975,0.000004780903,0.1230215,0.0003012109,0.00003504977,0.00001746104,0.000009828458,0.000009361367,0.000003273205],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5189455,"threshold_uncertainty_score":0.5491838,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01204407336604196,"gpt":0.2442126921028655,"spread":0.2321686187368236,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006794741,0.0001774941,0.0002280954,0.0003880241,0.0002102533,0.0002700931,0.0004477242,0.00007792774,0.000007536479],"category_scores_gemma":[0.00007446077,0.0001248912,0.00003516317,0.0008947628,0.0002774271,0.004411865,0.000126072,0.0001399084,0.0000031355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003446149,"about_ca_system_score_gemma":0.0001830453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000795858,"about_ca_topic_score_gemma":0.0001785255,"domain_scores_codex":[0.9981109,0.00005820907,0.0009027165,0.0001487472,0.0005372373,0.0002422122],"domain_scores_gemma":[0.9979655,0.00004072547,0.001114484,0.0003372455,0.0004896891,0.00005236845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007597301,0.0007835083,0.04808452,0.005568743,0.00007764479,0.0000014111,0.2010524,0.003005127,0.01841794,0.4528116,0.0001286107,0.2693088],"study_design_scores_gemma":[0.0008145046,0.0005424963,0.009054207,0.0003789612,0.00000668009,0.000006606348,0.001321376,0.9758292,0.01032565,0.001295112,0.0002459699,0.0001792432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2492598,0.00002689423,0.7474301,0.000093287,0.00005015429,0.002346538,0.000006113646,0.00005559279,0.0007314826],"genre_scores_gemma":[0.9918864,0.000002354233,0.007744205,0.00009213452,0.00001677047,0.0002407951,0.00001048027,0.000005685806,0.000001163891],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.972824,"threshold_uncertainty_score":0.5092914,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05126842841557887,"gpt":0.2389025551765682,"spread":0.1876341267609893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007186949,0.0002434984,0.0002204442,0.0005793418,0.0005913762,0.0008455204,0.0006619691,0.0001279195,0.000009550707],"category_scores_gemma":[0.000107441,0.0002220262,0.00009103323,0.0007889656,0.0001068904,0.0111601,0.000134537,0.0001652162,0.0000323815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002576062,"about_ca_system_score_gemma":0.0001074471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003574138,"about_ca_topic_score_gemma":5.882659e-7,"domain_scores_codex":[0.998131,0.00003284712,0.0007662073,0.0002160627,0.000355049,0.0004988533],"domain_scores_gemma":[0.9987047,0.00004503113,0.0005160458,0.0003477666,0.0001741942,0.0002122553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002881278,0.00003952339,0.00008373364,0.0003278163,0.0000132158,3.924629e-7,0.01848784,0.000004668994,0.00001803316,0.864384,0.0009976656,0.1156143],"study_design_scores_gemma":[0.001118324,0.0002319987,0.001792471,0.00009288212,0.00001165255,0.00005733176,0.001612997,0.8226166,0.0007119864,0.0683479,0.102866,0.0005398028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01130737,0.0001569402,0.979169,0.001429322,0.0001914762,0.0004844665,0.00000879217,0.0005786463,0.006674044],"genre_scores_gemma":[0.9807455,0.00002215834,0.01668965,0.002334896,0.00003388899,0.0001172907,0.00003620318,0.00001280902,0.000007607884],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9694381,"threshold_uncertainty_score":0.9053964,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006119963805271291,"gpt":0.2187419308921576,"spread":0.2126219670868863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005962665,0.0002666583,0.0003541112,0.0005566516,0.00012829,0.0003301512,0.0006684095,0.00007605872,0.000003935026],"category_scores_gemma":[0.00001131863,0.0002042271,0.00006719648,0.001084607,0.00007111331,0.003651476,0.00005741658,0.0003412944,0.00001803455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002968324,"about_ca_system_score_gemma":0.0002360919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001020669,"about_ca_topic_score_gemma":0.000007163203,"domain_scores_codex":[0.9979019,0.00008703448,0.0007231007,0.0003014637,0.0005474162,0.0004390971],"domain_scores_gemma":[0.9989462,0.0000565744,0.0002369682,0.0004699577,0.0001843702,0.0001059283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003685089,0.0003284164,0.02414889,0.002591951,0.00007219327,0.00003010957,0.08943162,0.3148426,0.01151131,0.0813319,0.00001556971,0.4753269],"study_design_scores_gemma":[0.0008677983,0.0004881532,0.02013409,0.0003864391,0.000004882712,0.00002921385,0.0004569564,0.9737599,0.0007408092,0.002639841,0.0001456233,0.0003462508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6580773,0.00005241646,0.3411721,0.00005866333,0.00009469688,0.0002134814,0.000006530435,0.0001195212,0.0002053097],"genre_scores_gemma":[0.9951857,0.00001072769,0.004516505,0.0002268514,0.000009845967,0.000009766631,0.00002296447,0.00001449089,0.000003170006],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6589173,"threshold_uncertainty_score":0.8328139,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01136518573823692,"gpt":0.2331410266207911,"spread":0.2217758408825542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0007883923,0.0004531347,0.0003654464,0.0008874563,0.0008274475,0.00397362,0.001537271,0.0003007645,0.00007187336],"category_scores_gemma":[0.0001982595,0.0004127847,0.0002239589,0.001729725,0.0001669277,0.02183698,0.0002398985,0.0007815755,0.0006534054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003796037,"about_ca_system_score_gemma":0.0003529266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001577695,"about_ca_topic_score_gemma":0.000004901168,"domain_scores_codex":[0.9967525,0.00004502075,0.001001473,0.0003604401,0.001051282,0.0007893109],"domain_scores_gemma":[0.9970239,0.00006858999,0.0008654243,0.0009524311,0.0007477402,0.0003418582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001590552,0.00005374097,0.0001730108,0.0002235611,0.00001647014,0.00000226649,0.007763046,0.00001022451,0.001598056,0.8489357,0.006372079,0.134836],"study_design_scores_gemma":[0.0007808444,0.0001058579,0.0006733647,0.00006999115,0.00001272905,0.0001224569,0.001426528,0.7551087,0.005113762,0.04360455,0.1922322,0.0007489676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0728763,0.00009340273,0.9077684,0.007349525,0.001642808,0.0003944382,0.00001296614,0.001205188,0.008656936],"genre_scores_gemma":[0.9828951,0.00002547543,0.01213079,0.004634589,0.0001168761,0.00006052509,0.0000401132,0.00002057416,0.00007599168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9100187,"threshold_uncertainty_score":0.9998324,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02062813052857877,"gpt":0.2833123717630261,"spread":0.2626842412344473,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007466499,0.0002462063,0.0002665713,0.0004139026,0.0003726913,0.0007632119,0.0006517697,0.0001082145,0.000009623222],"category_scores_gemma":[0.000240484,0.0002220148,0.0001015999,0.0007891876,0.00003041443,0.003694933,0.0002666445,0.0003023,0.0003366535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007011486,"about_ca_system_score_gemma":0.0002870526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005360654,"about_ca_topic_score_gemma":1.882987e-7,"domain_scores_codex":[0.998011,0.00004066702,0.0006241911,0.0003439802,0.0004217375,0.0005584248],"domain_scores_gemma":[0.998516,0.0002029242,0.0003471912,0.0004204166,0.0003286794,0.0001848091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001725509,0.00022417,0.0004234609,0.002296374,0.00006642925,0.00001222183,0.03737647,0.1379897,0.001802127,0.2219615,0.01548328,0.5821917],"study_design_scores_gemma":[0.0003952893,0.0002326449,0.0002905187,0.0002108619,0.000003480713,0.00005085067,0.0006875533,0.9588346,0.0001996442,0.00224015,0.03652447,0.0003298857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1142865,0.00003090167,0.8782027,0.00503921,0.0008004065,0.0005814586,0.000004858886,0.0004313429,0.0006227201],"genre_scores_gemma":[0.8056569,0.000001876147,0.1916402,0.002454853,0.0001119372,0.00004472882,0.00002218894,0.00001669479,0.00005060543],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8208449,"threshold_uncertainty_score":0.9053501,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02271803533438581,"gpt":0.2465523763111897,"spread":0.2238343409768039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006269714,0.0002721616,0.0002414459,0.000190636,0.003266091,0.002369809,0.001903308,0.00009868228,0.000008766193],"category_scores_gemma":[0.0003620571,0.0002447493,0.00008892654,0.0002346197,0.0001459459,0.008308907,0.0005175098,0.0003529066,0.0001089682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005221407,"about_ca_system_score_gemma":0.0001654554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005668858,"about_ca_topic_score_gemma":0.000001428776,"domain_scores_codex":[0.9979595,0.00003056049,0.0005735172,0.0003245377,0.0005280652,0.00058381],"domain_scores_gemma":[0.9976814,0.00008812606,0.0008412814,0.0009292947,0.0003083179,0.0001516052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001048711,0.00003084679,0.001580055,0.0002993417,0.000009497158,0.000003198703,0.004945016,0.00513983,0.0000905521,0.004563192,0.0001517241,0.9831762],"study_design_scores_gemma":[0.0002891845,0.0001050627,0.007362956,0.0002223623,0.000005200651,0.0000670749,0.0001199573,0.9841425,0.0003184185,0.002037427,0.004969767,0.0003601178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2176218,0.00009771108,0.7784387,0.001005172,0.0005974402,0.0001479225,0.000004457765,0.0004143367,0.001672516],"genre_scores_gemma":[0.9549397,0.00001395459,0.04440867,0.000434642,0.0001483225,0.00001080757,0.00001100795,0.00001182581,0.00002109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9828162,"threshold_uncertainty_score":0.9986658,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02045521750417519,"gpt":0.2539024659810011,"spread":0.2334472484768259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001028205,0.0002650586,0.0002796648,0.000966528,0.0002057626,0.0007771329,0.0007281606,0.0001421095,0.00001253523],"category_scores_gemma":[0.0001361237,0.0002558792,0.00006627006,0.002189833,0.00005583958,0.01137148,0.0001290936,0.0003281286,0.000436318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001566176,"about_ca_system_score_gemma":0.0005189364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006142153,"about_ca_topic_score_gemma":0.000008166533,"domain_scores_codex":[0.9975257,0.0000591432,0.001044293,0.0002079765,0.00062891,0.0005339659],"domain_scores_gemma":[0.9986413,0.00002317593,0.0003166815,0.0003693675,0.0003970601,0.0002524226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002606838,0.000403066,0.003970603,0.001012674,0.00005209097,0.00003552441,0.06521977,0.02250864,0.0007552707,0.2600082,0.004497953,0.6412755],"study_design_scores_gemma":[0.001441599,0.0001068491,0.002468298,0.0001353025,0.000004012364,0.00006907557,0.001035832,0.9839751,0.0007242632,0.002516096,0.007132443,0.0003911321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2351619,0.0008083711,0.7535812,0.001046474,0.0007437796,0.0005108577,0.000007943306,0.0009021466,0.007237383],"genre_scores_gemma":[0.9858499,0.0000225817,0.01248204,0.001480451,0.00004324104,0.00004005738,0.00006191137,0.00001085755,0.000008999465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9614664,"threshold_uncertainty_score":0.9999893,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01211252464267121,"gpt":0.2561919835495757,"spread":0.2440794589069045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008841002,0.0001820303,0.0001787008,0.0001673811,0.0002650846,0.00009790162,0.000167673,0.00005476721,0.0002424604],"category_scores_gemma":[0.00005147557,0.0001661957,0.00005718247,0.0003938807,0.000039636,0.00237943,0.0000506158,0.0002691326,0.0007046804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004274971,"about_ca_system_score_gemma":0.00008007696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001447706,"about_ca_topic_score_gemma":1.812138e-7,"domain_scores_codex":[0.9986699,0.00004121572,0.0005360174,0.0001141523,0.000197085,0.0004416181],"domain_scores_gemma":[0.999175,0.0001009222,0.0003107578,0.0001963711,0.000113514,0.0001034035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001280342,0.0000615925,0.002235554,0.00003639761,0.000006284074,5.601309e-8,0.001706384,0.00002620143,0.00003777321,0.9720533,0.00008434006,0.02373933],"study_design_scores_gemma":[0.0003812746,0.00001871393,0.001349494,0.0001327572,0.00001666147,0.000001705243,0.002159665,0.1478348,0.0002078352,0.840015,0.007579228,0.0003028264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1737223,0.0002371068,0.7383311,0.00009266871,0.0003366831,0.0004342155,0.00002488373,0.0001465336,0.08667458],"genre_scores_gemma":[0.9989105,0.000002701752,0.0004786536,0.000109589,0.0001615269,0.0001019686,0.00008507972,0.00001717793,0.0001327271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8251883,"threshold_uncertainty_score":0.9057476,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.02832146695615977,"gpt":0.3000358818978707,"spread":0.2717144149417109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002214725,0.0001481145,0.000184273,0.000284839,0.0001250405,0.0001281735,0.0001506141,0.00009570565,0.000187764],"category_scores_gemma":[0.0005183675,0.0001285002,0.00003421661,0.0005287544,0.00003402798,0.004608188,0.00004850967,0.0002004118,0.0006096436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005111574,"about_ca_system_score_gemma":0.00007091462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009982492,"about_ca_topic_score_gemma":0.000007355511,"domain_scores_codex":[0.9987374,0.00001653852,0.0005761642,0.00009806164,0.0002808224,0.0002910193],"domain_scores_gemma":[0.999223,0.0001007998,0.0002551838,0.0001566238,0.000199921,0.00006447505],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006000989,0.000309467,0.009137776,0.003862699,0.00003599676,0.000009720334,0.02354542,0.001203487,0.001064662,0.3687931,0.004797406,0.5871803],"study_design_scores_gemma":[0.001171604,0.00006574952,0.004272016,0.0004597079,0.00001520022,0.00004262937,0.007271349,0.1471772,0.00425621,0.8293343,0.005249236,0.0006847568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.938615,0.0001136007,0.05235721,0.0003028541,0.0001260903,0.0004439039,0.000002545305,0.0002213646,0.007817448],"genre_scores_gemma":[0.9896837,0.000009678221,0.009691921,0.000294163,0.0000429073,0.00007345893,0.00001272927,0.00001281546,0.0001785514],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5864955,"threshold_uncertainty_score":0.7835938,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01559612922793114,"gpt":0.2624355094683716,"spread":0.2468393802404404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001821454,0.0001442192,0.0001853676,0.0000703055,0.0003676908,0.0003917126,0.00008847101,0.00005011098,0.0001081856],"category_scores_gemma":[0.00002079732,0.0001424624,0.00004315043,0.0002602571,0.0000312565,0.001376343,0.00005630477,0.000130869,0.00009526625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000165607,"about_ca_system_score_gemma":0.0001972135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002709405,"about_ca_topic_score_gemma":5.790587e-7,"domain_scores_codex":[0.9990147,0.00001735644,0.000399311,0.0001504016,0.0001742898,0.0002439568],"domain_scores_gemma":[0.9992095,0.00004562819,0.0002281378,0.0001606235,0.0002418789,0.0001142131],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003748058,0.00003609921,0.002933185,0.00007537927,0.00002685869,5.551007e-7,0.0009883733,0.000006073817,0.001164023,0.8887544,0.0003369463,0.1056743],"study_design_scores_gemma":[0.001958134,0.00006532693,0.008486826,0.0003581757,0.0001617149,0.00002092033,0.007574819,0.2371517,0.01656025,0.5815061,0.1450238,0.001132274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7462972,0.0001662361,0.2476745,0.0008909571,0.0001000279,0.0001897389,0.0000621103,0.00009497773,0.004524256],"genre_scores_gemma":[0.9986263,0.0000073635,0.0007411574,0.0001936614,0.0001370695,0.00003478762,0.0002168855,0.00001120044,0.00003155618],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3072483,"threshold_uncertainty_score":0.5809449,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01407609994105428,"gpt":0.2324233859910685,"spread":0.2183472860500142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008205451,0.0001867541,0.0001574172,0.0005881523,0.001238824,0.001000501,0.0008647284,0.00005476869,0.0001393138],"category_scores_gemma":[0.00008594144,0.000196426,0.00009798482,0.001354486,0.00002781995,0.007944746,0.0004263127,0.0003006893,0.00006535891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001036671,"about_ca_system_score_gemma":0.0004938787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006139033,"about_ca_topic_score_gemma":7.199317e-7,"domain_scores_codex":[0.998125,0.000127098,0.0005433086,0.0002335483,0.0005837443,0.0003873599],"domain_scores_gemma":[0.9988187,0.00005218309,0.0004296533,0.000335946,0.0002098821,0.0001536424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002339264,0.00003914346,0.00004337936,0.00002570473,0.00001129371,0.000001690697,0.008878423,0.0003839754,0.0003225675,0.1946406,0.000860331,0.7947695],"study_design_scores_gemma":[0.0007786075,0.0001827405,0.0009412028,0.00001546386,0.000007816018,0.00005697336,0.0008824088,0.9300526,0.000178337,0.01947488,0.04706617,0.0003627662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01265453,0.00008583965,0.9829177,0.001850482,0.0007596911,0.0002038058,0.00001303045,0.0005374964,0.0009774019],"genre_scores_gemma":[0.9547913,0.000001843427,0.0436957,0.001244353,0.00009308106,0.00004105061,0.00008256231,0.00001024155,0.00003988488],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9421368,"threshold_uncertainty_score":0.9647854,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01930692989201039,"gpt":0.2590026870449758,"spread":0.2396957571529654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001802924,0.0001575484,0.0001621518,0.00008913838,0.0003615584,0.0004351581,0.0001004224,0.00004799605,0.0001691941],"category_scores_gemma":[0.00001515301,0.0001517617,0.00004443098,0.0004592453,0.00004107795,0.0009159475,0.00005305486,0.0001624433,0.00007929851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001235508,"about_ca_system_score_gemma":0.0002311838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002338608,"about_ca_topic_score_gemma":5.539109e-7,"domain_scores_codex":[0.9989179,0.00002183381,0.0004651126,0.0001761733,0.0001750369,0.0002439543],"domain_scores_gemma":[0.9991451,0.00003095207,0.0002523547,0.0001941299,0.0002854173,0.00009203458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004331984,0.00005121982,0.0003026352,0.00007267849,0.0000101469,6.431868e-7,0.0007363574,0.00003223458,0.0007403692,0.9785092,0.00006480707,0.01947531],"study_design_scores_gemma":[0.0006610788,0.00005138216,0.0003791722,0.0001346719,0.0000357871,0.0000170459,0.008303136,0.457593,0.004187441,0.5216916,0.006500485,0.000445306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.855077,0.0002993412,0.1227197,0.0004459878,0.0001244547,0.0002019797,0.0000443248,0.0001510232,0.02093614],"genre_scores_gemma":[0.9991798,0.00001433801,0.000325794,0.0001491602,0.00005301066,0.00003311865,0.0001953835,0.00001040107,0.00003898236],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4575607,"threshold_uncertainty_score":0.6188661,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03748539786195969,"gpt":0.2513493032621814,"spread":0.2138639054002217,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003618698,0.0001689128,0.0001771562,0.0001753448,0.0003238544,0.0005186365,0.0007459595,0.00007324944,0.00003231446],"category_scores_gemma":[0.00007167438,0.0001180072,0.0001034684,0.0008809549,0.00007186155,0.003894353,0.0001265411,0.0002579513,0.0001092843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002279116,"about_ca_system_score_gemma":0.00008430355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001855204,"about_ca_topic_score_gemma":1.306964e-7,"domain_scores_codex":[0.9983307,0.00003428057,0.0006841391,0.0001428302,0.0005528664,0.0002551758],"domain_scores_gemma":[0.9989833,0.0001030048,0.0003523717,0.0002756155,0.0001672487,0.0001184638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001761068,0.00002209031,0.0001908723,0.0001723377,0.0000107764,3.97824e-7,0.01191374,0.000799254,0.0001260625,0.865283,0.001295301,0.1201685],"study_design_scores_gemma":[0.0002279414,0.0001499726,0.0008555782,0.0001185182,0.000004324215,0.000005118139,0.0007545419,0.9768072,0.001104757,0.003444972,0.0163364,0.0001907207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03001529,0.00002373911,0.9523709,0.01039187,0.0001785708,0.0001758272,0.000002398593,0.0002101755,0.00663123],"genre_scores_gemma":[0.9817328,0.000005713514,0.01159769,0.006554831,0.00008089346,0.000009583371,0.00001165403,0.000005595184,0.000001260356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9760079,"threshold_uncertainty_score":0.5001224,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quantum computer; Algorithm; Bit (key); Physics; Quantum; Quantum mechanics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01234246625028943,"gpt":0.2437643787326249,"spread":0.2314219124823355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001896965,0.00019903,0.0001410955,0.0002353179,0.0008287655,0.0007176669,0.000839924,0.00008034905,0.000008863667],"category_scores_gemma":[0.0001622006,0.0001348282,0.00007124142,0.000825256,0.00006093095,0.00127697,0.0001161441,0.0004157226,0.00008913549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005447392,"about_ca_system_score_gemma":0.0001440722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001209339,"about_ca_topic_score_gemma":8.374913e-7,"domain_scores_codex":[0.9981917,0.0000439179,0.0004972709,0.0002030597,0.0006061498,0.0004579584],"domain_scores_gemma":[0.9986562,0.0003041425,0.0003007058,0.0004361534,0.000201202,0.0001015796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000264314,0.00005274054,0.00007728146,0.00009006785,0.000006297281,0.000007559486,0.002849458,0.02949147,0.00003851263,0.0521145,0.0004268482,0.9148188],"study_design_scores_gemma":[0.0002253094,0.00006039648,0.000888806,0.00009868995,0.000002547625,0.00001630427,0.0001271728,0.9886793,0.0008802736,0.002607323,0.006213414,0.0002004767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01808195,0.00003469348,0.9758721,0.002083033,0.0004130015,0.0001676146,0.000001893604,0.0004085616,0.002937166],"genre_scores_gemma":[0.9485137,9.654077e-7,0.04694134,0.004362552,0.0001476974,0.00000613398,0.000007104969,0.000008442109,0.00001204444],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9591878,"threshold_uncertainty_score":0.6920479,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01322339976635227,"gpt":0.2260338587316861,"spread":0.2128104589653338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007912764,0.0005846841,0.0004559365,0.001896121,0.001364908,0.000901664,0.001340587,0.0002180155,0.00003898986],"category_scores_gemma":[0.0001062314,0.0005385402,0.000298541,0.003683273,0.0001808401,0.009963894,0.0001354284,0.0005979614,0.0005965608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001103691,"about_ca_system_score_gemma":0.0005600639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002263981,"about_ca_topic_score_gemma":8.492351e-7,"domain_scores_codex":[0.9954711,0.0001372587,0.001489283,0.0004533914,0.001534057,0.000914891],"domain_scores_gemma":[0.9968001,0.0001121211,0.0009867483,0.000927376,0.0008033165,0.0003703777],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006321218,0.001965373,0.002800118,0.003216567,0.0002625797,0.0001214676,0.05572509,0.01767253,0.0003304874,0.5841284,0.01298096,0.3201643],"study_design_scores_gemma":[0.00133609,0.0003759747,0.001979588,0.0001326218,0.000009673665,0.00006689013,0.0002547276,0.9699931,0.001017851,0.005294866,0.01879026,0.0007484072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03170225,0.00009925352,0.9588924,0.0007696169,0.0006586255,0.0007474858,0.00002396753,0.002769656,0.004336771],"genre_scores_gemma":[0.948048,0.0000599056,0.04768023,0.00384896,0.00005970944,0.0001577042,0.00009934801,0.00003321685,0.00001292236],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9523205,"threshold_uncertainty_score":0.9999352,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0115467640494669,"gpt":0.244708626039893,"spread":0.2331618619904261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001040846,0.000168443,0.0001405546,0.000116047,0.0002214234,0.0004714303,0.0001487067,0.00003282323,0.000249101],"category_scores_gemma":[5.320462e-7,0.0001475019,0.00006198778,0.0002018797,0.00002706206,0.002095752,0.00003122103,0.0001355655,0.0003575963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002361743,"about_ca_system_score_gemma":0.00005027741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001628795,"about_ca_topic_score_gemma":0.000003010558,"domain_scores_codex":[0.9990777,0.00001101784,0.000353113,0.0001310795,0.0001954247,0.0002316475],"domain_scores_gemma":[0.9994553,0.00001476625,0.0002053154,0.0001743188,0.00009699599,0.00005329937],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002038824,0.0004759192,0.01308914,0.0001653006,0.00003918482,9.313132e-7,0.00221434,0.0009109718,0.002291766,0.7450411,0.001612966,0.2339545],"study_design_scores_gemma":[0.009249738,0.0009604364,0.01543457,0.0007874373,0.0001233019,0.000007316147,0.004388691,0.2754031,0.1855768,0.2004096,0.3047136,0.002945369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9234794,0.000009754263,0.007558411,0.00008230076,0.0001131345,0.0001456925,0.000009949569,0.00008895932,0.06851239],"genre_scores_gemma":[0.9989836,1.559719e-7,0.0001886789,0.0001645256,0.0002557658,0.00002377213,0.0001797722,0.00001232626,0.0001914533],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5446315,"threshold_uncertainty_score":0.6014951,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005942515381738166,"gpt":0.2237502419650907,"spread":0.2178077265833526,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006602795,0.0002140758,0.0002098898,0.0001312216,0.0004975724,0.0007845762,0.0003904341,0.00004866056,0.000002056794],"category_scores_gemma":[0.00003777146,0.00009840079,0.00003460586,0.0003627068,0.0002366522,0.002276903,0.0001635929,0.0001528547,0.0000256192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004497212,"about_ca_system_score_gemma":0.0001301189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003045279,"about_ca_topic_score_gemma":0.000003455453,"domain_scores_codex":[0.9984506,0.00009073108,0.0004762587,0.0002327783,0.0004282128,0.0003213645],"domain_scores_gemma":[0.9988316,0.0001931166,0.0004267518,0.0002267301,0.0002372755,0.00008454684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009546697,0.00002341432,0.0001751048,0.0001677932,0.00001887983,0.000001961762,0.006443759,0.003087312,0.00003804899,0.1388367,0.0002879775,0.8508236],"study_design_scores_gemma":[0.001901908,0.0001488083,0.0008103851,0.0003346787,0.000008231996,0.00006963824,0.0001751,0.9529888,0.0001392177,0.04062008,0.002574343,0.0002287843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1304298,0.0001433625,0.8624595,0.006045041,0.00009415042,0.0003427984,0.000003108082,0.0002646886,0.0002176343],"genre_scores_gemma":[0.9656997,0.00003455168,0.03354048,0.000616948,0.00004185823,0.00003199986,0.000007723221,0.00001039638,0.00001639621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9499015,"threshold_uncertainty_score":0.7565686,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0116476766371267,"gpt":0.3143069060101776,"spread":0.3026592293730509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003650492,0.0001244591,0.0002270569,0.00009737081,0.0002581599,0.0004114823,0.0001204863,0.00006260496,0.000005135028],"category_scores_gemma":[0.0001996137,0.0001058665,0.00002653621,0.00007964434,0.00006661288,0.0008515518,0.0001064394,0.0001927402,0.000003212759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000186926,"about_ca_system_score_gemma":0.00003501231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001287307,"about_ca_topic_score_gemma":5.915717e-7,"domain_scores_codex":[0.9989436,0.0000110229,0.0004750099,0.0001305456,0.0002301297,0.0002096631],"domain_scores_gemma":[0.9991738,0.000134089,0.0003807754,0.0001220866,0.00008727664,0.0001019775],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006221295,0.0006890993,0.2586297,0.006099522,0.0000749923,0.00000539981,0.001554962,0.006247986,0.0008861992,0.5427679,0.000008546505,0.1824135],"study_design_scores_gemma":[0.001082748,0.00008937909,0.01314934,0.0004181603,0.00001282459,6.540407e-7,0.0001528308,0.9792818,0.004315782,0.001259346,0.000089152,0.0001479728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9837778,0.00007084031,0.01542947,0.00001589819,0.00007901746,0.0002393886,0.000009868818,0.00001206461,0.0003656185],"genre_scores_gemma":[0.9995757,0.000008921696,0.0003174898,0.00001836,0.00004032067,0.00001858879,0.000009475686,0.000005428479,0.000005676454],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9730338,"threshold_uncertainty_score":0.4317112,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02073441352530412,"gpt":0.3024182380016185,"spread":0.2816838244763144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001697734,0.0000990163,0.000160602,0.00006207695,0.0002890597,0.0000621749,0.0002690772,0.00008889671,0.00005354673],"category_scores_gemma":[0.0001096571,0.00009466363,0.00004470609,0.00006059647,0.00008398424,0.001861107,0.0000599937,0.0001046866,0.000005267145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002794923,"about_ca_system_score_gemma":0.00003965185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003314144,"about_ca_topic_score_gemma":0.000001385135,"domain_scores_codex":[0.9990771,0.000004324933,0.0005233273,0.00008134133,0.0001980989,0.0001158462],"domain_scores_gemma":[0.9977375,0.00002453107,0.001554389,0.0003620091,0.0002901241,0.00003147402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001055399,0.0001713014,0.001701527,0.00436568,0.00005305616,6.76451e-7,0.007558688,0.0005777596,0.2980773,0.2060154,0.00008103529,0.481292],"study_design_scores_gemma":[0.000329842,0.00002583629,0.0005647725,0.0003299956,0.00002819688,0.000002954584,0.001041527,0.07497231,0.8624063,0.05939214,0.0007342686,0.0001718852],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4136033,0.00009834344,0.581046,0.00009457822,0.00001474563,0.000117522,0.0000373906,0.0001185118,0.004869679],"genre_scores_gemma":[0.9920079,0.00009018456,0.007684762,0.00001655377,0.00001432305,0.00003065201,0.0001081232,0.000009019255,0.00003847828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5784047,"threshold_uncertainty_score":0.3860271,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02928789962526194,"gpt":0.2971253608042009,"spread":0.267837461178939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008446274,0.000334595,0.0004611965,0.0001964659,0.0004790742,0.0002405721,0.0002433951,0.000208449,0.00003460653],"category_scores_gemma":[0.002587978,0.0003008682,0.0001176908,0.000358209,0.0001072021,0.001851249,0.00004485386,0.0001909055,0.00003820753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001881977,"about_ca_system_score_gemma":0.0001173634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002301136,"about_ca_topic_score_gemma":0.000002739289,"domain_scores_codex":[0.9975303,0.00003980902,0.00129875,0.0002370778,0.0002982555,0.0005957884],"domain_scores_gemma":[0.9974285,0.000966488,0.0008779074,0.0002552186,0.0003799184,0.0000919852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006187597,0.0003298029,0.000846336,0.008740564,0.00005705609,8.173382e-7,0.001691191,0.0002915383,0.01474338,0.9511045,0.007770126,0.01436284],"study_design_scores_gemma":[0.000565642,0.00007117716,0.00005794008,0.0001735546,0.00004958618,0.00000943551,0.0002372875,0.5834228,0.002151761,0.4128205,0.0001715282,0.0002686837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1517354,0.0002257181,0.8435416,0.0001737882,0.0001458378,0.001061626,0.00005750022,0.0005752424,0.002483371],"genre_scores_gemma":[0.9827383,6.622394e-7,0.01653078,0.0001105576,0.00008604338,0.0001901235,0.0002329133,0.0000391301,0.00007151953],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8310029,"threshold_uncertainty_score":0.9999443,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00822677762229415,"gpt":0.2427405596023941,"spread":0.2345137819801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001097737,0.0003768648,0.000336939,0.000934566,0.0005501349,0.001295119,0.0009039597,0.0002719991,0.00002332878],"category_scores_gemma":[0.0003410349,0.0003512091,0.000105367,0.001603704,0.0001100047,0.01263633,0.0002453672,0.001116802,0.0003655885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008571138,"about_ca_system_score_gemma":0.0003887107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001331756,"about_ca_topic_score_gemma":0.00004818237,"domain_scores_codex":[0.9969184,0.00007830242,0.001269559,0.0003079388,0.0007187477,0.0007070304],"domain_scores_gemma":[0.9980476,0.000109338,0.0007093109,0.0005490631,0.0003866059,0.0001980608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006517312,0.0001444319,0.0008962258,0.0003787555,0.00001271373,0.000007118875,0.01637703,0.02073092,0.001023592,0.04741532,0.001563232,0.9113855],"study_design_scores_gemma":[0.0006290346,0.0001069607,0.002284986,0.000143215,0.000004846052,0.0001168426,0.0005376274,0.9772956,0.001121916,0.00252067,0.01477394,0.0004644156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3421549,0.00002961487,0.6515756,0.0009458284,0.003628657,0.0003053425,0.000005041588,0.0006294269,0.0007255797],"genre_scores_gemma":[0.9894835,0.000006953966,0.009348973,0.0008677504,0.0001624019,0.00003943394,0.00006529013,0.00001463038,0.00001110148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9565646,"threshold_uncertainty_score":0.999894,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00804093882284985,"gpt":0.216727774134134,"spread":0.2086868353112842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000437775,0.0002168138,0.000178474,0.0002553835,0.0004441196,0.0005441005,0.0004632337,0.00007278442,0.00001211593],"category_scores_gemma":[0.00006156496,0.0001678995,0.00003797689,0.0008111153,0.00004654827,0.007064978,0.0001072694,0.0002100966,0.00008740763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004726092,"about_ca_system_score_gemma":0.000141606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007162055,"about_ca_topic_score_gemma":2.80272e-7,"domain_scores_codex":[0.9983914,0.00004528006,0.0004210368,0.0001617706,0.0004522469,0.0005282381],"domain_scores_gemma":[0.9988877,0.00005169176,0.0003623998,0.0003103348,0.0002079166,0.0001800009],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002162213,0.000125275,0.0009730959,0.0003708221,0.00002659749,0.000002295056,0.01595384,0.5605837,0.00002537457,0.07071288,0.0005554114,0.3506491],"study_design_scores_gemma":[0.0002927511,0.00007812642,0.0006765394,0.0001186648,0.000007600906,0.00008139765,0.0001585843,0.9951273,0.0001242249,0.0004624553,0.002588445,0.0002838897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0245954,0.0002138491,0.9725001,0.0004877745,0.0003567842,0.0001669327,0.000001582446,0.0004898568,0.001187667],"genre_scores_gemma":[0.8624138,0.000005364179,0.1368331,0.0005573016,0.0001310126,0.00001541253,0.00002031164,0.00001194191,0.00001180444],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8378184,"threshold_uncertainty_score":0.6846741,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04550544070340176,"gpt":0.2892446087665367,"spread":0.2437391680631349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008996767,0.0002618336,0.0002946596,0.0003631364,0.000656252,0.001127359,0.0004865819,0.0001073018,0.000005462481],"category_scores_gemma":[0.0002944988,0.000246558,0.00004538906,0.0005723308,0.00007037693,0.004708604,0.000145098,0.0002760553,0.000007364477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004609052,"about_ca_system_score_gemma":0.00006341188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001265426,"about_ca_topic_score_gemma":0.000001230949,"domain_scores_codex":[0.9980256,0.00008220887,0.0007048467,0.0003501218,0.0002740246,0.0005632189],"domain_scores_gemma":[0.9987844,0.000400178,0.0003012858,0.0002384173,0.0001625161,0.0001131912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001752932,0.00008314689,0.0001146065,0.0004811018,0.000008409673,0.000004449488,0.02078749,0.02620578,0.001434488,0.00447322,0.0001804414,0.9462093],"study_design_scores_gemma":[0.001123709,0.0001292692,0.00004971977,0.000328702,0.000005051558,0.00007610311,0.0005707074,0.9895502,0.001751905,0.005314734,0.000765615,0.0003342592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2202052,0.0005021581,0.778052,0.000461475,0.0001532134,0.0003486629,0.000003146161,0.0002167102,0.00005736693],"genre_scores_gemma":[0.8313186,0.00002107727,0.1682271,0.0003210229,0.00004831527,0.00003893058,0.000008036716,0.00001277814,0.000004162617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9633445,"threshold_uncertainty_score":0.9999987,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006719093501419308,"gpt":0.222503255422399,"spread":0.2157841619209797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002572192,0.0002626034,0.0001958893,0.0002433322,0.0006808114,0.001000269,0.0007336086,0.0001082952,0.00006065683],"category_scores_gemma":[0.00004107362,0.0002066002,0.00005033152,0.0005566775,0.00009188437,0.003396424,0.0001764871,0.0005522773,0.00002867177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003909735,"about_ca_system_score_gemma":0.0002784914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001594719,"about_ca_topic_score_gemma":0.000007609538,"domain_scores_codex":[0.9981372,0.00002704567,0.0004779867,0.0002840432,0.0006097572,0.0004639493],"domain_scores_gemma":[0.9987881,0.00003809254,0.0003788199,0.0003480009,0.0002994211,0.0001476191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006252348,0.00008946047,0.001825313,0.0003958211,0.00005906066,0.0000187259,0.01064683,0.01313557,0.01055175,0.72208,0.001443481,0.2396915],"study_design_scores_gemma":[0.0005834475,0.00007705397,0.002281084,0.00007232337,0.000006411111,0.0001919215,0.00008556779,0.9828745,0.001101341,0.005349868,0.007034459,0.00034207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3727438,0.00003346128,0.6247258,0.0007849106,0.0006497251,0.0001885011,0.00002973559,0.0004160189,0.0004280876],"genre_scores_gemma":[0.9160094,0.000001250034,0.08301546,0.0006457064,0.0002004151,0.000009547012,0.00009080447,0.000011623,0.00001582001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9697389,"threshold_uncertainty_score":0.9645614,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008652111084899916,"gpt":0.2351869275043972,"spread":0.2265348164194973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004314719,0.0001486723,0.0001761055,0.0005387845,0.0003320196,0.0003968265,0.0006800844,0.00007622722,0.00005568286],"category_scores_gemma":[0.000040177,0.0001327344,0.0000741918,0.001177857,0.0001473113,0.007233873,0.0001228349,0.0001069349,0.0002701366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002262446,"about_ca_system_score_gemma":0.00009902097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001021714,"about_ca_topic_score_gemma":0.000001093017,"domain_scores_codex":[0.9983771,0.00001770744,0.0007619752,0.0001180029,0.0004520002,0.000273162],"domain_scores_gemma":[0.9985114,0.00001891821,0.0006192185,0.0003348318,0.0004246183,0.00009097451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008232443,0.0001202254,0.002026423,0.001074509,0.00005563469,0.000001478233,0.1411779,0.00007096096,0.002388629,0.3461636,0.004791255,0.5020471],"study_design_scores_gemma":[0.001108649,0.0003249711,0.006229882,0.0003985236,0.00001248165,0.00003381845,0.004388319,0.8904868,0.02117531,0.008550132,0.066726,0.000565119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1237906,0.00004094547,0.8155015,0.000344845,0.0002974254,0.0001714213,0.000002257919,0.0002840635,0.05956697],"genre_scores_gemma":[0.9877298,0.000005020254,0.01139043,0.0007811511,0.00005405318,0.00001015463,0.000007833534,0.000004743417,0.0000167371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8904158,"threshold_uncertainty_score":0.5412753,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01378878942271403,"gpt":0.2615254256569138,"spread":0.2477366362341998,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004895462,0.0001447694,0.0002538099,0.0001313161,0.0004800165,0.0003341153,0.00128878,0.00004036257,0.000004859516],"category_scores_gemma":[0.0005813768,0.0001226885,0.00006828718,0.0002316724,0.0001714471,0.002378437,0.0003161783,0.0001316074,0.000008224339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001207492,"about_ca_system_score_gemma":0.0002034893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006614938,"about_ca_topic_score_gemma":0.000001157028,"domain_scores_codex":[0.9985482,0.00002289,0.0006090032,0.0001791536,0.0004091088,0.0002316305],"domain_scores_gemma":[0.9974363,0.00007787041,0.00127128,0.0008123705,0.0003462539,0.00005593355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000283379,0.0001109391,0.001147327,0.001552622,0.00002028302,0.000003102114,0.006261611,0.004477474,0.002800989,0.04612875,0.0001459981,0.9373226],"study_design_scores_gemma":[0.0004045182,0.0001323228,0.009652149,0.0004999416,0.000008524821,0.00003233131,0.0001256951,0.9499889,0.03123647,0.006112521,0.001556165,0.0002504635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3949127,0.0003851558,0.5915088,0.001708004,0.0007962176,0.0004276639,0.00001877342,0.0002823994,0.009960242],"genre_scores_gemma":[0.9433238,0.000007955576,0.05651858,0.00007199388,0.00003985472,0.000004198263,0.000002235317,0.000004905738,0.00002650105],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9455114,"threshold_uncertainty_score":0.5003093,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09563826890643594,"gpt":0.3818490415214261,"spread":0.2862107726149902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002688981,0.0001611342,0.0002235508,0.0006363089,0.0006300734,0.0008451028,0.0006564517,0.00008773446,0.0002728837],"category_scores_gemma":[0.002090204,0.0001232902,0.00009036654,0.002713189,0.0001352673,0.004422239,0.0001287149,0.0001667306,0.01447706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002893609,"about_ca_system_score_gemma":0.0001357746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004581021,"about_ca_topic_score_gemma":0.000001016347,"domain_scores_codex":[0.9972771,0.00005848923,0.0009913156,0.0002288242,0.001075357,0.0003688901],"domain_scores_gemma":[0.9976562,0.0004497012,0.0005209053,0.0004846387,0.0007644976,0.0001240204],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003881202,0.00002757752,0.0004540874,0.00005554617,0.000007677064,0.000002187313,0.01024918,0.0008518945,0.0005500037,0.3414816,0.03200827,0.6142732],"study_design_scores_gemma":[0.0002825807,0.00003402554,0.008291402,0.00004591342,0.000008295889,0.00002007815,0.01369413,0.251735,0.0007405934,0.5289802,0.1958911,0.0002766577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8834989,0.00009272202,0.07771536,0.004887938,0.0005623207,0.0004597253,0.00004075854,0.001179266,0.03156301],"genre_scores_gemma":[0.9976823,0.00001463277,0.0002572966,0.0008856895,0.00006430333,0.00005584837,0.00004970031,0.000009798572,0.0009804479],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6139965,"threshold_uncertainty_score":0.9862903,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01559351868541042,"gpt":0.260526557394497,"spread":0.2449330387090866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0008107784,0.0003045763,0.0002551354,0.0009450554,0.0002119749,0.001091138,0.0005803786,0.0001528944,0.00003872291],"category_scores_gemma":[0.0001149642,0.0002567,0.000049563,0.00248912,0.0000505437,0.01921463,0.0000890618,0.0003117051,0.0002842731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001507042,"about_ca_system_score_gemma":0.00143777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001507791,"about_ca_topic_score_gemma":0.00003368006,"domain_scores_codex":[0.9973111,0.00007527525,0.001012685,0.0002331203,0.0009070678,0.0004608094],"domain_scores_gemma":[0.9974461,0.00002263855,0.0007179783,0.0004042435,0.001103259,0.0003057976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001010863,0.0002513361,0.001926523,0.001284911,0.00004831194,0.00001112085,0.08376183,0.01347,0.0001074294,0.4134522,0.009283342,0.4753921],"study_design_scores_gemma":[0.004086366,0.0004959827,0.002265113,0.0002344919,0.000007627921,0.0001268372,0.003742481,0.9389577,0.000462018,0.008230295,0.04077308,0.0006180197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007047576,0.00001119796,0.9732366,0.001656893,0.0001948682,0.01105936,0.000002874145,0.0005960413,0.006194643],"genre_scores_gemma":[0.8974191,0.000003837364,0.08064654,0.0049997,0.000177667,0.0163651,0.0002445224,0.00004746902,0.00009604016],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9254877,"threshold_uncertainty_score":0.9999885,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03039739816706622,"gpt":0.293359885180464,"spread":0.2629624870133978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009280535,0.0002160176,0.0002526742,0.0004626703,0.000673607,0.000487801,0.0008859899,0.0002203761,0.000002853028],"category_scores_gemma":[0.0001000059,0.0002006198,0.00007217779,0.001371296,0.00005761003,0.001295307,0.0001910838,0.0001740167,0.00009331719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007476578,"about_ca_system_score_gemma":0.0002230769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001020855,"about_ca_topic_score_gemma":0.000001490339,"domain_scores_codex":[0.9980782,0.00002829162,0.0007050213,0.0002864311,0.0003287969,0.00057329],"domain_scores_gemma":[0.9984363,0.00006156895,0.0004401932,0.0005370204,0.0004251513,0.00009974609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004298129,0.0000771086,0.00003032192,0.001966334,0.00001839536,0.000001051361,0.005633569,0.02238292,0.0001522392,0.9078471,0.006962066,0.05488591],"study_design_scores_gemma":[0.000919382,0.00003729192,0.00001348366,0.0000672756,0.000005195619,0.000008260232,0.0002513549,0.9403028,0.0002450988,0.03233626,0.02557146,0.0002421159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002703933,0.00003418515,0.9653313,0.001154359,0.0001250249,0.02833518,0.00001592181,0.002075919,0.000224227],"genre_scores_gemma":[0.7075511,0.00001248773,0.01793127,0.00043143,0.00005686883,0.2737079,0.00007295801,0.00002995977,0.0002060284],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9474,"threshold_uncertainty_score":0.8181039,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01364341127312588,"gpt":0.2555144115763202,"spread":0.2418710003031943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000417221,0.0001873047,0.0003164434,0.0005006011,0.00021276,0.0002133816,0.0003003303,0.00009223061,0.000002897182],"category_scores_gemma":[0.00003742882,0.0001701649,0.00003533148,0.001039904,0.0001459493,0.001202356,0.0001702356,0.0003015737,0.000008652123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000469461,"about_ca_system_score_gemma":0.0002749247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002621622,"about_ca_topic_score_gemma":0.000004023975,"domain_scores_codex":[0.9985114,0.0000490097,0.0006941014,0.0002369256,0.0002665991,0.000241945],"domain_scores_gemma":[0.999144,0.0001093266,0.0003202253,0.0002089772,0.0001451425,0.00007229237],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001154792,0.0002188116,0.003562161,0.00142249,0.00007316093,0.000005090476,0.04229613,0.02226601,0.001829025,0.422018,0.001636066,0.5045576],"study_design_scores_gemma":[0.0005665449,0.00006721738,0.0155195,0.0001096061,0.000007164478,0.000009774293,0.0003341114,0.973219,0.0009463436,0.00817747,0.0008755057,0.00016774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1147891,0.0001076047,0.8819544,0.001288294,0.0002383508,0.0002500404,0.00001147779,0.0001552925,0.001205349],"genre_scores_gemma":[0.9863954,0.000004500336,0.01308689,0.0004022132,0.00001949943,0.00002174361,0.00003840745,0.000004132976,0.00002722421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.950953,"threshold_uncertainty_score":0.6939123,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01329575248213749,"gpt":0.2399768659684489,"spread":0.2266811134863114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003420816,0.0001989486,0.0002040501,0.0001557998,0.0006145536,0.001149269,0.0005076802,0.00009116466,0.000008220997],"category_scores_gemma":[0.0001627968,0.0001817077,0.0001070549,0.0006530071,0.00003356976,0.003769567,0.0002047076,0.0001753362,0.00003248367],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005556152,"about_ca_system_score_gemma":0.0003451528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002736636,"about_ca_topic_score_gemma":0.000001210076,"domain_scores_codex":[0.9983952,0.00002249821,0.0005573276,0.0002436043,0.0003276931,0.0004536708],"domain_scores_gemma":[0.9987085,0.00007445494,0.000256271,0.0003192591,0.0005249804,0.0001165769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001406492,0.00008306032,0.0000609806,0.0004013439,0.00001763472,0.000007634747,0.006028288,0.003924585,0.0007978089,0.05043567,0.0008866044,0.9373423],"study_design_scores_gemma":[0.0005444303,0.0001091742,0.00006659656,0.0001051659,0.000006399765,0.0001595632,0.0002995434,0.9468528,0.006612523,0.00522249,0.03972038,0.0003009072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03483317,0.0001465865,0.9604753,0.001241518,0.0006091815,0.0001914775,0.000009383774,0.0003629022,0.002130505],"genre_scores_gemma":[0.8499064,0.000004736436,0.1477811,0.00193507,0.0001984423,0.0000377992,0.00006374185,0.00001456485,0.00005814589],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9429283,"threshold_uncertainty_score":0.9998876,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05114541861985054,"gpt":0.3287178893151219,"spread":0.2775724706952714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004008793,0.0001419061,0.0001479295,0.0002197455,0.0001241269,0.0001626274,0.00008094768,0.0001068666,0.000001671125],"category_scores_gemma":[0.000114249,0.0001409969,0.00004172166,0.0002432712,0.00003387109,0.001885407,0.00001417796,0.0001086766,0.00001206353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008896926,"about_ca_system_score_gemma":0.0000638717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007945134,"about_ca_topic_score_gemma":3.738152e-7,"domain_scores_codex":[0.9992222,0.00002267038,0.000350714,0.00008332875,0.0001203016,0.0002008443],"domain_scores_gemma":[0.9993145,0.0000248719,0.0001234236,0.0001141044,0.0003581211,0.00006497057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008885557,0.00001891218,0.00002926251,0.0004401257,0.00003524802,3.078807e-7,0.004817146,0.02087183,0.002477139,0.01188623,0.008122215,0.9512127],"study_design_scores_gemma":[0.0002908454,0.0000542266,0.00001123065,0.00007516784,0.00001369339,0.00003378493,0.001116641,0.9359068,0.02188557,0.01758889,0.02283476,0.0001883295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008598377,0.0001966793,0.9861315,0.00005180776,0.0007885204,0.0003377929,0.000003305657,0.001475934,0.00241605],"genre_scores_gemma":[0.8085799,0.00002030835,0.1909353,0.000102458,0.0001464817,0.0001198784,0.00005916851,0.00002752234,0.000008936981],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9510244,"threshold_uncertainty_score":0.5749688,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008996717977539228,"gpt":0.2279527607175369,"spread":0.2189560427399977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006794382,0.0001766966,0.0002438415,0.0003404994,0.0002416166,0.0002372884,0.0009370731,0.00008652797,0.00005307921],"category_scores_gemma":[0.000144092,0.0001269153,0.0001352867,0.001089094,0.0001765224,0.005195474,0.0001351507,0.0001298027,0.00004028567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002350245,"about_ca_system_score_gemma":0.0001455309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001260343,"about_ca_topic_score_gemma":0.000001005858,"domain_scores_codex":[0.9978712,0.00008678054,0.001064326,0.000126351,0.0006215477,0.0002298157],"domain_scores_gemma":[0.9974232,0.0001009908,0.0013358,0.0005246497,0.0005554914,0.00005988505],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002073101,0.00006770153,0.001983506,0.0005477308,0.00002357301,2.963125e-8,0.009834425,0.0007580726,0.000833964,0.8775343,0.002183125,0.1062129],"study_design_scores_gemma":[0.0005365051,0.00008773659,0.01084768,0.0001837411,0.00001642068,0.000005604948,0.001599502,0.9271098,0.01840958,0.0306337,0.01033379,0.0002359065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09973677,0.0001543532,0.8635266,0.001847036,0.0004560291,0.0004706121,0.00001511982,0.0003060321,0.03348747],"genre_scores_gemma":[0.9943404,0.00001665755,0.00514471,0.000400231,0.0000154848,0.00001633222,0.00002532709,0.000006044068,0.00003485089],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9263518,"threshold_uncertainty_score":0.5175456,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}